-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtree_test.go
150 lines (142 loc) · 2.32 KB
/
tree_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
package tree
import (
"fmt"
)
// Accept
func ExampleAcceptDuplicates() {
tree := NewTree(2, false)
for i := 1; i < 7; i++ {
tree.AddLeaf(i)
}
for i := 1; i < 7; i++ {
tree.AddLeaf(i)
}
fmt.Println(tree)
// Output:
// 0
// 0/0
// 0/0/0
// 0/0/0/0
// 0/0/0/0/0/1
// 0/0/0/0/1/2
// 0/0/0/1
// 0/0/0/1/0/3
// 0/0/0/1/1/4
// 0/0/1
// 0/0/1/0
// 0/0/1/0/0/5
// 0/0/1/0/1/6
// 0/0/1/1
// 0/0/1/1/0/1
// 0/0/1/1/1/2
// 0/1
// 0/1/0
// 0/1/0/0
// 0/1/0/0/0/3
// 0/1/0/0/1/4
// 0/1/0/1
// 0/1/0/1/0/5
// 0/1/0/1/1/6
// Added: 12
// Rejected: 0
}
// Reject
type Test_ctx int
func (c Test_ctx) Eq(other interface{}) bool {
return c == other
}
func (c Test_ctx) Key() interface{} {
return c
}
func ExampleRejectDuplicates() {
tree := NewTree(2, true)
var i Test_ctx
for i = 1; i < 7; i++ {
tree.AddLeaf(i)
}
for i = 1; i < 7; i++ {
tree.AddLeaf(i)
}
fmt.Println(tree)
// Output:
// 0
// 0/0
// 0/0/0
// 0/0/0/0/1
// 0/0/0/1/2
// 0/0/1
// 0/0/1/0/3
// 0/0/1/1/4
// 0/1
// 0/1/0
// 0/1/0/0/5
// 0/1/0/1/6
// Added: 6
// Rejected: 6
}
func ExampleEquals() {
tree := NewTree(2, true)
var i Test_ctx
for i = 1; i < 100; i++ {
tree.AddLeaf(i)
}
tree2 := NewTree(2, true)
for i = 1; i < 100; i++ {
tree2.AddLeaf(i)
}
fmt.Println(tree.Eq(tree2))
// Output:
// true <nil>
}
func ExampleNotEqualsStructuresDiffer() {
tree := NewTree(4, true)
var i Test_ctx
for i = 1; i < 100; i++ {
tree.AddLeaf(i)
}
tree2 := NewTree(2, true)
for i = 1; i < 100; i++ {
tree2.AddLeaf(i)
}
fmt.Println(tree.Eq(tree2))
// Output:
// false trees have different sizes or structures
}
func ExampleNotEqualsSizessDiffer() {
tree := NewTree(2, true)
var i Test_ctx
for i = 1; i < 100; i++ {
tree.AddLeaf(i)
}
tree2 := NewTree(2, true)
for i = 1; i < 101; i++ {
tree2.AddLeaf(i)
}
fmt.Println(tree.Eq(tree2))
// Output:
// false trees have different sizes or structures
}
func ExampleNotEqualContextsDiffer() {
tree := NewTree(2, true)
var i Test_ctx
for i = 1; i < 100; i++ {
tree.AddLeaf(i)
}
tree2 := NewTree(2, true)
for i = 1; i < 100; i++ {
tree2.AddLeaf(i + 1)
}
fmt.Println(tree.Eq(tree2))
// Output:
// false contexts don't match
}
func ExampleSize() {
tree := NewTree(4, true)
var i Test_ctx
for i = 0; i < 100; i++ {
tree.AddLeaf(i)
}
fmt.Println(tree.Added)
// Output:
// 100
}