Iterates over the sub tree of fields in depth-first search order.
Definition at line 561 of file RFieldBase.hxx.
Classes | |
| struct | Position |
Public Types | |
| using | difference_type = std::ptrdiff_t |
| using | iterator = RSchemaIteratorTemplate<IsConstT> |
| using | iterator_category = std::forward_iterator_tag |
| using | pointer = std::conditional_t<IsConstT, const RFieldBase *, RFieldBase *> |
| using | reference = std::conditional_t<IsConstT, const RFieldBase &, RFieldBase &> |
| using | value_type = std::conditional_t<IsConstT, const RFieldBase, RFieldBase> |
Public Member Functions | |
| RSchemaIteratorTemplate () | |
| RSchemaIteratorTemplate (pointer val, int idxInParent) | |
| ~RSchemaIteratorTemplate () | |
| void | Advance () |
| Given that the iterator points to a valid field which is not the end iterator, go to the next field in depth-first search order. | |
| bool | operator!= (const iterator &rh) const |
| reference | operator* () const |
| iterator & | operator++ () |
| iterator | operator++ (int) |
| pointer | operator-> () const |
| bool | operator== (const iterator &rh) const |
Private Attributes | |
| std::vector< Position > | fStack |
| The stack of nodes visited when walking down the tree of fields. | |
#include <ROOT/RFieldBase.hxx>
| using ROOT::Experimental::RFieldBase::RSchemaIteratorTemplate< IsConstT >::difference_type = std::ptrdiff_t |
Definition at line 576 of file RFieldBase.hxx.
| using ROOT::Experimental::RFieldBase::RSchemaIteratorTemplate< IsConstT >::iterator = RSchemaIteratorTemplate<IsConstT> |
Definition at line 574 of file RFieldBase.hxx.
| using ROOT::Experimental::RFieldBase::RSchemaIteratorTemplate< IsConstT >::iterator_category = std::forward_iterator_tag |
Definition at line 575 of file RFieldBase.hxx.
| using ROOT::Experimental::RFieldBase::RSchemaIteratorTemplate< IsConstT >::pointer = std::conditional_t<IsConstT, const RFieldBase *, RFieldBase *> |
Definition at line 578 of file RFieldBase.hxx.
| using ROOT::Experimental::RFieldBase::RSchemaIteratorTemplate< IsConstT >::reference = std::conditional_t<IsConstT, const RFieldBase &, RFieldBase &> |
Definition at line 579 of file RFieldBase.hxx.
| using ROOT::Experimental::RFieldBase::RSchemaIteratorTemplate< IsConstT >::value_type = std::conditional_t<IsConstT, const RFieldBase, RFieldBase> |
Definition at line 577 of file RFieldBase.hxx.
|
inline |
Definition at line 581 of file RFieldBase.hxx.
|
inline |
Definition at line 582 of file RFieldBase.hxx.
|
inline |
Definition at line 583 of file RFieldBase.hxx.
|
inline |
Given that the iterator points to a valid field which is not the end iterator, go to the next field in depth-first search order.
Definition at line 586 of file RFieldBase.hxx.
|
inline |
Definition at line 622 of file RFieldBase.hxx.
|
inline |
Definition at line 619 of file RFieldBase.hxx.
|
inline |
Definition at line 614 of file RFieldBase.hxx.
|
inline |
Definition at line 608 of file RFieldBase.hxx.
|
inline |
Definition at line 620 of file RFieldBase.hxx.
|
inline |
Definition at line 621 of file RFieldBase.hxx.
|
private |
The stack of nodes visited when walking down the tree of fields.
Definition at line 571 of file RFieldBase.hxx.