`logos.mem.collections.btree`

Module mem · package logos-mem

Types

struct BTreeMap

Ordered map backed by a sorted parallel-array (not a real B-tree).

get/contains_key are O(log n) binary search; insert/remove are O(n) due to element shifting.

Fields

cap: i64

keys: *mut K

len: i64

vals: *mut V

struct BTreeMapIter

Iterator over a BTreeMap’s entries in ascending key order, yielding (&K, &V).

Implements: Iterator

Fields

idx: i64

keys: *const K

len: i64

vals: *const V

fn btreemap_free(m: *mut BTreeMap<K, V>) -> void

Deallocates the keys/vals backing storage of m.

fn btreemap_new() -> BTreeMap<K, V>

Creates a new, empty BTreeMap with initial capacity 8.