HDK
|
#include <UN_Iterator.h>
Public Types | |
using | iterator_category = std::input_iterator_tag |
using | value_type = UN_Node |
using | difference_type = std::ptrdiff_t |
using | pointer = value_type * |
using | reference = value_type & |
Public Member Functions | |
UN_NodeDescendantIterator (UN_GraphData *graph_data, UN_NodeID node_id) | |
Constructor for the start iterator of the given node ancestral tree. More... | |
UN_NodeDescendantIterator (UN_GraphData *graph_data) | |
Constructor for the end iterator. More... | |
UN_NodeDescendantIterator & | operator++ () |
Increment operator. More... | |
bool | operator!= (const UN_NodeDescendantIterator &other) const |
Comparison operator. More... | |
UN_Node | operator* () const |
Dereferencing operator, returns the handle to the current node data obj. More... | |
Iterator for traversing the node data objects that are arranged in a parental tree hierarchy. The iterator dereferences as a handle to node data object. Used for iterating connected nodes in nested subnetworks.
Definition at line 143 of file UN_Iterator.h.
using UN_NodeDescendantIterator::difference_type = std::ptrdiff_t |
Definition at line 148 of file UN_Iterator.h.
using UN_NodeDescendantIterator::iterator_category = std::input_iterator_tag |
Definition at line 146 of file UN_Iterator.h.
Definition at line 149 of file UN_Iterator.h.
Definition at line 150 of file UN_Iterator.h.
Definition at line 147 of file UN_Iterator.h.
|
inline |
Constructor for the start iterator of the given node ancestral tree.
Definition at line 153 of file UN_Iterator.h.
|
inline |
Constructor for the end iterator.
Definition at line 160 of file UN_Iterator.h.
|
inline |
Comparison operator.
Definition at line 173 of file UN_Iterator.h.
UN_Node UN_NodeDescendantIterator::operator* | ( | ) | const |
Dereferencing operator, returns the handle to the current node data obj.
|
inline |
Increment operator.
Definition at line 165 of file UN_Iterator.h.