git.iko.soy/streamly
on 8ecf96a help sign in
streamly/benchmark/ArrayOps.hs
530 lines 16 kB history raw
1-- |
2-- Module : ArrayOps
3-- Copyright : (c) 2018 Harendra Kumar
4--
5-- License : MIT
6-- Maintainer : harendra.kumar@gmail.com
8{-# LANGUAGE CPP #-}
9{-# LANGUAGE FlexibleContexts #-}
10{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE DeriveAnyClass #-}
12{-# LANGUAGE DeriveGeneric #-}
14module ArrayOps where
16-- import Control.Monad (when)
17import Control.Monad.IO.Class (MonadIO)
18-- import Data.Maybe (fromJust)
19import Prelude (Int, Bool, (+), ($), (==), (>), (.), Maybe(..), undefined)
20import qualified Prelude as P
21#ifdef DEVBUILD
22import qualified Data.Foldable as F
23#endif
24import qualified GHC.Exts as GHC
25-- import Control.DeepSeq (NFData)
26-- import GHC.Generics (Generic)
28import qualified Streamly as S hiding (foldMapWith, runStream)
29import qualified Streamly.Mem.Array as A
30import qualified Streamly.Prelude as S
32value, maxValue :: Int
33#ifdef LINEAR_ASYNC
34value = 10000
35#else
36value = 100000
37#endif
38maxValue = value + 1
40-------------------------------------------------------------------------------
41-- Benchmark ops
42-------------------------------------------------------------------------------
44-------------------------------------------------------------------------------
45-- Stream generation and elimination
46-------------------------------------------------------------------------------
48type Stream = A.Array
50{-# INLINE sourceUnfoldr #-}
51sourceUnfoldr :: MonadIO m => Int -> m (Stream Int)
52sourceUnfoldr n = A.writeN value $ S.unfoldr step n
53 where
54 step cnt =
55 if cnt > n + value
56 then Nothing
57 else (Just (cnt, cnt + 1))
59{-# INLINE sourceIntFromTo #-}
60sourceIntFromTo :: MonadIO m => Int -> m (Stream Int)
61sourceIntFromTo n = A.writeN value $ S.enumerateFromTo n (n + value)
63{-# INLINE sourceIntFromToFromStream #-}
64sourceIntFromToFromStream :: MonadIO m => Int -> m (Stream Int)
65sourceIntFromToFromStream n = A.write $ S.enumerateFromTo n (n + value)
67sourceIntFromToFromList :: MonadIO m => Int -> m (Stream Int)
68sourceIntFromToFromList n = P.return $ A.fromList $ [n..n + value]
70{-# INLINE sourceFromList #-}
71sourceFromList :: MonadIO m => Int -> m (Stream Int)
72sourceFromList n = A.writeN value $ S.fromList [n..n+value]
74{-# INLINE sourceIsList #-}
75sourceIsList :: Int -> Stream Int
76sourceIsList n = GHC.fromList [n..n+value]
78{-# INLINE sourceIsString #-}
79sourceIsString :: Int -> Stream P.Char
80sourceIsString n = GHC.fromString (P.replicate (n + value) 'a')
82{-
83-------------------------------------------------------------------------------
84-- Elimination
85-------------------------------------------------------------------------------
87{-# INLINE runStream #-}
88runStream :: Monad m => Stream m a -> m ()
89runStream = S.runStream
91{-# INLINE toList #-}
92toList :: Monad m => Stream m Int -> m [Int]
94{-# INLINE head #-}
95{-# INLINE last #-}
96{-# INLINE maximum #-}
97{-# INLINE minimum #-}
98{-# INLINE find #-}
99{-# INLINE findIndex #-}
100{-# INLINE elemIndex #-}
101{-# INLINE foldl1'Reduce #-}
102head, last, minimum, maximum, find, findIndex, elemIndex, foldl1'Reduce
103 :: Monad m => Stream m Int -> m (Maybe Int)
105{-# INLINE minimumBy #-}
106{-# INLINE maximumBy #-}
107minimumBy, maximumBy :: Monad m => Stream m Int -> m (Maybe Int)
109{-# INLINE foldl'Reduce #-}
110{-# INLINE foldl'ReduceMap #-}
111{-# INLINE foldlM'Reduce #-}
112{-# INLINE foldrMReduce #-}
113{-# INLINE length #-}
114{-# INLINE sum #-}
115{-# INLINE product #-}
116foldl'Reduce, foldl'ReduceMap, foldlM'Reduce, foldrMReduce, length, sum, product
117 :: Monad m
118 => Stream m Int -> m Int
120{-# INLINE foldl'Build #-}
121{-# INLINE foldlM'Build #-}
122{-# INLINE foldrMBuild #-}
123foldrMBuild, foldl'Build, foldlM'Build
124 :: Monad m
125 => Stream m Int -> m [Int]
127{-# INLINE all #-}
128{-# INLINE any #-}
129{-# INLINE and #-}
130{-# INLINE or #-}
131{-# INLINE null #-}
132{-# INLINE elem #-}
133{-# INLINE notElem #-}
134null, elem, notElem, all, any, and, or :: Monad m => Stream m Int -> m Bool
136{-# INLINE toNull #-}
137toNull :: Monad m => (t m a -> S.SerialT m a) -> t m a -> m ()
138toNull t = runStream . t
140{-# INLINE uncons #-}
141uncons :: Monad m => Stream m Int -> m ()
142uncons s = do
143 r <- S.uncons s
144 case r of
145 Nothing -> return ()
146 Just (_, t) -> uncons t
148{-# INLINE init #-}
149init :: Monad m => Stream m a -> m ()
150init s = S.init s >>= Prelude.mapM_ S.runStream
152{-# INLINE tail #-}
153tail :: Monad m => Stream m a -> m ()
154tail s = S.tail s >>= Prelude.mapM_ tail
156{-# INLINE nullHeadTail #-}
157nullHeadTail :: Monad m => Stream m Int -> m ()
158nullHeadTail s = do
159 r <- S.null s
160 when (not r) $ do
161 _ <- S.head s
162 S.tail s >>= Prelude.mapM_ nullHeadTail
164{-# INLINE mapM_ #-}
165mapM_ :: Monad m => Stream m Int -> m ()
166mapM_ = S.mapM_ (\_ -> return ())
168toList = S.toList
170{-# INLINE toRevList #-}
171toRevList :: Monad m => Stream m Int -> m [Int]
172toRevList = S.toRevList
174foldrMBuild = S.foldrM (\x xs -> xs >>= return . (x :)) (return [])
175foldl'Build = S.foldl' (flip (:)) []
176foldlM'Build = S.foldlM' (\xs x -> return $ x : xs) []
178foldrMReduce = S.foldrM (\x xs -> xs >>= return . (x +)) (return 0)
179foldl'Reduce = S.foldl' (+) 0
180foldl'ReduceMap = P.fmap (+1) . S.foldl' (+) 0
181foldl1'Reduce = S.foldl1' (+)
182foldlM'Reduce = S.foldlM' (\xs a -> return $ a + xs) 0
184last = S.last
185null = S.null
186head = S.head
187elem = S.elem maxValue
188notElem = S.notElem maxValue
189length = S.length
190all = S.all (<= maxValue)
191any = S.any (> maxValue)
192and = S.and . S.map (<= maxValue)
193or = S.or . S.map (> maxValue)
194find = S.find (== maxValue)
195findIndex = S.findIndex (== maxValue)
196elemIndex = S.elemIndex maxValue
197maximum = S.maximum
198minimum = S.minimum
199sum = S.sum
200product = S.product
201minimumBy = S.minimumBy compare
202maximumBy = S.maximumBy compare
203-}
205-------------------------------------------------------------------------------
206-- Transformation
207-------------------------------------------------------------------------------
209{-
210{-# INLINE transform #-}
211transform :: Stream a -> Stream a
212transform = P.id
213-}
215{-# INLINE composeN #-}
216composeN :: P.Monad m
217 => Int -> (Stream Int -> m (Stream Int)) -> Stream Int -> m (Stream Int)
218composeN n f x =
219 case n of
220 1 -> f x
221 2 -> f x P.>>= f
222 3 -> f x P.>>= f P.>>= f
223 4 -> f x P.>>= f P.>>= f P.>>= f
224 _ -> undefined
226{-# INLINE scanl' #-}
227{-# INLINE scanl1' #-}
228{-# INLINE map #-}
229{-
230{-# INLINE fmap #-}
231{-# INLINE mapMaybe #-}
232{-# INLINE filterEven #-}
233{-# INLINE filterAllOut #-}
234{-# INLINE filterAllIn #-}
235{-# INLINE takeOne #-}
236{-# INLINE takeAll #-}
237{-# INLINE takeWhileTrue #-}
238{-# INLINE takeWhileMTrue #-}
239{-# INLINE dropOne #-}
240{-# INLINE dropAll #-}
241{-# INLINE dropWhileTrue #-}
242{-# INLINE dropWhileMTrue #-}
243{-# INLINE dropWhileFalse #-}
244{-# INLINE findIndices #-}
245{-# INLINE elemIndices #-}
246{-# INLINE insertBy #-}
247{-# INLINE deleteBy #-}
248{-# INLINE reverse #-}
249{-# INLINE foldrS #-}
250{-# INLINE foldrSMap #-}
251{-# INLINE foldrT #-}
252{-# INLINE foldrTMap #-}
253 -}
254scanl' , scanl1', map{-, fmap, mapMaybe, filterEven, filterAllOut,
255 filterAllIn, takeOne, takeAll, takeWhileTrue, takeWhileMTrue, dropOne,
256 dropAll, dropWhileTrue, dropWhileMTrue, dropWhileFalse,
257 findIndices, elemIndices, insertBy, deleteBy, reverse,
258 foldrS, foldrSMap, foldrT, foldrTMap -}
259 :: MonadIO m => Int -> Stream Int -> m (Stream Int)
261{-
262{-# INLINE mapMaybeM #-}
263mapMaybeM :: S.MonadAsync m => Int -> Stream m Int -> m ()
265{-# INLINE mapM #-}
266{-# INLINE map' #-}
267{-# INLINE fmap' #-}
268mapM, map' :: (S.IsStream t, S.MonadAsync m)
269 => (t m Int -> S.SerialT m Int) -> Int -> t m Int -> m ()
271fmap' :: (S.IsStream t, S.MonadAsync m, P.Functor (t m))
272 => (t m Int -> S.SerialT m Int) -> Int -> t m Int -> m ()
274{-# INLINE sequence #-}
275sequence :: (S.IsStream t, S.MonadAsync m)
276 => (t m Int -> S.SerialT m Int) -> t m (m Int) -> m ()
277 -}
279onArray
280 :: MonadIO m => (S.SerialT m Int -> S.SerialT m Int)
281 -> Stream Int
282 -> m (Stream Int)
283onArray f arr = A.writeN value $ f $ A.read arr
285scanl' n = composeN n $ onArray $ S.scanl' (+) 0
286scanl1' n = composeN n $ onArray $ S.scanl1' (+)
287map n = composeN n $ onArray $ S.map (+1)
288-- map n = composeN n $ A.map (+1)
289{-
290fmap n = composeN n $ Prelude.fmap (+1)
291fmap' t n = composeN' n $ t . Prelude.fmap (+1)
292map' t n = composeN' n $ t . S.map (+1)
293mapM t n = composeN' n $ t . S.mapM return
294mapMaybe n = composeN n $ S.mapMaybe
295 (\x -> if Prelude.odd x then Nothing else Just x)
296mapMaybeM n = composeN n $ S.mapMaybeM
297 (\x -> if Prelude.odd x then return Nothing else return $ Just x)
298sequence t = transform . t . S.sequence
299filterEven n = composeN n $ S.filter even
300filterAllOut n = composeN n $ S.filter (> maxValue)
301filterAllIn n = composeN n $ S.filter (<= maxValue)
302takeOne n = composeN n $ S.take 1
303takeAll n = composeN n $ S.take maxValue
304takeWhileTrue n = composeN n $ S.takeWhile (<= maxValue)
305takeWhileMTrue n = composeN n $ S.takeWhileM (return . (<= maxValue))
306dropOne n = composeN n $ S.drop 1
307dropAll n = composeN n $ S.drop maxValue
308dropWhileTrue n = composeN n $ S.dropWhile (<= maxValue)
309dropWhileMTrue n = composeN n $ S.dropWhileM (return . (<= maxValue))
310dropWhileFalse n = composeN n $ S.dropWhile (> maxValue)
311findIndices n = composeN n $ S.findIndices (== maxValue)
312elemIndices n = composeN n $ S.elemIndices maxValue
313insertBy n = composeN n $ S.insertBy compare maxValue
314deleteBy n = composeN n $ S.deleteBy (>=) maxValue
315reverse n = composeN n $ S.reverse
316foldrS n = composeN n $ S.foldrS S.cons S.nil
317foldrSMap n = composeN n $ S.foldrS (\x xs -> x + 1 `S.cons` xs) S.nil
318foldrT n = composeN n $ S.foldrT S.cons S.nil
319foldrTMap n = composeN n $ S.foldrT (\x xs -> x + 1 `S.cons` xs) S.nil
321-------------------------------------------------------------------------------
322-- Iteration
323-------------------------------------------------------------------------------
325iterStreamLen, maxIters :: Int
326iterStreamLen = 10
327maxIters = 10000
329{-# INLINE iterateSource #-}
330iterateSource
331 :: S.MonadAsync m
332 => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
333iterateSource g i n = f i (sourceUnfoldrMN iterStreamLen n)
334 where
335 f (0 :: Int) m = g m
336 f x m = g (f (x P.- 1) m)
338{-# INLINE iterateMapM #-}
339{-# INLINE iterateScan #-}
340{-# INLINE iterateScanl1 #-}
341{-# INLINE iterateFilterEven #-}
342{-# INLINE iterateTakeAll #-}
343{-# INLINE iterateDropOne #-}
344{-# INLINE iterateDropWhileFalse #-}
345{-# INLINE iterateDropWhileTrue #-}
346iterateMapM, iterateScan, iterateScanl1, iterateFilterEven, iterateTakeAll,
347 iterateDropOne, iterateDropWhileFalse, iterateDropWhileTrue
348 :: S.MonadAsync m
349 => Int -> Stream m Int
351-- this is quadratic
352iterateScan = iterateSource (S.scanl' (+) 0) (maxIters `div` 10)
353-- so is this
354iterateScanl1 = iterateSource (S.scanl1' (+)) (maxIters `div` 10)
356iterateMapM = iterateSource (S.mapM return) maxIters
357iterateFilterEven = iterateSource (S.filter even) maxIters
358iterateTakeAll = iterateSource (S.take maxValue) maxIters
359iterateDropOne = iterateSource (S.drop 1) maxIters
360iterateDropWhileFalse = iterateSource (S.dropWhile (> maxValue)) maxIters
361iterateDropWhileTrue = iterateSource (S.dropWhile (<= maxValue)) maxIters
363-------------------------------------------------------------------------------
364-- Zipping and concat
365-------------------------------------------------------------------------------
367{-# INLINE zip #-}
368{-# INLINE zipM #-}
369{-# INLINE mergeBy #-}
370zip, zipM, mergeBy :: Monad m => Stream m Int -> m ()
372zip src = do
373 r <- S.tail src
374 let src1 = fromJust r
375 transform (S.zipWith (,) src src1)
376zipM src = do
377 r <- S.tail src
378 let src1 = fromJust r
379 transform (S.zipWithM (curry return) src src1)
381mergeBy src = do
382 r <- S.tail src
383 let src1 = fromJust r
384 transform (S.mergeBy P.compare src src1)
386{-# INLINE isPrefixOf #-}
387{-# INLINE isSubsequenceOf #-}
388isPrefixOf, isSubsequenceOf :: Monad m => Stream m Int -> m Bool
390isPrefixOf src = S.isPrefixOf src src
391isSubsequenceOf src = S.isSubsequenceOf src src
393{-# INLINE stripPrefix #-}
394stripPrefix :: Monad m => Stream m Int -> m ()
395stripPrefix src = do
396 _ <- S.stripPrefix src src
397 return ()
399{-# INLINE zipAsync #-}
400{-# INLINE zipAsyncM #-}
401{-# INLINE zipAsyncAp #-}
402zipAsync, zipAsyncAp, zipAsyncM :: S.MonadAsync m => Stream m Int -> m ()
404zipAsync src = do
405 r <- S.tail src
406 let src1 = fromJust r
407 transform (S.zipAsyncWith (,) src src1)
409zipAsyncM src = do
410 r <- S.tail src
411 let src1 = fromJust r
412 transform (S.zipAsyncWithM (curry return) src src1)
414zipAsyncAp src = do
415 r <- S.tail src
416 let src1 = fromJust r
417 transform (S.zipAsyncly $ (,) <$> S.serially src
418 <*> S.serially src1)
420{-# INLINE eqBy #-}
421eqBy :: (Monad m, P.Eq a) => Stream m a -> m P.Bool
422eqBy src = S.eqBy (==) src src
424{-# INLINE cmpBy #-}
425cmpBy :: (Monad m, P.Ord a) => Stream m a -> m P.Ordering
426cmpBy src = S.cmpBy P.compare src src
428concatStreamLen, maxNested :: Int
429concatStreamLen = 1
430maxNested = 100000
432{-# INLINE concatMap #-}
433concatMap :: S.MonadAsync m => Int -> Stream m Int
434concatMap n = S.concatMap (\_ -> sourceUnfoldrMN maxNested n)
435 (sourceUnfoldrMN concatStreamLen n)
437-------------------------------------------------------------------------------
438-- Mixed Composition
439-------------------------------------------------------------------------------
441{-# INLINE scanMap #-}
442{-# INLINE dropMap #-}
443{-# INLINE dropScan #-}
444{-# INLINE takeDrop #-}
445{-# INLINE takeScan #-}
446{-# INLINE takeMap #-}
447{-# INLINE filterDrop #-}
448{-# INLINE filterTake #-}
449{-# INLINE filterScan #-}
450{-# INLINE filterScanl1 #-}
451{-# INLINE filterMap #-}
452scanMap, dropMap, dropScan, takeDrop, takeScan, takeMap, filterDrop,
453 filterTake, filterScan, filterScanl1, filterMap
454 :: Monad m => Int -> Stream m Int -> m ()
456scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
457dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
458dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
459takeDrop n = composeN n $ S.drop 1 . S.take maxValue
460takeScan n = composeN n $ S.scanl' (+) 0 . S.take maxValue
461takeMap n = composeN n $ S.map (subtract 1) . S.take maxValue
462filterDrop n = composeN n $ S.drop 1 . S.filter (<= maxValue)
463filterTake n = composeN n $ S.take maxValue . S.filter (<= maxValue)
464filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
465filterScanl1 n = composeN n $ S.scanl1' (+) . S.filter (<= maxBound)
466filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
468data Pair a b = Pair !a !b deriving (Generic, NFData)
470{-# INLINE sumProductFold #-}
471sumProductFold :: Monad m => Stream m Int -> m (Int, Int)
472sumProductFold = S.foldl' (\(s,p) x -> (s + x, p P.* x)) (0,1)
474{-# INLINE sumProductScan #-}
475sumProductScan :: Monad m => Stream m Int -> m (Pair Int Int)
476sumProductScan = S.foldl' (\(Pair _ p) (s0,x) -> Pair s0 (p P.* x)) (Pair 0 1)
477 . S.scanl' (\(s,_) x -> (s + x,x)) (0,0)
479-------------------------------------------------------------------------------
480-- Pure stream operations
481-------------------------------------------------------------------------------
483-}
484{-# INLINE eqInstance #-}
485eqInstance :: Stream Int -> Bool
486eqInstance src = src == src
488{-# INLINE eqInstanceNotEq #-}
489eqInstanceNotEq :: Stream Int -> Bool
490eqInstanceNotEq src = src P./= src
492{-# INLINE ordInstance #-}
493ordInstance :: Stream Int -> Bool
494ordInstance src = src P.< src
496{-# INLINE ordInstanceMin #-}
497ordInstanceMin :: Stream Int -> Stream Int
498ordInstanceMin src = P.min src src
500{-# INLINE showInstance #-}
501showInstance :: Stream Int -> P.String
502showInstance src = P.show src
504{-# INLINE readInstance #-}
505readInstance :: P.String -> Stream Int
506readInstance str =
507 let r = P.reads str
508 in case r of
509 [(x,"")] -> x
510 _ -> P.error "readInstance: no parse"
512{-# INLINE pureFoldl' #-}
513pureFoldl' :: MonadIO m => Stream Int -> m Int
514pureFoldl' = S.foldl' (+) 0 . A.read
516#ifdef DEVBUILD
517{-# INLINE foldableFoldl' #-}
518foldableFoldl' :: Stream Int -> Int
519foldableFoldl' = F.foldl' (+) 0
521{-# INLINE foldableSum #-}
522foldableSum :: Stream Int -> Int
523foldableSum = P.sum
524#endif
526{-
527{-# INLINE traversableMapM #-}
528traversableMapM :: Stream Identity Int -> IO (Stream Identity Int)
529traversableMapM = P.mapM return
530-}