@@ -1,207 +1,132 @@
11-- |
22-- Module : Streamly.Benchmark.Data.Stream.StreamK
3−-- Copyright : (c) 2018 Composewell Technologies
3+-- Copyright : (c) 2018 Harendra Kumar
44--
55-- License : BSD3
66-- Maintainer : streamly@composewell.com
77
8−{-# LANGUAGE CPP #-}
98{-# LANGUAGE FlexibleContexts #-}
109{-# LANGUAGE ScopedTypeVariables #-}
11−{-# OPTIONS_GHC -Wno-orphans #-}
12−
13−#ifdef __HADDOCK_VERSION__
14−#undef INSPECTION
15−#endif
16−
17−#ifdef INSPECTION
18−{-# LANGUAGE TemplateHaskell #-}
19−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
20−#endif
2110
2211module Main (main) where
2312
24−#if !MIN_VERSION_base(4,18,0)
25−import Control.Applicative (liftA2)
26−#endif
2713import Control.Monad (when)
2814import Data.Maybe (isJust)
2915import System.Random (randomRIO)
3016import Prelude hiding
31− ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
32− , repeat, replicate
33− )
17+ (tail, mapM_, foldl, last, map, mapM, concatMap, zip, init)
3418
3519import qualified Prelude as P
3620import qualified Data.List as List
3721
38−import qualified Streamly.Internal.Data.StreamK as S
22+import qualified Streamly.Internal.Data.Stream.StreamK as S
23+import qualified Streamly.Internal.Data.Stream.Prelude as SP
24+import qualified Streamly.Internal.Data.SVar as S
3925
40−import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
26+import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
4127
4228import Streamly.Benchmark.Common
4329
44−#ifdef INSPECTION
45−import Test.Inspection
46−#endif
47−
48−{-
49−
50−Benchmarks that need to be added
51−
52−-- fromList
53−
54−-- bindWith
55−-- concatPairsWith
56−-- apWith
57−-- apSerial
58−-- apSerialDiscardFst
59−-- apSerialDiscardSnd
60−
61−-- the
62−-- serial
63−-- consMStream
64−-- withLocal
65−-- mfix
66−
67−-- elem
68−-- notElem
69−-- all
70−-- any
71−-- minimum
72−-- minimumBy
73−-- maximum
74−-- maximumBy
75−-- findIndices
76−-- lookup
77−-- findM
78−-- find
79−-- (!!)
80−
81−-- foldlM'
82−-- foldlT
83−-- foldlx'
84−-- foldlMx'
85−-- fold
86−
87−-- sequence
88−
89−-- foldrSM
90−-- buildS
91−-- buildM
92−-- augmentS
93−-- augmentSM
94−-- foldr
95−-- foldr1
96−-- foldrM
97−-- foldrT
98−
99−-- intersperseM
100−-- insertBy
101−-- deleteBy
102−-- reverse
103−-- mapMaybe
104−
105−-- zipWithM
106−-- mergeBy
107−-- mergeByM
108−
109−-- toStreamK (Probably can be skipped)
110−-- hoist
111−
112−-- scanlx'
113−
114−-}
30+value, value2, value3, value16, maxValue :: Int
31+value = 100000
32+value2 = round (P.fromIntegral value**(1/2::P.Double)) -- double nested loop
33+value3 = round (P.fromIntegral value**(1/3::P.Double)) -- triple nested loop
34+value16 = round (P.fromIntegral value**(1/16::P.Double)) -- triple nested loop
35+maxValue = value
36+
37+-------------------------------------------------------------------------------
38+-- Benchmark ops
39+-------------------------------------------------------------------------------
40+
41+{-# INLINE toNull #-}
42+{-# INLINE uncons #-}
43+{-# INLINE nullTail #-}
44+{-# INLINE headTail #-}
45+{-# INLINE zip #-}
46+toNull, uncons, nullTail, headTail, zip
47+ :: Monad m
48+ => Stream m Int -> m ()
49+
50+{-# INLINE toList #-}
51+toList :: Monad m => Stream m Int -> m [Int]
52+{-# INLINE foldl #-}
53+foldl :: Monad m => Stream m Int -> m Int
54+{-# INLINE last #-}
55+last :: Monad m => Stream m Int -> m (Maybe Int)
11556
11657-------------------------------------------------------------------------------
11758-- Stream generation and elimination
11859-------------------------------------------------------------------------------
11960
120−type Stream m a = S.StreamK m a
61+type Stream m a = S.Stream m a
12162
122−{-# INLINE unfoldr #-}
123−unfoldr :: Int -> Int -> Stream m Int
124−unfoldr streamLen n = S.unfoldr step n
63+{-# INLINE sourceUnfoldr #-}
64+sourceUnfoldr :: Int -> Stream m Int
65+sourceUnfoldr n = S.unfoldr step n
12566 where
12667 step cnt =
127− if cnt > n + streamLen
68+ if cnt > n + value
12869 then Nothing
12970 else Just (cnt, cnt + 1)
13071
131−{-# INLINE unfoldrM #-}
132−unfoldrM :: Monad m => Int -> Int -> Stream m Int
133−unfoldrM streamLen n = S.unfoldrMWith S.consM step n
72+{-# INLINE sourceUnfoldrN #-}
73+sourceUnfoldrN :: Int -> Int -> Stream m Int
74+sourceUnfoldrN m n = S.unfoldr step n
13475 where
13576 step cnt =
136− if cnt > n + streamLen
77+ if cnt > n + m
78+ then Nothing
79+ else Just (cnt, cnt + 1)
80+
81+{-# INLINE sourceUnfoldrM #-}
82+sourceUnfoldrM :: S.MonadAsync m => Int -> Stream m Int
83+sourceUnfoldrM n = S.unfoldrM step n
84+ where
85+ step cnt =
86+ if cnt > n + value
13787 then return Nothing
13888 else return (Just (cnt, cnt + 1))
13989
140−{-# INLINE repeat #-}
141−repeat :: Int -> Int -> Stream m Int
142−repeat streamLen = S.take streamLen . S.repeat
143−
144−{-# INLINE repeatM #-}
145−repeatM :: Monad m => Int -> Int -> Stream m Int
146−repeatM streamLen = S.take streamLen . S.repeatM . return
147−
148−{-# INLINE replicate #-}
149−replicate :: Int -> Int -> Stream m Int
150−replicate = S.replicate
151−
152−{-# INLINE replicateM #-}
153−replicateM :: Monad m => Int -> Int -> Stream m Int
154−replicateM streamLen = S.replicateMWith S.consM streamLen . return
155−
156−{-# INLINE iterate #-}
157−iterate :: Int -> Int -> Stream m Int
158−iterate streamLen = S.take streamLen . S.iterate (+1)
159−
160−{-# INLINE iterateM #-}
161−iterateM :: Monad m => Int -> Int -> Stream m Int
162−iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
163−
164−{-# INLINE fromFoldable #-}
165−fromFoldable :: Int -> Int -> Stream m Int
166−fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
167−
168−{-# INLINE fromFoldableM #-}
169−fromFoldableM :: Monad m => Int -> Int -> Stream m Int
170−fromFoldableM streamLen n =
171− List.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
172−
173−{-# INLINABLE concatMapFoldableWith #-}
174−concatMapFoldableWith :: P.Foldable f
175− => (Stream m b -> Stream m b -> Stream m b)
176− -> (a -> Stream m b)
177− -> f a
178− -> Stream m b
179−concatMapFoldableWith f g = P.foldr (f . g) S.nil
180−
181−{-# INLINE concatMapFoldableSerial #-}
182−concatMapFoldableSerial :: Int -> Int -> Stream m Int
183−concatMapFoldableSerial streamLen n =
184− concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
185−
186−{-# INLINE concatMapFoldableSerialM #-}
187−concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
188−concatMapFoldableSerialM streamLen n =
189− concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
90+{-# INLINE sourceUnfoldrMN #-}
91+sourceUnfoldrMN :: S.MonadAsync m => Int -> Int -> Stream m Int
92+sourceUnfoldrMN m n = S.unfoldrM step n
93+ where
94+ step cnt =
95+ if cnt > n + m
96+ then return Nothing
97+ else return (Just (cnt, cnt + 1))
98+
99+{-# INLINE sourceFromFoldable #-}
100+sourceFromFoldable :: Int -> Stream m Int
101+sourceFromFoldable n = S.fromFoldable [n..n+value]
102+
103+{-# INLINE sourceFromFoldableM #-}
104+sourceFromFoldableM :: S.MonadAsync m => Int -> Stream m Int
105+sourceFromFoldableM n =
106+ Prelude.foldr S.consM S.nil (Prelude.fmap return [n..n+value])
107+
108+{-# INLINE sourceFoldMapWith #-}
109+sourceFoldMapWith :: Int -> Stream m Int
110+sourceFoldMapWith n = SP.foldMapWith S.serial S.yield [n..n+value]
111+
112+{-# INLINE sourceFoldMapWithM #-}
113+sourceFoldMapWithM :: Monad m => Int -> Stream m Int
114+sourceFoldMapWithM n = SP.foldMapWith S.serial (S.yieldM . return) [n..n+value]
190115
191116-------------------------------------------------------------------------------
192117-- Elimination
193118-------------------------------------------------------------------------------
194119
195−{-# INLINE drain #-}
196−drain :: Monad m => Stream m a -> m ()
197−drain = S.drain
120+{-# INLINE runStream #-}
121+runStream :: Monad m => Stream m a -> m ()
122+runStream = S.drain
123+-- runStream = S.mapM_ (\_ -> return ())
198124
199125{-# INLINE mapM_ #-}
200126mapM_ :: Monad m => Stream m a -> m ()
201127mapM_ = S.mapM_ (\_ -> return ())
202128
203−{-# INLINE uncons #-}
204−uncons :: Monad m => Stream m Int -> m ()
129+toNull = runStream
205130uncons s = do
206131 r <- S.uncons s
207132 case r of
@@ -209,350 +134,205 @@ uncons s = do
209134 Just (_, t) -> uncons t
210135
211136{-# INLINE init #-}
212−init :: Monad m => Stream m a -> m ()
137+init :: (Monad m, S.IsStream t) => t m a -> m ()
213138init s = do
214139 t <- S.init s
215140 P.mapM_ S.drain t
216141
217142{-# INLINE tail #-}
218−tail :: Monad m => Stream m a -> m ()
143+tail :: (Monad m, S.IsStream t) => t m a -> m ()
219144tail s = S.tail s >>= P.mapM_ tail
220145
221−{-# INLINE nullTail #-}
222−nullTail :: Monad m => Stream m Int -> m ()
223146nullTail s = do
224147 r <- S.null s
225148 when (not r) $ S.tail s >>= P.mapM_ nullTail
226149
227−{-# INLINE headTail #-}
228−headTail :: Monad m => Stream m Int -> m ()
229150headTail s = do
230151 h <- S.head s
231152 when (isJust h) $ S.tail s >>= P.mapM_ headTail
232153
233−{-# INLINE toList #-}
234−toList :: Monad m => Stream m Int -> m [Int]
235154toList = S.toList
236−
237−{-# INLINE foldl' #-}
238−foldl' :: Monad m => Stream m Int -> m Int
239−foldl' = S.foldl' (+) 0
240−
241−{-# INLINE last #-}
242−last :: Monad m => Stream m Int -> m (Maybe Int)
243−last = S.last
155+foldl = S.foldl' (+) 0
156+last = S.last
244157
245158-------------------------------------------------------------------------------
246159-- Transformation
247160-------------------------------------------------------------------------------
248161
162+{-# INLINE transform #-}
163+transform :: Monad m => Stream m a -> m ()
164+transform = runStream
165+
249166{-# INLINE composeN #-}
250167composeN
251168 :: Monad m
252169 => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
253170composeN n f =
254171 case n of
255− 1 -> drain . f
256− 2 -> drain . f . f
257− 3 -> drain . f . f . f
258− 4 -> drain . f . f . f . f
172+ 1 -> transform . f
173+ 2 -> transform . f . f
174+ 3 -> transform . f . f . f
175+ 4 -> transform . f . f . f . f
259176 _ -> undefined
260177
261−{-# INLINE scanl' #-}
262−scanl' :: Monad m => Int -> Stream m Int -> m ()
263−scanl' n = composeN n $ S.scanl' (+) 0
264−
178+{-# INLINE scan #-}
265179{-# INLINE map #-}
266−map :: Monad m => Int -> Stream m Int -> m ()
267−map n = composeN n $ S.map (+ 1)
268−
269180{-# INLINE fmapK #-}
270−fmapK :: Monad m => Int -> Stream m Int -> m ()
271−fmapK n = composeN n $ P.fmap (+ 1)
272−
273−{-# INLINE mapM #-}
274−mapM :: Monad m => Int -> Stream m Int -> m ()
275−mapM n = composeN n $ S.mapMWith S.consM return
276−
277−{-# INLINE mapMSerial #-}
278−mapMSerial :: Monad m => Int -> Stream m Int -> m ()
279−mapMSerial n = composeN n $ S.mapMSerial return
280−
281181{-# INLINE filterEven #-}
282−filterEven :: Monad m => Int -> Stream m Int -> m ()
283−filterEven n = composeN n $ S.filter even
284−
285182{-# INLINE filterAllOut #-}
286−filterAllOut :: Monad m => Int -> Int -> Stream m Int -> m ()
287−filterAllOut streamLen n = composeN n $ S.filter (> streamLen)
288−
289183{-# INLINE filterAllIn #-}
290−filterAllIn :: Monad m => Int -> Int -> Stream m Int -> m ()
291−filterAllIn streamLen n = composeN n $ S.filter (<= streamLen)
292−
293184{-# INLINE _takeOne #-}
294−_takeOne :: Monad m => Int -> Stream m Int -> m ()
295−_takeOne n = composeN n $ S.take 1
296−
297185{-# INLINE takeAll #-}
298−takeAll :: Monad m => Int -> Int -> Stream m Int -> m ()
299−takeAll streamLen n = composeN n $ S.take streamLen
300−
301186{-# INLINE takeWhileTrue #-}
302−takeWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
303−takeWhileTrue streamLen n = composeN n $ S.takeWhile (<= streamLen)
304−
305187{-# INLINE dropOne #-}
306−dropOne :: Monad m => Int -> Stream m Int -> m ()
307−dropOne n = composeN n $ S.drop 1
308−
309188{-# INLINE dropAll #-}
310−dropAll :: Monad m => Int -> Int -> Stream m Int -> m ()
311−dropAll streamLen n = composeN n $ S.drop streamLen
312−
313189{-# INLINE dropWhileTrue #-}
314−dropWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
315−dropWhileTrue streamLen n = composeN n $ S.dropWhile (<= streamLen)
316−
317190{-# INLINE dropWhileFalse #-}
318−dropWhileFalse :: Monad m => Int -> Stream m Int -> m ()
319−dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
320−
321191{-# INLINE foldrS #-}
322−foldrS :: Monad m => Int -> Stream m Int -> m ()
323−foldrS n = composeN n $ S.foldrS S.cons S.nil
324−
325192{-# INLINE foldlS #-}
326−foldlS :: Monad m => Int -> Stream m Int -> m ()
327−foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
193+{-# INLINE concatMap #-}
194+scan, map, fmapK, filterEven, filterAllOut,
195+ filterAllIn, _takeOne, takeAll, takeWhileTrue, dropAll, dropOne,
196+ dropWhileTrue, dropWhileFalse, foldrS, foldlS, concatMap
197+ :: Monad m
198+ => Int -> Stream m Int -> m ()
328199
200+{-# INLINE mapM #-}
201+{-# INLINE mapMSerial #-}
329202{-# INLINE intersperse #-}
330−intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
331−intersperse streamLen n = composeN n $ S.intersperse streamLen
203+mapM, mapMSerial, intersperse
204+ :: S.MonadAsync m => Int -> Stream m Int -> m ()
205+
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
332227
333228-------------------------------------------------------------------------------
334229-- Iteration
335230-------------------------------------------------------------------------------
336231
232+iterStreamLen, maxIters :: Int
233+iterStreamLen = 10
234+maxIters = 10000
235+
337236{-# INLINE iterateSource #-}
338237iterateSource
339− :: Monad m => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
340−iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
238+ :: S.MonadAsync m
239+ => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
240+iterateSource g i n = f i (sourceUnfoldrMN iterStreamLen n)
341241 where
342242 f (0 :: Int) m = g m
343243 f x m = g (f (x P.- 1) m)
344244
345−-- this is quadratic
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)
350−
351−-- this is quadratic
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)
356−
357245{-# INLINE iterateMapM #-}
358−iterateMapM :: Monad m => Int -> Int -> Int -> Stream m Int
359−iterateMapM iterStreamLen =
360− iterateSource iterStreamLen (S.mapMWith S.consM return)
361−
246+{-# INLINE iterateScan #-}
362247{-# INLINE iterateFilterEven #-}
363−iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
364−iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
365−
366248{-# INLINE iterateTakeAll #-}
367−iterateTakeAll :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
368−iterateTakeAll streamLen iterStreamLen =
369− iterateSource iterStreamLen (S.take streamLen)
370−
371249{-# INLINE iterateDropOne #-}
372−iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
373−iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
374−
250+{-# INLINE iterateDropWhileFalse #-}
375251{-# INLINE iterateDropWhileTrue #-}
376−iterateDropWhileTrue ::
377− Monad m => Int -> Int -> Int -> Int -> Stream m Int
378−iterateDropWhileTrue streamLen iterStreamLen =
379− iterateSource iterStreamLen (S.dropWhile (<= streamLen))
252+iterateMapM, iterateScan, iterateFilterEven, iterateTakeAll, iterateDropOne,
253+ iterateDropWhileFalse, iterateDropWhileTrue
254+ :: S.MonadAsync m
255+ => Int -> Stream m Int
380256
381−-------------------------------------------------------------------------------
382−-- Zipping
383−-------------------------------------------------------------------------------
257+-- this is quadratic
258+iterateScan = iterateSource (S.scanl' (+) 0) (maxIters `div` 10)
259+iterateDropWhileFalse = iterateSource (S.dropWhile (> maxValue))
260+ (maxIters `div` 10)
384261
385−{-# INLINE zipWith #-}
386−zipWith :: Monad m => Stream m Int -> m ()
387−zipWith src = drain $ S.zipWith (,) src src
262+iterateMapM = iterateSource (S.mapM return) maxIters
263+iterateFilterEven = iterateSource (S.filter even) maxIters
264+iterateTakeAll = iterateSource (S.take maxValue) maxIters
265+iterateDropOne = iterateSource (S.drop 1) maxIters
266+iterateDropWhileTrue = iterateSource (S.dropWhile (<= maxValue)) maxIters
388267
389−{-# INLINE zipWithM #-}
390−zipWithM :: Monad m => Stream m Int -> m ()
391−zipWithM src = drain $ S.zipWithM (curry return) src src
268+-------------------------------------------------------------------------------
269+-- Zipping and concat
270+-------------------------------------------------------------------------------
392271
393−{-# INLINE sortByK #-}
394−sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
395−sortByK f = S.mergeMapWith (S.mergeBy f) S.fromPure
272+zip src = transform $ S.zipWith (,) src src
396273
397−{-# INLINE sortBy #-}
398−sortBy :: Monad m => Stream m Int -> m ()
399−sortBy = drain . sortByK compare
274+{-# INLINE concatMapRepl4xN #-}
275+concatMapRepl4xN :: Monad m => Stream m Int -> m ()
276+concatMapRepl4xN src = transform $ (S.concatMap (S.replicate 4) src)
400277
401278-------------------------------------------------------------------------------
402279-- Mixed Composition
403280-------------------------------------------------------------------------------
404281
405282{-# INLINE scanMap #-}
406−scanMap :: Monad m => Int -> Stream m Int -> m ()
407−scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
408−
409283{-# INLINE dropMap #-}
410−dropMap :: Monad m => Int -> Stream m Int -> m ()
411−dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
412−
413284{-# INLINE dropScan #-}
414−dropScan :: Monad m => Int -> Stream m Int -> m ()
415−dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
416−
417285{-# INLINE takeDrop #-}
418−takeDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
419−takeDrop streamLen n = composeN n $ S.drop 1 . S.take streamLen
420−
421286{-# INLINE takeScan #-}
422−takeScan :: Monad m => Int -> Int -> Stream m Int -> m ()
423−takeScan streamLen n = composeN n $ S.scanl' (+) 0 . S.take streamLen
424−
425287{-# 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
428−
429288{-# INLINE filterDrop #-}
430−filterDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
431−filterDrop streamLen n = composeN n $ S.drop 1 . S.filter (<= streamLen)
432−
433289{-# INLINE filterTake #-}
434−filterTake :: Monad m => Int -> Int -> Stream m Int -> m ()
435−filterTake streamLen n = composeN n $ S.take streamLen . S.filter (<= streamLen)
436−
437290{-# INLINE filterScan #-}
438−filterScan :: Monad m => Int -> Stream m Int -> m ()
439−filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
440−
441291{-# INLINE filterMap #-}
442−filterMap :: Monad m => Int -> Int -> Stream m Int -> m ()
443−filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen)
444−
445−-------------------------------------------------------------------------------
446−-- ConcatMap
447−-------------------------------------------------------------------------------
448−
449−-- concatMap unfoldrM/unfoldrM
450−
451−{-# INLINE concatMap #-}
452−concatMap :: Int -> Int -> Int -> IO ()
453−concatMap outer inner n =
454− S.drain $ S.concatMap
455− (\_ -> unfoldrM inner n)
456− (unfoldrM outer n)
457−
458−#ifdef INSPECTION
459−inspect $ hasNoTypeClasses 'concatMap
460−#endif
461−
462−-- concatMap unfoldr/unfoldr
463−
464−{-# INLINE concatMapPure #-}
465−concatMapPure :: Int -> Int -> Int -> IO ()
466−concatMapPure outer inner n =
467− S.drain $ S.concatMap
468− (\_ -> unfoldr inner n)
469− (unfoldr outer n)
470−
471−#ifdef INSPECTION
472−inspect $ hasNoTypeClasses 'concatMapPure
473−#endif
474−
475−-- concatMap replicate/unfoldrM
476−
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)
481−
482−#ifdef INSPECTION
483−inspect $ hasNoTypeClasses 'concatMapRepl
484−#endif
485−
486−-- concatMapWith
487−
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]
493−
494−{-# INLINE concatMapBySerial #-}
495−concatMapBySerial :: Int -> Int -> Int -> IO ()
496−concatMapBySerial outer inner n =
497− S.drain $ S.concatMapWith S.append
498− (unfoldrM inner)
499− (unfoldrM outer n)
292+scanMap, dropMap, dropScan, takeDrop, takeScan, takeMap, filterDrop,
293+ filterTake, filterScan, filterMap
294+ :: Monad m => Int -> Stream m Int -> m ()
295+
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)
304+filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
305+filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
500306
501307-------------------------------------------------------------------------------
502308-- Nested Composition
503309-------------------------------------------------------------------------------
504310
505−instance Monad m => Applicative (S.StreamK m) where
506− {-# INLINE pure #-}
507− pure = S.fromPure
508−
509− {-# INLINE (<*>) #-}
510− (<*>) = S.crossApply
511−
512− {-# INLINE liftA2 #-}
513− liftA2 f x = (<*>) (fmap f x)
514−
515− {-# INLINE (*>) #-}
516− (*>) = S.crossApplySnd
517−
518− {-# INLINE (<*) #-}
519− (<*) = S.crossApplyFst
520−
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
523−-- fusion.
524−instance Monad m => Monad (S.StreamK m) where
525− {-# INLINE return #-}
526− return = pure
527−
528− {-# INLINE (>>=) #-}
529− (>>=) = flip S.concatMap
530−
531−{-# INLINE drainApplicative #-}
532−drainApplicative :: Monad m => Stream m Int -> m ()
533−drainApplicative s = drain $ do
311+{-# INLINE toNullApNested #-}
312+toNullApNested :: Monad m => Stream m Int -> m ()
313+toNullApNested s = runStream $ do
534314 (+) <$> s <*> s
535315
536−{-# INLINE drainMonad #-}
537−drainMonad :: Monad m => Stream m Int -> m ()
538−drainMonad s = drain $ do
316+{-# INLINE toNullNested #-}
317+toNullNested :: Monad m => Stream m Int -> m ()
318+toNullNested s = runStream $ do
539319 x <- s
540320 y <- s
541321 return $ x + y
542322
543−{-# INLINE drainMonad3 #-}
544−drainMonad3 :: Monad m => Stream m Int -> m ()
545−drainMonad3 s = drain $ do
323+{-# INLINE toNullNested3 #-}
324+toNullNested3 :: Monad m => Stream m Int -> m ()
325+toNullNested3 s = runStream $ do
546326 x <- s
547327 y <- s
548328 z <- s
549329 return $ x + y + z
550330
551−{-# INLINE filterAllOutMonad #-}
552−filterAllOutMonad
331+{-# INLINE filterAllOutNested #-}
332+filterAllOutNested
553333 :: Monad m
554334 => Stream m Int -> m ()
555−filterAllOutMonad str = drain $ do
335+filterAllOutNested str = runStream $ do
556336 x <- str
557337 y <- str
558338 let s = x + y
@@ -560,11 +340,11 @@ filterAllOutMonad str = drain $ do
560340 then return s
561341 else S.nil
562342
563−{-# INLINE filterAllInMonad #-}
564−filterAllInMonad
343+{-# INLINE filterAllInNested #-}
344+filterAllInNested
565345 :: Monad m
566346 => Stream m Int -> m ()
567−filterAllInMonad str = drain $ do
347+filterAllInNested str = runStream $ do
568348 x <- str
569349 y <- str
570350 let s = x + y
@@ -576,14 +356,9 @@ filterAllInMonad str = drain $ do
576356-- Nested Composition Pure lists
577357-------------------------------------------------------------------------------
578358
579−-- There are several list benchmarks here for comparison with lists. It is easy
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.
583−
584−{-# INLINE unfoldrList #-}
585−unfoldrList :: Int -> Int -> [Int]
586−unfoldrList maxval n = List.unfoldr step n
359+{-# INLINE sourceUnfoldrList #-}
360+sourceUnfoldrList :: Int -> Int -> [Int]
361+sourceUnfoldrList maxval n = List.unfoldr step n
587362 where
588363 step cnt =
589364 if cnt > n + maxval
@@ -634,301 +409,205 @@ filterAllInNestedList str = do
634409-------------------------------------------------------------------------------
635410
636411moduleName :: String
637−moduleName = "Data.StreamK"
638−
639−o_1_space_generation :: Int -> Benchmark
640−o_1_space_generation streamLen =
641− bgroup "generation"
642− [ benchFold "unfoldr" drain (unfoldr streamLen)
643− , benchFold "unfoldrM" drain (unfoldrM streamLen)
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)
650−
651− , benchFold "fromFoldable" drain (fromFoldable streamLen)
652− , benchFold "fromFoldableM" drain (fromFoldableM streamLen)
412+moduleName = "Data.Stream.StreamK"
413+
414+o_1_space :: [Benchmark]
415+o_1_space =
416+ [ bgroup (o_1_space_prefix moduleName)
417+ [ bgroup "generation"
418+ [ benchFold "unfoldr" toNull sourceUnfoldr
419+ , benchFold "unfoldrM" toNull sourceUnfoldrM
420+
421+ , benchFold "fromFoldable" toNull sourceFromFoldable
422+ , benchFold "fromFoldableM" toNull sourceFromFoldableM
653423
654424 -- appends
655− , benchFold "concatMapFoldableWith" drain (concatMapFoldableSerial streamLen)
656− , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
425+ , benchFold "foldMapWith" toNull sourceFoldMapWith
426+ , benchFold "foldMapWithM" toNull sourceFoldMapWithM
657427 ]
658−
659−o_1_space_elimination :: Int -> Benchmark
660−o_1_space_elimination streamLen =
661− bgroup "elimination"
662− [ benchFold "toNull" drain (unfoldrM streamLen)
663− , benchFold "mapM_" mapM_ (unfoldrM streamLen)
664− , benchFold "uncons" uncons (unfoldrM streamLen)
665− , benchFold "init" init (unfoldrM streamLen)
666− , benchFold "foldl'" foldl' (unfoldrM streamLen)
667− , benchFold "last" last (unfoldrM streamLen)
428+ , bgroup "elimination"
429+ [ benchFold "toNull" toNull sourceUnfoldrM
430+ , benchFold "mapM_" mapM_ sourceUnfoldrM
431+ , benchFold "uncons" uncons sourceUnfoldrM
432+ , benchFold "init" init sourceUnfoldrM
433+ , benchFold "foldl'" foldl sourceUnfoldrM
434+ , benchFold "last" last sourceUnfoldrM
668435 ]
669−
670−o_1_space_nested :: Int -> Benchmark
671−o_1_space_nested streamLen =
672− bgroup "nested"
673− [ benchFold "drainApplicative" drainApplicative (unfoldrM streamLen2)
674− , benchFold "drainMonad" drainMonad (unfoldrM streamLen2)
675− , benchFold "drainMonad3" drainMonad3 (unfoldrM streamLen3)
676− , benchFold "filterAllInMonad" filterAllInMonad (unfoldrM streamLen2)
677− , benchFold "filterAllOutMonad" filterAllOutMonad (unfoldrM streamLen2)
678− , benchFold "drainApplicative (pure)" drainApplicative (unfoldr streamLen2)
679− , benchFold "drainMonad (pure)" drainMonad (unfoldr streamLen2)
680− , benchFold "drainMonad3 (pure)" drainMonad3 (unfoldr streamLen3)
681− , benchFold "filterAllInMonad (pure)" filterAllInMonad (unfoldr streamLen2)
682− , benchFold "filterAllOutMonad (pure)" filterAllOutMonad (unfoldr streamLen2)
436+ , bgroup "nested"
437+ [ benchFold "toNullAp" toNullApNested (sourceUnfoldrMN value2)
438+ , benchFold "toNull" toNullNested (sourceUnfoldrMN value2)
439+ , benchFold "toNull3" toNullNested3 (sourceUnfoldrMN value3)
440+ , benchFold "filterAllIn" filterAllInNested (sourceUnfoldrMN value2)
441+ , benchFold "filterAllOut" filterAllOutNested (sourceUnfoldrMN value2)
442+ , benchFold "toNullApPure" toNullApNested (sourceUnfoldrN value2)
443+ , benchFold "toNullPure" toNullNested (sourceUnfoldrN value2)
444+ , benchFold "toNull3Pure" toNullNested3 (sourceUnfoldrN value3)
445+ , benchFold "filterAllInPure" filterAllInNested (sourceUnfoldrN value2)
446+ , benchFold "filterAllOutPure" filterAllOutNested (sourceUnfoldrN value2)
683447 ]
684− where
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
687−
688−o_1_space_transformation :: Int -> Benchmark
689−o_1_space_transformation streamLen =
690− bgroup "transformation"
691− [ benchFold "foldrS" (foldrS 1) (unfoldrM streamLen)
692− , benchFold "scanl'" (scanl' 1) (unfoldrM streamLen)
693− , benchFold "map" (map 1) (unfoldrM streamLen)
694− , benchFold "fmap" (fmapK 1) (unfoldrM streamLen)
695− , benchFold "mapM" (mapM 1) (unfoldrM streamLen)
696− , benchFold "mapMSerial" (mapMSerial 1) (unfoldrM streamLen)
448+ , bgroup "transformation"
449+ [ benchFold "foldrS" (foldrS 1) sourceUnfoldrM
450+ , benchFold "scan" (scan 1) sourceUnfoldrM
451+ , benchFold "map" (map 1) sourceUnfoldrM
452+ , benchFold "fmap" (fmapK 1) sourceUnfoldrM
453+ , benchFold "mapM" (mapM 1) sourceUnfoldrM
454+ , benchFold "mapMSerial" (mapMSerial 1) sourceUnfoldrM
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))
697460 ]
698−
699−o_1_space_transformationX4 :: Int -> Benchmark
700−o_1_space_transformationX4 streamLen =
701− bgroup "transformationX4"
702− [ benchFold "scanl'" (scanl' 4) (unfoldrM streamLen)
703− , benchFold "map" (map 4) (unfoldrM streamLen)
704− , benchFold "fmap" (fmapK 4) (unfoldrM streamLen)
705− , benchFold "mapM" (mapM 4) (unfoldrM streamLen)
706− , benchFold "mapMSerial" (mapMSerial 4) (unfoldrM streamLen)
461+ , bgroup "transformationX4"
462+ [ benchFold "scan" (scan 4) sourceUnfoldrM
463+ , benchFold "map" (map 4) sourceUnfoldrM
464+ , benchFold "fmap" (fmapK 4) sourceUnfoldrM
465+ , benchFold "mapM" (mapM 4) sourceUnfoldrM
466+ , benchFold "mapMSerial" (mapMSerial 4) sourceUnfoldrM
707467 -- XXX this is horribly slow
708− -- , benchFold "concatMap" (concatMap 4) (unfoldrM streamLen16)
468+ -- , benchFold "concatMap" (concatMap 4) (sourceUnfoldrMN value16)
709469 ]
710−
711−o_1_space_concat :: Int -> Benchmark
712−o_1_space_concat streamLen =
713− bgroup "concat"
714− [ benchIOSrc1 "concatMapPure (n of 1)"
715− (concatMapPure streamLen 1)
716− , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
717− (concatMapPure streamLen2 streamLen2)
718− , benchIOSrc1 "concatMapPure (1 of n)"
719− (concatMapPure 1 streamLen)
720−
721− , benchIOSrc1 "concatMap (n of 1)"
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)
727−
728− , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
729− (concatMapRepl streamLen2 streamLen2)
730−
731− -- This is for comparison with concatMapFoldableWith
732− , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
733− (S.drain
734− . S.concatMapWith S.append id
735− . sourceConcatMapId streamLen)
736−
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)
470+ , bgroup "filtering"
471+ [ benchFold "filter-even" (filterEven 1) sourceUnfoldrM
472+ , benchFold "filter-all-out" (filterAllOut 1) sourceUnfoldrM
473+ , benchFold "filter-all-in" (filterAllIn 1) sourceUnfoldrM
474+ , benchFold "take-all" (takeAll 1) sourceUnfoldrM
475+ , benchFold "takeWhile-true" (takeWhileTrue 1) sourceUnfoldrM
476+ , benchFold "drop-one" (dropOne 1) sourceUnfoldrM
477+ , benchFold "drop-all" (dropAll 1) sourceUnfoldrM
478+ , benchFold "dropWhile-true" (dropWhileTrue 1) sourceUnfoldrM
479+ , benchFold "dropWhile-false" (dropWhileFalse 1) sourceUnfoldrM
744480 ]
745− where
746− streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
747−
748−o_1_space_filtering :: Int -> Benchmark
749−o_1_space_filtering streamLen =
750− bgroup "filtering"
751− [ benchFold "filter-even" (filterEven 1) (unfoldrM streamLen)
752− , benchFold "filter-all-out" (filterAllOut streamLen 1) (unfoldrM streamLen)
753− , benchFold "filter-all-in" (filterAllIn streamLen 1) (unfoldrM streamLen)
754− , benchFold "take-all" (takeAll streamLen 1) (unfoldrM streamLen)
755− , benchFold "takeWhile-true" (takeWhileTrue streamLen 1) (unfoldrM streamLen)
756− , benchFold "drop-one" (dropOne 1) (unfoldrM streamLen)
757− , benchFold "drop-all" (dropAll streamLen 1) (unfoldrM streamLen)
758− , benchFold "dropWhile-true" (dropWhileTrue streamLen 1) (unfoldrM streamLen)
759− , benchFold "dropWhile-false" (dropWhileFalse 1) (unfoldrM streamLen)
481+ , bgroup "filteringX4"
482+ [ benchFold "filter-even" (filterEven 4) sourceUnfoldrM
483+ , benchFold "filter-all-out" (filterAllOut 4) sourceUnfoldrM
484+ , benchFold "filter-all-in" (filterAllIn 4) sourceUnfoldrM
485+ , benchFold "take-all" (takeAll 4) sourceUnfoldrM
486+ , benchFold "takeWhile-true" (takeWhileTrue 4) sourceUnfoldrM
487+ , benchFold "drop-one" (dropOne 4) sourceUnfoldrM
488+ , benchFold "drop-all" (dropAll 4) sourceUnfoldrM
489+ , benchFold "dropWhile-true" (dropWhileTrue 4) sourceUnfoldrM
490+ , benchFold "dropWhile-false" (dropWhileFalse 4) sourceUnfoldrM
760491 ]
761−
762−o_1_space_filteringX4 :: Int -> Benchmark
763−o_1_space_filteringX4 streamLen =
764− bgroup "filteringX4"
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)
492+ , bgroup "zipping"
493+ [ benchFold "zip" zip sourceUnfoldrM
774494 ]
775−
776−o_1_space_zipping :: Int -> Benchmark
777−o_1_space_zipping streamLen =
778− bgroup "zipping"
779− [ benchFold "zipWith" zipWith (unfoldrM streamLen)
780− , benchFold "zipWithM" zipWithM (unfoldrM streamLen)
495+ , bgroup "mixed"
496+ [ benchFold "scan-map" (scanMap 1) sourceUnfoldrM
497+ , benchFold "drop-map" (dropMap 1) sourceUnfoldrM
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
781506 ]
782−
783−o_1_space_mixed :: Int -> Benchmark
784−o_1_space_mixed streamLen =
785− bgroup "mixed"
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)
796− ]
797−
798−o_1_space_mixedX2 :: Int -> Benchmark
799−o_1_space_mixedX2 streamLen =
800− bgroup "mixedX2"
801− [ benchFold "scan-map" (scanMap 2) (unfoldrM streamLen)
802− , benchFold "drop-map" (dropMap 2) (unfoldrM streamLen)
803− , benchFold "drop-scan" (dropScan 2) (unfoldrM streamLen)
804− , benchFold "take-drop" (takeDrop streamLen 2) (unfoldrM streamLen)
805− , benchFold "take-scan" (takeScan streamLen 2) (unfoldrM streamLen)
806− , benchFold "take-map" (takeMap streamLen 2) (unfoldrM streamLen)
807− , benchFold "filter-drop" (filterDrop streamLen 2) (unfoldrM streamLen)
808− , benchFold "filter-take" (filterTake streamLen 2) (unfoldrM streamLen)
809− , benchFold "filter-scan" (filterScan 2) (unfoldrM streamLen)
810− , benchFold "filter-map" (filterMap streamLen 2) (unfoldrM streamLen)
507+ , bgroup "mixedX2"
508+ [ benchFold "scan-map" (scanMap 2) sourceUnfoldrM
509+ , benchFold "drop-map" (dropMap 2) sourceUnfoldrM
510+ , benchFold "drop-scan" (dropScan 2) sourceUnfoldrM
511+ , benchFold "take-drop" (takeDrop 2) sourceUnfoldrM
512+ , benchFold "take-scan" (takeScan 2) sourceUnfoldrM
513+ , benchFold "take-map" (takeMap 2) sourceUnfoldrM
514+ , benchFold "filter-drop" (filterDrop 2) sourceUnfoldrM
515+ , benchFold "filter-take" (filterTake 2) sourceUnfoldrM
516+ , benchFold "filter-scan" (filterScan 2) sourceUnfoldrM
517+ , benchFold "filter-map" (filterMap 2) sourceUnfoldrM
811518 ]
812−
813−o_1_space_mixedX4 :: Int -> Benchmark
814−o_1_space_mixedX4 streamLen =
815− bgroup "mixedX4"
816− [ benchFold "scan-map" (scanMap 4) (unfoldrM streamLen)
817− , benchFold "drop-map" (dropMap 4) (unfoldrM streamLen)
818− , benchFold "drop-scan" (dropScan 4) (unfoldrM streamLen)
819− , benchFold "take-drop" (takeDrop streamLen 4) (unfoldrM streamLen)
820− , benchFold "take-scan" (takeScan streamLen 4) (unfoldrM streamLen)
821− , benchFold "take-map" (takeMap streamLen 4) (unfoldrM streamLen)
822− , benchFold "filter-drop" (filterDrop streamLen 4) (unfoldrM streamLen)
823− , benchFold "filter-take" (filterTake streamLen 4) (unfoldrM streamLen)
824− , benchFold "filter-scan" (filterScan 4) (unfoldrM streamLen)
825− , benchFold "filter-map" (filterMap streamLen 4) (unfoldrM streamLen)
826− ]
827−
828−o_1_space_list :: Int -> Benchmark
829−o_1_space_list streamLen =
830− bgroup "list"
831− [ bgroup "elimination"
832− [ benchList "last" (\xs -> [List.last xs]) (unfoldrList streamLen)
833− ]
834− , bgroup "nested"
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)
519+ , bgroup "mixedX4"
520+ [ benchFold "scan-map" (scanMap 4) sourceUnfoldrM
521+ , benchFold "drop-map" (dropMap 4) sourceUnfoldrM
522+ , benchFold "drop-scan" (dropScan 4) sourceUnfoldrM
523+ , benchFold "take-drop" (takeDrop 4) sourceUnfoldrM
524+ , benchFold "take-scan" (takeScan 4) sourceUnfoldrM
525+ , benchFold "take-map" (takeMap 4) sourceUnfoldrM
526+ , benchFold "filter-drop" (filterDrop 4) sourceUnfoldrM
527+ , benchFold "filter-take" (filterTake 4) sourceUnfoldrM
528+ , benchFold "filter-scan" (filterScan 4) sourceUnfoldrM
529+ , benchFold "filter-map" (filterMap 4) sourceUnfoldrM
840530 ]
841531 ]
842− where
843−
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
846−
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
863− ]
532+ ]
864533
865−o_n_heap :: Int -> Benchmark
866−o_n_heap streamLen =
867− bgroup (o_n_heap_prefix moduleName)
534+o_n_heap :: [Benchmark]
535+o_n_heap =
536+ [ bgroup (o_n_heap_prefix moduleName)
868537 [ bgroup "transformation"
869− [ benchFold "foldlS" (foldlS 1) (unfoldrM streamLen)
538+ [ benchFold "foldlS" (foldlS 1) sourceUnfoldrM
870539 ]
871540 ]
541+ ]
872542
873543{-# INLINE benchK #-}
874544benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
875−benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= drain . f
545+benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= toNull . f
876546
877−o_n_stack :: Int -> Int -> Int -> Benchmark
878−o_n_stack streamLen iterStreamLen maxIters =
879− bgroup (o_n_stack_prefix moduleName)
547+o_n_stack :: [Benchmark]
548+o_n_stack =
549+ [ bgroup (o_n_stack_prefix moduleName)
880550 [ bgroup "elimination"
881− [ benchFold "tail" tail (unfoldrM streamLen)
882− , benchFold "nullTail" nullTail (unfoldrM streamLen)
883− , benchFold "headTail" headTail (unfoldrM streamLen)
551+ [ benchFold "tail" tail sourceUnfoldrM
552+ , benchFold "nullTail" nullTail sourceUnfoldrM
553+ , benchFold "headTail" headTail sourceUnfoldrM
884554 ]
885555 , bgroup "transformation"
886556 [
887557 -- XXX why do these need so much stack
888− benchFold "intersperse" (intersperse streamLen 1) (unfoldrM streamLen2)
889− , benchFold "interspersePure" (intersperse streamLen 1) (unfoldr streamLen2)
558+ benchFold "intersperse" (intersperse 1) (sourceUnfoldrMN value2)
559+ , benchFold "interspersePure" (intersperse 1) (sourceUnfoldrN value2)
890560 ]
891561 , bgroup "transformationX4"
892562 [
893− benchFold "intersperse" (intersperse streamLen 4) (unfoldrM streamLen16)
563+ benchFold "intersperse" (intersperse 4) (sourceUnfoldrMN value16)
894564 ]
895565 , bgroup "iterated"
896− [ benchK "mapM" (iterateMapM iterStreamLen maxIters)
897− , benchK "scan(1/10)" (iterateScan iterStreamLen maxIters)
898− , benchK "filterEven" (iterateFilterEven iterStreamLen maxIters)
899− , benchK "takeAll" (iterateTakeAll streamLen iterStreamLen maxIters)
900− , benchK "dropOne" (iterateDropOne iterStreamLen maxIters)
901− , benchK "dropWhileFalse(1/10)" (iterateDropWhileFalse streamLen iterStreamLen maxIters)
902− , benchK "dropWhileTrue" (iterateDropWhileTrue streamLen iterStreamLen maxIters)
566+ [ benchK "mapM" iterateMapM
567+ , benchK "scan(1/10)" iterateScan
568+ , benchK "filterEven" iterateFilterEven
569+ , benchK "takeAll" iterateTakeAll
570+ , benchK "dropOne" iterateDropOne
571+ , benchK "dropWhileFalse(1/10)" iterateDropWhileFalse
572+ , benchK "dropWhileTrue" iterateDropWhileTrue
903573 ]
904574 ]
905− where
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
575+ ]
908576
909−o_n_space :: Int -> Benchmark
910−o_n_space streamLen =
911− bgroup (o_n_space_prefix moduleName)
577+o_n_space :: [Benchmark]
578+o_n_space =
579+ [ bgroup (o_n_space_prefix moduleName)
912580 [ bgroup "elimination"
913− [ benchFold "toList" toList (unfoldrM streamLen)
581+ [ benchFold "toList" toList sourceUnfoldrM
914582 ]
915583 ]
584+ ]
916585
917586{-# INLINE benchList #-}
918587benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
919588benchList name run f = bench name $ nfIO $ randomRIO (1,1) >>= return . run . f
920589
921−main :: IO ()
922−main =
923− defaultMain
924− [ o_1_space streamLen
925− , o_n_stack streamLen iterStreamLen maxIters
926− , o_n_heap streamLen
927− , o_n_space streamLen
590+o_1_space_list :: [Benchmark]
591+o_1_space_list =
592+ [ bgroup "list"
593+ [ bgroup "elimination"
594+ [ benchList "last" (\xs -> [List.last xs]) (sourceUnfoldrList value)
928595 ]
596+ , bgroup "nested"
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)
602+ ]
603+ ]
604+ ]
929605
930− where
931−
932− streamLen = 100000
933− maxIters = 10000
934− iterStreamLen = 10
606+main :: IO ()
607+main = defaultMain $ concat
608+ [ o_1_space
609+ , [bgroup (o_1_space_prefix moduleName) o_1_space_list]
610+ , o_n_stack
611+ , o_n_heap
612+ , o_n_space
613+ ]