Documentation ¶
Index ¶
Constants ¶
View Source
const TestSizedIntSize = 8
Variables ¶
View Source
var CacherTests = []struct { Size int Func func(t *testing.T, c Cacher[ids.ID, TestSizedInt]) }{ {Size: 1, Func: TestBasic}, {Size: 2, Func: TestEviction}, }
CacherTests is a list of all Cacher tests
Functions ¶
func TestEviction ¶ added in v1.1.4
Types ¶
type Cacher ¶
type Cacher[K comparable, V any] interface { // Put inserts an element into the cache. If space is required, elements will // be evicted. Put(key K, value V) // Get returns the entry in the cache with the key specified, if no value // exists, false is returned. Get(key K) (V, bool) // Evict removes the specified entry from the cache Evict(key K) // Flush removes all entries from the cache Flush() // Returns fraction of cache currently filled (0 --> 1) PortionFilled() float64 }
Cacher acts as a best effort key value store.
func NewSizedLRU ¶ added in v1.10.2
func NewSizedLRU[K comparable, V SizedElement](maxSize int) Cacher[K, V]
type Deduplicator ¶
type Deduplicator[K comparable, V Evictable[K]] interface { // Deduplicate returns either the provided value, or a previously provided // value with the same ID that hasn't yet been evicted Deduplicate(V) V // Flush removes all entries from the cache Flush() }
Deduplicator acts as a best effort deduplication service
type Empty ¶ added in v1.10.4
func (*Empty[_, _]) PortionFilled ¶ added in v1.10.4
type Evictable ¶
type Evictable[K comparable] interface { Key() K Evict() }
Evictable allows the object to be notified when it is evicted
type EvictableLRU ¶
type EvictableLRU[K comparable, _ Evictable[K]] struct { Size int // contains filtered or unexported fields }
EvictableLRU is an LRU cache that notifies the objects when they are evicted.
func (*EvictableLRU[_, V]) Deduplicate ¶
func (c *EvictableLRU[_, V]) Deduplicate(value V) V
func (*EvictableLRU[_, _]) Flush ¶
func (c *EvictableLRU[_, _]) Flush()
type LRU ¶
type LRU[K comparable, V any] struct { // If set to < 0, will be set internally to 1. Size int // contains filtered or unexported fields }
LRU is a key value store with bounded size. If the size is attempted to be exceeded, then an element is removed from the cache before the insertion is done, based on evicting the least recently used value.
func (*LRU[_, _]) PortionFilled ¶ added in v1.10.2
type SizedElement ¶ added in v1.10.2
type SizedElement interface {
Size() int
}
type TestSizedInt ¶ added in v1.10.2
type TestSizedInt struct {
// contains filtered or unexported fields
}
func (TestSizedInt) Size ¶ added in v1.10.2
func (TestSizedInt) Size() int
Source Files ¶
Click to show internal directories.
Click to hide internal directories.