Aleph::Prefer_Deeper_Entry< Entry > Struct Template Reference

Replacement policy that prefers entries searched to greater depth. More...

#include <Transposition_Table.H>

Public Member Functions
bool	operator() (const Entry &candidate, const Entry &current) const noexcept
	Decide which entry to keep according to remaining depth.

Detailed Description

template<typename Entry>
requires requires(const Entry &entry) { { entry.depth } -> std::convertible_to<size_t>; }
struct Aleph::Prefer_Deeper_Entry< Entry >

Replacement policy that prefers entries searched to greater depth.

Template Parameters

Entry

Entry type (must expose .depth).

Definition at line 137 of file Transposition_Table.H.

Member Function Documentation

operator()()

template<typename Entry >

bool Aleph::Prefer_Deeper_Entry< Entry >::operator() ( const Entry &  candidate, const Entry &  current  ) const

inlinenoexcept

Decide which entry to keep according to remaining depth.

Parameters

candidate	New entry proposed for storage.
current	Entry already stored for the same key.

Returns

True if candidate.depth > current.depth.

Definition at line 144 of file Transposition_Table.H.

References Aleph::divide_and_conquer_partition_dp().

---

The documentation for this struct was generated from the following file:

• Transposition_Table.H