-
Notifications
You must be signed in to change notification settings - Fork 0
/
permutations_test.go
160 lines (154 loc) · 2.83 KB
/
permutations_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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
package gocombinatorics
import (
"errors"
"reflect"
"testing"
)
func TestNewPermutationErrors(t *testing.T) {
testCases := []struct {
desc string
n int
k int
want_struct *Permutations[int]
want_err error
}{
{
desc: "k>n",
n: 3,
k: 4,
want_struct: nil,
want_err: errors.New("k must be less than or equal to len(input_data)"),
},
}
for _, tC := range testCases {
t.Run(tC.desc, func(t *testing.T) {
data := stepped_range(0, tC.n, 1)
got_struct, got_err := NewPermutations(data, tC.k)
if got_err == nil {
t.Errorf("NewPermutation() = %v, want %v", got_struct, tC.want_struct)
}
if got_err.Error() != tC.want_err.Error() {
t.Errorf("NewPermutation() = %v, want %v", got_err, tC.want_err)
}
})
}
}
func TestPermutationsNext(t *testing.T) {
testCases := []struct {
desc string
n int
k int
want [][]int
}{
{
desc: "n=2, k=1",
n: 2,
k: 1,
want: [][]int{
{0},
{1},
},
},
{
desc: "n=2, k=2",
n: 2,
k: 2,
want: [][]int{
{0, 1},
{1, 0},
},
},
{
desc: "n=5, k=3",
n: 5,
k: 3,
want: [][]int{
{0, 1, 2},
{0, 1, 3},
{0, 1, 4},
{0, 2, 1},
{0, 2, 3},
{0, 2, 4},
{0, 3, 1},
{0, 3, 2},
{0, 3, 4},
{0, 4, 1},
{0, 4, 2},
{0, 4, 3},
{1, 0, 2},
{1, 0, 3},
{1, 0, 4},
{1, 2, 0},
{1, 2, 3},
{1, 2, 4},
{1, 3, 0},
{1, 3, 2},
{1, 3, 4},
{1, 4, 0},
{1, 4, 2},
{1, 4, 3},
{2, 0, 1},
{2, 0, 3},
{2, 0, 4},
{2, 1, 0},
{2, 1, 3},
{2, 1, 4},
{2, 3, 0},
{2, 3, 1},
{2, 3, 4},
{2, 4, 0},
{2, 4, 1},
{2, 4, 3},
{3, 0, 1},
{3, 0, 2},
{3, 0, 4},
{3, 1, 0},
{3, 1, 2},
{3, 1, 4},
{3, 2, 0},
{3, 2, 1},
{3, 2, 4},
{3, 4, 0},
{3, 4, 1},
{3, 4, 2},
{4, 0, 1},
{4, 0, 2},
{4, 0, 3},
{4, 1, 0},
{4, 1, 2},
{4, 1, 3},
{4, 2, 0},
{4, 2, 1},
{4, 2, 3},
{4, 3, 0},
{4, 3, 1},
{4, 3, 2},
},
},
{
desc: "n=100, k=3",
n: 100,
k: 3,
want: csv_to_2d_int_array("100_perm_3.csv"),
},
}
for _, tC := range testCases {
t.Run(tC.desc, func(t *testing.T) {
data := stepped_range(0, tC.n, 1)
permutations, err := NewPermutations(data, tC.k)
if err != nil {
t.Errorf("NewPermutation() = %v, want %v", err, nil)
}
got := make([][]int, 0)
for permutations.Next() {
// We need to append a copy of permutations.Indices() to got
next_set_of_indices := make([]int, len(permutations.Indices()))
copy(next_set_of_indices, permutations.Indices())
got = append(got, next_set_of_indices)
}
if !reflect.DeepEqual(got, tC.want) {
t.Errorf("Permutations(%d, %d) = %v, want %v", tC.n, tC.k, got, tC.want)
}
})
}
}