mace-kv 0.0.28

A fast, cross-platform embedded key-value storage engine with ACID, MVCC, and flash-optimized storage
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

use std::ops::{Deref, DerefMut};

use crate::{
    types::traits::{IHeader, ILoader},
    utils::{Handle, OpCode},
};

use super::node::Node;

pub(crate) struct Page<L: ILoader> {
    inner: Handle<Node<L>>,
}

impl<L: ILoader> Copy for Page<L> {}
impl<L: ILoader> Clone for Page<L> {
    fn clone(&self) -> Self {
        *self
    }
}

impl<L> Page<L>
where
    L: ILoader,
{
    pub(crate) fn new(node: Node<L>) -> Self {
        let inner = Handle::new(node);
        Self { inner }
    }

    pub(crate) fn from_swip(swip: u64) -> Self {
        Self {
            inner: Handle::from(swip as *mut Node<L>),
        }
    }

    pub(crate) fn load(l: L, addr: u64) -> Result<Self, OpCode> {
        let node = Node::<L>::load(addr, l)?;
        Ok(Self {
            inner: Handle::new(node),
        })
    }

    pub(crate) fn swip(&self) -> u64 {
        self.inner.inner() as u64
    }

    pub(crate) fn ref_node(&self) -> Node<L> {
        self.inner.reference()
    }

    pub(crate) fn is_intl(&self) -> bool {
        self.header().is_index
    }

    pub(crate) fn reclaim(&self) {
        self.inner.reclaim();
    }
}

impl<L: ILoader> Deref for Page<L> {
    type Target = Node<L>;

    fn deref(&self) -> &Self::Target {
        &self.inner
    }
}

impl<L: ILoader> DerefMut for Page<L> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.inner
    }
}