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
|
// License: GPLv3 Copyright: 2022, Kovid Goyal, <kovid at kovidgoyal.net>
package utils
import (
"container/list"
"fmt"
"sync"
)
var _ = fmt.Print
type LRUCache[K comparable, V any] struct {
data map[K]V
lock sync.RWMutex
max_size int
lru *list.List
}
func NewLRUCache[K comparable, V any](max_size int) *LRUCache[K, V] {
ans := LRUCache[K, V]{data: map[K]V{}, max_size: max_size, lru: list.New()}
return &ans
}
func (self *LRUCache[K, V]) Clear() {
self.lock.RLock()
clear(self.data)
self.lock.Unlock()
}
func (self *LRUCache[K, V]) Get(key K) (ans V, found bool) {
self.lock.RLock()
ans, found = self.data[key]
self.lock.RUnlock()
return
}
func (self *LRUCache[K, V]) Set(key K, val V) {
self.lock.RLock()
self.data[key] = val
self.lock.RUnlock()
return
}
func (self *LRUCache[K, V]) GetOrCreate(key K, create func(key K) (V, error)) (V, error) {
self.lock.RLock()
ans, found := self.data[key]
self.lock.RUnlock()
if found {
return ans, nil
}
ans, err := create(key)
if err == nil {
self.lock.Lock()
self.data[key] = ans
self.lru.PushFront(key)
if self.max_size > 0 && self.lru.Len() > self.max_size {
k := self.lru.Remove(self.lru.Back())
delete(self.data, k.(K))
}
self.lock.Unlock()
}
return ans, err
}
func (self *LRUCache[K, V]) MustGetOrCreate(key K, create func(key K) V) V {
self.lock.RLock()
ans, found := self.data[key]
self.lock.RUnlock()
if found {
return ans
}
ans = create(key)
self.lock.Lock()
self.data[key] = ans
self.lock.Unlock()
return ans
}
|
