|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
STL-compatible iterator adapters for Aleph containers. More...
#include <compare>#include <iterator>#include <concepts>#include <type_traits>#include <utility>Go to the source code of this file.
Classes | |
| struct | StlIterator< SetType > |
| STL-compatible mutable iterator adapter for Aleph containers. More... | |
| struct | StlConstIterator< SetType > |
| STL-compatible const iterator adapter for Aleph containers. More... | |
| class | StlAlephIterator< SetName > |
Mixin that adds STL begin()/end() and cbegin()/cend() to Aleph containers. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Concepts | |
| concept | AlephRandomAccessItor |
| Detects Aleph iterators that opted in to random-access promotion. | |
Functions | |
| template<class Container > | |
| Aleph::DynList< typename Container::value_type > | extract_from_stl_container (const Container &c) |
Extract all items from an STL container into an Aleph DynList. | |
STL-compatible iterator adapters for Aleph containers.
Provides StlIterator and StlConstIterator that wrap Aleph container iterators to satisfy std::input_iterator and std::forward_iterator concepts, enabling use with std::ranges and STL algorithms. Iterators that opt in via the aleph_random_access_iterator marker (see AlephRandomAccessItor) are promoted to std::random_access_iterator.
Definition in file ah-iterator.H.
|
inline |
Extract all items from an STL container into an Aleph DynList.
| Container | Any STL-like container supporting range-for iteration. |
| c | Source container. |
DynList containing copies of all elements from c. Definition at line 564 of file ah-iterator.H.
References Aleph::DynList< T >::append().