/
list_test.go
132 lines (114 loc) · 2.76 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
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
package lrucache
import (
"github.com/viki-org/gspec"
"testing"
)
func TestAddsNodesToTheHead(t *testing.T) {
l := new(List)
three := new(Node)
l.Push(three)
assertList(t, l, three)
two := new(Node)
l.Push(two)
assertList(t, l, two, three)
one := new(Node)
l.Push(one)
assertList(t, l, one, two, three)
}
func TestPromotesFromHead(t *testing.T) {
list, one, two, three := sampleList()
list.Promote(one)
assertList(t, list, one, two, three)
}
func TestPromotesFromTail(t *testing.T) {
list, one, two, three := sampleList()
list.Promote(three)
assertList(t, list, three, one, two)
}
func TestPromotesFromTheMiddle(t *testing.T) {
list, one, two, three := sampleList()
list.Promote(two)
assertList(t, list, two, one, three)
}
func TestPrunesTheList1(t *testing.T) {
spec := gspec.New(t)
l, one, two, three := sampleList()
items := l.Prune(1)
assertList(t, l, one, two)
spec.Expect(items[0]).ToEqual(three)
spec.Expect(len(items)).ToEqual(1)
}
func TestPrunesTheList2(t *testing.T) {
spec := gspec.New(t)
l, one, two, three := sampleList()
items := l.Prune(2)
assertList(t, l, one)
spec.Expect(items[0]).ToEqual(three)
spec.Expect(items[1]).ToEqual(two)
spec.Expect(len(items)).ToEqual(2)
}
func TestPrunesAllNodes(t *testing.T) {
l, _, _, _ := sampleList()
l.Prune(3)
if l.head != nil {
t.Error("head should be nil")
}
if l.tail != nil {
t.Error("tail should be nil")
}
}
func TestPrunesAllNodesAndMore(t *testing.T) {
l, _, _, _ := sampleList()
l.Prune(5)
if l.head != nil {
t.Error("head should be nil")
}
if l.tail != nil {
t.Error("tail should be nil")
}
}
func TestRemoveNodeFromHead(t *testing.T) {
l, one, two, three := sampleList()
l.Remove(one)
assertList(t, l, two, three)
}
func TestRemoveNodeFromTail(t *testing.T) {
l, one, two, three := sampleList()
l.Remove(three)
assertList(t, l, one, two)
}
func TestRemoveNodeFromMiddle(t *testing.T) {
l, one, two, three := sampleList()
l.Remove(two)
assertList(t, l, one, three)
}
func assertList(t *testing.T, l *List, items ...*Node) {
if l.head != items[0] {
}
if l.tail != items[len(items)-1] {
t.Errorf("expected tail to equal %+v,got %+v", items[len(items)-1], l.tail)
}
current := l.head
for index, item := range items {
if current != item {
t.Errorf("expected item at position %d to equal %+v,got %+v", index, item, current)
}
if index > 0 && current.prev != items[index-1] {
t.Errorf("expected prev at at position %d to equal %+v,got %+v", index, items[index-1], current.prev)
}
current = current.next
}
if current != nil {
t.Error("Tail's next should be nil")
}
}
func sampleList() (*List, *Node, *Node, *Node) {
l := new(List)
three := new(Node)
two := new(Node)
one := new(Node)
l.Push(three)
l.Push(two)
l.Push(one)
return l, one, two, three
}