Apriori(MAIN_DATA_STRUCTURE &data_structure, SEC_DATA_STRUCTURE &s_alloc, IR &infrequent_remover, C &coder, D &decoder, FII &fii) | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [inline] |
candidate_size | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [private] |
coder | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [private] |
data_structure | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [private] |
decoder | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [private] |
fii | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [private] |
findFrequentItemsets(const counter_t emptyset_support, std::vector< counter_t > &freq_counters, std::vector< std::pair< counter_t, std::pair< item_t, item_t > > > &freq_pairs_with_counters, const counter_t min_supp, unsigned int maxsize=largest_itemsetsize) | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | |
infrequent_remover | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [private] |
s_alloc | Apriori< C, D, MAIN_DATA_STRUCTURE, SEC_DATA_STRUCTURE, FII, FPI, CG, IR, SUPP_C > | [private] |