BlackForestBytes/goext
20
0
Fork 0
Code Actions

v0.0.54

Browse Source
This commit is contained in:
Mike Schwörer 2022-12-29 22:52:52 +01:00
parent aeded3fb37
commit ba07625b7c
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
1 changed files with 16 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
dataext/lruMap.go
View File

@ -19,38 +19,38 @@ import (
// There are also a bunch of unit tests to ensure that the cache is always in a consistent state // There are also a bunch of unit tests to ensure that the cache is always in a consistent state
// //
type LRUMap[TData any] struct { type LRUMap[TKey comparable, TData any] struct {
maxsize int maxsize int
lock sync.Mutex lock sync.Mutex
cache map[string]*cacheNode[TData] cache map[TKey]*cacheNode[TKey, TData]
lfuHead *cacheNode[TData] lfuHead *cacheNode[TKey, TData]
lfuTail *cacheNode[TData] lfuTail *cacheNode[TKey, TData]
} }
type cacheNode[TData any] struct { type cacheNode[TKey comparable, TData any] struct {
key string key TKey
data TData data TData
parent *cacheNode[TData] parent *cacheNode[TKey, TData]
child *cacheNode[TData] child *cacheNode[TKey, TData]
} }
func NewLRUMap[TData any](size int) *LRUMap[TData] { func NewLRUMap[TKey comparable, TData any](size int) *LRUMap[TKey, TData] {
if size <= 2 && size != 0 { if size <= 2 && size != 0 {
panic("Size must be > 2 (or 0)") panic("Size must be > 2 (or 0)")
} }
return &LRUMap[TData]{ return &LRUMap[TKey, TData]{
maxsize: size, maxsize: size,
lock: sync.Mutex{}, lock: sync.Mutex{},
cache: make(map[string]*cacheNode[TData], size+1), cache: make(map[TKey]*cacheNode[TKey, TData], size+1),
lfuHead: nil, lfuHead: nil,
lfuTail: nil, lfuTail: nil,
} }
} }
func (c *LRUMap[TData]) Put(key string, value TData) { func (c *LRUMap[TKey, TData]) Put(key TKey, value TData) {
if c.maxsize == 0 { if c.maxsize == 0 {
return // cache disabled return // cache disabled
} }
@ -68,7 +68,7 @@ func (c *LRUMap[TData]) Put(key string, value TData) {
} }
// key does not exist: insert into map and add to top of LFU // key does not exist: insert into map and add to top of LFU
node = &cacheNode[TData]{ node = &cacheNode[TKey, TData]{
key: key, key: key,
data: value, data: value,
parent: nil, parent: nil,
@ -93,7 +93,7 @@ func (c *LRUMap[TData]) Put(key string, value TData) {
} }
} }
func (c *LRUMap[TData]) TryGet(key string) (TData, bool) { func (c *LRUMap[TKey, TData]) TryGet(key TKey) (TData, bool) {
if c.maxsize == 0 { if c.maxsize == 0 {
return *new(TData), false // cache disabled return *new(TData), false // cache disabled
} }
@ -109,7 +109,7 @@ func (c *LRUMap[TData]) TryGet(key string) (TData, bool) {
return val.data, ok return val.data, ok
} }
func (c *LRUMap[TData]) moveNodeToTop(node *cacheNode[TData]) { func (c *LRUMap[TKey, TData]) moveNodeToTop(node *cacheNode[TKey, TData]) {
// (only called in critical section !) // (only called in critical section !)
if c.lfuHead == node { // fast case if c.lfuHead == node { // fast case
@ -142,7 +142,7 @@ func (c *LRUMap[TData]) moveNodeToTop(node *cacheNode[TData]) {
} }
} }
func (c *LRUMap[TData]) Size() int { func (c *LRUMap[TKey, TData]) Size() int {
c.lock.Lock() c.lock.Lock()
defer c.lock.Unlock() defer c.lock.Unlock()
return len(c.cache) return len(c.cache)