[−][src]Struct chess::CacheTable
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> RefUnwindSafe for CacheTable<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for CacheTable<T> where
T: Send,
T: Send,
impl<T> Sync for CacheTable<T> where
T: Sync,
T: Sync,
impl<T> Unpin for CacheTable<T>
impl<T> UnwindSafe for CacheTable<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,