cache

type Cache[K comparable, T any] interface {
	// Capacity returns the maximum number of entries the cache will hold.
	Capacity() int

	// Resize changes the cache's capacity to capacity, evicting entries as
	// needed to fit the new bound, and returns the number of entries evicted.
	// It returns ErrCacheCapacity if capacity is not strictly positive.
	Resize(capacity int) (int, error)

	// Put inserts or updates the value stored under key. If adding a new key
	// would exceed the capacity, an existing entry is evicted to make room.
	Put(key K, value T)

	// Get returns the value stored under key and true if present, or the zero
	// value and false otherwise. A successful lookup counts as a use of the
	// entry (relevant to usage-based eviction policies).
	Get(key K) (T, bool)

	// Delete removes key from the cache, returning true if it was present and
	// false if it was not.
	Delete(key K) bool

	// Len returns the current number of entries held in the cache.
	Len() int

	// Clear removes all entries from the cache.
	Clear()
}

type Entry[K comparable, T any] struct {
	Key   K
	Value T
}

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