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>;
}
Aleph::TranspositionReplacementPolicy
Minimal protocol for replacement policies.
Definition Transposition_Table.H:97
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

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.