hexe_core 0.0.5

The core components of the hexe chess engine crate.
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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

use core::mem;

use super::*;
use iter;

macro_rules! iter {
    ($next:ident) => {
        #[inline]
        fn $next(&mut self) -> Option<Self::Item> {
            while let Some(sq) = self.iter.$next() {
                if let Some(pc) = self.map.get(sq) {
                    return Some((sq, pc));
                }
            }
            None
        }
    }
}

macro_rules! iter_mut {
    ($next:ident) => {
        #[inline]
        fn $next(&mut self) -> Option<Self::Item> {
            while let Some(sq) = self.iter.$next() {
                if let Some(pc) = self.map.get_mut(sq) {
                    // Extend the lifetime
                    let pc = unsafe { mem::transmute(pc) };
                    return Some((sq, pc));
                }
            }
            None
        }
    }
}

macro_rules! impl_iter {
    ($iter:ident) => {
        $iter! { next }

        #[inline]
        fn size_hint(&self) -> (usize, Option<usize>) {
            let len = self.len();
            (len, Some(len))
        }

        #[inline]
        fn count(self) -> usize {
            self.len()
        }

        #[inline]
        fn last(mut self) -> Option<Self::Item> {
            self.next_back()
        }
    }
}

impl PieceMap {
    #[inline]
    fn find_len(&self, iter: &iter::Range<Square>) -> usize {
        iter.extract(self.as_bytes()).iter().fold(iter.len(), |len, &pc| {
            len - (pc == NONE) as usize
        })
    }
}

impl<'a> IntoIterator for &'a PieceMap {
    type Item = (Square, &'a Piece);
    type IntoIter = Iter<'a>;

    #[inline]
    fn into_iter(self) -> Iter<'a> {
        Iter { map: self, iter: Default::default() }
    }
}

impl<'a> IntoIterator for &'a mut PieceMap {
    type Item = (Square, &'a mut Piece);
    type IntoIter = IterMut<'a>;

    #[inline]
    fn into_iter(self) -> IterMut<'a> {
        IterMut { map: self, iter: Default::default() }
    }
}

/// A [`PieceMap`](struct.PieceMap.html) iterator.
#[derive(Clone)]
pub struct Iter<'a> {
    map: &'a PieceMap,
    iter: iter::Range<Square>,
}

#[cfg(test)]
assert_impl!(iter; Iter<'static>, Send, Sync);

impl<'a> Iterator for Iter<'a> {
    type Item = (Square, &'a Piece);
    impl_iter! { iter }
}

impl<'a> DoubleEndedIterator for Iter<'a> {
    iter! { next_back }
}

impl<'a> ExactSizeIterator for Iter<'a> {
    #[inline]
    fn len(&self) -> usize {
        self.map.find_len(&self.iter)
    }
}

impl<'a> fmt::Debug for Iter<'a> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        f.debug_list().entries(self.clone()).finish()
    }
}

/// A mutable [`PieceMap`](struct.PieceMap.html) iterator.
pub struct IterMut<'a> {
    map: &'a mut PieceMap,
    iter: iter::Range<Square>,
}

#[cfg(test)]
assert_impl!(iter_mut; IterMut<'static>, Send, Sync);

impl<'a> From<IterMut<'a>> for Iter<'a> {
    #[inline]
    fn from(iter: IterMut) -> Iter {
        Iter { map: iter.map, iter: iter.iter }
    }
}

impl<'a> Iterator for IterMut<'a> {
    type Item = (Square, &'a mut Piece);
    impl_iter! { iter_mut }
}

impl<'a> DoubleEndedIterator for IterMut<'a> {
    iter_mut! { next_back }
}

impl<'a> ExactSizeIterator for IterMut<'a> {
    #[inline]
    fn len(&self) -> usize {
        self.map.find_len(&self.iter)
    }
}

impl<'a> fmt::Debug for IterMut<'a> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        Iter { map: self.map, iter: self.iter.clone() }.fmt(f)
    }
}