Data Structures

Purely Functional Data Structures

The Algorithm Design Manual

The Art of Computer Programming, Vol 1: Fundamental Algorithms

RoaringBitmap

A hybrid compressed bitmap that picks the optimal sub-representation (array, bitmap, or run-length) per 64K-integer chunk based on density. No single prior dominates: Roaring commits to none and adapts per chunk.

AlgoGraph: Immutable Graph Library with Functional Transformers

AlgoGraph is an immutable graph library for Python with pipe-based transformers, declarative selectors, and lazy views.

libdis: Disjoint Interval Sets as a Complete Boolean Algebra

A C++ header-only library that treats disjoint interval sets as proper mathematical objects with Boolean algebra operations.

Cryptographic perfect hash functions: A theoretical analysis on space efficiency, time complexity, and entropy

maph: Maps Based on Perfect Hashing for Sub-Microsecond Key-Value Storage

Succinct Bit Vectors and Rank/Select

A bit vector with O(1) rank and O(log n) select using only n + o(n) bits of space. The auxiliary index is asymptotically negligible while enabling constant-time queries.

The Dot Ecosystem: From Simple Paths to Data Algebras

A composable ecosystem of tools for manipulating nested data structures. From a simple helper function to a full data algebra, guided by purity, pedagogy, and the principle of least power.

AlgoTree: Immutable Trees with Functional Transformers

An immutable-by-default tree library for Python with composable transformations, pipe-based pipelines, and pattern-matching selectors.

Packed Containers: Zero-Waste Bit-Level Storage in C++

What if containers wasted zero bits? A C++ library for packing arbitrary value types at the bit level using pluggable codecs.