Aleph::DisjointSparseTableOp Concept Reference

Binary operation compatible with Disjoint Sparse Table queries. More...

#include <tpl_disjoint_sparse_table.H>

Concept definition

template<typename F, typename T>
concept Aleph::DisjointSparseTableOp = 
      requires(const F& f, const T& a, const T& b)
        {
          { f(a, b) } -> std::convertible_to<T>;
        }

Detailed Description

Binary operation compatible with Disjoint Sparse Table queries.

Requires the functor to be callable with two immutable values of type T and return a value convertible to T.

Note

This concept checks only the call signature. For Disjoint Sparse Table correctness, F must satisfy associativity: f(f(a, b), c) == f(a, f(b, c)). Idempotency is not required.

Definition at line 116 of file tpl_disjoint_sparse_table.H.