Module radarbase::binarytree

This module provides an implementation of a binary tree.

The binary tree is used to store key-value pairs in a way that allows efficient lookups and updates. It includes a builder for constructing a binary tree from a set of key-value pairs, and a method for looking up values based on their keys.

This implementation uses a Node enum to represent both internal and leaf nodes. Internal nodes contain a key and two child nodes, while leaf nodes can contain up to two key-value pairs. This design helps reduce the height of the tree.

Structs

• BinarytreeBuilder 🔒
• BinarytreeRangeIter
• EntryAccessor
• EntryMutator 🔒
• InternalAccessor 🔒
• InternalBuilder 🔒
• LeafAccessor 🔒
• LeafBuilder 🔒

Enums

• Node 🔒
• RangeIterState 🔒

Constants

• INTERNAL 🔒
• LEAF 🔒

Traits

• BinarytreeEntry

Functions

• bound_contains_key 🔒
• cmp_keys 🔒
• lookup_in_raw 🔒
  Returns a tuple of the form (Page<'a>, usize, usize) representing the value for a queried key within a binary tree if present.
• tree_delete 🔒
• tree_insert 🔒