FIM environment Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

• bracz::AbstractBuildTree
• bracz::AbstractBuildTree::buildtree_t
• bracz::AbstractBuildTree::node_t
• bracz::AbstractBuildTree::nodeiter_t
• bracz::AbstractBuildTree::nodeptr_t
• Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C >
• AprioriSelector< MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, LEAF_WC, CODER, F2F, SUPP_C, T_R, DF_D, NEE >
• AprioriSelector2< TRIE_OEL, TRIE_OI, LEAF_WC, T_R, DF_D, NEE >
• BadConversion
• BinaryDFOutput< WO >
• bracz::bnode_t
• BufferedOutput< FR >::params_t
• BufferedTransactionReader< T_R >
  • brBufferedTransactionReader< T_R >
  • LBufferedTransactionReader< T_R >
• BufferedTransactionReader< T_R >::params_t
• bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >
• CacheDFDecoder< FR >::params_t
• Bodon::prefix_array::CandidateGeneratorNoprune< DATASTRUCTURE, D, DUMMY >
• Bodon::vector_based::CandidateGeneratorNoprune< D, DUMMY >
• Bodon::inhomogeneous_trie::CandidateGeneratorPrune< P, DF_D, TRIE, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
• Bodon::CandidateGeneratorPrune< P, DF_D, TRIE, TRIE_ALLOCATOR, NEE >
• Bodon::dynamic_trie::CandidateGeneratorPrune< P, DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• Bodon::sequence::CandidateGeneratorPrune< P, DF_D, TRIE >
• Bodon::sequence::inhomogeneous_trie::CandidateGeneratorPrune< P, DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
• Bodon::vector_based::CandidateGeneratorSimplePrune< D, DUMMY >
• bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >
• bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >::fptree_t
• bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >::SinglePathIterator
• bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >
• bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >::fptree_t
• bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >::SinglePathIterator
• Coder< T_R, D >
• Coder< T_R, D >::params_t
• Counter
• DBCache< T_R >
  • DBCacheTransactionShrinker
• DBCacheTester
• DecoderBase< O >
  • SimpleDecoderBase< O >
    • SimpleDFDecoder< O >
    • SimpleNormalDecoder< O >
• DecoderOutputTester
• DFDecoderWithEEManagement< DF >
• DFDecoderWithEEManagement< DF >::EquisupportItemOutputIterator
• Dummy
• Eclat< TRANSACTION_READER, PATTERN_WRITER >
• Edge
• Bodon::Edgelist< VECTOR >
  • Bodon::OrderedEdgelist< VECTOR >
    • Bodon::OrderedEdgelistDynLookup< VECTOR, THRESHOLD >
• Edgelistbase
• Edgelistbase::iterator
• bracz::EndPatriciaBuildTree< ENDONLY >
• bracz::EndPatriciaBuildTree< ENDONLY >::buildtree_t
• bracz::EndPatriciaBuildTree< ENDONLY >::endnode_t
• bracz::EndPatriciaBuildTree< ENDONLY >::internalnode_t
• bracz::EndPatriciaBuildTree< ENDONLY >::storenode_t
  • bracz::EndPatriciaBuildTree< ENDONLY >::node_t
    • bracz::EndPatriciaBuildTree< ENDONLY >::nodeptr_t
      • bracz::EndPatriciaBuildTree< ENDONLY >::nodeiter_t
• FileReprBase
  • FDRepr
  • FILERepr
  • StreamRepr
    • OutputBase< StreamRepr >
      • BufferedOutput< StreamRepr >
        • BufferedNormalOutput< StreamRepr >
          • DecoderBase< BufferedNormalOutput< StreamRepr > >
            • SimpleDecoderBase< BufferedNormalOutput< StreamRepr > >
              • SimpleDFDecoder< BufferedNormalOutput< StreamRepr > >
                • SimpleAssocRuleWriter
      • SimpleOutput
    • TransactionReader< StreamRepr >
      • SimpleTransactionReader
• FileReprBase::params_t
• FirstLevel_to_String< First >
• FirstLevel_to_String< FLBuildAllL1Trees >
• FirstLevel_to_String< FLBuildSingleTree >
• FirstLevel_to_String< FLSimultProject >
• Formatter
• bracz::FPGrowthBase< STRUCTURE, OUTPUT >
  • bracz::FPGrowthBaseNoNEE< STRUCTURE, OUTPUT, SINGLEPATH, NEE, FIRSTLEVEL >
• bracz::FPGrowthBase< STRUCTURE, OUTPUT >::tdrecurse_t
• FPGrowthSelector< T_R, DF_D >
• FPGrowthSelector< T_R, DF_D >::Phase2< S_C, O_M, SINGLE, NEE >
• FR
  • DecoderBase< FR >
    • NotRealDecoder< FR >
    • SimpleDecoderBase< FR >
      • bracz::DFDecoderWrapper< FR >
  • OutputBase< FR >
    • bracz::NonOptDFOutput< FR >
    • BufferedOutput< FR >
      • BufferedNormalOutput< FR >
      • DecoderBase< BufferedOutput< FR > >
        • CacheDecoderBase< FR >
          • CacheDFDecoder< FR >
          • CacheNormalDecoder< FR >
        • SimpleDecoderBase< BufferedOutput< FR > >
          • SimpleBufferedDFDecoder< FR >
    • NoOutput< ISDFO, FR >
  • TransactionReader< FR >
• Frequent2Filter< IT_R >
• Frequent2FilterOnline< IT_R >
• FrequentFilter< IT_R >
• Bodon::vector_based::FrequentItemInserter< DATASTRUCTURE, D >
• Bodon::vector_based::FrequentPairInserterNoprune< D, DUMMY >
• Bodon::sequence::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
• Bodon::prefix_array::FrequentPairInserterNoprune< DATASTRUCTURE, D, DUMMY >
• GeneralSupportCounterInterface< DATA_STRUCTURE, TR, SC >
• Bodon::IndexVector
• Bodon::IndexVector::iterator
• Bodon::prefix_array::InfrequentRemover< DATASTRUCTURE, D, DUMMY >
• Bodon::vector_based::InfrequentRemover< D, DUMMY >
• Bodon::InnerNodeSpecific< EDGELIST >
  • Bodon::Trie< LEAF, EDGELIST >
• InputreaderTester
• itemvecCounterPair_less
• itemvector
• LeafRepresentationSelector< TRIE, LEAF_WC, LEAF_ALLOCATOR, T_R, DF_D >
• Bodon::LeafWithoutConstructor
  • Bodon::FattenableLeaf< VECTOR_SIZE >
  • Bodon::Leaf
• LightVector< TYPE >
• LightVector< TYPE >::const_iterator
• LightVector< TYPE >::iterator
• bracz::linmap< key, value >
• bracz::linmap< key, value >::iterator
• LStatOutput< OUTPUT >
• Bodon::ManipulatorBase< DF_D, TRIE >
  • Bodon::FrequentItemInserter< DF_D, TRIE, NEE >
  • Bodon::inhomogeneous_trie::ManipulatorBase< DF_D, TRIE, LEAF_ALLOCATOR >
    • Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >
      • Bodon::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
      • Bodon::inhomogeneous_trie::InfreqRemover_AssocRuleGen< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
    • Bodon::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE_Off, false >
      • Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
    • Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
    • Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
    • Bodon::sequence::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
    • Bodon::sequence::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
    • Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
      • Bodon::sequence::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
    • Bodon::sequence::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
    • Bodon::sequence::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
  • Bodon::inhomogeneous_trie::ManipulatorBase< DF_D, TRIE, TRIE_ALLOCATOR >
    • Bodon::trie::InfreqRemover< DF_D, TRIE, TRIE_ALLOCATOR, NEE >
    • Bodon::trie::SimplePruner< DF_D, TRIE, TRIE_ALLOCATOR, NEE >
  • Bodon::IntersectProPruner< DF_D, TRIE, NEE >
  • Bodon::sequence::CandidateGeneratorNoprune< DF_D, TRIE >
    • Bodon::sequence::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE >
  • Bodon::sequence::IntersectProPruner< DF_D, TRIE >
  • Bodon::sequence::SimplePruner< DF_D, TRIE >
  • Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >
    • Bodon::trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, NEE >
• Bodon::ManipulatorBase< DF_D, TRIE_OEL >
  • Bodon::dynamic_trie::FrequentItemInserter< DF_D, TRIE_OEL, NEE >
  • Bodon::inhomogeneous_trie::ManipulatorBase< DF_D, TRIE_OEL, LEAF_ALLOCATOR >
    • Bodon::dynamic_trie::CandidateGeneratorNoprune< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
      • Bodon::dynamic_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::dynamic_trie::FrequentPairInserter< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::dynamic_trie::FrequentPairInserterNoprune< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::dynamic_trie::InfreqRemover< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::dynamic_trie::IntersectProPruner< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
    • Bodon::dynamic_trie::SimplePruner< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• Bodon::MapRepr
• bracz::maxvector< T >
• maxvector< T >
• md5_ctx
• NEE_to_String< NEE >
• NEE_to_String< NEE_Full >
• NEE_to_String< NEE_Level1 >
• NEE_to_String< NEE_Off >
• NewWrapperAlloc< T >
• bracz::node_t
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::fptree_t
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::counterAddCombine
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >::iterator
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::simultprojnode_t
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::temptrie_t
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::TreeAnnotation
• bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::TreeCopy
• bracz::NonOrdFPStructure< INPUT, BUILDTREEALLOC, FIRSTLEVEL >
  • bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >
• bracz::nullTreeAnn
• Bodon::OffsetIndexVector< VECTOR >
• Bodon::OffsetIndexVector< VECTOR >::const_iterator
• Bodon::OffsetIndexVector< VECTOR >::iterator
• OneByOneSupportCounter< DATA_STRUCTURE, TR, SC >
• OneByOneSupportCounterANDTransactionFiltering< DATA_STRUCTURE, TR, SC >
• OrderedArrayDBCache< T_R, BIS >
• OrderedVectorDBCache< T_R, BIS >
• OrderReverser< T_R >
• PrefixArrayList< THRESHOLD >
  • PrefixArrayListDBCache< T_R, THRESHOLD >
• Bodon::RBTreeDBCache< T_R, BIS >
  • Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >
    • Bodon::RBTreeDBCacheInsertThenDestroyPro< T_R, BIS >
    • Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >
  • Bodon::RBTreeDBCacheSimultaneous< T_R, BIS >
• RoutingSelector< TRIE, LEAF_WC, LEAF_ALLOCATOR, T_R, DF_D >
• RoutingSelectorDouble< TRIE, LEAF_WC, LEAF_ALLOCATOR, T_R, DF_D >
• RoutingSelectorHybrid< TRIE_OEL, TRIE_OI, LEAF_WC, LEAF_ALLOCATOR, T_R, DF_D >
• RoutingSelectorOffset< TRIE, LEAF_WC, LEAF_ALLOCATOR, T_R, DF_D >
• SeqAprioriSelector< TRIE, LEAF, T_R, DF_D >
• SeqFrequent2Filter< IT_R >
• SeqFrequentFilter< IT_R >
• SimpleOutputTester
• SortedTransactionReader< T_R, UNIQUE, ASCENDING >
• SortOutput< O >
• SparseBitmatrix
• SparseBitvector
• SparseBitvector::const_iterator
• SparseBitvector::iterator
• StatCoder< CODER >
• StatInput< TR >
• StatOutput< OUTPUT, VERBOSE >
• StatOutput< OUTPUT, VERBOSE >::params_t
• Bodon::StatSupportCounterMerge< TRIE, THRESHOLD >
• Bodon::vector_based::SupportCounter< DATA_STRUCTURE >
• Bodon::prefix_array::SupportCounter< DATA_STRUCTURE >
• Bodon::dynamic_trie::SupportCounter< TRIE_OEL, TRIE_OI >
• Bodon::dynamic_trie::SupportCounterFilter< TRIE_OEL, TRIE_OI >
• Bodon::SupportCounterHybridSimple< TRIE, THRESHOLD >
• Bodon::SupportCounterInterface< MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE >
• SupportCounterInterface< DATA_STRUCTURE, TR, SC >
• Bodon::sequence::SupportCounterIterArray< TRIE >
• Bodon::SupportCounterLookupEdge< TRIE >
• Bodon::sequence::SupportCounterLookupEdge< TRIE >
• Bodon::sequence::SupportCounterLookupEdgeCommute< TRIE >
• Bodon::SupportCounterLookupEdgePrevMem< TRIE >
• Bodon::sequence::SupportCounterLookupSeq< TRIE >
• Bodon::SupportCounterLookupTrans< TRIE >
• Bodon::SupportCounterLookupTransLinBin< TRIE, THRESHOLD >
• Bodon::SupportCounterLookupTransOffsetBitVec< TRIE >
• Bodon::SupportCounterLookupTransOffsetIndex< TRIE >
• Bodon::sequence::SupportCounterMerge< TRIE >
• Bodon::SupportCounterMerge< TRIE >
• Bodon::sequence::SupportCounterMerge2< TRIE >
• Bodon::sequence::SupportCounterMerge< TRIE >::SeqFirstOcc
• Bodon::dynamic_trie::SupportCounterMergeTries< TRIE_OEL, TRIE_OI, PATRICIA >
• bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >::SinglePathIterator
• ThresholdSelector< VECTOR, T_R, DF_D >
• TransactionReader< FR >::params_t
• TrieBase< EDGELIST, DATA >
• TrieBase< EDGELIST, DATA >::iterator
• TrieBase< EDGELIST, counter_t >
  • TrieDBCache< T_R, EDGELIST >
• bracz::TrieBuildTree< ENDONLY >
• bracz::TrieBuildTree< ENDONLY >::buildtree_t
• bracz::TrieBuildTree< ENDONLY >::node_t
• bracz::TrieBuildTree< ENDONLY >::nodeptr_t
• Bodon::TrieNEE< TRIE >
• type_nonordfp_basic
• type_nonordfp_classicrebuild
• type_nonordfp_classicrebuild_alll1trees
• type_nonordfp_classictd
• type_nonordfp_classictd_alll1trees
• type_nonordfp_dense
• type_nonordfp_nsparse
• type_nonordfp_sparse
• VECTOR_OI
• VECTOR_OL
  • Bodon::Edgelist< VECTOR_OL >
    • Bodon::OrderedEdgelist< VECTOR_OL >
      • Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI >
• Bodon::sequence::WeightedSupportCounterLookupSeq< TRIE >

---