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

//! # Concurrency Primitives
//!
//! Contains epoch-based reclamation and thread synchronization utilities.
//! Provides deferred memory disposal guarantees for lock-free data structures.
//!
//! ## License & Attribution
//! SPDX-License-Identifier: MIT | Author: Dzulkifli Anwar | Version: 0.1.0 | Date: 2026-04-30

pub mod epoch;