Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. iconcatMapOf :: IndexedGetting i [r] s a -> (i -> a -> [r]) -> s -> [r]

   lens	Control.Lens.Fold

   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. ifoldMapOf :: IndexedGetting i m s a -> (i -> a -> m) -> s -> m

   lens	Control.Lens.Fold

   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
   

3. imapMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> (i -> a -> m r) -> s -> m ()

   lens	Control.Lens.Fold

   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.

   mapMOf_ l ≡ imapMOf l . const
   

   imapMOf_ :: Monad m => IndexedGetter i s a     -> (i -> a -> m r) -> s -> m ()
   imapMOf_ :: Monad m => IndexedFold i s a       -> (i -> a -> m r) -> s -> m ()
   imapMOf_ :: Monad m => IndexedLens' i s a      -> (i -> a -> m r) -> s -> m ()
   imapMOf_ :: Monad m => IndexedTraversal' i s a -> (i -> a -> m r) -> s -> m ()
   

4. contramap :: Contravariant f => (a' -> a) -> f a -> f a'

   lens	Control.Lens.Getter

   No documentation available.

5. 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
   

6. 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.

   foldMap ≡ ifoldMap . const
   

7. 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
   

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

   lens	Control.Lens.Indexed

   No documentation available.

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

   lens	Control.Lens.Indexed

   No documentation available.

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

    lens	Control.Lens.Indexed

    Map with access to the index.

Page 420 of many | Previous | Next