Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. ifoldlMap1' :: Foldable1WithIndex i f => (i -> a -> b) -> (i -> b -> a -> b) -> f a -> b

   indexed-traversable	Data.Foldable1.WithIndex

   Generalized ifoldl1'.

2. ifoldrMap1 :: Foldable1WithIndex i f => (i -> a -> b) -> (i -> a -> b -> b) -> f a -> b

   indexed-traversable	Data.Foldable1.WithIndex

   Generalized ifoldr1.

3. ifoldrMap1' :: Foldable1WithIndex i f => (i -> a -> b) -> (i -> a -> b -> b) -> f a -> b

   indexed-traversable	Data.Foldable1.WithIndex

   Generalized ifoldr1'.

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

   indexed-traversable	Data.Functor.WithIndex

   Map with access to the index.

5. ifoldMapDefault :: (TraversableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m

   indexed-traversable	Data.Traversable.WithIndex

   No documentation available.

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

   indexed-traversable	Data.Traversable.WithIndex

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

   mapAccumL ≡ imapAccumL . const
   

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

   indexed-traversable	Data.Traversable.WithIndex

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

   mapAccumR ≡ imapAccumR . const
   

8. imapDefault :: TraversableWithIndex i f => (i -> a -> b) -> f a -> f b

   indexed-traversable	Data.Traversable.WithIndex

   No documentation available.

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

   indexed-traversable	Data.Traversable.WithIndex

   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
   

10. foldByKeyHashMap :: (Hashable k, Eq k) => Fold a b -> Fold (k, a) (HashMap k b)

    foldl	Control.Foldl

    Given a Fold, produces a HashMap which applies that fold to each a separated by key k.

    >>> List.sort (HashMap.toList (fold (foldByKeyHashMap Control.Foldl.sum) [("a",1), ("b",2), ("b",20), ("a",10)]))
    [("a",11),("b",22)]
    

Page 475 of many | Previous | Next