algorithm

package

v1.1.1 Latest Latest Go to latest Published: Dec 19, 2025 License: MIT Imports: 3 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type CacheNode struct {
	Key, Value interface{}
}

type LRUCache struct {
	Capacity int32
	// contains filtered or unexported fields
}

LRUCache is a simple thread-safe LRU cache. It uses a single RWMutex to guard both the list and the map to avoid deadlocks and inconsistent views.

func NewLRUCache(cap int32) *LRUCache

func (lru *LRUCache) Get(k interface{}) (v interface{}, found bool, err error)

Get returns value, found flag and error. When key is found, it is moved to front as most recently used.

func (lru *LRUCache) Peek(k interface{}) (v interface{}, found bool, err error)

Peek returns value, found flag and error without updating LRU order. It is useful for read-only inspection that should not affect eviction order.

func (lru *LRUCache) Remove(k interface{}) bool

Remove deletes a key if it exists, and returns true when removed.

func (lru *LRUCache) Set(k, v interface{}) error

Set inserts or updates a key. If capacity is exceeded, the least recently used entry is evicted.

func (lru *LRUCache) Size() int