Package Usage: go: github.com/decred/dcrd/lru
Package lru implements generic least-recently-used caches with near O(1) perf.
A least-recently-used (LRU) cache is a cache that holds a limited number of
items with an eviction policy such that when the capacity of the cache is
exceeded, the least-recently-used item is automatically removed when inserting a
new item. The meaning of used in this implementation is either accessing the
item via a lookup or adding the item into the cache, including when the item
already exists.
This package has intentionally been designed so it can be used as a standalone
package for any projects needing to make use of a well-test least-recently-used
cache with near O(1) performance characteristics for lookups, inserts, and
deletions.
This example demonstrates creating a new kv cache instance, inserting items
into the cache, causing an eviction of the least-recently-used item, and
removing an item.
This example demonstrates creating a new cache instance, inserting items into
the cache, causing an eviction of the least-recently-used item, and removing
an item.
5 versions
Latest release: almost 3 years ago
644 dependent packages
View more package details: https://packages.ecosystem.code.gouv.fr/registries/proxy.golang.org/packages/github.com/decred/dcrd/lru