cachekit 0.7.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137

//! LFU-specific benchmarks for operations unique to LFU policy.
//!
//! Run with: `cargo bench --bench policy_lfu`

use std::sync::Arc;

use cachekit::ds::FrequencyBucketsHandle;
use cachekit::policy::lfu::LfuCache;
use cachekit::traits::Cache;
use criterion::{BatchSize, Criterion, Throughput, criterion_group, criterion_main};

// ============================================================================
// LFU-specific operations
// ============================================================================

/// Benchmark pop_lfu - removing the least frequently used item.
fn bench_pop_lfu(c: &mut Criterion) {
    let mut group = c.benchmark_group("lfu_specific");
    group.throughput(Throughput::Elements(1024));

    group.bench_function("pop_lfu", |b| {
        b.iter_batched(
            || {
                let mut cache = LfuCache::new(1024);
                for i in 0..1024u64 {
                    cache.insert(i, Arc::new(i));
                }
                cache
            },
            |mut cache| {
                for _ in 0..1024u64 {
                    let _ = std::hint::black_box(cache.pop_lfu());
                }
            },
            BatchSize::SmallInput,
        )
    });

    group.finish();
}

/// Benchmark increment_frequency - manually bumping frequency counters.
fn bench_frequency_updates(c: &mut Criterion) {
    let mut group = c.benchmark_group("lfu_specific");
    group.throughput(Throughput::Elements(4096));

    group.bench_function("increment_frequency", |b| {
        b.iter_batched(
            || {
                let mut cache = LfuCache::new(4096);
                for i in 0..4096u64 {
                    cache.insert(i, Arc::new(i));
                }
                cache
            },
            |mut cache| {
                for i in 0..4096u64 {
                    let _ =
                        std::hint::black_box(cache.increment_frequency(&std::hint::black_box(i)));
                }
            },
            BatchSize::SmallInput,
        )
    });

    group.finish();
}

/// Benchmark raw frequency bucket operations (policy-only, no storage overhead).
fn bench_bucket_touch(c: &mut Criterion) {
    let mut group = c.benchmark_group("lfu_specific");
    group.throughput(Throughput::Elements(16_384));

    group.bench_function("bucket_touch_raw", |b| {
        b.iter_custom(|iters| {
            let capacity = 16_384u64;
            let mut buckets = FrequencyBucketsHandle::new();
            for i in 0..capacity {
                buckets.insert(i);
            }
            let start = std::time::Instant::now();
            for (idx, _) in (0..iters).enumerate() {
                let handle = (idx as u64) % capacity;
                let _ = std::hint::black_box(buckets.touch(&handle));
            }
            start.elapsed()
        })
    });

    group.finish();
}

/// Benchmark eviction churn at different cache sizes.
fn bench_eviction_scaling(c: &mut Criterion) {
    let mut group = c.benchmark_group("lfu_eviction_scaling");

    for &capacity in &[256usize, 1024, 4096, 16384] {
        let inserts = capacity * 4;
        group.throughput(Throughput::Elements(inserts as u64));
        group.bench_with_input(
            criterion::BenchmarkId::from_parameter(capacity),
            &capacity,
            |b, &capacity| {
                b.iter_batched(
                    || {
                        let mut cache = LfuCache::new(capacity);
                        for i in 0..capacity as u64 {
                            cache.insert(i, Arc::new(i));
                        }
                        let values: Vec<_> = (0..inserts as u64).map(Arc::new).collect();
                        (cache, values)
                    },
                    |(mut cache, values)| {
                        for i in 0..inserts as u64 {
                            cache.insert(
                                std::hint::black_box(10_000 + i),
                                values[i as usize].clone(),
                            );
                        }
                    },
                    BatchSize::SmallInput,
                )
            },
        );
    }

    group.finish();
}

criterion_group!(
    benches,
    bench_pop_lfu,
    bench_frequency_updates,
    bench_bucket_touch,
    bench_eviction_scaling
);
criterion_main!(benches);