Aleph::SparseTableOp Concept Reference

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

#include <tpl_sparse_table.H>

Concept definition

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

Detailed Description

Binary operation compatible with 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 Sparse Table correctness, F must also satisfy the semantic laws: associativity and idempotency.

Definition at line 98 of file tpl_sparse_table.H.