Documentation
¶
Overview ¶
Copyright 2025 Kristopher Rahim Afful-Brown. All rights reserved.
Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type LRU ¶
type LRU[K comparable, V any] struct { // MaxEntries is the maximum number of cache entries before // an item is evicted. Zero means no limit. MaxEntries int // OnEvicted optionally specifies a callback function to be // executed when an entry is purged from the cache. OnEvicted func(key K, value V) // contains filtered or unexported fields }
LRU is an LRU cache. It is not safe for concurrent access.
func New ¶
func New[K comparable, V any](maxEntries int) *LRU[K, V]
New creates a new Cache. If maxEntries is zero, the cache has no limit and it's assumed that eviction is done by the caller.
func (*LRU[K, V]) Remove ¶
func (c *LRU[K, V]) Remove(key K)
Remove removes the provided key from the cache.
func (*LRU[K, V]) RemoveOldest ¶
func (c *LRU[K, V]) RemoveOldest()
RemoveOldest removes the oldest item from the cache.
Source Files
Click to show internal directories.
Click to hide internal directories.