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
|
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct Point {
pub x: u8,
pub y: u8
}
impl Point {
pub fn new(x: u8, y: u8) -> Point {
Point { x, y }
}
pub fn move_left(&self) -> Option<Point> {
self.x.checked_sub(1).map(|x| Point {
x,
..*self
})
}
pub fn move_right(&self, size: &Point) -> Option<Point> {
if self.x + 1 >= size.x {
None
} else {
Some(Point {
x: self.x + 1,
..*self
})
}
}
pub fn wrapping_move_left(&mut self) {
self.x = self.x.wrapping_sub(1);
}
pub fn wrapping_move_right(&mut self) {
self.x = self.x.wrapping_add(1);
}
pub fn to_bitfield(&self, width: u8) -> (u64, u64) {
if self.x >= width {
let index = self.y * width + self.x - width;
(0, 1 << index)
} else {
let index = self.y * width + self.x;
(1 << index, 0)
}
}
pub fn to_left_bitfield(&self, width: u8) -> u64 {
if self.x >= width {
0
} else {
let index = self.y * width + self.x;
1 << index
}
}
pub fn to_right_bitfield(&self, width: u8) -> u64 {
if self.x < width {
0
} else {
let index = self.y * width + self.x - width;
1 << index
}
}
pub fn to_either_bitfield(&self, width: u8) -> u64 {
if self.x >= width {
let index = self.y * width + self.x - width;
1 << index
} else {
let index = self.y * width + self.x;
1 << index
}
}
}
use std::cmp::Ord;
use std::cmp::Ordering;
impl PartialOrd for Point {
fn partial_cmp(&self, other: &Point) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl Ord for Point {
fn cmp(&self, other: &Point) -> Ordering {
self.y.cmp(&other.y).then(self.x.cmp(&other.x))
}
}
|
