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

//! Example demonstrating the Clock cache policy.
//!
//! Clock approximates LRU by giving referenced entries a second chance during
//! eviction instead of moving them through a linked list on every hit.
//!
//! Run with: cargo run --example basic_clock

use cachekit::policy::clock::ClockCache;
use cachekit::traits::Cache;

fn main() {
    let mut cache: ClockCache<u32, &str> = ClockCache::new(3);

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

    // Give key 1 a second chance before the next eviction sweep.
    cache.get(&1);
    cache.insert(4, "delta");

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

// Expected output:
// contains 1? true
// contains 2? false
// len: 3
//
// Explanation: key 1 had its reference bit set before the cache filled, so the
// sweep clears that bit and skips it, then evicts key 2 as the first
// unreferenced entry.