-
Notifications
You must be signed in to change notification settings - Fork 3
/
standard.go
159 lines (125 loc) · 3.44 KB
/
standard.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
// Copyright 2023 FishGoddess. All Rights Reserved.
//
// 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 cachego
import (
"time"
)
type standardCache struct {
cache
entries map[string]*entry
}
func newStandardCache(conf *config) Cache {
cache := &standardCache{
entries: make(map[string]*entry, mapInitialCap),
}
cache.setup(conf, cache)
return cache
}
func (sc *standardCache) get(key string) (value interface{}, found bool) {
entry, ok := sc.entries[key]
if ok && !entry.expired(0) {
return entry.value, true
}
return nil, false
}
func (sc *standardCache) evict() (evictedValue interface{}) {
for key := range sc.entries {
return sc.remove(key)
}
return nil
}
func (sc *standardCache) set(key string, value interface{}, ttl time.Duration) (evictedValue interface{}) {
entry, ok := sc.entries[key]
if ok {
entry.setup(key, value, ttl)
return nil
}
if sc.maxEntries > 0 && sc.size() >= sc.maxEntries {
evictedValue = sc.evict()
}
sc.entries[key] = newEntry(key, value, ttl, sc.now)
return evictedValue
}
func (sc *standardCache) remove(key string) (removedValue interface{}) {
entry, ok := sc.entries[key]
if !ok {
return nil
}
delete(sc.entries, key)
return entry.value
}
func (sc *standardCache) size() (size int) {
return len(sc.entries)
}
func (sc *standardCache) gc() (cleans int) {
now := sc.now()
scans := 0
for _, entry := range sc.entries {
scans++
if entry.expired(now) {
delete(sc.entries, entry.key)
cleans++
}
if sc.maxScans > 0 && scans >= sc.maxScans {
break
}
}
return cleans
}
func (sc *standardCache) reset() {
sc.entries = make(map[string]*entry, mapInitialCap)
sc.Loader.Reset()
}
// Get gets the value of key from cache and returns value if found.
// See Cache interface.
func (sc *standardCache) Get(key string) (value interface{}, found bool) {
sc.lock.RLock()
defer sc.lock.RUnlock()
return sc.get(key)
}
// Set sets key and value to cache with ttl and returns evicted value if exists and unexpired.
// See Cache interface.
func (sc *standardCache) Set(key string, value interface{}, ttl time.Duration) (evictedValue interface{}) {
sc.lock.Lock()
defer sc.lock.Unlock()
return sc.set(key, value, ttl)
}
// Remove removes key and returns the removed value of key.
// See Cache interface.
func (sc *standardCache) Remove(key string) (removedValue interface{}) {
sc.lock.Lock()
defer sc.lock.Unlock()
return sc.remove(key)
}
// Size returns the count of keys in cache.
// See Cache interface.
func (sc *standardCache) Size() (size int) {
sc.lock.RLock()
defer sc.lock.RUnlock()
return sc.size()
}
// GC cleans the expired keys in cache and returns the exact count cleaned.
// See Cache interface.
func (sc *standardCache) GC() (cleans int) {
sc.lock.Lock()
defer sc.lock.Unlock()
return sc.gc()
}
// Reset resets cache to initial status which is like a new cache.
// See Cache interface.
func (sc *standardCache) Reset() {
sc.lock.Lock()
defer sc.lock.Unlock()
sc.reset()
}