forked from aimacode/aima-python
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_utils.py
303 lines (215 loc) · 9.01 KB
/
test_utils.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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
import pytest
from utils import *
import random
random.seed("aima-python")
def test_sequence():
assert sequence(1) == (1,)
assert sequence("helloworld") == "helloworld"
assert sequence({"hello": 4, "world": 5}) == ({"hello": 4, "world": 5},)
assert sequence([1, 2, 3]) == [1, 2, 3]
assert sequence((4, 5, 6)) == (4, 5, 6)
assert sequence([(1, 2), (2, 3), (4, 5)]) == [(1, 2), (2, 3), (4, 5)]
assert sequence(([1, 2], [3, 4], [5, 6])) == ([1, 2], [3, 4], [5, 6])
def test_remove_all_list():
assert remove_all(4, []) == []
assert remove_all(4, [1, 2, 3, 4]) == [1, 2, 3]
assert remove_all(4, [4, 1, 4, 2, 3, 4, 4]) == [1, 2, 3]
assert remove_all(1, [2, 3, 4, 5, 6]) == [2, 3, 4, 5, 6]
def test_remove_all_string():
assert remove_all('s', '') == ''
assert remove_all('s', 'This is a test. Was a test.') == 'Thi i a tet. Wa a tet.'
assert remove_all('a', 'artificial intelligence: a modern approach') == 'rtificil intelligence: modern pproch'
def test_unique():
assert unique([1, 2, 3, 2, 1]) == [1, 2, 3]
assert unique([1, 5, 6, 7, 6, 5]) == [1, 5, 6, 7]
assert unique([1, 2, 3, 4, 5]) == [1, 2, 3, 4, 5]
def test_count():
assert count([1, 2, 3, 4, 2, 3, 4]) == 7
assert count("aldpeofmhngvia") == 14
assert count([True, False, True, True, False]) == 3
assert count([5 > 1, len("abc") == 3, 3 + 1 == 5]) == 2
assert count("aima") == 4
def test_multimap():
assert multimap([(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (4, 5)]) == \
{1: [2, 3, 4], 2: [3, 4], 4: [5]}
assert multimap([("a", 2), ("a", 3), ("a", 4), ("b", 3), ("b", 4), ("c", 5)]) == \
{'a': [2, 3, 4], 'b': [3, 4], 'c': [5]}
def test_product():
assert product([1, 2, 3, 4]) == 24
assert product(list(range(1, 11))) == 3628800
def test_first():
assert first('word') == 'w'
assert first('') is None
assert first('', 'empty') == 'empty'
assert first([1, 2, 3, 4, 5]) == 1
assert first([]) is None
assert first(range(10)) == 0
assert first(x for x in range(10) if x > 3) == 4
assert first(x for x in range(10) if x > 100) is None
assert first((1, 2, 3)) == 1
assert first(range(2, 10)) == 2
assert first([(1, 2), (1, 3), (1, 4)]) == (1, 2)
assert first({1: "one", 2: "two", 3: "three"}) == 1
def test_is_in():
e = []
assert is_in(e, [1, e, 3]) is True
assert is_in(e, [1, [], 3]) is False
def test_mode():
assert mode([12, 32, 2, 1, 2, 3, 2, 3, 2, 3, 44, 3, 12, 4, 9, 0, 3, 45, 3]) == 3
assert mode("absndkwoajfkalwpdlsdlfllalsflfdslgflal") == 'l'
assert mode("artificialintelligence") == 'i'
def test_power_set():
assert power_set([1, 2, 3]) == [(1,), (2,), (3,), (1, 2), (1, 3), (2, 3), (1, 2, 3)]
def test_histogram():
assert histogram([1, 2, 4, 2, 4, 5, 7, 9, 2, 1]) == [(1, 2), (2, 3), (4, 2), (5, 1), (7, 1), (9, 1)]
assert histogram([1, 2, 4, 2, 4, 5, 7, 9, 2, 1], 0, lambda x: x * x) == \
[(1, 2), (4, 3), (16, 2), (25, 1), (49, 1), (81, 1)]
assert histogram([1, 2, 4, 2, 4, 5, 7, 9, 2, 1], 1) == [(2, 3), (4, 2), (1, 2), (9, 1), (7, 1), (5, 1)]
def test_euclidean():
distance = euclidean_distance([1, 2], [3, 4])
assert round(distance, 2) == 2.83
distance = euclidean_distance([1, 2, 3], [4, 5, 6])
assert round(distance, 2) == 5.2
distance = euclidean_distance([0, 0, 0], [0, 0, 0])
assert distance == 0
def test_cross_entropy():
loss = cross_entropy_loss([1, 0], [0.9, 0.3])
assert round(loss, 2) == 0.23
loss = cross_entropy_loss([1, 0, 0, 1], [0.9, 0.3, 0.5, 0.75])
assert round(loss, 2) == 0.36
loss = cross_entropy_loss([1, 0, 0, 1, 1, 0, 1, 1], [0.9, 0.3, 0.5, 0.75, 0.85, 0.14, 0.93, 0.79])
assert round(loss, 2) == 0.26
def test_rms_error():
assert rms_error([2, 2], [2, 2]) == 0
assert rms_error((0, 0), (0, 1)) == np.sqrt(0.5)
assert rms_error((1, 0), (0, 1)) == 1
assert rms_error((0, 0), (0, -1)) == np.sqrt(0.5)
assert rms_error((0, 0.5), (0, -0.5)) == np.sqrt(0.5)
def test_manhattan_distance():
assert manhattan_distance([2, 2], [2, 2]) == 0
assert manhattan_distance([0, 0], [0, 1]) == 1
assert manhattan_distance([1, 0], [0, 1]) == 2
assert manhattan_distance([0, 0], [0, -1]) == 1
assert manhattan_distance([0, 0.5], [0, -0.5]) == 1
def test_mean_boolean_error():
assert mean_boolean_error([1, 1], [0, 0]) == 1
assert mean_boolean_error([0, 1], [1, 0]) == 1
assert mean_boolean_error([1, 1], [0, 1]) == 0.5
assert mean_boolean_error([0, 0], [0, 0]) == 0
assert mean_boolean_error([1, 1], [1, 1]) == 0
def test_mean_error():
assert mean_error([2, 2], [2, 2]) == 0
assert mean_error([0, 0], [0, 1]) == 0.5
assert mean_error([1, 0], [0, 1]) == 1
assert mean_error([0, 0], [0, -1]) == 0.5
assert mean_error([0, 0.5], [0, -0.5]) == 0.5
def test_dot_product():
assert dot_product([1, 2, 3], [1000, 100, 10]) == 1230
assert dot_product([1, 2, 3], [0, 0, 0]) == 0
def test_vector_add():
assert vector_add((0, 1), (8, 9)) == (8, 10)
assert vector_add((1, 1, 1), (2, 2, 2)) == (3, 3, 3)
def test_rounder():
assert rounder(5.3330000300330) == 5.3330
assert rounder(10.234566) == 10.2346
assert rounder([1.234566, 0.555555, 6.010101]) == [1.2346, 0.5556, 6.0101]
assert rounder([[1.234566, 0.555555, 6.010101],
[10.505050, 12.121212, 6.030303]]) == [[1.2346, 0.5556, 6.0101], [10.5051, 12.1212, 6.0303]]
def test_num_or_str():
assert num_or_str('42') == 42
assert num_or_str(' 42x ') == '42x'
def test_normalize():
assert normalize([1, 2, 1]) == [0.25, 0.5, 0.25]
def test_gaussian():
assert gaussian(1, 0.5, 0.7) == 0.6664492057835993
assert gaussian(5, 2, 4.5) == 0.19333405840142462
assert gaussian(3, 1, 3) == 0.3989422804014327
def test_weighted_choice():
choices = [('a', 0.5), ('b', 0.3), ('c', 0.2)]
choice = weighted_choice(choices)
assert choice in choices
def compare_list(x, y):
return all([elm_x == y[i] for i, elm_x in enumerate(x)])
def test_distance():
assert distance((1, 2), (5, 5)) == 5.0
def test_distance_squared():
assert distance_squared((1, 2), (5, 5)) == 25.0
def test_turn_heading():
assert turn_heading((0, 1), 1) == (-1, 0)
assert turn_heading((0, 1), -1) == (1, 0)
assert turn_heading((1, 0), 1) == (0, 1)
assert turn_heading((1, 0), -1) == (0, -1)
assert turn_heading((0, -1), 1) == (1, 0)
assert turn_heading((0, -1), -1) == (-1, 0)
assert turn_heading((-1, 0), 1) == (0, -1)
assert turn_heading((-1, 0), -1) == (0, 1)
def test_turn_left():
assert turn_left((0, 1)) == (-1, 0)
def test_turn_right():
assert turn_right((0, 1)) == (1, 0)
def test_step():
assert step(1) == step(0.5) == 1
assert step(0) == 1
assert step(-1) == step(-0.5) == 0
def test_Expr():
A, B, C = symbols('A, B, C')
assert symbols('A, B, C') == (Symbol('A'), Symbol('B'), Symbol('C'))
assert A.op == repr(A) == 'A'
assert arity(A) == 0 and A.args == ()
b = Expr('+', A, 1)
assert arity(b) == 2 and b.op == '+' and b.args == (A, 1)
u = Expr('-', b)
assert arity(u) == 1 and u.op == '-' and u.args == (b,)
assert (b ** u) == (b ** u)
assert (b ** u) != (u ** b)
assert A + b * C ** 2 == A + (b * (C ** 2))
ex = C + 1 / (A % 1)
assert list(subexpressions(ex)) == [(C + (1 / (A % 1))), C, (1 / (A % 1)), 1, (A % 1), A, 1]
assert A in subexpressions(ex)
assert B not in subexpressions(ex)
def test_expr():
P, Q, x, y, z, GP = symbols('P, Q, x, y, z, GP')
assert (expr(y + 2 * x)
== expr('y + 2 * x')
== Expr('+', y, Expr('*', 2, x)))
assert expr('P & Q ==> P') == Expr('==>', P & Q, P)
assert expr('P & Q <=> Q & P') == Expr('<=>', (P & Q), (Q & P))
assert expr('P(x) | P(y) & Q(z)') == (P(x) | (P(y) & Q(z)))
# x is grandparent of z if x is parent of y and y is parent of z:
assert (expr('GP(x, z) <== P(x, y) & P(y, z)') == Expr('<==', GP(x, z), P(x, y) & P(y, z)))
def test_min_priority_queue():
queue = PriorityQueue(f=lambda x: x[1])
queue.append((1, 100))
queue.append((2, 30))
queue.append((3, 50))
assert queue.pop() == (2, 30)
assert len(queue) == 2
assert queue[(3, 50)] == 50
assert (1, 100) in queue
del queue[(1, 100)]
assert (1, 100) not in queue
queue.extend([(1, 100), (4, 10)])
assert queue.pop() == (4, 10)
assert len(queue) == 2
def test_max_priority_queue():
queue = PriorityQueue(order='max', f=lambda x: x[1])
queue.append((1, 100))
queue.append((2, 30))
queue.append((3, 50))
assert queue.pop() == (1, 100)
def test_priority_queue_with_objects():
class Test:
def __init__(self, a, b):
self.a = a
self.b = b
def __eq__(self, other):
return self.a == other.a
queue = PriorityQueue(f=lambda x: x.b)
queue.append(Test(1, 100))
other = Test(1, 10)
assert queue[other] == 100
assert other in queue
del queue[other]
assert len(queue) == 0
if __name__ == '__main__':
pytest.main()