Const iterator Not trivial: iterator keeps a stack to indicate current path from root_. More...
#include <BTree.h>
Public Types | |
typedef ptrdiff_t | difference_type |
typedef std::forward_iterator_tag | iterator_category |
typedef const value_type * | pointer |
typedef const value_type & | reference |
typedef std::pair< KEY, VALUE > | value_type |
Public Member Functions | |
const_iterator () | |
const_iterator (const sharedNode &root) | |
bool | operator!= (const Self &__x) const |
reference | operator* () const |
Self & | operator++ () |
Self | operator++ (int) |
pointer | operator-> () const |
bool | operator== (const Self &__x) const |
Private Types | |
typedef std::pair< sharedNode, bool > | flagged |
typedef const_iterator | Self |
Private Member Functions | |
const sharedNode & | current () const |
bool | done () const |
void | increment () |
Private Attributes | |
std::stack< flagged > | path_ |
Const iterator Not trivial: iterator keeps a stack to indicate current path from root_.
typedef ptrdiff_t gtsam::BTree< KEY, VALUE >::const_iterator::difference_type |
|
private |
typedef std::forward_iterator_tag gtsam::BTree< KEY, VALUE >::const_iterator::iterator_category |
typedef const value_type* gtsam::BTree< KEY, VALUE >::const_iterator::pointer |
typedef const value_type& gtsam::BTree< KEY, VALUE >::const_iterator::reference |
|
private |
typedef std::pair<KEY, VALUE> gtsam::BTree< KEY, VALUE >::const_iterator::value_type |
|
inline |
|
inline |
|
inlineprivate |
|
inlineprivate |
|
inlineprivate |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |