-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy patharray_test.go
More file actions
511 lines (485 loc) · 14.1 KB
/
Copy patharray_test.go
File metadata and controls
511 lines (485 loc) · 14.1 KB
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
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
package array
import (
"fmt"
"testing"
)
type Test struct {
id int
name string
}
type TestFloat struct {
id float64
name string
}
type TestNew struct {
Test
age int
}
type TestIII struct {
TestNew
haha string
}
func TestFlat(t *testing.T) {
fmt.Printf("----- Flat Test Start -----\n")
type AnySlice = []any
originArr := AnySlice{
1,
AnySlice{
2,
AnySlice{
3,
AnySlice{4},
},
5,
},
}
fmt.Printf("originArr: %v\n", originArr) // [1 [2 [3 [4]] 5]]
newArr := Flat(originArr)
fmt.Printf("newArr : %v\n", newArr) // [1 2 [3 [4]] 5]
newArr = Flat(originArr, 1)
fmt.Printf("newArr : %v\n", newArr) // [1 2 [3 [4]] 5]
newArr = Flat(originArr, 2)
fmt.Printf("newArr : %v\n", newArr) // [1 2 3 [4] 5]
newArr = Flat(originArr, 3)
fmt.Printf("newArr : %v\n", newArr) // [1 2 3 4 5]
fmt.Printf("----- Flat Test End -----\n")
}
func TestReverse(t *testing.T) {
fmt.Printf("----- Reverse Test Start -----\n")
originArr := []Test{
{
id: 1,
name: "A",
},
{
id: 2,
name: "C",
},
}
Reverse(&originArr)
fmt.Printf("originArr: %v\n", originArr) //[{2 C} {1 A}]
fmt.Printf("----- Reverse Test End -----\n")
}
func TestToReversed(t *testing.T) {
fmt.Printf("----- ToReversed Test Start -----\n")
originArr := []Test{
{
id: 1,
name: "A",
},
{
id: 2,
name: "C",
},
}
newArr := ToReversed(originArr)
fmt.Printf("originArr: %v\n", originArr) //[{1 A} {2 C}]
fmt.Printf("newArr: %v\n", newArr) //[{2 C} {1 A}]
fmt.Printf("----- ToReversed Test End -----\n")
}
func TestMap(t *testing.T) {
fmt.Printf("----- Map Test Start -----\n")
originArr := []Test{
{
id: 1,
name: "A",
},
{
id: 2,
name: "C",
},
}
newArr := Map[Test, TestNew](originArr, func(item Test, index int) TestNew {
return TestNew{
Test: item,
age: 1,
}
})
fmt.Printf("newArr: %v\n", newArr) //[{{1 A} 1} {{2 C} 1}]
fmt.Printf("objArr: %v\n", originArr) //[{1 A} {2 C}]
fmt.Printf("----- Map Test End -----\n\n")
}
func TestForEach(t *testing.T) {
fmt.Printf("----- ForEach Test Start -----\n")
objArr := []Test{
{
id: 1,
name: "A",
},
{
id: 2,
name: "C",
},
}
fmt.Printf("objArr: %v\n", objArr) //[{1 A} {2 C}]
ForEach(objArr, func(item *Test, index int) {
item.id += 1
})
fmt.Printf("objArr: %v\n", objArr) //[{2 A} {3 C}]
fmt.Printf("----- ForEach Test End -----\n\n")
}
func TestEvery(t *testing.T) {
fmt.Printf("----- Every Test Start -----\n")
originArr := []int{1, 2, 4, 5}
res := Every[int](originArr, func(item, index int) bool {
return item > 2
})
fmt.Printf("res: %v\n", res) //false
res = Every[int](originArr, func(item, index int) bool {
return item > 0
})
fmt.Printf("res: %v\n", res) //true
fmt.Printf("----- Every Test End -----\n\n")
}
func TestSome(t *testing.T) {
fmt.Printf("----- Some Test Start -----\n")
originArr := []int{1, 2, 4, 5}
res := Some(originArr, func(item, index int) bool {
return item > 2
})
fmt.Printf("res: %v\n", res) //true
res = Some(originArr, func(item, index int) bool {
return item > 5
})
fmt.Printf("res: %v\n", res) //false
fmt.Printf("----- Some Test End -----\n\n")
}
func TestPush(t *testing.T) {
fmt.Printf("----- Push Test Start -----\n")
originArr := []int{3, 44, 38}
fmt.Printf("originArr: %v\n", originArr) //originArr: [3 44 38]
newLen := Push(&originArr, 1)
fmt.Printf("newLen: %v\n", newLen) //newLen: 4
newLen = Push(&originArr, 2)
fmt.Printf("newLen: %v\n", newLen) //newLen: 5
newLen = Push(&originArr, 3, 5, 6, 7)
fmt.Printf("originArr: %v\n", originArr) //originArr: [3 44 38 1 2 3 5 6 7]
fmt.Printf("newLen: %v\n", newLen) //newLen: 9
fmt.Printf("----- Push Test End -----\n\n")
}
func TestPop(t *testing.T) {
fmt.Printf("----- Pop Test Start -----\n")
originArr := []int{3, 44, 8}
fmt.Printf("originArr: %v\n", originArr)
last, ok := Pop(&originArr)
fmt.Printf("last: %v-%v\n", last, ok) //8-true
fmt.Printf("originArr: %v\n", originArr) //[3 44]
originArr = []int{} //空数组 pop会失败
fmt.Printf("originArr: %v\n", originArr)
last, ok = Pop(&originArr)
fmt.Printf("last: %v-%v\n", last, ok) //0-false
fmt.Printf("originArr: %v\n", originArr) //[]
fmt.Printf("----- Pop Test End -----\n\n")
}
func TestShift(t *testing.T) {
fmt.Printf("----- Shift Test Start -----\n")
originArr := []int{3, 44, 38}
fmt.Printf("originArr: %v\n", originArr) //[3 44 38]
first, ok := Shift(&originArr)
fmt.Printf("originArr: %v\n", originArr) //[44 38]
fmt.Printf("first: %v-%v\n", first, ok) //3 true
originArr = []int{}
fmt.Printf("originArr: %v\n", originArr) //[]
first, ok = Shift(&originArr)
fmt.Printf("originArr: %v\n", originArr) //[]
fmt.Printf("first: %v-%v\n", first, ok) //0 false
fmt.Printf("----- Shift Test End -----\n\n")
}
func TestUnShift(t *testing.T) {
fmt.Printf("----- UnShift Test Start -----\n")
originArr := []string{"Banana", "Orange", "Apple", "Mango"}
fmt.Printf("originArr: %v\n", originArr)
length := UnShift(&originArr, "Lemon", "Pineapple") //[Banana Orange Apple Mango]
fmt.Printf("originArr: %v\n", originArr) //[Lemon Pineapple Banana Orange Apple Mango]
fmt.Printf("length: %v\n", length) //6
fmt.Printf("----- UnShift Test End -----\n\n")
}
func TestSlice(t *testing.T) {
fmt.Printf("----- Slice Test Start -----\n")
a := []int{1, 2, 3, 4, 5}
b := a[0:1]
fmt.Printf("a: %v\n", a) //[1 2 3 4 5]
fmt.Printf("b: %v\n", b) //[1]
b = append(b, 6, 7, 8, 9)
fmt.Printf("a: %v\n", a) //[1 6 7 8 9] 因为整体cap不变,没有扩容,所以b切片在append时,a切片也受到了影响
fmt.Printf("b: %v\n", b) //[1 6 7 8 9]
arr := []int{1, 2, 3, 4, 5}
newArr := Slice(arr, 0, 1)
fmt.Printf("arr: %v\n", arr) //[1 2 3 4 5]
fmt.Printf("newArr: %v\n", newArr) //[1]
newArr = append(newArr, 6, 7)
Push(&newArr, 8, 9)
fmt.Printf("arr: %v\n", arr) //[1 2 3 4 5] array.Slice方法由于重新初始切片,所以实现了彼此互不影响
fmt.Printf("newArr: %v\n", newArr) //[1 6 7 8 9]
c := newArr[0:1] //使用原生切片截取方式 但是要注意扩容规则
c = append(c, 66, 77, 88, 99)
fmt.Printf("原生[:] 截取并append后 newArr: %v\n", newArr) //[1 66 77 88 99] 受扩容规则影响
fmt.Printf("原生[:] 截取并append后 c: %v\n", c) //[1 66 77 88 99]
//以下是非常规操作案例
d := []int{1, 2, 3, 4, 5}
e := Slice(d, 0, -1)
fmt.Printf("e: %v\n", e) //[1 2 3 4]
e = Slice(d, 0, 20)
fmt.Printf("e: %v\n", e) //[1 2 3 4 5]
e = Slice(d, -20, 20)
fmt.Printf("e: %v\n", e) //[1 2 3 4 5]
e = Slice(d, -1, 20)
fmt.Printf("e: %v\n", e) //[5]
e = Slice(d, -5, 20)
fmt.Printf("e: %v\n", e) //[1 2 3 4 5]
e = Slice(d, -1, -2)
fmt.Printf("e: %v\n", e) //[]
e = Slice(d, -2, -1)
fmt.Printf("e: %v\n", e) //[4]
e = Slice(d, -20, -1)
fmt.Printf("e: %v\n", e) //[1 2 3 4]
fmt.Printf("----- Slice Test End -----\n\n")
}
func TestSplice(t *testing.T) {
fmt.Printf("----- Splice Test Start -----\n")
arr := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr := Splice(&arr, 3, 0, 11, 12, 13)
fmt.Printf("delArr: %v\n", delArr) //[]
fmt.Printf("arr: %v\n", arr) //[1 2 3 11 12 13 4 5 6 7 8 9 10]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 3, 2, 11, 12, 13)
fmt.Printf("delArr: %v\n", delArr) //[4 5]
fmt.Printf("arr: %v\n", arr) //[1 2 3 11 12 13 6 7 8 9 10]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 3, 3, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[4 5 6]
fmt.Printf("arr: %v\n", arr) //[1 2 3 11 12 7 8 9 10]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 3, 4, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[4 5 6 7]
fmt.Printf("arr: %v\n", arr) //[1 2 3 11 12 8 9 10]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, -3, 5, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[8 9 10]
fmt.Printf("arr: %v\n", arr) //[1 2 3 4 5 6 7 11 12]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, -3, -5, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[]
fmt.Printf("arr: %v\n", arr) //[1 2 3 4 5 6 7 11 12 8 9 10]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 0, 5, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[1 2 3 4 5]
fmt.Printf("arr: %v\n", arr) //[11 12 6 7 8 9 10]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 0, 50, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[1 2 3 4 5 6 7 8 9 10]
fmt.Printf("arr: %v\n", arr) //[11 12]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 0, 0)
fmt.Printf("delArr: %v\n", delArr) //[]
fmt.Printf("arr: %v\n", arr) //[1 2 3 4 5 6 7 8 9 10]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 50, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[]
fmt.Printf("arr: %v\n", arr) //[1 2 3 4 5 6 7 8 9 10 12]
arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
delArr = Splice(&arr, 10, 50, 11, 12)
fmt.Printf("delArr: %v\n", delArr) //[]
fmt.Printf("arr: %v\n", arr) //[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
fmt.Printf("----- Splice Test End -----\n\n")
}
func TestEmpty(t *testing.T) {
fmt.Printf("----- Empty Test Start -----\n")
arr := []int{3, 44, 38}
fmt.Printf("arr: %v-%v-%v\n", arr, len(arr), cap(arr)) //arr: [3 44 38]-3-3
Empty(&arr)
fmt.Printf("arr: %v-%v-%v\n", arr, len(arr), cap(arr)) //arr: []-0-3
fmt.Printf("----- Empty Test End -----\n\n")
}
func TestBrokenEmpty(t *testing.T) {
fmt.Printf("----- BrokenEmpty Test Start -----\n")
arr := []int{3, 44, 38}
fmt.Printf("arr: %v-%v-%v\n", arr, len(arr), cap(arr)) //arr: [3 44 38]-3-3
BrokenEmpty(&arr)
fmt.Printf("arr: %v-%v-%v\n", arr, len(arr), cap(arr)) //arr: []-0-0
fmt.Printf("----- BrokenEmpty Test End -----\n\n")
}
func TestFind(t *testing.T) {
fmt.Printf("----- Find Test Start -----\n")
var arr []Test
Push(&arr, Test{
id: 1,
name: "A",
})
Push(&arr, Test{
id: 2,
name: "B",
})
res, exist := Find(arr, func(item Test, key int) bool {
return item.name == "B" && item.id == 2
})
if exist {
fmt.Printf("res: %v\n", res) //res: {2 B}
} else {
fmt.Printf("not found: %v\n", res)
}
fmt.Printf("----- Find Test End -----\n\n")
}
func TestFindLast(t *testing.T) {
fmt.Printf("----- FindLast Test Start -----\n")
var objArr []Test
Push(&objArr, Test{
id: 1,
name: "A",
})
Push(&objArr, Test{
id: 2,
name: "C",
})
res, exist := FindLast(objArr, func(item Test, key int) bool {
return item.name == "C" && item.id == 2
})
if exist {
fmt.Printf("res: %v\n", res) //res: {2 C}
} else {
fmt.Printf("not found: %v\n", res)
}
fmt.Printf("----- FindLast Test End -----\n\n")
}
func TestFindIndex(t *testing.T) {
fmt.Printf("----- FindIndex Test Start -----\n")
ages := []int{3, 10, 18, 20}
index := FindIndex(ages, func(item, index int) bool {
return item == 18
})
fmt.Printf("index: %v\n", index) //index: 2
fmt.Printf("----- FindIndex Test End -----\n\n")
}
func TestFindLastIndex(t *testing.T) {
fmt.Printf("----- FindLastIndex Test Start -----\n")
ages := []int{3, 10, 18, 20}
index := FindLastIndex(ages, func(item, index int) bool {
return item > 10
})
fmt.Printf("index: %v\n", index) //index: 3
fmt.Printf("----- FindLastIndex Test End -----\n\n")
}
func TestFilter(t *testing.T) {
fmt.Printf("----- Filter Test Start -----\n")
var arr []Test
Push(&arr, Test{
id: 1,
name: "A",
})
Push(&arr, Test{
id: 2,
name: "B",
})
resFilter := Filter(arr, func(item Test, key int) bool {
return item.name == "A"
})
fmt.Printf("resFilter: %v\n", resFilter) //resFilter: [{1 A}]
fmt.Printf("----- Filter Test End -----\n\n")
}
func TestSort(t *testing.T) {
fmt.Printf("----- Sort Test Start -----\n")
arrTest := []TestFloat{
{
id: 3.2,
name: "A1",
},
{
id: 4.2,
name: "A2",
},
{
id: 38.9,
name: "A3",
},
{
id: 5.4,
name: "A4",
},
{
id: 38.7,
name: "A5",
},
{
id: 38.5,
name: "A6",
},
}
fmt.Printf("arr: %v\n", arrTest)
//升序
Sort(&arrTest, func(a TestFloat, b TestFloat) bool {
return a.id < b.id
})
fmt.Printf("升序 Sort: %v\n", arrTest)
//降序
Sort(&arrTest, func(a TestFloat, b TestFloat) bool {
return a.id > b.id
})
fmt.Printf("降序 Sort: %v\n", arrTest)
fmt.Printf("----- Sort Test End -----\n\n")
}
func TestBubbleSort(t *testing.T) {
fmt.Printf("----- BubbleSort Test Start -----\n")
arr := []int{3, 44, 38, 5, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48}
fmt.Printf("arr: %v\n", arr)
//升序
BubbleSort(&arr, func(a int, b int) bool {
return a < b
})
fmt.Printf("升序 arr: %v\n", arr)
fmt.Printf("----- BubbleSort Test End -----\n\n")
}
func TestSelectSort(t *testing.T) {
fmt.Printf("----- SelectSort Test Start -----\n")
arr := []int{3, 44, 38, 5, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48}
fmt.Printf("arr: %v\n", arr)
//升序
SelectSort(&arr, func(a int, b int) bool {
return a < b
})
fmt.Printf("升序 arr: %v\n", arr)
fmt.Printf("----- SelectSort Test End -----\n\n")
}
func TestInsertSort(t *testing.T) {
fmt.Printf("----- InsertSort Test Start -----\n")
arr := []int{3, 44, 38, 5, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48}
fmt.Printf("arr: %v\n", arr)
//升序
InsertSort(&arr, func(a int, b int) bool {
return a < b
})
fmt.Printf("升序 arr: %v\n", arr)
fmt.Printf("----- InsertSort Test End -----\n\n")
}
func TestShellSort(t *testing.T) {
fmt.Printf("----- ShellSort Test Start -----\n")
arr := []int{3, 44, 38, 5, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48}
fmt.Printf("arr: %v\n", arr)
//升序
ShellSort(&arr, func(a int, b int) bool {
return a < b
})
fmt.Printf("升序 arr: %v\n", arr)
fmt.Printf("----- ShellSort Test End -----\n\n")
}
func TestMergeSort(t *testing.T) {
fmt.Printf("----- MergeSort Test Start -----\n")
arr := []int{3, 44, 38, 5, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48}
fmt.Printf("arr: %v\n", arr)
//升序
MergeSort(&arr, func(a int, b int) bool {
return a < b
})
fmt.Printf("升序 arr: %v\n", arr)
fmt.Printf("----- MergeSort Test End -----\n\n")
}
func TestQuickSort(t *testing.T) {
fmt.Printf("----- QuickSort Test Start -----\n")
arr := []int{3, 44, 38, 5, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48}
fmt.Printf("arr: %v\n", arr)
//升序
QuickSort(&arr, func(a int, b int) bool {
return a < b
})
fmt.Printf("升序 arr: %v\n", arr)
fmt.Printf("----- QuickSort Test End -----\n\n")
}