 
 
	 
In file ../include/EST_THash.h:
| template<class K, class V> class EST_THash | 
An open hash table.
| ![[more]](icon1.gif)  | Pair Iteration 
 | ||||||||||||||||
| ![[more]](icon1.gif)  | Key Iteration 
 | 
| ![[more]](icon1.gif)  | EST_THash (int size, unsigned int (*hash_function)(const K &key, unsigned int size)= NULL) Create a table with the given number of buckets. | 
| ![[more]](icon1.gif)  | EST_THash (const EST_THash<K, V> &from) Create a copy | 
| ![[more]](icon1.gif)  | ~EST_THash (void) Destroy the table | 
| ![[more]](icon1.gif) void | clear (void) Empty the table | 
| ![[more]](icon1.gif) unsigned int | num_entries (void) const Return the total number of entries in the table | 
| ![[more]](icon1.gif) int | present (const K &key) const Does the key have an entry? | 
| ![[more]](icon1.gif) V& | val (const K &key, int &found) const Return the value associated with the key. | 
| ![[more]](icon1.gif) V& | val (const K &key) const Return the value associated with the key | 
| ![[more]](icon1.gif) void | copy (const EST_THash<K, V> &from) Copy all entries | 
| ![[more]](icon1.gif) void | map (void (*func)(K&, V&)) Apply <parameter>func</parameter> to each entry in the table | 
| ![[more]](icon1.gif) int | add_item (const K &key, const V &value, int no_search = 0) Add an entry to the table | 
| ![[more]](icon1.gif) int | remove_item (const K &rkey, int quiet = 0) Remove an entry from the table | 
| ![[more]](icon1.gif) EST_THash<K,V> & | operator =  (const EST_THash<K, V> &from) Assignment is a copy operation | 
| ![[more]](icon1.gif) void | dump (ostream &stream, int all=0) Print the table to <parameter>stream</parameter> in a human readable format | 
 static   unsigned int DefaultHash(const void* data, size_t size, unsigned int n)
static   unsigned int DefaultHash(const void* data, size_t size, unsigned int n)
 static   unsigned int StringHash(const EST_String &key, unsigned int size)
static   unsigned int StringHash(const EST_String &key, unsigned int size)
An open hash table. The number of buckets should be set to allow enough space that there are relatively few entries per bucket on average.
 EST_THash(int size, unsigned int (*hash_function)(const K &key, unsigned int size)= NULL)
 EST_THash(int size, unsigned int (*hash_function)(const K &key, unsigned int size)= NULL)
 EST_THash(const EST_THash<K, V> &from)
 EST_THash(const EST_THash<K, V> &from)
 ~EST_THash(void)
 ~EST_THash(void)
 void clear(void)
void clear(void)
 unsigned int num_entries(void) const
unsigned int num_entries(void) const 
 int present(const K &key) const
int present(const K &key) const 
 V& val(const K &key, int &found) const
V& val(const K &key, int &found) const 
 V& val(const K &key) const
V& val(const K &key) const 
 void copy(const EST_THash<K, V> &from)
void copy(const EST_THash<K, V> &from)
 void map(void (*func)(K&, V&))
void map(void (*func)(K&, V&))
 int add_item(const K &key, const V &value, int no_search = 0)
int add_item(const K &key, const V &value, int no_search = 0)
 int remove_item(const K &rkey, int quiet = 0)
int remove_item(const K &rkey, int quiet = 0)
 EST_THash<K,V> & operator = (const EST_THash<K, V> &from)
EST_THash<K,V> & operator = (const EST_THash<K, V> &from)
 void dump(ostream &stream, int all=0)
void dump(ostream &stream, int all=0)
 Pair Iteration
 Pair Iteration
 struct  IPointer_s
struct  IPointer_s
 void skip_blank(IPointer &ip) const
void skip_blank(IPointer &ip) const 
 void point_to_first(IPointer &ip) const
void point_to_first(IPointer &ip) const 
 void move_pointer_forwards(IPointer &ip) const
void move_pointer_forwards(IPointer &ip) const 
 bool points_to_something(const IPointer &ip) const
bool points_to_something(const IPointer &ip) const 
 EST_Hash_Pair<K, V> & points_at(const IPointer &ip)
EST_Hash_Pair<K, V> & points_at(const IPointer &ip)
 typedef  EST_Hash_Pair<K, V>  Entry
typedef  EST_Hash_Pair<K, V>  Entry
 typedef  EST_TStructIterator< EST_THash<K, V>, IPointer, EST_Hash_Pair<K, V> >  Entries
typedef  EST_TStructIterator< EST_THash<K, V>, IPointer, EST_Hash_Pair<K, V> >  Entries
 Key Iteration
 Key Iteration
 struct  IPointer_k_s
struct  IPointer_k_s
 void skip_blank(IPointer_k &ip) const
void skip_blank(IPointer_k &ip) const 
 void point_to_first(IPointer_k &ip) const
void point_to_first(IPointer_k &ip) const 
 void move_pointer_forwards(IPointer_k &ip) const
void move_pointer_forwards(IPointer_k &ip) const 
 bool points_to_something(const IPointer_k &ip) const
bool points_to_something(const IPointer_k &ip) const 
 K& points_at(const IPointer_k &ip)
K& points_at(const IPointer_k &ip)
 typedef  K KeyEntry
typedef  K KeyEntry
 typedef  EST_TIterator< EST_THash<K, V>, IPointer_k, K >  KeyEntries
typedef  EST_TIterator< EST_THash<K, V>, IPointer_k, K >  KeyEntries
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