[][src]Struct chess::CacheTable

pub struct CacheTable<T: Copy + Clone + PartialEq + PartialOrd> { /* fields omitted */ }

Store a cache of entries, each with an associated hash.

Methods

impl<T: Copy + Clone + PartialEq + PartialOrd> CacheTable<T>
[src]

pub fn new(size: usize, default: T) -> CacheTable<T>
[src]

Create a new CacheTable with each associated entry initialized with a hash of '0' Note: You must pass in a size where only 1 bit is set. (AKA: 2, 4, 8, 16, 1024, 65536, etc.) Panics when size is invalid.

pub fn get(&self, hash: u64) -> Option<T>
[src]

Get a particular entry with the hash specified

pub fn add(&mut self, hash: u64, entry: T)
[src]

Add (or overwrite) an entry with the associated hash

Auto Trait Implementations

impl<T> Send for CacheTable<T> where
    T: Send

impl<T> Sync for CacheTable<T> where
    T: Sync

Blanket Implementations

impl<T> From for T
[src]

impl<T, U> Into for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom for T where
    T: From<U>, 
[src]

type Error = !

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T> Borrow for T where
    T: ?Sized
[src]

impl<T> BorrowMut for T where
    T: ?Sized
[src]

impl<T, U> TryInto for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T> Any for T where
    T: 'static + ?Sized
[src]