The DepthFirstIterator struct allows to traverse the shape tree using a depth-first strategy.
More...
#include <ShapeList.h>
The DepthFirstIterator struct allows to traverse the shape tree using a depth-first strategy.
- Examples
- examples/traversal.cpp.
◆ DepthFirstIterator() [1/2]
LibBoard::ShapeList::DepthFirstIterator::DepthFirstIterator |
( |
| ) |
|
|
inline |
◆ DepthFirstIterator() [2/2]
LibBoard::ShapeList::DepthFirstIterator::DepthFirstIterator |
( |
ShapeList * |
list | ) |
|
|
inline |
◆ operator!=()
bool LibBoard::ShapeList::DepthFirstIterator::operator!= |
( |
const DepthFirstIterator & |
other | ) |
|
|
inline |
◆ operator*()
Shape & LibBoard::ShapeList::DepthFirstIterator::operator* |
( |
| ) |
|
|
inline |
◆ operator++() [1/2]
◆ operator++() [2/2]
◆ operator->()
Shape * LibBoard::ShapeList::DepthFirstIterator::operator-> |
( |
| ) |
|
|
inline |
◆ operator==()
bool LibBoard::ShapeList::DepthFirstIterator::operator== |
( |
const DepthFirstIterator & |
other | ) |
|
|
inline |
◆ pointer()
Shape * LibBoard::ShapeList::DepthFirstIterator::pointer |
( |
| ) |
|
|
inline |
The documentation for this struct was generated from the following files: