gereeter/cola
A pure Haskell implementation of a persistent Cache Oblivious Lookup Array
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework .
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
A pure Haskell implementation of a persistent Cache Oblivious Lookup Array
A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.
A simple implementation of monadic regions, allowing safe access to resources with prompt, automatic finalization.
A composale way to run finalizers in the face of errors