Copyright	(c) 2017 Composewell Technologies
License	BSD-3-Clause
Maintainer	streamly@composewell.com
Stability	experimental
Portability	GHC
Safe Haskell	Safe-Inferred
Language	Haskell2010

Streamly.Internal.Data.Stream.ZipAsync

Description

To run examples in this module:

>>> import qualified Streamly.Prelude as Stream

Synopsis

newtype ZipAsyncM m a = ZipAsyncM {
- getZipAsyncM :: Stream m a
}
type ZipAsync = ZipAsyncM IO
consMZipAsync :: Monad m => m a -> ZipAsyncM m a -> ZipAsyncM m a
zipAsyncWithK :: MonadAsync m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
zipAsyncWithMK :: MonadAsync m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c

Documentation

newtype ZipAsyncM m a Source #

For ZipAsyncM streams:

(<>) = serial
(*) = 'Streamly.Prelude.serial.zipAsyncWith' id

Applicative evaluates the streams being zipped concurrently, the following would take half the time that it would take in serial zipping:

>>> s = Stream.fromFoldableM $ Prelude.map delay [1, 1, 1]
>>> Stream.toList $ Stream.fromZipAsync $ (,) <$> s <*> s
...
[(1,1),(1,1),(1,1)]

Since: 0.2.0 (Streamly)

Since: 0.8.0

Constructors

ZipAsyncM
Fields getZipAsyncM :: Stream m a

Instances

Instances details

IsStream ZipAsyncM Source #
Instance details Defined in Streamly.Internal.Data.Stream.IsStream.Type Methods toStream :: forall (m :: Type -> TYPE LiftedRep) a. ZipAsyncM m a -> Stream m a Source # fromStream :: forall (m :: Type -> TYPE LiftedRep) a. Stream m a -> ZipAsyncM m a Source # consM :: MonadAsync m => m a -> ZipAsyncM m a -> ZipAsyncM m a Source # (\|:) :: MonadAsync m => m a -> ZipAsyncM m a -> ZipAsyncM m a Source #
MonadAsync m => Applicative (ZipAsyncM m) Source #
Instance details Defined in Streamly.Internal.Data.Stream.ZipAsync Methods pure :: a -> ZipAsyncM m a # (<>) :: ZipAsyncM m (a -> b) -> ZipAsyncM m a -> ZipAsyncM m b # liftA2 :: (a -> b -> c) -> ZipAsyncM m a -> ZipAsyncM m b -> ZipAsyncM m c # (>) :: ZipAsyncM m a -> ZipAsyncM m b -> ZipAsyncM m b # (<*) :: ZipAsyncM m a -> ZipAsyncM m b -> ZipAsyncM m a #
Monad m => Functor (ZipAsyncM m) Source #
Instance details Defined in Streamly.Internal.Data.Stream.ZipAsync Methods fmap :: (a -> b) -> ZipAsyncM m a -> ZipAsyncM m b # (<$) :: a -> ZipAsyncM m b -> ZipAsyncM m a #
Monoid (ZipAsyncM m a) Source #
Instance details Defined in Streamly.Internal.Data.Stream.ZipAsync Methods mempty :: ZipAsyncM m a # mappend :: ZipAsyncM m a -> ZipAsyncM m a -> ZipAsyncM m a # mconcat :: [ZipAsyncM m a] -> ZipAsyncM m a #
Semigroup (ZipAsyncM m a) Source #
Instance details Defined in Streamly.Internal.Data.Stream.ZipAsync Methods (<>) :: ZipAsyncM m a -> ZipAsyncM m a -> ZipAsyncM m a # sconcat :: NonEmpty (ZipAsyncM m a) -> ZipAsyncM m a # stimes :: Integral b => b -> ZipAsyncM m a -> ZipAsyncM m a #

type ZipAsync = ZipAsyncM IO Source #

An IO stream whose applicative instance zips streams wAsyncly.

Since: 0.2.0 (Streamly)

Since: 0.8.0

consMZipAsync :: Monad m => m a -> ZipAsyncM m a -> ZipAsyncM m a Source #

zipAsyncWithK :: MonadAsync m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c Source #

Like zipWith but zips concurrently i.e. both the streams being zipped are evaluated concurrently using the ParallelT concurrent evaluation style. The maximum number of elements of each stream evaluated in advance can be controlled by maxBuffer.

The stream ends if stream a or stream b ends. However, if stream b ends while we are still evaluating stream a and waiting for a result then stream will not end until after the evaluation of stream a finishes. This behavior can potentially be changed in future to end the stream immediately as soon as any of the stream end is detected.

Since: 0.1.0

zipAsyncWithMK :: MonadAsync m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c Source #

Like zipAsyncWith but with a monadic zipping function.

Since: 0.4.0