Struct chess::CacheTable
source · pub struct CacheTable<T: Copy + Clone + PartialEq + PartialOrd> { /* private fields */ }Expand description
Store a cache of entries, each with an associated hash.
Implementations
sourceimpl<T: Copy + Clone + PartialEq + PartialOrd> CacheTable<T>
impl<T: Copy + Clone + PartialEq + PartialOrd> CacheTable<T>
sourcepub fn new(size: usize, default: T) -> CacheTable<T>
pub fn new(size: usize, default: T) -> CacheTable<T>
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.
Auto Trait Implementations
impl<T> RefUnwindSafe for CacheTable<T>where
T: RefUnwindSafe,
impl<T> Send for CacheTable<T>where
T: Send,
impl<T> Sync for CacheTable<T>where
T: Sync,
impl<T> Unpin for CacheTable<T>
impl<T> UnwindSafe for CacheTable<T>where
T: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more