Black-White Array: fast, ordered data structure based on arrays with O(log N) memory allocations
Summary
BWArr is a fast, ordered data structure implemented in Go that uses arrays with O(log N) memory allocations. The repo documents its algorithm, tradeoffs, benchmarks against Google BTree, and provides usage examples, installation steps, and reference implementations.