Show how to migrate from regular dict to BPlusTree.

Show potential gotchas and migration tips.

Demonstrate pagination using range queries.

Show where you get performance benefits after migration.

Show performance advantages of range queries.

Show practical real-world use cases for range queries.

Show a realistic migration example.

Show migration from SortedDict to BPlusTree.

Show early termination advantages.

Execute interleaved operations for concurrent simulation

Extract all content from this leaf (used for merging)

Fast comparison function with type-specific optimizations */

Binary search for child index.

Format results for display.

Standard fragmentation attack pattern

Get the number of free leaf nodes in the arena.

Bulk load from sorted key-value pairs for 3-5x faster construction. Args: items: Iterable of (key, value) pairs that MUST be sort

Get value for a key with optional default. Args: key: The key to look up. default: Value to return if key not found (

Get the next pointer of a leaf node in the arena.

Get a page of products starting from start_id.

Unsafe fast mutable access without bounds checking or allocation verification # Safety Caller must ensure id is valid and allocated

Return the raw node ID.

Insert key-value pair. Returns True if successful.

Insert key and right child.

Insert separator and child, split if necessary. Returns None or (new_branch, promoted_key)

Insert a separator key and new child into this branch node. Returns None if no split needed, or Some((new_branch_data, promoted_key)) if split occurre

Insert into a leaf node by ID.

Recursively insert a key with proper arena access.

Insert data with custom key and value functions

Insert data with custom key multiplier for integer trees

Insert data with offset and multiplier (key = offset + i * multiplier)

Returns true if the tree is empty.

Returns true if the root is a leaf node.

Count all keys in this leaf and all following leaves

Returns the last key-value pair in the tree.

Recursively count leaf nodes with proper arena access.

Get the leaf arena utilization ratio.

Recursively count elements with proper arena access.

Lookup value for key. Returns -1 if not found.

Lookup value for key. Returns -1 if not found.

Run all migration demonstrations.

Run all range query demonstrations.

Run all performance demonstrations.

Run benchmarks with different sizes.

Merge branch with left sibling

Merge this branch with its right sibling using the separator key

Merge branch with right sibling

Create a new root node when the current root splits. New roots are the only BranchNodes allowed to remain underfull.

Clear a single slot: decref or destroy payload and null out key/value or child pointer */

Delete key from leaf node */

Get value from leaf node */

Insert into branch node */

Insert into leaf node */

Prefetch child pointer for cache optimization */

Helper function to parse duration strings like "10s", "5m", "1h"

Get git log data and parse into structured format.

Parse git log output into structured data.

Get git log data and parse into structured format.

Legacy compatibility - populate tree with sequential data

Print a node and its children recursively for debugging.

Print comprehensive summary statistics.

Print summary statistics.

Print a summary of key findings.

Generate a random value

Rebalance an underfull branch child using pre-gathered sibling information. Optimized to reduce repeated arena lookups by resolving sibling IDs and se

Rebalance an underfull leaf child using pre-gathered sibling information. Optimized to minimize repeated arena lookups by resolving sibling IDs once.