-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathorder_test.go
109 lines (89 loc) · 2.81 KB
/
order_test.go
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
package gwc
import (
"math/rand"
"testing"
"github.com/stretchr/testify/assert"
)
func newAbcdNodeSuperposition() NodeSuperposition {
return NodeSuperposition{
func(_ *rand.Rand, _ NodeEnvironment) (NodeProbability, NodeState) {
return 5, "A"
},
func(_ *rand.Rand, _ NodeEnvironment) (NodeProbability, NodeState) {
return 2, "B"
},
func(_ *rand.Rand, _ NodeEnvironment) (NodeProbability, NodeState) {
return 3, "C"
},
func(_ *rand.Rand, _ NodeEnvironment) (NodeProbability, NodeState) {
return 0, "D"
},
}
}
func Test_RandomCollapseOrder(t *testing.T) {
super := newAbcdNodeSuperposition()
nodes := newDefaultTestNodes(super...)
rnd := rand.New(rand.NewSource(42))
sim := New(rnd, RandomCollapseOrder, nodes)
collapsed := sim.Collapse()
assert.EqualValues(t, NodeStates{"A", "C", "C", "A", "A", "B", "C"}, collapsed.States())
assert.EqualValues(t, NodeIDs{"0", "1", "6", "4", "3", "5", "2"}, collapsed.Collapsed())
}
func Test_RandomStreakCollapseOrder(t *testing.T) {
super := newAbcdNodeSuperposition()
nodes := newDefaultTestNodes(super...)
rnd := rand.New(rand.NewSource(420))
sim := New(rnd, RandomStreakCollapseOrder, nodes)
collapsed := sim.Collapse()
assert.EqualValues(t, NodeStates{"B", "A", "A", "A", "C", "A", "C"}, collapsed.States())
assert.EqualValues(t, NodeIDs{"2", "1", "0", "4", "5", "3", "6"}, collapsed.Collapsed())
}
func Test_AscendingCollapseOrder(t *testing.T) {
nodes := newDefaultTestNodes()
rnd := rand.New(rand.NewSource(1337))
sim := New(rnd, AscendingCollapseOrder, nodes)
collapsed := sim.Collapse()
assert.EqualValues(t, NodeIDs{"0", "1", "2", "3", "4", "5", "6"}, collapsed.Collapsed())
}
func Test_DescendingCollapseOrder(t *testing.T) {
nodes := newDefaultTestNodes()
rnd := rand.New(rand.NewSource(3141))
sim := New(rnd, DescendingCollapseOrder, nodes)
collapsed := sim.Collapse()
assert.EqualValues(t, NodeIDs{"6", "5", "4", "3", "2", "1", "0"}, collapsed.Collapsed())
}
func Test_EmptyNodes(t *testing.T) {
rnd := rand.New(rand.NewSource(1337))
env := NewNodeEnvironment(Nodes{})
orders := []CollapseOrderFn{
RandomCollapseOrder,
RandomStreakCollapseOrder,
AscendingCollapseOrder,
DescendingCollapseOrder,
}
for _, order := range orders {
next := order(rnd, *env)
assert.Empty(t, next)
}
}
func Test_LinearNodes(t *testing.T) {
nodes := newLinearNodes()
orders := []CollapseOrderFn{
RandomCollapseOrder,
RandomStreakCollapseOrder,
AscendingCollapseOrder,
DescendingCollapseOrder,
}
expected := []NodeIDs{
NodeIDs{"1", "3", "2", "0"},
NodeIDs{"1", "0", "3", "2"},
NodeIDs{"0", "1", "2", "3"},
NodeIDs{"3", "2", "1", "0"},
}
for i, order := range orders {
rnd := rand.New(rand.NewSource(1337))
sim := New(rnd, order, nodes)
collapsed := sim.Collapse()
assert.EqualValues(t, expected[i], collapsed.Collapsed())
}
}