-
-
Notifications
You must be signed in to change notification settings - Fork 2.7k
/
Copy pathdoubly_test.go
112 lines (95 loc) · 2.21 KB
/
doubly_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
package linkedlist
import (
"reflect"
"testing"
)
func TestDoubly(t *testing.T) {
newList := NewDoubly[int]()
newList.AddAtBeg(1)
newList.AddAtBeg(2)
newList.AddAtBeg(3)
t.Run("Test AddAtBeg", func(t *testing.T) {
wantNext := []int{3, 2, 1}
wantPrev := []int{1, 2, 3}
got := []int{}
// check from Next address
current := newList.Head.Next
got = append(got, current.Val)
for current.Next != newList.Head {
current = current.Next
got = append(got, current.Val)
}
if !reflect.DeepEqual(got, wantNext) {
t.Errorf("got: %v, want: %v", got, wantNext)
}
// check from Prev address
got = []int{}
got = append(got, current.Val)
for current.Prev != newList.Head {
current = current.Prev
got = append(got, current.Val)
}
if !reflect.DeepEqual(got, wantPrev) {
t.Errorf("got: %v, want: %v", got, wantPrev)
}
})
newList.AddAtEnd(4)
t.Run("Test AddAtEnd", func(t *testing.T) {
want := []int{3, 2, 1, 4}
got := []int{}
current := newList.Head.Next
got = append(got, current.Val)
for current.Next != newList.Head {
current = current.Next
got = append(got, current.Val)
}
if !reflect.DeepEqual(got, want) {
t.Errorf("got: %v, want: %v", got, want)
}
})
t.Run("Test DelAtBeg", func(t *testing.T) {
want := 3
got, ok := newList.DelAtBeg()
if !ok {
t.Error("unexpected not-ok")
}
if got != want {
t.Errorf("got: %v, want: %v", got, want)
}
})
t.Run("Test DelAtEnd", func(t *testing.T) {
want := 4
got, ok := newList.DelAtEnd()
if !ok {
t.Error("unexpected not-ok")
}
if got != want {
t.Errorf("got: %v, want: %v", got, want)
}
})
t.Run("Test Count", func(t *testing.T) {
want := 2
got := newList.Count()
if got != want {
t.Errorf("got: %v, want: %v", got, want)
}
})
newList2 := NewDoubly[int]()
newList2.AddAtBeg(1)
newList2.AddAtBeg(2)
newList2.AddAtBeg(3)
t.Run("Test Reverse", func(t *testing.T) {
want := []int{1, 2, 3}
got := []int{}
newList2.Reverse()
current := newList2.Head.Next
got = append(got, current.Val)
for current.Next != newList2.Head {
current = current.Next
got = append(got, current.Val)
}
if !reflect.DeepEqual(got, want) {
t.Errorf("got: %v, want: %v", got, want)
}
})
}