lru

Documentation

Overview

Package lru implements a simple LRU cache.

Index

• type Handle
  • func New[K comparable](capacity uint) *Handle[K]
  • func (l *Handle[K]) Get(key K) (any, bool)
  • func (l *Handle[K]) Len() uint
  • func (l *Handle[K]) Put(key K, value any)

Types

type Handle

type Handle[K comparable] struct {
	// contains filtered or unexported fields
}

Handle is the actual LRU cache.

func New

func New[K comparable](capacity uint) *Handle[K]

New creates a new LRU cache.

func (*Handle[K]) Get

func (l *Handle[K]) Get(key K) (any, bool)

Get returns the value associated with the key and a boolean indicating if the key was found. If found the node is promoted to the front.

func (*Handle[K]) Len

func (l *Handle[K]) Len() uint

Len returns the number of elements in the cache.

func (*Handle[K]) Put

func (l *Handle[K]) Put(key K, value any)

Put puts the value associated with the key.