cachekit 0.2.0-alpha

High-performance cache primitives with pluggable eviction policies (LRU, LFU, FIFO, 2Q, Clock-PRO, S3-FIFO) and optional metrics.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

# LIFO / FILO (Last-In, First-Out)

## Goal
Evict the most recently inserted entry first.

## Implementation
Same as FIFO but use a stack-like structure:
- `HashMap<K, V>`
- `Vec<K>` (or `VecDeque`) insertion stack

On eviction:
- pop from the back until you find a live key (if using lazy stale handling).

## Notes
LIFO is niche; only implement when you have evidence newest inserts are least likely to be reused.

## References
- Wikipedia: https://en.wikipedia.org/wiki/Cache_replacement_policies