-
Notifications
You must be signed in to change notification settings - Fork 2
/
bitset_test.go
46 lines (42 loc) · 995 Bytes
/
bitset_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
// Copyright (c) 2022, Janoš Guljaš <[email protected]>
// All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package schulze
import (
"math/rand"
"testing"
"time"
)
func TestBitSet(t *testing.T) {
contains := func(i uint64, values []uint64) bool {
for _, v := range values {
if i == v {
return true
}
}
return false
}
seed := time.Now().UnixNano()
r := rand.New(rand.NewSource(seed))
size := uint64(r.Intn(12345))
s := newBitset(size)
values := make([]uint64, 0)
for i, count := uint64(0), uint64(r.Intn(100)); i < count; i++ {
values = append(values, uint64(r.Intn(int(size))))
}
for _, v := range values {
s.set(v)
}
for i := uint64(0); i < size; i++ {
if contains(i, values) {
if !s.isSet(i) {
t.Errorf("expected value %v is not set (seed %v)", i, seed)
}
} else {
if s.isSet(i) {
t.Errorf("value %v is unexpectedly set (seed %v)", i, seed)
}
}
}
}