In file ../include/EST_StringTrie.h:

## class EST_TrieNode

> An internal class for EST_StringTrie used to hold represent the node in an string index tree.

### Public Methods

  | 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
  void | add (const unsigned char* key, void* item) add `item` for `key` overwriting previous contents
  void | copy_into (EST_StringTrie &trie, const EST_String &path) const copy all entries in trie node into trie

## Documentation

> 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.

`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

`void add(const unsigned char* key, void* item)`
  add `item` for `key` overwriting previous contents

`void copy_into(EST_StringTrie &trie, const EST_String &path) const`
  copy all entries in trie node into trie

This class has no child classes.

Author:
  Alan W Black (awb@cstr.ed.ac.uk): June 1996

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