Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::ArrayHeap< T, Compare >::Iterator Struct Reference

#include <tpl_arrayHeap.H>

Inheritance diagram for Aleph::ArrayHeap< T, Compare >::Iterator:
[legend]
Collaboration diagram for Aleph::ArrayHeap< T, Compare >::Iterator:
[legend]

Public Member Functions

 Iterator (const ArrayHeap &h) noexcept
 
- Public Member Functions inherited from Aleph::Array_Iterator< T >
Tget_base () noexcept
 Get the base pointer of the array.
 
constexpr const Tget_base () const noexcept
 Get the base pointer of the array (const version).
 
 Array_Iterator ()=default
 Default constructor - creates an invalid iterator.
 
 Array_Iterator (T *p, const size_t sz, const size_t n)
 Construct an iterator over an array.
 
 Array_Iterator (NoExceptionCtor, T *p, const size_t sz, const size_t n)
 Construct an iterator without exception checking.
 
 Array_Iterator (T *p, const size_t sz, const size_t n, const long f, const long l)
 Construct an iterator over a circular array region.
 
 Array_Iterator (NoExceptionCtor, T *p, const size_t sz, const size_t n, const long f, const long l)
 Construct a circular iterator without exception checking.
 
 Array_Iterator (const Array_Container< T > &c)
 Construct an iterator from an Array_Container.
 
bool has_curr () const noexcept
 Check if there is a current valid item.
 
bool is_last () const noexcept
 Check if positioned at the last item.
 
constexpr long get_pos () const noexcept
 Get the current position index.
 
Tget_curr_ne () const noexcept
 Get the current item without bounds checking.
 
Tget_curr () const
 Get the current item with bounds checking.
 
void next_ne () noexcept
 Advance to the next item without bounds checking.
 
void next ()
 Advance to the next item with bounds checking.
 
void prev_ne () noexcept
 Move to the previous item without bounds checking.
 
void prev ()
 Move to the previous item with bounds checking.
 
void reset () noexcept
 Reset the iterator to the first item.
 
void reset_first () noexcept
 Reset the iterator to the first item (alias for reset()).
 
void reset_last () noexcept
 Reset the iterator to the last item.
 
void end () noexcept
 Put the iterator at the end (past the last item).
 

Additional Inherited Members

- Public Types inherited from Aleph::Array_Iterator< T >
using Item_Type = T
 The type of elements being iterated.
 

Detailed Description

template<typename T, class Compare = Aleph::less<T>>
struct Aleph::ArrayHeap< T, Compare >::Iterator

Definition at line 614 of file tpl_arrayHeap.H.

Constructor & Destructor Documentation

◆ Iterator()

template<typename T , class Compare = Aleph::less<T>>
Aleph::ArrayHeap< T, Compare >::Iterator::Iterator ( const ArrayHeap h)
inlinenoexcept

Definition at line 616 of file tpl_arrayHeap.H.


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