#include <SimplePruner.hpp>
Inheritance diagram for Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >:
Public Member Functions | |
SimplePruner (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 | |
int | helper_func (const TRIE *trie, const item_t new_item) const |
int | isAllSubsetFrequent (std::vector< item_t > &maybe_candidate, const item_t new_item) const |
Decides if all substd::set of an itemstd::set is contained in the SimplePruner. | |
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 |
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. |
Definition at line 20 of file inhomogeneous_trie/trie_manipulators/SimplePruner.hpp.
|
Definition at line 23 of file inhomogeneous_trie/trie_manipulators/SimplePruner.hpp. |
|
Definition at line 31 of file inhomogeneous_trie/trie_manipulators/SimplePruner.hpp. |
|
|
|
|
Definition at line 55 of file inhomogeneous_trie/trie_manipulators/SimplePruner.hpp. References NEE_Level1, and NEE_Off. Referenced by Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::isAllSubsetFrequent(). |
|
|
Definition at line 27 of file trie/trie_manipulators/ManipulatorBase.hpp. |
|
|
|
|
|
|
|