Инвалидация и истечение записей кэша

Caching is easy until data changes. Invalidation means removing stale entries so users never see outdated content.

The simplest tool is a timeout. After the set seconds pass, the entry expires on its own and the next call refills it.

Your TTL trades freshness for speed. A short one means more recomputes; a long one risks serving older data longer.

When data changes now, do not wait for expiry. Call cache.delete with the key to evict that single entry at once.

The blunt option is cache.clear, which wipes every entry. Use it sparingly, since it forces a full cold rebuild.

For memoized helpers, reach for delete_memoized to drop a cached function result the moment its source data updates.

A clean pattern: right after you save a change, delete the matching cache key so the next read rebuilds it fresh.

You can override expiry per entry with set and a timeout, ignoring the global default for that one value.

Passing timeout=0 stores a value that never expires on its own. You then become responsible for deleting it.

A neat trick is putting a version in the key. Bump the version and every old entry is ignored without deleting anything.

Treat showing outdated content as a real defect. Every write path should have a matching invalidation step planned.

You can expire by timeout, delete single keys, clear all, evict memoized results, and invalidate on write. Cache wisely! 🧠