IndexFuncToKeyFuncAdapter adapts an indexFunc to a keyFunc.

NewFIFO returns a Store which can be used to queue up items to process.

NewIndexer returns an Indexer implemented simply with a map and a lock.

NewLRUCache creates a new empty cache with the given capacity.

NewStore returns a Store implemented simply with a map and a lock.

NewTTLStore creates and returns a ExpirationCache with a TTLPolicy.

Helper function for popping from Queue.

ErrRequeue may be returned by a PopProcessFunc to safely requeue the current item.

ExpirationCache implements the store interface 1.

FIFO receives adds and updates from a Reflector, and puts them in a queue for FIFO order processing.

Item is what is stored in the cache.

KeyError will be returned any time a KeyFunc gives an error; it includes the object at fault.

LRUCache is a typical LRU cache implementation.

TTLPolicy implements a ttl based ExpirationPolicy.

ExpirationPolicy dictates when an object expires.

Indexer is a storage interface that lets you list objects using multiple indexing functions.

Queue is exactly like a Store, but has a Pop() method too.

Store is a generic object storage interface.

ThreadSafeStore is an interface that allows concurrent access to a storage backend.

Value is the interface values that go into LRUCache need to satisfy.

Index maps the indexed value to a set of keys in the store that match on that value.

Indexers maps a name to a IndexFunc.

IndexFunc knows how to provide an indexed value for an object.

Indices maps a name to an Index.

KeyFunc knows how to make a key from an object.

PopProcessFunc is passed to Pop() method of Queue interface.