cache

package

v0.2.0 Latest Latest Go to latest Published: Apr 17, 2026 License: MIT Imports: 1 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type LRU[K comparable, V any] struct {
	// contains filtered or unexported fields
}

LRU is a generic, thread-safe least-recently-used cache.

func NewLRU[K comparable, V any](capacity int) *LRU[K, V]

func (c *LRU[K, V]) Clear()

Clear removes all items.

func (c *LRU[K, V]) Delete(key K)

Delete removes a key from the cache.

func (c *LRU[K, V]) Get(key K) (V, bool)

Get retrieves a value and moves it to the front (most recent).

func (c *LRU[K, V]) Len() int

Len returns the current number of items.

func (c *LRU[K, V]) Put(key K, val V)

Put inserts or updates a key-value pair. Evicts LRU if at capacity.