-
Notifications
You must be signed in to change notification settings - Fork 17
/
cache.go
258 lines (207 loc) · 6.55 KB
/
cache.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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
package theine
import (
"context"
"io"
"time"
"github.com/Yiling-J/theine-go/internal"
)
const (
ZERO_TTL = 0 * time.Second
)
var VersionMismatch = internal.VersionMismatch
type RemoveReason = internal.RemoveReason
type DataBlock = internal.DataBlock[any]
type Stats = internal.Stats
type Loaded[V any] struct {
Value V
Cost int64
TTL time.Duration
}
func (l *Loaded[V]) internal() internal.Loaded[V] {
return internal.Loaded[V]{
Value: l.Value,
Cost: l.Cost,
TTL: l.TTL,
}
}
const (
REMOVED = internal.REMOVED
EVICTED = internal.EVICTED
EXPIRED = internal.EXPIRED
)
type Cache[K comparable, V any] struct {
store *internal.Store[K, V]
}
// Get gets value by key.
func (c *Cache[K, V]) Get(key K) (V, bool) {
return c.store.Get(key)
}
// Set inserts or updates entry in cache with given ttl.
// Return false when cost > max size.
func (c *Cache[K, V]) SetWithTTL(key K, value V, cost int64, ttl time.Duration) bool {
return c.store.Set(key, value, cost, ttl)
}
// Set inserts or updates entry in cache.
// Return false when cost > max size.
func (c *Cache[K, V]) Set(key K, value V, cost int64) bool {
return c.SetWithTTL(key, value, cost, ZERO_TTL)
}
// Delete deletes key from cache.
func (c *Cache[K, V]) Delete(key K) {
c.store.Delete(key)
}
// Range calls f sequentially for each key and value present in the cache.
// If f returns false, range stops the iteration.
func (c *Cache[K, V]) Range(f func(key K, value V) bool) {
c.store.Range(f)
}
// Len returns number of entries in cache.
func (c *Cache[K, V]) Len() int {
return c.store.Len()
}
// EstimatedSize returns an approximate used size of the cache.
func (c *Cache[K, V]) EstimatedSize() int {
return c.store.EstimatedSize()
}
// Close closes all goroutines created by cache.
func (c *Cache[K, V]) Close() {
c.store.Close()
}
// SaveCache save cache data to writer.
func (c *Cache[K, V]) SaveCache(version uint64, writer io.Writer) error {
return c.store.Persist(version, writer)
}
// LoadCache load cache data from reader.
func (c *Cache[K, V]) LoadCache(version uint64, reader io.Reader) error {
return c.store.Recover(version, reader)
}
// Get cache stats.
func (c *Cache[K, V]) Stats() Stats {
return c.store.Stats()
}
// Wait write buffer sync to policy.
func (c *Cache[K, V]) Wait() {
c.store.Wait()
}
type LoadingCache[K comparable, V any] struct {
store *internal.LoadingStore[K, V]
}
// Get gets value by key.
func (c *LoadingCache[K, V]) Get(ctx context.Context, key K) (V, error) {
return c.store.Get(ctx, key)
}
// Set inserts or updates entry in cache with given ttl.
// Return false when cost > max size.
func (c *LoadingCache[K, V]) SetWithTTL(key K, value V, cost int64, ttl time.Duration) bool {
return c.store.Set(key, value, cost, ttl)
}
// Set inserts or updates entry in cache.
// Return false when cost > max size.
func (c *LoadingCache[K, V]) Set(key K, value V, cost int64) bool {
return c.SetWithTTL(key, value, cost, ZERO_TTL)
}
// Delete deletes key from cache.
func (c *LoadingCache[K, V]) Delete(key K) {
c.store.Delete(key)
}
// Range calls f sequentially for each key and value present in the cache.
// If f returns false, range stops the iteration.
func (c *LoadingCache[K, V]) Range(f func(key K, value V) bool) {
c.store.Range(f)
}
// Len returns number of entries in cache.
func (c *LoadingCache[K, V]) Len() int {
return c.store.Len()
}
// EstimatedSize returns an approximate used size of the cache.
func (c *LoadingCache[K, V]) EstimatedSize() int {
return c.store.EstimatedSize()
}
// SaveCache save cache data to writer.
func (c *LoadingCache[K, V]) SaveCache(version uint64, writer io.Writer) error {
return c.store.Persist(version, writer)
}
// LoadCache load cache data from reader.
func (c *LoadingCache[K, V]) LoadCache(version uint64, reader io.Reader) error {
return c.store.Recover(version, reader)
}
// Get cache stats.
func (c *LoadingCache[K, V]) Stats() Stats {
return c.store.Stats()
}
// Wait write buffer sync to policy.
func (c *LoadingCache[K, V]) Wait() {
c.store.Wait()
}
// Close closes all goroutines created by cache.
func (c *LoadingCache[K, V]) Close() {
c.store.Close()
}
type Serializer[T any] interface {
internal.Serializer[T]
}
type HybridCache[K comparable, V any] struct {
store *internal.Store[K, V]
}
// Get gets value by key.
func (c *HybridCache[K, V]) Get(key K) (V, bool, error) {
return c.store.GetWithSecodary(key)
}
// Set inserts or updates entry in cache with given ttl.
// Return false when cost > max size.
func (c *HybridCache[K, V]) SetWithTTL(key K, value V, cost int64, ttl time.Duration) bool {
return c.store.Set(key, value, cost, ttl)
}
// Set inserts or updates entry in cache.
// Return false when cost > max size.
func (c *HybridCache[K, V]) Set(key K, value V, cost int64) bool {
return c.SetWithTTL(key, value, cost, ZERO_TTL)
}
// Delete deletes key from cache.
func (c *HybridCache[K, V]) Delete(key K) error {
return c.store.DeleteWithSecondary(key)
}
// SaveCache save cache data to writer.
func (c *HybridCache[K, V]) SaveCache(version uint64, writer io.Writer) error {
return c.store.Persist(version, writer)
}
// LoadCache load cache data from reader.
func (c *HybridCache[K, V]) LoadCache(version uint64, reader io.Reader) error {
return c.store.Recover(version, reader)
}
// Close closes all goroutines created by cache.
func (c *HybridCache[K, V]) Close() {
}
type HybridLoadingCache[K comparable, V any] struct {
store *internal.LoadingStore[K, V]
}
// Get gets value by key.
func (c *HybridLoadingCache[K, V]) Get(ctx context.Context, key K) (V, error) {
return c.store.Get(ctx, key)
}
// Set inserts or updates entry in cache with given ttl.
// Return false when cost > max size.
func (c *HybridLoadingCache[K, V]) SetWithTTL(key K, value V, cost int64, ttl time.Duration) bool {
return c.store.Set(key, value, cost, ttl)
}
// Set inserts or updates entry in cache.
// Return false when cost > max size.
func (c *HybridLoadingCache[K, V]) Set(key K, value V, cost int64) bool {
return c.SetWithTTL(key, value, cost, ZERO_TTL)
}
// Delete deletes key from cache.
func (c *HybridLoadingCache[K, V]) Delete(key K) error {
return c.store.DeleteWithSecondary(key)
}
// SaveCache save cache data to writer.
func (c *HybridLoadingCache[K, V]) SaveCache(version uint64, writer io.Writer) error {
return c.store.Persist(version, writer)
}
// LoadCache load cache data from reader.
func (c *HybridLoadingCache[K, V]) LoadCache(version uint64, reader io.Reader) error {
return c.store.Recover(version, reader)
}
// Close closes all goroutines created by cache.
func (c *HybridLoadingCache[K, V]) Close() {
c.store.Close()
}