alcibiades 0.3.0

A framework for writing chess engines in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

//! Implements `DummyTtable`.

use ttable::*;
use stock::std_ttable_entry::StdTtableEntry;


/// Implements a transposition table that never stores anything.
///
/// This is useful when the search algorithm does not use a
/// transposition table.
pub struct DummyTtable;

impl Ttable for DummyTtable {
    type Entry = StdTtableEntry;

    fn new(_: Option<usize>) -> DummyTtable {
        DummyTtable
    }

    /// Does nothing.
    fn new_search(&self) {}

    /// Does nothing.
    #[inline]
    fn store(&self, _: u64, _: Self::Entry) {}

    /// Returns `None`.
    #[inline]
    fn probe(&self, _: u64) -> Option<Self::Entry> {
        None
    }

    /// Does nothing.
    fn clear(&self) {}
}

unsafe impl Sync for DummyTtable {}