-
Notifications
You must be signed in to change notification settings - Fork 1
/
memory.go
171 lines (136 loc) · 4.36 KB
/
memory.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
// MIT License
// Copyright (c) The RAI Authors
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
package memory
import (
"strings"
"sync"
"time"
"github.com/alphadose/haxmap"
)
type Cache interface {
GetMemory(key string) (interface{}, bool)
SetMemory(key string, value any, duration time.Duration)
DelMemory(key string)
CloseMemory()
}
// memoryCache stores arbitrary data with ttl.
type memoryCache struct {
keys *haxmap.Map[string, data]
done chan struct{}
}
// data represents an arbitrary value with ttl.
type data struct {
value any
ttl int64 // unix nano
}
// memoryDBConn is a singleton memory database connection.
var memoryDBConn *memoryCache
var memoryOnce sync.Once
// NewMemoryCache New creates a new memory that asynchronously cleans expired entries after the given ttl passes.
func NewMemoryCache() Cache {
memoryOnce.Do(func() {
// XXX: IMPORTANT - Run the ttl cleaning process in every 60 seconds.
ttlCleaningInterval := 60 * time.Second
h := haxmap.New[string, data]()
if h == nil {
panic("failed to initialize the memory!")
}
memoryDBConn = &memoryCache{
keys: h,
done: make(chan struct{}),
}
go func() {
ticker := time.NewTicker(ttlCleaningInterval)
defer ticker.Stop()
for {
select {
case <-ticker.C:
now := time.Now().UnixNano()
// O(N) iteration. It is linear time complexity.
memoryDBConn.keys.ForEach(func(k string, d data) bool {
if d.ttl > 0 && now > d.ttl {
memoryDBConn.keys.Del(k)
}
return true
})
case <-memoryDBConn.done:
return
}
}
}()
})
return memoryDBConn
}
// GetMemory Get gets the value for the given key.
func (mem *memoryCache) GetMemory(key string) (interface{}, bool) {
d, exists := mem.keys.Get(key)
if !exists {
return nil, false
}
if d.ttl > 0 && time.Now().UnixNano() > d.ttl {
return nil, false
}
return d.value, true
}
// SetMemory Set sets a value for the given key with an expiration duration.
// If the duration is 0 or less, it will be stored forever.
func (mem *memoryCache) SetMemory(key string, value any, duration time.Duration) {
var expires int64
if duration > 0 {
expires = time.Now().Add(duration).UnixNano()
}
mem.keys.Set(key, data{
value: value,
ttl: expires,
})
}
// DelMemory Del deletes the key and its value from the memory cache.
// If the key has a wildcard (`*`), it will delete all keys that match the wildcard.
func (mem *memoryCache) DelMemory(key string) {
if !strings.Contains(key, "*") {
// Delete by a normal key.
mem.keys.Del(key)
return
}
// Delete by wildcard key.
mem.keys.ForEach(func(k string, _ data) bool {
if matchWildCard([]rune(k), []rune(key)) {
mem.keys.Del(k)
}
return true
})
}
func matchWildCard(str, pattern []rune) bool {
if len(pattern) == 0 {
return len(str) == 0 // Return true finally if both are empty after the rescursive matching.
}
if pattern[0] == '*' {
// Match with no wildcard pattern, if it doesn't match, move to the next character.
return matchWildCard(str, pattern[1:]) ||
(len(str) > 0 && matchWildCard(str[1:], pattern))
}
if len(str) == 0 || str[0] != pattern[0] {
return false
}
// Recurse with the rest of the string and the pattern.
return matchWildCard(str[1:], pattern[1:])
}
// CloseMemory Close closes the memory cache and frees up resources.
func (mem *memoryCache) CloseMemory() {
mem.done <- struct{}{}
}