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.
ifoldMap1 :: (Foldable1WithIndex i f, Semigroup m) => (i -> a -> m) -> f a -> mindexed-traversable Data.Foldable1.WithIndex Map each element of the structure to a semigroup, and combine the results.
ifoldMap1' :: (Foldable1WithIndex i f, Semigroup m) => (i -> a -> m) -> f a -> mindexed-traversable Data.Foldable1.WithIndex A variant of ifoldMap1 that is strict in the accumulator.
ifoldlMap1 :: Foldable1WithIndex i f => (i -> a -> b) -> (i -> b -> a -> b) -> f a -> bindexed-traversable Data.Foldable1.WithIndex Generalized ifoldl1.
ifoldlMap1' :: Foldable1WithIndex i f => (i -> a -> b) -> (i -> b -> a -> b) -> f a -> bindexed-traversable Data.Foldable1.WithIndex Generalized ifoldl1'.
ifoldrMap1 :: Foldable1WithIndex i f => (i -> a -> b) -> (i -> a -> b -> b) -> f a -> bindexed-traversable Data.Foldable1.WithIndex Generalized ifoldr1.
ifoldrMap1' :: Foldable1WithIndex i f => (i -> a -> b) -> (i -> a -> b -> b) -> f a -> bindexed-traversable Data.Foldable1.WithIndex Generalized ifoldr1'.
imap :: FunctorWithIndex i f => (i -> a -> b) -> f a -> f bindexed-traversable Data.Functor.WithIndex Map with access to the index.
ifoldMapDefault :: (TraversableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> mindexed-traversable Data.Traversable.WithIndex No documentation available.
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
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