lrucache

Documentation

Index

• func Run()
• type LRUCache
  • func NewLRUCache[K comparable, V any](capacity int) *LRUCache[K, V]
  • func (c *LRUCache[K, V]) Clear()
  • func (c *LRUCache[K, V]) Get(key K) (V, bool)
  • func (c *LRUCache[K, V]) Put(key K, value V)
  • func (c *LRUCache[K, V]) Size() int
• type Node

Functions

func Run

func Run()

Types

type LRUCache

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

LRUCache represents a thread-safe LRU cache implementation

func NewLRUCache

func NewLRUCache[K comparable, V any](capacity int) *LRUCache[K, V]

NewLRUCache creates a new LRU cache with the specified capacity

func (*LRUCache[K, V]) Clear

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

Clear removes all items from the cache

func (*LRUCache[K, V]) Get

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

Get retrieves a value from the cache

func (*LRUCache[K, V]) Put

func (c *LRUCache[K, V]) Put(key K, value V)

Put adds or updates a value in the cache

func (*LRUCache[K, V]) Size

func (c *LRUCache[K, V]) Size() int

Size returns the current number of items in the cache

type Node

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

Node represents a node in the doubly linked list