/
set_test.go
160 lines (133 loc) · 2.65 KB
/
set_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
package set
import (
"fmt"
"testing"
"github.com/google/go-cmp/cmp"
"github.com/google/go-cmp/cmp/cmpopts"
)
func getAllAsInt(fn func(Iterator)) (all []int) {
it := func(item Item) bool {
all = append(all, int(item.(Int)))
return true
}
fn(it)
return
}
type myItem struct {
i int
}
func (i myItem) Key() int {
return i.i
}
func TestSet(t *testing.T) {
all := []int{0, 1, 2, 3, 4, 5}
toDelete := []int{0, 2, 4}
want := []int{1, 3, 5}
cases := []struct {
set Interface
}{
{
NewSet(10),
},
{
NewSetMap(10),
},
}
for _, c := range cases {
for _, item := range all {
c.set.Append(Int(item))
}
for _, item := range toDelete {
c.set.Delete(myItem{item})
}
got := getAllAsInt(c.set.All)
opt := cmpopts.SortSlices(func(x, y int) bool {
return x < y
})
if d := cmp.Diff(want, got, opt); d != "" {
t.Error(d)
}
}
}
func BenchmarkSet(b *testing.B) {
for _, benchmarkSetSize := range []int64{1000, 10000 * 100} {
cases := []struct {
desc string
newSet func() Interface
}{
{
desc: "Set",
newSet: func() Interface {
return NewSet(int(benchmarkSetSize))
},
},
{
desc: "SetMap",
newSet: func() Interface {
return NewSetMap(int(benchmarkSetSize))
},
},
}
b.Run(fmt.Sprintf("%d", benchmarkSetSize), func(b *testing.B) {
for _, c := range cases {
b.Run(c.desc, func(b *testing.B) {
b.Run("Append", func(b *testing.B) {
set := c.newSet()
var i int64
b.ResetTimer()
for i = 0; i < benchmarkSetSize; i++ {
set.Append(Int(i))
}
})
b.Run("Delete", func(b *testing.B) {
set := c.newSet()
var i int64
for i = 0; i < benchmarkSetSize; i++ {
set.Append(Int(i))
}
b.ResetTimer()
for i = 0; i < benchmarkSetSize; i++ {
set.Delete(Int(i))
}
})
b.Run("All", func(b *testing.B) {
set := c.newSet()
var i int64
for i = 0; i < benchmarkSetSize; i++ {
set.Append(Int(i))
}
b.ResetTimer()
set.All(func(item Item) bool {
i += int64(item.(Int))
return true
})
})
})
}
})
}
}
// SetMap provie list which satisfy Interface interface.
// This list simply use map as internal data structure.
type SetMap struct {
items map[interface{}]Item
}
func NewSetMap(c int) *SetMap {
return &SetMap{
items: make(map[interface{}]Item, c),
}
}
func (s *SetMap) All(fn Iterator) {
for _, item := range s.items {
if !fn(item) {
break
}
}
}
func (s *SetMap) Delete(item Item) Item {
delete(s.items, item.Key())
return nil // dummy
}
func (s *SetMap) Append(item Item) {
s.items[item.Key()] = item
}