@@ -1,132 +1,207 @@
2-- Module : Streamly.Benchmark.Data.Stream.StreamK
2-- Module : Streamly.Benchmark.Data.Stream.StreamK
3−-- Copyright : (c) 2018 Harendra Kumar
3+-- Copyright : (c) 2018 Composewell Technologies
5-- License : BSD3
5-- License : BSD3
6-- Maintainer : streamly@composewell.com
6-- Maintainer : streamly@composewell.com
8{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE FlexibleContexts #-}
9{-# LANGUAGE ScopedTypeVariables #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11+{-# OPTIONS_GHC -Wno-orphans #-}
13+#ifdef __HADDOCK_VERSION__
18+{-# LANGUAGE TemplateHaskell #-}
19+{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
11module Main (main) where
22module Main (main) where
24+#if !MIN_VERSION_base(4,18,0)
25+import Control.Applicative (liftA2)
13import Control.Monad (when)
27import Control.Monad (when)
14import Data.Maybe (isJust)
28import Data.Maybe (isJust)
15import System.Random (randomRIO)
29import System.Random (randomRIO)
16import Prelude hiding
30import Prelude hiding
17− (tail, mapM_, foldl, last, map, mapM, concatMap, zip, init)
31+ ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
19import qualified Prelude as P
35import qualified Prelude as P
20import qualified Data.List as List
36import qualified Data.List as List
22−import qualified Streamly.Internal.Data.Stream.StreamK as S
38+import qualified Streamly.Internal.Data.StreamK as S
23−import qualified Streamly.Internal.Data.Stream.Prelude as SP
24−import qualified Streamly.Internal.Data.SVar as S
26−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
40+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
28import Streamly.Benchmark.Common
42import Streamly.Benchmark.Common
30−value, value2, value3, value16, maxValue :: Int
44+#ifdef INSPECTION
31−value = 100000
45+import Test.Inspection
32−value2 = round (P.fromIntegral value**(1/2::P.Double)) -- double nested loop
46+#endif
33−value3 = round (P.fromIntegral value**(1/3::P.Double)) -- triple nested loop
47+
34−value16 = round (P.fromIntegral value**(1/16::P.Double)) -- triple nested loop
48+{-
36−
50+Benchmarks that need to be added
37−-------------------------------------------------------------------------------
51+
38−-- Benchmark ops
52+-- fromList
39−-------------------------------------------------------------------------------
53+
41−{-# INLINE toNull #-}
55+-- concatPairsWith
42−{-# INLINE uncons #-}
56+-- apWith
43−{-# INLINE nullTail #-}
57+-- apSerial
44−{-# INLINE headTail #-}
58+-- apSerialDiscardFst
45−{-# INLINE zip #-}
59+-- apSerialDiscardSnd
46−toNull, uncons, nullTail, headTail, zip
60+
48− => Stream m Int -> m ()
62+-- serial
50−{-# INLINE toList #-}
64+-- withLocal
51−toList :: Monad m => Stream m Int -> m [Int]
65+-- mfix
52−{-# INLINE foldl #-}
66+
53−foldl :: Monad m => Stream m Int -> m Int
67+-- elem
54−{-# INLINE last #-}
68+-- notElem
55−last :: Monad m => Stream m Int -> m (Maybe Int)
69+-- all
109+-- toStreamK (Probably can be skipped)
57-------------------------------------------------------------------------------
116-------------------------------------------------------------------------------
58-- Stream generation and elimination
117-- Stream generation and elimination
59-------------------------------------------------------------------------------
118-------------------------------------------------------------------------------
61−type Stream m a = S.Stream m a
120+type Stream m a = S.StreamK m a
63−{-# INLINE sourceUnfoldr #-}
122+{-# INLINE unfoldr #-}
64−sourceUnfoldr :: Int -> Stream m Int
123+unfoldr :: Int -> Int -> Stream m Int
65−sourceUnfoldr n = S.unfoldr step n
124+unfoldr streamLen n = S.unfoldr step n
67 step cnt =
126 step cnt =
68− if cnt > n + value
127+ if cnt > n + streamLen
69 then Nothing
128 then Nothing
70 else Just (cnt, cnt + 1)
129 else Just (cnt, cnt + 1)
72−{-# INLINE sourceUnfoldrN #-}
131+{-# INLINE unfoldrM #-}
73−sourceUnfoldrN :: Int -> Int -> Stream m Int
132+unfoldrM :: Monad m => Int -> Int -> Stream m Int
74−sourceUnfoldrN m n = S.unfoldr step n
133+unfoldrM streamLen n = S.unfoldrMWith S.consM step n
76 step cnt =
135 step cnt =
77− if cnt > n + m
136+ if cnt > n + streamLen
79− else Just (cnt, cnt + 1)
81−{-# INLINE sourceUnfoldrM #-}
82−sourceUnfoldrM :: S.MonadAsync m => Int -> Stream m Int
83−sourceUnfoldrM n = S.unfoldrM step n
87 then return Nothing
137 then return Nothing
88 else return (Just (cnt, cnt + 1))
138 else return (Just (cnt, cnt + 1))
90−{-# INLINE sourceUnfoldrMN #-}
140+{-# INLINE repeat #-}
141+repeat :: Int -> Int -> Stream m Int
142+repeat streamLen = S.take streamLen . S.repeat
144+{-# INLINE repeatM #-}
91−sourceUnfoldrMN :: S.MonadAsync m => Int -> Int -> Stream m Int
145+repeatM :: Monad m => Int -> Int -> Stream m Int
92−sourceUnfoldrMN m n = S.unfoldrM step n
146+repeatM streamLen = S.take streamLen . S.repeatM . return
94− step cnt =
148+{-# INLINE replicate #-}
95− if cnt > n + m
149+replicate :: Int -> Int -> Stream m Int
96− then return Nothing
150+replicate = S.replicate
97− else return (Just (cnt, cnt + 1))
151+
98−
152+{-# INLINE replicateM #-}
99−{-# INLINE sourceFromFoldable #-}
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 #-}
100−sourceFromFoldable :: Int -> Stream m Int
165+fromFoldable :: Int -> Int -> Stream m Int
101−sourceFromFoldable n = S.fromFoldable [n..n+value]
166+fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
103−{-# INLINE sourceFromFoldableM #-}
168+{-# INLINE fromFoldableM #-}
104−sourceFromFoldableM :: S.MonadAsync m => Int -> Stream m Int
169+fromFoldableM :: Monad m => Int -> Int -> Stream m Int
105−sourceFromFoldableM n =
170+fromFoldableM streamLen n =
106− 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])
108−{-# INLINE sourceFoldMapWith #-}
173+{-# INLINABLE concatMapFoldableWith #-}
109−sourceFoldMapWith :: Int -> Stream m Int
174+concatMapFoldableWith :: P.Foldable f
110−sourceFoldMapWith n = SP.foldMapWith S.serial S.yield [n..n+value]
175+ => (Stream m b -> Stream m b -> Stream m b)
111−
176+ -> (a -> Stream m b)
112−{-# INLINE sourceFoldMapWithM #-}
177+ -> f a
179+concatMapFoldableWith f g = P.foldr (f . g) S.nil
181+{-# INLINE concatMapFoldableSerial #-}
182+concatMapFoldableSerial :: Int -> Int -> Stream m Int
183+concatMapFoldableSerial streamLen n =
184+ concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
186+{-# INLINE concatMapFoldableSerialM #-}
113−sourceFoldMapWithM :: Monad m => Int -> Stream m Int
187+concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
114−sourceFoldMapWithM n = SP.foldMapWith S.serial (S.yieldM . return) [n..n+value]
188+concatMapFoldableSerialM streamLen n =
189+ concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
116-------------------------------------------------------------------------------
191-------------------------------------------------------------------------------
117-- Elimination
192-- Elimination
118-------------------------------------------------------------------------------
193-------------------------------------------------------------------------------
120−{-# INLINE runStream #-}
195+{-# INLINE drain #-}
121−runStream :: Monad m => Stream m a -> m ()
196+drain :: Monad m => Stream m a -> m ()
122−runStream = S.drain
197+drain = S.drain
123−-- runStream = S.mapM_ (\_ -> return ())
125{-# INLINE mapM_ #-}
199{-# INLINE mapM_ #-}
126mapM_ :: Monad m => Stream m a -> m ()
200mapM_ :: Monad m => Stream m a -> m ()
127mapM_ = S.mapM_ (\_ -> return ())
201mapM_ = S.mapM_ (\_ -> return ())
129−toNull = runStream
203+{-# INLINE uncons #-}
204+uncons :: Monad m => Stream m Int -> m ()
130uncons s = do
205uncons s = do
131 r <- S.uncons s
206 r <- S.uncons s
132 case r of
207 case r of
@@ -134,205 +209,350 @@ uncons s = do
134 Just (_, t) -> uncons t
209 Just (_, t) -> uncons t
136{-# INLINE init #-}
211{-# INLINE init #-}
137−init :: (Monad m, S.IsStream t) => t m a -> m ()
212+init :: Monad m => Stream m a -> m ()
138init s = do
213init s = do
139 t <- S.init s
214 t <- S.init s
140 P.mapM_ S.drain t
215 P.mapM_ S.drain t
142{-# INLINE tail #-}
217{-# INLINE tail #-}
143−tail :: (Monad m, S.IsStream t) => t m a -> m ()
218+tail :: Monad m => Stream m a -> m ()
144tail 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 ()
146nullTail s = do
223nullTail s = do
147 r <- S.null s
224 r <- S.null s
148 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 ()
150headTail s = do
229headTail s = do
151 h <- S.head s
230 h <- S.head s
152 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]
154toList = S.toList
235toList = S.toList
237+{-# INLINE foldl' #-}
238+foldl' :: Monad m => Stream m Int -> m Int
155−foldl = S.foldl' (+) 0
239+foldl' = S.foldl' (+) 0
242+last :: Monad m => Stream m Int -> m (Maybe Int)
156−last = S.last
243+last = S.last
158-------------------------------------------------------------------------------
245-------------------------------------------------------------------------------
159-- Transformation
246-- Transformation
160-------------------------------------------------------------------------------
247-------------------------------------------------------------------------------
162−{-# INLINE transform #-}
163−transform :: Monad m => Stream m a -> m ()
164−transform = runStream
166{-# INLINE composeN #-}
249{-# INLINE composeN #-}
168 :: Monad m
251 :: Monad m
169 => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
252 => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
170composeN n f =
253composeN n f =
171 case n of
254 case n of
172− 1 -> transform . f
255+ 1 -> drain . f
173− 2 -> transform . f . f
256+ 2 -> drain . f . f
174− 3 -> transform . f . f . f
257+ 3 -> drain . f . f . f
175− 4 -> transform . f . f . f . f
258+ 4 -> drain . f . f . f . f
176 _ -> undefined
259 _ -> undefined
178−{-# INLINE scan #-}
261+{-# INLINE scanl' #-}
262+scanl' :: Monad m => Int -> Stream m Int -> m ()
263+scanl' n = composeN n $ S.scanl' (+) 0
179{-# INLINE map #-}
265{-# INLINE map #-}
266+map :: Monad m => Int -> Stream m Int -> m ()
267+map n = composeN n $ S.map (+ 1)
180{-# 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
181{-# INLINE filterEven #-}
281{-# INLINE filterEven #-}
282+filterEven :: Monad m => Int -> Stream m Int -> m ()
283+filterEven n = composeN n $ S.filter even
182{-# INLINE filterAllOut #-}
285{-# INLINE filterAllOut #-}
286+filterAllOut :: Monad m => Int -> Int -> Stream m Int -> m ()
287+filterAllOut streamLen n = composeN n $ S.filter (> streamLen)
183{-# INLINE filterAllIn #-}
289{-# INLINE filterAllIn #-}
290+filterAllIn :: Monad m => Int -> Int -> Stream m Int -> m ()
291+filterAllIn streamLen n = composeN n $ S.filter (<= streamLen)
184{-# INLINE _takeOne #-}
293{-# INLINE _takeOne #-}
294+_takeOne :: Monad m => Int -> Stream m Int -> m ()
295+_takeOne n = composeN n $ S.take 1
185{-# INLINE takeAll #-}
297{-# INLINE takeAll #-}
298+takeAll :: Monad m => Int -> Int -> Stream m Int -> m ()
299+takeAll streamLen n = composeN n $ S.take streamLen
186{-# INLINE takeWhileTrue #-}
301{-# INLINE takeWhileTrue #-}
302+takeWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
303+takeWhileTrue streamLen n = composeN n $ S.takeWhile (<= streamLen)
187{-# INLINE dropOne #-}
305{-# INLINE dropOne #-}
306+dropOne :: Monad m => Int -> Stream m Int -> m ()
307+dropOne n = composeN n $ S.drop 1
188{-# INLINE dropAll #-}
309{-# INLINE dropAll #-}
310+dropAll :: Monad m => Int -> Int -> Stream m Int -> m ()
311+dropAll streamLen n = composeN n $ S.drop streamLen
189{-# INLINE dropWhileTrue #-}
313{-# INLINE dropWhileTrue #-}
314+dropWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
315+dropWhileTrue streamLen n = composeN n $ S.dropWhile (<= streamLen)
190{-# INLINE dropWhileFalse #-}
317{-# INLINE dropWhileFalse #-}
318+dropWhileFalse :: Monad m => Int -> Stream m Int -> m ()
319+dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
191{-# 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
192{-# INLINE foldlS #-}
325{-# INLINE foldlS #-}
193−{-# INLINE concatMap #-}
194−scan, map, fmapK, filterEven, filterAllOut,
195− filterAllIn, _takeOne, takeAll, takeWhileTrue, dropAll, dropOne,
196− dropWhileTrue, dropWhileFalse, foldrS, foldlS, concatMap
198− => 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
201−{-# INLINE mapMSerial #-}
202{-# INLINE intersperse #-}
329{-# INLINE intersperse #-}
203−mapM, mapMSerial, intersperse
204− :: S.MonadAsync m => Int -> Stream m Int -> m ()
330+intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
206−scan n = composeN n $ S.scanl' (+) 0
207−map n = composeN n $ P.fmap (+1)
208−fmapK n = composeN n $ P.fmap (+1)
209−mapM n = composeN n $ S.mapM return
210−mapMSerial n = composeN n $ S.mapMSerial return
211−filterEven n = composeN n $ S.filter even
212−filterAllOut n = composeN n $ S.filter (> maxValue)
213−filterAllIn n = composeN n $ S.filter (<= maxValue)
214−_takeOne n = composeN n $ S.take 1
215−takeAll n = composeN n $ S.take maxValue
216−takeWhileTrue n = composeN n $ S.takeWhile (<= maxValue)
217−dropOne n = composeN n $ S.drop 1
218−dropAll n = composeN n $ S.drop maxValue
219−dropWhileTrue n = composeN n $ S.dropWhile (<= maxValue)
220−dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
221−foldrS n = composeN n $ S.foldrS S.cons S.nil
222−foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
223−-- We use a (sqrt n) element stream as source and then concat the same stream
224−-- for each element to produce an n element stream.
225−concatMap n = composeN n $ (\s -> S.concatMap (\_ -> s) s)
226−intersperse n = composeN n $ S.intersperse maxValue
331+intersperse streamLen n = composeN n $ S.intersperse streamLen
228-------------------------------------------------------------------------------
333-------------------------------------------------------------------------------
229-- Iteration
334-- Iteration
230-------------------------------------------------------------------------------
335-------------------------------------------------------------------------------
232−iterStreamLen, maxIters :: Int
236{-# INLINE iterateSource #-}
337{-# INLINE iterateSource #-}
237iterateSource
338iterateSource
239− => (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
240−iterateSource g i n = f i (sourceUnfoldrMN iterStreamLen n)
340+iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
242 f (0 :: Int) m = g m
342 f (0 :: Int) m = g m
243 f x m = g (f (x P.- 1) m)
343 f x m = g (f (x P.- 1) m)
245−{-# INLINE iterateMapM #-}
345+-- this is quadratic
246{-# 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)
247{-# INLINE iterateFilterEven #-}
362{-# INLINE iterateFilterEven #-}
363+iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
364+iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
248{-# INLINE iterateTakeAll #-}
366{-# INLINE iterateTakeAll #-}
249−{-# INLINE iterateDropOne #-}
250−{-# INLINE iterateDropWhileFalse #-}
251−{-# INLINE iterateDropWhileTrue #-}
252−iterateMapM, iterateScan, iterateFilterEven, iterateTakeAll, iterateDropOne,
253− iterateDropWhileFalse, iterateDropWhileTrue
255− => 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)
257−-- this is quadratic
371+{-# INLINE iterateDropOne #-}
258−iterateScan = iterateSource (S.scanl' (+) 0) (maxIters `div` 10)
372+iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
259−iterateDropWhileFalse = iterateSource (S.dropWhile (> maxValue))
373+iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
262−iterateMapM = iterateSource (S.mapM return) maxIters
375+{-# INLINE iterateDropWhileTrue #-}
263−iterateFilterEven = iterateSource (S.filter even) maxIters
376+iterateDropWhileTrue ::
264−iterateTakeAll = iterateSource (S.take maxValue) maxIters
377+ Monad m => Int -> Int -> Int -> Int -> Stream m Int
265−iterateDropOne = iterateSource (S.drop 1) maxIters
378+iterateDropWhileTrue streamLen iterStreamLen =
266−iterateDropWhileTrue = iterateSource (S.dropWhile (<= maxValue)) maxIters
379+ iterateSource iterStreamLen (S.dropWhile (<= streamLen))
268-------------------------------------------------------------------------------
381-------------------------------------------------------------------------------
269−-- Zipping and concat
382+-- Zipping
270-------------------------------------------------------------------------------
383-------------------------------------------------------------------------------
385+{-# INLINE zipWith #-}
386+zipWith :: Monad m => Stream m Int -> m ()
272−zip src = transform $ S.zipWith (,) src src
387+zipWith src = drain $ S.zipWith (,) src src
274−{-# INLINE concatMapRepl4xN #-}
389+{-# INLINE zipWithM #-}
275−concatMapRepl4xN :: Monad m => Stream m Int -> m ()
390+zipWithM :: Monad m => Stream m Int -> m ()
276−concatMapRepl4xN src = transform $ (S.concatMap (S.replicate 4) src)
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
278-------------------------------------------------------------------------------
401-------------------------------------------------------------------------------
279-- Mixed Composition
402-- Mixed Composition
280-------------------------------------------------------------------------------
403-------------------------------------------------------------------------------
282{-# 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
283{-# 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
284{-# 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
285{-# 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
286{-# 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
287{-# 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
288{-# 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)
289{-# 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)
290{-# INLINE filterScan #-}
437{-# INLINE filterScan #-}
291−{-# INLINE filterMap #-}
292−scanMap, dropMap, dropScan, takeDrop, takeScan, takeMap, filterDrop,
293− filterTake, filterScan, filterMap
294− :: Monad m => Int -> Stream m Int -> m ()
438+filterScan :: Monad m => Int -> Stream m Int -> m ()
296−scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
297−dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
298−dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
299−takeDrop n = composeN n $ S.drop 1 . S.take maxValue
300−takeScan n = composeN n $ S.scanl' (+) 0 . S.take maxValue
301−takeMap n = composeN n $ S.map (subtract 1) . S.take maxValue
302−filterDrop n = composeN n $ S.drop 1 . S.filter (<= maxValue)
303−filterTake n = composeN n $ S.take maxValue . S.filter (<= maxValue)
304filterScan 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 ()
305−filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
443+filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen)
445+-------------------------------------------------------------------------------
447+-------------------------------------------------------------------------------
449+-- concatMap unfoldrM/unfoldrM
451+{-# INLINE concatMap #-}
452+concatMap :: Int -> Int -> Int -> IO ()
453+concatMap outer inner n =
454+ S.drain $ S.concatMap
455+ (\_ -> unfoldrM inner n)
459+inspect $ hasNoTypeClasses 'concatMap
462+-- concatMap unfoldr/unfoldr
464+{-# INLINE concatMapPure #-}
465+concatMapPure :: Int -> Int -> Int -> IO ()
466+concatMapPure outer inner n =
467+ S.drain $ S.concatMap
468+ (\_ -> unfoldr inner n)
472+inspect $ hasNoTypeClasses 'concatMapPure
475+-- concatMap replicate/unfoldrM
477+{-# INLINE concatMapRepl #-}
478+concatMapRepl :: Int -> Int -> Int -> IO ()
479+concatMapRepl outer inner n =
480+ S.drain $ S.concatMap (S.replicate inner) (unfoldrM outer n)
483+inspect $ hasNoTypeClasses 'concatMapRepl
488+{-# INLINE sourceConcatMapId #-}
489+sourceConcatMapId :: Monad m
490+ => Int -> Int -> Stream m (Stream m Int)
491+sourceConcatMapId val n =
492+ S.fromFoldable $ fmap (S.fromEffect . return) [n..n+val]
494+{-# INLINE concatMapBySerial #-}
495+concatMapBySerial :: Int -> Int -> Int -> IO ()
496+concatMapBySerial outer inner n =
497+ S.drain $ S.concatMapWith S.append
307-------------------------------------------------------------------------------
501-------------------------------------------------------------------------------
308-- Nested Composition
502-- Nested Composition
309-------------------------------------------------------------------------------
503-------------------------------------------------------------------------------
311−{-# 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 #-}
312−toNullApNested :: Monad m => Stream m Int -> m ()
532+drainApplicative :: Monad m => Stream m Int -> m ()
313−toNullApNested s = runStream $ do
533+drainApplicative s = drain $ do
314 (+) <$> s <*> s
534 (+) <$> s <*> s
316−{-# INLINE toNullNested #-}
536+{-# INLINE drainMonad #-}
317−toNullNested :: Monad m => Stream m Int -> m ()
537+drainMonad :: Monad m => Stream m Int -> m ()
318−toNullNested s = runStream $ do
538+drainMonad s = drain $ do
321 return $ x + y
541 return $ x + y
323−{-# INLINE toNullNested3 #-}
543+{-# INLINE drainMonad3 #-}
324−toNullNested3 :: Monad m => Stream m Int -> m ()
544+drainMonad3 :: Monad m => Stream m Int -> m ()
325−toNullNested3 s = runStream $ do
545+drainMonad3 s = drain $ do
329 return $ x + y + z
549 return $ x + y + z
331−{-# INLINE filterAllOutNested #-}
551+{-# INLINE filterAllOutMonad #-}
332−filterAllOutNested
552+filterAllOutMonad
333 :: Monad m
553 :: Monad m
334 => Stream m Int -> m ()
554 => Stream m Int -> m ()
335−filterAllOutNested str = runStream $ do
555+filterAllOutMonad str = drain $ do
338 let s = x + y
558 let s = x + y
@@ -340,11 +560,11 @@ filterAllOutNested str = runStream $ do
340 then return s
560 then return s
341 else S.nil
561 else S.nil
343−{-# INLINE filterAllInNested #-}
563+{-# INLINE filterAllInMonad #-}
344−filterAllInNested
564+filterAllInMonad
345 :: Monad m
565 :: Monad m
346 => Stream m Int -> m ()
566 => Stream m Int -> m ()
347−filterAllInNested str = runStream $ do
567+filterAllInMonad str = drain $ do
350 let s = x + y
570 let s = x + y
@@ -356,9 +576,14 @@ filterAllInNested str = runStream $ do
356-- Nested Composition Pure lists
576-- Nested Composition Pure lists
357-------------------------------------------------------------------------------
577-------------------------------------------------------------------------------
359−{-# INLINE sourceUnfoldrList #-}
579+-- There are several list benchmarks here for comparison with lists. It is easy
360−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]
361−sourceUnfoldrList maxval n = List.unfoldr step n
586+unfoldrList maxval n = List.unfoldr step n
363 step cnt =
588 step cnt =
364 if cnt > n + maxval
589 if cnt > n + maxval
@@ -409,205 +634,301 @@ filterAllInNestedList str = do
409-------------------------------------------------------------------------------
634-------------------------------------------------------------------------------
411moduleName :: String
636moduleName :: String
412−moduleName = "Data.Stream.StreamK"
637+moduleName = "Data.StreamK"
414−o_1_space :: [Benchmark]
639+o_1_space_generation :: Int -> Benchmark
415−o_1_space =
640+o_1_space_generation streamLen =
416− [ bgroup (o_1_space_prefix moduleName)
417− [ bgroup "generation"
641+ bgroup "generation"
418− [ benchFold "unfoldr" toNull sourceUnfoldr
642+ [ benchFold "unfoldr" drain (unfoldr streamLen)
419− , benchFold "unfoldrM" toNull sourceUnfoldrM
643+ , benchFold "unfoldrM" drain (unfoldrM streamLen)
420−
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)
421− , benchFold "fromFoldable" toNull sourceFromFoldable
651+ , benchFold "fromFoldable" drain (fromFoldable streamLen)
422− , benchFold "fromFoldableM" toNull sourceFromFoldableM
652+ , benchFold "fromFoldableM" drain (fromFoldableM streamLen)
424 -- appends
654 -- appends
425− , benchFold "foldMapWith" toNull sourceFoldMapWith
655+ , benchFold "concatMapFoldableWith" drain (concatMapFoldableSerial streamLen)
426− , benchFold "foldMapWithM" toNull sourceFoldMapWithM
656+ , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
659+o_1_space_elimination :: Int -> Benchmark
660+o_1_space_elimination streamLen =
428− , bgroup "elimination"
661+ bgroup "elimination"
429− [ benchFold "toNull" toNull sourceUnfoldrM
662+ [ benchFold "toNull" drain (unfoldrM streamLen)
430− , benchFold "mapM_" mapM_ sourceUnfoldrM
663+ , benchFold "mapM_" mapM_ (unfoldrM streamLen)
431− , benchFold "uncons" uncons sourceUnfoldrM
664+ , benchFold "uncons" uncons (unfoldrM streamLen)
432− , benchFold "init" init sourceUnfoldrM
665+ , benchFold "init" init (unfoldrM streamLen)
433− , benchFold "foldl'" foldl sourceUnfoldrM
666+ , benchFold "foldl'" foldl' (unfoldrM streamLen)
434− , benchFold "last" last sourceUnfoldrM
667+ , benchFold "last" last (unfoldrM streamLen)
670+o_1_space_nested :: Int -> Benchmark
671+o_1_space_nested streamLen =
436− , bgroup "nested"
672+ bgroup "nested"
437− [ benchFold "toNullAp" toNullApNested (sourceUnfoldrMN value2)
673+ [ benchFold "drainApplicative" drainApplicative (unfoldrM streamLen2)
438− , benchFold "toNull" toNullNested (sourceUnfoldrMN value2)
674+ , benchFold "drainMonad" drainMonad (unfoldrM streamLen2)
439− , benchFold "toNull3" toNullNested3 (sourceUnfoldrMN value3)
675+ , benchFold "drainMonad3" drainMonad3 (unfoldrM streamLen3)
440− , benchFold "filterAllIn" filterAllInNested (sourceUnfoldrMN value2)
676+ , benchFold "filterAllInMonad" filterAllInMonad (unfoldrM streamLen2)
441− , benchFold "filterAllOut" filterAllOutNested (sourceUnfoldrMN value2)
677+ , benchFold "filterAllOutMonad" filterAllOutMonad (unfoldrM streamLen2)
442− , benchFold "toNullApPure" toNullApNested (sourceUnfoldrN value2)
678+ , benchFold "drainApplicative (pure)" drainApplicative (unfoldr streamLen2)
443− , benchFold "toNullPure" toNullNested (sourceUnfoldrN value2)
679+ , benchFold "drainMonad (pure)" drainMonad (unfoldr streamLen2)
444− , benchFold "toNull3Pure" toNullNested3 (sourceUnfoldrN value3)
680+ , benchFold "drainMonad3 (pure)" drainMonad3 (unfoldr streamLen3)
445− , benchFold "filterAllInPure" filterAllInNested (sourceUnfoldrN value2)
681+ , benchFold "filterAllInMonad (pure)" filterAllInMonad (unfoldr streamLen2)
446− , 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 =
448− , bgroup "transformation"
690+ bgroup "transformation"
449− [ benchFold "foldrS" (foldrS 1) sourceUnfoldrM
691+ [ benchFold "foldrS" (foldrS 1) (unfoldrM streamLen)
450− , benchFold "scan" (scan 1) sourceUnfoldrM
692+ , benchFold "scanl'" (scanl' 1) (unfoldrM streamLen)
451− , benchFold "map" (map 1) sourceUnfoldrM
693+ , benchFold "map" (map 1) (unfoldrM streamLen)
452− , benchFold "fmap" (fmapK 1) sourceUnfoldrM
694+ , benchFold "fmap" (fmapK 1) (unfoldrM streamLen)
453− , benchFold "mapM" (mapM 1) sourceUnfoldrM
695+ , benchFold "mapM" (mapM 1) (unfoldrM streamLen)
454− , benchFold "mapMSerial" (mapMSerial 1) sourceUnfoldrM
696+ , benchFold "mapMSerial" (mapMSerial 1) (unfoldrM streamLen)
455− -- , benchFoldSrcK "concatMap" concatMap
456− , benchFold "concatMapNxN" (concatMap 1) (sourceUnfoldrMN value2)
457− , benchFold "concatMapPureNxN" (concatMap 1) (sourceUnfoldrN value2)
458− , benchFold "concatMapRepl4xN" concatMapRepl4xN
459− (sourceUnfoldrMN (value `div` 4))
699+o_1_space_transformationX4 :: Int -> Benchmark
700+o_1_space_transformationX4 streamLen =
461− , bgroup "transformationX4"
701+ bgroup "transformationX4"
462− [ benchFold "scan" (scan 4) sourceUnfoldrM
702+ [ benchFold "scanl'" (scanl' 4) (unfoldrM streamLen)
463− , benchFold "map" (map 4) sourceUnfoldrM
703+ , benchFold "map" (map 4) (unfoldrM streamLen)
464− , benchFold "fmap" (fmapK 4) sourceUnfoldrM
704+ , benchFold "fmap" (fmapK 4) (unfoldrM streamLen)
465− , benchFold "mapM" (mapM 4) sourceUnfoldrM
705+ , benchFold "mapM" (mapM 4) (unfoldrM streamLen)
466− , benchFold "mapMSerial" (mapMSerial 4) sourceUnfoldrM
706+ , benchFold "mapMSerial" (mapMSerial 4) (unfoldrM streamLen)
467 -- XXX this is horribly slow
707 -- XXX this is horribly slow
468− -- , 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 =
470− , bgroup "filtering"
713+ bgroup "concat"
471− [ benchFold "filter-even" (filterEven 1) sourceUnfoldrM
714+ [ benchIOSrc1 "concatMapPure (n of 1)"
472− , benchFold "filter-all-out" (filterAllOut 1) sourceUnfoldrM
715+ (concatMapPure streamLen 1)
473− , benchFold "filter-all-in" (filterAllIn 1) sourceUnfoldrM
716+ , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
474− , benchFold "take-all" (takeAll 1) sourceUnfoldrM
717+ (concatMapPure streamLen2 streamLen2)
475− , benchFold "takeWhile-true" (takeWhileTrue 1) sourceUnfoldrM
718+ , benchIOSrc1 "concatMapPure (1 of n)"
476− , benchFold "drop-one" (dropOne 1) sourceUnfoldrM
719+ (concatMapPure 1 streamLen)
477− , benchFold "drop-all" (dropAll 1) sourceUnfoldrM
720+
478− , benchFold "dropWhile-true" (dropWhileTrue 1) sourceUnfoldrM
721+ , benchIOSrc1 "concatMap (n of 1)"
479− , benchFold "dropWhile-false" (dropWhileFalse 1) sourceUnfoldrM
722+ (concatMap streamLen 1)
723+ , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
724+ (concatMap streamLen2 streamLen2)
725+ , benchIOSrc1 "concatMap (1 of n)"
726+ (concatMap 1 streamLen)
728+ , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
729+ (concatMapRepl streamLen2 streamLen2)
731+ -- This is for comparison with concatMapFoldableWith
732+ , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
734+ . S.concatMapWith S.append id
735+ . sourceConcatMapId streamLen)
737+ , benchIOSrc1 "concatMapBy serial (n of 1)"
738+ (concatMapBySerial streamLen 1)
739+ , benchIOSrc1 "concatMapBy serial (sqrt n of sqrt n)"
740+ (concatMapBySerial streamLen2 streamLen2)
741+ , benchIOSrc1 "concatMapBy serial (1 of n)"
742+ (concatMapBySerial 1 streamLen)
743+ , benchFold "sortBy" sortBy (unfoldrM streamLen)
481− , bgroup "filteringX4"
745+ where
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 =
482− [ benchFold "filter-even" (filterEven 4) sourceUnfoldrM
751+ [ benchFold "filter-even" (filterEven 1) (unfoldrM streamLen)
483− , benchFold "filter-all-out" (filterAllOut 4) sourceUnfoldrM
752+ , benchFold "filter-all-out" (filterAllOut streamLen 1) (unfoldrM streamLen)
484− , benchFold "filter-all-in" (filterAllIn 4) sourceUnfoldrM
753+ , benchFold "filter-all-in" (filterAllIn streamLen 1) (unfoldrM streamLen)
485− , benchFold "take-all" (takeAll 4) sourceUnfoldrM
754+ , benchFold "take-all" (takeAll streamLen 1) (unfoldrM streamLen)
486− , benchFold "takeWhile-true" (takeWhileTrue 4) sourceUnfoldrM
755+ , benchFold "takeWhile-true" (takeWhileTrue streamLen 1) (unfoldrM streamLen)
487− , benchFold "drop-one" (dropOne 4) sourceUnfoldrM
756+ , benchFold "drop-one" (dropOne 1) (unfoldrM streamLen)
488− , benchFold "drop-all" (dropAll 4) sourceUnfoldrM
757+ , benchFold "drop-all" (dropAll streamLen 1) (unfoldrM streamLen)
489− , benchFold "dropWhile-true" (dropWhileTrue 4) sourceUnfoldrM
758+ , benchFold "dropWhile-true" (dropWhileTrue streamLen 1) (unfoldrM streamLen)
490− , benchFold "dropWhile-false" (dropWhileFalse 4) sourceUnfoldrM
759+ , benchFold "dropWhile-false" (dropWhileFalse 1) (unfoldrM streamLen)
762+o_1_space_filteringX4 :: Int -> Benchmark
763+o_1_space_filteringX4 streamLen =
492− , bgroup "zipping"
764+ bgroup "filteringX4"
493− [ benchFold "zip" zip sourceUnfoldrM
765+ [ benchFold "filter-even" (filterEven 4) (unfoldrM streamLen)
766+ , benchFold "filter-all-out" (filterAllOut streamLen 4) (unfoldrM streamLen)
767+ , benchFold "filter-all-in" (filterAllIn streamLen 4) (unfoldrM streamLen)
768+ , benchFold "take-all" (takeAll streamLen 4) (unfoldrM streamLen)
769+ , benchFold "takeWhile-true" (takeWhileTrue streamLen 4) (unfoldrM streamLen)
770+ , benchFold "drop-one" (dropOne 4) (unfoldrM streamLen)
771+ , benchFold "drop-all" (dropAll streamLen 4) (unfoldrM streamLen)
772+ , benchFold "dropWhile-true" (dropWhileTrue streamLen 4) (unfoldrM streamLen)
773+ , benchFold "dropWhile-false" (dropWhileFalse 4) (unfoldrM streamLen)
776+o_1_space_zipping :: Int -> Benchmark
777+o_1_space_zipping streamLen =
495− , bgroup "mixed"
778+ bgroup "zipping"
496− [ benchFold "scan-map" (scanMap 1) sourceUnfoldrM
779+ [ benchFold "zipWith" zipWith (unfoldrM streamLen)
497− , benchFold "drop-map" (dropMap 1) sourceUnfoldrM
780+ , benchFold "zipWithM" zipWithM (unfoldrM streamLen)
498− , benchFold "drop-scan" (dropScan 1) sourceUnfoldrM
499− , benchFold "take-drop" (takeDrop 1) sourceUnfoldrM
500− , benchFold "take-scan" (takeScan 1) sourceUnfoldrM
501− , benchFold "take-map" (takeMap 1) sourceUnfoldrM
502− , benchFold "filter-drop" (filterDrop 1) sourceUnfoldrM
503− , benchFold "filter-take" (filterTake 1) sourceUnfoldrM
504− , benchFold "filter-scan" (filterScan 1) sourceUnfoldrM
505− , benchFold "filter-map" (filterMap 1) sourceUnfoldrM
783+o_1_space_mixed :: Int -> Benchmark
784+o_1_space_mixed streamLen =
786+ [ benchFold "scan-map" (scanMap 1) (unfoldrM streamLen)
787+ , benchFold "drop-map" (dropMap 1) (unfoldrM streamLen)
788+ , benchFold "drop-scan" (dropScan 1) (unfoldrM streamLen)
789+ , benchFold "take-drop" (takeDrop streamLen 1) (unfoldrM streamLen)
790+ , benchFold "take-scan" (takeScan streamLen 1) (unfoldrM streamLen)
791+ , benchFold "take-map" (takeMap streamLen 1) (unfoldrM streamLen)
792+ , benchFold "filter-drop" (filterDrop streamLen 1) (unfoldrM streamLen)
793+ , benchFold "filter-take" (filterTake streamLen 1) (unfoldrM streamLen)
794+ , benchFold "filter-scan" (filterScan 1) (unfoldrM streamLen)
795+ , benchFold "filter-map" (filterMap streamLen 1) (unfoldrM streamLen)
798+o_1_space_mixedX2 :: Int -> Benchmark
799+o_1_space_mixedX2 streamLen =
507− , bgroup "mixedX2"
800+ bgroup "mixedX2"
508− [ benchFold "scan-map" (scanMap 2) sourceUnfoldrM
801+ [ benchFold "scan-map" (scanMap 2) (unfoldrM streamLen)
509− , benchFold "drop-map" (dropMap 2) sourceUnfoldrM
802+ , benchFold "drop-map" (dropMap 2) (unfoldrM streamLen)
510− , benchFold "drop-scan" (dropScan 2) sourceUnfoldrM
803+ , benchFold "drop-scan" (dropScan 2) (unfoldrM streamLen)
511− , benchFold "take-drop" (takeDrop 2) sourceUnfoldrM
804+ , benchFold "take-drop" (takeDrop streamLen 2) (unfoldrM streamLen)
512− , benchFold "take-scan" (takeScan 2) sourceUnfoldrM
805+ , benchFold "take-scan" (takeScan streamLen 2) (unfoldrM streamLen)
513− , benchFold "take-map" (takeMap 2) sourceUnfoldrM
806+ , benchFold "take-map" (takeMap streamLen 2) (unfoldrM streamLen)
514− , benchFold "filter-drop" (filterDrop 2) sourceUnfoldrM
807+ , benchFold "filter-drop" (filterDrop streamLen 2) (unfoldrM streamLen)
515− , benchFold "filter-take" (filterTake 2) sourceUnfoldrM
808+ , benchFold "filter-take" (filterTake streamLen 2) (unfoldrM streamLen)
516− , benchFold "filter-scan" (filterScan 2) sourceUnfoldrM
809+ , benchFold "filter-scan" (filterScan 2) (unfoldrM streamLen)
517− , 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 =
519− , bgroup "mixedX4"
815+ bgroup "mixedX4"
520− [ benchFold "scan-map" (scanMap 4) sourceUnfoldrM
816+ [ benchFold "scan-map" (scanMap 4) (unfoldrM streamLen)
521− , benchFold "drop-map" (dropMap 4) sourceUnfoldrM
817+ , benchFold "drop-map" (dropMap 4) (unfoldrM streamLen)
522− , benchFold "drop-scan" (dropScan 4) sourceUnfoldrM
818+ , benchFold "drop-scan" (dropScan 4) (unfoldrM streamLen)
523− , benchFold "take-drop" (takeDrop 4) sourceUnfoldrM
819+ , benchFold "take-drop" (takeDrop streamLen 4) (unfoldrM streamLen)
524− , benchFold "take-scan" (takeScan 4) sourceUnfoldrM
820+ , benchFold "take-scan" (takeScan streamLen 4) (unfoldrM streamLen)
525− , benchFold "take-map" (takeMap 4) sourceUnfoldrM
821+ , benchFold "take-map" (takeMap streamLen 4) (unfoldrM streamLen)
526− , benchFold "filter-drop" (filterDrop 4) sourceUnfoldrM
822+ , benchFold "filter-drop" (filterDrop streamLen 4) (unfoldrM streamLen)
527− , benchFold "filter-take" (filterTake 4) sourceUnfoldrM
823+ , benchFold "filter-take" (filterTake streamLen 4) (unfoldrM streamLen)
528− , benchFold "filter-scan" (filterScan 4) sourceUnfoldrM
824+ , benchFold "filter-scan" (filterScan 4) (unfoldrM streamLen)
529− , 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
534−o_n_heap :: [Benchmark]
865+o_n_heap :: Int -> Benchmark
535−o_n_heap =
866+o_n_heap streamLen =
536− [ bgroup (o_n_heap_prefix moduleName)
867+ bgroup (o_n_heap_prefix moduleName)
537 [ bgroup "transformation"
868 [ bgroup "transformation"
538− [ benchFold "foldlS" (foldlS 1) sourceUnfoldrM
869+ [ benchFold "foldlS" (foldlS 1) (unfoldrM streamLen)
543{-# INLINE benchK #-}
873{-# INLINE benchK #-}
544benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
874benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
545−benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= toNull . f
875+benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= drain . f
547−o_n_stack :: [Benchmark]
877+o_n_stack :: Int -> Int -> Int -> Benchmark
548−o_n_stack =
878+o_n_stack streamLen iterStreamLen maxIters =
549− [ bgroup (o_n_stack_prefix moduleName)
879+ bgroup (o_n_stack_prefix moduleName)
550 [ bgroup "elimination"
880 [ bgroup "elimination"
551− [ benchFold "tail" tail sourceUnfoldrM
881+ [ benchFold "tail" tail (unfoldrM streamLen)
552− , benchFold "nullTail" nullTail sourceUnfoldrM
882+ , benchFold "nullTail" nullTail (unfoldrM streamLen)
553− , benchFold "headTail" headTail sourceUnfoldrM
883+ , benchFold "headTail" headTail (unfoldrM streamLen)
555 , bgroup "transformation"
885 , bgroup "transformation"
557 -- XXX why do these need so much stack
887 -- XXX why do these need so much stack
558− benchFold "intersperse" (intersperse 1) (sourceUnfoldrMN value2)
888+ benchFold "intersperse" (intersperse streamLen 1) (unfoldrM streamLen2)
559− , benchFold "interspersePure" (intersperse 1) (sourceUnfoldrN value2)
889+ , benchFold "interspersePure" (intersperse streamLen 1) (unfoldr streamLen2)
561 , bgroup "transformationX4"
891 , bgroup "transformationX4"
563− benchFold "intersperse" (intersperse 4) (sourceUnfoldrMN value16)
893+ benchFold "intersperse" (intersperse streamLen 4) (unfoldrM streamLen16)
565 , bgroup "iterated"
895 , bgroup "iterated"
566− [ benchK "mapM" iterateMapM
896+ [ benchK "mapM" (iterateMapM iterStreamLen maxIters)
567− , benchK "scan(1/10)" iterateScan
897+ , benchK "scan(1/10)" (iterateScan iterStreamLen maxIters)
568− , benchK "filterEven" iterateFilterEven
898+ , benchK "filterEven" (iterateFilterEven iterStreamLen maxIters)
569− , benchK "takeAll" iterateTakeAll
899+ , benchK "takeAll" (iterateTakeAll streamLen iterStreamLen maxIters)
570− , benchK "dropOne" iterateDropOne
900+ , benchK "dropOne" (iterateDropOne iterStreamLen maxIters)
571− , benchK "dropWhileFalse(1/10)" iterateDropWhileFalse
901+ , benchK "dropWhileFalse(1/10)" (iterateDropWhileFalse streamLen iterStreamLen maxIters)
572− , 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
577−o_n_space :: [Benchmark]
909+o_n_space :: Int -> Benchmark
578−o_n_space =
910+o_n_space streamLen =
579− [ bgroup (o_n_space_prefix moduleName)
911+ bgroup (o_n_space_prefix moduleName)
580 [ bgroup "elimination"
912 [ bgroup "elimination"
581− [ benchFold "toList" toList sourceUnfoldrM
913+ [ benchFold "toList" toList (unfoldrM streamLen)
586{-# INLINE benchList #-}
917{-# INLINE benchList #-}
587benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
918benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
588benchList 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
590−o_1_space_list :: [Benchmark]
921+main :: IO ()
591−o_1_space_list =
922+main =
592− [ bgroup "list"
923+ defaultMain
593− [ bgroup "elimination"
924+ [ o_1_space streamLen
594− [ benchList "last" (\xs -> [List.last xs]) (sourceUnfoldrList value)
925+ , o_n_stack streamLen iterStreamLen maxIters
595− ]
926+ , o_n_heap streamLen
596− , bgroup "nested"
927+ , o_n_space streamLen
597− [ benchList "toNullAp" toNullApNestedList (sourceUnfoldrList value2)
598− , benchList "toNull" toNullNestedList (sourceUnfoldrList value2)
599− , benchList "toNull3" toNullNestedList3 (sourceUnfoldrList value3)
600− , benchList "filterAllIn" filterAllInNestedList (sourceUnfoldrList value2)
601− , benchList "filterAllOut" filterAllOutNestedList (sourceUnfoldrList value2)
606−main :: IO ()
930+ where
607−main = defaultMain $ concat
931+
608− [ o_1_space
932+ streamLen = 100000
609− , [bgroup (o_1_space_prefix moduleName) o_1_space_list]
933+ maxIters = 10000
610− , o_n_stack
934+ iterStreamLen = 10