Struct Entry

pub struct Entry {
    pub hash: HashKind,
    pub key_move: Move,
    pub score: Cp,
    pub ply: PlyKind,
    pub node_kind: NodeKind,
}

Entry contains information about a single previously searched position.

Fields

hash: HashKind

Full hash value for a position.

key_move: Move

Best move or refutation move of position.

score: Cp

The Score in centipawns for the position.

ply: PlyKind

The ply/depth that was searched to in this position’s subtree.

node_kind: NodeKind

Type of Node this position has in search tree.

Implementations

impl Entry

pub fn new( hash: HashKind, key_move: Move, score: Cp, ply: PlyKind, node_kind: NodeKind, ) -> Self

Returns new Entry from provided information.

pub fn illegal() -> Self

Returns a new Entry with illegal information.

Trait Implementations

impl Clone for Entry

fn clone(&self) -> Entry

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Entry

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Entry

fn default() -> Self

Returns the “default value” for a type.

impl Hash for Entry

fn hash<H: Hasher>(&self, h: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Entry

fn eq(&self, other: &Entry) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Entry

impl Eq for Entry

impl StructuralPartialEq for Entry