concurrent_avl_tree 0.1.0

Lock-free readable AVL tree with epoch-based reclamation and background batch rebalancing.
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

//! # Concurrent AVL Tree
//!
//! Lock-free readable AVL tree with epoch-based reclamation and background batch rebalancing.
//!
//! ## Scope & Architecture
//! Provides concurrent read access without locks. Writes are batched, sorted, and applied
//! by a background thread that rebuilds the tree structure and atomically swaps the root pointer.
//! Memory reclamation uses epoch-based tracking to defer node disposal until all active readers quiesce.
//! Requires Rust 1.91+. `no_std` incompatible due to `std::sync` and allocator usage.
//!
//! ## Usage Context
//! Intended for high-read, moderate-write workloads where read latency must remain deterministic
//! and write contention is minimized via deferred batching. Not suitable for strict real-time
//! write guarantees due to background rebuild scheduling.
//!
//! ## License & Attribution
//! SPDX-License-Identifier: MIT | Author: Dzulkifli Anwar | Version: 0.1.0 | Date: 2026-04-30

#![doc(html_root_url = "https://docs.rs/concurrent_avl_tree/0.1.0")]
#![deny(missing_docs)]
#![warn(clippy::missing_safety_doc)]
#![warn(clippy::missing_errors_doc)]
#![warn(clippy::missing_panics_doc)]
#![allow(clippy::missing_docs_in_private_items)]

pub mod concurrency;
pub mod config;
pub mod error;
pub mod memory;
pub mod tree;