StrictBench: Benchmarking code through strict evaluation

A benchmarking library with a simple purpose: to strictly evaluate a value and report how long it takes.

Can be useful to identify the slow part of an algorithm, since Haskell's lazy evaluation can make it hard to see where the bottleneck lies.

[Skip to Readme]

Modules

[Index]

Test
- Test.StrictBench

Downloads

StrictBench-0.1.1.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

RemcoNiemeijer

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	0.1, 0.1.1
Dependencies	base (>=2.0 && <5.0), benchpress (>=0.2), parallel (>=1.0) [details]
License	LicenseRef-GPL
Author	Remco Niemeijer
Maintainer	Remco Niemeijer <R.A.Niemeijer@tue.nl>
Category	Testing
Home page	http://bonsaicode.wordpress.com/2009/06/07/strictbench-0-1/
Uploaded	by RemcoNiemeijer at 2009-06-08T16:13:28Z
Distributions
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	1980 total (6 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet]

Readme for StrictBench-0.1.1

[back to package description]

------------------------ StrictBench ------------------------

A library to benchmark how long it takes to fully evaluate
a value. Can be useful to identify the slow part of an
algorithm, since Haskell's lazy evaluation can make it hard
to see where the bottleneck lies.

Author: Remco Niemeijer

Version history:

0.1.1 - Re-exported NFData and rnf for convenience:
        This removes the need to import
        Control.Parallel.Strategies when having to make a
        custom data type an instance of NFData.
0.1   - Original release.