-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlist_test.go
79 lines (71 loc) · 1.68 KB
/
list_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
package sync
import (
"testing"
"github.com/stretchr/testify/require"
)
func Test_List(t *testing.T) {
expected := []int{0, 1, 2, 3, 4, 5}
// as a stack:
var sl = &List[int]{}
var s Stack[int] = sl
for _, e := range expected {
s.Push(e)
}
require.Equal(t, expected, collect(sl))
for i := range expected {
ev := len(expected) - 1 - i
exp := expected[:ev]
v, ok := s.Pop()
require.True(t, ok)
require.Equal(t, expected[ev], v)
require.Equal(t, exp, collect(sl))
}
// as a List:
ls := &List[int]{}
for _, v := range expected {
ls.Add(v)
}
require.Equal(t, expected, collect(ls))
for i, e := range expected {
exp := expected[i+1:]
ls.Remove(e)
require.Equal(t, exp, collect(ls))
}
// as a queue:
sl = &List[int]{}
var q Queue[int] = sl
for _, e := range expected {
q.Enqueue(e)
}
require.Equal(t, expected, collect(sl))
for i, e := range expected {
exp := expected[i+1:]
got, ok := q.Dequeue()
require.True(t, ok)
require.Equal(t, e, got)
require.Equal(t, exp, collect(sl))
}
// from the middle:
sl = &List[int]{}
for _, value := range expected {
sl.Add(value)
}
require.Equal(t, expected, collect(sl))
sl.Remove(4)
require.Equal(t, []int{0, 1, 2, 3, 5}, collect(sl))
sl.Remove(2)
require.Equal(t, []int{0, 1, 3, 5}, collect(sl))
sl.Remove(1)
require.Equal(t, []int{0, 3, 5}, collect(sl))
sl.Remove(5)
require.Equal(t, []int{0, 3}, collect(sl))
sl.Remove(0)
require.Equal(t, []int{3}, collect(sl))
}
func collect(values Iterator[int]) (out []int) {
out = []int{} // require.Equal() tests will fail when returning nil, since the expected slices are never nil
values.Each(func(value int) {
out = append(out, value)
})
return out
}