Inheritance diagram for Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >:
|  | 
| 
 Public Member Functions | 
|  | InfreqRemoverOrderPresAssumption (TRIE &main_trie, DF_D &df_decoder, LEAF_ALLOCATOR &s_alloc) | 
| void | afterWorkDel () | 
| float | getOrderPreservingRatio (const int index) const | 
|  | InfreqRemover (TRIE &main_trie, DF_D &df_decoder, LEAF_ALLOCATOR &s_alloc) | 
| void | deleteInfrequent (const counter_t min_supp, unsigned int candidate_size) | 
|  | Deletes infrequent itemsets. 
 | 
| bool | isThereAnyCandidate () const | 
| 
 Protected Member Functions | 
| void | calculateOrderPresRatio (TRIE *trie1, std::vector< item_t > &itemset1) | 
| void | calculateOrderPresRatioAssist (const TRIE *trie1, TRIE *trie2, const std::vector< item_t > &itemset1, std::vector< item_t > &itemset2, std::vector< item_t > &intersection, std::vector< item_t > &diff_1, std::vector< item_t > &diff_2) | 
| void | delete_infrequent_subtrie (TRIE *subtrie, const counter_t min_supp, unsigned int step_to_cand_par) | 
|  | Deletes the tries that represent infrequent itemstd::sets. 
 | 
| void | delete_infrequent_subtrieNEE (TRIE *subtrie, const counter_t min_supp, std::vector< item_t > &NEEsum, unsigned int step_to_cand_par) | 
| void | destroy (TRIE *subtrie) | 
| void | destroyAndWriteNEE (TRIE *subtrie, std::vector< item_t > &NEEsum) | 
| 
 Protected Attributes | 
| std::vector< float > | alphas | 
| std::vector< unsigned int > | holds | 
| std::vector< unsigned int > | not_holds | 
| std::vector< Edge > | extenders | 
| unsigned int | nr_of_deleted | 
| unsigned int | total_nr_of_deleted | 
| LEAF_ALLOCATOR & | s_alloc | 
| TRIE & | main_trie | 
|  | Trie to store the candidates. 
 | 
| DF_D & | df_decoder | 
|  | The depth-first decoder. 
 | 
| 
 Private Types | 
| typedef InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR,
 NEE_Off, false >
 | PARENT |