|
KiCad PCB EDA Suite
|
Iterator for traversing all data items in the tree. More...
#include <dynamic_rtree.h>
Classes | |
| struct | STACK_ENTRY |
Public Types | |
| using | iterator_category = std::forward_iterator_tag |
| using | value_type = DATATYPE |
| using | difference_type = ptrdiff_t |
| using | pointer = const DATATYPE* |
| using | reference = const DATATYPE& |
Public Member Functions | |
| Iterator () | |
| Iterator (NODE *aRoot) | |
| const DATATYPE & | operator* () const |
| const DATATYPE * | operator-> () const |
| Iterator & | operator++ () |
| bool | operator== (const Iterator &aOther) const |
| bool | operator!= (const Iterator &aOther) const |
Private Member Functions | |
| void | advance () |
Private Attributes | |
| std::vector< STACK_ENTRY > | m_stack |
| DATATYPE | m_current = {} |
| bool | m_atEnd = true |
Iterator for traversing all data items in the tree.
Definition at line 361 of file dynamic_rtree.h.
| using KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::Iterator::difference_type = ptrdiff_t |
Definition at line 366 of file dynamic_rtree.h.
| using KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::Iterator::iterator_category = std::forward_iterator_tag |
Definition at line 364 of file dynamic_rtree.h.
| using KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::Iterator::pointer = const DATATYPE* |
Definition at line 367 of file dynamic_rtree.h.
| using KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::Iterator::reference = const DATATYPE& |
Definition at line 368 of file dynamic_rtree.h.
| using KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::Iterator::value_type = DATATYPE |
Definition at line 365 of file dynamic_rtree.h.
|
inline |
Definition at line 370 of file dynamic_rtree.h.
References m_atEnd.
Referenced by operator!=(), operator++(), and operator==().
|
inlineexplicit |
Definition at line 372 of file dynamic_rtree.h.
References advance(), KIRTREE::RTREE_NODE< DATATYPE, ELEMTYPE, NUMDIMS, MAXNODES >::count, m_atEnd, and m_stack.
|
inlineprivate |
Definition at line 411 of file dynamic_rtree.h.
References m_atEnd, m_current, m_stack, and top().
Referenced by Iterator(), and operator++().
|
inline |
Definition at line 399 of file dynamic_rtree.h.
References Iterator().
|
inline |
Definition at line 385 of file dynamic_rtree.h.
References m_current.
|
inline |
Definition at line 388 of file dynamic_rtree.h.
References advance(), and Iterator().
|
inline |
Definition at line 386 of file dynamic_rtree.h.
References m_current.
|
inline |
Definition at line 394 of file dynamic_rtree.h.
References Iterator(), and m_atEnd.
|
private |
Definition at line 449 of file dynamic_rtree.h.
Referenced by advance(), Iterator(), Iterator(), and operator==().
|
private |
Definition at line 448 of file dynamic_rtree.h.
Referenced by advance(), operator*(), and operator->().
|
private |
Definition at line 447 of file dynamic_rtree.h.
Referenced by advance(), and Iterator().