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

#include <tpl_binHeap.H>

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

Public Member Functions

 Iterator () noexcept
 Default constructor creates an "end" iterator.
 
 Iterator (const GenBinHeap &h)
 
void reset_first () noexcept
 
void reset_last () noexcept
 
bool has_curr () const noexcept
 
Node * get_curr_ne () const noexcept
 
Node * get_curr () const
 
void next_ne () noexcept
 
void next ()
 
size_t get_pos () const noexcept
 
void end () noexcept
 

Private Attributes

GenBinHeap * heap_ptr = nullptr
 
FixedStack< Node * > s
 
Node * curr = nullptr
 
size_t pos = 0
 

Static Private Attributes

static const size_t Stack_Size = 64
 

Detailed Description

template<template< class > class NodeType, typename Key, class Compare = Aleph::less<Key>>
class Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator

Definition at line 884 of file tpl_binHeap.H.

Constructor & Destructor Documentation

◆ Iterator() [1/2]

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::Iterator ( )
inlinenoexcept

Default constructor creates an "end" iterator.

Definition at line 895 of file tpl_binHeap.H.

◆ Iterator() [2/2]

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::Iterator ( const GenBinHeap &  h)
inline

Definition at line 897 of file tpl_binHeap.H.

References Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::curr, and h.

Member Function Documentation

◆ end()

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
void Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::end ( )
inlinenoexcept

Definition at line 977 of file tpl_binHeap.H.

References Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::curr, Aleph::FixedStack< T >::empty(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::heap_ptr, Aleph::GenBinHeap< NodeType, Key, Compare >::num_nodes, Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::pos, and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::s.

◆ get_curr()

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
Node * Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::get_curr ( ) const
inline

Definition at line 939 of file tpl_binHeap.H.

References ah_overflow_error_if, Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::get_curr_ne(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::has_curr(), and Aleph::maps().

◆ get_curr_ne()

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
Node * Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::get_curr_ne ( ) const
inlinenoexcept

Definition at line 937 of file tpl_binHeap.H.

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

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

◆ get_pos()

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
size_t Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::get_pos ( ) const
inlinenoexcept

Definition at line 975 of file tpl_binHeap.H.

References Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::pos.

◆ has_curr()

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

Definition at line 935 of file tpl_binHeap.H.

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

Referenced by Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::get_curr(), and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::next().

◆ next()

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

Definition at line 969 of file tpl_binHeap.H.

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

◆ next_ne()

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

Definition at line 945 of file tpl_binHeap.H.

References Aleph::GenBinHeap< NodeType, Key, Compare >::advance_left(), Aleph::GenBinHeap< NodeType, Key, Compare >::advance_right(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::curr, Aleph::FixedStack< T >::is_empty(), l, Aleph::FixedStack< T >::pop(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::pos, Aleph::FixedStack< T >::push(), and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::s.

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

◆ reset_first()

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

Definition at line 905 of file tpl_binHeap.H.

References Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::curr, Aleph::FixedStack< T >::empty(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::heap_ptr, Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::pos, Aleph::GenBinHeap< NodeType, Key, Compare >::root, and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::s.

◆ reset_last()

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
void Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::reset_last ( )
inlinenoexcept

Definition at line 915 of file tpl_binHeap.H.

References Aleph::GenBinHeap< NodeType, Key, Compare >::advance_right(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::curr, Aleph::FixedStack< T >::empty(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::heap_ptr, Aleph::GenBinHeap< NodeType, Key, Compare >::is_empty(), Aleph::GenBinHeap< NodeType, Key, Compare >::num_nodes, Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::pos, Aleph::GenBinHeap< NodeType, Key, Compare >::root, and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::s.

Member Data Documentation

◆ curr

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

Definition at line 890 of file tpl_binHeap.H.

Referenced by Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::Iterator(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::end(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::get_curr_ne(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::has_curr(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::next_ne(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::reset_first(), and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::reset_last().

◆ heap_ptr

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
GenBinHeap* Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::heap_ptr = nullptr
private

Definition at line 888 of file tpl_binHeap.H.

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

◆ pos

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
size_t Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::pos = 0
private

Definition at line 891 of file tpl_binHeap.H.

Referenced by Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::end(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::get_pos(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::next_ne(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::reset_first(), and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::reset_last().

◆ s

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
FixedStack<Node *> Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::s
private

Definition at line 889 of file tpl_binHeap.H.

Referenced by Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::end(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::next_ne(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::reset_first(), and Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::reset_last().

◆ Stack_Size

template<template< class > class NodeType, typename Key , class Compare = Aleph::less<Key>>
const size_t Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::Stack_Size = 64
staticprivate

Definition at line 886 of file tpl_binHeap.H.

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