Hoogle Search
Within LTS Haskell 24.37 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
parListEager :: forall (m :: Type -> Type) a . MonadAsync m => [Stream m a] -> Stream m astreamly Streamly.Internal.Data.Stream.Prelude Like parListLazy but with eager on.
>>> parListEager = Stream.parList (Stream.eager True)
parListEagerFst :: forall (m :: Type -> Type) a . MonadAsync m => [Stream m a] -> Stream m astreamly Streamly.Internal.Data.Stream.Prelude Like parListEager but stops the output as soon as the first stream stops.
>>> parListEagerFst = Stream.parList (Stream.eager True . Stream.stopWhen Stream.FirstStops)
parListEagerMin :: forall (m :: Type -> Type) a . MonadAsync m => [Stream m a] -> Stream m astreamly Streamly.Internal.Data.Stream.Prelude Like parListEager but stops the output as soon as any of the two streams stops. Definition:
>>> parListEagerMin = Stream.parList (Stream.eager True . Stream.stopWhen Stream.AnyStops)
parListInterleaved :: forall (m :: Type -> Type) a . MonadAsync m => [Stream m a] -> Stream m astreamly Streamly.Internal.Data.Stream.Prelude Like parListLazy but interleaves the streams fairly instead of prioritizing the left stream. This schedules all streams in a round robin fashion over limited number of threads.
>>> parListInterleaved = Stream.parList (Stream.interleaved True)
parListLazy :: forall (m :: Type -> Type) a . MonadAsync m => [Stream m a] -> Stream m astreamly Streamly.Internal.Data.Stream.Prelude Like concat but works on a list of streams.
>>> parListLazy = Stream.parList id
parListOrdered :: forall (m :: Type -> Type) a . MonadAsync m => [Stream m a] -> Stream m astreamly Streamly.Internal.Data.Stream.Prelude Like parListLazy but with ordered on.
>>> parListOrdered = Stream.parList (Stream.ordered True)
fromList :: IsList l => [Item l] -> lstreamly Streamly.Internal.Data.Stream.Serial The fromList function constructs the structure l from the given list of Item l
toList :: IsList l => l -> [Item l]streamly Streamly.Internal.Data.Stream.Serial The toList function extracts a list of Item l from the structure l. It should satisfy fromList . toList = id.
partCompareListMaybe :: Eq a => [Maybe a] -> [Maybe a] -> Maybe Orderingswish Data.Ord.Partial Part-ordering comparison on lists of Maybe values.
partCompareListSubset :: Eq a => [a] -> [a] -> Maybe Orderingswish Data.Ord.Partial Part-ordering comparison on lists based on subset relationship