Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Public Member Functions | Protected Attributes | Static Protected Attributes | Private Member Functions | List of all members
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator Class Reference
Trees

Iterator on nodes of the tree. More...

#include <tpl_treapRk.H>

Collaboration diagram for Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator:
[legend]

Public Member Functions

 Iterator () noexcept
 
 Iterator (const Gen_Treap_Rk &__tree) noexcept
 Initialize an iterator on __tree
 
 Iterator (const Gen_Treap_Rk &__tree, Node *__curr) noexcept
 Initialize an iterator starting from node __curr
 
 Iterator (const Gen_Treap_Rk &__tree, const size_t pos) noexcept
 Initialize an iterator starting from the iorder position pos
 
 Iterator (const Iterator &itor) noexcept
 
Iterator & operator= (const Iterator &itor) noexcept
 
void reset_first () noexcept
 Reset the iterator to the first position.
 
void reset_last () noexcept
 Reset the iterator to the last position.
 
void end () noexcept
 Put the iterator in the end state.
 
void reset_to_key (const Key &key) noexcept
 Put the iterator to a node according to specific key.
 
void reset_to_node (Node *node) noexcept
 Put the current node to a specific node.
 
void reset_to_pos (const size_t pos) noexcept
 Put the current to the position pos.
 
Node * get_curr_ne () const noexcept
 Return the current node.
 
Node * get_curr () const noexcept
 
size_t get_current_position () const
 return the position of current node
 
size_t get_pos () const
 
bool has_curr () const noexcept
 Return true if iterator has current node.
 
void prev ()
 Move the iterator one position backward.
 
void next_ne () noexcept
 
void next ()
 Move the iterator one position forward.
 
Node * del ()
 Remove the current node and move the iterator one position forward.
 
bool operator== (const Iterator &itor) const noexcept
 Return true if this is equal to itor
 
bool operator!= (const Iterator &itor) const
 Return true if this is not equal to itor
 
bool verify (Gen_Treap_Rk *r) const noexcept
 
bool verify (const Iterator &it) const noexcept
 

Protected Attributes

Gen_Treap_Rk * tree_ptr
 
Node * curr
 
int curr_pos
 

Static Protected Attributes

static constexpr int Pos_Not_Current = -1
 
static constexpr int Pos_Empty_Container = -2
 
static constexpr int Pos_Not_Updated = -3
 

Private Member Functions

bool is_container_empty () const noexcept
 
bool pos_updated () const noexcept
 
bool curr_updated () const noexcept
 
bool is_updated () const noexcept
 
void update_pos () const noexcept
 
void update_curr () const noexcept
 

Detailed Description

template<template< class > class NodeType, class Key, class Compare>
class Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator

Iterator on nodes of the tree.

The visit order is inorder.

Definition at line 755 of file tpl_treapRk.H.

Constructor & Destructor Documentation

◆ Iterator() [1/5]

template<template< class > class NodeType, class Key , class Compare >
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator ( )
inlinenoexcept

Definition at line 810 of file tpl_treapRk.H.

◆ Iterator() [2/5]

template<template< class > class NodeType, class Key , class Compare >
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator ( const Gen_Treap_Rk &  __tree)
inlinenoexcept

Initialize an iterator on __tree

Definition at line 817 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_container_empty(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Empty_Container.

◆ Iterator() [3/5]

template<template< class > class NodeType, class Key , class Compare >
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator ( const Gen_Treap_Rk &  __tree,
Node *  __curr 
)
inlinenoexcept

Initialize an iterator starting from node __curr

Definition at line 824 of file tpl_treapRk.H.

◆ Iterator() [4/5]

template<template< class > class NodeType, class Key , class Compare >
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator ( const Gen_Treap_Rk &  __tree,
const size_t  pos 
)
inlinenoexcept

Initialize an iterator starting from the iorder position pos

Definition at line 832 of file tpl_treapRk.H.

◆ Iterator() [5/5]

template<template< class > class NodeType, class Key , class Compare >
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator ( const Iterator &  itor)
inlinenoexcept

Definition at line 839 of file tpl_treapRk.H.

Member Function Documentation

◆ curr_updated()

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_updated ( ) const
inlineprivatenoexcept

Definition at line 779 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::del(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_curr_ne(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_updated(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator==().

◆ del()

template<template< class > class NodeType, class Key , class Compare >
Node * Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::del ( )
inline

Remove the current node and move the iterator one position forward.

Definition at line 981 of file tpl_treapRk.H.

References ah_underflow_error_if, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_updated(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr(), KEY, Aleph::maps(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::remove(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr().

◆ end()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::end ( )
inlinenoexcept

Put the iterator in the end state.

Definition at line 873 of file tpl_treapRk.H.

References put_itor_at_the_end().

◆ get_curr()

template<template< class > class NodeType, class Key , class Compare >
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_curr ( ) const
inlinenoexcept

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 919 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_curr_ne().

◆ get_curr_ne()

template<template< class > class NodeType, class Key , class Compare >
Node * Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_curr_ne ( ) const
inlinenoexcept

Return the current node.

Definition at line 910 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_updated(), Aleph::maps(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr().

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_curr().

◆ get_current_position()

template<template< class > class NodeType, class Key , class Compare >
Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_current_position ( ) const
inline

return the position of current node

Returns
current position
Exceptions
underflow_errorif the iterator has not current node after a prev() operation
overflow_errorif the iterator has not current node after a next() operation

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 932 of file tpl_treapRk.H.

References ah_range_error_if, Aleph::COUNT(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), Aleph::maps(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::pos_updated(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_pos().

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_pos().

◆ get_pos()

template<template< class > class NodeType, class Key , class Compare >
size_t Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_pos ( ) const
inline

Definition at line 945 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_current_position().

◆ has_curr()

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr ( ) const
inlinenoexcept

Return true if iterator has current node.

Definition at line 948 of file tpl_treapRk.H.

References Aleph::COUNT(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), Aleph::maps(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::pos_updated(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_pos().

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::del(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::next(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::prev().

◆ is_container_empty()

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_container_empty ( ) const
inlineprivatenoexcept

Definition at line 769 of file tpl_treapRk.H.

References Aleph::COUNT(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator==(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_first(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_last().

◆ is_updated()

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_updated ( ) const
inlineprivatenoexcept

Definition at line 784 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_updated(), Aleph::maps(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::pos_updated().

◆ next()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::next ( )
inline

Move the iterator one position forward.

Throws overflow_error if there is no current

Definition at line 974 of file tpl_treapRk.H.

References ah_underflow_error_if, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr(), Aleph::maps(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::next_ne().

◆ next_ne()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::next_ne ( )
inlinenoexcept

Definition at line 966 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::next().

◆ operator!=()

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator!= ( const Iterator &  itor) const
inline

Return true if this is not equal to itor

Definition at line 1019 of file tpl_treapRk.H.

References Aleph::maps().

◆ operator=()

template<template< class > class NodeType, class Key , class Compare >
Iterator & Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator= ( const Iterator &  itor)
inlinenoexcept

Definition at line 845 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::maps(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

◆ operator==()

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator== ( const Iterator &  itor) const
inlinenoexcept

Return true if this is equal to itor

Definition at line 996 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_updated(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_container_empty(), Aleph::maps(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::pos_updated(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_pos().

◆ pos_updated()

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::pos_updated ( ) const
inlineprivatenoexcept

Definition at line 774 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Not_Updated.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_current_position(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_updated(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator==().

◆ prev()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::prev ( )
inline

Move the iterator one position backward.

Throws underflow_error if there is no current

Definition at line 958 of file tpl_treapRk.H.

References ah_underflow_error_if, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr(), and Aleph::maps().

◆ reset_first()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_first ( )
inlinenoexcept

Reset the iterator to the first position.

Definition at line 858 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_container_empty(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Empty_Container.

◆ reset_last()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_last ( )
inlinenoexcept

Reset the iterator to the last position.

Definition at line 865 of file tpl_treapRk.H.

References Aleph::COUNT(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_container_empty(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Empty_Container, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

◆ reset_to_key()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_key ( const Key &  key)
inlinenoexcept

Put the iterator to a node according to specific key.

If key is not present, then the iterator is put on the node

Parameters
[in]keyto guide the position
Exceptions
domain_errorif the key is not contained in the tree.

Definition at line 885 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::find_position(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

◆ reset_to_node()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_node ( Node *  node)
inlinenoexcept

Put the current node to a specific node.

Parameters
[in]nodeto put as current
Note
Obviously the node must belong to the tree

Definition at line 896 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos.

◆ reset_to_pos()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_pos ( const size_t  pos)
inlinenoexcept

Put the current to the position pos.

Definition at line 903 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos.

◆ update_curr()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr ( ) const
inlineprivatenoexcept

Definition at line 797 of file tpl_treapRk.H.

References Aleph::COUNT(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), Aleph::maps(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Empty_Container, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Not_Current, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Not_Updated, Aleph::select(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::del(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_curr_ne().

◆ update_pos()

template<template< class > class NodeType, class Key , class Compare >
void Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_pos ( ) const
inlineprivatenoexcept

Definition at line 789 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::cmp, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos, Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), Aleph::inorder_position(), KEY, Aleph::maps(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_current_position(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator==().

◆ verify() [1/2]

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::verify ( const Iterator &  it) const
inlinenoexcept

Definition at line 1029 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

◆ verify() [2/2]

template<template< class > class NodeType, class Key , class Compare >
bool Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::verify ( Gen_Treap_Rk *  r) const
inlinenoexcept

Definition at line 1024 of file tpl_treapRk.H.

References Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::getRoot(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::r, and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr.

Member Data Documentation

◆ curr

template<template< class > class NodeType, class Key , class Compare >
Node* Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr
mutableprotected

Definition at line 760 of file tpl_treapRk.H.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_updated(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::del(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_curr_ne(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::next_ne(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator=(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator==(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::prev(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_first(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_last(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_node(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_pos(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_pos().

◆ curr_pos

template<template< class > class NodeType, class Key , class Compare >
int Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::curr_pos
mutableprotected

Definition at line 761 of file tpl_treapRk.H.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_current_position(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::next_ne(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator=(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator==(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::pos_updated(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::prev(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_first(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_last(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_key(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_node(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_pos(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_pos().

◆ Pos_Empty_Container

template<template< class > class NodeType, class Key , class Compare >
constexpr int Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Empty_Container = -2
staticconstexprprotected

Definition at line 764 of file tpl_treapRk.H.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Iterator(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_first(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_last(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr().

◆ Pos_Not_Current

template<template< class > class NodeType, class Key , class Compare >
constexpr int Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Not_Current = -1
staticconstexprprotected

Definition at line 763 of file tpl_treapRk.H.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr().

◆ Pos_Not_Updated

template<template< class > class NodeType, class Key , class Compare >
constexpr int Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::Pos_Not_Updated = -3
staticconstexprprotected

Definition at line 765 of file tpl_treapRk.H.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::pos_updated(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr().

◆ tree_ptr

template<template< class > class NodeType, class Key , class Compare >
Gen_Treap_Rk* Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::tree_ptr
mutableprotected

Definition at line 759 of file tpl_treapRk.H.

Referenced by Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::del(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::get_current_position(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::has_curr(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::is_container_empty(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::operator=(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_last(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::reset_to_key(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_curr(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::update_pos(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::verify(), and Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Iterator::verify().

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