Inheritance diagram for Bodon::dynamic_trie::FrequentPairInserter< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >:
|  | 
| 
 Public Member Functions | 
|  | FrequentPairInserter (TRIE_OEL &trie, DF_D &df_decoder, LEAF_ALLOCATOR &s_alloc) | 
| void | insertFrequentPairs (const std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &freq_pairs_with_counters) | 
|  | Insert the frequent itempairs and their counters into the data structure;. 
 | 
|  | ManipulatorBase (TRIE_OEL &main_trie, DF_D &df_decoder, LEAF_ALLOCATOR &s_alloc) | 
|  | ManipulatorBase (TRIE_OEL &main_trie, DF_D &df_decoder) | 
| bool | isThereAnyCandidate () const | 
| 
 Protected Member Functions | 
| void | insertFrequentPairsNONEE (const std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &freq_pairs_with_counters) | 
| void | insertFrequentPairsNEE (const std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &freq_pairs_with_counters) | 
| 
 Protected Attributes | 
| std::vector< Edge > | extenders | 
| std::vector< Edge > | replace_list | 
| LEAF_ALLOCATOR & | s_alloc | 
| TRIE_OEL & | main_trie | 
|  | Trie to store the candidates. 
 | 
| DF_D & | df_decoder | 
|  | The depth-first decoder. 
 | 
| 
 Private Types | 
| typedef Bodon::inhomogeneous_trie::ManipulatorBase< DF_D, TRIE_OEL, LEAF_ALLOCATOR >
 | PARENT |