barbercollie/tinyauth
1
0
Fork 1
mirror of https://github.com/steveiliop56/tinyauth.git synced 2026-06-02 17:40:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix: fix bugs in cache order

Browse Source
This commit is contained in:
Stavros
2026-05-31 18:29:14 +03:00
parent ac9689dc9b
commit fe8463890a
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
internal/service/cache_store.go
+6 -6
View File
@@ -97,7 +97,9 @@ func (cs *CacheStore[T]) setCallback(key string, value T, ttl time.Duration) {
expiresAt: expiresAt,
}
cs.order = append(cs.order, key)
if !slices.Contains(cs.order, key) {
cs.order = append(cs.order, key)
}
}
func (cs *CacheStore[T]) Set(key string, value T, ttl time.Duration) {
@@ -159,7 +161,7 @@ func (cs *CacheStore[T]) evictOne() bool {
for k, e := range cs.cache {
if e.expiresAt != nil && now.After(*e.expiresAt) {
delete(cs.cache, k)
cs.deleteCallback(k)
return true
}
if e.expiresAt != nil && (oldestExp == nil || e.expiresAt.Before(*oldestExp)) {
@@ -169,13 +171,11 @@ func (cs *CacheStore[T]) evictOne() bool {
// If we found an oldest key, evict it else we delete the first key in the order list
if oldestKey != "" {
delete(cs.cache, oldestKey)
cs.deleteCallback(oldestKey)
return true
} else {
if len(cs.order) > 0 {
firstKey := cs.order[0]
cs.order = cs.order[1:]
delete(cs.cache, firstKey)
cs.deleteCallback(cs.order[0])
return true
}
}