-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathfuzzy_test.go
64 lines (54 loc) · 1.07 KB
/
fuzzy_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
package skiplist
import (
"math/rand"
"testing"
handu_skiplist "github.com/huandu/skiplist"
"github.com/petar/GoLLRB/llrb"
)
const (
TestSize = 1000000
)
type slIntInt struct {
key, val int
}
func (ii slIntInt) Less(other Item) bool {
return ii.key < other.(slIntInt).key
}
type llrbIntInt struct {
key, val int
}
func (ii llrbIntInt) Less(other llrb.Item) bool {
return ii.key < other.(llrbIntInt).key
}
func TestFuzzyLLRB(t *testing.T) {
rand.Seed(1)
tree := llrb.New()
for i := 0; i < TestSize; i++ {
v := rand.Intn(100000)
item := llrbIntInt{v, v}
if tree.Delete(item) == nil {
tree.ReplaceOrInsert(item)
}
}
}
func TestFuzzySkipList(t *testing.T) {
rand.Seed(1)
tree := New()
for i := 0; i < TestSize; i++ {
v := rand.Intn(100000)
item := slIntInt{v, v}
if tree.Delete(item) == nil {
tree.ReplaceOrInsert(item)
}
}
}
func TestFuzzyHangduSkipList(t *testing.T) {
rand.Seed(1)
tree := handu_skiplist.New(handu_skiplist.Int)
for i := 0; i < TestSize; i++ {
v := rand.Intn(100000)
if tree.Remove(v) == nil {
tree.Set(v, v)
}
}
}