Inheritance diagram for Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >:
|
Public Member Functions |
| IntersectProPruner (TRIE &main_trie, DF_D &df_decoder, LEAF_ALLOCATOR &s_alloc) |
bool | isThereAnyCandidate () const |
Protected Types |
typedef ManipulatorBase< DF_D,
TRIE, LEAF_ALLOCATOR > | PARENT |
Protected Member Functions |
void | intersect (const TRIE *subset_trie) const |
void | intersectNEE (const TRIE *subset_trie) const |
void | filterNonExtenders (const std::vector< const TRIE * > &subset_tries, const item_t leaf_item) const |
void | filterNonExtendersNEE (const std::vector< const TRIE * > &subset_tries, const item_t leaf_item) const |
bool | findSubsetTries (std::vector< item_t > &itemset, std::vector< const TRIE * > &subset_trie) const |
void | generateCandidateAtParent (TRIE *trie, std::vector< item_t > &maybe_candidate) |
void | generateCandidateAtParentNEE (TRIE *trie, std::vector< item_t > &maybe_candidate, std::vector< item_t > &NEEsum) |
void | generateCandidateAtParentNEENoDeadend (TRIE *trie, std::vector< item_t > &maybe_candidate) |
Protected Attributes |
std::vector< Edge > | extenders |
std::vector< item_t > | ext_items |
std::vector< item_t > | leaf_neelist |
std::vector< Edge > | replace_list |
bool | is_there_any_new_candidate |
LEAF_ALLOCATOR & | s_alloc |
TRIE & | main_trie |
| Trie to store the candidates.
|
DF_D & | df_decoder |
| The depth-first decoder.
|