words-game 0.1.0

Spelling game implementation
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

use std::ops;

#[derive(Clone, Copy, PartialEq, PartialOrd)]
pub struct Point {
    pub x: i32,
    pub y: i32,
}

impl Point {
    pub fn new(x: i32, y: i32) -> Point {
        Point { x, y }
    }
}

impl ops::Add<Direction> for Point {
    type Output = Self;

    fn add(self, rhs: Direction) -> Self {
        Point {
            x: self.x + rhs.x,
            y: self.y + rhs.y,
        }
    }
}

impl ops::AddAssign<Direction> for Point {
    fn add_assign(&mut self, other: Direction) {
        self.x += other.x;
        self.y += other.y;
    }
}

#[derive(Clone, Copy)]
pub struct Direction {
    pub x: i32,
    pub y: i32,
}

impl Direction {
    pub fn new(x: i32, y: i32) -> Direction {
        Direction { x, y }
    }

    pub fn is_horizontal(self) -> bool {
        self.x != 0
    }

    pub fn is_vertical(self) -> bool {
        self.y != 0
    }

    pub fn down() -> Direction { Direction::new(0, 1) }
    pub fn right() -> Direction { Direction::new(1, 0) }
    pub fn left() -> Direction { Direction::new(-1, 0) }
    pub fn up() -> Direction { Direction::new(0, -1) }
}

impl ops::Mul<i32> for Direction {
    type Output = Self;

    fn mul(self, rhs: i32) -> Self {
        Direction {
            x: self.x * rhs,
            y: self.y * rhs,
        }
    }
}

/**
 * Represents a strip of tiles on the board
 */
pub struct Strip {
    pub start: Point,
    pub dir: Direction,
    pub len: i32
}

impl Strip {
    pub fn new(start: Point, dir: Direction, len: i32) -> Self {
        Self {
            start,
            dir,
            len
        }
    }

    #[inline]
    fn is_between(val: i32, a: i32, b: i32) -> bool{
        if a < b {
            (a..b).contains(&val)
        } else {
            ((b+1)..=a).contains(&val)
        }
    }

    pub fn contains(&self, point: Point) -> bool {
        (
            point.x == self.start.x ||
            Self::is_between(point.x, self.start.x, self.start.x + self.dir.x * self.len)
        ) && (
            point.y == self.start.y ||
            Self::is_between(point.y, self.start.y, self.start.y + self.dir.y * self.len)
        )
    }

    /**
     * Get the distance of the point from the start of the strip
     */
    pub fn distance_in(&self, point: Point) -> Option<i32> {
        if !self.contains(point) {
            None
        } else {
            let dist = (point.x as i32 - self.start.x as i32).abs() +
                       (point.y as i32 - self.start.y as i32).abs();
            Some(dist)
        }
    }
}

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

    #[test]
    fn strip_contains_horizontal() {
        let s = Strip::new(
            Point::new(5, 5),
            Direction::new(1, 0),
            5
        );

        assert_eq!(s.contains(Point::new(5, 5)), true);
        assert_eq!(s.contains(Point::new(6, 5)), true);
        assert_eq!(s.contains(Point::new(10, 5)), false);

        assert_eq!(s.contains(Point::new(5, 6)), false);
        assert_eq!(s.contains(Point::new(5, 4)), false);

        assert_eq!(s.contains(Point::new(4, 5)), false);
        assert_eq!(s.contains(Point::new(3, 5)), false);
    }

    #[test]
    fn strip_contains_vertical_negative() {
        let s = Strip::new(
            Point::new(5, 5),
            Direction::new(0, -1),
            5
        );

        assert_eq!(s.contains(Point::new(5, 5)), true);
        assert_eq!(s.contains(Point::new(6, 5)), false);
        assert_eq!(s.contains(Point::new(10, 5)), false);

        assert_eq!(s.contains(Point::new(5, 4)), true);
        assert_eq!(s.contains(Point::new(5, 1)), true);
        assert_eq!(s.contains(Point::new(5, 0)), false);

        assert_eq!(s.contains(Point::new(5, 6)), false);
    }
}