-
Notifications
You must be signed in to change notification settings - Fork 34
/
options_test.go
207 lines (174 loc) · 6.08 KB
/
options_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
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
package dag
import (
"encoding/json"
"testing"
)
type testNonComparableVertexType struct {
ID string `json:"i"`
NotComparableField map[string]string `json:"v"`
}
func TestOverrideVertexHashFunOption(t *testing.T) {
dag := NewDAG()
/* 1 4
* |\ /
* | 2
* |/
* 3
*/
dag.Options(Options{
VertexHashFunc: func(v interface{}) interface{} {
return v.(testNonComparableVertexType).ID
}})
testVertex1 := testNonComparableVertexType{
ID: "1",
NotComparableField: map[string]string{"not": "comparable"},
}
vertexId1, err := dag.addVertex(testVertex1)
if err != nil {
t.Errorf("Should create a vertex with a not comparable field when a correct VertexHashFunc option is set")
}
testVertex2 := testNonComparableVertexType{
ID: "2",
NotComparableField: map[string]string{"stillNot": "comparable"},
}
vertexId2, err := dag.addVertex(testVertex2)
if err != nil {
t.Errorf("Should create a vertex with a not comparable field when a correct VertexHashFunc option is set")
}
err = dag.AddEdge(vertexId1, vertexId2)
if err != nil {
t.Errorf("Should create an edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
testVertex3 := testNonComparableVertexType{
ID: "3",
NotComparableField: map[string]string{"stillNot": "comparable"},
}
vertexId3, err := dag.addVertex(testVertex3)
if err != nil {
t.Errorf("Should create a vertex with a not comparable field when a correct VertexHashFunc option is set")
}
err = dag.AddEdge(vertexId1, vertexId3)
if err != nil {
t.Errorf("Should create an edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
err = dag.AddEdge(vertexId2, vertexId3)
if err != nil {
t.Errorf("Should create an edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
testVertex4 := testNonComparableVertexType{
ID: "4",
NotComparableField: map[string]string{"stillNot": "comparable"},
}
vertexId4, err := dag.addVertex(testVertex4)
if err != nil {
t.Errorf("Should create a vertex with a not comparable field when a correct VertexHashFunc option is set")
}
err = dag.AddEdge(vertexId4, vertexId2)
if err != nil {
t.Errorf("Should create an edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
isEdge, err := dag.IsEdge(vertexId1, vertexId2)
if !isEdge || err != nil {
t.Errorf("Should return true for edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
err = dag.DeleteEdge(vertexId1, vertexId3)
if err != nil {
t.Errorf("Should delete an edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
isEdge, err = dag.IsEdge(vertexId1, vertexId3)
if isEdge || err != nil {
t.Errorf("Should return false for edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
err = dag.DeleteVertex(vertexId2)
if err != nil {
t.Errorf("Should delete a vertex with not comparable fields when a correct VertexHashFunc option is set")
}
vertexId2, err = dag.addVertex(testVertex2)
if err != nil {
t.Errorf("Should create a vertex with a not comparable field when a correct VertexHashFunc option is set")
}
_ = dag.AddEdge(vertexId1, vertexId2)
_ = dag.AddEdge(vertexId2, vertexId3)
err = dag.AddEdge(vertexId4, vertexId2)
if err != nil {
t.Errorf("Should create an edge between vertices with not comparable fields when a correct VertexHashFunc option is set")
}
roots := dag.GetRoots()
if len(roots) != 2 {
t.Errorf("Should return 2 roots")
}
for rootId := range roots {
if isRoot, err := dag.IsRoot(rootId); !isRoot || err != nil {
t.Errorf("Should return true for root")
}
}
leaves := dag.GetLeaves()
if len(leaves) != 1 {
t.Errorf("Should return 1 leaf")
}
for leafId := range leaves {
if isLeaf, err := dag.IsLeaf(leafId); !isLeaf || err != nil {
t.Errorf("Should return true for leaf")
}
}
vertex2Parents, err := dag.GetParents(vertexId2)
if len(vertex2Parents) != 2 || err != nil {
t.Errorf("Should return 2 parents for vertex 2")
}
vertex2Children, err := dag.GetChildren(vertexId2)
if len(vertex2Children) != 1 || err != nil {
t.Errorf("Should return 1 child for vertex 2")
}
vertex3Ancestors, err := dag.GetAncestors(vertexId3)
if len(vertex3Ancestors) != 3 || err != nil {
t.Errorf("Should return 3 ancestors for vertex 3, received %d", len(vertex3Ancestors))
}
vertex3OrderedAncestors, err := dag.GetOrderedAncestors(vertexId3)
if len(vertex3OrderedAncestors) != 3 || err != nil {
t.Errorf("Should return 3 ancestors for vertex 3, received %d", len(vertex3OrderedAncestors))
}
vertex4Descendants, err := dag.GetDescendants(vertexId4)
if len(vertex4Descendants) != 2 || err != nil {
t.Errorf("Should return 2 descendants for vertex 4, received %d", len(vertex4Descendants))
}
vertex4OrderedDescendants, err := dag.GetOrderedDescendants(vertexId4)
if len(vertex4OrderedDescendants) != 2 || err != nil {
t.Errorf("Should return 2 descendants for vertex 4, received %d", len(vertex4OrderedDescendants))
}
_, _, err = dag.GetDescendantsGraph(vertexId1)
if err != nil {
t.Errorf("Should return a string representation of the descendants graph")
}
_, _, err = dag.GetAncestorsGraph(vertexId1)
if err != nil {
t.Errorf("Should return a string representation of the ancestors graph")
}
_, err = dag.Copy()
if err != nil {
t.Errorf("Should return a copy of the DAG")
}
dagString := dag.String()
if dagString == "" {
t.Errorf("Should return a string representation of the DAG")
}
dag.ReduceTransitively()
dag.FlushCaches()
dag.DescendantsWalker(vertexId1) // nolint:errcheck
mv := newMarshalVisitor(dag)
dag.DFSWalk(mv)
dag.BFSWalk(mv)
dag.OrderedWalk(mv)
_, err = dag.MarshalJSON()
if err != nil {
t.Error(err)
}
data, err := json.Marshal(dag)
if err != nil {
t.Error(err)
}
var wd testNonComparableStorableDAG
_, err = UnmarshalJSON(data, &wd, dag.options)
if err != nil {
t.Fatal(err)
}
}