recursive Link iterator
More...
#include <recursive_link_iterator.hpp>
Iterator which recursively iterates over all Links 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 Link &
link) { ...do something ... ; });
static RecursiveLinkIterator end(const Group ¤t_group)
create iterator to the last+1 element
static RecursiveLinkIterator begin(const Group ¤t_group)
create iterator to the first element
void link(const Node &target, const Group &link_base, const Path &link_path, const property::LinkCreationList &lcpl=property::LinkCreationList(), const property::LinkAccessList &lapl=property::LinkAccessList())
Create a soft or external link.
Unlike LinkIterator, RecursiveLinkIterator is a simple forward iterator.
◆ difference_type
◆ iterator_category
◆ pointer
◆ reference
◆ value_type
◆ RecursiveLinkIterator()
hdf5::node::RecursiveLinkIterator::RecursiveLinkIterator |
( |
| ) |
|
|
delete |
There is no default constructors -> would not make too much sense.
◆ begin()
Static factory function returning an instance of RecursiveLinkIterator on the first element of the top group.
- Parameters
-
current_group | the top level group where to start with recursive iteration |
- Returns
- instance of RecursiveLinkIterator
◆ end()
Static factory function returning an instance of RecursiveLinkIterator 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 RecursiveLinkIterator
◆ operator!=()
◆ operator*()
Link hdf5::node::RecursiveLinkIterator::operator* |
( |
| ) |
const |
◆ operator++() [1/2]
◆ operator++() [2/2]
◆ operator->()
Link* hdf5::node::RecursiveLinkIterator::operator-> |
( |
| ) |
|
◆ operator==()
The documentation for this class was generated from the following file: