Here is a list of all class members with links to the classes they belong to:

- c -

• c : bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >::SinglePathIterator, bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >::SinglePathIterator
• cacheDatabase() : DBCacheTester
• CacheDecoderBase() : CacheDecoderBase< FR >
• CacheDFDecoder() : CacheDFDecoder< FR >
• CacheNormalDecoder() : CacheNormalDecoder< FR >
• calculateOrderPresRatio() : Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
• calculateOrderPresRatioAssist() : Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
• cand_trie : Bodon::dynamic_trie::SupportCounterMergeTries< TRIE_OEL, TRIE_OI, PATRICIA >
• CandGenInfreqRemoveNopruneMerge() : Bodon::sequence::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE >, Bodon::trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, NEE >, Bodon::sequence::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::dynamic_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• candidate_size : Bodon::RBTreeDBCacheSimultaneous< T_R, BIS >, Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >, Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C >
• CandidateGeneratorNoprune() : Bodon::vector_based::CandidateGeneratorNoprune< D, DUMMY >, Bodon::prefix_array::CandidateGeneratorNoprune< DATASTRUCTURE, D, DUMMY >, Bodon::sequence::CandidateGeneratorNoprune< DF_D, TRIE >, Bodon::trie::CandidateGeneratorNoprune< DF_D, TRIE, NEE >, Bodon::sequence::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::dynamic_trie::CandidateGeneratorNoprune< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• CandidateGeneratorPrune() : Bodon::sequence::CandidateGeneratorPrune< P, DF_D, TRIE >, Bodon::CandidateGeneratorPrune< P, DF_D, TRIE, TRIE_ALLOCATOR, NEE >, Bodon::sequence::inhomogeneous_trie::CandidateGeneratorPrune< P, DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::inhomogeneous_trie::CandidateGeneratorPrune< P, DF_D, TRIE, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::dynamic_trie::CandidateGeneratorPrune< P, DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• CandidateGeneratorSimplePrune() : Bodon::vector_based::CandidateGeneratorSimplePrune< D, DUMMY >
• candidates : Bodon::vector_based::InfrequentRemover< D, DUMMY >, Bodon::vector_based::FrequentPairInserterNoprune< D, DUMMY >, Bodon::vector_based::CandidateGeneratorSimplePrune< D, DUMMY >, Bodon::vector_based::CandidateGeneratorNoprune< D, DUMMY >, Bodon::prefix_array::InfrequentRemover< DATASTRUCTURE, D, DUMMY >, Bodon::prefix_array::FrequentPairInserterNoprune< DATASTRUCTURE, D, DUMMY >, Bodon::prefix_array::CandidateGeneratorNoprune< DATASTRUCTURE, D, DUMMY >
• capacities() : SparseBitmatrix
• capacity() : SparseBitvector, SparseBitmatrix, LightVector< TYPE >
• cfreq : bracz::FPGrowthBaseNoNEE< STRUCTURE, OUTPUT, SINGLEPATH, NEE, FIRSTLEVEL >
• checkSinglePath() : bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >, bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >, bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >, bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >
• checkUpToTwoRows() : Eclat< TRANSACTION_READER, PATTERN_WRITER >
• childmap_t : bracz::EndPatriciaBuildTree< ENDONLY >, bracz::TrieBuildTree< ENDONLY >
• children : bracz::EndPatriciaBuildTree< ENDONLY >::internalnode_t, bracz::TrieBuildTree< ENDONLY >::node_t
• childrenBegin() : bracz::EndPatriciaBuildTree< ENDONLY >::node_t, bracz::TrieBuildTree< ENDONLY >::node_t, bracz::AbstractBuildTree::node_t
• childrenEnd() : bracz::EndPatriciaBuildTree< ENDONLY >::node_t, bracz::TrieBuildTree< ENDONLY >::node_t, bracz::AbstractBuildTree::node_t
• ClassicFPStructure() : bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >
• ClassicRebuildFPStructure() : bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >
• clear() : bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >, bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >, bracz::EndPatriciaBuildTree< ENDONLY >::internalnode_t, LightVector< TYPE >, Bodon::OffsetIndexVector< VECTOR >, Bodon::IndexVector, Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI >, maxvector< T >, bracz::maxvector< T >, bracz::linmap< key, value >
• code : Coder< T_R, D >
• code_inverse : SimpleDecoderBase< O >, CacheDecoderBase< FR >
• codemode : Coder< T_R, D >::params_t
• Coder() : Coder< T_R, D >
• coder : Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C >
• combine() : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >, bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::counterAddCombine
• compactTree() : bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >
• compactTreeSparse() : bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >
• computeEmpiricalDensity() : SparseBitmatrix
• computeMaxRowLength() : SparseBitmatrix
• const_iterator : SparseBitvector::const_iterator, LightVector< TYPE >::const_iterator, Bodon::OffsetIndexVector< VECTOR >::const_iterator, maxvector< T >, Bodon::InnerNodeSpecific< EDGELIST >
• copyBuildTreeToFinalTree() : bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >
• counter : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::simultprojnode_t, bracz::bnode_t, bracz::node_t, bracz::EndPatriciaBuildTree< ENDONLY >::endnode_t, bracz::EndPatriciaBuildTree< ENDONLY >::internalnode_t, bracz::TrieBuildTree< ENDONLY >::node_t, Counter, Bodon::LeafWithoutConstructor
• Counter() : Counter
• counters : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::fptree_t
• counterToLeaf() : bracz::EndPatriciaBuildTree< ENDONLY >
• counterToNode() : bracz::EndPatriciaBuildTree< ENDONLY >
• countSupport() : SupportCounterInterface< DATA_STRUCTURE, TR, SC >, OneByOneSupportCounterANDTransactionFiltering< DATA_STRUCTURE, TR, SC >, OneByOneSupportCounter< DATA_STRUCTURE, TR, SC >, GeneralSupportCounterInterface< DATA_STRUCTURE, TR, SC >, Bodon::dynamic_trie::SupportCounterMergeTries< TRIE_OEL, TRIE_OI, PATRICIA >
• create() : LightVector< TYPE >
• curritem : bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >::SinglePathIterator
• curritemset : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject, bracz::FPGrowthBaseNoNEE< STRUCTURE, OUTPUT, SINGLEPATH, NEE, FIRSTLEVEL >
• curriters : bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >
• currtrans : bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >

---