-
Notifications
You must be signed in to change notification settings - Fork 2
/
pair.py
163 lines (138 loc) · 4.24 KB
/
pair.py
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
from math import sqrt
from random import randrange
class Pair:
"""
Represents a position in 2D grid space.
All arguments or their contents must be integers.
"""
def __init__(self, x=0, y: int = 0):
if isinstance(x, tuple):
self.x = x[0]
self.y = x[1]
elif isinstance(x, int) and isinstance(y, int):
self.x = x
self.y = y
else:
raise TypeError
def in_bound(self, x_bound, y_bound):
return 0 <= self.x < x_bound and 0 <= self.y < y_bound
def norm(self):
return sqrt(self.x ** 2 + self.y ** 2)
def square_norm(self):
abs_self = abs(self)
return max(abs_self.x, abs_self.y)
def linear_norm(self):
return abs(self.x) + abs(self.y)
@staticmethod
def rand(bounds: int):
"""
Returns a random pair with
-bounds <= x <= bounds,
-bounds <= x <= bounds.
"""
return Pair(
randrange(-bounds, bounds+1),
randrange(-bounds, bounds+1))
def ceil(self, radius: int):
x = self.x
y = self.y
if self.x < -radius:
x = -radius
elif self.x > radius:
x = radius
if self.y < -radius:
y = -radius
elif self.y > radius:
y = radius
return Pair(x, y)
def wall(self, width: int):
"""
Returns a unit point in the direction of
the closest wall bounded by width.
"""
x = int(round(self.x / width * 2 - 1))
y = int(round(self.y / width * 2 - 1))
return Pair(x, y)
def __abs__(self):
return Pair(abs(self.x), abs(self.y))
def __add__(self, other):
if isinstance(other, Pair):
return Pair(self.x + other.x, self.y + other.y)
else:
return NotImplemented
def __iadd__(self, other):
if isinstance(other, Pair):
self.x += other.x
self.y += other.y
return self
else:
return NotImplemented
def __sub__(self, other):
if isinstance(other, Pair):
return Pair(self.x - other.x, self.y - other.y)
else:
return NotImplemented
def __neg__(self):
return Pair(-self.x, -self.y)
def __mul__(self, other):
if isinstance(other, int):
return Pair(self.x * other, self.y * other)
elif isinstance(other, float):
x = int(round(self.x * other))
y = int(round(self.y * other))
return Pair(x, y)
else:
return NotImplemented
def __imul__(self, other):
return self.__mul__(other)
def __floordiv__(self, other):
return self * (1/other)
def __repr__(self):
return f'({self.x},{self.y})'
def __hash__(self):
return hash((self.x, self.y))
def __eq__(self, other):
if not isinstance(other, Pair):
return False
return self.x == other.x and self.y == other.y
def __ne__(self, other):
if isinstance(other, Pair):
return self.x != other.x or self.y != other.y
else:
return NotImplemented
def __lt__(self, other):
if isinstance(other, Pair):
return self.y < other.y or \
(
self.y == other.y and
self.x < other.x
)
else:
return NotImplemented
def __gt__(self, other):
if isinstance(other, Pair):
return self.y > other.y or \
(
self.y == other.y and
self.x > other.x
)
else:
return NotImplemented
def __le__(self, other):
if isinstance(other, Pair):
return self.y < other.y or \
(
self.y == other.y and
self.x <= other.x
)
else:
return NotImplemented
def __ge__(self, other):
if isinstance(other, Pair):
return self.y > other.y or \
(
self.y == other.y and
self.x >= other.x
)
else:
return NotImplemented