This class implements an iterator through a Value list.
More...
This class implements an iterator through a Value list.
When getting a new value you need to know how to iterate through it. The Value::Iterator will help you here:
*
Value *val = node->getValue();
* while( it.hasNext() ) {
* }
*
Value::Iterator::Iterator |
( |
| ) |
|
The default class constructor.
Value::Iterator::Iterator |
( |
Value * |
start | ) |
|
The class constructor with the start value.
- Parameters
-
start | [in] The first value for iteration, |
Value::Iterator::Iterator |
( |
const Iterator & |
rhs | ) |
|
Value::Iterator::~Iterator |
( |
| ) |
|
Value * Value::Iterator::getNext |
( |
| ) |
|
Returns the next item and moves the iterator to it.
- Returns
- The next value, is ddl_nullptr in case of being the last item.
bool Value::Iterator::hasNext |
( |
| ) |
const |
Will return true, if another value is in the list.
- Returns
- true if another value is there.
The post-increment operator.
The pre-increment operator.
Value * Value::Iterator::operator-> |
( |
| ) |
const |
The * operator.
- Returns
- The instance or ddl_nullptr if end of list is reached.
bool Value::Iterator::operator== |
( |
const Iterator & |
rhs | ) |
const |
The compare operator.
- Parameters
-
rhs | [in] The instance to compare. |
- Returns
- true if equal.
The documentation for this class was generated from the following files: