Arrange parser benchmarks in the export list order

Author: harendra-kumar

benchmark/Streamly/Benchmark/Data/Parser.hs

@@ -710,45 +710,109 @@ instance NFData ParseError where
 
 benchmarks :: Int -> BenchEnv -> [Array.Array Int] -> [(SpaceComplexity, Benchmark)]
 benchmarks value env arrays =
-    [ (SpaceO_1, benchIOSink value "takeBetween" $ takeBetween value)
-    , (SpaceO_1, benchIOSink value "takeWhile" $ takeWhile value)
-    , (SpaceO_1, benchIOSink value "takeWhileP" $ takeWhileP value)
-    , (SpaceO_1, benchIOSink value "takeP" $ takeP value)
-    , (SpaceO_1, benchIOSink value "dropWhile" $ dropWhile value)
-    , (SpaceO_1, benchIOSink value "takeBeginBy" $ takeBeginBy value)
-    , (SpaceO_1, benchIOSink value "takeEndBy_" $ takeEndBy_ value)
-    , (SpaceO_1, benchIOSink value "groupBy" $ groupBy)
-    , (SpaceO_1, benchIOSink value "groupByRolling" $ groupByRolling)
-    , (SpaceO_1, benchIOSink value "wordBy" $ wordBy value)
-    , (SpaceO_1, benchIOSink value "sepBy (words)" sepByWords)
-    , (SpaceO_1, benchIOSink value "sepByAll (words)" sepByAllWords)
-    , (SpaceO_1, benchIOSink value "sepBy1 (words)" sepByWords1)
-    , (SpaceO_1, benchIOSink value "deintercalate" $ deintercalate value)
-    , (SpaceO_1, benchIOSink value "deintercalate1" $ deintercalate1 value)
-    , (SpaceO_1, benchIOSink value "deintercalateAll" $ deintercalateAll value)
-    -- Applicative and Monad
+    [
+    -- Alternative
+      (SpaceO_1, benchIOSink value "alt2parseMany" $ altSmall value)
+    , (SpaceO_1, benchIOSink value "alt2" $ alt2 value)
+    , (SpaceO_1, benchIOSink value "alt4" $ alt4 value)
+    , (SpaceO_1, benchIOSink value "alt8" $ alt8 value)
+    , (SpaceO_1, benchIOSink value "alt16" $ alt16 value)
+
+    -- These accumulate the results in a list.
+    , (HeapO_n, benchIOSink value "manyAlt" manyAlt)
+    , (HeapO_n, benchIOSink value "someAlt" someAlt)
+    , (SpaceO_n, benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100))
+    -- , benchIOSink value "choice/100" $ choice (value `div` 100)
+
+    -- Applicative
     , (SpaceO_1, benchIOSink value "splitAp2" $ splitAp2 value)
     , (SpaceO_1, benchIOSink value "splitAp4" $ splitAp4 value)
     , (SpaceO_1, benchIOSink value "splitAp8" $ splitAp8 value)
     , (SpaceO_1, benchIOSink value "splitApBefore" $ splitApBefore value)
     , (SpaceO_1, benchIOSink value "splitApAfter" $ splitApAfter value)
     , (SpaceO_1, benchIOSink value "splitWith2" $ splitWith2 value)
-    , (SpaceO_1, benchIOSink value "span" $ span value)
-    , (SpaceO_1, benchIOSink value "spanBy" $ spanBy value)
-    , (SpaceO_1, benchIOSink value "spanByRolling" $ spanByRolling value)
+    -- non-linear time complexity (parserD)
+    , (HeapO_n, benchIOSink value "split_" $ split_ value)
+
+    -- Monad
     , (SpaceO_1, benchIOSink value "monad2" $ monad value)
     , (SpaceO_1, benchIOSink value "monad4" $ monad4 value)
     , (SpaceO_1, benchIOSink value "monad8" $ monad8 value)
-    -- Alternative
-    , (SpaceO_1, benchIOSink value "alt2parseMany" $ altSmall value)
-    , (SpaceO_1, benchIOSink value "alt2" $ alt2 value)
-    , (SpaceO_1, benchIOSink value "alt4" $ alt4 value)
-    , (SpaceO_1, benchIOSink value "alt8" $ alt8 value)
-    , (SpaceO_1, benchIOSink value "alt16" $ alt16 value)
+    -- XXX Takes lot of space when run on a long stream, why?
+    , (HeapO_n, benchIOSink value "monad16" $ monad16 value)
+
+    -- lookahead sequence length
+    -- lookahead benchmark holds the entire input till end
+    , (HeapO_n, benchIOSink value "lookAhead" $ lookAhead value)
+
+    -- take sequence by length
+    , (SpaceO_1, benchIOSink value "takeBetween" $ takeBetween value)
+    , (HeapO_n, benchIOSink value "takeEQ" $ takeEQ value)
+    , (HeapO_n, benchIOSink value "takeGE" $ takeGE value)
+    , (SpaceO_1, benchIOSink value "takeP" $ takeP value)
+
+    -- Match exact sequence
+    -- O_n because of the list accumulation
+    , (HeapO_n, benchIOSink value "listEqBy" (listEqBy value))
+    , (SpaceO_1, benchIOSink value "streamEqBy" (streamEqBy value))
+
+    -- sequence matching a predicate
+    , (SpaceO_1, benchIOSink value "takeWhile" $ takeWhile value)
+    , (SpaceO_1, benchIOSink value "takeWhileP" $ takeWhileP value)
+    , (SpaceO_1, benchIOSink value "dropWhile" $ dropWhile value)
+
+    -- sequence begin/end by known elements
+    , (SpaceO_1, benchIOSink value "takeEndBy_" $ takeEndBy_ value)
+    , (SpaceO_1, benchIOSink value "takeBeginBy" $ takeBeginBy value)
+    , (SpaceO_1, benchIOSink value "wordBy" $ wordBy value)
+
+    -- Group sequence by
+    , (SpaceO_1, benchIOSink value "groupBy" $ groupBy)
+    , (SpaceO_1, benchIOSink value "groupByRolling" $ groupByRolling)
+
+    -- Framing
+    -- o-n-heap because of backtracking
+    , (HeapO_n, benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
+        $ takeFramedByEsc_ value)
+
+    -- Spanning
+    , (SpaceO_1, benchIOSink value "span" $ span value)
+    , (SpaceO_1, benchIOSink value "spanBy" $ spanBy value)
+    , (SpaceO_1, benchIOSink value "spanByRolling" $ spanByRolling value)
+
+    {-
+    , benchIOSink value "tee" $ teeAllAny value
+    , benchIOSink value "teeFst" $ teeFstAllAny value
+    , benchIOSink value "shortest" $ shortestAllAny value
+    , benchIOSink value "longest" $ longestAllAny value
+    -}
+
+    -- Sequential Collection
+    -- Accumulate the results in a list.
+    , (SpaceO_n, benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100))
+    , (SpaceO_n, benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100))
+    , (SpaceO_n, benchIOSink value "sequence/100" $ sequence (value `div` 100))
+    , (SpaceO_n, benchIOSink value "sequence_/100" $ sequence_ (value `div` 100))
+    , (SpaceO_1, benchIOSink value "concatSequence" concatSequence)
+
+    -- Sequential Repetition
     , (SpaceO_1, benchIOSink value "many" many)
     , (SpaceO_1, benchIOSink value "many (wordBy even)" $ manyWordByEven)
     , (SpaceO_1, benchIOSink value "some" some)
+
+    -- Interleaved Repetition
+    , (SpaceO_1, benchIOSink value "deintercalate" $ deintercalate value)
+    , (SpaceO_1, benchIOSink value "deintercalate1" $ deintercalate1 value)
+    , (SpaceO_1, benchIOSink value "deintercalateAll" $ deintercalateAll value)
+
+    -- Accumulates the results in a list.
+    , (HeapO_n, benchIOSink value "sepBy1" sepBy1)
+    , (SpaceO_1, benchIOSink value "sepBy1 (words)" sepByWords1)
+    , (SpaceO_1, benchIOSink value "sepBy (words)" sepByWords)
+    , (SpaceO_1, benchIOSink value "sepByAll (words)" sepByAllWords)
     , (SpaceO_1, benchIOSink value "manyTill" $ manyTill value)
+
+    -- parseMany
     , (SpaceO_1, benchIOSink value "parseMany" $ parseMany value)
     , (SpaceO_1, benchIOSink value "parseMany (take 1)" (parseMany 1))
     , (SpaceO_1, benchIOSink value "parseMany (take all)" (parseMany value))
@@ -764,52 +828,24 @@ benchmarks value env arrays =
         $ nfIO $ parseManyGroupsRollingEitherRight)
     , (SpaceO_1, bench "parseMany groupRollingByEither (Alternating)"
         $ nfIO $ parseManyGroupsRollingEitherAlt1)
-    , (SpaceO_1, benchIOSink value "parseIterate (take 1)" (parseIterate 1))
-    , (SpaceO_1, benchIOSink value "parseIterate (take all)" (parseIterate value))
-    , (SpaceO_1, benchIOSink value "concatSequence" concatSequence)
-    {-
-    , benchIOSink value "tee" $ teeAllAny value
-    , benchIOSink value "teeFst" $ teeFstAllAny value
-    , benchIOSink value "shortest" $ shortestAllAny value
-    , benchIOSink value "longest" $ longestAllAny value
-    -}
-    , (SpaceO_1, benchIOSink value "streamEqBy" (streamEqBy value))
+
+    -- parseMany with file IO
     , (SpaceO_1, mkBench ("parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
           $ \inh _ -> noinline parseManyChunksOfSum (bigSize env) inh)
     , (SpaceO_1, mkBench "parseMany (Fold.take 1 Fold.sum)" env
           $ \inh _ -> inline parseManyChunksOfSum 1 inh)
+
+    -- parseMany Unfolds
     , (SpaceO_1, bench "parseMany/Unfold/1000 arrays/take all"
         $ nfIO $ parseManyUnfoldArrays value arrays)
     , (SpaceO_1, bench "parseMany/Unfold/1000 arrays/take 1"
         $ nfIO $ parseManyUnfoldArrays 1 arrays)
-    , (HeapO_n, benchIOSink value "takeEQ" $ takeEQ value)
-    , (HeapO_n, benchIOSink value "takeGE" $ takeGE value)
-
-    -- lookahead benchmark holds the entire input till end
-    , (HeapO_n, benchIOSink value "lookAhead" $ lookAhead value)
-
-    -- o-n-heap because of backtracking
-    , (HeapO_n, benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
-        $ takeFramedByEsc_ value)
-
-    -- non-linear time complexity (parserD)
-    , (HeapO_n, benchIOSink value "split_" $ split_ value)
-    -- XXX Takes lot of space when run on a long stream, why?
-    , (HeapO_n, benchIOSink value "monad16" $ monad16 value)
 
-    -- These show non-linear time complexity.
-    -- They accumulate the results in a list.
-    , (HeapO_n, benchIOSink value "sepBy1" sepBy1)
-    , (HeapO_n, benchIOSink value "manyAlt" manyAlt)
-    , (HeapO_n, benchIOSink value "someAlt" someAlt)
-    , (HeapO_n, benchIOSink value "listEqBy" (listEqBy value))
-    , (SpaceO_n, benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100))
-    , (SpaceO_n, benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100))
-    , (SpaceO_n, benchIOSink value "sequence/100" $ sequence (value `div` 100))
-    , (SpaceO_n, benchIOSink value "sequence_/100" $ sequence_ (value `div` 100))
-    , (SpaceO_n, benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100))
-    -- , benchIOSink value "choice/100" $ choice (value `div` 100)
+    -- parseIterate
+    , (SpaceO_1, benchIOSink value "parseIterate (take 1)" (parseIterate 1))
+    , (SpaceO_1, benchIOSink value "parseIterate (take all)" (parseIterate value))
     ]
+
     where
 
     {-# NOINLINE parseManyGroupsRollingEitherLeft #-}