-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathskiplist_test.go
119 lines (107 loc) · 2.22 KB
/
skiplist_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
package skiplist
import (
"fmt"
"github.com/stretchr/testify/require"
"math/rand"
"strings"
"testing"
"time"
)
func intCompare(a interface{}, b interface{}) bool {
return a.(int) < b.(int)
}
func init() {
rand.Seed(time.Now().UnixNano())
}
func checkSkipList(t *testing.T, sl *SkipList, dataMap map[int]int) {
// check len
require.Equal(t, len(dataMap), sl.Len())
length := 0
sl.Foreach(func(_ interface{}, _ interface{}) {
length++
})
require.Equal(t, len(dataMap), length)
// check sorted
var lastKey = -1
sl.Foreach(func(key interface{}, _ interface{}) {
intkey := key.(int)
require.True(t, intkey > lastKey)
lastKey = intkey
})
// check key-value
sl.Foreach(func(key interface{}, value interface{}) {
v, ok := dataMap[key.(int)]
require.True(t, ok)
require.Equal(t, v, value)
})
for k, v := range dataMap {
lv, ok := sl.Search(k)
require.True(t, ok)
require.Equal(t, v, lv)
}
// check every level
for i := 0; i < maxLevel; i++ {
x := sl.header
for x.forward[i] != nil {
if x != sl.header {
require.True(t, intCompare(x.key, x.forward[i].key))
}
x = x.forward[i]
}
}
t.Log("check pass")
if testing.Short() {
t.Log(print(sl))
}
}
func TestSkipList(t *testing.T) {
//
sl := New(intCompare)
// random data
testCount := 10000
if testing.Short() {
testCount = 10
}
data := make([]int, 0, testCount)
dataMap := make(map[int]int, testCount)
for i := 0; i < testCount; i++ {
d := rand.Intn(testCount / 2)
data = append(data, d)
dataMap[d] = d
}
// insert
for _, i := range data {
sl.Insert(i, i)
}
checkSkipList(t, sl, dataMap)
t.Log("after insert", testCount, sl.Len())
// random delete
maxDeleteCount := sl.Len() / 2
deleteCount := 0
for k := range dataMap {
if deleteCount >= maxDeleteCount {
break
}
delete(dataMap, k)
sl.Delete(k)
deleteCount++
}
checkSkipList(t, sl, dataMap)
t.Log("after delete", testCount, sl.Len())
}
func print(l *SkipList) string {
var b strings.Builder
for i := 0; i < maxLevel; i++ {
x := l.header
for x != nil {
if x == l.header {
fmt.Fprintf(&b, "[%d] header -> ", i)
} else {
fmt.Fprintf(&b, "(%d:%d) -> ", x.key, x.value)
}
x = x.forward[i]
}
fmt.Fprintf(&b, "\n")
}
return b.String()
}