A self-contained, efficient bitset implementation over raw memory. Provides operations like set, clear, and iteration over set bits. Reusable in any Swift project needing compact boolean storage.

Implements a trailng array pattern where a fixed-size header and variable-length element array are allocated in a single contiguous block. This is reusable for any strided data structure needing zero overhead for the element count storage.

An open-addressing hash table with bitmap occupancy tracking and Robin Hood hashing for improved cache performance. Isolated from higher-level collections, it can be extracted as a standalone hash table.

A min-max heap implementation providing both min and max retrieval in O(1) and deletions in O(log n). Self-contained and reusable as a double-ended priority queue in any Swift project.

An efficient integer set using a bitmap representation. Provides full SetAlgebra conformance with O(1) membership testing and linear-time set operations on the dense representation. Reusable for any domain needing an integer set with small or dense elements.

A generic rope data structure (balanced binary tree) supporting efficient concatenation, splitting, and indexing of sequences. Uses a configurable metric. Self-contained and reusable for building large mutable sequences like text editors.