forked from sean-public/skiplist-survey
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmauricegit.go
121 lines (89 loc) · 1.87 KB
/
mauricegit.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
package main
import (
"fmt"
mtSkiplist "github.com/MauriceGit/skiplist"
"math/rand"
"time"
)
type element uint64
func (e element) ExtractKey() float64 {
return float64(e)
}
func (e element) String() string {
return fmt.Sprintf("%03d", e)
}
func mtInserts(n int) {
list := mtSkiplist.New()
defer timeTrack(time.Now(), n)
for i := 0; i < n; i++ {
list.Insert(element(n - i))
}
}
func mtWorstInserts(n int) {
list := mtSkiplist.New()
defer timeTrack(time.Now(), n)
for i := 0; i < n; i++ {
list.Insert(element(i))
}
}
func mtRandomInserts(n int) {
list := mtSkiplist.New()
rList := rand.Perm(n)
defer timeTrack(time.Now(), n)
for _, e := range rList {
list.Insert(element(e))
}
}
func mtAvgSearch(n int) {
list := mtSkiplist.New()
for i := 0; i < n; i++ {
list.Insert(element(n - i))
}
defer timeTrack(time.Now(), n)
for i := 0; i < n; i++ {
_, _ = list.Find(element(i))
}
}
func mtSearchEnd(n int) {
list := mtSkiplist.New()
for i := 0; i < n; i++ {
list.Insert(element(n - i))
}
defer timeTrack(time.Now(), n)
for i := 0; i < n; i++ {
_, _ = list.Find(element(n))
}
}
func mtDelete(n int) {
list := mtSkiplist.New()
for i := 0; i < n; i++ {
list.Insert(element(n - i))
}
defer timeTrack(time.Now(), n)
for i := 0; i < n; i++ {
list.Delete(element(i))
}
}
func mtWorstDelete(n int) {
list := mtSkiplist.New()
for i := 0; i < n; i++ {
list.Insert(element(n - i))
}
defer timeTrack(time.Now(), n)
for i := 0; i < n; i++ {
list.Delete(element(n - i))
}
}
func mtRandomDelete(n int) {
list := mtSkiplist.New()
for i := 0; i < n; i++ {
list.Insert(element(n - i))
}
rList := rand.Perm(n)
defer timeTrack(time.Now(), n)
for _, e := range rList {
list.Delete(element(e))
}
}
var mtFunctions = []func(int){mtInserts, mtWorstInserts, mtRandomInserts,
mtAvgSearch, mtSearchEnd, mtDelete, mtWorstDelete, mtRandomDelete}