bneb

July 28, 2026, 6:56pm 1

PROJECT NAME: Zimple

persistent data structures for Zig

I’ve been exploring/making persistent data structures for Zig (Vector, HAMT, HashSet).

The project uses arenas to avoid manual lifetime tracking. The whole tree is allocated into an arena and dropped when done.

There are also lazy iterators (map, filter, fold) using anytype callables to avoid virtual dispatch overhead.

Benchmarking and a writeup vs standard Zig and OCaml are included for comparing the memory density and allocation speed to measure the trade-offs.

Here is the repo: GitHub - bneb/zimple: Functional programming in Zig. No runtime. No GC. Just comptime and arenas. · GitHub

Supported Zig versions

what versions are supported? 0.16