forked from zuoyebang/bitalosdb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathiterator_test.go
72 lines (63 loc) · 1.61 KB
/
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// Copyright 2021 The Bitalosdb author([email protected]) and other contributors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package bitalosdb
import (
"testing"
"time"
"golang.org/x/exp/rand"
)
func BenchmarkIteratorSeekGE(b *testing.B) {
m, keys := buildMemTable(b)
iter := &Iterator{
cmp: DefaultComparer.Compare,
equal: DefaultComparer.Equal,
iter: m.newIter(nil),
}
rng := rand.New(rand.NewSource(uint64(time.Now().UnixNano())))
b.ResetTimer()
for i := 0; i < b.N; i++ {
key := keys[rng.Intn(len(keys))]
iter.SeekGE(key)
}
}
func BenchmarkIteratorNext(b *testing.B) {
m, _ := buildMemTable(b)
iter := &Iterator{
cmp: DefaultComparer.Compare,
equal: DefaultComparer.Equal,
iter: m.newIter(nil),
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
if !iter.Valid() {
iter.First()
}
iter.Next()
}
}
func BenchmarkIteratorPrev(b *testing.B) {
m, _ := buildMemTable(b)
iter := &Iterator{
cmp: DefaultComparer.Compare,
equal: DefaultComparer.Equal,
iter: m.newIter(nil),
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
if !iter.Valid() {
iter.Last()
}
iter.Prev()
}
}