Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
contramap :: Contravariant f => (a' -> a) -> f a -> f a'lens Control.Lens.Getter No documentation available.
iconcatMap :: FoldableWithIndex i f => (i -> a -> [b]) -> f a -> [b]lens Control.Lens.Indexed Concatenate the results of a function of the elements of an indexed container with access to the index. When you don't need access to the index then concatMap is more flexible in what it accepts.
concatMap ≡ iconcatMap . const iconcatMap ≡ ifoldMap
ifoldMap :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> mlens 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.
foldMap ≡ ifoldMap . const
ifoldMap' :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> mlens 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
ifoldMapBy :: FoldableWithIndex i t => (r -> r -> r) -> r -> (i -> a -> r) -> t a -> rlens Control.Lens.Indexed No documentation available.
ifoldMapByOf :: IndexedFold i t a -> (r -> r -> r) -> r -> (i -> a -> r) -> t -> rlens Control.Lens.Indexed No documentation available.
imap :: FunctorWithIndex i f => (i -> a -> b) -> f a -> f blens Control.Lens.Indexed Map with access to the index.
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.
mapAccumL ≡ imapAccumL . const
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.
mapAccumR ≡ imapAccumR . const
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.
mapM ≡ imapM . const