expire_cache 0.1.17

High-performance generational cache for Rust / 高性能分代缓存
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

use std::{borrow::Borrow, hash::Hash, sync::atomic::Ordering};

use crate::Map;

pub trait GetOrInit: Map {
  fn get_or_init<'a, Q, E>(
    &'a self,
    key: &Q,
    func: impl FnOnce(&Q) -> Result<Self::Val, E>,
  ) -> Result<Self::RefVal<'a>, E>
  where
    Self::Key: Borrow<Q>,
    Q: ToOwned<Owned = Self::Key> + Hash + Eq + ?Sized;
}

impl<T: GetOrInit + 'static> crate::Expire<T> {
  pub fn get_or_init<'a, Q, E>(
    &'a self,
    key: &Q,
    func: impl FnOnce(&Q) -> Result<T::Val, E>,
  ) -> Result<T::RefVal<'a>, E>
  where
    T::Key: Borrow<Q>,
    Q: ToOwned<Owned = T::Key> + Hash + Eq + ?Sized,
  {
    let inner = self.inner();
    let pos = inner.pos.load(Ordering::Relaxed);
    if let Some(v) = inner.cache[pos].get(key) {
      return Ok(v);
    }
    if let Some(v) = inner.cache[1 - pos].get(key) {
      return Ok(v);
    }
    inner.cache[pos].get_or_init(key, func)
  }
}