-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlow_lfuex.go
171 lines (159 loc) · 3.08 KB
/
low_lfuex.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
package gcache
import (
"container/list"
"time"
)
type lowLFUEx struct {
keys map[interface{}]*list.Element
hot *lfuHeap
list *list.List
capacity int
expiry time.Duration
}
func newLowLFUEx(capacity int, expiry time.Duration) *lowLFUEx {
return &lowLFUEx{
keys: make(map[interface{}]*list.Element, capacity),
hot: newLFUHeap(capacity),
list: list.New(),
capacity: capacity,
expiry: expiry,
}
}
func (l *lowLFUEx) ClearExpired() {
if l.expiry > 0 {
var (
ele *list.Element
v lfuValue
list = l.list
hot = l.hot
keys = l.keys
)
for {
ele = list.Front()
if ele == nil {
break
}
v = ele.Value.(lfuValue)
if v.IsDeleted() {
list.Remove(ele)
hot.Remove(v.GetIndex())
delete(keys, v.GetKey())
} else {
break
}
}
}
}
// Add the value to the cache, only when the key does not exist
func (l *lowLFUEx) Add(key, value interface{}) (added bool) {
ele, exists := l.keys[key]
if exists {
v := ele.Value.(lfuValue)
if v.IsDeleted() {
added = true
v.SetValue(value)
l.moveHot(ele)
l.ClearExpired()
}
} else {
added = true
l.add(key, value)
}
return
}
func (l *lowLFUEx) add(key, value interface{}) (delkey, delval interface{}, deleted bool) {
// capacity limit reached, pop front
if l.hot.Len() >= l.capacity {
deleted = true
v := l.hot.heap[0]
delkey = v.GetKey()
delval = v.GetValue()
delete(l.keys, delkey)
l.list.Remove(l.keys[delkey])
l.hot.Remove(0)
}
// new value
v := newLFUValue(key, value, l.expiry)
l.keys[key] = l.list.PushBack(v)
l.hot.Push(v)
return
}
func (l *lowLFUEx) moveHot(ele *list.Element) {
v := ele.Value.(lfuValue)
v.SetDeadline(time.Now().Add(l.expiry))
l.list.MoveToBack(ele)
v.Increment()
l.hot.Fix(v.GetIndex())
}
func (l *lowLFUEx) Put(key, value interface{}) (delkey, delval interface{}, deleted bool) {
ele, exists := l.keys[key]
if exists {
// put
v := ele.Value.(lfuValue)
if v.IsDeleted() {
v.SetValue(value)
// move hot
l.moveHot(ele)
l.ClearExpired()
} else {
deleted = true
delkey = key
delval = v.GetValue()
v.SetValue(value)
// move hot
l.moveHot(ele)
}
} else {
delkey, delval, deleted = l.add(key, value)
}
return
}
// Get return cache value
func (l *lowLFUEx) Get(key interface{}) (value interface{}, exists bool) {
ele, exists := l.keys[key]
if !exists {
return
}
v := ele.Value.(lfuValue)
if v.IsDeleted() {
delete(l.keys, key)
l.list.Remove(ele)
l.hot.Remove(v.GetIndex())
exists = false
l.ClearExpired()
return
}
value = v.GetValue()
// move hot
l.moveHot(ele)
return
}
func (l *lowLFUEx) Delete(key ...interface{}) (changed int) {
var (
ele *list.Element
exists bool
v lfuValue
)
for _, k := range key {
ele, exists = l.keys[k]
if exists {
v = ele.Value.(lfuValue)
changed++
delete(l.keys, k)
l.list.Remove(ele)
l.hot.Remove(v.GetIndex())
}
}
return
}
func (l *lowLFUEx) Len() int {
return l.hot.Len()
}
func (l *lowLFUEx) Clear() {
l.list.Init()
l.hot.Clear()
for k := range l.keys {
delete(l.keys, k)
}
return
}