cachekit 0.8.0

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
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

//! Example demonstrating the Fast LRU cache.
//!
//! Fast LRU stores values directly instead of wrapping them in `Arc`, which keeps
//! the hot path lean for single-threaded workloads.
//!
//! Run with: cargo run --example basic_fast_lru

use cachekit::policy::fast_lru::FastLru;

fn main() {
    let mut cache: FastLru<u32, String> = FastLru::new(2);

    cache.insert(1, "alpha".to_string());
    cache.insert(2, "beta".to_string());

    // Touch key 1 without reading it so key 2 becomes the LRU entry.
    cache.touch(&1);

    if let Some((key, value)) = cache.peek_lru() {
        println!("lru before insert: {key} -> {value}");
    }

    cache.insert(3, "gamma".to_string());

    println!("contains 1? {}", cache.contains(&1));
    println!("contains 2? {}", cache.contains(&2));
}

// Expected output:
// lru before insert: 2 -> beta
// contains 1? true
// contains 2? false
//
// Explanation: touching key 1 moves it to the MRU position, so inserting key 3
// evicts key 2 as the least recently used entry.