TrieBase< EDGELIST, DATA > Class Template Reference

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

#include <TrieBase.hpp>

Inheritance diagram for TrieBase< EDGELIST, DATA >:

[legend]Collaboration diagram for TrieBase< EDGELIST, DATA >:

[legend]List of all members.

Public Member Functions
	TrieBase ()
	TrieBase (DATA data)
iterator	begin ()
iterator	end ()
void	setData (DATA data)
DATA &	getData ()
void	addLeaf (const item_t label)
	Adds an empty state to the trie.
bool	isLeaf () const
template<class CONT>
bool	isIncluded (const CONT &itemset, typename CONT::const_iterator it) const
	It decides whether the part of the given itemset is included in the trie or not.
template<class CONT>
TrieBase &	addItemset (const CONT &itemset, typename CONT::const_iterator it)
Static Public Attributes
static DATA	def_data
Protected Attributes
DATA	data
EDGELIST	edgelist
Classes
class	iterator

---

Detailed Description

template<class EDGELIST, typename DATA = counter_t>
class TrieBase< EDGELIST, DATA >

This struct represent an edge of a TrieBase.

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

Definition at line 13 of file TrieBase.hpp.

---

Constructor & Destructor Documentation

template<class EDGELIST, typename DATA = counter_t> TrieBase< EDGELIST, DATA >::TrieBase (   )  [inline]

Definition at line 91 of file TrieBase.hpp. Referenced by TrieBase< EDGELIST, DATA >::addItemset(), and TrieBase< EDGELIST, counter_t >::addLeaf().

template<class EDGELIST, typename DATA = counter_t> TrieBase< EDGELIST, DATA >::TrieBase (  DATA  data  )  [inline]

Definition at line 92 of file TrieBase.hpp.

---

Member Function Documentation

template<class EDGELIST, typename DATA> template<class CONT> TrieBase< EDGELIST, DATA > & TrieBase< EDGELIST, DATA >::addItemset (  const CONT &  itemset, typename CONT::const_iterator  it )  [inline]

Definition at line 152 of file TrieBase.hpp. References TrieBase< EDGELIST, DATA >::edgelist, and TrieBase< EDGELIST, DATA >::TrieBase().

template<class EDGELIST, typename DATA = counter_t> void TrieBase< EDGELIST, DATA >::addLeaf (  const item_t  label  )  [inline]

Adds an empty state to the trie. Definition at line 104 of file TrieBase.hpp.

template<class EDGELIST, typename DATA = counter_t> iterator TrieBase< EDGELIST, DATA >::begin (   )  [inline]

Definition at line 93 of file TrieBase.hpp.

template<class EDGELIST, typename DATA = counter_t> iterator TrieBase< EDGELIST, DATA >::end (   )  [inline]

Definition at line 94 of file TrieBase.hpp.

template<class EDGELIST, typename DATA = counter_t> DATA& TrieBase< EDGELIST, DATA >::getData (   )  [inline]

Definition at line 99 of file TrieBase.hpp. Referenced by TrieDBCache< T_R, EDGELIST >::TrieDBCache().

template<class EDGELIST, typename DATA> template<class CONT> bool TrieBase< EDGELIST, DATA >::isIncluded (  const CONT &  itemset, typename CONT::const_iterator  it )  const [inline]

It decides whether the part of the given itemset is included in the trie or not. Parameters: itemset  The given itemset. it  This iterator shows the element of the basket that has to be processed. Returns: NULL, if the itemset is not included, otherwise the trie, that represents the itemset. Definition at line 136 of file TrieBase.hpp. References TrieBase< EDGELIST, DATA >::edgelist.

template<class EDGELIST, typename DATA = counter_t> bool TrieBase< EDGELIST, DATA >::isLeaf (   )  const [inline]

Definition at line 110 of file TrieBase.hpp.

template<class EDGELIST, typename DATA = counter_t> void TrieBase< EDGELIST, DATA >::setData (  DATA  data  )  [inline]

Definition at line 96 of file TrieBase.hpp.

---

Member Data Documentation

template<class EDGELIST, typename DATA = counter_t> DATA TrieBase< EDGELIST, DATA >::data [protected]

Definition at line 16 of file TrieBase.hpp. Referenced by TrieBase< EDGELIST, counter_t >::getData(), and TrieBase< EDGELIST, counter_t >::TrieBase().

template<class EDGELIST, typename DATA = counter_t> DATA TrieBase< EDGELIST, DATA >::def_data [static]

Definition at line 90 of file TrieBase.hpp. Referenced by TrieBase< EDGELIST, counter_t >::addLeaf(), and TrieBase< EDGELIST, counter_t >::TrieBase().

template<class EDGELIST, typename DATA = counter_t> EDGELIST TrieBase< EDGELIST, DATA >::edgelist [protected]

Definition at line 17 of file TrieBase.hpp. Referenced by TrieBase< EDGELIST, DATA >::addItemset(), TrieBase< EDGELIST, counter_t >::addLeaf(), TrieBase< EDGELIST, counter_t >::begin(), TrieBase< EDGELIST, DATA >::isIncluded(), and TrieBase< EDGELIST, counter_t >::isLeaf().

---

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

• TrieBase.hpp

---