memory-cache-rust 0.1.0-alpha

memory-cache is a fast, concurrent cache library built with a focus on performance and correctness. The motivation to build Ristretto comes from the need for a contention-free cache in
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

use std::ops::Add;
use std::sync::Arc;

use std::thread;
use std::time::{Duration, Instant};




use rayon;
use rayon::prelude::*;
use memory_cache_rust::cache::{Cache};


const ITER: u64 = 32 * 1024;

#[test]
fn test_cache_key_to_hash() {
    let _key_to_hash_count = 0;
    let cache = Cache::new();

    let guard = cache.guard();
    cache.set(1, 2, 1, &guard);
    cache.set(2, 2, 1, &guard);
    println!("{:?}", cache.get(&1, &guard));
    println!("{:?}", cache.get(&2, &guard));
}

#[test]
fn test_cache_key_to_hash_thread() {
    let _key_to_hash_count = 0;


    let cache = Arc::new(Cache::new());

    let handles: Vec<_> = (0..3).map(|_| {
        let map1 = cache.clone();
        thread::spawn(move || {
            let guard = map1.guard();
            for i in 0..ITER {
                map1.set(i, i + 7, 1, &guard);
            }
        })
    }).collect();


    for h in handles {
        h.join().unwrap();
    }


    let c4 = Arc::clone(&cache);
    let guard = c4.guard();
    for i in 0..ITER {
        if  let Some(v) = c4.get(&i, &guard) {
            assert_eq!(v,(&(i +7)));
        }else {
            //item evicted from cache
        }
    }

}


#[test]
fn test_cache_with_ttl2() {
    let _key_to_hash_count = 0;
    let cache = Cache::new();

    (0..ITER).into_par_iter().for_each(|i| {
        let guard = cache.guard();
        cache.set(i, i + 7, 1, &guard);
    });
}

#[test]
fn test_cache_with_ttl() {
    let _key_to_hash_count = 0;
    let cache = Cache::new();

    let timer = timer::Timer::new();


    let guard = cache.guard();

    let key = 1;
    let value = 1;
    let _cost = 1;
    let _ttl = Duration::from_millis(0);

    loop {
        if !cache.set_with_ttl(1, 1, 1, Duration::from_millis(0), &guard) {
            thread::sleep(Duration::from_millis(10));
            continue;
        }
        thread::sleep(Duration::from_millis(50));
        match cache.get(&key, &guard) {
            None => {
                assert!(false)
            }
            Some(v) => {
                assert_eq!(v, &value)
            }
        }
        break;
    }


    let cache = Arc::new(Cache::new());
    let c1 = Arc::clone(&cache);


    let _t1 = thread::spawn(move || {
        let guard = c1.guard();
        for i in 0..ITER {
            c1.set_with_ttl(i, i, 1, Duration::from_millis(1000), &guard);
        }
    });

    let g = {
        let c2 = Arc::clone(&cache);
        timer.schedule_repeating(chrono::Duration::milliseconds(2000), move || {
            let guard = c2.guard();
            c2.clean_up(&guard)
        })
    };

    thread::sleep(std::time::Duration::from_secs(5));
    drop(g);
    for i in 0..ITER {
        assert_eq!(cache.get(&i, &guard), None)
    }
}

#[test]
fn test_cache_with_ttl_without_timmer() {
    let cache = Arc::new(Cache::new());
    let c1 = Arc::clone(&cache);


    let t1 = thread::spawn(move || {
        let guard = c1.guard();
        for i in 0..ITER {
            let now = Instant::now().add(Duration::from_secs(200));
            c1.set_with_ttl(i, i+7, 0, now.elapsed(), &guard);
        }
    });
    t1.join().unwrap();
    thread::sleep(Duration::from_millis(2000));
    let guard = cache.guard();
    for i in 0..ITER {
        assert_eq!(cache.get(&i, &guard), Some(&(i+7)));
        // println!("{:?}",cache.get(&i, &guard));
    }
}