2{-# LANGUAGE ConstraintKinds #-}
3{-# LANGUAGE FlexibleContexts #-}
4{-# LANGUAGE FlexibleInstances #-}
5{-# LANGUAGE GeneralizedNewtypeDeriving#-}
6{-# LANGUAGE InstanceSigs #-}
7{-# LANGUAGE MultiParamTypeClasses #-}
8{-# LANGUAGE TypeFamilies #-}
9{-# LANGUAGE UndecidableInstances #-} -- XXX
12-- Module : Streamly.Streams.Serial
13-- Copyright : (c) 2017 Harendra Kumar
16-- Maintainer : harendra.kumar@gmail.com
17-- Stability : experimental
21module Streamly.Streams.Serial
23 -- * Serial appending stream
25 , StreamT -- deprecated
30 -- * Serial interleaving stream
32 , InterleavedT -- deprecated
37 , interleaving -- deprecated
45import Control.Applicative (liftA2)
46import Control.DeepSeq (NFData(..), NFData1(..), rnf1)
47import Control.Monad (ap)
48import Control.Monad.Base (MonadBase(..), liftBaseDefault)
49import Control.Monad.Catch (MonadThrow, throwM)
50-- import Control.Monad.Error.Class (MonadError(..))
51import Control.Monad.IO.Class (MonadIO(..))
52import Control.Monad.Reader.Class (MonadReader(..))
53import Control.Monad.State.Class (MonadState(..))
54import Control.Monad.Trans.Class (MonadTrans(lift))
55import Data.Functor.Identity (Identity(..), runIdentity)
56import Data.Foldable (fold)
57import Data.Semigroup (Semigroup(..))
58import GHC.Exts (IsList(..), IsString(..))
59import Text.Read (Lexeme(Ident), lexP, parens, prec, readPrec, readListPrec,
61import Prelude hiding (map, mapM)
63import Streamly.SVar (adaptState)
64import Streamly.Streams.StreamK (IsStream(..), adapt, Stream, mkStream,
66import qualified Streamly.Streams.Prelude as P
67import qualified Streamly.Streams.StreamK as K
68import qualified Streamly.Streams.StreamD as D
70#include "Instances.hs"
73------------------------------------------------------------------------------
75------------------------------------------------------------------------------
77-- | Deep serial composition or serial composition with depth first traversal.
78-- The 'Semigroup' instance of 'SerialT' appends two streams serially in a
79-- depth first manner, yielding all elements from the first stream, and then
80-- all elements from the second stream.
84-- import qualified "Streamly.Prelude" as S
86-- main = ('toList' . 'serially' $ (fromFoldable [1,2]) \<\> (fromFoldable [3,4])) >>= print
92-- The 'Monad' instance runs the /monadic continuation/ for each
93-- element of the stream, serially.
96-- main = 'runStream' . 'serially' $ do
97-- x <- return 1 \<\> return 2
105-- 'SerialT' nests streams serially in a depth first manner.
108-- main = 'runStream' . 'serially' $ do
109-- x <- return 1 \<\> return 2
110-- y <- return 3 \<\> return 4
111-- S.yieldM $ print (x, y)
120-- This behavior of 'SerialT' is exactly like a list transformer. We call the
121-- monadic code being run for each element of the stream a monadic
122-- continuation. In imperative paradigm we can think of this composition as
123-- nested @for@ loops and the monadic continuation is the body of the loop. The
124-- loop iterates for all elements of the stream.
126-- The 'serially' combinator can be omitted as the default stream type is
128-- Note that serial composition with depth first traversal can be used to
129-- combine an infinite number of streams as it explores only one stream at a
133newtype SerialT m a = SerialT {getSerialT :: Stream m a}
134 deriving (Semigroup, Monoid, MonadTrans)
136-- | A serial IO stream of elements of type @a@. See 'SerialT' documentation
140type Serial = SerialT IO
144{-# DEPRECATED StreamT "Please use 'SerialT' instead." #-}
145type StreamT = SerialT
147-- | Fix the type of a polymorphic stream as 'SerialT'.
150serially :: IsStream t => SerialT m a -> t m a
153instance IsStream SerialT where
154 toStream = getSerialT
158 {-# SPECIALIZE consM :: IO a -> SerialT IO a -> SerialT IO a #-}
159 consM :: Monad m => m a -> SerialT m a -> SerialT m a
160 consM = K.consMSerial
163 {-# SPECIALIZE (|:) :: IO a -> SerialT IO a -> SerialT IO a #-}
164 (|:) :: Monad m => m a -> SerialT m a -> SerialT m a
167------------------------------------------------------------------------------
169------------------------------------------------------------------------------
171-- XXX if foldStreamShared/unShare/adaptState are not efficient in serial case
172-- we can use a rewrite rule for that for the serial case and then just use a
173-- bindWith serial here.
175instance Monad m => Monad (SerialT m) where
177 m >>= f = mkStream $ \st stp sng yld ->
178 let run x = foldStream st stp sng yld x
180 yieldk a r = run $ f a <> (r >>= f)
181 in foldStream (adaptState st) stp single yieldk m
183------------------------------------------------------------------------------
185------------------------------------------------------------------------------
187{-# INLINE_EARLY mapM #-}
188mapM :: (IsStream t, Monad m) => (a -> m b) -> t m a -> t m b
189mapM f m = fromStream $ D.toStreamK $ D.mapM f $ D.fromStreamK (toStream m)
199-- > S.toList $ S.map (+1) $ S.fromList [1,2,3]
205map :: (IsStream t, Monad m) => (a -> b) -> t m a -> t m b
206map f = mapM (return . f)
208MONAD_APPLICATIVE_INSTANCE(SerialT,)
209MONAD_COMMON_INSTANCES(SerialT,)
211------------------------------------------------------------------------------
213------------------------------------------------------------------------------
215-- | Wide serial composition or serial composition with a breadth first
216-- traversal. The 'Semigroup' instance of 'WSerialT' traverses
217-- the two streams in a breadth first manner. In other words, it interleaves
218-- two streams, yielding one element from each stream alternately.
222-- import qualified "Streamly.Prelude" as S
224-- main = ('toList' . 'wSerially' $ (fromFoldable [1,2]) \<\> (fromFoldable [3,4])) >>= print
230-- Similarly, the 'Monad' instance interleaves the iterations of the
231-- inner and the outer loop, nesting loops in a breadth first manner.
235-- main = 'runStream' . 'wSerially' $ do
236-- x <- return 1 \<\> return 2
237-- y <- return 3 \<\> return 4
238-- S.yieldM $ print (x, y)
247-- Note that a serial composition with breadth first traversal can only combine
248-- a finite number of streams as it needs to retain state for each unfinished
252newtype WSerialT m a = WSerialT {getWSerialT :: Stream m a}
253 deriving (MonadTrans)
255-- | An interleaving serial IO stream of elements of type @a@. See 'WSerialT'
256-- documentation for more details.
259type WSerial = WSerialT IO
263{-# DEPRECATED InterleavedT "Please use 'WSerialT' instead." #-}
264type InterleavedT = WSerialT
266-- | Fix the type of a polymorphic stream as 'WSerialT'.
269wSerially :: IsStream t => WSerialT m a -> t m a
272-- | Same as 'wSerially'.
275{-# DEPRECATED interleaving "Please use wSerially instead." #-}
276interleaving :: IsStream t => WSerialT m a -> t m a
277interleaving = wSerially
279instance IsStream WSerialT where
280 toStream = getWSerialT
281 fromStream = WSerialT
284 {-# SPECIALIZE consM :: IO a -> WSerialT IO a -> WSerialT IO a #-}
285 consM :: Monad m => m a -> WSerialT m a -> WSerialT m a
286 consM = K.consMSerial
289 {-# SPECIALIZE (|:) :: IO a -> WSerialT IO a -> WSerialT IO a #-}
290 (|:) :: Monad m => m a -> WSerialT m a -> WSerialT m a
293------------------------------------------------------------------------------
295------------------------------------------------------------------------------
297-- | Polymorphic version of the 'Semigroup' operation '<>' of 'WSerialT'.
298-- Interleaves two streams, yielding one element from each stream alternately.
301{-# INLINE wSerial #-}
302wSerial :: IsStream t => t m a -> t m a -> t m a
303wSerial m1 m2 = mkStream $ \st stp sng yld -> do
304 let stop = foldStream st stp sng yld m2
306 yieldk a r = yld a (wSerial m2 r)
307 foldStream st stop single yieldk m1
309instance Semigroup (WSerialT m a) where
314-- | Same as 'wSerial'.
317{-# DEPRECATED (<=>) "Please use 'wSerial' instead." #-}
319(<=>) :: IsStream t => t m a -> t m a -> t m a
322------------------------------------------------------------------------------
324------------------------------------------------------------------------------
326instance Monoid (WSerialT m a) where
330------------------------------------------------------------------------------
332------------------------------------------------------------------------------
334-- XXX if foldStreamShared/unShare/adaptState are not efficient in serial case
335-- we can use a rewrite rule for that for the serial case and then just use a
336-- bindWith interleave here.
338instance Monad m => Monad (WSerialT m) where
340 m >>= f = mkStream $ \st stp sng yld ->
341 let run x = foldStream st stp sng yld x
343 yieldk a r = run $ f a <> (r >>= f)
344 in foldStream (adaptState st) stp single yieldk m
346------------------------------------------------------------------------------
348------------------------------------------------------------------------------
350MONAD_APPLICATIVE_INSTANCE(WSerialT,)
351MONAD_COMMON_INSTANCES(WSerialT,)
353LIST_INSTANCES(SerialT)
354LIST_INSTANCES(WSerialT)
356FOLDABLE_INSTANCE(SerialT)
357FOLDABLE_INSTANCE(WSerialT)
359TRAVERSABLE_INSTANCE(SerialT)
360TRAVERSABLE_INSTANCE(WSerialT)
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list