gereeter / bounded-intmap
A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.
☆20Updated last year
Alternatives and similar repositories for bounded-intmap
Users that are interested in bounded-intmap are comparing it to the libraries listed below
Sorting:
- Reasonable Haskell default import☆27Updated 2 years ago
- There are many category theory implementations, but this one is mine☆16Updated 8 months ago
- ST with efficient exceptions☆20Updated 8 years ago
- van Laarhoven Free Monad with Extensible Effects☆23Updated 9 years ago
- An effect system similar to mtl with explicit dictionary passing.☆17Updated 6 years ago
- ☆24Updated 7 years ago
- Type level lists, pairs, sums, their operations, and their properties.☆24Updated 6 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Override instances used by Haskell's generic derivation☆31Updated 2 years ago
- Exhaustive pattern matching using lenses, traversals, and prisms☆32Updated 2 years ago
- Efficient search weighted by an ordered monoid with monus.☆18Updated 2 years ago
- ☆24Updated 4 years ago
- An experimental intermediate language for GHC