improve benchmarks for Data.IntMap
Open
benchmarking
IntMap
- Dominant language
- Haskell
- Stars
- 355
- Forks
- 194
- Avg merge
- 3d 4h
- Merged PRs (30d)
- 4
Description
Benchmarks should
* use several sets of data (currently: just one, contiguous keys `[1 .. 2^12]`)
* test bulk operations (union, intersection) - currently, they don't? https://github.com/haskell/containers/blob/master/containers-tests/benchmarks/IntMap.hs
NB: these bulk ops are the main reason for IntMap? if we only operate by-element, we could use hashmaps?
Contributor guide
Assessment
This issue has not been assessed yet.