Data Structures | Public Member Functions

Trie< T > Class Template Reference

#include <Trie.h>

Collaboration diagram for Trie< T >:
Collaboration graph
[legend]

Data Structures

class  Node

Public Member Functions

 Trie ()
bool Insert (const char *key, T *value, int rank, int key_len=-1)
T * Search (const char *key, int key_len=-1) const
void Clear ()
void Print ()
bool Empty () const
virtual ~Trie ()

Detailed Description

template<typename T>
class Trie< T >

Definition at line 35 of file Trie.h.


Constructor & Destructor Documentation

template<typename T>
Trie< T >::Trie (  )  [inline]

Definition at line 38 of file Trie.h.

template<typename T>
virtual Trie< T >::~Trie (  )  [inline, virtual]

Definition at line 54 of file Trie.h.


Member Function Documentation

template<typename T >
void Trie< T >::Clear (  ) 

Definition at line 210 of file Trie.h.

References Queue< C, L >::pop(), and T.

Referenced by Trie< SSLEntry >::~Trie().

template<typename T>
bool Trie< T >::Empty (  )  const [inline]

Definition at line 52 of file Trie.h.

Referenced by SSLContextStorage::lookup().

template<typename T>
bool Trie< T >::Insert ( const char *  key,
T *  value,
int  rank,
int  key_len = -1 
)

Definition at line 113 of file Trie.h.

References Debug, Queue< C, L >::enqueue(), and is_debug_tag_set.

Referenced by UrlMappingPathIndex::Insert(), and SSLContextStorage::insert().

template<typename T >
void Trie< T >::Print (  ) 

Definition at line 222 of file Trie.h.

References forl_LL, and T.

template<typename T >
T * Trie< T >::Search ( const char *  key,
int  key_len = -1 
) const

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