/
set_test.go
79 lines (61 loc) · 1.43 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
// Copyright (C) 2023 Storj Labs, Inc.
// See LICENSE for copying information.
package intset_test
import (
"testing"
"github.com/stretchr/testify/require"
"storj.io/storj/private/intset"
)
func TestSet(t *testing.T) {
set := intset.NewSet(5)
require.Zero(t, set.Count())
for i := -1; i < 10; i++ {
set.Include(i)
}
require.Equal(t, 5, set.Count())
for i := 0; i < 5; i++ {
require.True(t, set.Contains(i))
set.Exclude(i)
}
for i := -1; i < 10; i++ {
require.False(t, set.Contains(i), "#%d", i)
}
}
func TestCopySet(t *testing.T) {
setA := intset.NewSet(10)
setB := intset.NewSet(10)
for i := 0; i < 10; i++ {
if i%2 == 0 {
setA.Include(i)
} else {
setB.Include(i)
}
}
require.Equal(t, 5, setA.Count())
require.Equal(t, 5, setB.Count())
setC := intset.NewSet(10)
setC.Add(setA, setB)
for i := 0; i < 10; i++ {
require.True(t, setC.Contains(i))
}
require.Equal(t, 10, setC.Count())
setD := intset.NewSet(3)
setE := intset.NewSet(3)
setE.Include(0)
setE.Include(2)
// set with different initial size will be ignored while adding
setF := intset.NewSet(5)
setF.Include(1)
setD.Add(setE, setF)
require.Equal(t, 2, setD.Count())
for i, contains := range []bool{true, false, true, false, false} {
require.Equal(t, contains, setD.Contains(i), "#%d", i)
}
}
func BenchmarkIntSet(b *testing.B) {
b.Run("create", func(b *testing.B) {
for i := 0; i < b.N; i++ {
_ = intset.NewSet(1000)
}
})
}