-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathiterator_test.go
56 lines (49 loc) · 1018 Bytes
/
iterator_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
package skiplist
import (
"bytes"
"reflect"
"testing"
)
func TestNext(t *testing.T) {
l := NewList()
i := l.Iterator()
if i.Next() {
t.Errorf("Should not have nodes to iterate for new list")
}
l.Insert(2, []byte("Node two"))
i.Next()
l.Insert(3, []byte("Node three"))
i.Next()
if !bytes.Equal(reflect.ValueOf(i.Val()).Bytes(), []byte("Node three")) {
t.Errorf("Didn't iterate to next node")
}
if i.Key() != 3 {
t.Errorf("Got wrong next node")
}
}
func TestPrevious(t *testing.T) {
l := NewList()
i := l.Iterator()
if i.Prev() {
t.Errorf("Should not find a val if no node")
}
l.Insert(2, []byte("Node two"))
i.Next()
l.Insert(3, []byte("Node three"))
i.Next()
if !i.Prev() {
t.Errorf("Should have a previous node")
}
}
func TestValueNoCurrent(t *testing.T) {
i := &iterable{}
if i.Val() != nil {
t.Errorf("Should not find a val if no node")
}
}
func TestKeyNoCurrent(t *testing.T) {
i := &iterable{}
if i.Key() != 0 {
t.Errorf("Should not find a key if no node")
}
}