Main Page | Namespace List | Class Hierarchy | Class List | Directories | File List | Namespace Members | Class Members | File Members

TrieDBCache< T_R, EDGELIST > Class Template Reference

#include <TrieDBCache.hpp>

Inheritance diagram for TrieDBCache< T_R, EDGELIST >:

Inheritance graph
[legend]
Collaboration diagram for TrieDBCache< T_R, EDGELIST >:

Collaboration graph
[legend]
List of all members.

Public Types

typedef T_R::params_t params_t

Public Member Functions

 TrieDBCache (const params_t *par)
template<class BIS>
counter_t nextTransactionBIS (BIS &transaction)
void rewind ()
 TrieBase ()
 TrieBase (counter_tdata)
iterator begin ()
iterator end ()
void setData (counter_tdata)
counter_tgetData ()
void addLeaf (const item_t label)
 Adds an empty state to the trie.
bool isLeaf () const
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.
TrieBaseaddItemset (const CONT &itemset, typename CONT::const_iterator it)

Static Public Attributes

static counter_t def_data

Protected Types

typedef TrieBase< EDGELIST,
counter_t
TRIE

Protected Attributes

TRIE::iterator it
counter_t data
EDGELIST edgelist

Detailed Description

template<class T_R, class EDGELIST>
class TrieDBCache< T_R, EDGELIST >

Definition at line 10 of file TrieDBCache.hpp.


Member Typedef Documentation

template<class T_R, class EDGELIST>
typedef T_R::params_t TrieDBCache< T_R, EDGELIST >::params_t
 

Definition at line 13 of file TrieDBCache.hpp.

template<class T_R, class EDGELIST>
typedef TrieBase<EDGELIST, counter_t> TrieDBCache< T_R, EDGELIST >::TRIE [protected]
 

Definition at line 27 of file TrieDBCache.hpp.


Constructor & Destructor Documentation

template<class T_R, class EDGELIST>
TrieDBCache< T_R, EDGELIST >::TrieDBCache const params_t par  )  [inline]
 

Definition at line 32 of file TrieDBCache.hpp.

References TrieBase< EDGELIST, counter_t >::addItemset(), and TrieBase< EDGELIST, DATA >::getData().


Member Function Documentation

TrieBase& TrieBase< EDGELIST , counter_t >::addItemset const CONT &  itemset,
typename CONT::const_iterator  it
[inherited]
 

Referenced by TrieDBCache< T_R, EDGELIST >::TrieDBCache().

void TrieBase< EDGELIST , counter_t >::addLeaf const item_t  label  )  [inline, inherited]
 

Adds an empty state to the trie.

Definition at line 104 of file TrieBase.hpp.

References TrieBase< EDGELIST, DATA >::def_data, TrieBase< EDGELIST, DATA >::edgelist, and TrieBase< EDGELIST, DATA >::TrieBase().

iterator TrieBase< EDGELIST , counter_t >::begin  )  [inline, inherited]
 

Definition at line 93 of file TrieBase.hpp.

References TrieBase< EDGELIST, DATA >::edgelist.

Referenced by TrieDBCache< T_R, EDGELIST >::rewind().

iterator TrieBase< EDGELIST , counter_t >::end  )  [inline, inherited]
 

Definition at line 94 of file TrieBase.hpp.

Referenced by TrieDBCache< T_R, EDGELIST >::nextTransactionBIS().

counter_t & TrieBase< EDGELIST , counter_t >::getData  )  [inline, inherited]
 

Definition at line 99 of file TrieBase.hpp.

References TrieBase< EDGELIST, DATA >::data.

bool TrieBase< EDGELIST , counter_t >::isIncluded const CONT &  itemset,
typename CONT::const_iterator  it
const [inherited]
 

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.

bool TrieBase< EDGELIST , counter_t >::isLeaf  )  const [inline, inherited]
 

Definition at line 110 of file TrieBase.hpp.

References TrieBase< EDGELIST, DATA >::edgelist.

template<class T_R, class EDGELIST>
template<class BIS>
counter_t TrieDBCache< T_R, EDGELIST >::nextTransactionBIS BIS &  transaction  )  [inline]
 

Definition at line 45 of file TrieDBCache.hpp.

References TrieBase< EDGELIST, counter_t >::end(), and TrieDBCache< T_R, EDGELIST >::it.

template<class T_R, class EDGELIST>
void TrieDBCache< T_R, EDGELIST >::rewind  )  [inline]
 

Definition at line 20 of file TrieDBCache.hpp.

References TrieBase< EDGELIST, counter_t >::begin(), and TrieDBCache< T_R, EDGELIST >::it.

void TrieBase< EDGELIST , counter_t >::setData counter_t   data  )  [inline, inherited]
 

Definition at line 96 of file TrieBase.hpp.

TrieBase< EDGELIST , counter_t >::TrieBase counter_t   data  )  [inline, inherited]
 

Definition at line 92 of file TrieBase.hpp.

TrieBase< EDGELIST , counter_t >::TrieBase  )  [inline, inherited]
 

Definition at line 91 of file TrieBase.hpp.

References TrieBase< EDGELIST, DATA >::data, and TrieBase< EDGELIST, DATA >::def_data.


Member Data Documentation

counter_t TrieBase< EDGELIST , counter_t >::data [protected, inherited]
 

Definition at line 16 of file TrieBase.hpp.

counter_t TrieBase< EDGELIST , counter_t >::def_data [static, inherited]
 

Definition at line 90 of file TrieBase.hpp.

EDGELIST TrieBase< EDGELIST , counter_t >::edgelist [protected, inherited]
 

Definition at line 17 of file TrieBase.hpp.

template<class T_R, class EDGELIST>
TRIE::iterator TrieDBCache< T_R, EDGELIST >::it [protected]
 

Definition at line 28 of file TrieDBCache.hpp.

Referenced by TrieDBCache< T_R, EDGELIST >::nextTransactionBIS(), and TrieDBCache< T_R, EDGELIST >::rewind().


The documentation for this class was generated from the following file:
Generated on Sun Sep 17 17:55:44 2006 for FIM environment by  doxygen 1.4.4