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

Integral value accepted by linear-time integer sorting algorithms. More...

#include <ah-concepts.H>

Concept definition

template<typename T>
concept Aleph::IntegerSortableValue =
std::is_integral_v<std::remove_cv_t<T>> and
not std::is_same_v<std::remove_cv_t<T>, bool>
Aleph::IntegerSortableValue
Integral value accepted by linear-time integer sorting algorithms.
Definition ah-concepts.H:387
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

Integral value accepted by linear-time integer sorting algorithms.

This concept accepts integral types except bool, which avoids accidental use of bit-like logical values in counting/radix sorting APIs.

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