Hoogle Search
Within LTS Haskell 24.66 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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
imapDefault :: TraversableWithIndex i f => (i -> a -> b) -> f a -> f bindexed-traversable Data.Traversable.WithIndex No documentation available.
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
arrayLengthsMap :: Callable -> [(Arg, Arg)]haskell-gi Data.GI.CodeGen.Callable No documentation available.
getC2HMap :: CodeGen e (Map CRef Hyperlink)haskell-gi Data.GI.CodeGen.Code Return the C -> Haskell available to the generator.
elementMap :: Type -> Text -> Maybe Texthaskell-gi Data.GI.CodeGen.Conversions No documentation available.
elementTypeAndMap :: Type -> Text -> Maybe (Type, Text)haskell-gi Data.GI.CodeGen.Conversions If the given type maps to a list in Haskell, return the type of the elements, and the function that maps over them.
module Data.GI.CodeGen.
CtoHaskellMap Construct a map from C identifiers to the corresponding Haskell elements in the bindings.