|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <ah-zip.H>
Public Types | |
| using | T = std::decay_t< typename C::Item_Type > |
Public Member Functions | |
| void | next () |
| Advance the iterator and increment the associated index (bounds-checked). | |
| void | next_ne () noexcept |
| Advance the iterator and increment the associated index (no-throw variant). | |
| EnumZipIterator (const C &c) | |
| Construct an enumerating iterator over a single container. | |
| std::tuple< T, size_t > | get_curr () const |
Return the current tuple (value, index) (bounds-checked). | |
| std::tuple< T, size_t > | get_curr_ne () const noexcept |
Return the current tuple (value, index) (no-throw variant). | |
| bool | completed () const noexcept |
Return true if the underlying iterator has reached the end. | |
Private Attributes | |
| size_t | i = 0 |
| using Aleph::EnumZipIterator< C >::T = std::decay_t<typename C::Item_Type> |
|
inline |
|
inlinenoexcept |
Return true if the underlying iterator has reached the end.
Definition at line 1284 of file ah-zip.H.
References Aleph::has_curr(), and Aleph::maps().
|
inline |
|
inlinenoexcept |
Return the current tuple (value, index) (no-throw variant).
Requires has_curr().
|
inline |
|
inlinenoexcept |
Advance the iterator and increment the associated index (no-throw variant).
Requires has_curr().
|
private |