Add benchmark for map

haskell · Jan 15, 2021 · 189d4ad · 189d4ad
1 parent 12c52b8
commit 189d4ad
Showing 1 changed file with 13 additions and 2 deletions.
diff --git a/bench/BenchAll.hs b/bench/BenchAll.hs
@@ -232,6 +232,13 @@ zeroes = L.replicate 10000 0
 zeroOneRepeating :: L.ByteString
 zeroOneRepeating = L.take 10000 (L.cycle (L.pack [0,1]))
 
+
+largeTraversalInput :: S.ByteString
+largeTraversalInput = S.concat (replicate 10 byteStringData)
+
+smallTraversalInput :: S.ByteString
+smallTraversalInput = S8.pack "The quick brown fox"
+
 main :: IO ()
 main = do
   mapM_ putStrLn sanityCheckInfo
@@ -425,11 +432,15 @@ main = do
       , bench "groupBy (>)"    $ nf (L.groupBy (>)) zeroes
       ]
     , bgroup "findIndex1"
-      [ bench "findIndices"    $ nf (sum . S.findIndices (==  1729)) byteStringData
-      , bench "find"           $ nf (S.find (>= 9998)) byteStringData
+      [ bench "findIndices"    $ nf (sum . S.findIndices (==  129)) byteStringData
+      , bench "find"           $ nf (S.find (>= 198)) byteStringData
       ]
     , bgroup "findIndex1End"
       [ bench "findIndexEnd"   $ nf (S.findIndexEnd (<= 57)) byteStringData
       , bench "elemIndexInd"   $ nf (S.elemIndexEnd 42) byteStringData
       ]
+    , bgroup "traversals"
+      [ bench "map (+1)"   $ nf (S.map (+ 1)) largeTraversalInput
+      , bench "map (+1)"   $ nf (S.map (+ 1)) smallTraversalInput
+      ]
     ]