bable 0.1.0

Badger's high performance sst table implementation
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

use super::*;
use core::cell::UnsafeCell;
use lru::LruCache;

#[derive(Clone)]
#[repr(transparent)]
pub struct IndexCache {
    inner: RefCounter<UnsafeCell<LruCache<u64, RefCounter<TableIndex>>>>,
}

impl IndexCache {
    #[inline]
    pub fn new(size: usize) -> IndexCache {
        Self {
            inner: RefCounter::new(UnsafeCell::new(LruCache::new(size))),
        }
    }

    /// Safety: this method will only be used in single thread feature
    #[inline]
    pub fn get(&self, k: &u64) -> Option<&RefCounter<TableIndex>> {
        unsafe { &mut *self.inner.get() }.get(k)
    }

    /// Safety: this method will only be used in single thread feature
    #[inline]
    pub fn insert(&self, k: u64, value: RefCounter<TableIndex>) {
        unsafe { &mut *self.inner.get() }.push(k, value);
    }
}

#[derive(Clone)]
#[repr(transparent)]
pub struct BlockCache {
    inner: RefCounter<UnsafeCell<LruCache<Bytes, RefCounter<Block>>>>,
}

impl BlockCache {
    #[inline]
    pub fn new(size: usize) -> BlockCache {
        Self {
            inner: RefCounter::new(UnsafeCell::new(LruCache::new(size))),
        }
    }

    /// Safety: this method will only be used in single thread feature
    #[inline]
    pub fn get(&self, k: &[u8]) -> Option<&RefCounter<Block>> {
        unsafe { &mut *self.inner.get() }.get(k)
    }

    /// Safety: this method will only be used in single thread feature
    #[inline]
    pub fn insert(&self, k: Bytes, value: RefCounter<Block>) {
        unsafe { &mut *self.inner.get() }.push(k, value);
    }
}