-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmanualTests.py
43 lines (36 loc) · 1012 Bytes
/
manualTests.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
import numpy as np
import brute
import greedy
## Manual example
x = np.zeros((4,4,4,4))
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
x[i,j,k,l] = np.exp(i*j + k*l)
print('Manual Test:')
print([v.shape for v in brute.findBest(x, 1e-6)[2]])
print([v.shape for v in greedy.findBest(x, 1e-6)])
print('---')
x = np.zeros((4,4,4,4,4))
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
for m in range(4):
x[i,j,k,l,m] = np.exp(i*j + k*l + m)
print('Manual Test:')
print([v.shape for v in brute.findBest(x, 1e-6)[2]])
print([v.shape for v in greedy.findBest(x, 1e-6)])
print('---')
x = np.zeros((4,4,4,4,4))
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
for m in range(4):
x[i,j,k,l,m] = np.exp(i*j + k*l + m) + np.sin(i*j)*np.cos(k*l)*np.tanh(m)
print('Manual Test:')
print([v.shape for v in brute.findBest(x, 1e-6)[2]])
print([v.shape for v in greedy.findBest(x, 1e-6)])
print('---')