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

A callable that takes two const T& and returns bool. More...

#include <ah-concepts.H>

Concept definition

template<typename F, typename T>
concept Aleph::BinaryPredicate =
requires(const F & f, const T & a, const T & b)
{
{ f(a, b) } -> std::convertible_to<bool>;
}
Aleph::BinaryPredicate
A callable that takes two const T& and returns bool.
Definition ah-concepts.H:67
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
Aleph::T
std::decay_t< typename HeadC::Item_Type > T
Definition ah-zip.H:105

Detailed Description

A callable that takes two const T& and returns bool.

Template Parameters
Ffunctor type.
Tvalue type.

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