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

use std::collections::BTreeMap;
use std::sync::Arc;

use utils::persistence::Volatile;
use storage::{StorageError, Result, Storage};

/// Stores anything in a `BTreeMap`
pub struct RamStorage<T> {
    data: BTreeMap<u64, Arc<T>>,
}

impl<T> Volatile for RamStorage<T> {
    fn new() -> Self {
        RamStorage { data: BTreeMap::new() }
    }
}

impl<T: Sync + Send> Storage<T> for RamStorage<T> {
    fn get(&self, id: u64) -> Result<Arc<T>> {
        self.data.get(&id).cloned().ok_or(StorageError::KeyNotFound)
    }

    fn store(&mut self, id: u64, data: T) -> Result<()> {
        self.data.insert(id, Arc::new(data));
        Ok(())
    }
}


#[cfg(test)]
mod tests {
    use super::*;

    use utils::persistence::Volatile;
    use storage::Storage;

    #[test]
    pub fn basic() {
        let posting1 = vec![(0, vec![0, 1, 2, 3, 4]), (1, vec![5])];
        let posting2 = vec![(0, vec![0, 1, 4]), (1, vec![5]), (5, vec![0, 24, 56])];
        let mut prov = RamStorage::new();
        assert!(prov.store(0, posting1.clone()).is_ok());
        assert_eq!(prov.get(0).unwrap().as_ref(), &posting1);
        assert!(prov.store(1, posting2.clone()).is_ok());
        assert_eq!(prov.get(1).unwrap().as_ref(), &posting2);
        assert!(prov.get(0).unwrap().as_ref() != &posting2);
    }

    #[test]
    pub fn not_found() {
        let prov: RamStorage<usize> = RamStorage::new();
        assert!(prov.get(0).is_err());
    }

}