Designar::RankedTreap< Key, Cmp >::InorderIterator Class Reference

#include <tree.H>

Inheritance diagram for Designar::RankedTreap< Key, Cmp >::InorderIterator:

Public Member Functions
	InorderIterator (const RankedTreap &t)
	InorderIterator (const InorderIterator &it)
	InorderIterator (InorderIterator &&it)
InorderIterator &	operator= (const InorderIterator &it)
InorderIterator &	operator= (InorderIterator &&it)
void	swap (InorderIterator &it)
void	reset ()
void	reset_last ()
nat_t	get_position () const
bool	has_current () const
Key &	get_current ()
const Key &	get_current () const
void	next ()

Protected Member Functions
	InorderIterator (const RankedTreap &t, int)
Node *	get_location () const

Friends
class	RankedTreap

Constructor & Destructor Documentation

template<typename Key , class Cmp = std::less<Key>>

Designar::RankedTreap< Key, Cmp >::InorderIterator::InorderIterator ( const RankedTreap &  t, int    )

inlineprotected

template<typename Key , class Cmp = std::less<Key>>

Designar::RankedTreap< Key, Cmp >::InorderIterator::InorderIterator ( const RankedTreap &  t )

inline

template<typename Key , class Cmp = std::less<Key>>

Designar::RankedTreap< Key, Cmp >::InorderIterator::InorderIterator ( const InorderIterator &  it )

inline

template<typename Key , class Cmp = std::less<Key>>

Designar::RankedTreap< Key, Cmp >::InorderIterator::InorderIterator ( InorderIterator &&  it )

inline

Member Function Documentation

template<typename Key , class Cmp = std::less<Key>>

Key& Designar::RankedTreap< Key, Cmp >::InorderIterator::get_current ( )

inline

template<typename Key , class Cmp = std::less<Key>>

const Key& Designar::RankedTreap< Key, Cmp >::InorderIterator::get_current ( ) const

inline

template<typename Key , class Cmp = std::less<Key>>

Node* Designar::RankedTreap< Key, Cmp >::InorderIterator::get_location ( ) const

inlineprotected

template<typename Key , class Cmp = std::less<Key>>

nat_t Designar::RankedTreap< Key, Cmp >::InorderIterator::get_position ( ) const

inline

template<typename Key , class Cmp = std::less<Key>>

bool Designar::RankedTreap< Key, Cmp >::InorderIterator::has_current ( ) const

inline

template<typename Key , class Cmp = std::less<Key>>

void Designar::RankedTreap< Key, Cmp >::InorderIterator::next ( )

inline

template<typename Key , class Cmp = std::less<Key>>

InorderIterator& Designar::RankedTreap< Key, Cmp >::InorderIterator::operator= ( const InorderIterator &  it )

inline

template<typename Key , class Cmp = std::less<Key>>

InorderIterator& Designar::RankedTreap< Key, Cmp >::InorderIterator::operator= ( InorderIterator &&  it )

inline

template<typename Key , class Cmp = std::less<Key>>

void Designar::RankedTreap< Key, Cmp >::InorderIterator::reset ( )

inline

template<typename Key , class Cmp = std::less<Key>>

void Designar::RankedTreap< Key, Cmp >::InorderIterator::reset_last ( )

inline

template<typename Key , class Cmp = std::less<Key>>

void Designar::RankedTreap< Key, Cmp >::InorderIterator::swap ( InorderIterator &  it )

inline

Friends And Related Function Documentation

template<typename Key , class Cmp = std::less<Key>>

friend class RankedTreap

friend

---

The documentation for this class was generated from the following file:

• include/tree.H