-
Notifications
You must be signed in to change notification settings - Fork 0
/
uintSlices_test.go
104 lines (97 loc) · 2.77 KB
/
uintSlices_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
// Code generated by yasupGen; DO NOT EDIT.
package yasup_test
import (
yasup "github.com/j4rv/yasup"
"testing"
)
func Test_UintInsert(t *testing.T) {
type testCase struct {
name string
slice []uint
insertAt int
}
base := []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
tcs := []testCase{
{"First", []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, 0},
{"Middle", []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, len(base) / 2},
{"Last", []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, len(base)},
{"Empty slice", []uint{}, 0},
{"Nil slice", nil, 0},
}
for _, tc := range tcs {
yasup.UintInsert(&tc.slice, 4294967295, tc.insertAt)
if tc.slice[tc.insertAt] != (4294967295) {
t.Error(tc)
}
}
}
func Test_UintFastShuffle(t *testing.T) {
shuffles := [][]uint{}
for i := 0; i < 8; i++ {
or := []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
yasup.UintFastShuffle(or)
shuffles = append(shuffles, or)
}
for i := range shuffles {
for j := range shuffles {
if i >= j {
continue
}
if yasup.UintEquals(shuffles[i], shuffles[j]) {
// If there is any collision in 8 shuffles, the Shuffle function is probably broken
t.Fail()
}
}
}
// check that nil does not panic
yasup.UintFastShuffle(nil)
}
func Test_UintSecureShuffle(t *testing.T) {
shuffles := [][]uint{}
for i := 0; i < 8; i++ {
or := []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
yasup.UintSecureShuffle(or)
shuffles = append(shuffles, or)
}
for i := range shuffles {
for j := range shuffles {
if i >= j {
continue
}
if yasup.UintEquals(shuffles[i], shuffles[j]) {
// If there is any collision in 8 shuffles, the Shuffle function is probably broken
t.Fail()
}
}
}
// check that nil does not panic
yasup.UintSecureShuffle(nil)
}
func Test_UintEquals(t *testing.T) {
type TestCase struct {
name string
a, b []uint
exp bool
}
tcs := []TestCase{
// nil checks
{"Equals nil", nil, nil, true},
// golang treats empty and nil slices as the same thing in most cases, we'll do the same
{"Left nil, right empty", nil, []uint{}, true},
{"Right nil, left empty", []uint{}, nil, true},
{"Left nil, right not empty", nil, []uint{4294967295}, false},
{"Right nil, left not empty", []uint{4294967295}, nil, false},
{"Equals empty", []uint{}, []uint{}, true},
{"Equals 1", []uint{4294967295}, []uint{4294967295}, true},
{"Equals 2", []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, true},
{"Not equals 1", []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 4294967295}, false},
{"Not equals 2", []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, []uint{}, false},
{"Not equals 3", []uint{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, []uint{4294967295, 4294967295}, false},
}
for _, tc := range tcs {
got := yasup.UintEquals(tc.a, tc.b)
if got != tc.exp {
t.Error(tc)
}
}
}