- f -

• FattenableLeaf() : Bodon::FattenableLeaf< VECTOR_SIZE >
• FDRepr() : FDRepr
• FILERepr() : FILERepr
• FileReprBase() : FileReprBase
• filterMinimalRowLength() : SparseBitmatrix
• filterMinimalRowLength_destroyStructure() : SparseBitmatrix
• filterNonExtenders() : 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 >
• filterNonExtendersNEE() : Bodon::IntersectProPruner< DF_D, TRIE, NEE >, Bodon::inhomogeneous_trie::IntersectProPruner< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE, DEADENDPRUNE >
• find() : Bodon::OrderedEdgelistDynLookup< VECTOR, THRESHOLD >, Bodon::OrderedEdgelist< VECTOR >, Bodon::OffsetIndexVector< VECTOR >, Bodon::MapRepr, Bodon::IndexVector, Bodon::Edgelist< VECTOR >
• findBackward() : Bodon::OrderedEdgelist< VECTOR >
• findBackwardNoBoundaryCheck() : Bodon::OrderedEdgelist< VECTOR >
• findCandidates() : Bodon::SupportCounterMerge< TRIE >, Bodon::SupportCounterLookupTransLinBin< TRIE, THRESHOLD >, Bodon::SupportCounterLookupTrans< TRIE >, Bodon::SupportCounterLookupEdgePrevMem< TRIE >, Bodon::SupportCounterLookupEdge< TRIE >, Bodon::SupportCounterHybridSimple< TRIE, THRESHOLD >, Bodon::StatSupportCounterMerge< TRIE, THRESHOLD >, Bodon::sequence::WeightedSupportCounterLookupSeq< TRIE >, Bodon::sequence::SupportCounterMerge2< TRIE >, Bodon::sequence::SupportCounterMerge< TRIE >, Bodon::sequence::SupportCounterLookupSeq< TRIE >, Bodon::sequence::SupportCounterLookupEdgeCommute< TRIE >, Bodon::sequence::SupportCounterLookupEdge< TRIE >, Bodon::sequence::SupportCounterIterArray< TRIE >, Bodon::dynamic_trie::SupportCounterFilter< TRIE_OEL, TRIE_OI >, Bodon::dynamic_trie::SupportCounter< TRIE_OEL, TRIE_OI >
• findCandidatesAssist() : Bodon::SupportCounterLookupTransOffsetIndex< TRIE >, Bodon::SupportCounterLookupTransOffsetBitVec< TRIE >, Bodon::sequence::SupportCounterIterArray< TRIE >
• findCandidatesMerge() : Bodon::SupportCounterLookupTransLinBin< TRIE, THRESHOLD >
• findCandidatesSpecMerge() : Bodon::SupportCounterLookupTransLinBin< TRIE, THRESHOLD >
• findForward() : Bodon::OrderedEdgelist< VECTOR >
• findForwardNoBoundaryCheck() : Bodon::OrderedEdgelist< VECTOR >
• findFrequentItems() : SeqFrequentFilter< IT_R >, FrequentFilter< IT_R >, bracz::FPGrowthBaseNoNEE< STRUCTURE, OUTPUT, SINGLEPATH, NEE, FIRSTLEVEL >, bracz::FPGrowthBase< STRUCTURE, OUTPUT >
• findFrequentItemsets() : Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C >
• findFrequentPairs() : SeqFrequent2Filter< IT_R >, Frequent2FilterOnline< IT_R >, Frequent2Filter< IT_R >
• findFrequentPatterns() : Eclat< TRANSACTION_READER, PATTERN_WRITER >
• findOrCreate() : Bodon::OrderedEdgelistDynLookup< VECTOR, THRESHOLD >, Bodon::OrderedEdgelist< VECTOR >, Bodon::OffsetIndexVector< VECTOR >, Bodon::MapRepr, Bodon::IndexVector, Bodon::Edgelist< VECTOR >
• findSubsetTries() : 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 >
• flush() : StreamRepr, LStatOutput< OUTPUT >, FileReprBase, FILERepr, FDRepr
• FPGrowthBaseNoNEE() : bracz::FPGrowthBaseNoNEE< STRUCTURE, OUTPUT, SINGLEPATH, NEE, FIRSTLEVEL >
• FPGrowthSelector() : FPGrowthSelector< T_R, DF_D >
• 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 >
• free() : NewWrapperAlloc< T >
• freqRecurse() : bracz::FPGrowthBaseNoNEE< STRUCTURE, OUTPUT, SINGLEPATH, NEE, FIRSTLEVEL >
• Frequent2Filter() : Frequent2Filter< IT_R >
• Frequent2FilterOnline() : Frequent2FilterOnline< IT_R >
• FrequentFilter() : FrequentFilter< IT_R >
• FrequentItemInserter() : Bodon::vector_based::FrequentItemInserter< DATASTRUCTURE, D >, Bodon::FrequentItemInserter< DF_D, TRIE, NEE >, Bodon::dynamic_trie::FrequentItemInserter< DF_D, TRIE_OEL, NEE >
• FrequentPairInserter() : Bodon::FrequentPairInserter< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >, Bodon::dynamic_trie::FrequentPairInserter< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• FrequentPairInserterNoprune() : 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::sequence::FrequentPairInserterNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR >, Bodon::dynamic_trie::FrequentPairInserterNoprune< DF_D, TRIE_OEL, TRIE_OI, LEAF, LEAF_ALLOCATOR, NEE >
• front() : maxvector< T >

---