-
Notifications
You must be signed in to change notification settings - Fork 0
/
ristretto.go
55 lines (43 loc) · 984 Bytes
/
ristretto.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
package cache_bench
import (
"time"
"github.com/c-pro/geche"
"github.com/dgraph-io/ristretto"
)
type Ristretto[K comparable, V any] struct {
c *ristretto.Cache
zero V
ttl time.Duration
}
func NewRistretto[K comparable, V any](size int, ttl time.Duration) *Ristretto[K, V] {
client, err := ristretto.NewCache(&ristretto.Config{
NumCounters: int64(size * 10),
MaxCost: int64(size),
BufferItems: 64,
})
if err != nil {
panic(err)
}
return &Ristretto[K, V]{client, zero[V](), ttl}
}
func (r *Ristretto[K, V]) Get(key K) (V, error) {
v, ok := r.c.Get(key)
if ok {
return v.(V), nil
}
return r.zero, geche.ErrNotFound
}
func (r *Ristretto[K, V]) Set(key K, value V) {
r.c.SetWithTTL(key, value, 1, r.ttl)
}
func (r *Ristretto[K, V]) Del(key K) error {
r.c.Del(key)
return nil
}
func (r *Ristretto[K, V]) Len() int {
return int(r.c.Metrics.KeysAdded())
}
func (r *Ristretto[K, V]) Snapshot() map[K]V {
// not used in benchmark
return nil
}