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

Forward iterator for DynSkipList. More...

#include <tpl_dynSkipList.H>

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

Public Types

using Set_Type = DynSkipList
 

Public Member Functions

 Iterator () noexcept=default
 
 Iterator (const DynSkipList &list) noexcept
 
bool has_curr () const noexcept
 
bool is_last () const noexcept
 
const Key & get_curr () const
 
const Key & get_curr_ne () const noexcept
 
Key & get_curr ()
 
const Key & get_key () const
 
void next ()
 
void next_ne () noexcept
 
void reset_first () noexcept
 
void reset () noexcept
 
Iterator & operator= (const Iterator &) noexcept=default
 
bool operator== (const Iterator &it) const noexcept
 
bool operator!= (const Iterator &it) const noexcept
 
Iterator & operator++ () noexcept
 
Iterator operator++ (int) noexcept
 
const Key & operator* () const
 
const Key * operator-> () const
 

Private Attributes

const DynSkipList * list_ptr = nullptr
 
Node * curr = nullptr
 

Detailed Description

template<typename Key, class Compare = std::less<Key>>
class Aleph::DynSkipList< Key, Compare >::Iterator

Forward iterator for DynSkipList.

Iterates through elements in sorted order.

Definition at line 711 of file tpl_dynSkipList.H.

Member Typedef Documentation

◆ Set_Type

template<typename Key , class Compare = std::less<Key>>
using Aleph::DynSkipList< Key, Compare >::Iterator::Set_Type = DynSkipList

Definition at line 717 of file tpl_dynSkipList.H.

Constructor & Destructor Documentation

◆ Iterator() [1/2]

template<typename Key , class Compare = std::less<Key>>
Aleph::DynSkipList< Key, Compare >::Iterator::Iterator ( )
defaultnoexcept

◆ Iterator() [2/2]

template<typename Key , class Compare = std::less<Key>>
Aleph::DynSkipList< Key, Compare >::Iterator::Iterator ( const DynSkipList &  list)
inlineexplicitnoexcept

Definition at line 721 of file tpl_dynSkipList.H.

Member Function Documentation

◆ get_curr() [1/2]

template<typename Key , class Compare = std::less<Key>>
Key & Aleph::DynSkipList< Key, Compare >::Iterator::get_curr ( )
inline

Definition at line 743 of file tpl_dynSkipList.H.

References ah_overflow_error_if, Aleph::DynSkipList< Key, Compare >::Iterator::curr, and Aleph::DynSkipList< Key, Compare >::Node::key.

◆ get_curr() [2/2]

template<typename Key , class Compare = std::less<Key>>
const Key & Aleph::DynSkipList< Key, Compare >::Iterator::get_curr ( ) const
inline

Definition at line 732 of file tpl_dynSkipList.H.

References ah_overflow_error_if, Aleph::DynSkipList< Key, Compare >::Iterator::curr, and Aleph::DynSkipList< Key, Compare >::Node::key.

Referenced by Aleph::DynSkipList< Key, Compare >::Iterator::get_key(), Aleph::DynSkipList< Key, Compare >::Iterator::operator*(), and Aleph::DynSkipList< Key, Compare >::Iterator::operator->().

◆ get_curr_ne()

template<typename Key , class Compare = std::less<Key>>
const Key & Aleph::DynSkipList< Key, Compare >::Iterator::get_curr_ne ( ) const
inlinenoexcept

Definition at line 738 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::curr, and Aleph::DynSkipList< Key, Compare >::Node::key.

◆ get_key()

template<typename Key , class Compare = std::less<Key>>
const Key & Aleph::DynSkipList< Key, Compare >::Iterator::get_key ( ) const
inline

Definition at line 749 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::get_curr().

◆ has_curr()

template<typename Key , class Compare = std::less<Key>>
bool Aleph::DynSkipList< Key, Compare >::Iterator::has_curr ( ) const
inlinenoexcept

Definition at line 725 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::curr.

Referenced by demonstrate_basic_operations(), and demonstrate_string_set().

◆ is_last()

template<typename Key , class Compare = std::less<Key>>
bool Aleph::DynSkipList< Key, Compare >::Iterator::is_last ( ) const
inlinenoexcept

Definition at line 727 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::curr, Aleph::DynSkipList< Key, Compare >::Node::forward, and FunctionalMethods< Container, T >::maps().

◆ next()

template<typename Key , class Compare = std::less<Key>>
void Aleph::DynSkipList< Key, Compare >::Iterator::next ( )
inline

Definition at line 751 of file tpl_dynSkipList.H.

References ah_overflow_error_if, Aleph::DynSkipList< Key, Compare >::Iterator::curr, and Aleph::DynSkipList< Key, Compare >::Iterator::next_ne().

◆ next_ne()

template<typename Key , class Compare = std::less<Key>>
void Aleph::DynSkipList< Key, Compare >::Iterator::next_ne ( )
inlinenoexcept

Definition at line 757 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::curr, and Aleph::DynSkipList< Key, Compare >::Node::forward.

Referenced by Aleph::DynSkipList< Key, Compare >::Iterator::next(), Aleph::DynSkipList< Key, Compare >::Iterator::operator++(), and Aleph::DynSkipList< Key, Compare >::Iterator::operator++().

◆ operator!=()

template<typename Key , class Compare = std::less<Key>>
bool Aleph::DynSkipList< Key, Compare >::Iterator::operator!= ( const Iterator &  it) const
inlinenoexcept

Definition at line 778 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::curr.

◆ operator*()

template<typename Key , class Compare = std::less<Key>>
const Key & Aleph::DynSkipList< Key, Compare >::Iterator::operator* ( ) const
inline

Definition at line 796 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::get_curr().

◆ operator++() [1/2]

template<typename Key , class Compare = std::less<Key>>
Iterator & Aleph::DynSkipList< Key, Compare >::Iterator::operator++ ( )
inlinenoexcept

Definition at line 783 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::next_ne().

◆ operator++() [2/2]

template<typename Key , class Compare = std::less<Key>>
Iterator Aleph::DynSkipList< Key, Compare >::Iterator::operator++ ( int  )
inlinenoexcept

Definition at line 789 of file tpl_dynSkipList.H.

References FunctionalMethods< Container, T >::maps(), and Aleph::DynSkipList< Key, Compare >::Iterator::next_ne().

◆ operator->()

template<typename Key , class Compare = std::less<Key>>
const Key * Aleph::DynSkipList< Key, Compare >::Iterator::operator-> ( ) const
inline

Definition at line 797 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::get_curr().

◆ operator=()

template<typename Key , class Compare = std::less<Key>>
Iterator & Aleph::DynSkipList< Key, Compare >::Iterator::operator= ( const Iterator &  )
defaultnoexcept

◆ operator==()

template<typename Key , class Compare = std::less<Key>>
bool Aleph::DynSkipList< Key, Compare >::Iterator::operator== ( const Iterator &  it) const
inlinenoexcept

Definition at line 773 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::curr.

◆ reset()

template<typename Key , class Compare = std::less<Key>>
void Aleph::DynSkipList< Key, Compare >::Iterator::reset ( )
inlinenoexcept

Definition at line 769 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::reset_first().

◆ reset_first()

template<typename Key , class Compare = std::less<Key>>
void Aleph::DynSkipList< Key, Compare >::Iterator::reset_first ( )
inlinenoexcept

Definition at line 763 of file tpl_dynSkipList.H.

References Aleph::DynSkipList< Key, Compare >::Iterator::curr, Aleph::DynSkipList< Key, Compare >::Node::forward, Aleph::DynSkipList< Key, Compare >::header, and Aleph::DynSkipList< Key, Compare >::Iterator::list_ptr.

Referenced by Aleph::DynSkipList< Key, Compare >::Iterator::reset().

Member Data Documentation

◆ curr

template<typename Key , class Compare = std::less<Key>>
Node* Aleph::DynSkipList< Key, Compare >::Iterator::curr = nullptr
private

Definition at line 714 of file tpl_dynSkipList.H.

Referenced by Aleph::DynSkipList< Key, Compare >::Iterator::get_curr(), Aleph::DynSkipList< Key, Compare >::Iterator::get_curr(), Aleph::DynSkipList< Key, Compare >::Iterator::get_curr_ne(), Aleph::DynSkipList< Key, Compare >::Iterator::has_curr(), Aleph::DynSkipList< Key, Compare >::Iterator::is_last(), Aleph::DynSkipList< Key, Compare >::Iterator::next(), Aleph::DynSkipList< Key, Compare >::Iterator::next_ne(), Aleph::DynSkipList< Key, Compare >::Iterator::operator!=(), Aleph::DynSkipList< Key, Compare >::Iterator::operator==(), and Aleph::DynSkipList< Key, Compare >::Iterator::reset_first().

◆ list_ptr

template<typename Key , class Compare = std::less<Key>>
const DynSkipList* Aleph::DynSkipList< Key, Compare >::Iterator::list_ptr = nullptr
private

Definition at line 713 of file tpl_dynSkipList.H.

Referenced by Aleph::DynSkipList< Key, Compare >::Iterator::reset_first().

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