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.

Exact lookup

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

   diagrams-lib	Diagrams.Prelude

   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
   

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

   diagrams-lib	Diagrams.Prelude

   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

   diagrams-lib	Diagrams.Prelude

   No documentation available.

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

   diagrams-lib	Diagrams.Prelude

   No documentation available.

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

   diagrams-lib	Diagrams.Prelude

   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
   

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

   diagrams-lib	Diagrams.Prelude

   Map with access to the index.

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

   diagrams-lib	Diagrams.Prelude

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

   mapAccumL ≡ imapAccumL . const
   

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

   diagrams-lib	Diagrams.Prelude

   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)
   

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

   diagrams-lib	Diagrams.Prelude

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

   mapAccumR ≡ imapAccumR . const
   

10. imapAccumROf :: Over (Indexed i) (Backwards (State acc)) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

    diagrams-lib	Diagrams.Prelude

    Generalizes mapAccumR to an arbitrary IndexedTraversal with access to the index. imapAccumROf accumulates state from right to left.

    mapAccumROf l ≡ imapAccumROf l . const
    

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

Page 500 of many | Previous | Next