pack 0.4.0

Solver for packing puzzle.
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

//! Module related to locations in space.
use std::cmp::Ordering;
use std::fmt::{Display, Formatter, Error};

use super::super::vector::{VectorDifference, VectorAdd};
use super::{Transformable, CubeSymmetry, Translatable, Translation};

/// Position of a cubelet.
#[derive(Debug, PartialEq, Eq, Hash, Clone)]
pub struct Position<T> {
    base: T,
}

impl Position<(i8, i8, i8)> {
    /// Create  position at the given coordinates.
    pub fn new(x: i8, y: i8, z: i8) -> Position<(i8, i8, i8)> {
        Position { base: (x, y, z) }
    }
}

impl Position<(i8, i8)> {
    /// Create  position at the given coordinates.
    pub fn d2(x: i8, y: i8) -> Position<(i8, i8)> {
        Position { base: (x, y) }
    }
}


/// Move an entity to certain `Position`.
pub trait Positionable<T> {
    /// Determine the `Translation` which takes the entity to a `Position`.
    fn to(&self, other: &Self) -> Translation<T>;
}

impl<T> Positionable<T> for Position<T> where T: VectorDifference<T> {
    fn to(&self, other: &Self) -> Translation<T> {
        let translation: T = self.base.difference(&other.base);

        Translation::from(translation)
    }
}

/// Move an entity to a origin.
pub trait Normalizable<T> {
    /// Determine the `Translation` which takes the entity to standard reference `Position`.
    fn to_reference(&self) -> Translation<T>;
}

impl<T> Normalizable<T> for Position<T> where T: Normalizable<T> {
    fn to_reference(&self) -> Translation<T> {
        self.base.to_reference()
    }
}

impl Normalizable<(i8, i8, i8)> for (i8, i8, i8) {
    fn to_reference(&self) -> Translation<(i8, i8, i8)> {
        let translation = (-self.0, -self.1, -self.2);

        Translation::from(translation)
    }
}

impl Normalizable<(i8, i8)> for (i8, i8) {
    fn to_reference(&self) -> Translation<(i8, i8)> {
        let translation = (-self.0, -self.1);

        Translation::from(translation)
    }
}

impl Display for Position<(i8, i8, i8)> {
    fn fmt(&self, f: &mut Formatter) -> Result<(), Error> {
        write!(f, "({}, {}, {})", self.base.0, self.base.1, self.base.2)
    }
}

impl Display for Position<(i8, i8)> {
    fn fmt(&self, f: &mut Formatter) -> Result<(), Error> {
        write!(f, "({}, {})", self.base.0, self.base.1)
    }
}

impl<T> Ord for Position<T> where T: PartialOrd + Ord {
    fn cmp(&self, other: &Self) -> Ordering {
        self.base.cmp(&other.base)
    }
}

impl<T> PartialOrd for Position<T> where T: PartialOrd {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        self.base.partial_cmp(&other.base)
    }
}

impl<T> Transformable for Position<T> where T: Transformable {
    fn transform(&mut self, symmetry: &CubeSymmetry) {
        self.base.transform(&symmetry);
    }
}

impl<T> Translatable<T> for Position<T> where T: VectorAdd<T> {
    fn translate(&mut self, translation: &Translation<T>) {
        self.base.add(&translation.delta);
    }
}

/// Contract to find the minimal `Position`
pub trait MinimumPosition<T> where T: PartialOrd + Ord {
    /// Return the minimal `Position` for the entity.
    fn minimum_position(&self) -> Option<Position<T>>;
}

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

    #[test]
    fn positions_are_equal_on_values() {
        let a = Position::new(0, 1, 2);
        let b = Position::new(0, 1, 2);

        assert_eq!(a, b);
    }
}