|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Concept for Aleph-w mutable sequential containers. More...
#include <ah-concepts.H>
Concept for Aleph-w mutable sequential containers.
A type C satisfies AlephSequentialContainer if and only if it exposes all of the following:
| Expression | Requirement |
|---|---|
typename C::Item_Type | element type is defined |
cc.size() | returns something convertible to size_t |
cc.is_empty() | returns something convertible to bool |
c.append(val) | accepts const Item_Type &, inserts at back |
c.mutable_for_each(f) | accepts void(Item_Type &) callable |
The four Aleph sequential containers all satisfy this concept:
DynList<T> (htlist.H)DynDlist<T> (tpl_dynDlist.H)Array<T> (tpl_array.H)DynArray<T> (tpl_dynArray.H)The concept is primarily used to constrain the fill() and iota() free functions in ahFunctional.H.
| C | Container type to check. |
Definition at line 186 of file ah-concepts.H.