Main Page | Namespace List | Class Hierarchy | Class List | Directories | File List | Namespace Members | Class Members | File Members
Bodon::FrequentItemInserter

Bodon::FrequentItemInserter< DF_D, TRIE, NEE > Class Template Reference

#include <FrequentItemInserter.hpp>

Inheritance diagram for Bodon::FrequentItemInserter< DF_D, TRIE, NEE >:

Inheritance graph
[legend]
Collaboration diagram for Bodon::FrequentItemInserter< DF_D, TRIE, NEE >:

Collaboration graph
[legend]
List of all members.

Public Member Functions

 FrequentItemInserter (TRIE &trie, DF_D &df_decoder)
void setEmptysetSupport (const counter_t emptyset_support)
 Sets the support of the emptyset.
void insertFrequentItems (const std::vector< counter_t > &freq_counters)
 Insert the frequent items and their counters into the data structure;.
bool isThereAnyCandidate () const

Protected Attributes

TRIE & main_trie
 Trie to store the candidates.
DF_D & df_decoder
 The depth-first decoder.

Private Types

typedef ManipulatorBase< DF_D,
TRIE > 		PARENT

Detailed Description

template<class DF_D, class TRIE, bool NEE>
class Bodon::FrequentItemInserter< DF_D, TRIE, NEE >

Definition at line 15 of file trie/trie_manipulators/FrequentItemInserter.hpp.

Member Typedef Documentation

template<class DF_D, class TRIE, bool NEE>
typedef ManipulatorBase<DF_D, TRIE> Bodon::FrequentItemInserter< DF_D, TRIE, NEE >::PARENT [private]
 

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

Constructor & Destructor Documentation

template<class DF_D, class TRIE, bool NEE>
Bodon::FrequentItemInserter< DF_D, TRIE, NEE >::FrequentItemInserter (  TRIE &  trie,
DF_D &  df_decoder
)  [inline]
 

Definition at line 20 of file trie/trie_manipulators/FrequentItemInserter.hpp.

Member Function Documentation

template<class DF_D, class TRIE, bool NEE>
void Bodon::FrequentItemInserter< DF_D, TRIE, NEE >::insertFrequentItems (  const std::vector< counter_t > &  freq_counters  )  [inline]
 

Insert the frequent items and their counters into the data structure;.

Definition at line 28 of file trie/trie_manipulators/FrequentItemInserter.hpp.

References Bodon::ManipulatorBase< DF_D, TRIE >::df_decoder, and Bodon::ManipulatorBase< DF_D, TRIE >::main_trie.

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.

template<class DF_D, class TRIE, bool NEE>
void Bodon::FrequentItemInserter< DF_D, TRIE, NEE >::setEmptysetSupport (  const counter_t  emptyset_support  )  [inline]
 

Sets the support of the emptyset.

Definition at line 24 of file trie/trie_manipulators/FrequentItemInserter.hpp.

References Bodon::ManipulatorBase< DF_D, TRIE >::main_trie.

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>
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:
Generated on Sun Sep 17 17:56:02 2006 for FIM environment by  doxygen 1.4.4