#include <CandGenInfreqRemoveNopruneMerge.hpp>
Inheritance diagram for Bodon::inhomogeneous_trie::CandGenInfreqRemoveNopruneMerge< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >:


| Public Member Functions | |
| CandGenInfreqRemoveNopruneMerge (TRIE &main_trie, DF_D &df_decoder, LEAF_ALLOCATOR &s_alloc) | |
| void | generateCandidate (unsigned int candidate_size) | 
| Generates candidates. | |
| void | deleteInfrequent (const counter_t min_supp, unsigned int candidate_size) | 
| void | afterWorkDel () | 
| void | afterWorkCandGen () | 
| bool | isThereAnyCandidate () const | 
| Protected Member Functions | |
| void | delete_infrequent_subtrie (TRIE *subtrie, const counter_t min_supp, unsigned int step_to_cand_par) | 
| Deletes the tries that represent infrequent itemstd::sets. | |
| void | delete_infrequent_subtrieNEE (TRIE *subtrie, const counter_t min_supp, std::vector< item_t > &NEEsum, unsigned int step_to_cand_par) | 
| void | generateCandidateAtParent (TRIE *trie) | 
| void | generateCandidateAtParentNEE (TRIE *trie, std::vector< item_t > &NEEsum) | 
| void | generateCandidateFindParent (TRIE *trie, unsigned int step_to_freq_par) | 
| Generates candidate of size more than two. | |
| void | generateCandidateFindParentNEE (TRIE *trie, std::vector< item_t > &NEEsum, unsigned int step_to_freq_par) | 
| Protected Attributes | |
| unsigned int | nr_of_deleted | 
| unsigned int | total_nr_of_deleted | 
| std::vector< Edge > | extenders | 
| unsigned int | nr_of_new_candidates | 
| unsigned int | nr_of_all_candidates | 
| std::vector< Edge > | replace_list | 
| LEAF_ALLOCATOR & | s_alloc | 
| TRIE & | main_trie | 
| Trie to store the candidates. | |
| DF_D & | df_decoder | 
| The depth-first decoder. | |
| Private Types | |
| typedef CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE > | PARENT | 
Definition at line 21 of file inhomogeneous_trie/trie_manipulators/CandGenInfreqRemoveNopruneMerge.hpp.
| 
 | |||||
| 
 Reimplemented from Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >. Definition at line 25 of file inhomogeneous_trie/trie_manipulators/CandGenInfreqRemoveNopruneMerge.hpp. | 
| 
 | ||||||||||||||||||||
| 
 Definition at line 30 of file inhomogeneous_trie/trie_manipulators/CandGenInfreqRemoveNopruneMerge.hpp. | 
| 
 | |||||||||
| 
 Definition at line 88 of file inhomogeneous_trie/trie_manipulators/CandidateGeneratorNoprune.hpp. | 
| 
 | |||||||||
| 
 | ||||||||||||||||||||
| 
 | ||||||||||||||||||||||||
| 
 | ||||||||||||||||
| 
 | ||||||||||
| Generates candidates. Generates candidates and writes frequent itemset that are obtained in the previous iteration to disk. Reimplemented from Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >. Definition at line 68 of file inhomogeneous_trie/trie_manipulators/CandGenInfreqRemoveNopruneMerge.hpp. References Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateFindParent(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::generateCandidateFindParentNEE(), Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::nr_of_all_candidates, and Bodon::inhomogeneous_trie::CandidateGeneratorNoprune< DF_D, TRIE, LEAF, LEAF_ALLOCATOR, NEE >::nr_of_new_candidates. | 
| 
 | ||||||||||
| 
 | ||||||||||||||||
| 
 | ||||||||||||||||
| 
 | ||||||||||||||||||||
| 
 | |||||||||
| 
 Definition at line 27 of file trie/trie_manipulators/ManipulatorBase.hpp. | 
| 
 | |||||
| 
 | |||||
| 
 | |||||
| 
 | |||||
| 
 | |||||
| 
 | |||||
| 
 | |||||
| 
 | |||||
| 
 | |||||
 1.4.4
 1.4.4