arcache 0.0.2

Thread safe cache implementations with a shared trait to make caches interchangeable.
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

use arcache::{Cache, LRUCache};
use std::time::Instant;

// Fibonacci with LRU caching
fn lru_fib(n: u64, cache: &LRUCache<u64, u64>) -> u64 {
    if n == 0 {
        return 0;
    }
    if n == 1 {
        return 1;
    }
    match cache.get(&n) {
        Some(v) => *v,
        None => {
            let result = lru_fib(n - 1, cache) + lru_fib(n - 2, cache);
            cache.set(n, result);
            result
        }
    }
}

// Fibonacci without caching (naive recursion)
fn naive_fib(n: u64) -> u64 {
    if n == 0 {
        return 0;
    }
    if n == 1 {
        return 1;
    }
    naive_fib(n - 1) + naive_fib(n - 2)
}

fn main() {
    let n = 45;

    // Measure naive Fibonacci time
    let start = Instant::now();
    let result_naive = naive_fib(n);
    let duration_naive = start.elapsed();
    println!(
        "Naive Fibonacci({}) = {} (Time: {:?})",
        n, result_naive, duration_naive
    );

    // Measure LRU cached Fibonacci time
    let cache = LRUCache::new(100);
    let start = Instant::now();
    let result_cached = lru_fib(n, &cache);
    let duration_cached = start.elapsed();
    println!(
        "Cached Fibonacci({}) = {} (Time: {:?})",
        n, result_cached, duration_cached
    );

    assert_eq!(result_naive, result_cached);
    println!("Results are equal!");

    let speedup = (duration_naive.as_secs_f64() / duration_cached.as_secs_f64()).round();
    println!("Speedup: {:.2}x", speedup);

    // Display cache stats
    println!("Cache Stats: {:?}", cache.stats());
}