slidy 0.3.2

Utilities for working with sliding puzzles
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222

//! Defines the [`Grid`] label.

use crate::puzzle::{
    grids::Grids,
    label::{label::Label, rect_partition::Rect},
    size::Size,
};

#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};

/// A [`Label`] that divides the puzzle into a grid of rectangles at the given `x` and `y`
/// coordinates.
#[derive(Clone, Debug, PartialEq, Eq, Hash)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct Grid {
    xs: Vec<u64>,
    ys: Vec<u64>,
}

impl Grid {
    /// Creates a new [`Grid`] label with the given `x` and `y` coordinates.
    ///
    /// The two vectors are sorted and de-duplicated. Any zero values are also removed.
    ///
    /// The `xs` vector contains the `x` coordinates of the vertical lines that divide the puzzle
    /// into rectangles, and likewise for `ys`.
    #[must_use]
    pub fn new(mut xs: Vec<u64>, mut ys: Vec<u64>) -> Self {
        xs.sort_unstable();
        xs.dedup();
        xs.retain(|&i| i != 0);

        ys.sort_unstable();
        ys.dedup();
        ys.retain(|&i| i != 0);

        Self { xs, ys }
    }

    /// Creates a new empty [`Grid`].
    #[must_use]
    pub fn new_empty() -> Self {
        Self::new(Vec::new(), Vec::new())
    }

    /// Returns the `x` coordinates of the vertical lines that divide the puzzle into rectangles.
    #[must_use]
    pub fn xs(&self) -> &[u64] {
        &self.xs
    }

    /// Returns the `y` coordinates of the horizontal lines that divide the puzzle into rectangles.
    #[must_use]
    pub fn ys(&self) -> &[u64] {
        &self.ys
    }

    fn lr_count(&self, size: Size) -> u64 {
        self.xs.iter().take_while(|&&i| i < size.width()).count() as u64 + 1
    }

    fn ud_count(&self, size: Size) -> u64 {
        self.ys.iter().take_while(|&&i| i < size.height()).count() as u64 + 1
    }

    fn grid_index(&self, pos: (u64, u64)) -> (u64, u64) {
        let x = self.xs.iter().take_while(|&&i| i <= pos.0).count() as u64;
        let y = self.ys.iter().take_while(|&&i| i <= pos.1).count() as u64;

        (x, y)
    }
}

impl Label for Grid {
    fn position_label(&self, size: Size, pos: (u64, u64)) -> u64 {
        let (x, y) = self.grid_index(pos);
        x + self.lr_count(size) * y
    }

    fn num_labels(&self, size: Size) -> u64 {
        self.lr_count(size) * self.ud_count(size)
    }
}

impl Grids for Grid {
    fn grid_containing_pos(&self, size: Size, pos: (u64, u64)) -> Rect {
        let (x, y) = self.grid_index(pos);

        let left = if x == 0 { 0 } else { self.xs[x as usize - 1] };
        let top = if y == 0 { 0 } else { self.ys[y as usize - 1] };

        let (w, h) = size.into();

        let right = self
            .xs
            .get(x as usize)
            .copied()
            .map_or(w, |right| right.min(w));
        let bottom = self
            .ys
            .get(y as usize)
            .copied()
            .map_or(h, |bottom| bottom.min(h));

        Rect::new((left, top), (right, bottom)).unwrap()
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    fn s(w: u64, h: u64) -> Size {
        Size::new(w, h).unwrap()
    }

    #[test]
    fn test_empty_grid() {
        let grid = Grid::new_empty();
        let size = s(5, 5);

        let expected = Rect::new((0, 0), (5, 5)).unwrap();

        for y in 0..size.height() {
            for x in 0..size.width() {
                let rect = grid.grid_containing_pos(size, (x, y));
                assert_eq!(rect, expected);
            }
        }
    }

    mod label {
        use super::*;

        #[test]
        fn test_num_labels() {
            let grid = Grid::new(vec![2, 4], vec![2, 4, 6]);

            assert_eq!(grid.num_labels(s(2, 2)), 1);
            assert_eq!(grid.num_labels(s(2, 3)), 2);
            assert_eq!(grid.num_labels(s(2, 4)), 2);
            assert_eq!(grid.num_labels(s(2, 5)), 3);
            assert_eq!(grid.num_labels(s(2, 6)), 3);
            assert_eq!(grid.num_labels(s(2, 7)), 4);
            assert_eq!(grid.num_labels(s(2, 8)), 4);
            assert_eq!(grid.num_labels(s(4, 2)), 2);
            assert_eq!(grid.num_labels(s(4, 3)), 4);
            assert_eq!(grid.num_labels(s(4, 4)), 4);
            assert_eq!(grid.num_labels(s(4, 5)), 6);
            assert_eq!(grid.num_labels(s(5, 4)), 6);
            assert_eq!(grid.num_labels(s(5, 5)), 9);
            assert_eq!(grid.num_labels(s(5, 6)), 9);
            assert_eq!(grid.num_labels(s(5, 7)), 12);
            assert_eq!(grid.num_labels(s(6, 5)), 9);
            assert_eq!(grid.num_labels(s(6, 6)), 9);
            assert_eq!(grid.num_labels(s(8, 5)), 9);
            assert_eq!(grid.num_labels(s(8, 8)), 12);
        }

        #[test]
        fn test_position_label() {
            let grid = Grid::new(vec![2, 4], vec![2, 4, 6]);
            let size = s(5, 5);

            let expected = [
                [0, 0, 1, 1, 2],
                [0, 0, 1, 1, 2],
                [3, 3, 4, 4, 5],
                [3, 3, 4, 4, 5],
                [6, 6, 7, 7, 8],
            ];

            let actual = (0..size.height())
                .map(|y| {
                    (0..size.width())
                        .map(|x| grid.position_label(size, (x, y)))
                        .collect::<Vec<_>>()
                })
                .collect::<Vec<_>>();

            assert_eq!(actual, expected);
        }
    }

    mod grids {
        use super::*;

        #[test]
        fn test_grid_containing_pos() {
            let grid = Grid::new(vec![2, 4], vec![2, 4, 6]);
            let size = s(5, 5);

            let rects = [
                Rect::new((0, 0), (2, 2)).unwrap(),
                Rect::new((2, 0), (4, 2)).unwrap(),
                Rect::new((4, 0), (5, 2)).unwrap(),
                Rect::new((0, 2), (2, 4)).unwrap(),
                Rect::new((2, 2), (4, 4)).unwrap(),
                Rect::new((4, 2), (5, 4)).unwrap(),
                Rect::new((0, 4), (2, 5)).unwrap(),
                Rect::new((2, 4), (4, 5)).unwrap(),
                Rect::new((4, 4), (5, 5)).unwrap(),
            ];

            let expected = [
                [0, 0, 1, 1, 2],
                [0, 0, 1, 1, 2],
                [3, 3, 4, 4, 5],
                [3, 3, 4, 4, 5],
                [6, 6, 7, 7, 8],
            ];

            for y in 0..size.height() {
                for x in 0..size.width() {
                    let rect = grid.grid_containing_pos(size, (x, y));
                    assert_eq!(rect, rects[expected[y as usize][x as usize]]);
                }
            }
        }
    }
}