Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. concatMap :: forall a (m :: Type -> Type) b . (a -> StreamK m b) -> StreamK m a -> StreamK m b

   streamly-core	Streamly.Internal.Data.StreamK

   No documentation available.

2. concatMapEffect :: Monad m => (b -> StreamK m a) -> m b -> StreamK m a

   streamly-core	Streamly.Internal.Data.StreamK

   No documentation available.

3. concatMapWith :: forall (m :: Type -> Type) b a . (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b

   streamly-core	Streamly.Internal.Data.StreamK

   Perform a concatMap using a specified concat strategy. The first argument specifies a merge or concat function that is used to merge the streams generated by the map function.

4. mergeMapWith :: forall (m :: Type -> Type) b a . (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b

   streamly-core	Streamly.Internal.Data.StreamK

   Combine streams in pairs using a binary combinator, the resulting streams are then combined again in pairs recursively until we get to a single combined stream. The composition would thus form a binary tree. For example, you can sort a stream using merge sort like this:

   >>> s = StreamK.fromStream $ Stream.fromList [5,1,7,9,2]
   
   >>> generate = StreamK.fromPure
   
   >>> combine = StreamK.mergeBy compare
   
   >>> Stream.fold Fold.toList $ StreamK.toStream $ StreamK.mergeMapWith combine generate s
   [1,2,5,7,9]
   

   Note that if the stream length is not a power of 2, the binary tree composed by mergeMapWith would not be balanced, which may or may not be important depending on what you are trying to achieve. Caution: the stream of streams must be finite Pre-release

5. concatMap :: forall (m :: Type -> Type) b a c . Monad m => (b -> Unfold m a c) -> Unfold m a b -> Unfold m a c

   streamly-core	Streamly.Internal.Data.Unfold

   No documentation available.

6. concatMapM :: Monad m => (b -> m (Unfold m a c)) -> Unfold m a b -> Unfold m a c

   streamly-core	Streamly.Internal.Data.Unfold

   Map an unfold generating action to each element of an unfold and flatten the results into a single stream.

7. lmap :: forall a c (m :: Type -> Type) b . (a -> c) -> Unfold m c b -> Unfold m a b

   streamly-core	Streamly.Internal.Data.Unfold

   Map a function on the input argument of the Unfold.

   >>> u = Unfold.lmap (fmap (+1)) Unfold.fromList
   
   >>> Unfold.fold Fold.toList u [1..5]
   [2,3,4,5,6]
   

   lmap f = Unfold.many (Unfold.function f)
   

8. lmapM :: Monad m => (a -> m c) -> Unfold m c b -> Unfold m a b

   streamly-core	Streamly.Internal.Data.Unfold

   Map an action on the input argument of the Unfold.

   lmapM f = Unfold.many (Unfold.functionM f)
   

9. cfoldMap :: (CFoldable f, Dom f a, Monoid w) => (a -> w) -> f a -> w

   subcategories	Control.Subcategory.Foldable

   No documentation available.

10. cfoldMap' :: (CFoldable f, Dom f a, Monoid m) => (a -> m) -> f a -> m

    subcategories	Control.Subcategory.Foldable

    No documentation available.

Page 1092 of many | Previous | Next