async-graphql-dataloader 0.1.0

A high-performance DataLoader implementation for async-graphql with batching and caching
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

// src/cache.rs
use std::{
    hash::Hash,
    time::{Duration, Instant},
};

pub struct Cache<K, V> {
    store: dashmap::DashMap<K, (V, Instant)>,
    ttl: Option<Duration>,
}

impl<K, V> Cache<K, V>
where
    K: Eq + Hash + Clone,
    V: Clone,
{
    pub fn new() -> Self {
        Self {
            store: dashmap::DashMap::new(),
            ttl: None,
        }
    }

    pub fn with_ttl(mut self, ttl: Duration) -> Self {
        self.ttl = Some(ttl);
        self
    }

    pub fn get(&self, key: &K) -> Option<V> {
        let entry = self.store.get(key)?;

        if let Some(ttl) = self.ttl {
            if entry.1.elapsed() > ttl {
                self.store.remove(key);
                return None;
            }
        }

        Some(entry.0.clone())
    }

    pub fn set(&self, key: K, value: V) {
        self.store.insert(key, (value, Instant::now()));
    }

    pub fn clear(&self) {
        self.store.clear();
    }
}