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:235
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

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