PropArray is similar to stl::map. It maintains a key value relationship. Keys are character strings. Value is the value provided in the template.
#include <arr.h>
Classes | |
| struct | DataElem |
Public Member Functions | |
| T * | addOrModify (const char *keyname, bool modifyfound=true) |
| T * | add (const char *keyname) |
| bool | remove (const char *keyname) |
| T * | get (const char *keyname) |
| T * | get (int pos) |
| const char * | getKey (int pos) |
| int | length () |
| bool | forEachSort (Iter< T > &iter) |
| bool | forEach (Iter< T > &iter) |
| void | clear () |
| T* jvar::PropArray< T >::add | ( | const char * | keyname | ) | [inline] |
Adds a new property
| keyname | Property key name |
| T* jvar::PropArray< T >::addOrModify | ( | const char * | keyname, |
| bool | modifyfound = true |
||
| ) | [inline] |
Adds or modifies a property and sets it value
| keyname | Property key name |
| modifyfound | Allow modification if found |
Referenced by jvar::PropArray< Variant >::add().
| void jvar::PropArray< T >::clear | ( | ) | [inline] |
Clears the property array
| bool jvar::PropArray< T >::forEach | ( | Iter< T > & | iter | ) | [inline] |
Returns an iterator to property elements in original order
| iter | Iterator |
| bool jvar::PropArray< T >::forEachSort | ( | Iter< T > & | iter | ) | [inline] |
Returns an iterator to property elements in sorted order
| iter | Iterator |
| T* jvar::PropArray< T >::get | ( | const char * | keyname | ) | [inline] |
Returns a property element
| keyname | Property key name |
| T* jvar::PropArray< T >::get | ( | int | pos | ) | [inline] |
Returns the element from a given position
| pos | Position |
| const char* jvar::PropArray< T >::getKey | ( | int | pos | ) | [inline] |
Returns the property key at position
| pos | Position |
| int jvar::PropArray< T >::length | ( | ) | [inline] |
Returns the length of the property array
| bool jvar::PropArray< T >::remove | ( | const char * | keyname | ) | [inline] |
Removes a property
| keyname | Property key name |