Write only if the key is absent. Resolves to whether it was written.
Remove everything from the store.
Atomically decrement a numeric value (created at 0 when absent).
Delete a key. Resolves to whether something was removed.
Read a value; undefined when absent or expired.
Whether a (non-expired) value exists.
Atomically increment a numeric value (created at 0 when absent).
Invalidate every key associated with any of the given tags.
ReadonlynameA human-readable store name (e.g. 'memory', 'redis').
Read and delete in one step.
Return the cached value, or compute it with factory, store it, and return it (cache-aside).
Concurrent calls for the same key share a single factory execution (stampede protection).
Write a value with optional TTL/tags.
The agnostic cache store contract.
A single backend (memory, Redis, a provider KV) implements it; application code depends only on this interface, so switching or mixing stores is configuration, not code. Values are structured (serialized by drivers that need it); TTLs are in seconds.