-
-
Notifications
You must be signed in to change notification settings - Fork 21
Expand file tree
/
Copy pathmain.py
More file actions
61 lines (54 loc) · 1.43 KB
/
main.py
File metadata and controls
61 lines (54 loc) · 1.43 KB
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
import arrays_bp as bp
def main() -> None:
m = bp.M()
for i in range(7):
m.a[i] = i
for i in range(7):
m.b[i] = i
for i in range(7):
m.c[i] = i
for i in range(7):
m.d[i] = i
for i in range(7):
m.e[i] = i + 11811
for i in range(7):
m.f[i] = bp.Note(i, False, [j for j in range(1, 8)])
for i in range(7):
for j in range(7):
m.t[i][j] = i + j + 1291291
m.x[0] = -13
m.x[1] = -89
m.x[2] = 13
m.g = bp.Note(2, False, [7, 2, 3, 4, 5, 6, 7])
s = m.encode()
for x in s:
print(x, end=" ")
m1 = bp.M()
m1.decode(s)
for i in range(7):
assert m1.a[i] == m.a[i]
for i in range(7):
assert m1.b[i] == m.b[i]
for i in range(7):
assert m1.c[i] == m.c[i]
for i in range(7):
assert m1.d[i] == m.d[i]
for i in range(7):
assert m1.e[i] == m.e[i]
for i in range(7):
for j in range(7):
assert m1.f[i].arr[j] == m.f[i].arr[j]
assert m1.f[i].number == m.f[i].number
assert m1.f[i].ok == m.f[i].ok
for j in range(7):
assert m1.g.arr[j] == m.g.arr[j]
assert m1.g.number == m.g.number
assert m1.g.ok == m.g.ok
for i in range(7):
for j in range(7):
assert m1.t[i][j] == m.t[i][j]
assert m1.x[0] == m.x[0]
assert m1.x[1] == m.x[1]
assert m1.x[2] == m.x[2]
if __name__ == "__main__":
main()