lru

Documentation

Overview

Package lru implements a generic least-recently-used cache.

Index

• type LRU
  • func New[K comparable, V any](size int) *LRU[K, V]
  • func (c *LRU[K, V]) Add(key K, value V) (evicted bool)
  • func (c *LRU[K, V]) Get(key K) (V, bool)

Types

type LRU

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

LRU is a fixed-size least-recently-used cache.

func New

func New[K comparable, V any](size int) *LRU[K, V]

New creates a new LRU cache with the given maximum size.

func (*LRU[K, V]) Add

func (c *LRU[K, V]) Add(key K, value V) (evicted bool)

Add inserts a key-value pair, evicting the oldest entry if at capacity.

func (*LRU[K, V]) Get

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

Get retrieves a value by key, returning it and whether it was found.