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

//! Defines the [`AsAlgorithmSlice`] trait.

use crate::algorithm::{algorithm::Algorithm, slice::AlgorithmSlice};

/// Conversion to [`AlgorithmSlice`].
pub trait AsAlgorithmSlice<'a> {
    /// Converts `self` to an [`AlgorithmSlice`].
    fn as_slice(&'a self) -> AlgorithmSlice<'a>;
}

impl<'a> AsAlgorithmSlice<'a> for Algorithm {
    /// Returns an [`AlgorithmSlice`] containing the entire algorithm.
    fn as_slice(&'a self) -> AlgorithmSlice<'a> {
        AlgorithmSlice {
            first: None,
            middle: &self.moves,
            last: None,
        }
    }
}

impl<'a> AsAlgorithmSlice<'a> for AlgorithmSlice<'a> {
    fn as_slice(&'a self) -> Self {
        *self
    }
}

#[cfg(test)]
mod tests {
    use std::str::FromStr as _;

    use crate::algorithm::{
        algorithm::Algorithm, as_slice::AsAlgorithmSlice as _, r#move::r#move::Move,
        slice::AlgorithmSlice,
    };

    #[test]
    fn test_algorithm() {
        let a = Algorithm::from_str("U2LD3R").unwrap();
        let b = a.as_slice();
        assert_eq!(
            b,
            AlgorithmSlice {
                first: None,
                middle: &a.moves,
                last: None
            }
        );
    }

    #[test]
    fn test_algorithm_slice() -> Result<(), Box<dyn std::error::Error>> {
        let a = AlgorithmSlice {
            first: Some(Move::from_str("R3")?),
            middle: &[Move::from_str("D")?, Move::from_str("L2")?],
            last: Some(Move::from_str("U6")?),
        };
        let b = a.as_slice();

        assert_eq!(a, b);

        // Make sure we aren't somehow doing a deep copy
        assert_eq!(a.middle.as_ptr(), b.middle.as_ptr());

        Ok(())
    }
}