-
Notifications
You must be signed in to change notification settings - Fork 0
/
key.go
70 lines (58 loc) · 1.27 KB
/
key.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
package db
import (
rt "github.com/plar/go-adaptive-radix-tree"
)
// Value 基数树 key 对应的 value
type Value struct {
fid int64
offset int64
// 消息大小
entrySize int64
}
// RadixTree 基数树 所有数据存放的地方
type RadixTree struct {
tree rt.Tree
}
func str2bytes(str string) []byte {
return []byte(str)
}
func (node *RadixTree) Put(key string, v Value) (oldVal interface{}, updated bool) {
return node.tree.Insert(str2bytes(key), v)
}
func (art *RadixTree) Get(key string) interface{} {
value, _ := art.tree.Search(str2bytes(key))
return value
}
func (art *RadixTree) Delete(key string) (val interface{}, updated bool) {
return art.tree.Delete(str2bytes(key))
}
func (art *RadixTree) Iterator() rt.Iterator {
return art.tree.Iterator()
}
func (art *RadixTree) PrefixScan(prefix string, count int) (keys [][]byte) {
cb := func(node rt.Node) bool {
if node.Kind() != rt.Leaf {
return true
}
if count <= 0 {
return false
}
keys = append(keys, node.Key())
count--
return true
}
if len(prefix) == 0 {
art.tree.ForEach(cb)
} else {
art.tree.ForEachPrefix(str2bytes(prefix), cb)
}
return
}
func (art *RadixTree) Size() int {
return art.tree.Size()
}
func NewRadixTree() *RadixTree {
return &RadixTree{
tree: rt.New(),
}
}