Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE > Class Template Reference

#include <FrequentPairInserterNoprune.hpp>

Inheritance diagram for Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >:

[legend]Collaboration diagram for Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >:

[legend]List of all members.

Public Member Functions
	FrequentPairInserterNoprune (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

---

Detailed Description

template<class DF_D, class TRIE, class LEAF, class LEAF_ALLOCATOR, bool NEE>
class Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >

Definition at line 14 of file trie/trie_manipulators/FrequentPairInserterNoprune.hpp.

---

Member Typedef Documentation

template<class DF_D, class TRIE, class LEAF, class LEAF_ALLOCATOR, bool NEE> typedef inhomogeneous_trie::ManipulatorBase<DF_D, TRIE, LEAF_ALLOCATOR> Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::PARENT [private]

Definition at line 18 of file trie/trie_manipulators/FrequentPairInserterNoprune.hpp.

---

Constructor & Destructor Documentation

template<class DF_D, class TRIE, class LEAF, class LEAF_ALLOCATOR, bool NEE> Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::FrequentPairInserterNoprune (  TRIE &  trie, DF_D &  df_decoder, LEAF_ALLOCATOR &  s_alloc )  [inline]

Definition at line 23 of file trie/trie_manipulators/FrequentPairInserterNoprune.hpp.

---

Member Function Documentation

template<class DF_D, class TRIE, class LEAF, class LEAF_ALLOCATOR, bool NEE> void Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairs (  const std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &  freq_pairs_with_counters  )  [inline]

Insert the frequent itempairs and their counters into the data structure;. Definition at line 29 of file trie/trie_manipulators/FrequentPairInserterNoprune.hpp. References Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE(), Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNONEE(), and NEE_Off.

template<class DF_D, class TRIE, class LEAF, class LEAF_ALLOCATOR, bool NEE> void Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNEE (  const std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &  freq_pairs_with_counters  )  [protected]

Definition at line 103 of file trie/trie_manipulators/FrequentPairInserterNoprune.hpp. References Bodon::ManipulatorBase< DF_D, TRIE >::df_decoder, Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::extenders, Bodon::ManipulatorBase< DF_D, TRIE >::main_trie, and Bodon::inhomogeneous_trie::ManipulatorBase< DF_D, TRIE, LEAF_ALLOCATOR >::s_alloc. Referenced by Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairs().

template<class DF_D, class TRIE, class LEAF, class LEAF_ALLOCATOR, bool NEE> void Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNONEE (  const std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &  freq_pairs_with_counters  )  [protected]

Definition at line 50 of file trie/trie_manipulators/FrequentPairInserterNoprune.hpp. References Bodon::ManipulatorBase< DF_D, TRIE >::df_decoder, Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::extenders, Bodon::ManipulatorBase< DF_D, TRIE >::main_trie, and Bodon::inhomogeneous_trie::ManipulatorBase< DF_D, TRIE, LEAF_ALLOCATOR >::s_alloc. Referenced by Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairs().

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, class LEAF, class LEAF_ALLOCATOR, bool NEE> std::vector<Edge> Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::extenders [protected]

Definition at line 20 of file trie/trie_manipulators/FrequentPairInserterNoprune.hpp. Referenced by Bodon::FrequentPairInserterNoprune< 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> 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().

template<class DF_D, class TRIE, class LEAF_ALLOCATOR> LEAF_ALLOCATOR& Bodon::inhomogeneous_trie::ManipulatorBase< DF_D, TRIE, LEAF_ALLOCATOR >::s_alloc [protected, inherited]

Definition at line 14 of file inhomogeneous_trie/trie_manipulators/ManipulatorBase.hpp. Referenced by Bodon::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::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::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::delete_infrequent_subtrieNEE(), Bodon::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::delete_infrequent_subtrieNEE(), 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::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::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >::generateCandidateAtParent(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateAtParent(), Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParentNEE(), Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParentNEE(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateAtParentNEE(), Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParentNEENoDeadend(), Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >::generateCandidateAtParentNEENoDeadend(), 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(), and Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::insertFrequentPairsNONEE().

---

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

• trie/trie_manipulators/FrequentPairInserterNoprune.hpp

---