06f01b3d7c
* Refactor caching system to use pluggable stores The commit modernizes the caching implementation by introducing a pluggable store interface that allows different cache backends. Key changes: - Add Store interface for custom cache implementations - Create default TTL-based store for backwards compatibility - Add example LRU store for memory-bounded caching - Support cache store configuration via options pattern - Make cache cleanup logic implementation-specific - Add comprehensive tests and documentation The main goals were to: 1. Prevent unbounded memory growth through pluggable stores 2. Enable distributed caching support 3. Maintain backwards compatibility 4. Improve testability and maintainability Signed-off-by: franchb <hello@franchb.com> * Add custom cache stores docs and navigation Signed-off-by: franchb <hello@franchb.com> * Use GetOrCompute for atomic cache access The commit introduces an atomic GetOrCompute method to the cache interface and refactors all cache implementations to use it. This prevents race conditions and duplicate computations when multiple goroutines request the same uncached key simultaneously. The changes eliminate a time-of-check to time-of-use race condition in the original caching implementation, where separate Get/Set operations could lead to duplicate renders under high concurrency. With GetOrCompute, the entire check-compute-store operation happens atomically while holding the lock, ensuring only one goroutine computes a value for any given key. The API change is backwards compatible as the framework handles the GetOrCompute logic internally. Existing applications will automatically benefit from the * rename to WithCacheStore --------- Signed-off-by: franchb <hello@franchb.com> Co-authored-by: maddalax <jm@madev.me>
28 lines
1,017 B
Go
28 lines
1,017 B
Go
package cache
|
|
|
|
import (
|
|
"time"
|
|
)
|
|
|
|
// Store defines the interface for a pluggable cache.
|
|
// This allows users to provide their own caching implementations, such as LRU, LFU,
|
|
// or even distributed caches. The cache implementation is responsible for handling
|
|
// its own eviction policies (TTL, size limits, etc.).
|
|
type Store[K comparable, V any] interface {
|
|
// Set adds or updates an entry in the cache. The implementation should handle the TTL.
|
|
Set(key K, value V, ttl time.Duration)
|
|
|
|
// GetOrCompute atomically gets an existing value or computes and stores a new value.
|
|
// This method prevents duplicate computation when multiple goroutines request the same key.
|
|
// The compute function is called only if the key is not found or has expired.
|
|
GetOrCompute(key K, compute func() V, ttl time.Duration) V
|
|
|
|
// Delete removes an entry from the cache.
|
|
Delete(key K)
|
|
|
|
// Purge removes all items from the cache.
|
|
Purge()
|
|
|
|
// Close releases any resources used by the cache, such as background goroutines.
|
|
Close()
|
|
}
|