![]() |
Kale
|
#include <Tree.hpp>
Public Types | |
using | iterator_category = std::bidirectional_iterator_tag |
using | value_type = S |
using | pointer = S* |
using | reference = S& |
Public Member Functions | |
RawIterator (const Tree &tree, S *ptr=nullptr) | |
RawIterator< S > & | operator= (S *ptr) |
operator bool () const | |
bool | operator== (const RawIterator< S > it) const |
bool | operator!= (const RawIterator< S > it) const |
RawIterator< S > & | operator++ () |
RawIterator< S > & | operator-- () |
RawIterator< S > | operator++ (int) |
RawIterator< S > | operator-- (int) |
S & | operator* () |
const S & | operator* () const |
S * | operator-> () |
const S * | operator-> () const |
S * | getPtr () const |
const S * | getConstPtr () const |
Private Attributes | |
S * | ptr |
const Tree & | tree |
Custom iterator for iterating through trees. Attempts to iterate horizontally then vertically
S | The structure held within the iterator (either T or const T) |
using Kale::Tree< T >::RawIterator< S >::iterator_category = std::bidirectional_iterator_tag |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |