#include <FrequentPairInserter.hpp>
Inheritance diagram for Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >:
Public Member Functions | |
FrequentPairInserter (TRIE &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;. | |
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 |
LEAF_ALLOCATOR & | s_alloc |
TRIE & | main_trie |
Trie to store the candidates. | |
DF_D & | df_decoder |
The depth-first decoder. | |
Private Types | |
typedef inhomogeneous_trie::ManipulatorBase< DF_D, TRIE, LEAF_ALLOCATOR > | PARENT |
Definition at line 15 of file trie/trie_manipulators/FrequentPairInserter.hpp.
|
Definition at line 19 of file trie/trie_manipulators/FrequentPairInserter.hpp. |
|
Definition at line 24 of file trie/trie_manipulators/FrequentPairInserter.hpp. |
|
Insert the frequent itempairs and their counters into the data structure;.
Definition at line 30 of file trie/trie_manipulators/FrequentPairInserter.hpp. References Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE(), and Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNONEE(). |
|
|
|
Definition at line 27 of file trie/trie_manipulators/ManipulatorBase.hpp. |
|
|
|
|