-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy path01_three_in_one_test.go
367 lines (358 loc) · 7.94 KB
/
01_three_in_one_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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
package ch03
import (
"reflect"
"testing"
)
func TestNewFixedMultiStack(t *testing.T) {
multiStack := FixedMultiStack{}
multiStack.n = 3
multiStack.cap = 2
multiStack.len = make([]int, 3)
multiStack.storage = make([]int, 6)
type args struct {
n int
cap int
}
tests := []struct {
name string
args args
want *FixedMultiStack
wantErr bool
}{
{
name: "creates a new fixed multi stack",
args: args{n: 3, cap: 2},
want: &multiStack,
wantErr: false,
},
{
name: "fails to create new multi stack with zero stacks",
args: args{n: 0, cap: 2},
want: nil,
wantErr: true,
},
{
name: "fails to create new multi stack with negative capacity",
args: args{n: 3, cap: -1},
want: nil,
wantErr: true,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
got, err := NewFixedMultiStack(tt.args.n, tt.args.cap)
if (err != nil) != tt.wantErr {
t.Errorf("NewFixedMultiStack() error = %v, wantErr %v", err, tt.wantErr)
return
}
if !reflect.DeepEqual(got, tt.want) {
t.Errorf("NewFixedMultiStack() got = %v, want %v", got, tt.want)
}
})
}
}
func TestFixedMultiStack_Pop(t *testing.T) {
type fields struct {
n int
cap int
len []int
storage []int
}
type args struct {
n int
}
tests := []struct {
name string
fields fields
args args
want int
wantErr bool
}{
{
name: "pops element from the first stack",
fields: fields{n: 1, cap: 3, len: []int{2}, storage: []int{1, 1, 0}},
args: args{n: 0},
want: 1,
},
{
name: "pops last element from the first stack",
fields: fields{n: 1, cap: 3, len: []int{1}, storage: []int{1, 0, 0}},
args: args{n: 0},
want: 1,
},
{
name: "returns errors when stack is empty",
fields: fields{n: 1, cap: 3, len: []int{0}, storage: []int{}},
args: args{n: 0},
wantErr: true,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
stack := &FixedMultiStack{
n: tt.fields.n,
cap: tt.fields.cap,
len: tt.fields.len,
storage: tt.fields.storage,
}
got, err := stack.Pop(tt.args.n)
if (err != nil) != tt.wantErr {
t.Errorf("Pop() error = %v, wantErr %v", err, tt.wantErr)
return
}
if got != tt.want {
t.Errorf("Pop() got = %v, want %v", got, tt.want)
}
})
}
}
func TestFixedMultiStack_Push(t *testing.T) {
storage := []int{1, 2, 0, 1, 2, 0, 1, 2, 0}
type fields struct {
n int
cap int
len []int
storage []int
}
type args struct {
n int
val int
}
tests := []struct {
name string
fields fields
args args
wantErr bool
}{
{
name: "pushes element to the first stack",
fields: fields{n: 3, cap: 3, len: []int{2, 2, 2}, storage: storage},
args: args{n: 0, val: 3},
},
{
name: "pushes element to the second stack",
fields: fields{n: 3, cap: 3, len: []int{3, 2, 2}, storage: storage},
args: args{n: 1, val: 3},
},
{
name: "pushes element to the second stack",
fields: fields{n: 3, cap: 3, len: []int{3, 3, 2}, storage: storage},
args: args{n: 2, val: 3},
},
{
name: "returns errors when stack is full",
fields: fields{n: 3, cap: 3, len: []int{3, 3, 3}, storage: storage},
args: args{n: 2, val: 4},
wantErr: true,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
stack := &FixedMultiStack{
n: tt.fields.n,
cap: tt.fields.cap,
len: tt.fields.len,
storage: tt.fields.storage,
}
if err := stack.Push(tt.args.n, tt.args.val); (err != nil) != tt.wantErr {
t.Errorf("Push() error = %v, wantErr %v", err, tt.wantErr)
}
})
}
}
func TestFixedMultiStack_Peek(t *testing.T) {
type fields struct {
n int
cap int
len []int
storage []int
}
type args struct {
n int
}
tests := []struct {
name string
fields fields
args args
want int
wantErr bool
}{
{
name: "returns peek for the first stack",
fields: fields{n: 3, cap: 1, len: []int{1, 0, 0}, storage: []int{1, 0, 0}},
args: args{n: 0},
want: 1,
},
{
name: "returns peek for the second stack",
fields: fields{n: 3, cap: 2, len: []int{0, 2, 0}, storage: []int{0, 0, 1, 2, 0, 0}},
args: args{n: 1},
want: 2,
},
{
name: "returns peek for the second stack",
fields: fields{n: 3, cap: 3, len: []int{0, 0, 3}, storage: []int{0, 0, 0, 0, 0, 0, 1, 2, 3}},
args: args{n: 2},
want: 3,
},
{
name: "returns errors when stack is empty",
fields: fields{n: 3, cap: 3, len: []int{0, 0, 0}, storage: []int{}},
args: args{n: 2},
wantErr: true,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
stack := &FixedMultiStack{
n: tt.fields.n,
cap: tt.fields.cap,
len: tt.fields.len,
storage: tt.fields.storage,
}
got, err := stack.Peek(tt.args.n)
if (err != nil) != tt.wantErr {
t.Errorf("Peek() error = %v, wantErr %v", err, tt.wantErr)
return
}
if got != tt.want {
t.Errorf("Peek() got = %v, want %v", got, tt.want)
}
})
}
}
func TestFixedMultiStack_IsEmpty(t *testing.T) {
type fields struct {
n int
cap int
len []int
storage []int
}
type args struct {
n int
}
tests := []struct {
name string
fields fields
args args
want bool
}{
{
name: "returns false when non-empty stack",
fields: fields{n: 3, cap: 3, len: []int{2, 0, 0}, storage: []int{}},
args: args{n: 0},
want: false,
},
{
name: "returns true when stack is empty",
fields: fields{n: 3, cap: 3, len: []int{0, 0, 0}, storage: []int{}},
args: args{n: 0},
want: true,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
stack := &FixedMultiStack{
n: tt.fields.n,
cap: tt.fields.cap,
len: tt.fields.len,
storage: tt.fields.storage,
}
if got := stack.IsEmpty(tt.args.n); got != tt.want {
t.Errorf("IsEmpty() = %v, want %v", got, tt.want)
}
})
}
}
func TestFixedMultiStack_IsFull(t *testing.T) {
type fields struct {
n int
cap int
len []int
storage []int
}
type args struct {
n int
}
tests := []struct {
name string
fields fields
args args
want bool
}{
{
name: "returns false for non-full stack",
fields: fields{n: 3, cap: 3, len: []int{2, 0, 0}, storage: []int{}},
args: args{n: 0},
want: false,
},
{
name: "returns true when stack is full",
fields: fields{n: 3, cap: 3, len: []int{3, 0, 0}, storage: []int{}},
args: args{n: 0},
want: true,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
stack := &FixedMultiStack{
n: tt.fields.n,
cap: tt.fields.cap,
len: tt.fields.len,
storage: tt.fields.storage,
}
if got := stack.IsFull(tt.args.n); got != tt.want {
t.Errorf("IsFull() = %v, want %v", got, tt.want)
}
})
}
}
func TestFixedMultiStack_top(t *testing.T) {
type fields struct {
n int
cap int
len []int
storage []int
}
type args struct {
n int
}
tests := []struct {
name string
fields fields
args args
want int
}{
{
name: "returns top for the first stack",
fields: fields{n: 3, cap: 1, len: []int{1, 0, 0}, storage: []int{}},
args: args{n: 0},
want: 0,
},
{
name: "returns top for the second stack",
fields: fields{n: 3, cap: 2, len: []int{0, 2, 0}, storage: []int{}},
args: args{n: 1},
want: 3,
},
{
name: "returns top for the second stack",
fields: fields{n: 3, cap: 3, len: []int{0, 0, 3}, storage: []int{}},
args: args{n: 2},
want: 8,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
stack := &FixedMultiStack{
n: tt.fields.n,
cap: tt.fields.cap,
len: tt.fields.len,
storage: tt.fields.storage,
}
if got := stack.top(tt.args.n); got != tt.want {
t.Errorf("top() = %v, want %v", got, tt.want)
}
})
}
}