Herwig 7.3.0
|
#include <binary_tree.h>
Public Types | |
type definitions for iterator traits | |
typedef std::bidirectional_iterator_tag | iterator_category |
define the iterator category | |
typedef int | difference_type |
define the difference type | |
typedef const Value | value_type |
define the value type | |
typedef const value_type & | reference |
define the reference type | |
typedef const value_type * | pointer |
define the pointer type | |
Public Member Functions | |
constructors | |
const_iterator () | |
default constructor | |
const_iterator (const binary_tree *p, std::size_t end=0) | |
constructor taking pointee | |
const_iterator (const iterator &x) | |
conversion from iterator | |
comparisons | |
bool | operator== (const const_iterator &x) const |
comparison | |
bool | operator!= (const const_iterator &x) const |
comparison | |
dereference and indirection | |
reference | operator* () const |
dereference | |
pointer | operator-> () const |
indirection | |
const binary_tree & | node () const |
return reference to the node | |
biderectional iterator increment/decrements | |
const binary_tree * | pointee |
the node pointed to | |
std::size_t | post_end |
the distance from –end() (if above –end()) | |
std::size_t | pre_begin |
the distance from begin() (if below begin()) | |
const_iterator & | operator++ () |
pre-increment | |
const_iterator & | operator-- () |
pre-decrement | |
const_iterator | operator++ (int) |
post-increment | |
const_iterator | operator-- (int) |
post-decrement | |
Definition at line 245 of file binary_tree.h.
typedef int exsample::binary_tree< Value >::const_iterator::difference_type |
define the difference type
Definition at line 256 of file binary_tree.h.
typedef std::bidirectional_iterator_tag exsample::binary_tree< Value >::const_iterator::iterator_category |
define the iterator category
Definition at line 253 of file binary_tree.h.
typedef const value_type* exsample::binary_tree< Value >::const_iterator::pointer |
define the pointer type
Definition at line 265 of file binary_tree.h.
typedef const value_type& exsample::binary_tree< Value >::const_iterator::reference |
define the reference type
Definition at line 262 of file binary_tree.h.
typedef const Value exsample::binary_tree< Value >::const_iterator::value_type |
define the value type
Definition at line 259 of file binary_tree.h.
|
inline |
default constructor
Definition at line 275 of file binary_tree.h.
|
inline |
constructor taking pointee
Definition at line 278 of file binary_tree.h.
|
inline |
conversion from iterator
Definition at line 282 of file binary_tree.h.
|
inline |
return reference to the node
Definition at line 316 of file binary_tree.h.
References exsample::binary_tree< Value >::const_iterator::pointee.
|
inline |
comparison
Definition at line 300 of file binary_tree.h.
|
inline |
dereference
Definition at line 310 of file binary_tree.h.
References exsample::binary_tree< Value >::const_iterator::pointee, and exsample::binary_tree< Value >::value().
|
inline |
pre-increment
Definition at line 324 of file binary_tree.h.
References exsample::binary_tree< Value >::const_iterator::pointee, exsample::binary_tree< Value >::const_iterator::post_end, exsample::binary_tree< Value >::const_iterator::pre_begin, and exsample::binary_tree< Value >::right_neighbour().
|
inline |
post-increment
Definition at line 342 of file binary_tree.h.
|
inline |
pre-decrement
Definition at line 333 of file binary_tree.h.
References exsample::binary_tree< Value >::left_neighbour(), exsample::binary_tree< Value >::const_iterator::pointee, exsample::binary_tree< Value >::const_iterator::post_end, and exsample::binary_tree< Value >::const_iterator::pre_begin.
|
inline |
post-decrement
Definition at line 349 of file binary_tree.h.
|
inline |
indirection
Definition at line 313 of file binary_tree.h.
|
inline |
comparison
Definition at line 293 of file binary_tree.h.
References exsample::binary_tree< Value >::const_iterator::pointee, exsample::binary_tree< Value >::const_iterator::post_end, and exsample::binary_tree< Value >::const_iterator::pre_begin.
|
private |
the node pointed to
Definition at line 360 of file binary_tree.h.
Referenced by exsample::binary_tree< Value >::const_iterator::node(), exsample::binary_tree< Value >::const_iterator::operator*(), exsample::binary_tree< Value >::const_iterator::operator++(), exsample::binary_tree< Value >::const_iterator::operator--(), and exsample::binary_tree< Value >::const_iterator::operator==().
|
private |
the distance from –end() (if above –end())
Definition at line 363 of file binary_tree.h.
Referenced by exsample::binary_tree< Value >::const_iterator::operator++(), exsample::binary_tree< Value >::const_iterator::operator--(), and exsample::binary_tree< Value >::const_iterator::operator==().
|
private |
the distance from begin() (if below begin())
Definition at line 366 of file binary_tree.h.
Referenced by exsample::binary_tree< Value >::const_iterator::operator++(), exsample::binary_tree< Value >::const_iterator::operator--(), and exsample::binary_tree< Value >::const_iterator::operator==().