Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

  1. mapAccumL :: (acc -> x -> (acc, y)) -> acc -> Infinite x -> Infinite y

    infinite-list Data.List.Infinite

    Fold an infinite list from the left and return a list of successive reductions, keeping accumulator in a state: 

    mapAccumL f acc0 (x1 :< x2 :< ...) =
let (acc1, y1) = f acc0 x1 in
let (acc2, y2) = f acc1 x2 in
...
y1 :< y2 :< ...
    If you are looking how to traverse with a state, look no further.

  2. mapAccumL' :: (acc -> x -> (acc, y)) -> acc -> Infinite x -> Infinite y

    infinite-list Data.List.Infinite

    Same as mapAccumL, but strict in accumulator.

  3. mapEither :: (a -> Either b c) -> Infinite a -> (Infinite b, Infinite c)

    infinite-list Data.List.Infinite

    Apply a function to every element of an infinite list and separate Left and Right results. This function isn't productive (e. g., head . fst . mapEither f won't terminate), if no elements of the input list result in Left or Right.

  4. mapMaybe :: (a -> Maybe b) -> Infinite a -> Infinite b

    infinite-list Data.List.Infinite

    Apply a function to every element of an infinite list and collect Just results. This function isn't productive (e. g., head . mapMaybe f won't terminate), if no elements of the input list result in Just.

  5. mapped :: forall (f :: Type -> Type) a a' . Functor f => Setter (f a) (f a') a a'

    lens-family Lens.Family2.Stock

    An SEC referencing the parameter of a functor.

  6. mapConcurrently :: (Traversable t, MonadBaseControl IO m) => (a -> m b) -> t a -> m (t b)

    lifted-async Control.Concurrent.Async.Lifted

    Generalized version of mapConcurrently.

  7. mapConcurrently_ :: (Foldable t, MonadBaseControl IO m) => (a -> m b) -> t a -> m ()

    lifted-async Control.Concurrent.Async.Lifted

    Generalized version of mapConcurrently_.

  8. mapConcurrently :: (Traversable t, MonadBaseControl IO m, Forall (Pure m)) => (a -> m b) -> t a -> m (t b)

    lifted-async Control.Concurrent.Async.Lifted.Safe

    Generalized version of mapConcurrently.

  9. mapConcurrently_ :: (Foldable t, MonadBaseControl IO m, Forall (Pure m)) => (a -> m b) -> t a -> m ()

    lifted-async Control.Concurrent.Async.Lifted.Safe

    Generalized version of mapConcurrently_.

  10. mapIO :: forall r ix b r' a m . (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m) => (a -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv Data.Massiv.Array

    Map an IO action over an Array. Underlying computation strategy is respected and will be parallelized when requested. Unfortunately no fusion is possible and new array will be create upon each call.

Page 159 of many | Previous | Next