 
 
	 
In file ../include/EST_StringTrie.h:
| class EST_StringTrie | 
A string tree index class for indexing arbitrary objects by strings of characters.
| ![[more]](icon1.gif)  | EST_StringTrie () | 
| ![[more]](icon1.gif)  | EST_StringTrie (const EST_StringTrie &trie) | 
| ![[more]](icon1.gif)  | ~EST_StringTrie () | 
| ![[more]](icon1.gif) void | copy (const EST_StringTrie &trie) | 
| ![[more]](icon1.gif) void* | lookup (const EST_String &key) const Find contents index by key, 0 if there is not contents | 
| ![[more]](icon1.gif) void | add (const EST_String &key, void* item) Add item indexed by key, overwriting previous contents | 
| ![[more]](icon1.gif) void | clear (void (*deletenode)(void* n)) Delete the tree, apply deletenote function to each contentsDelete the tree | 
| ![[more]](icon1.gif) EST_StringTrie& | operator =  (const EST_StringTrie &a) | 
A string tree index class for indexing arbitrary objects by strings of characters.Note this only deals with 7 but characters, and can only hold one item per index key.
 EST_StringTrie()
 EST_StringTrie()
 EST_StringTrie(const EST_StringTrie &trie)
 EST_StringTrie(const EST_StringTrie &trie)
 ~EST_StringTrie()
 ~EST_StringTrie()
 void copy(const EST_StringTrie &trie)
void copy(const EST_StringTrie &trie)
 void* lookup(const EST_String &key) const
void* lookup(const EST_String &key) const 
 void add(const EST_String &key, void* item)
void add(const EST_String &key, void* item)
 void clear(void (*deletenode)(void* n))
void clear(void (*deletenode)(void* n))
 EST_StringTrie& operator = (const EST_StringTrie &a)
EST_StringTrie& operator = (const EST_StringTrie &a)
Alphabetic index HTML hierarchy of classes or Java
 
This page is part of the 
Edinburgh Speech Tools Library documentation
Copyright  University of Edinburgh 1997
Contact:  
         speech_tools@cstr.ed.ac.uk