|
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 > |
| using | Tuple_Type = std::tuple< T > |
| The tuple type returned by get_curr() and get_curr_ne() | |
| using | Item_Type = T |
| Type of elements from the container. | |
Public Member Functions | |
| ZipIterator (const C &c) | |
| Construct a zip iterator over a single container. | |
| std::tuple< T > | get_curr () const |
| Return the current tuple (bounds-checked). | |
| std::tuple< T > | get_curr_ne () const noexcept |
| Return the current tuple (no-throw variant). | |
| DynList< T > | get_curr_list () const |
| bool | completed () const noexcept |
Return true if the underlying iterator has reached the end. | |
| using Aleph::ZipIterator< C >::Item_Type = T |
| using Aleph::ZipIterator< C >::T = std::decay_t<typename C::Item_Type> |
| using Aleph::ZipIterator< C >::Tuple_Type = std::tuple<T> |
The tuple type returned by get_curr() and get_curr_ne()
|
inline |
Construct a zip iterator over a single container.
This is mainly used as the base case for the recursive ZipIterator.
| [in] | c | Container to iterate. |
|
inlinenoexcept |
Return true if the underlying iterator has reached the end.
Definition at line 239 of file ah-zip.H.
References Aleph::has_curr(), and Aleph::maps().
|
inline |
|
inline |
Definition at line 231 of file ah-zip.H.
References Aleph::DynList< T >::append(), and l.
|
inlinenoexcept |
Return the current tuple (no-throw variant).
Requires has_curr().