-
Notifications
You must be signed in to change notification settings - Fork 1
/
memory.go
137 lines (109 loc) · 3.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
// 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 dbdrivers
import (
"sync"
"time"
"github.com/alphadose/haxmap"
)
type MemoryConfig struct {
On bool
DelKeyAPI struct {
EndPoint string
AuthBearerToken string
}
}
// Memory stores arbitrary data with ttl.
type Memory struct {
keys *haxmap.Map[string, Key]
done chan struct{}
}
// A Key represents arbitrary data with ttl.
type Key struct {
value any
ttl int64 // unix nano
}
// memoryDBConn is a singleton memory database connection.
var memoryDBConn *Memory
var memoryOnce sync.Once
// New creates a new memory that asynchronously cleans expired entries after the given ttl passes.
func NewMemory() *Memory {
memoryOnce.Do(func() {
// XXX: IMPORTANT - Run the ttl cleaning process in every 60 seconds.
ttlCleaningInterval := 60 * time.Second
h := haxmap.New[string, Key]()
if h == nil {
panic("Failed to initialize the memory!")
}
memoryDBConn = &Memory{
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, item Key) bool {
if item.ttl > 0 && now > item.ttl {
memoryDBConn.keys.Del(k)
}
return true
})
case <-memoryDBConn.done:
return
}
}
}()
})
return memoryDBConn
}
// Get gets the value for the given key.
func (mem *Memory) GetMemory(k string) (interface{}, bool) {
key, exists := mem.keys.Get(k)
if !exists {
return nil, false
}
if key.ttl > 0 && time.Now().UnixNano() > key.ttl {
return nil, false
}
return key.value, true
}
// 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 *Memory) SetMemory(key string, value any, duration time.Duration) {
var expires int64
if duration > 0 {
expires = time.Now().Add(duration).UnixNano()
}
mem.keys.Set(key, Key{
value: value,
ttl: expires,
})
}
// Del deletes the key and its value from the memory cache.
func (mem *Memory) DelMemory(key string) {
mem.keys.Del(key)
}
// Close closes the memory cache and frees up resources.
func (mem *Memory) CloseMemory() {
mem.done <- struct{}{}
}