Bodon::Trie< LEAF, EDGELIST > Class Template Reference

This struct represent an edge of a Trie. More...

#include <Trie.hpp>

Inheritance diagram for Bodon::Trie< LEAF, EDGELIST >:

[legend]Collaboration diagram for Bodon::Trie< LEAF, EDGELIST >:

[legend]List of all members.

Public Types
typedef EDGELIST::iterator	iterator
typedef EDGELIST::const_iterator	const_iterator
Public Member Functions
	Trie ()
	Trie (const counter_t counter)
bool	neeFind (item_t item) const
void	neePushBackSorted (const std::vector< item_t > &new_neelist)
void	neeAddSorted (const std::vector< item_t > &new_neelist)
void	neeInsertItem (const item_t new_item)
template<class CONTAINER>
const Trie *	isIncluded (const CONTAINER &an_itemset, typename CONTAINER::const_iterator item_it) const
bool	isThereAnyCandidate () const
size_t	edgeNumber ()
Public Attributes
EDGELIST	edgelist
Static Public Attributes
static std::vector< item_t >	neelist

---

Detailed Description

template<class LEAF, class EDGELIST>
class Bodon::Trie< LEAF, EDGELIST >

This struct represent an edge of a Trie.

An edge has a label, and an edge points to a subtrie.

Definition at line 30 of file Trie.hpp.

---

Member Typedef Documentation

template<class EDGELIST> typedef EDGELIST::const_iterator Bodon::InnerNodeSpecific< EDGELIST >::const_iterator [inherited]

Definition at line 20 of file InnerNodeSpecific.hpp.

template<class EDGELIST> typedef EDGELIST::iterator Bodon::InnerNodeSpecific< EDGELIST >::iterator [inherited]

Definition at line 19 of file InnerNodeSpecific.hpp.

---

Constructor & Destructor Documentation

template<class LEAF, class EDGELIST> Bodon::Trie< LEAF, EDGELIST >::Trie (   )  [inline]

Definition at line 34 of file Trie.hpp.

template<class LEAF, class EDGELIST> Bodon::Trie< LEAF, EDGELIST >::Trie (  const counter_t  counter  )  [inline]

Definition at line 35 of file Trie.hpp.

---

Member Function Documentation

template<class EDGELIST> size_t Bodon::InnerNodeSpecific< EDGELIST >::edgeNumber (   )  [inline, inherited]

Definition at line 32 of file InnerNodeSpecific.hpp. References Bodon::InnerNodeSpecific< EDGELIST >::edgelist.

template<class LEAF, class EDGELIST> template<class CONTAINER> const Trie< LEAF, EDGELIST > * Bodon::Trie< LEAF, EDGELIST >::isIncluded (  const CONTAINER &  an_itemset, typename CONTAINER::const_iterator  item_it )  const

Parameters: an_itemset  The given itemstd::set. item_it  This iterator shows the element of the basket that has to be processed. Returns: NULL, if the itemsset is not included, otherwise the trie, that represents the itemset. Definition at line 60 of file Trie.hpp. References Bodon::InnerNodeSpecific< EDGELIST >::edgelist, and Bodon::Trie< LEAF, EDGELIST >::isIncluded(). Referenced by Bodon::Trie< LEAF, EDGELIST >::isIncluded().

template<class EDGELIST> bool Bodon::InnerNodeSpecific< EDGELIST >::isThereAnyCandidate (   )  const [inline, inherited]

Definition at line 26 of file InnerNodeSpecific.hpp. References Bodon::InnerNodeSpecific< EDGELIST >::edgelist.

template<class LEAF, class EDGELIST> void Bodon::Trie< LEAF, EDGELIST >::neeAddSorted (  const std::vector< item_t > &  new_neelist  )  [inline]

Definition at line 42 of file Trie.hpp.

template<class LEAF, class EDGELIST> bool Bodon::Trie< LEAF, EDGELIST >::neeFind (  item_t  item  )  const [inline]

Definition at line 39 of file Trie.hpp.

template<class LEAF, class EDGELIST> void Bodon::Trie< LEAF, EDGELIST >::neeInsertItem (  const item_t  new_item  )  [inline]

Definition at line 43 of file Trie.hpp.

template<class LEAF, class EDGELIST> void Bodon::Trie< LEAF, EDGELIST >::neePushBackSorted (  const std::vector< item_t > &  new_neelist  )  [inline]

Definition at line 41 of file Trie.hpp.

---

Member Data Documentation

template<class EDGELIST> EDGELIST Bodon::InnerNodeSpecific< EDGELIST >::edgelist [inherited]

Definition at line 22 of file InnerNodeSpecific.hpp. Referenced by Bodon::InnerNodeSpecific< EDGELIST >::edgeNumber(), Bodon::Trie< LEAF, EDGELIST >::isIncluded(), and Bodon::InnerNodeSpecific< EDGELIST >::isThereAnyCandidate().

template<class LEAF, class EDGELIST> std::vector< item_t > Bodon::Trie< LEAF, EDGELIST >::neelist [static]

Definition at line 33 of file Trie.hpp.

---

The documentation for this class was generated from the following file:

• Trie.hpp

---