• aligned : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject
• allocator : bracz::TrieBuildTree< ENDONLY >, bracz::linmap< key, value >
• B_T : FPGrowthSelector< T_R, DF_D >
• childmap_t : bracz::EndPatriciaBuildTree< ENDONLY >, bracz::TrieBuildTree< ENDONLY >
• const_iterator : SparseBitvector::const_iterator, LightVector< TYPE >::const_iterator, Bodon::OffsetIndexVector< VECTOR >::const_iterator, maxvector< T >, Bodon::InnerNodeSpecific< EDGELIST >
• D : DBCacheTester
• data_type : bracz::linmap< key, value >
• fptree_t : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::fptree_t, bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >, bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >, bracz::FPGrowthBase< STRUCTURE, OUTPUT >, bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >, bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >
• index_t : bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >, bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >
• iter_array_t : Bodon::sequence::SupportCounterIterArray< TRIE >
• iter_vector_t : Bodon::sequence::SupportCounterIterArray< TRIE >
• iterator : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >::iterator, SparseBitvector::iterator, LightVector< TYPE >::iterator, TrieBase< EDGELIST, DATA >::iterator, Edgelistbase::iterator, Bodon::OffsetIndexVector< VECTOR >::iterator, Bodon::IndexVector::iterator, bracz::linmap< key, value >::iterator, bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >, maxvector< T >, bracz::maxvector< T >, bracz::linmap< key, value >, Bodon::InnerNodeSpecific< EDGELIST >
• itpair_t : TrieBase< EDGELIST, DATA >::iterator
• key_type : bracz::linmap< key, value >
• LEAF : Bodon::SupportCounterMerge< TRIE >, Bodon::SupportCounterLookupTrans< TRIE >, Bodon::SupportCounterLookupEdge< TRIE >, Bodon::sequence::WeightedSupportCounterLookupSeq< TRIE >, Bodon::sequence::SupportCounterLookupSeq< TRIE >, Bodon::sequence::SupportCounterLookupEdge< TRIE >, Bodon::dynamic_trie::SupportCounterMergeTries< TRIE_OEL, TRIE_OI, PATRICIA >, Bodon::dynamic_trie::SupportCounterFilter< TRIE_OEL, TRIE_OI >, Bodon::dynamic_trie::SupportCounter< TRIE_OEL, TRIE_OI >
• myallocator_t : bracz::linmap< key, value >
• myitemlist_t : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject
• nodealloc_t : bracz::TrieBuildTree< ENDONLY >
• nodeiter_t : bracz::EndPatriciaBuildTree< ENDONLY >::nodeiter_t, bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >, bracz::TrieBuildTree< ENDONLY >
• nodeptr_t : bracz::EndPatriciaBuildTree< ENDONLY >::nodeptr_t, bracz::TrieBuildTree< ENDONLY >::nodeptr_t, bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >
• params_t : StatOutput< OUTPUT, VERBOSE >::params_t, BufferedOutput< FR >::params_t, TransactionReader< FR >::params_t, BufferedTransactionReader< T_R >::params_t, FileReprBase::params_t, CacheDFDecoder< FR >::params_t, Coder< T_R, D >::params_t, StreamRepr, OutputBase< FR >, SortOutput< O >, SimpleOutput, BufferedNormalOutput< FR >, NoOutput< ISDFO, FR >, bracz::NonOptDFOutput< FR >, BinaryDFOutput< WO >, SimpleAssocRuleWriter, StatInput< TR >, SortedTransactionReader< T_R, UNIQUE, ASCENDING >, OrderReverser< T_R >, LBufferedTransactionReader< T_R >, brBufferedTransactionReader< T_R >, FILERepr, FDRepr, TrieDBCache< T_R, EDGELIST >, Bodon::RBTreeDBCacheSimultaneous< T_R, BIS >, Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >, Bodon::RBTreeDBCacheInsertThenDestroyPro< T_R, BIS >, Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >, DBCacheTransactionShrinker, Bodon::RBTreeDBCache< T_R, BIS >, PrefixArrayListDBCache< T_R, THRESHOLD >, OrderedVectorDBCache< T_R, BIS >, OrderedArrayDBCache< T_R, BIS >, DBCache< T_R >, bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >, NotRealDecoder< FR >, SimpleNormalDecoder< O >, CacheNormalDecoder< FR >, SimpleDFDecoder< O >, SimpleBufferedDFDecoder< FR >, bracz::DFDecoderWrapper< FR >, DFDecoderWithEEManagement< DF >, DecoderBase< O >, CacheDecoderBase< FR >, StatCoder< CODER >
• PARENT : SimpleAssocRuleWriter, LBufferedTransactionReader< T_R >, SimpleNormalDecoder< O >, CacheNormalDecoder< FR >, SimpleBufferedDFDecoder< FR >, Bodon::OrderedEdgelistDynLookup< VECTOR, THRESHOLD >, Bodon::trie::SimplePruner< DF_D, TRIE, TRIE_ALLOCATOR, NEE >, Bodon::sequence::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::IntersectProPruner< DF_D, TRIE, NEE >, Bodon::trie::InfreqRemover< DF_D, TRIE, TRIE_ALLOCATOR, NEE >, Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::FrequentItemInserter< DF_D, TRIE, NEE >, Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >, Bodon::trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, NEE >, Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::sequence::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::sequence::inhomogeneous_trie::IntersectProPruner< 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::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::inhomogeneous_trie::InfreqRemover_AssocRuleGen< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::dynamic_trie::SimplePruner< 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::InfreqRemover< 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::FrequentPairInserter< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::dynamic_trie::FrequentItemInserter< DF_D, TRIE_OEL, NEE >, 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 >
• root_t : bracz::AbstractBuildTree
• SeqFirstOcc : Bodon::sequence::SupportCounterMerge< TRIE >::SeqFirstOcc, Bodon::sequence::SupportCounterMerge2< TRIE >
• tdrecurse_t : bracz::FPGrowthBaseNoNEE< STRUCTURE, OUTPUT, SINGLEPATH, NEE, FIRSTLEVEL >
• temptrie_t : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject
• treecontentalloc_t : bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >
• TRIE : TrieDBCache< T_R, EDGELIST >
• value_type : maxvector< T >, bracz::maxvector< T >, bracz::linmap< key, value >

---