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
|
// Copyright 2018 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package set
import (
"math/rand"
"testing"
)
const maxLimit = 1024
var toSet, toClear [maxLimit]bool
func init() {
r := rand.New(rand.NewSource(0))
for i := 0; i < maxLimit; i++ {
toSet[i] = r.Intn(2) == 0
toClear[i] = r.Intn(2) == 0
}
}
func TestInts(t *testing.T) {
ns := new(Ints)
// Check that set starts empty.
wantLen := 0
if ns.Len() != wantLen {
t.Errorf("init: Len() = %d, want %d", ns.Len(), wantLen)
}
for i := 0; i < maxLimit; i++ {
if ns.Has(uint64(i)) {
t.Errorf("init: Has(%d) = true, want false", i)
}
}
// Set some numbers.
for i, b := range toSet[:maxLimit] {
if b {
ns.Set(uint64(i))
wantLen++
}
}
// Check that integers were set.
if ns.Len() != wantLen {
t.Errorf("after Set: Len() = %d, want %d", ns.Len(), wantLen)
}
for i := 0; i < maxLimit; i++ {
if got := ns.Has(uint64(i)); got != toSet[i] {
t.Errorf("after Set: Has(%d) = %v, want %v", i, got, !got)
}
}
// Clear some numbers.
for i, b := range toClear[:maxLimit] {
if b {
ns.Clear(uint64(i))
if toSet[i] {
wantLen--
}
}
}
// Check that integers were cleared.
if ns.Len() != wantLen {
t.Errorf("after Clear: Len() = %d, want %d", ns.Len(), wantLen)
}
for i := 0; i < maxLimit; i++ {
if got := ns.Has(uint64(i)); got != toSet[i] && !toClear[i] {
t.Errorf("after Clear: Has(%d) = %v, want %v", i, got, !got)
}
}
}
|
