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:231
Aleph::AlephSequentialIterableContainer
Concept for Aleph-w sequential containers that can be iterated.
Definition ah-concepts.H:267
Aleph::blossom_maximum_cardinality_matching
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Definition Blossom.H:466
Aleph::and
and
Check uniqueness with explicit hash + equality functors.
Definition ahFunctional.H:2648

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 267 of file ah-concepts.H.