Expand description

AA-Tree implementation in Rust.

An AA-Tree is a self-balancing binary search tree based on a RedBlack-Tree with a simplified self-balancing logic that should benefit performance.

Features

  • openapi — Add OpenapiType implementations for AATreeSet and AATreeMap.

  • serde — Add (De)Serialize implementations for AATreeSet and AATreeMap.

Re-exports

pub use map::AATreeMap;
pub use set::AATreeSet;

Modules

Iterator implementations for AATreeSet and AATreeMap.
Low-level implementation of an AA tree. You shouldn’t have to use this directly; instead, use the implementations in AATreeSet and AATreeMap.