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. iconcatMapOf :: IndexedGetting i [r] s a -> (i -> a -> [r]) -> s -> [r]

    lens Control.Lens.Combinators

    Concatenate the results of a function of the elements of an IndexedFold or IndexedTraversal with access to the index. When you don't need access to the index then concatMapOf is more flexible in what it accepts. 

    concatMapOf l ≡ iconcatMapOf l . const
iconcatMapOf ≡ ifoldMapOf

    iconcatMapOf :: IndexedGetter i s a     -> (i -> a -> [r]) -> s -> [r]
iconcatMapOf :: IndexedFold i s a       -> (i -> a -> [r]) -> s -> [r]
iconcatMapOf :: IndexedLens' i s a      -> (i -> a -> [r]) -> s -> [r]
iconcatMapOf :: IndexedTraversal' i s a -> (i -> a -> [r]) -> s -> [r]

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

    lens Control.Lens.Combinators

    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. 

    foldMap ≡ ifoldMap . const

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

    lens Control.Lens.Combinators

    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

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

    lens Control.Lens.Combinators

    No documentation available.

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

    lens Control.Lens.Combinators

    No documentation available.

  6. ifoldMapOf :: IndexedGetting i m s a -> (i -> a -> m) -> s -> m

    lens Control.Lens.Combinators

    Fold an IndexedFold or IndexedTraversal by mapping indices and values to an arbitrary Monoid with access to the i. When you don't need access to the index then foldMapOf is more flexible in what it accepts. 

    foldMapOf l ≡ ifoldMapOf l . const

    ifoldMapOf ::             IndexedGetter i s a     -> (i -> a -> m) -> s -> m
ifoldMapOf :: Monoid m => IndexedFold i s a       -> (i -> a -> m) -> s -> m
ifoldMapOf ::             IndexedLens' i s a      -> (i -> a -> m) -> s -> m
ifoldMapOf :: Monoid m => IndexedTraversal' i s a -> (i -> a -> m) -> s -> m

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

    lens Control.Lens.Combinators

    Map with access to the index.

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

    lens Control.Lens.Combinators

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

    mapAccumL ≡ imapAccumL . const

  9. imapAccumLOf :: Over (Indexed i) (State acc) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

    lens Control.Lens.Combinators

    Generalizes mapAccumL to an arbitrary IndexedTraversal with access to the index. imapAccumLOf accumulates state from left to right. 

    mapAccumLOf l ≡ imapAccumLOf l . const

    imapAccumLOf :: IndexedLens i s t a b      -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
imapAccumLOf :: IndexedTraversal i s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

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

    lens Control.Lens.Combinators

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

    mapAccumR ≡ imapAccumR . const

Page 418 of many | Previous | Next