-
Notifications
You must be signed in to change notification settings - Fork 491
/
combine_test.go
137 lines (135 loc) · 2.14 KB
/
combine_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
package kapacitor
import (
"reflect"
"testing"
)
func Test_Combination_Count(t *testing.T) {
c := combination{max: 1e9}
testCases := []struct {
n, k, exp int64
}{
{
n: 1,
k: 0,
exp: 1,
},
{
n: 1,
k: 1,
exp: 1,
},
{
n: 2,
k: 1,
exp: 2,
},
{
n: 5,
k: 2,
exp: 10,
},
{
n: 5,
k: 3,
exp: 10,
},
{
n: 52,
k: 5,
exp: 2598960,
},
}
for _, tc := range testCases {
if exp, got := tc.exp, c.Count(tc.n, tc.k); exp != got {
t.Errorf("unexpected combination count for %d choose %d: got %d exp %d", tc.n, tc.k, got, exp)
}
}
}
func Test_Combination_Do(t *testing.T) {
c := combination{max: 1e9}
testCases := []struct {
n, k int
exp [][]int
}{
{
n: 1,
k: 1,
exp: [][]int{{0}},
},
{
n: 5,
k: 2,
exp: [][]int{
{0, 1},
{0, 2},
{0, 3},
{0, 4},
{1, 2},
{1, 3},
{1, 4},
{2, 3},
{2, 4},
{3, 4},
},
},
{
n: 5,
k: 3,
exp: [][]int{
{0, 1, 2},
{0, 1, 3},
{0, 1, 4},
{0, 2, 3},
{0, 2, 4},
{0, 3, 4},
{1, 2, 3},
{1, 2, 4},
{1, 3, 4},
{2, 3, 4},
},
},
{
n: 7,
k: 5,
exp: [][]int{
{0, 1, 2, 3, 4},
{0, 1, 2, 3, 5},
{0, 1, 2, 3, 6},
{0, 1, 2, 4, 5},
{0, 1, 2, 4, 6},
{0, 1, 2, 5, 6},
{0, 1, 3, 4, 5},
{0, 1, 3, 4, 6},
{0, 1, 3, 5, 6},
{0, 1, 4, 5, 6},
{0, 2, 3, 4, 5},
{0, 2, 3, 4, 6},
{0, 2, 3, 5, 6},
{0, 2, 4, 5, 6},
{0, 3, 4, 5, 6},
{1, 2, 3, 4, 5},
{1, 2, 3, 4, 6},
{1, 2, 3, 5, 6},
{1, 2, 4, 5, 6},
{1, 3, 4, 5, 6},
{2, 3, 4, 5, 6},
},
},
}
for _, tc := range testCases {
i := 0
c.Do(tc.n, tc.k, func(indices []int) error {
if i == len(tc.exp) {
t.Fatalf("too many combinations returned for %d choose %d: got %v", tc.n, tc.k, indices)
}
if !reflect.DeepEqual(tc.exp[i], indices) {
t.Errorf("unexpected combination set for %d choose %d index %d: got %v exp %v", tc.n, tc.k, i, indices, tc.exp[i])
}
i++
return nil
})
if i != len(tc.exp) {
t.Errorf("not enough combinations returned for %d choose %d", tc.n, tc.k)
}
}
}