Download raw

Created: 2023-12-19 03:40:10.302489 UTC

Size: 5760

Preview (limited to 512 bytes)

"\n{-\n Binary search over benchmark input sizes.\n\n There are many good ways to measure the time it takes to perform a\n certain computation on a certain input. However, frequently, it's\n challenging to pick the right input size for all platforms and all\n compilataion modes.\n\n Sometimes for linear-complexity benchmarks it is better to measure\n /throughput/, i.e. elements processed per second. That is, fixing\n the time of execution and measuring the amount of work done (rather\n than the reverse). This library"

Casa is a service provided by the Haskell Foundation │ Originally developed by FP Complete