text: paramtree alternatives and similar packages
  Based on the "Benchmarking" category.
  Alternatively, view paramtree alternatives based on common mentions on social networks and blogs.
  criterion9.8 5.4 paramtree VS criterionA powerful but simple library for measuring the performance of Haskell code.
  hyperion9.5 0.0 paramtree VS hyperionA lab for future Criterion features.
  gauge9.1 0.0 paramtree VS gaugeLean Haskell Benchmarking
  fibon6.2 0.0 paramtree VS fibonA benchmark suite for Haskell
  feed-gipeda4.6 0.0 paramtree VS feed-gipedaDaemon for watching for new commits to multiple git repositories and feeding benchmark runs into gipeda
  hashtable-benchmark2.1 0.0 paramtree VS hashtable-benchmarkBenchmark of hash table implementations in Haskell
  Do you think we are missing an alternative of paramtree or a related project?
  README
  ParamTree
  ParamTree library for generating labelled test/benchmark trees from sets of parameters. Example usecases include criterion benchmark trees or tasty test trees.
  Example
  import Test.Tasty import Test.Tasty.HUnit genTestCase :: Int -> Bool -> Char -> String -> TestTree genTestCase i b c name = testCase name $ {- your code here -} params = simpleParam "Int" [1,2] . simpleParam "Bool" [True] . simpleParam "Char" "xyz" main :: IO () main = defaultMain $ testTree genTestCase params where testTree = growTree (Just "/") testGroup "my tests"
  This generates a tasty TestTree with all combinations of values passed to
  genTestCase. If the
  Maybe String argument is provided like in the above
  example, groups with a single entry, such as "Bool" get collapsed into their
  parent groups. So instead of a "1 Int" group containing a "True Bool" group
  they get collapsed into a single "1 Int/True Bool" group, where the "/"
  separator is the one specified by
  Just "/".
  *Note that all licence references and agreements mentioned in the paramtree README section above are relevant to that project's source code only.