UCommon
|
A key value set is used for iterative access. More...
#include <keydata.h>
Data Fields | |
const char * | id |
const char * | value |
Friends | |
class | keydata |
class | keyfile |
Additional Inherited Members | |
![]() | |
void | delist (OrderedIndex *index) |
Remove our ordered object from an existing index. | |
virtual void | enlist (OrderedIndex *index) |
List our ordered object in default strategy mode. | |
void | enlistHead (OrderedIndex *index) |
List our ordered object at start of a linked list on an index. | |
void | enlistTail (OrderedIndex *index) |
List our ordered object at end of a linked list on an index. | |
OrderedObject * | getNext (void) const |
Get next ordered member when iterating. | |
![]() | |
void | delist (LinkedObject **root) |
Locate and remove ourselves from a list of objects. | |
void | enlist (LinkedObject **root) |
Add our object to an existing linked list through a pointer. | |
LinkedObject * | getNext (void) const |
Get next effective object when iterating. | |
bool | is_member (LinkedObject *list) const |
Search to see if we are a member of a specific list. | |
virtual void | release (void) |
Release list, mark as no longer linked. | |
virtual void | retain (void) |
Retain by marking as self referenced list. | |
![]() | |
ObjectProtocol * | copy (void) |
Retain (increase retention of) object when copying. | |
void | operator++ (void) |
Increase retention operator. | |
void | operator-- (void) |
Decrease retention operator. | |
virtual | ~ObjectProtocol () |
Required virtual destructor. | |
![]() | |
static unsigned | count (const LinkedObject *root) |
Count the number of linked objects in a list. | |
static LinkedObject * | getIndexed (LinkedObject *root, unsigned index) |
Get member by index. | |
static void | purge (LinkedObject *root) |
Release all objects from a list. | |
![]() | |
OrderedObject () | |
Construct an ordered object unattached. | |
OrderedObject (const OrderedObject &from) | |
OrderedObject (OrderedIndex *index) | |
Construct an ordered object aot end of a an index. | |
![]() | |
LinkedObject () | |
Construct base class unattached to anyone. | |
LinkedObject (const LinkedObject &from) | |
LinkedObject (LinkedObject **root) | |
Construct base class attached to a chain of objects. | |
![]() | |
LinkedObject * | Next |
A key value set is used for iterative access.
Otherwise this class is normally not used as we usually request the keys directly.