-
Notifications
You must be signed in to change notification settings - Fork 3
/
row_test.go
229 lines (203 loc) · 5.66 KB
/
row_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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
package twenty48_test
import (
"testing"
"github.com/alyyousuf7/twenty48"
)
func TestRowReverse(t *testing.T) {
// prepare data
row := twenty48.Row{1, 2, 3, 4, 5}
rowLength := len(row)
// do reverse
newRow := row.Reverse()
// check if the length is correct
if rowLength != len(newRow) {
t.Error("Reversed row length does not match row length")
}
// check if the values are as expected
for k, r := range row {
if r.Value() != newRow[rowLength-k-1].Value() {
t.Errorf("row[%d]: %d == %d value did not match", k, r.Value(), newRow[rowLength-k-1].Value())
break
}
}
}
type MoveTestCase struct {
row twenty48.Row
direction twenty48.Direction
expectedrow twenty48.Row
}
func testRowMoveCase(t *testing.T, testcase MoveTestCase) {
row := testcase.row
direction := testcase.direction
// prepare data
rowLength := len(row)
// move
newRow := row.Move(direction)
// check if the length is correct
if rowLength != len(newRow) {
t.Error("Moved row length does not match row length")
}
// check if the values are as expected
for k, r := range newRow {
if r.Value() != testcase.expectedrow[k].Value() {
t.Errorf("expected row %v but got %v", testcase.expectedrow, newRow)
break
}
}
}
func TestRowMove(t *testing.T) {
cases := []MoveTestCase{
{ // extreme move
row: twenty48.Row{0, 0, 0, 0, 2},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{2, 0, 0, 0, 0},
},
{
row: twenty48.Row{2, 0, 0, 0, 0},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 0, 2},
},
{ // no move with zeroes
row: twenty48.Row{4, 2, 0, 0, 0},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{4, 2, 0, 0, 0},
},
{
row: twenty48.Row{0, 0, 0, 4, 2},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 4, 2},
},
{ // no moves, because no zeroes
row: twenty48.Row{1024, 512, 256, 128, 64},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{1024, 512, 256, 128, 64},
},
{
row: twenty48.Row{1024, 512, 256, 128, 64},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{1024, 512, 256, 128, 64},
},
{ // move multiple
row: twenty48.Row{0, 4, 0, 0, 2},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{4, 2, 0, 0, 0},
},
{
row: twenty48.Row{0, 4, 0, 0, 2},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 4, 2},
},
{ // move a few
row: twenty48.Row{4, 0, 0, 0, 2},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{4, 2, 0, 0, 0},
},
{
row: twenty48.Row{4, 0, 0, 0, 2},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 4, 2},
},
}
// Multiple similar testcases: up == left, down == right
for _, c := range cases {
testRowMoveCase(t, c)
if c.direction == twenty48.DirectionLeft {
c.direction = twenty48.DirectionUp
testRowMoveCase(t, c)
}
if c.direction == twenty48.DirectionRight {
c.direction = twenty48.DirectionDown
testRowMoveCase(t, c)
}
}
}
type MergeTestCase struct {
row twenty48.Row
direction twenty48.Direction
expectedrow twenty48.Row
}
func testRowMergeCase(t *testing.T, testcase MergeTestCase) {
row := testcase.row
direction := testcase.direction
// prepare data
rowLength := len(row)
// merge
newRow := row.Merge(direction)
// check if the length is correct
if rowLength != len(newRow) {
t.Error("Merged row length does not match row length")
}
// check if the values are as expected
for k, r := range newRow {
if r.Value() != testcase.expectedrow[k].Value() {
t.Errorf("expected row %v but got %v", testcase.expectedrow, newRow)
break
}
}
}
func TestRowMerge(t *testing.T) {
cases := []MergeTestCase{
{ // no merges, only moves
row: twenty48.Row{0, 0, 0, 0, 2},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{2, 0, 0, 0, 0},
},
{
row: twenty48.Row{2, 0, 0, 0, 0},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 0, 2},
},
{ // adjacent merges, no moves
row: twenty48.Row{2, 2, 0, 0, 0},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{4, 0, 0, 0, 0},
},
{
row: twenty48.Row{0, 0, 0, 2, 2},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 0, 4},
},
{ // adjacent merges, with complete move
row: twenty48.Row{0, 0, 0, 2, 2},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{4, 0, 0, 0, 0},
},
{
row: twenty48.Row{2, 2, 0, 0, 0},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 0, 4},
},
{ // first two should merge, not the other
row: twenty48.Row{2, 2, 2, 0, 0},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{4, 2, 0, 0, 0},
},
{
row: twenty48.Row{0, 0, 2, 2, 2},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 2, 4},
},
{ // multiple merges
row: twenty48.Row{2, 2, 2, 2, 0},
direction: twenty48.DirectionLeft,
expectedrow: twenty48.Row{4, 4, 0, 0, 0},
},
{
row: twenty48.Row{0, 2, 2, 2, 2},
direction: twenty48.DirectionRight,
expectedrow: twenty48.Row{0, 0, 0, 4, 4},
},
}
// Multiple similar testcases: up == left, down == right
for _, c := range cases {
testRowMergeCase(t, c)
if c.direction == twenty48.DirectionLeft {
c.direction = twenty48.DirectionUp
testRowMergeCase(t, c)
}
if c.direction == twenty48.DirectionRight {
c.direction = twenty48.DirectionDown
testRowMergeCase(t, c)
}
}
}