const_iterator typedef | Bodon::InnerNodeSpecific< EDGELIST > | |
edgelist | Bodon::InnerNodeSpecific< EDGELIST > | |
edgeNumber() | Bodon::InnerNodeSpecific< EDGELIST > | [inline] |
InnerNodeSpecific() | Bodon::InnerNodeSpecific< EDGELIST > | [inline] |
isIncluded(const CONTAINER &an_itemset, typename CONTAINER::const_iterator item_it) const | Bodon::Trie< LEAF, EDGELIST > | |
isThereAnyCandidate() const | Bodon::InnerNodeSpecific< EDGELIST > | [inline] |
iterator typedef | Bodon::InnerNodeSpecific< EDGELIST > | |
neeAddSorted(const std::vector< item_t > &new_neelist) | Bodon::Trie< LEAF, EDGELIST > | [inline] |
neeFind(item_t item) const | Bodon::Trie< LEAF, EDGELIST > | [inline] |
neeInsertItem(const item_t new_item) | Bodon::Trie< LEAF, EDGELIST > | [inline] |
neelist | Bodon::Trie< LEAF, EDGELIST > | [static] |
neePushBackSorted(const std::vector< item_t > &new_neelist) | Bodon::Trie< LEAF, EDGELIST > | [inline] |
Trie() | Bodon::Trie< LEAF, EDGELIST > | [inline] |
Trie(const counter_t counter) | Bodon::Trie< LEAF, EDGELIST > | [inline] |