Appropriate way to do pre-computation
Open
Documentation
- Dominant language
- Haskell
- Stars
- 523
- Forks
- 89
- PR merge metrics
- No merged PRs in 30d
Description
Can the tutorial be amended to include an example of how to do pre-computation before gathering benchmark data? For example, suppose my benchmark is mapping a function across several lists of 100000 values each, but I don't want to charge the costs of creating these lists to the function I'm benchmarking; that is, I want to compute the lists first, and then benchmark the function being mapped across these existing lists.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.