Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. ifoldMap :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m

    lens Control.Lens.Indexed

    Fold a container by mapping value to an arbitrary Monoid with access to the index i. When you don't need access to the index then foldMap is more flexible in what it accepts.

    foldMapifoldMap . const
    

  2. ifoldMap' :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m

    lens Control.Lens.Indexed

    A variant of ifoldMap that is strict in the accumulator. When you don't need access to the index then foldMap' is more flexible in what it accepts.

    foldMap'ifoldMap' . const
    

  3. ifoldMapBy :: FoldableWithIndex i t => (r -> r -> r) -> r -> (i -> a -> r) -> t a -> r

    lens Control.Lens.Indexed

    No documentation available.

  4. ifoldMapByOf :: IndexedFold i t a -> (r -> r -> r) -> r -> (i -> a -> r) -> t -> r

    lens Control.Lens.Indexed

    No documentation available.

  5. imap :: FunctorWithIndex i f => (i -> a -> b) -> f a -> f b

    lens Control.Lens.Indexed

    Map with access to the index.

  6. imapAccumL :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b)

    lens Control.Lens.Indexed

    Generalizes mapAccumL to add access to the index. imapAccumL accumulates state from left to right.

    mapAccumLimapAccumL . const
    

  7. imapAccumR :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b)

    lens Control.Lens.Indexed

    Generalizes mapAccumR to add access to the index. imapAccumR accumulates state from right to left.

    mapAccumRimapAccumR . const
    

  8. imapM :: (TraversableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m (t b)

    lens Control.Lens.Indexed

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results, with access the index. When you don't need access to the index mapM is more liberal in what it can accept.

    mapMimapM . const
    

  9. imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()

    lens Control.Lens.Indexed

    Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results. When you don't need access to the index then mapMOf_ is more flexible in what it accepts.

    mapM_imapM . const
    

  10. imapped :: forall i (f :: Type -> Type) a b . FunctorWithIndex i f => IndexedSetter i (f a) (f b) a b

    lens Control.Lens.Indexed

    The IndexedSetter for a FunctorWithIndex. If you don't need access to the index, then mapped is more flexible in what it accepts.

Page 421 of many | Previous | Next