improve benchmarks for Data.IntMap
未关闭
benchmarking
IntMap
- 主要语言
- Haskell
- 星标
- 355
- 派生
- 194
- 平均合并
- 3 天 4 小时
- 30 天内合并 PR
- 4
描述
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?
贡献指南
评估
这个 Issue 还没有评估数据。