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

A closed binary operation not known to break idempotency. More...

#include <tpl_sparse_table.H>

Concept definition

template<typename F, typename T>
concept Aleph::IdempotentOp =
Aleph::ClosedBinaryOp<F, T> and not is_known_non_idempotent_op<F, T>
Aleph::ClosedBinaryOp
A binary functor closed over T.
Definition ah-concepts.H:424
Aleph::IdempotentOp
A closed binary operation not known to break idempotency.
Definition tpl_sparse_table.H:156
Aleph::blossom_maximum_cardinality_matching
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Definition Blossom.H:466
Aleph::and
and
Check uniqueness with explicit hash + equality functors.
Definition ahFunctional.H:2648

Detailed Description

A closed binary operation not known to break idempotency.

Aleph::ClosedBinaryOp minus the functors flagged by is_known_non_idempotent_op. It catches the common mistake of building a Sparse Table over a sum or a product, which compiles but returns wrong answers because queries combine overlapping blocks.

Template Parameters
Ffunctor type.
Tvalue type.
Note
Any other functor, including user lambdas, is accepted: the caller must still ensure associativity and idempotency.

Definition at line 156 of file tpl_sparse_table.H.