composewell/streamly
1
1
Fork 0
mirror of https://github.com/composewell/streamly.git synced 2024-11-10 12:47:22 +03:00
Code Issues Packages Projects Releases Wiki Activity

Comment out foldlS benchmark

Browse Source 
It takes too much time, holding up benchmarking for too long.
This commit is contained in:
Harendra Kumar 2020-02-28 19:48:19 +05:30
parent 6c20dae0cb
commit 5e1736c4f1
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs
View File

@ -184,12 +184,12 @@ composeN n f =
{-# INLINE _dropWhileMTrue #-}
{-# INLINE dropWhileFalse #-}
{-# INLINE _foldrS #-}
{-# INLINE foldlS #-}
{-# INLINE _foldlS #-}
{-# INLINE concatMap #-}
{-# INLINE intersperse #-}
scan, map, fmapD, mapM, mapMaybe, mapMaybeM, filterEven, filterAllOut,
filterAllIn, _takeOne, takeAll, takeWhileTrue, _takeWhileMTrue, dropOne,
dropAll, dropWhileTrue, _dropWhileMTrue, dropWhileFalse, _foldrS, foldlS,
dropAll, dropWhileTrue, _dropWhileMTrue, dropWhileFalse, _foldrS, _foldlS,
concatMap, intersperse
:: Monad m
=> Int -> Stream m Int -> m ()
@ -215,7 +215,7 @@ dropWhileTrue n = composeN n $ S.dropWhile (<= maxValue)
_dropWhileMTrue n = composeN n $ S.dropWhileM (return . (<= maxValue))
dropWhileFalse n = composeN n $ S.dropWhile (> maxValue)
_foldrS n = composeN n $ S.foldrS S.cons S.nil
foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
_foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
concatMap n = composeN n $ (\s -> S.concatMap (\_ -> s) s)
intersperse n = composeN n $ S.intersperse maxValue
@ -535,7 +535,7 @@ o_n_space =
[
-- This is horribly slow, never finishes
benchFold "foldlS" (foldlS 1) sourceUnfoldrM
-- benchFold "foldlS" (_foldlS 1) sourceUnfoldrM
]
]
]