#include <Trie_hash.hpp>
Inheritance diagram for Trie_hash:
Public Member Functions | |
Trie_hash (const itemtype child_threshold_in=5) | |
void | statistics () const |
Displays the memory need of the trie. | |
void | show_content () const |
Displays the trie. | |
Private Member Functions | |
void | from_hash_to_normal (const unsigned long state_index) |
Alters a node from hash table to normal node. | |
void | from_normal_to_hash (const unsigned long state_index) |
Alters a node from normal node to hash table. | |
void | delete_edge (const unsigned long to_state) |
Deletes the edge that goes to a given state. | |
void | max_path_set (const unsigned long state_index) |
Sets the maximal path value. | |
void | add_empty_state (const unsigned long from_state, const itemtype item, const unsigned long counter) |
Adds an empty state to the trie. | |
unsigned long | is_included (const set< itemtype > &an_itemset) const |
It decides whether the given itemset is included in the trie or not. | |
void | delete_infrequent_one (const unsigned long min_occurrence) |
Deletes the nodes that represent infrequent itemsets of size 1. | |
void | delete_infrequent_two (const unsigned long min_occurrence) |
Deletes the nodes that represent infrequent itemsets of size 2. | |
void | delete_infrequent_more (const unsigned long min_occurrence) |
Deletes the nodes that represent infrequent itemsets. | |
void | candidate_generation_assist (unsigned long actual_state, const itemtype distance_from_generator, set< itemtype > &maybe_candidate) |
Generates candidate of size more than two. | |
void | find_candidate_more (const vector< itemtype > &basket, const itemtype distance_from_candidate, vector< itemtype >::const_iterator it_basket, const unsigned long actual_state, const unsigned long counter=1) |
Increases the counter for those itemsets that is contained by the given basket. | |
void | assoc_rule_assist (ofstream &outcomefile, const double min_conf, unsigned long actual_state, set< itemtype > &consequence_part) const |
void | write_content_to_file_assist (ofstream &outcomefile, const unsigned long actual_state, const itemtype distance_from_frequent, set< itemtype > &frequent_itemset) const |
Writes out the content of the trie (frequent itemset and counters). | |
Private Attributes | |
vector< bool > | type_vector |
It stores the type of the nodes. | |
itemtype | child_threshold |
When the child number of a node is higher than child_threshold it is altered to hash table. | |
itemtype | hash_modulus |
The modulus of the hash table. |
|
|
|
Adds an empty state to the trie.
Reimplemented from Trie. |
|
Reimplemented from Trie. |
|
Generates candidate of size more than two.
Reimplemented from Trie. |
|
Deletes the edge that goes to a given state.
Reimplemented from Trie. |
|
Deletes the nodes that represent infrequent itemsets.
Reimplemented from Trie. |
|
Deletes the nodes that represent infrequent itemsets of size 1.
Reimplemented from Trie. |
|
Deletes the nodes that represent infrequent itemsets of size 2.
temp_counter_array[stateIndex_1-1] will never be used again! temp_counter_array will never be used again! Reimplemented from Trie. |
|
Increases the counter for those itemsets that is contained by the given basket.
Reimplemented from Trie. |
|
Alters a node from hash table to normal node.
|
|
Alters a node from normal node to hash table.
|
|
It decides whether the given itemset is included in the trie or not.
Reimplemented from Trie. |
|
Sets the maximal path value.
Reimplemented from Trie. |
|
Displays the trie.
Reimplemented from Trie. |
|
Displays the memory need of the trie.
Reimplemented from Trie. |
|
Writes out the content of the trie (frequent itemset and counters).
Reimplemented from Trie. |
|
When the child number of a node is higher than child_threshold it is altered to hash table.
|
|
The modulus of the hash table. Since hash tables have to be perfect the hash modulus equals the number of frequent items. |
|
It stores the type of the nodes. If type_vector[i] is true, the ith node is an original node, otherwise it is a hash table. |