#include <tree.H>

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

Collaboration diagram for Designar::RankedTreap< Key, Cmp >::Iterator:

Additional Inherited Members
Public Member Functions inherited from Designar::RankedTreap< Key, Cmp >::InorderIterator
	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 ()

Public Member Functions inherited from Designar::ForwardIterator< Iterator, Key >
Iterator &	operator++ ()

Iterator	operator++ (int)

Public Member Functions inherited from Designar::BasicIterator< Iterator, Key, false >
bool	has_curr () const

RetType< RET_CPY, Key, Key & >	get_curr ()

RetType< RET_CPY, Key, const Key & >	get_curr () const

RetType< RET_CPY, Key, Key & >	operator* ()

RetType< RET_CPY, Key, const Key & >	operator* () const

Key *	operator-> ()

bool	operator== (const Iterator &it) const

bool	operator!= (const Iterator &it) const

Protected Member Functions inherited from Designar::RankedTreap< Key, Cmp >::InorderIterator
	InorderIterator (const RankedTreap &t, int)

Node *	get_location () const

Protected Member Functions inherited from Designar::BasicIterator< Iterator, Key, false >
Iterator &	me ()

const Iterator &	const_me () const

Friends And Related Function Documentation

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

friend class BasicIterator< Iterator, Key >

friend

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

friend class RankedTreap

friend

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

Friends