luct-core 0.1.0

Core types and parsers for certificate transparency
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

use crate::store::{
    AppendableStore, AsyncStoreRead, AsyncStoreWrite, OrderedStoreRead, SearchableStoreRead,
    StoreRead, StoreWrite,
};
use std::{
    collections::BTreeMap,
    sync::{Arc, RwLock},
};

/// A non-persistent implementation of [`Store`](crate::store::Store)
///
/// This can be useful for testing, or in settings, in which the data should not be stored,
/// for example when running as a command line tool in CI
#[derive(Debug, Clone)]
pub struct MemoryStore<K, V>(Arc<RwLock<BTreeMap<K, V>>>);

impl<K, V> Default for MemoryStore<K, V> {
    fn default() -> Self {
        Self(Arc::new(RwLock::new(BTreeMap::new())))
    }
}

impl<K: Ord, V: Clone> StoreRead<K, V> for MemoryStore<K, V> {
    fn get(&self, key: &K) -> Option<V> {
        self.0.read().unwrap().get(key).cloned()
    }

    fn len(&self) -> usize {
        self.0.read().unwrap().len()
    }
}

impl<K: Ord, V> StoreWrite<K, V> for MemoryStore<K, V> {
    fn insert(&self, key: K, value: V) {
        self.0.write().unwrap().insert(key, value);
    }

    fn delete(&self, key: &K) -> bool {
        self.0.write().unwrap().remove(key).is_some()
    }
}

impl<K: Ord + Clone, V: Clone> OrderedStoreRead<K, V> for MemoryStore<K, V> {
    fn last(&self) -> Option<(K, V)> {
        self.0
            .read()
            .unwrap()
            .iter()
            .next_back()
            .map(|(k, v)| (k.clone(), v.clone()))
    }
}

impl<V: Clone> AppendableStore<u64, V> for MemoryStore<u64, V> {
    fn append(&self, value: V) -> u64 {
        let mut store = self.0.write().unwrap();

        let len = store.len() as u64;
        let old = store.insert(len, value);

        assert!(
            old.is_none(),
            "IndexedStore already contained a value at {len}"
        );

        len
    }
}

impl<K: Ord, V: Clone> AsyncStoreRead<K, V> for MemoryStore<K, V> {
    async fn get(&self, key: K) -> Option<V> {
        self.0.read().unwrap().get(&key).cloned()
    }

    async fn len(&self) -> usize {
        self.0.read().unwrap().len()
    }
}

impl<K: Ord, V: Clone> AsyncStoreWrite<K, V> for MemoryStore<K, V> {
    async fn insert(&self, key: K, value: V) {
        self.0.write().unwrap().insert(key, value);
    }
}

impl<K: Ord + Clone, V: Clone> SearchableStoreRead<K, V> for MemoryStore<K, V> {
    fn filter(&self, mut pred: impl FnMut(&K, &V) -> bool) -> Vec<(K, V)> {
        self.0
            .read()
            .unwrap()
            .iter()
            .filter(|(key, val)| pred(key, val))
            .map(|(key, val)| (key.clone(), val.clone()))
            .collect()
    }
}