@@ -8,6 +8,7 @@
8{-# LANGUAGE CPP #-}
8{-# LANGUAGE CPP #-}
9{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE FlexibleContexts #-}
10{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11+{-# OPTIONS_GHC -Wno-orphans #-}
12#ifdef __HADDOCK_VERSION__
13#ifdef __HADDOCK_VERSION__
13#undef INSPECTION
14#undef INSPECTION
@@ -20,20 +21,23 @@
21module Main (main) where
22module Main (main) where
24+#if !MIN_VERSION_base(4,18,0)
25+import Control.Applicative (liftA2)
23import Control.Monad (when)
27import Control.Monad (when)
24import Data.Maybe (isJust)
28import Data.Maybe (isJust)
25import System.Random (randomRIO)
29import System.Random (randomRIO)
26import Prelude hiding
30import Prelude hiding
27− (tail, mapM_, foldl, last, map, mapM, concatMap, zip, init)
31+ ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
29import qualified Prelude as P
35import qualified Prelude as P
30import qualified Data.List as List
36import qualified Data.List as List
32−import qualified Streamly.Internal.Data.Stream.StreamK as S
38+import qualified Streamly.Internal.Data.StreamK as S
33−import qualified Streamly.Internal.Data.Stream.Prelude as SP
34−import qualified Streamly.Internal.Data.SVar as S
36−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
40+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
38import Streamly.Benchmark.Common
42import Streamly.Benchmark.Common
@@ -41,106 +45,163 @@ import Streamly.Benchmark.Common
41import Test.Inspection
45import Test.Inspection
44−value, value2, value3, value16, maxValue :: Int
48+{-
46−value2 = round (P.fromIntegral value**(1/2::P.Double)) -- double nested loop
50+Benchmarks that need to be added
47−value3 = round (P.fromIntegral value**(1/3::P.Double)) -- triple nested loop
51+
48−value16 = round (P.fromIntegral value**(1/16::P.Double)) -- triple nested loop
52+-- fromList
51−-------------------------------------------------------------------------------
55+-- concatPairsWith
52−-- Benchmark ops
56+-- apWith
53−-------------------------------------------------------------------------------
57+-- apSerial
54−
58+-- apSerialDiscardFst
55−{-# INLINE toNull #-}
59+-- apSerialDiscardSnd
56−{-# INLINE uncons #-}
60+
57−{-# INLINE nullTail #-}
61+-- the
58−{-# INLINE headTail #-}
62+-- serial
59−{-# INLINE zip #-}
63+-- consMStream
60−toNull, uncons, nullTail, headTail, zip
64+-- withLocal
62− => Stream m Int -> m ()
66+
64−{-# INLINE toList #-}
68+-- notElem
65−toList :: Monad m => Stream m Int -> m [Int]
69+-- all
66−{-# INLINE foldl #-}
70+-- any
67−foldl :: Monad m => Stream m Int -> m Int
71+-- minimum
68−{-# INLINE last #-}
72+-- minimumBy
69−last :: Monad m => Stream m Int -> m (Maybe Int)
73+-- maximum
109+-- toStreamK (Probably can be skipped)
71-------------------------------------------------------------------------------
116-------------------------------------------------------------------------------
72-- Stream generation and elimination
117-- Stream generation and elimination
73-------------------------------------------------------------------------------
118-------------------------------------------------------------------------------
75−type Stream m a = S.Stream m a
120+type Stream m a = S.StreamK m a
77−{-# INLINE sourceUnfoldr #-}
122+{-# INLINE unfoldr #-}
78−sourceUnfoldr :: Int -> Stream m Int
123+unfoldr :: Int -> Int -> Stream m Int
79−sourceUnfoldr n = S.unfoldr step n
124+unfoldr streamLen n = S.unfoldr step n
81 step cnt =
126 step cnt =
82− if cnt > n + value
127+ if cnt > n + streamLen
83 then Nothing
128 then Nothing
84 else Just (cnt, cnt + 1)
129 else Just (cnt, cnt + 1)
86−{-# INLINE sourceUnfoldrN #-}
131+{-# INLINE unfoldrM #-}
87−sourceUnfoldrN :: Int -> Int -> Stream m Int
132+unfoldrM :: Monad m => Int -> Int -> Stream m Int
88−sourceUnfoldrN m n = S.unfoldr step n
133+unfoldrM streamLen n = S.unfoldrMWith S.consM step n
90 step cnt =
135 step cnt =
91− if cnt > n + m
136+ if cnt > n + streamLen
93− else Just (cnt, cnt + 1)
95−{-# INLINE sourceUnfoldrM #-}
96−sourceUnfoldrM :: S.MonadAsync m => Int -> Stream m Int
97−sourceUnfoldrM n = S.unfoldrM step n
102− else return (Just (cnt, cnt + 1))
104−{-# INLINE sourceUnfoldrMN #-}
105−sourceUnfoldrMN :: S.MonadAsync m => Int -> Int -> Stream m Int
106−sourceUnfoldrMN m n = S.unfoldrM step n
110 then return Nothing
137 then return Nothing
111 else return (Just (cnt, cnt + 1))
138 else return (Just (cnt, cnt + 1))
113−{-# INLINE sourceFromFoldable #-}
140+{-# INLINE repeat #-}
141+repeat :: Int -> Int -> Stream m Int
142+repeat streamLen = S.take streamLen . S.repeat
144+{-# INLINE repeatM #-}
145+repeatM :: Monad m => Int -> Int -> Stream m Int
146+repeatM streamLen = S.take streamLen . S.repeatM . return
148+{-# INLINE replicate #-}
149+replicate :: Int -> Int -> Stream m Int
150+replicate = S.replicate
152+{-# INLINE replicateM #-}
153+replicateM :: Monad m => Int -> Int -> Stream m Int
154+replicateM streamLen = S.replicateMWith S.consM streamLen . return
156+{-# INLINE iterate #-}
157+iterate :: Int -> Int -> Stream m Int
158+iterate streamLen = S.take streamLen . S.iterate (+1)
160+{-# INLINE iterateM #-}
161+iterateM :: Monad m => Int -> Int -> Stream m Int
162+iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
164+{-# INLINE fromFoldable #-}
114−sourceFromFoldable :: Int -> Stream m Int
165+fromFoldable :: Int -> Int -> Stream m Int
115−sourceFromFoldable n = S.fromFoldable [n..n+value]
166+fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
117−{-# INLINE sourceFromFoldableM #-}
168+{-# INLINE fromFoldableM #-}
118−sourceFromFoldableM :: S.MonadAsync m => Int -> Stream m Int
169+fromFoldableM :: Monad m => Int -> Int -> Stream m Int
119−sourceFromFoldableM n =
170+fromFoldableM streamLen n =
120− Prelude.foldr S.consM S.nil (Prelude.fmap return [n..n+value])
171+ List.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
122−{-# INLINE sourceFoldMapWith #-}
173+{-# INLINABLE concatMapFoldableWith #-}
123−sourceFoldMapWith :: Int -> Stream m Int
174+concatMapFoldableWith :: P.Foldable f
175+ => (Stream m b -> Stream m b -> Stream m b)
176+ -> (a -> Stream m b)
179+concatMapFoldableWith f g = P.foldr (f . g) S.nil
181+{-# INLINE concatMapFoldableSerial #-}
182+concatMapFoldableSerial :: Int -> Int -> Stream m Int
183+concatMapFoldableSerial streamLen n =
124−sourceFoldMapWith n = SP.concatMapFoldableWith S.serial S.yield [n..n+value]
184+ concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
126−{-# INLINE sourceFoldMapWithM #-}
186+{-# INLINE concatMapFoldableSerialM #-}
127−sourceFoldMapWithM :: Monad m => Int -> Stream m Int
187+concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
188+concatMapFoldableSerialM streamLen n =
128−sourceFoldMapWithM n = SP.concatMapFoldableWith S.serial (S.yieldM . return) [n..n+value]
189+ concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
130-------------------------------------------------------------------------------
191-------------------------------------------------------------------------------
131-- Elimination
192-- Elimination
132-------------------------------------------------------------------------------
193-------------------------------------------------------------------------------
134−{-# INLINE runStream #-}
195+{-# INLINE drain #-}
135−runStream :: Monad m => Stream m a -> m ()
196+drain :: Monad m => Stream m a -> m ()
136−runStream = S.drain
197+drain = S.drain
137−-- runStream = S.mapM_ (\_ -> return ())
139{-# INLINE mapM_ #-}
199{-# INLINE mapM_ #-}
140mapM_ :: Monad m => Stream m a -> m ()
200mapM_ :: Monad m => Stream m a -> m ()
141mapM_ = S.mapM_ (\_ -> return ())
201mapM_ = S.mapM_ (\_ -> return ())
143−toNull = runStream
203+{-# INLINE uncons #-}
204+uncons :: Monad m => Stream m Int -> m ()
144uncons s = do
205uncons s = do
145 r <- S.uncons s
206 r <- S.uncons s
146 case r of
207 case r of
@@ -148,167 +209,238 @@ uncons s = do
148 Just (_, t) -> uncons t
209 Just (_, t) -> uncons t
150{-# INLINE init #-}
211{-# INLINE init #-}
151−init :: (Monad m, S.IsStream t) => t m a -> m ()
212+init :: Monad m => Stream m a -> m ()
152init s = do
213init s = do
153 t <- S.init s
214 t <- S.init s
154 P.mapM_ S.drain t
215 P.mapM_ S.drain t
156{-# INLINE tail #-}
217{-# INLINE tail #-}
157−tail :: (Monad m, S.IsStream t) => t m a -> m ()
218+tail :: Monad m => Stream m a -> m ()
158tail s = S.tail s >>= P.mapM_ tail
219tail s = S.tail s >>= P.mapM_ tail
221+{-# INLINE nullTail #-}
222+nullTail :: Monad m => Stream m Int -> m ()
160nullTail s = do
223nullTail s = do
161 r <- S.null s
224 r <- S.null s
162 when (not r) $ S.tail s >>= P.mapM_ nullTail
225 when (not r) $ S.tail s >>= P.mapM_ nullTail
227+{-# INLINE headTail #-}
228+headTail :: Monad m => Stream m Int -> m ()
164headTail s = do
229headTail s = do
165 h <- S.head s
230 h <- S.head s
166 when (isJust h) $ S.tail s >>= P.mapM_ headTail
231 when (isJust h) $ S.tail s >>= P.mapM_ headTail
233+{-# INLINE toList #-}
234+toList :: Monad m => Stream m Int -> m [Int]
168toList = S.toList
235toList = S.toList
237+{-# INLINE foldl' #-}
238+foldl' :: Monad m => Stream m Int -> m Int
169−foldl = S.foldl' (+) 0
239+foldl' = S.foldl' (+) 0
242+last :: Monad m => Stream m Int -> m (Maybe Int)
170−last = S.last
243+last = S.last
172-------------------------------------------------------------------------------
245-------------------------------------------------------------------------------
173-- Transformation
246-- Transformation
174-------------------------------------------------------------------------------
247-------------------------------------------------------------------------------
176−{-# INLINE transform #-}
177−transform :: Monad m => Stream m a -> m ()
178−transform = runStream
180{-# INLINE composeN #-}
249{-# INLINE composeN #-}
182 :: Monad m
251 :: Monad m
183 => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
252 => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
184composeN n f =
253composeN n f =
185 case n of
254 case n of
186− 1 -> transform . f
255+ 1 -> drain . f
187− 2 -> transform . f . f
256+ 2 -> drain . f . f
188− 3 -> transform . f . f . f
257+ 3 -> drain . f . f . f
189− 4 -> transform . f . f . f . f
258+ 4 -> drain . f . f . f . f
190 _ -> undefined
259 _ -> undefined
192−{-# INLINE scan #-}
261+{-# INLINE scanl' #-}
262+scanl' :: Monad m => Int -> Stream m Int -> m ()
263+scanl' n = composeN n $ S.scanl' (+) 0
193{-# INLINE map #-}
265{-# INLINE map #-}
266+map :: Monad m => Int -> Stream m Int -> m ()
267+map n = composeN n $ S.map (+ 1)
194{-# INLINE fmapK #-}
269{-# INLINE fmapK #-}
270+fmapK :: Monad m => Int -> Stream m Int -> m ()
271+fmapK n = composeN n $ P.fmap (+ 1)
274+mapM :: Monad m => Int -> Stream m Int -> m ()
275+mapM n = composeN n $ S.mapMWith S.consM return
277+{-# INLINE mapMSerial #-}
278+mapMSerial :: Monad m => Int -> Stream m Int -> m ()
279+mapMSerial n = composeN n $ S.mapMSerial return
195{-# INLINE filterEven #-}
281{-# INLINE filterEven #-}
282+filterEven :: Monad m => Int -> Stream m Int -> m ()
283+filterEven n = composeN n $ S.filter even
196{-# INLINE filterAllOut #-}
285{-# INLINE filterAllOut #-}
286+filterAllOut :: Monad m => Int -> Int -> Stream m Int -> m ()
287+filterAllOut streamLen n = composeN n $ S.filter (> streamLen)
197{-# INLINE filterAllIn #-}
289{-# INLINE filterAllIn #-}
290+filterAllIn :: Monad m => Int -> Int -> Stream m Int -> m ()
291+filterAllIn streamLen n = composeN n $ S.filter (<= streamLen)
198{-# INLINE _takeOne #-}
293{-# INLINE _takeOne #-}
294+_takeOne :: Monad m => Int -> Stream m Int -> m ()
295+_takeOne n = composeN n $ S.take 1
199{-# INLINE takeAll #-}
297{-# INLINE takeAll #-}
298+takeAll :: Monad m => Int -> Int -> Stream m Int -> m ()
299+takeAll streamLen n = composeN n $ S.take streamLen
200{-# INLINE takeWhileTrue #-}
301{-# INLINE takeWhileTrue #-}
302+takeWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
303+takeWhileTrue streamLen n = composeN n $ S.takeWhile (<= streamLen)
201{-# INLINE dropOne #-}
305{-# INLINE dropOne #-}
306+dropOne :: Monad m => Int -> Stream m Int -> m ()
307+dropOne n = composeN n $ S.drop 1
202{-# INLINE dropAll #-}
309{-# INLINE dropAll #-}
310+dropAll :: Monad m => Int -> Int -> Stream m Int -> m ()
311+dropAll streamLen n = composeN n $ S.drop streamLen
203{-# INLINE dropWhileTrue #-}
313{-# INLINE dropWhileTrue #-}
314+dropWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
315+dropWhileTrue streamLen n = composeN n $ S.dropWhile (<= streamLen)
204{-# INLINE dropWhileFalse #-}
317{-# INLINE dropWhileFalse #-}
318+dropWhileFalse :: Monad m => Int -> Stream m Int -> m ()
319+dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
205{-# INLINE foldrS #-}
321{-# INLINE foldrS #-}
322+foldrS :: Monad m => Int -> Stream m Int -> m ()
323+foldrS n = composeN n $ S.foldrS S.cons S.nil
206{-# INLINE foldlS #-}
325{-# INLINE foldlS #-}
207−scan, map, fmapK, filterEven, filterAllOut,
208− filterAllIn, _takeOne, takeAll, takeWhileTrue, dropAll, dropOne,
209− dropWhileTrue, dropWhileFalse, foldrS, foldlS
211− => Int -> Stream m Int -> m ()
326+foldlS :: Monad m => Int -> Stream m Int -> m ()
327+foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
214−{-# INLINE mapMSerial #-}
215{-# INLINE intersperse #-}
329{-# INLINE intersperse #-}
216−mapM, mapMSerial, intersperse
217− :: S.MonadAsync m => Int -> Stream m Int -> m ()
330+intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
218−
331+intersperse streamLen n = composeN n $ S.intersperse streamLen
219−scan n = composeN n $ S.scanl' (+) 0
220−map n = composeN n $ P.fmap (+1)
221−fmapK n = composeN n $ P.fmap (+1)
222−mapM n = composeN n $ S.mapM return
223−mapMSerial n = composeN n $ S.mapMSerial return
224−filterEven n = composeN n $ S.filter even
225−filterAllOut n = composeN n $ S.filter (> maxValue)
226−filterAllIn n = composeN n $ S.filter (<= maxValue)
227−_takeOne n = composeN n $ S.take 1
228−takeAll n = composeN n $ S.take maxValue
229−takeWhileTrue n = composeN n $ S.takeWhile (<= maxValue)
230−dropOne n = composeN n $ S.drop 1
231−dropAll n = composeN n $ S.drop maxValue
232−dropWhileTrue n = composeN n $ S.dropWhile (<= maxValue)
233−dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
234−foldrS n = composeN n $ S.foldrS S.cons S.nil
235−foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
236−intersperse n = composeN n $ S.intersperse maxValue
238-------------------------------------------------------------------------------
333-------------------------------------------------------------------------------
239-- Iteration
334-- Iteration
240-------------------------------------------------------------------------------
335-------------------------------------------------------------------------------
242−iterStreamLen, maxIters :: Int
246{-# INLINE iterateSource #-}
337{-# INLINE iterateSource #-}
247iterateSource
338iterateSource
249− => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
339+ :: Monad m => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
250−iterateSource g i n = f i (sourceUnfoldrMN iterStreamLen n)
340+iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
252 f (0 :: Int) m = g m
342 f (0 :: Int) m = g m
253 f x m = g (f (x P.- 1) m)
343 f x m = g (f (x P.- 1) m)
255−{-# INLINE iterateMapM #-}
345+-- this is quadratic
256{-# INLINE iterateScan #-}
346{-# INLINE iterateScan #-}
347+iterateScan :: Monad m => Int -> Int -> Int -> Stream m Int
348+iterateScan iterStreamLen maxIters =
349+ iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
352+{-# INLINE iterateDropWhileFalse #-}
353+iterateDropWhileFalse :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
354+iterateDropWhileFalse streamLen iterStreamLen maxIters =
355+ iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
357+{-# INLINE iterateMapM #-}
358+iterateMapM :: Monad m => Int -> Int -> Int -> Stream m Int
359+iterateMapM iterStreamLen =
360+ iterateSource iterStreamLen (S.mapMWith S.consM return)
257{-# INLINE iterateFilterEven #-}
362{-# INLINE iterateFilterEven #-}
363+iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
364+iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
258{-# INLINE iterateTakeAll #-}
366{-# INLINE iterateTakeAll #-}
259−{-# INLINE iterateDropOne #-}
260−{-# INLINE iterateDropWhileFalse #-}
261−{-# INLINE iterateDropWhileTrue #-}
262−iterateMapM, iterateScan, iterateFilterEven, iterateTakeAll, iterateDropOne,
263− iterateDropWhileFalse, iterateDropWhileTrue
265− => Int -> Stream m Int
367+iterateTakeAll :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
368+iterateTakeAll streamLen iterStreamLen =
369+ iterateSource iterStreamLen (S.take streamLen)
267−-- this is quadratic
371+{-# INLINE iterateDropOne #-}
268−iterateScan = iterateSource (S.scanl' (+) 0) (maxIters `div` 10)
372+iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
269−iterateDropWhileFalse = iterateSource (S.dropWhile (> maxValue))
373+iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
272−iterateMapM = iterateSource (S.mapM return) maxIters
375+{-# INLINE iterateDropWhileTrue #-}
273−iterateFilterEven = iterateSource (S.filter even) maxIters
376+iterateDropWhileTrue ::
274−iterateTakeAll = iterateSource (S.take maxValue) maxIters
377+ Monad m => Int -> Int -> Int -> Int -> Stream m Int
275−iterateDropOne = iterateSource (S.drop 1) maxIters
378+iterateDropWhileTrue streamLen iterStreamLen =
276−iterateDropWhileTrue = iterateSource (S.dropWhile (<= maxValue)) maxIters
379+ iterateSource iterStreamLen (S.dropWhile (<= streamLen))
278-------------------------------------------------------------------------------
381-------------------------------------------------------------------------------
279-- Zipping
382-- Zipping
280-------------------------------------------------------------------------------
383-------------------------------------------------------------------------------
385+{-# INLINE zipWith #-}
386+zipWith :: Monad m => Stream m Int -> m ()
282−zip src = transform $ S.zipWith (,) src src
387+zipWith src = drain $ S.zipWith (,) src src
389+{-# INLINE zipWithM #-}
390+zipWithM :: Monad m => Stream m Int -> m ()
391+zipWithM src = drain $ S.zipWithM (curry return) src src
393+{-# INLINE sortByK #-}
394+sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
395+sortByK f = S.mergeMapWith (S.mergeBy f) S.fromPure
397+{-# INLINE sortBy #-}
398+sortBy :: Monad m => Stream m Int -> m ()
399+sortBy = drain . sortByK compare
284-------------------------------------------------------------------------------
401-------------------------------------------------------------------------------
285-- Mixed Composition
402-- Mixed Composition
286-------------------------------------------------------------------------------
403-------------------------------------------------------------------------------
288{-# INLINE scanMap #-}
405{-# INLINE scanMap #-}
406+scanMap :: Monad m => Int -> Stream m Int -> m ()
407+scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
289{-# INLINE dropMap #-}
409{-# INLINE dropMap #-}
410+dropMap :: Monad m => Int -> Stream m Int -> m ()
411+dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
290{-# INLINE dropScan #-}
413{-# INLINE dropScan #-}
414+dropScan :: Monad m => Int -> Stream m Int -> m ()
415+dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
291{-# INLINE takeDrop #-}
417{-# INLINE takeDrop #-}
418+takeDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
419+takeDrop streamLen n = composeN n $ S.drop 1 . S.take streamLen
292{-# INLINE takeScan #-}
421{-# INLINE takeScan #-}
422+takeScan :: Monad m => Int -> Int -> Stream m Int -> m ()
423+takeScan streamLen n = composeN n $ S.scanl' (+) 0 . S.take streamLen
293{-# INLINE takeMap #-}
425{-# INLINE takeMap #-}
426+takeMap :: Monad m => Int -> Int -> Stream m Int -> m ()
427+takeMap streamLen n = composeN n $ S.map (subtract 1) . S.take streamLen
294{-# INLINE filterDrop #-}
429{-# INLINE filterDrop #-}
430+filterDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
431+filterDrop streamLen n = composeN n $ S.drop 1 . S.filter (<= streamLen)
295{-# INLINE filterTake #-}
433{-# INLINE filterTake #-}
434+filterTake :: Monad m => Int -> Int -> Stream m Int -> m ()
435+filterTake streamLen n = composeN n $ S.take streamLen . S.filter (<= streamLen)
296{-# INLINE filterScan #-}
437{-# INLINE filterScan #-}
297−{-# INLINE filterMap #-}
298−scanMap, dropMap, dropScan, takeDrop, takeScan, takeMap, filterDrop,
299− filterTake, filterScan, filterMap
300− :: Monad m => Int -> Stream m Int -> m ()
438+filterScan :: Monad m => Int -> Stream m Int -> m ()
302−scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
303−dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
304−dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
305−takeDrop n = composeN n $ S.drop 1 . S.take maxValue
306−takeScan n = composeN n $ S.scanl' (+) 0 . S.take maxValue
307−takeMap n = composeN n $ S.map (subtract 1) . S.take maxValue
308−filterDrop n = composeN n $ S.drop 1 . S.filter (<= maxValue)
309−filterTake n = composeN n $ S.take maxValue . S.filter (<= maxValue)
310filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
439filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
441+{-# INLINE filterMap #-}
442+filterMap :: Monad m => Int -> Int -> Stream m Int -> m ()
311−filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
443+filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen)
313-------------------------------------------------------------------------------
445-------------------------------------------------------------------------------
314-- ConcatMap
446-- ConcatMap
@@ -320,8 +452,8 @@ filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
320concatMap :: Int -> Int -> Int -> IO ()
452concatMap :: Int -> Int -> Int -> IO ()
321concatMap outer inner n =
453concatMap outer inner n =
322 S.drain $ S.concatMap
454 S.drain $ S.concatMap
323− (\_ -> sourceUnfoldrMN inner n)
455+ (\_ -> unfoldrM inner n)
324− (sourceUnfoldrMN outer n)
456+ (unfoldrM outer n)
326#ifdef INSPECTION
458#ifdef INSPECTION
327inspect $ hasNoTypeClasses 'concatMap
459inspect $ hasNoTypeClasses 'concatMap
@@ -333,8 +465,8 @@ inspect $ hasNoTypeClasses 'concatMap
333concatMapPure :: Int -> Int -> Int -> IO ()
465concatMapPure :: Int -> Int -> Int -> IO ()
334concatMapPure outer inner n =
466concatMapPure outer inner n =
335 S.drain $ S.concatMap
467 S.drain $ S.concatMap
336− (\_ -> sourceUnfoldrN inner n)
468+ (\_ -> unfoldr inner n)
337− (sourceUnfoldrN outer n)
469+ (unfoldr outer n)
339#ifdef INSPECTION
471#ifdef INSPECTION
340inspect $ hasNoTypeClasses 'concatMapPure
472inspect $ hasNoTypeClasses 'concatMapPure
@@ -345,7 +477,7 @@ inspect $ hasNoTypeClasses 'concatMapPure
345{-# INLINE concatMapRepl #-}
477{-# INLINE concatMapRepl #-}
346concatMapRepl :: Int -> Int -> Int -> IO ()
478concatMapRepl :: Int -> Int -> Int -> IO ()
347concatMapRepl outer inner n =
479concatMapRepl outer inner n =
348− S.drain $ S.concatMap (S.replicate inner) (sourceUnfoldrMN outer n)
480+ S.drain $ S.concatMap (S.replicate inner) (unfoldrM outer n)
350#ifdef INSPECTION
482#ifdef INSPECTION
351inspect $ hasNoTypeClasses 'concatMapRepl
483inspect $ hasNoTypeClasses 'concatMapRepl
@@ -357,44 +489,70 @@ inspect $ hasNoTypeClasses 'concatMapRepl
357sourceConcatMapId :: Monad m
489sourceConcatMapId :: Monad m
358 => Int -> Int -> Stream m (Stream m Int)
490 => Int -> Int -> Stream m (Stream m Int)
359sourceConcatMapId val n =
491sourceConcatMapId val n =
360− S.fromFoldable $ fmap (S.yieldM . return) [n..n+val]
492+ S.fromFoldable $ fmap (S.fromEffect . return) [n..n+val]
362−{-# INLINE concatStreamsWith #-}
494+{-# INLINE concatMapBySerial #-}
363−concatStreamsWith :: Int -> Int -> Int -> IO ()
495+concatMapBySerial :: Int -> Int -> Int -> IO ()
364−concatStreamsWith outer inner n =
496+concatMapBySerial outer inner n =
365− S.drain $ S.concatMapBy S.serial
497+ S.drain $ S.concatMapWith S.append
366− (sourceUnfoldrMN inner)
498+ (unfoldrM inner)
367− (sourceUnfoldrMN outer n)
499+ (unfoldrM outer n)
369-------------------------------------------------------------------------------
501-------------------------------------------------------------------------------
370-- Nested Composition
502-- Nested Composition
371-------------------------------------------------------------------------------
503-------------------------------------------------------------------------------
373−{-# INLINE toNullApNested #-}
505+instance Monad m => Applicative (S.StreamK m) where
509+ {-# INLINE (<*>) #-}
510+ (<*>) = S.crossApply
512+ {-# INLINE liftA2 #-}
513+ liftA2 f x = (<*>) (fmap f x)
516+ (*>) = S.crossApplySnd
519+ (<*) = S.crossApplyFst
521+-- NOTE: even though concatMap for StreamD is 3x faster compared to StreamK,
522+-- the monad instance of StreamD is slower than StreamK after foldr/build
524+instance Monad m => Monad (S.StreamK m) where
525+ {-# INLINE return #-}
528+ {-# INLINE (>>=) #-}
529+ (>>=) = flip S.concatMap
531+{-# INLINE drainApplicative #-}
374−toNullApNested :: Monad m => Stream m Int -> m ()
532+drainApplicative :: Monad m => Stream m Int -> m ()
375−toNullApNested s = runStream $ do
533+drainApplicative s = drain $ do
376 (+) <$> s <*> s
534 (+) <$> s <*> s
378−{-# INLINE toNullNested #-}
536+{-# INLINE drainMonad #-}
379−toNullNested :: Monad m => Stream m Int -> m ()
537+drainMonad :: Monad m => Stream m Int -> m ()
380−toNullNested s = runStream $ do
538+drainMonad s = drain $ do
383 return $ x + y
541 return $ x + y
385−{-# INLINE toNullNested3 #-}
543+{-# INLINE drainMonad3 #-}
386−toNullNested3 :: Monad m => Stream m Int -> m ()
544+drainMonad3 :: Monad m => Stream m Int -> m ()
387−toNullNested3 s = runStream $ do
545+drainMonad3 s = drain $ do
391 return $ x + y + z
549 return $ x + y + z
393−{-# INLINE filterAllOutNested #-}
551+{-# INLINE filterAllOutMonad #-}
394−filterAllOutNested
552+filterAllOutMonad
395 :: Monad m
553 :: Monad m
396 => Stream m Int -> m ()
554 => Stream m Int -> m ()
397−filterAllOutNested str = runStream $ do
555+filterAllOutMonad str = drain $ do
400 let s = x + y
558 let s = x + y
@@ -402,11 +560,11 @@ filterAllOutNested str = runStream $ do
402 then return s
560 then return s
403 else S.nil
561 else S.nil
405−{-# INLINE filterAllInNested #-}
563+{-# INLINE filterAllInMonad #-}
406−filterAllInNested
564+filterAllInMonad
407 :: Monad m
565 :: Monad m
408 => Stream m Int -> m ()
566 => Stream m Int -> m ()
409−filterAllInNested str = runStream $ do
567+filterAllInMonad str = drain $ do
412 let s = x + y
570 let s = x + y
@@ -418,9 +576,14 @@ filterAllInNested str = runStream $ do
418-- Nested Composition Pure lists
576-- Nested Composition Pure lists
419-------------------------------------------------------------------------------
577-------------------------------------------------------------------------------
421−{-# INLINE sourceUnfoldrList #-}
579+-- There are several list benchmarks here for comparison with lists. It is easy
422−sourceUnfoldrList :: Int -> Int -> [Int]
580+-- and convenient to see the comparisons when they are here, otherwise we'll
581+-- have to add a separate module for list benchmarks with the same names and
582+-- then add a comparison in bench.sh.
584+{-# INLINE unfoldrList #-}
585+unfoldrList :: Int -> Int -> [Int]
423−sourceUnfoldrList maxval n = List.unfoldr step n
586+unfoldrList maxval n = List.unfoldr step n
425 step cnt =
588 step cnt =
426 if cnt > n + maxval
589 if cnt > n + maxval
@@ -471,229 +634,301 @@ filterAllInNestedList str = do
471-------------------------------------------------------------------------------
634-------------------------------------------------------------------------------
473moduleName :: String
636moduleName :: String
474−moduleName = "Data.Stream.StreamK"
637+moduleName = "Data.StreamK"
476−o_1_space :: [Benchmark]
639+o_1_space_generation :: Int -> Benchmark
477−o_1_space =
640+o_1_space_generation streamLen =
478− [ bgroup (o_1_space_prefix moduleName)
479− [ bgroup "generation"
641+ bgroup "generation"
480− [ benchFold "unfoldr" toNull sourceUnfoldr
642+ [ benchFold "unfoldr" drain (unfoldr streamLen)
481− , benchFold "unfoldrM" toNull sourceUnfoldrM
643+ , benchFold "unfoldrM" drain (unfoldrM streamLen)
482−
644+ , benchFold "repeat" drain (repeat streamLen)
645+ , benchFold "repeatM" drain (repeatM streamLen)
646+ , benchFold "replicate" drain (replicate streamLen)
647+ , benchFold "replicateM" drain (replicateM streamLen)
648+ , benchFold "iterate" drain (iterate streamLen)
649+ , benchFold "iterateM" drain (iterateM streamLen)
483− , benchFold "fromFoldable" toNull sourceFromFoldable
651+ , benchFold "fromFoldable" drain (fromFoldable streamLen)
484− , benchFold "fromFoldableM" toNull sourceFromFoldableM
652+ , benchFold "fromFoldableM" drain (fromFoldableM streamLen)
486 -- appends
654 -- appends
487− , benchFold "concatMapFoldableWith" toNull sourceFoldMapWith
655+ , benchFold "concatMapFoldableWith" drain (concatMapFoldableSerial streamLen)
488− , benchFold "concatMapFoldableWithM" toNull sourceFoldMapWithM
656+ , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
659+o_1_space_elimination :: Int -> Benchmark
660+o_1_space_elimination streamLen =
490− , bgroup "elimination"
661+ bgroup "elimination"
491− [ benchFold "toNull" toNull sourceUnfoldrM
662+ [ benchFold "toNull" drain (unfoldrM streamLen)
492− , benchFold "mapM_" mapM_ sourceUnfoldrM
663+ , benchFold "mapM_" mapM_ (unfoldrM streamLen)
493− , benchFold "uncons" uncons sourceUnfoldrM
664+ , benchFold "uncons" uncons (unfoldrM streamLen)
494− , benchFold "init" init sourceUnfoldrM
665+ , benchFold "init" init (unfoldrM streamLen)
495− , benchFold "foldl'" foldl sourceUnfoldrM
666+ , benchFold "foldl'" foldl' (unfoldrM streamLen)
496− , benchFold "last" last sourceUnfoldrM
667+ , benchFold "last" last (unfoldrM streamLen)
670+o_1_space_nested :: Int -> Benchmark
671+o_1_space_nested streamLen =
498− , bgroup "nested"
672+ bgroup "nested"
499− [ benchFold "toNullAp" toNullApNested (sourceUnfoldrMN value2)
673+ [ benchFold "drainApplicative" drainApplicative (unfoldrM streamLen2)
500− , benchFold "toNull" toNullNested (sourceUnfoldrMN value2)
674+ , benchFold "drainMonad" drainMonad (unfoldrM streamLen2)
501− , benchFold "toNull3" toNullNested3 (sourceUnfoldrMN value3)
675+ , benchFold "drainMonad3" drainMonad3 (unfoldrM streamLen3)
502− , benchFold "filterAllIn" filterAllInNested (sourceUnfoldrMN value2)
676+ , benchFold "filterAllInMonad" filterAllInMonad (unfoldrM streamLen2)
503− , benchFold "filterAllOut" filterAllOutNested (sourceUnfoldrMN value2)
677+ , benchFold "filterAllOutMonad" filterAllOutMonad (unfoldrM streamLen2)
504− , benchFold "toNullApPure" toNullApNested (sourceUnfoldrN value2)
678+ , benchFold "drainApplicative (pure)" drainApplicative (unfoldr streamLen2)
505− , benchFold "toNullPure" toNullNested (sourceUnfoldrN value2)
679+ , benchFold "drainMonad (pure)" drainMonad (unfoldr streamLen2)
506− , benchFold "toNull3Pure" toNullNested3 (sourceUnfoldrN value3)
680+ , benchFold "drainMonad3 (pure)" drainMonad3 (unfoldr streamLen3)
507− , benchFold "filterAllInPure" filterAllInNested (sourceUnfoldrN value2)
681+ , benchFold "filterAllInMonad (pure)" filterAllInMonad (unfoldr streamLen2)
508− , benchFold "filterAllOutPure" filterAllOutNested (sourceUnfoldrN value2)
682+ , benchFold "filterAllOutMonad (pure)" filterAllOutMonad (unfoldr streamLen2)
685+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
686+ streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
688+o_1_space_transformation :: Int -> Benchmark
689+o_1_space_transformation streamLen =
510− , bgroup "transformation"
690+ bgroup "transformation"
511− [ benchFold "foldrS" (foldrS 1) sourceUnfoldrM
691+ [ benchFold "foldrS" (foldrS 1) (unfoldrM streamLen)
512− , benchFold "scan" (scan 1) sourceUnfoldrM
692+ , benchFold "scanl'" (scanl' 1) (unfoldrM streamLen)
513− , benchFold "map" (map 1) sourceUnfoldrM
693+ , benchFold "map" (map 1) (unfoldrM streamLen)
514− , benchFold "fmap" (fmapK 1) sourceUnfoldrM
694+ , benchFold "fmap" (fmapK 1) (unfoldrM streamLen)
515− , benchFold "mapM" (mapM 1) sourceUnfoldrM
695+ , benchFold "mapM" (mapM 1) (unfoldrM streamLen)
516− , benchFold "mapMSerial" (mapMSerial 1) sourceUnfoldrM
696+ , benchFold "mapMSerial" (mapMSerial 1) (unfoldrM streamLen)
699+o_1_space_transformationX4 :: Int -> Benchmark
700+o_1_space_transformationX4 streamLen =
518− , bgroup "transformationX4"
701+ bgroup "transformationX4"
519− [ benchFold "scan" (scan 4) sourceUnfoldrM
702+ [ benchFold "scanl'" (scanl' 4) (unfoldrM streamLen)
520− , benchFold "map" (map 4) sourceUnfoldrM
703+ , benchFold "map" (map 4) (unfoldrM streamLen)
521− , benchFold "fmap" (fmapK 4) sourceUnfoldrM
704+ , benchFold "fmap" (fmapK 4) (unfoldrM streamLen)
522− , benchFold "mapM" (mapM 4) sourceUnfoldrM
705+ , benchFold "mapM" (mapM 4) (unfoldrM streamLen)
523− , benchFold "mapMSerial" (mapMSerial 4) sourceUnfoldrM
706+ , benchFold "mapMSerial" (mapMSerial 4) (unfoldrM streamLen)
524 -- XXX this is horribly slow
707 -- XXX this is horribly slow
525− -- , benchFold "concatMap" (concatMap 4) (sourceUnfoldrMN value16)
708+ -- , benchFold "concatMap" (concatMap 4) (unfoldrM streamLen16)
711+o_1_space_concat :: Int -> Benchmark
712+o_1_space_concat streamLen =
527− , bgroup "concat"
713+ bgroup "concat"
528 [ benchIOSrc1 "concatMapPure (n of 1)"
714 [ benchIOSrc1 "concatMapPure (n of 1)"
529− (concatMapPure value 1)
715+ (concatMapPure streamLen 1)
530 , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
716 , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
531− (concatMapPure value2 value2)
717+ (concatMapPure streamLen2 streamLen2)
532 , benchIOSrc1 "concatMapPure (1 of n)"
718 , benchIOSrc1 "concatMapPure (1 of n)"
533− (concatMapPure 1 value)
719+ (concatMapPure 1 streamLen)
535 , benchIOSrc1 "concatMap (n of 1)"
721 , benchIOSrc1 "concatMap (n of 1)"
536− (concatMap value 1)
722+ (concatMap streamLen 1)
537 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
723 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
538− (concatMap value2 value2)
724+ (concatMap streamLen2 streamLen2)
539 , benchIOSrc1 "concatMap (1 of n)"
725 , benchIOSrc1 "concatMap (1 of n)"
540− (concatMap 1 value)
726+ (concatMap 1 streamLen)
542 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
728 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
543− (concatMapRepl value2 value2)
729+ (concatMapRepl streamLen2 streamLen2)
545 -- This is for comparison with concatMapFoldableWith
731 -- This is for comparison with concatMapFoldableWith
546 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
732 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
734+ . S.concatMapWith S.append id
547− (S.drain . S.concatMapBy S.serial id . sourceConcatMapId value)
735+ . sourceConcatMapId streamLen)
549− , benchIOSrc1 "concatMapWith (n of 1)"
737+ , benchIOSrc1 "concatMapBy serial (n of 1)"
550− (concatStreamsWith value 1)
738+ (concatMapBySerial streamLen 1)
551− , benchIOSrc1 "concatMapWith (sqrt n of sqrt n)"
739+ , benchIOSrc1 "concatMapBy serial (sqrt n of sqrt n)"
552− (concatStreamsWith value2 value2)
740+ (concatMapBySerial streamLen2 streamLen2)
553− , benchIOSrc1 "concatMapWith (1 of n)"
741+ , benchIOSrc1 "concatMapBy serial (1 of n)"
554− (concatStreamsWith 1 value)
742+ (concatMapBySerial 1 streamLen)
743+ , benchFold "sortBy" sortBy (unfoldrM streamLen)
746+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
748+o_1_space_filtering :: Int -> Benchmark
749+o_1_space_filtering streamLen =
556− , bgroup "filtering"
750+ bgroup "filtering"
557− [ benchFold "filter-even" (filterEven 1) sourceUnfoldrM
751+ [ benchFold "filter-even" (filterEven 1) (unfoldrM streamLen)
558− , benchFold "filter-all-out" (filterAllOut 1) sourceUnfoldrM
752+ , benchFold "filter-all-out" (filterAllOut streamLen 1) (unfoldrM streamLen)
559− , benchFold "filter-all-in" (filterAllIn 1) sourceUnfoldrM
753+ , benchFold "filter-all-in" (filterAllIn streamLen 1) (unfoldrM streamLen)
560− , benchFold "take-all" (takeAll 1) sourceUnfoldrM
754+ , benchFold "take-all" (takeAll streamLen 1) (unfoldrM streamLen)
561− , benchFold "takeWhile-true" (takeWhileTrue 1) sourceUnfoldrM
755+ , benchFold "takeWhile-true" (takeWhileTrue streamLen 1) (unfoldrM streamLen)
562− , benchFold "drop-one" (dropOne 1) sourceUnfoldrM
756+ , benchFold "drop-one" (dropOne 1) (unfoldrM streamLen)
563− , benchFold "drop-all" (dropAll 1) sourceUnfoldrM
757+ , benchFold "drop-all" (dropAll streamLen 1) (unfoldrM streamLen)
564− , benchFold "dropWhile-true" (dropWhileTrue 1) sourceUnfoldrM
758+ , benchFold "dropWhile-true" (dropWhileTrue streamLen 1) (unfoldrM streamLen)
565− , benchFold "dropWhile-false" (dropWhileFalse 1) sourceUnfoldrM
759+ , benchFold "dropWhile-false" (dropWhileFalse 1) (unfoldrM streamLen)
762+o_1_space_filteringX4 :: Int -> Benchmark
763+o_1_space_filteringX4 streamLen =
567− , bgroup "filteringX4"
764+ bgroup "filteringX4"
568− [ benchFold "filter-even" (filterEven 4) sourceUnfoldrM
765+ [ benchFold "filter-even" (filterEven 4) (unfoldrM streamLen)
569− , benchFold "filter-all-out" (filterAllOut 4) sourceUnfoldrM
766+ , benchFold "filter-all-out" (filterAllOut streamLen 4) (unfoldrM streamLen)
570− , benchFold "filter-all-in" (filterAllIn 4) sourceUnfoldrM
767+ , benchFold "filter-all-in" (filterAllIn streamLen 4) (unfoldrM streamLen)
571− , benchFold "take-all" (takeAll 4) sourceUnfoldrM
768+ , benchFold "take-all" (takeAll streamLen 4) (unfoldrM streamLen)
572− , benchFold "takeWhile-true" (takeWhileTrue 4) sourceUnfoldrM
769+ , benchFold "takeWhile-true" (takeWhileTrue streamLen 4) (unfoldrM streamLen)
573− , benchFold "drop-one" (dropOne 4) sourceUnfoldrM
770+ , benchFold "drop-one" (dropOne 4) (unfoldrM streamLen)
574− , benchFold "drop-all" (dropAll 4) sourceUnfoldrM
771+ , benchFold "drop-all" (dropAll streamLen 4) (unfoldrM streamLen)
575− , benchFold "dropWhile-true" (dropWhileTrue 4) sourceUnfoldrM
772+ , benchFold "dropWhile-true" (dropWhileTrue streamLen 4) (unfoldrM streamLen)
576− , benchFold "dropWhile-false" (dropWhileFalse 4) sourceUnfoldrM
773+ , benchFold "dropWhile-false" (dropWhileFalse 4) (unfoldrM streamLen)
776+o_1_space_zipping :: Int -> Benchmark
777+o_1_space_zipping streamLen =
578− , bgroup "zipping"
778+ bgroup "zipping"
579− [ benchFold "zip" zip sourceUnfoldrM
779+ [ benchFold "zipWith" zipWith (unfoldrM streamLen)
780+ , benchFold "zipWithM" zipWithM (unfoldrM streamLen)
783+o_1_space_mixed :: Int -> Benchmark
784+o_1_space_mixed streamLen =
581− , bgroup "mixed"
785+ bgroup "mixed"
582− [ benchFold "scan-map" (scanMap 1) sourceUnfoldrM
786+ [ benchFold "scan-map" (scanMap 1) (unfoldrM streamLen)
583− , benchFold "drop-map" (dropMap 1) sourceUnfoldrM
787+ , benchFold "drop-map" (dropMap 1) (unfoldrM streamLen)
584− , benchFold "drop-scan" (dropScan 1) sourceUnfoldrM
788+ , benchFold "drop-scan" (dropScan 1) (unfoldrM streamLen)
585− , benchFold "take-drop" (takeDrop 1) sourceUnfoldrM
789+ , benchFold "take-drop" (takeDrop streamLen 1) (unfoldrM streamLen)
586− , benchFold "take-scan" (takeScan 1) sourceUnfoldrM
790+ , benchFold "take-scan" (takeScan streamLen 1) (unfoldrM streamLen)
587− , benchFold "take-map" (takeMap 1) sourceUnfoldrM
791+ , benchFold "take-map" (takeMap streamLen 1) (unfoldrM streamLen)
588− , benchFold "filter-drop" (filterDrop 1) sourceUnfoldrM
792+ , benchFold "filter-drop" (filterDrop streamLen 1) (unfoldrM streamLen)
589− , benchFold "filter-take" (filterTake 1) sourceUnfoldrM
793+ , benchFold "filter-take" (filterTake streamLen 1) (unfoldrM streamLen)
590− , benchFold "filter-scan" (filterScan 1) sourceUnfoldrM
794+ , benchFold "filter-scan" (filterScan 1) (unfoldrM streamLen)
591− , benchFold "filter-map" (filterMap 1) sourceUnfoldrM
795+ , benchFold "filter-map" (filterMap streamLen 1) (unfoldrM streamLen)
798+o_1_space_mixedX2 :: Int -> Benchmark
799+o_1_space_mixedX2 streamLen =
593− , bgroup "mixedX2"
800+ bgroup "mixedX2"
594− [ benchFold "scan-map" (scanMap 2) sourceUnfoldrM
801+ [ benchFold "scan-map" (scanMap 2) (unfoldrM streamLen)
595− , benchFold "drop-map" (dropMap 2) sourceUnfoldrM
802+ , benchFold "drop-map" (dropMap 2) (unfoldrM streamLen)
596− , benchFold "drop-scan" (dropScan 2) sourceUnfoldrM
803+ , benchFold "drop-scan" (dropScan 2) (unfoldrM streamLen)
597− , benchFold "take-drop" (takeDrop 2) sourceUnfoldrM
804+ , benchFold "take-drop" (takeDrop streamLen 2) (unfoldrM streamLen)
598− , benchFold "take-scan" (takeScan 2) sourceUnfoldrM
805+ , benchFold "take-scan" (takeScan streamLen 2) (unfoldrM streamLen)
599− , benchFold "take-map" (takeMap 2) sourceUnfoldrM
806+ , benchFold "take-map" (takeMap streamLen 2) (unfoldrM streamLen)
600− , benchFold "filter-drop" (filterDrop 2) sourceUnfoldrM
807+ , benchFold "filter-drop" (filterDrop streamLen 2) (unfoldrM streamLen)
601− , benchFold "filter-take" (filterTake 2) sourceUnfoldrM
808+ , benchFold "filter-take" (filterTake streamLen 2) (unfoldrM streamLen)
602− , benchFold "filter-scan" (filterScan 2) sourceUnfoldrM
809+ , benchFold "filter-scan" (filterScan 2) (unfoldrM streamLen)
603− , benchFold "filter-map" (filterMap 2) sourceUnfoldrM
810+ , benchFold "filter-map" (filterMap streamLen 2) (unfoldrM streamLen)
813+o_1_space_mixedX4 :: Int -> Benchmark
814+o_1_space_mixedX4 streamLen =
605− , bgroup "mixedX4"
815+ bgroup "mixedX4"
606− [ benchFold "scan-map" (scanMap 4) sourceUnfoldrM
816+ [ benchFold "scan-map" (scanMap 4) (unfoldrM streamLen)
607− , benchFold "drop-map" (dropMap 4) sourceUnfoldrM
817+ , benchFold "drop-map" (dropMap 4) (unfoldrM streamLen)
608− , benchFold "drop-scan" (dropScan 4) sourceUnfoldrM
818+ , benchFold "drop-scan" (dropScan 4) (unfoldrM streamLen)
609− , benchFold "take-drop" (takeDrop 4) sourceUnfoldrM
819+ , benchFold "take-drop" (takeDrop streamLen 4) (unfoldrM streamLen)
610− , benchFold "take-scan" (takeScan 4) sourceUnfoldrM
820+ , benchFold "take-scan" (takeScan streamLen 4) (unfoldrM streamLen)
611− , benchFold "take-map" (takeMap 4) sourceUnfoldrM
821+ , benchFold "take-map" (takeMap streamLen 4) (unfoldrM streamLen)
612− , benchFold "filter-drop" (filterDrop 4) sourceUnfoldrM
822+ , benchFold "filter-drop" (filterDrop streamLen 4) (unfoldrM streamLen)
613− , benchFold "filter-take" (filterTake 4) sourceUnfoldrM
823+ , benchFold "filter-take" (filterTake streamLen 4) (unfoldrM streamLen)
614− , benchFold "filter-scan" (filterScan 4) sourceUnfoldrM
824+ , benchFold "filter-scan" (filterScan 4) (unfoldrM streamLen)
615− , benchFold "filter-map" (filterMap 4) sourceUnfoldrM
825+ , benchFold "filter-map" (filterMap streamLen 4) (unfoldrM streamLen)
828+o_1_space_list :: Int -> Benchmark
829+o_1_space_list streamLen =
831+ [ bgroup "elimination"
832+ [ benchList "last" (\xs -> [List.last xs]) (unfoldrList streamLen)
835+ [ benchList "toNullAp" toNullApNestedList (unfoldrList streamLen2)
836+ , benchList "toNull" toNullNestedList (unfoldrList streamLen2)
837+ , benchList "toNull3" toNullNestedList3 (unfoldrList streamLen3)
838+ , benchList "filterAllIn" filterAllInNestedList (unfoldrList streamLen2)
839+ , benchList "filterAllOut" filterAllOutNestedList (unfoldrList streamLen2)
844+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
845+ streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
847+o_1_space :: Int -> Benchmark
848+o_1_space streamLen =
849+ bgroup (o_1_space_prefix moduleName)
850+ [ o_1_space_generation streamLen
851+ , o_1_space_elimination streamLen
852+ , o_1_space_nested streamLen
853+ , o_1_space_transformation streamLen
854+ , o_1_space_transformationX4 streamLen
855+ , o_1_space_concat streamLen
856+ , o_1_space_filtering streamLen
857+ , o_1_space_filteringX4 streamLen
858+ , o_1_space_zipping streamLen
859+ , o_1_space_mixed streamLen
860+ , o_1_space_mixedX2 streamLen
861+ , o_1_space_mixedX4 streamLen
862+ , o_1_space_list streamLen
620−o_n_heap :: [Benchmark]
865+o_n_heap :: Int -> Benchmark
621−o_n_heap =
866+o_n_heap streamLen =
622− [ bgroup (o_n_heap_prefix moduleName)
867+ bgroup (o_n_heap_prefix moduleName)
623 [ bgroup "transformation"
868 [ bgroup "transformation"
624− [ benchFold "foldlS" (foldlS 1) sourceUnfoldrM
869+ [ benchFold "foldlS" (foldlS 1) (unfoldrM streamLen)
629{-# INLINE benchK #-}
873{-# INLINE benchK #-}
630benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
874benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
631−benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= toNull . f
875+benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= drain . f
633−o_n_stack :: [Benchmark]
877+o_n_stack :: Int -> Int -> Int -> Benchmark
634−o_n_stack =
878+o_n_stack streamLen iterStreamLen maxIters =
635− [ bgroup (o_n_stack_prefix moduleName)
879+ bgroup (o_n_stack_prefix moduleName)
636 [ bgroup "elimination"
880 [ bgroup "elimination"
637− [ benchFold "tail" tail sourceUnfoldrM
881+ [ benchFold "tail" tail (unfoldrM streamLen)
638− , benchFold "nullTail" nullTail sourceUnfoldrM
882+ , benchFold "nullTail" nullTail (unfoldrM streamLen)
639− , benchFold "headTail" headTail sourceUnfoldrM
883+ , benchFold "headTail" headTail (unfoldrM streamLen)
641 , bgroup "transformation"
885 , bgroup "transformation"
643 -- XXX why do these need so much stack
887 -- XXX why do these need so much stack
644− benchFold "intersperse" (intersperse 1) (sourceUnfoldrMN value2)
888+ benchFold "intersperse" (intersperse streamLen 1) (unfoldrM streamLen2)
645− , benchFold "interspersePure" (intersperse 1) (sourceUnfoldrN value2)
889+ , benchFold "interspersePure" (intersperse streamLen 1) (unfoldr streamLen2)
647 , bgroup "transformationX4"
891 , bgroup "transformationX4"
649− benchFold "intersperse" (intersperse 4) (sourceUnfoldrMN value16)
893+ benchFold "intersperse" (intersperse streamLen 4) (unfoldrM streamLen16)
651 , bgroup "iterated"
895 , bgroup "iterated"
652− [ benchK "mapM" iterateMapM
896+ [ benchK "mapM" (iterateMapM iterStreamLen maxIters)
653− , benchK "scan(1/10)" iterateScan
897+ , benchK "scan(1/10)" (iterateScan iterStreamLen maxIters)
654− , benchK "filterEven" iterateFilterEven
898+ , benchK "filterEven" (iterateFilterEven iterStreamLen maxIters)
655− , benchK "takeAll" iterateTakeAll
899+ , benchK "takeAll" (iterateTakeAll streamLen iterStreamLen maxIters)
656− , benchK "dropOne" iterateDropOne
900+ , benchK "dropOne" (iterateDropOne iterStreamLen maxIters)
657− , benchK "dropWhileFalse(1/10)" iterateDropWhileFalse
901+ , benchK "dropWhileFalse(1/10)" (iterateDropWhileFalse streamLen iterStreamLen maxIters)
658− , benchK "dropWhileTrue" iterateDropWhileTrue
902+ , benchK "dropWhileTrue" (iterateDropWhileTrue streamLen iterStreamLen maxIters)
906+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
907+ streamLen16 = round (P.fromIntegral streamLen**(1/16::P.Double)) -- triple nested loop
663−o_n_space :: [Benchmark]
909+o_n_space :: Int -> Benchmark
664−o_n_space =
910+o_n_space streamLen =
665− [ bgroup (o_n_space_prefix moduleName)
911+ bgroup (o_n_space_prefix moduleName)
666 [ bgroup "elimination"
912 [ bgroup "elimination"
667− [ benchFold "toList" toList sourceUnfoldrM
913+ [ benchFold "toList" toList (unfoldrM streamLen)
672{-# INLINE benchList #-}
917{-# INLINE benchList #-}
673benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
918benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
674benchList name run f = bench name $ nfIO $ randomRIO (1,1) >>= return . run . f
919benchList name run f = bench name $ nfIO $ randomRIO (1,1) >>= return . run . f
676−o_1_space_list :: [Benchmark]
921+main :: IO ()
677−o_1_space_list =
922+main =
678− [ bgroup "list"
923+ defaultMain
679− [ bgroup "elimination"
924+ [ o_1_space streamLen
680− [ benchList "last" (\xs -> [List.last xs]) (sourceUnfoldrList value)
925+ , o_n_stack streamLen iterStreamLen maxIters
681− ]
926+ , o_n_heap streamLen
682− , bgroup "nested"
927+ , o_n_space streamLen
683− [ benchList "toNullAp" toNullApNestedList (sourceUnfoldrList value2)
684− , benchList "toNull" toNullNestedList (sourceUnfoldrList value2)
685− , benchList "toNull3" toNullNestedList3 (sourceUnfoldrList value3)
686− , benchList "filterAllIn" filterAllInNestedList (sourceUnfoldrList value2)
687− , benchList "filterAllOut" filterAllOutNestedList (sourceUnfoldrList value2)
692−main :: IO ()
930+ where
693−main = defaultMain $ concat
931+
694− [ o_1_space
932+ streamLen = 100000
695− , [bgroup (o_1_space_prefix moduleName) o_1_space_list]
933+ maxIters = 10000
696− , o_n_stack
934+ iterStreamLen = 10