recursive node iterator
More...
#include <recursive_node_iterator.hpp>
Iterator which recursively iterates over all subelements of a particular group. All relevant constructors are private. To construct an instance of this iterator use the two static factory functions begin() and end().
{
++iter;
}
[](const Node &node) { ...do something ... ; });
Unlike NodeIterator, RecursiveNodeIterator is a simple forward iterator.
◆ difference_type
◆ iterator_category
◆ pointer
◆ reference
◆ value_type
◆ RecursiveNodeIterator()
hdf5::node::RecursiveNodeIterator::RecursiveNodeIterator |
( |
| ) |
|
|
delete |
There is no default constructors -> would not make too much sense.
◆ begin()
Static factory function returning an instance of RecursiveForwardIterator on the first element of the top group.
- Parameters
-
current_group | the top level group where to start with recursive iteration |
- Returns
- instance of RecursiveNodeIterator
◆ end()
Static factory function returning an instance of RecursiveForwardIterator on the last+1 element of top group.
- Parameters
-
current_group | the top level group at which to start the recursive iteration. |
- Returns
- instance of RecursiveNodeIterator
◆ operator!=()
◆ operator*()
Node hdf5::node::RecursiveNodeIterator::operator* |
( |
| ) |
const |
Returns an instance of the actual node the iterator refers to.
- Returns
- instance of node::Node
◆ operator++() [1/2]
Advances to the next element in line.
- Returns
- reference to the udpated iterator
◆ operator++() [2/2]
Advances to the next element in line but returns an iterator to the previous element.
while(...)
{
Node n = *iter++;
std::cout<<n.link().path()<<std::endl;
}
- Returns
- instance of RecursiveNodeIterator
◆ operator->()
Node* hdf5::node::RecursiveNodeIterator::operator-> |
( |
| ) |
|
Returns the adress of the actual node in memory.
- Returns
- adress of current Node
◆ operator==()
The documentation for this class was generated from the following file: