#include <include/EST_StringTrie.h>
Public Member Functions | |
EST_TrieNode () | |
EST_TrieNode (const int width) | |
~EST_TrieNode () | |
void * | lookup (const unsigned char *key) const |
Find the contents for given string, 0 if no current contents. More... | |
void | add (const unsigned char *key, void *item) |
add item for key overwriting previous contents More... | |
void | copy_into (EST_StringTrie &trie, const EST_String &path) const |
copy all entries in trie node into trie More... | |
An internal class for EST_StringTrie used to hold represent the node in an string index tree.
This basically represents a 128-branching node (on for each character) plus a contents field for strings ending at this point.
Definition at line 58 of file EST_StringTrie.h.
|
inline |
Definition at line 66 of file EST_StringTrie.h.
EST_TrieNode::EST_TrieNode | ( | const int | width | ) |
Definition at line 55 of file EST_StringTrie.cc.
EST_TrieNode::~EST_TrieNode | ( | ) |
Definition at line 64 of file EST_StringTrie.cc.
void * EST_TrieNode::lookup | ( | const unsigned char * | key | ) | const |
Find the contents for given string, 0 if no current contents.
Definition at line 75 of file EST_StringTrie.cc.
void EST_TrieNode::add | ( | const unsigned char * | key, |
void * | item | ||
) |
add item
for key
overwriting previous contents
Definition at line 111 of file EST_StringTrie.cc.
void EST_TrieNode::copy_into | ( | EST_StringTrie & | trie, |
const EST_String & | path | ||
) | const |
copy all entries in trie node into trie
Definition at line 91 of file EST_StringTrie.cc.