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

Minimal protocol for replacement policies. More...

#include <Transposition_Table.H>

Concept definition

template<typename Policy, typename Entry>
concept Aleph::TranspositionReplacementPolicy = requires(const Policy &policy, const Entry &candidate, const Entry &current) {
{ policy(candidate, current) } -> std::convertible_to<bool>;
}
Minimal protocol for replacement policies.
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

Detailed Description

Minimal protocol for replacement policies.

A replacement policy receives the candidate and the currently stored entry for the same key, and returns true when the candidate should overwrite the current one.

Template Parameters
PolicyFunctor type.
EntryEntry type to compare.

Definition at line 96 of file Transposition_Table.H.