Bodon::sequence::IntersectProPruner< DF_D, TRIE > Class Template Reference

#include <IntersectProPruner.hpp>

Inheritance diagram for Bodon::sequence::IntersectProPruner< DF_D, TRIE >:

[legend]Collaboration diagram for Bodon::sequence::IntersectProPruner< DF_D, TRIE >:

[legend]List of all members.

Public Member Functions
	IntersectProPruner (TRIE &main_trie, DF_D &df_decoder)
bool	isThereAnyCandidate () const
Protected Member Functions
void	intersect (const TRIE *subset_trie) const
void	filterNonExtenders (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)
Protected Attributes
std::vector< Edge >	extenders
std::vector< item_t >	ext_items
std::vector< item_t >	ext_nee
TRIE &	main_trie
	Trie to store the candidates.
DF_D &	df_decoder
	The depth-first decoder.

---

Detailed Description

template<class DF_D, class TRIE>
class Bodon::sequence::IntersectProPruner< DF_D, TRIE >

Definition at line 19 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp.

---

Constructor & Destructor Documentation

template<class DF_D, class TRIE> Bodon::sequence::IntersectProPruner< DF_D, TRIE >::IntersectProPruner (  TRIE &  main_trie, DF_D &  df_decoder )  [inline]

Definition at line 27 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp.

---

Member Function Documentation

template<class DF_D, class TRIE> void Bodon::sequence::IntersectProPruner< DF_D, TRIE >::filterNonExtenders (  const std::vector< const TRIE * > &  subset_tries, const item_t  leaf_item )  const [inline, protected]

Definition at line 72 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp. References Bodon::sequence::IntersectProPruner< DF_D, TRIE >::ext_items, and Bodon::sequence::IntersectProPruner< DF_D, TRIE >::intersect(). Referenced by Bodon::sequence::IntersectProPruner< DF_D, TRIE >::generateCandidateAtParent().

template<class DF_D, class TRIE> bool Bodon::sequence::IntersectProPruner< DF_D, TRIE >::findSubsetTries (  std::vector< item_t > &  itemset, std::vector< const TRIE * > &  subset_trie )  const [inline, protected]

Definition at line 101 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp. References Bodon::ManipulatorBase< DF_D, TRIE >::main_trie. Referenced by Bodon::sequence::IntersectProPruner< DF_D, TRIE >::generateCandidateAtParent().

template<class DF_D, class TRIE> void Bodon::sequence::IntersectProPruner< DF_D, TRIE >::generateCandidateAtParent (  TRIE *  trie, std::vector< item_t > &  maybe_candidate )  [inline, protected]

Definition at line 139 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp. References Bodon::ManipulatorBase< DF_D, TRIE >::df_decoder, Bodon::sequence::IntersectProPruner< DF_D, TRIE >::ext_items, Bodon::sequence::IntersectProPruner< DF_D, TRIE >::extenders, Bodon::sequence::IntersectProPruner< DF_D, TRIE >::filterNonExtenders(), and Bodon::sequence::IntersectProPruner< DF_D, TRIE >::findSubsetTries().

template<class DF_D, class TRIE> void Bodon::sequence::IntersectProPruner< DF_D, TRIE >::intersect (  const TRIE *  subset_trie  )  const [inline, protected]

Definition at line 50 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp. References Bodon::sequence::IntersectProPruner< DF_D, TRIE >::ext_items. Referenced by Bodon::sequence::IntersectProPruner< DF_D, TRIE >::filterNonExtenders().

template<class DF_D, class TRIE> bool Bodon::ManipulatorBase< DF_D, TRIE >::isThereAnyCandidate (   )  const [inline, inherited]

Definition at line 27 of file trie/trie_manipulators/ManipulatorBase.hpp.

---

Member Data Documentation

template<class DF_D, class TRIE> DF_D& Bodon::ManipulatorBase< DF_D, TRIE >::df_decoder [protected, inherited]

The depth-first decoder. Definition at line 21 of file trie/trie_manipulators/ManipulatorBase.hpp. Referenced by Bodon::sequence::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE >::delete_infrequent_subtrie(), Bodon::trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, NEE >::delete_infrequent_subtrie(), Bodon::sequence::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::delete_infrequent_subtrie(), Bodon::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::delete_infrequent_subtrie(), Bodon::trie::InfreqRemover< DF_D, TRIE, TRIE_ALLOCATOR, NEE >::delete_infrequent_subtrieNEE(), Bodon::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::delete_infrequent_subtrieNEE(), Bodon::trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, NEE >::delete_infrequent_subtrieNEE(), Bodon::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::delete_infrequent_subtrieNEE(), Bodon::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::destroyAndWriteNEE(), Bodon::trie::SimplePruner< DF_D, TRIE, TRIE_ALLOCATOR, NEE >::generateCandidateAtParent(), Bodon::sequence::SimplePruner< DF_D, TRIE >::generateCandidateAtParent(), Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParent(), Bodon::sequence::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::generateCandidateAtParent(), Bodon::sequence::IntersectProPruner< DF_D, TRIE >::generateCandidateAtParent(), Bodon::IntersectProPruner< DF_D, TRIE, NEE >::generateCandidateAtParent(), Bodon::sequence::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::generateCandidateAtParent(), Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParent(), Bodon::sequence::CandidateGeneratorNoprune< DF_D, TRIE >::generateCandidateAtParent(), Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >::generateCandidateAtParent(), Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::generateCandidateAtParent(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateAtParent(), Bodon::trie::SimplePruner< DF_D, TRIE, TRIE_ALLOCATOR, NEE >::generateCandidateAtParentNEE(), Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParentNEE(), Bodon::IntersectProPruner< DF_D, TRIE, NEE >::generateCandidateAtParentNEE(), Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParentNEE(), Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >::generateCandidateAtParentNEE(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateAtParentNEE(), Bodon::sequence::CandidateGeneratorNoprune< DF_D, TRIE >::generateCandidateFindParent(), Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >::generateCandidateFindParent(), Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::generateCandidateFindParent(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateFindParent(), Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >::generateCandidateFindParentNEE(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateFindParentNEE(), Bodon::FrequentItemInserter< DF_D, TRIE, NEE >::insertFrequentItems(), Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE(), Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE(), and Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNONEE().

template<class DF_D, class TRIE> std::vector<item_t> Bodon::sequence::IntersectProPruner< DF_D, TRIE >::ext_items [mutable, protected]

Definition at line 23 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp. Referenced by Bodon::sequence::IntersectProPruner< DF_D, TRIE >::filterNonExtenders(), Bodon::sequence::IntersectProPruner< DF_D, TRIE >::generateCandidateAtParent(), and Bodon::sequence::IntersectProPruner< DF_D, TRIE >::intersect().

template<class DF_D, class TRIE> std::vector<item_t> Bodon::sequence::IntersectProPruner< DF_D, TRIE >::ext_nee [mutable, protected]

Definition at line 24 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp.

template<class DF_D, class TRIE> std::vector<Edge> Bodon::sequence::IntersectProPruner< DF_D, TRIE >::extenders [protected]

Definition at line 22 of file trie/trie_manipulators/sequence/IntersectProPruner.hpp. Referenced by Bodon::sequence::IntersectProPruner< DF_D, TRIE >::generateCandidateAtParent().

template<class DF_D, class TRIE> TRIE& Bodon::ManipulatorBase< DF_D, TRIE >::main_trie [protected, inherited]

Trie to store the candidates. Definition at line 19 of file trie/trie_manipulators/ManipulatorBase.hpp. Referenced by Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::calculateOrderPresRatioAssist(), Bodon::sequence::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE >::deleteInfrequent(), Bodon::sequence::IntersectProPruner< DF_D, TRIE >::findSubsetTries(), Bodon::IntersectProPruner< DF_D, TRIE, NEE >::findSubsetTries(), Bodon::sequence::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::findSubsetTries(), Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::findSubsetTries(), Bodon::sequence::CandidateGeneratorNoprune< DF_D, TRIE >::generateCandidate(), Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >::generateCandidate(), Bodon::sequence::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE >::generateCandidate(), Bodon::FrequentItemInserter< DF_D, TRIE, NEE >::insertFrequentItems(), Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE(), Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE(), Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNONEE(), Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNONEE(), Bodon::trie::SimplePruner< DF_D, TRIE, TRIE_ALLOCATOR, NEE >::isAllSubsetFrequent(), Bodon::sequence::SimplePruner< DF_D, TRIE >::isAllSubsetFrequent(), Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::isAllSubsetFrequent(), Bodon::sequence::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::isAllSubsetFrequent(), Bodon::ManipulatorBase< DF_D, TRIE_OEL >::isThereAnyCandidate(), and Bodon::FrequentItemInserter< DF_D, TRIE, NEE >::setEmptysetSupport().

---

The documentation for this class was generated from the following file:

• trie/trie_manipulators/sequence/IntersectProPruner.hpp

---