haskell-perf / sets
Benchmarks for set data structures: hash sets, dawg's, bloom filters, etc.
☆23Updated 7 years ago
Related projects: ⓘ
- A benchmark comparing different ways of building a strict bytestring in Haskell☆24Updated last year
- Maps using values' monoidal structure during merging☆42Updated 3 months ago
- A monad for managed values☆50Updated last year
- Haskell time library focusing on performance☆54Updated last week
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated 9 months ago
- Parse bytes fast☆24Updated 4 months ago
- All of `base` without the `Prelude` module☆44Updated last year
- Structured logging solution.☆35Updated last year
- Generic data types in Haskell, utilities for GHC.Generics☆44Updated 5 months ago
- Use hpack's phrasing in dhall to write cabal files☆31Updated last week
- Literally the best anonymous records☆36Updated last year
- ☆40Updated 4 months ago
- Derive instances through isomorphisms☆20Updated 3 months ago
- The Str signature and implementations☆21Updated 7 years ago
- Automatically re-export Haskell modules.☆31Updated 2 months ago
- Template Haskell for generating ToJSON and FromJSON instances for GADTs☆22Updated 3 months ago
- A micro-benchmark that compares some Haskell serialization libraries☆43Updated 5 years ago
- Extensible type-safe unions for Haskell☆31Updated last week
- Standardized conversion between string types☆20Updated 2 years ago