Class hierarchy Compound list Header files Member list
dimeDict Class Reference
The dimeDict class is internal / private. More...
#include <Dict.h>
List of all members.
Public Members
- dimeDict (const int entries = 17989)
- ~dimeDict ()
- void clear ()
- bool enter (const char * const key, char *&ptr, void *value)
- const char* enter (const char * const key, void *value)
- const char* find (const char * const key) const
- bool find (const char * const key, void *&value) const
- bool remove (const char * const key)
- void dump (void)
- void print_info ()
Detailed Description
The dimeDict class is internal / private.
It offers quick (hashing) lookup for strings.
Member Function Documentation
dimeDict::dimeDict(const int entries)
Constructor. Creates entries buckets.
dimeDict::~dimeDict()
Destructor.
void dimeDict::clear()
Clear all entries in the dictionary.
bool dimeDict::enter(const char * const key, char *&ptr, void *value)
Inserts a new string key in the dictionary. This function
returns true if the string was not already in the dictionary,
false otherwise. The string pointer is returned in ptr.
const char* dimeDict::enter(const char * const key, void *value)
Insert a new string key in the dictionary, and associates a
id (= value) to it. Returns a pointer
to the string. If the string is already in the dictionary, the
old id is replaced with value;
const char* dimeDict::find(const char * const key) const
Finds if key is in the dictionary. Returns the string pointer
if found, NULL otherwise.
bool dimeDict::find(const char * const key, void *&value) const
Finds if key is in the dictionary. Returns true if found.
bool dimeDict::remove(const char * const key)
Remove key from the dictionary.
The documentation for this class was generated from the following files: