In file ../include/EST_StringTrie.h:

## class EST_StringTrie

> A string tree index class for indexing arbitrary objects by strings of characters.

### Public Methods

  | EST_StringTrie ()
  | EST_StringTrie (const EST_StringTrie &trie)
  | ~EST_StringTrie ()
  void | copy (const EST_StringTrie &trie)
  void* | lookup (const EST_String &key) const Find contents index by `key`, 0 if there is not contents
  void | add (const EST_String &key, void* item) Add `item` indexed by `key`, overwriting previous contents
  void | clear (void (*deletenode)(void* n)) Delete the tree, apply `deletenote` function to each `contents`Delete the tree
  EST_StringTrie& | operator = (const EST_StringTrie &a)

## Documentation

> 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(const EST_StringTrie &trie)`

`~EST_StringTrie()`

`void copy(const EST_StringTrie &trie)`

`void* lookup(const EST_String &key) const`
  Find contents index by `key`, 0 if there is not contents

`void add(const EST_String &key, void* item)`
  Add `item` indexed by `key`, overwriting previous contents

`void clear(void (*deletenode)(void* n))`
  Delete the tree, apply `deletenote` function to each `contents`Delete the tree

`EST_StringTrie& operator = (const EST_StringTrie &a)`

This class has no child classes.

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