-
Notifications
You must be signed in to change notification settings - Fork 0
/
dll_test.go
90 lines (65 loc) · 1.66 KB
/
dll_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
package hermeskv
import (
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
)
func TestDLLSet(t *testing.T) {
newDLL := getDLL()
// add nodes
// add nodes
n1 := getNode("f", 100, nil, nil)
n2 := getNode("s", 101, nil, nil)
n3 := getNode("t", 102, nil, nil)
newDLL.addNode(n1)
newDLL.addNode(n2)
newDLL.addNode(n3)
// search for 102
node, err := newDLL.retrieveNode(102)
require.Nil(t, err)
assert.EqualValues(t, 102, node.val)
}
func TestDLLDeleteHead(t *testing.T) {
newDLL := getDLL()
// add nodes
// add nodes
n1 := getNode("f", 100, nil, nil)
n2 := getNode("s", 101, nil, nil)
n3 := getNode("t", 102, nil, nil)
newDLL.addNode(n1)
newDLL.addNode(n2)
newDLL.addNode(n3)
// delete the head node
node := newDLL.deleteHead()
assert.EqualValues(t, node.val, 100)
assert.EqualValues(t, 101, newDLL.headNode.next.val)
}
func TestDLLDeleteTail(t *testing.T) {
newDLL := getDLL()
// add nodes
n1 := getNode("f", 100, nil, nil)
n2 := getNode("s", 101, nil, nil)
n3 := getNode("t", 102, nil, nil)
newDLL.addNode(n1)
newDLL.addNode(n2)
newDLL.addNode(n3)
// delete the tail node
node := newDLL.deleteTail()
assert.EqualValues(t, node.val, 102)
assert.EqualValues(t, 101, newDLL.tailNode.prev.val)
}
func TestDLLDeleteNode(t *testing.T) {
newDLL := getDLL()
// add nodes
n1 := getNode("f", 100, nil, nil)
n2 := getNode("s", 101, nil, nil)
n3 := getNode("t", 102, nil, nil)
newDLL.addNode(n1)
newDLL.addNode(n2)
newDLL.addNode(n3)
// delete the middle node
newDLL.deleteNode(n2)
assert.EqualValues(t, n2.val, 101)
assert.EqualValues(t, 102, n1.next.val)
assert.EqualValues(t, 100, n3.prev.val)
}