git.iko.soy/streamly
on master help sign in
hide benchmarks for hidden combinators
196b4deHarendra Kumar
benchmark/Linear.hs+4−4
compare with master
unifiedsplit
@@ -219,10 +219,10 @@ main =
219 , benchIOSink "mconcat" (FL.foldl' FL.mconcat . (S.map (Last . Just)))
219 , benchIOSink "mconcat" (FL.foldl' FL.mconcat . (S.map (Last . Just)))
220 , benchIOSink "foldMap" (FL.foldl' (FL.foldMap (Last . Just)))
220 , benchIOSink "foldMap" (FL.foldl' (FL.foldMap (Last . Just)))
221
221
222− -- , benchIOSink "toList" (FL.foldl' FL.toList)
222+ , benchIOSink "toList" (FL.foldl' FL.toList)
223− , benchIOSink "toListRev" (FL.foldl' FL.toListRev)
223+ -- , benchIOSink "toListRev" (FL.foldl' FL.toListRev)
224 -- , benchIOSink "toStream" (FL.foldl' FL.toStream)
224 -- , benchIOSink "toStream" (FL.foldl' FL.toStream)
225− , benchIOSink "toStreamRev" (FL.foldl' FL.toStreamRev)
225+ -- , benchIOSink "toStreamRev" (FL.foldl' FL.toStreamRev)
226 , benchIOSink "toArrayN" (FL.foldl' (A.toArrayN Ops.value))
226 , benchIOSink "toArrayN" (FL.foldl' (A.toArrayN Ops.value))
227
227
228 , benchIOSink "index" (FL.foldl' (FL.index Ops.maxValue))
228 , benchIOSink "index" (FL.foldl' (FL.index Ops.maxValue))
@@ -276,7 +276,7 @@ main =
276 , benchIOSink "findIndices" (Ops.findIndices 1)
276 , benchIOSink "findIndices" (Ops.findIndices 1)
277 , benchIOSink "elemIndices" (Ops.elemIndices 1)
277 , benchIOSink "elemIndices" (Ops.elemIndices 1)
278 , benchIOSink "reverse" (Ops.reverse 1)
278 , benchIOSink "reverse" (Ops.reverse 1)
279− , benchIOSink "reverse'" (Ops.reverse' 1)
279+ -- , benchIOSink "reverse'" (Ops.reverse' 1)
280 , benchIOSink "foldrS" (Ops.foldrS 1)
280 , benchIOSink "foldrS" (Ops.foldrS 1)
281 , benchIOSink "foldrSMap" (Ops.foldrSMap 1)
281 , benchIOSink "foldrSMap" (Ops.foldrSMap 1)
282 , benchIOSink "foldrT" (Ops.foldrT 1)
282 , benchIOSink "foldrT" (Ops.foldrT 1)
benchmark/LinearOps.hs+3−3
@@ -352,7 +352,7 @@ composeN' n f =
352{-# INLINE insertBy #-}
352{-# INLINE insertBy #-}
353{-# INLINE deleteBy #-}
353{-# INLINE deleteBy #-}
354{-# INLINE reverse #-}
354{-# INLINE reverse #-}
355−{-# INLINE reverse' #-}
355+-- {-# INLINE reverse' #-}
356{-# INLINE foldrS #-}
356{-# INLINE foldrS #-}
357{-# INLINE foldrSMap #-}
357{-# INLINE foldrSMap #-}
358{-# INLINE foldrT #-}
358{-# INLINE foldrT #-}
@@ -360,7 +360,7 @@ composeN' n f =
360scan, scanl1', map, fmap, mapMaybe, filterEven, filterAllOut,
360scan, scanl1', map, fmap, mapMaybe, filterEven, filterAllOut,
361 filterAllIn, takeOne, takeAll, takeWhileTrue, takeWhileMTrue, dropOne,
361 filterAllIn, takeOne, takeAll, takeWhileTrue, takeWhileMTrue, dropOne,
362 dropAll, dropWhileTrue, dropWhileMTrue, dropWhileFalse,
362 dropAll, dropWhileTrue, dropWhileMTrue, dropWhileFalse,
363− findIndices, elemIndices, insertBy, deleteBy, reverse, reverse',
363+ findIndices, elemIndices, insertBy, deleteBy, reverse, -- reverse',
364 foldrS, foldrSMap, foldrT, foldrTMap
364 foldrS, foldrSMap, foldrT, foldrTMap
365 :: MonadIO m
365 :: MonadIO m
366 => Int -> Stream m Int -> m ()
366 => Int -> Stream m Int -> m ()
@@ -437,7 +437,7 @@ intersperse n = composeN n $ S.intersperse maxValue
437insertBy n = composeN n $ S.insertBy compare maxValue
437insertBy n = composeN n $ S.insertBy compare maxValue
438deleteBy n = composeN n $ S.deleteBy (>=) maxValue
438deleteBy n = composeN n $ S.deleteBy (>=) maxValue
439reverse n = composeN n $ S.reverse
439reverse n = composeN n $ S.reverse
440−reverse' n = composeN n $ S.reverse'
440+-- reverse' n = composeN n $ S.reverse'
441foldrS n = composeN n $ S.foldrS S.cons S.nil
441foldrS n = composeN n $ S.foldrS S.cons S.nil
442foldrSMap n = composeN n $ S.foldrS (\x xs -> x + 1 `S.cons` xs) S.nil
442foldrSMap n = composeN n $ S.foldrS (\x xs -> x + 1 `S.cons` xs) S.nil
443foldrT n = composeN n $ S.foldrT S.cons S.nil
443foldrT n = composeN n $ S.foldrT S.cons S.nil