bplus_store 0.2.0

Copy-on-write B+ tree with page-aligned storage, split/merge, and crash-safety primitives.
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
73
74
75
76
77

use crate::bplustree::node_view::NodeView;
use crate::codec::{NodeCodec, bincode::DefaultNodeCodec};

use std::fmt::Debug;

pub type NodeId = u64;

/// In-memory representation of a B+ tree node.
#[derive(Debug, Clone)]
pub enum Node<K, V> {
    /// An internal routing node with sorted keys and child pointers.
    Internal { keys: Vec<K>, children: Vec<NodeId> },
    /// A leaf node holding key-value pairs.
    Leaf { keys: Vec<K>, values: Vec<V> },
}

impl<K, V> Node<K, V>
where
    K: Ord + Clone,
    V: Clone,
{
    /// Returns `true` if the node contains no keys or children.
    pub fn is_empty(&self) -> bool {
        match self {
            Node::Internal { keys, children } => keys.is_empty() && children.is_empty(),
            Node::Leaf { keys, values } => keys.is_empty() && values.is_empty(),
        }
    }

    /// Returns `true` if the node has fewer than `min_keys` keys.
    pub fn is_underflowed(&self, min_keys: usize) -> bool {
        match self {
            Node::Internal { keys, .. } => keys.len() < min_keys,
            Node::Leaf { keys, .. } => keys.len() < min_keys,
        }
    }

    /// Returns a slice of the node's keys.
    pub fn get_keys(&self) -> &[K] {
        match self {
            Node::Internal { keys, .. } => keys,
            Node::Leaf { keys, .. } => keys,
        }
    }

    /// Returns `true` if this is a leaf node.
    pub fn is_leaf(&self) -> bool {
        matches!(self, Node::Leaf { .. })
    }

    /// Returns `true` if this is an internal node.
    pub fn is_internal(&self) -> bool {
        matches!(self, Node::Internal { .. })
    }

    /// Decodes a [`NodeView`] into a typed `Node<K, V>` using the given codecs.
    pub fn from_node_view<KC, VC>(node_view: NodeView) -> Result<Self, crate::codec::CodecError>
    where
        KC: crate::codec::KeyCodec<K>,
        VC: crate::codec::ValueCodec<V>,
    {
        match node_view {
            NodeView::Internal { page, .. } => {
                let page_raw = page
                    .to_bytes()
                    .map_err(|e| crate::codec::CodecError::EncodeFailure { msg: e.to_string() })?;
                <DefaultNodeCodec<KC, VC> as NodeCodec<K, V>>::decode(page_raw)
            }
            NodeView::Leaf { page, .. } => {
                let page_raw = page
                    .to_bytes()
                    .map_err(|e| crate::codec::CodecError::EncodeFailure { msg: e.to_string() })?;
                <DefaultNodeCodec<KC, VC> as NodeCodec<K, V>>::decode(page_raw)
            }
        }
    }
}