@@ -0,0 +1,136 @@
2+-- Module : Streamly.Benchmark.Data.SmallArrayOps
3+-- Copyright : (c) 2019 Composewell Technologies
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+-- Stability : experimental
11+{-# LANGUAGE DeriveAnyClass #-}
12+{-# LANGUAGE DeriveGeneric #-}
13+{-# LANGUAGE FlexibleContexts #-}
14+{-# LANGUAGE ScopedTypeVariables #-}
16+module Streamly.Benchmark.Data.SmallArrayOps where
18+import Control.Monad.IO.Class (MonadIO)
19+import Prelude (Int, Bool, (+), ($), (==), (>), (.), Maybe(..), undefined)
20+import qualified Prelude as P
22+import qualified Data.Foldable as F
25+import qualified Streamly as S hiding (foldMapWith, runStream)
26+import qualified Streamly.Data.SmallArray as A
27+import qualified Streamly.Prelude as S
32+-------------------------------------------------------------------------------
34+-------------------------------------------------------------------------------
36+-------------------------------------------------------------------------------
37+-- Stream generation and elimination
38+-------------------------------------------------------------------------------
40+type Stream = A.SmallArray
42+{-# INLINE sourceUnfoldr #-}
43+sourceUnfoldr :: MonadIO m => Int -> m (Stream Int)
44+sourceUnfoldr n = S.fold (A.writeN value) $ S.unfoldr step n
49+ else (Just (cnt, cnt + 1))
51+{-# INLINE sourceIntFromTo #-}
52+sourceIntFromTo :: MonadIO m => Int -> m (Stream Int)
53+sourceIntFromTo n = S.fold (A.writeN value) $ S.enumerateFromTo n (n + value)
55+{-# INLINE sourceIntFromToFromList #-}
56+sourceIntFromToFromList :: MonadIO m => Int -> m (Stream Int)
57+sourceIntFromToFromList n = P.return $ (A.fromListN value) $ [n..n + value]
59+{-# INLINE sourceFromList #-}
60+sourceFromList :: MonadIO m => Int -> m (Stream Int)
61+sourceFromList n = S.fold (A.writeN value) $ S.fromList [n..n+value]
63+-------------------------------------------------------------------------------
65+-------------------------------------------------------------------------------
67+{-# INLINE composeN #-}
69+ => Int -> (Stream Int -> m (Stream Int)) -> Stream Int -> m (Stream Int)
74+ 3 -> f x P.>>= f P.>>= f
75+ 4 -> f x P.>>= f P.>>= f P.>>= f
79+{-# INLINE scanl1' #-}
83+ :: MonadIO m => Int -> Stream Int -> m (Stream Int)
85+{-# INLINE onArray #-}
87+ :: MonadIO m => (S.SerialT m Int -> S.SerialT m Int)
90+onArray f arr = S.fold (A.writeN value) $ f $ (S.unfold A.read arr)
92+scanl' n = composeN n $ onArray $ S.scanl' (+) 0
93+scanl1' n = composeN n $ onArray $ S.scanl1' (+)
94+map n = composeN n $ onArray $ S.map (+1)
96+{-# INLINE eqInstance #-}
97+eqInstance :: Stream Int -> Bool
98+eqInstance src = src == src
100+{-# INLINE eqInstanceNotEq #-}
101+eqInstanceNotEq :: Stream Int -> Bool
102+eqInstanceNotEq src = src P./= src
104+{-# INLINE ordInstance #-}
105+ordInstance :: Stream Int -> Bool
106+ordInstance src = src P.< src
108+{-# INLINE ordInstanceMin #-}
109+ordInstanceMin :: Stream Int -> Stream Int
110+ordInstanceMin src = P.min src src
112+{-# INLINE showInstance #-}
113+showInstance :: Stream Int -> P.String
114+showInstance src = P.show src
116+{-# INLINE readInstance #-}
117+readInstance :: P.String -> Stream Int
122+ _ -> P.error "readInstance: no parse"
124+{-# INLINE pureFoldl' #-}
125+pureFoldl' :: MonadIO m => Stream Int -> m Int
126+pureFoldl' = S.foldl' (+) 0 . S.unfold A.read
129+{-# INLINE foldableFoldl' #-}
130+foldableFoldl' :: Stream Int -> Int
131+foldableFoldl' = F.foldl' (+) 0
133+{-# INLINE foldableSum #-}
134+foldableSum :: Stream Int -> Int