Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::AlephSequentialIterableContainer Concept Reference

Concept for Aleph-w sequential containers that can be iterated. More...

#include <ah-concepts.H>

Concept definition

template<typename C>
concept Aleph::AlephSequentialIterableContainer =
AlephSequentialContainer<C> and
requires(const C & cc)
{
cc.get_it();
}
Aleph::AlephSequentialContainer
Concept for Aleph-w mutable sequential containers.
Definition ah-concepts.H:186
Aleph::AlephSequentialIterableContainer
Concept for Aleph-w sequential containers that can be iterated.
Definition ah-concepts.H:222
Aleph::and
and
Check uniqueness with explicit hash + equality functors.
Definition ahFunctional.H:2594
Aleph::divide_and_conquer_partition_dp
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Definition DP_Optimizations.H:133

Detailed Description

Concept for Aleph-w sequential containers that can be iterated.

This refines AlephSequentialContainer by additionally requiring get_it() to be available in a const container, so that algorithms can traverse items in read-only mode.

It is intended for Aleph-w sequential containers such as:

  • DynList<T>
  • DynDlist<T>
  • Array<T>
  • DynArray<T>

Although some associative containers may define methods with names like append(), they typically do not satisfy the full sequential interface required here (notably mutable_for_each() with an Item_Type &), so they are excluded by design.

Template Parameters
CContainer type to check.

Definition at line 222 of file ah-concepts.H.