Herwig
7.2.1
|
#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_iterator & | operator++ () |
pre-increment | |
const_iterator & | operator-- () |
pre-decrement | |
const_iterator | operator++ (int) |
post-increment | |
const_iterator | operator-- (int) |
post-decrement | |
Private Attributes | |
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()) | |
Definition at line 245 of file binary_tree.h.