Struct inanis::cache::perft::PerftHashTable

pub struct PerftHashTable {
    pub table: Vec<PerftHashTableBucket>,
}

Fields

table: Vec<PerftHashTableBucket>

Implementations

impl PerftHashTable

pub fn new(size: usize) -> Self

Constructs a new instance of PerftHashTable by allocating size bytes of memory.

pub fn add(&self, hash: u64, depth: u8, leafs_count: u64)

Adds a new entry (storing hash, depth and leafs_count) using hash to calculate an index of the bucket.

pub fn get(&self, hash: u64, depth: u8) -> Option<PerftHashTableResult>

Gets a wanted entry from the specified depth using hash to calculate an index of the bucket. Returns None if entry does not exists or hash is incompatible with the stored key.

pub fn get_usage(&self, resolution: usize) -> f32

Calculates an approximate percentage usage of the table, based on the first resolution entries.

fn get_index(&self, hash: u64) -> usize

Calculates an index for the hash.