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

- i -

• idx : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >::iterator, bracz::EndPatriciaBuildTree< ENDONLY >::node_t
• increaseCounter() : Bodon::LeafWithoutConstructor
• increment() : bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >::SinglePathIterator, bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >::SinglePathIterator, bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >::SinglePathIterator
• index() : SparseBitvector::const_iterator, SparseBitvector::iterator, LightVector< TYPE >::const_iterator, LightVector< TYPE >::iterator
• index_t : bracz::TDNonOrdFPStructure< INPUT, BUILDTREEALLOC, SINGLE, TD, PROJECT, PROJECTDELETECLOSED, PROJMERGENODES, FIRSTLEVEL, SPARSEAGGR >, bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >
• IndexVector : Bodon::IndexVector, Bodon::IndexVector::iterator
• InfreqRemover() : Bodon::trie::InfreqRemover< DF_D, TRIE, TRIE_ALLOCATOR, NEE >, Bodon::inhomogeneous_trie::InfreqRemover< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::dynamic_trie::InfreqRemover< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• InfreqRemover_AssocRuleGen() : Bodon::inhomogeneous_trie::InfreqRemover_AssocRuleGen< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
• InfreqRemoverOrderPresAssumption() : Bodon::inhomogeneous_trie::InfreqRemoverOrderPresAssumption< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >
• infrequent_remover : Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C >
• InfrequentRemover() : Bodon::vector_based::InfrequentRemover< D, DUMMY >, Bodon::prefix_array::InfrequentRemover< DATASTRUCTURE, D, DUMMY >
• init() : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >
• initBuildTree() : bracz::EndPatriciaBuildTree< ENDONLY >, bracz::TrieBuildTree< ENDONLY >, bracz::AbstractBuildTree
• initTree() : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::TreeAnnotation, bracz::nullTreeAnn
• inittree() : bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >
• InnerNodeSpecific() : Bodon::InnerNodeSpecific< EDGELIST >
• inp : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >, bracz::ClassicRebuildFPStructure< INPUT, FIRSTLEVEL, SINGLE >, bracz::ClassicFPStructure< INPUT, BUILDTREE, FIRSTLEVEL, TD, SINGLE >
• input_stream : StreamRepr
• insert() : Bodon::RBTreeDBCache< T_R, BIS >, bracz::BuildTreeDBCache< T_R, BIS, BuildTree, ENDONLY, SORT_NEEDED >, Bodon::OffsetIndexVector< VECTOR >, Bodon::MapRepr, Bodon::IndexVector, Bodon::Edgelist< VECTOR >, Bodon::DoubleRepr< VECTOR_OL, VECTOR_OI >
• insertFrequentItems() : Bodon::vector_based::FrequentItemInserter< DATASTRUCTURE, D >, Bodon::FrequentItemInserter< DF_D, TRIE, NEE >, Bodon::dynamic_trie::FrequentItemInserter< DF_D, TRIE_OEL, NEE >
• insertFrequentPairs() : Bodon::vector_based::FrequentPairInserterNoprune< D, DUMMY >, Bodon::prefix_array::FrequentPairInserterNoprune< DATASTRUCTURE, D, DUMMY >, Bodon::sequence::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::sequence::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, 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 >
• insertFrequentPairsNEE() : Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::FrequentPairInserter< DF_D, TRIE, 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 >
• insertFrequentPairsNONEE() : Bodon::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::FrequentPairInserter< DF_D, TRIE, 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 >
• internal_node_allocsize : bracz::EndPatriciaBuildTree< ENDONLY >
• intersect() : Bodon::sequence::IntersectProPruner< DF_D, TRIE >, Bodon::IntersectProPruner< DF_D, TRIE, NEE >, Bodon::sequence::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::dynamic_trie::IntersectProPruner< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• intersectNEE() : Bodon::IntersectProPruner< DF_D, TRIE, NEE >, Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::dynamic_trie::IntersectProPruner< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• IntersectProPruner() : Bodon::sequence::IntersectProPruner< DF_D, TRIE >, Bodon::IntersectProPruner< DF_D, TRIE, NEE >, Bodon::sequence::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::dynamic_trie::IntersectProPruner< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• IntToStringBack() : Formatter
• IntToStringFront() : Formatter
• is_there_any_new_candidate : Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
• isAllSubsetFrequent() : Bodon::trie::SimplePruner< DF_D, TRIE, TRIE_ALLOCATOR, NEE >, Bodon::sequence::SimplePruner< DF_D, TRIE >, Bodon::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >, Bodon::sequence::inhomogeneous_trie::SimplePruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::dynamic_trie::SimplePruner< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• isContained() : itemvector
• isDFO() : OutputBase< FR >, SimpleOutput, BufferedNormalOutput< FR >, NoOutput< ISDFO, FR >, bracz::NonOptDFOutput< FR >, BinaryDFOutput< WO >, SimpleNormalDecoder< O >, CacheNormalDecoder< FR >, SimpleDFDecoder< O >, SimpleBufferedDFDecoder< FR >, bracz::DFDecoderWrapper< FR >, CacheDFDecoder< FR >
• isEndIter() : bracz::EndPatriciaBuildTree< ENDONLY >::nodeiter_t
• isIncluded() : TrieBase< EDGELIST, DATA >, Bodon::TrieNEE< TRIE >, Bodon::Trie< LEAF, EDGELIST >, 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 >
• isLeaf() : bracz::EndPatriciaBuildTree< ENDONLY >::storenode_t, bracz::EndPatriciaBuildTree< ENDONLY >, TrieBase< EDGELIST, DATA >
• isLookupPreferred() : Bodon::MapRepr, Bodon::IndexVector
• isMapIter() : bracz::EndPatriciaBuildTree< ENDONLY >::nodeiter_t
• isThereAnyCandidate() : Bodon::vector_based::CandidateGeneratorSimplePrune< D, DUMMY >, Bodon::vector_based::CandidateGeneratorNoprune< D, DUMMY >, Bodon::prefix_array::CandidateGeneratorNoprune< DATASTRUCTURE, D, DUMMY >, Bodon::ManipulatorBase< DF_D, TRIE >, Bodon::InnerNodeSpecific< EDGELIST >, Bodon::inhomogeneous_trie::CandidateGeneratorPrune< P, DF_D, TRIE, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
• it : TrieDBCache< T_R, EDGELIST >, Bodon::RBTreeDBCache< T_R, BIS >, OrderedVectorDBCache< T_R, BIS >, OrderedArrayDBCache< T_R, BIS >, Bodon::OffsetIndexVector< VECTOR >::const_iterator, Bodon::OffsetIndexVector< VECTOR >::iterator, Bodon::IndexVector::iterator
• it_r : SeqFrequentFilter< IT_R >, SeqFrequent2Filter< IT_R >, FrequentFilter< IT_R >, Frequent2FilterOnline< IT_R >, Frequent2Filter< IT_R >
• it_v : OrderedArrayDBCache< T_R, BIS >
• item : bracz::bnode_t, bracz::node_t
• itemlist : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >
• itemlist_t() : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject::itemlist_t< T, CombineFn >
• itemlists : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::SimultProject
• items : StatInput< TR >
• itemset : TrieBase< EDGELIST, DATA >::iterator
• ItemsetToStringBack() : Formatter
• itemstarts : bracz::NonOrdFPStructure< INPUT, BUILDTREE, FIRSTLEVEL >::fptree_t
• 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

---