-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkeys.go
82 lines (62 loc) · 1.23 KB
/
keys.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
package datastruct
// keys file put functions for key operation
import (
"github.com/yusank/glob"
smap "github.com/yusank/godis/lib/shard_map"
)
var defaultCache = newMemoryCache()
// MemoryCache 总数结构
type MemoryCache struct {
keys smap.Map
}
func newMemoryCache() *MemoryCache {
return &MemoryCache{keys: smap.New()}
}
type KeyInfo struct {
Type KeyType
Value interface{}
}
/*
* util functions
*/
func loadKeyInfo(key string, tp KeyType) (info *KeyInfo, err error) {
v, ok := defaultCache.keys.Get(key)
if !ok {
return nil, ErrNil
}
info = v.(*KeyInfo)
if info.Type != tp {
return nil, ErrKeyAndCommandNotMatch
}
return info, nil
}
/*
* Common Command
*/
func Exists(key string) bool {
return defaultCache.keys.Has(key)
}
func Type(key string) (kt KeyType, found bool) {
v, ok := defaultCache.keys.Get(key)
if !ok {
return "", false
}
return v.(*KeyInfo).Type, true
}
func Keys(pattern string) (keys []string) {
g := glob.MustCompile(pattern)
defaultCache.keys.Range(func(key string, _ interface{}) bool {
if g.Match(key) {
keys = append(keys, key)
}
return true
})
return
}
func Del(key string) int {
remove := defaultCache.keys.DeleteIfExists(key)
if remove {
return 1
}
return 0
}