#include <linked.h>
Public Member Functions | |
NamedObject * | getNext (void) const |
Get next effective object when iterating. | |
char * | getId (void) const |
Get the named id string of this object. | |
virtual bool | compare (const char *name) const |
Compare the name of our object to see if equal. | |
bool | operator== (const char *name) const |
Comparison operator between our name and a string. | |
bool | operator!= (const char *name) const |
Comparison operator between our name and a string. | |
Static Public Member Functions | |
static void | purge (NamedObject **hash, unsigned size) |
Purge a hash indexed table of named objects. | |
static NamedObject ** | index (NamedObject **hash, unsigned size) |
Convert a hash index into a linear object pointer array. | |
static unsigned | count (NamedObject **hash, unsigned size) |
Count the total named objects in a hash table. | |
static NamedObject * | find (NamedObject *root, const char *name) |
Find a named object from a simple list. | |
static NamedObject * | map (NamedObject **hash, const char *name, unsigned size) |
Find a named object through a hash map table. | |
static NamedObject * | skip (NamedObject **hash, NamedObject *current, unsigned size) |
Iterate through a hash map table. | |
static unsigned | keyindex (const char *name, unsigned size) |
Internal function to convert a name to a hash index number. | |
static NamedObject ** | sort (NamedObject **list, size_t count=0) |
Sort an array of named objects in alphabetical order. | |
Protected Member Functions | |
NamedObject () | |
Create an empty unnamed cell object. | |
NamedObject (NamedObject **hash, char *name, unsigned size=1) | |
Create a named object and add to hash indexed list. | |
NamedObject (OrderedIndex *index, char *name) | |
Created a named object on an ordered list. | |
~NamedObject () | |
Destroy named object. | |
virtual void | clearId (void) |
The behavior of clearing id's can be overriden if they are not assigned as strdup's from the heap. | |
Protected Attributes | |
char * | id |
This class is used to help form named option lists and other forms of name indexed associative data structures. The id is assumed to be passed from a dupped or dynamically allocated string. If a constant string is used then you must not call delete for this object.
Named objects are either listed on an ordered list or keyed through an associate hash map table. When using a hash table, the name id string is used to determine the slot number to use in a list of n sized linked object lists. Hence, a hash index refers to a specific sized array of object indexes.
Definition at line 336 of file linked.h.
ucc::NamedObject::NamedObject | ( | NamedObject ** | hash, | |
char * | name, | |||
unsigned | size = 1 | |||
) | [protected] |
Create a named object and add to hash indexed list.
hash | map table to list node on. | |
name | of the object we are listing. | |
size | of hash map table used. |
ucc::NamedObject::NamedObject | ( | OrderedIndex * | index, | |
char * | name | |||
) | [protected] |
Created a named object on an ordered list.
This is commonly used to form attribute lists.
index | to list object on. | |
name | of the object we are listing. |
ucc::NamedObject::~NamedObject | ( | ) | [protected] |
Destroy named object.
We do not always destroy named objects, since we may use them in reusable pools or we may initialize a list that we keep permenantly. If we do invoke delete for something based on NamedObject, then be aware the object id is assumed to be formed from a dup'd string which will also be freed unless clearId is overriden.
virtual void ucc::NamedObject::clearId | ( | void | ) | [protected, virtual] |
The behavior of clearing id's can be overriden if they are not assigned as strdup's from the heap.
..
virtual bool ucc::NamedObject::compare | ( | const char * | name | ) | const [virtual] |
Compare the name of our object to see if equal.
This is a virtual so that it can be overriden when using named lists or hash lookups that must be case insensitive.
name | to compare our name to. |
static unsigned ucc::NamedObject::count | ( | NamedObject ** | hash, | |
unsigned | size | |||
) | [static] |
Count the total named objects in a hash table.
hash | map table of objects to index. | |
size | of hash map table used. |
static NamedObject* ucc::NamedObject::find | ( | NamedObject * | root, | |
const char * | name | |||
) | [static] |
Find a named object from a simple list.
This may also use the begin() member of an ordered index of named objects.
root | node of named object list. | |
name | of object to find. |
char* ucc::NamedObject::getId | ( | void | ) | const [inline] |
NamedObject* ucc::NamedObject::getNext | ( | void | ) | const [inline] |
Get next effective object when iterating.
Reimplemented from ucc::OrderedObject.
static NamedObject** ucc::NamedObject::index | ( | NamedObject ** | hash, | |
unsigned | size | |||
) | [static] |
static unsigned ucc::NamedObject::keyindex | ( | const char * | name, | |
unsigned | size | |||
) | [static] |
Internal function to convert a name to a hash index number.
name | to convert into index. | |
size | of map table. |
static NamedObject* ucc::NamedObject::map | ( | NamedObject ** | hash, | |
const char * | name, | |||
unsigned | size | |||
) | [static] |
Find a named object through a hash map table.
hash | map table of objects to search. | |
name | of object to find. | |
size | of hash map table. |
bool ucc::NamedObject::operator!= | ( | const char * | name | ) | const [inline] |
bool ucc::NamedObject::operator== | ( | const char * | name | ) | const [inline] |
static void ucc::NamedObject::purge | ( | NamedObject ** | hash, | |
unsigned | size | |||
) | [static] |
Purge a hash indexed table of named objects.
hash | map table to purge. | |
size | of hash map table used. |
static NamedObject* ucc::NamedObject::skip | ( | NamedObject ** | hash, | |
NamedObject * | current, | |||
unsigned | size | |||
) | [static] |
Iterate through a hash map table.
hash | map table to iterate. | |
current | named object we iterated or NULL to find start of list. | |
size | of map table. |
static NamedObject** ucc::NamedObject::sort | ( | NamedObject ** | list, | |
size_t | count = 0 | |||
) | [static] |