Expand description
§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
Modules§
- concurrency
- Concurrency Primitives
- config
- Compile-time Configuration Constants
- error
- Error Handling Strategy
- memory
- Memory Management
- tree
- Tree Structure & Operations