con-art-rust 0.2.0

A Rust implementation of ART-OLC concurrent adaptive radix tree.
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

use crate::base_node::BaseNode;

const TID_MASK: usize = 0x8000_0000_0000_0000;

// Tid: hightest bit set
// ChildNode: not set
#[derive(Clone, Copy)]
pub(crate) struct NodePtr {
    val: usize,
}

impl NodePtr {
    #[inline]
    pub(crate) fn from_null() -> Self {
        Self { val: 0 }
    }

    #[inline]
    pub(crate) fn from_node(ptr: *const BaseNode) -> Self {
        Self { val: ptr as usize }
    }

    #[inline]
    pub(crate) fn from_tid(tid: usize) -> Self {
        assert!(tid & TID_MASK == 0);
        Self {
            val: tid | TID_MASK,
        }
    }

    #[inline]
    pub(crate) fn is_tid(&self) -> bool {
        (self.val & TID_MASK) > 0
    }

    #[inline]
    pub(crate) fn is_leaf(&self) -> bool {
        self.is_tid()
    }

    #[inline]
    pub(crate) fn is_node(&self) -> bool {
        (self.val & TID_MASK) == 0
    }

    #[inline]
    pub(crate) fn as_tid(&self) -> usize {
        debug_assert!(self.is_tid());
        self.val & !TID_MASK
    }

    #[inline]
    pub(crate) fn as_ptr(&self) -> *const BaseNode {
        debug_assert!(self.is_node());
        self.val as *const BaseNode
    }

    #[inline]
    pub(crate) fn is_null(&self) -> bool {
        self.val == 0
    }
}