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

Binary operation compatible with Fenwick tree group functors. More...

#include <tpl_fenwick_tree.H>

Concept definition

template<typename F, typename T>
concept Aleph::FenwickBinaryOp =
requires(const F& f, const T& a, const T& b)
{
{ f(a, b) } -> std::convertible_to<T>;
}
Aleph::FenwickBinaryOp
Binary operation compatible with Fenwick tree group functors.
Definition tpl_fenwick_tree.H:103
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

Binary operation compatible with Fenwick tree group functors.

Requires the functor to be callable with two (logically) immutable values of type T and return a value convertible to T. The functor itself is also required to be callable through a const reference, matching usage from const member functions in Gen_Fenwick_Tree.

Definition at line 103 of file tpl_fenwick_tree.H.