holt 0.1.0

An adaptive-radix-tree metadata storage engine for path-shaped keys, with per-blob concurrency and crash-safe persistence.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

//! ART walker — descent / insert / erase / scan / rename / compact.
//!
//! Stage 2a–2c: single-blob lookup + insert + erase land.
//! Stage 2d: multi-blob descent (BlobNode crossing + splitBlob).
//! Stage 6 phase 2a (current): read paths take [`BlobFrameRef`]
//! and run zero-copy against `BufferManager::pin`-ed buffers.
//!
//! [`simd`] hosts SIMD hot paths the walker calls into (Node16
//! byte search, longest-common-prefix).
//!
//! [`BlobFrameRef`]: crate::store::BlobFrameRef

pub mod compact;
pub mod iter;
pub mod simd;
pub mod walker;

pub use walker::{
    collect_blob_guids, compact_blob, erase, erase_multi, insert, insert_multi, is_mergeable,
    lookup, lookup_at, lookup_multi, make_blob_from_node, merge_blob, refresh_blob_node_pointers,
    try_merge_children, BlobNodeCrossing, CompactStats, EraseOutcome, InsertOutcome, LookupResult,
    MakeBlobOutcome, MergeStats, RangeBuilder, RangeEntry, RangeIter,
};