| Apriori_Trie(const unsigned long counter_of_emptyset) | Apriori_Trie | |
| candidate_generation(const itemtype &frequent_size, Input_Output_Manager &input_output_manager) | Apriori_Trie | |
| candidate_generation_assist(Trie *Trie, const itemtype distance_from_generator, set< itemtype > &maybe_candidate, Input_Output_Manager &input_output_manager) | Apriori_Trie | [protected] |
| candidate_generation_two() | Apriori_Trie | [protected] |
| delete_infrequent(const unsigned long min_occurrence, const itemtype candidate_size) | Apriori_Trie | |
| delete_infrequent_two(const unsigned long min_occurrence) | Apriori_Trie | [protected] |
| find_candidate(const vector< itemtype > &basket, const itemtype candidate_size, const unsigned long counter=1) | Apriori_Trie | |
| find_candidate_two(const vector< itemtype > &basket, const unsigned long counter=1) | Apriori_Trie | [protected] |
| insert_frequent_items(const vector< unsigned long > &counters) | Apriori_Trie | |
| is_all_subset_frequent(const set< itemtype > &maybe_candidate) const | Apriori_Trie | [protected] |
| is_there_any_candidate() const | Apriori_Trie | |
| main_trie | Apriori_Trie | [protected] |
| nr_of_freq_itemsets | Apriori_Trie | [protected] |
| statistics() const | Apriori_Trie | |
| temp_counter_array | Apriori_Trie | [protected] |
| ~Apriori_Trie() | Apriori_Trie |
1.3.5