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

A container whose items can be visited with traverse(). More...

#include <ah-concepts.H>

Concept definition

template<typename C>
requires { typename C::Item_Type; } and
requires(C & c, bool (&op)(const typename C::Item_Type &))
{
{ c.traverse(op) } -> std::convertible_to<bool>;
}
A container whose items can be visited with traverse().
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
and
Check uniqueness with explicit hash + equality functors.

Detailed Description

A container whose items can be visited with traverse().

Requires Item_Type and a traverse(op) that accepts a predicate on const Item_Type & (return false to stop) and reports whether every item was visited.

Template Parameters
Ccandidate container type.

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