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.
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.
cToHaskellMap :: [(Name, API)] -> Map CRef Hyperlinkhaskell-gi Data.GI.CodeGen.CtoHaskellMap Given a set of APIs, build a Map that given a Text corresponding to a certain C identifier returns the corresponding Haskell element in the bindings. For instance, gtk_widget_show will get mapped to show.
iconcatMap :: FoldableWithIndex i f => (i -> a -> [b]) -> f a -> [b]indexed-traversable Data.Foldable.WithIndex 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
ifoldMap :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> mindexed-traversable Data.Foldable.WithIndex 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
ifoldMap' :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> mindexed-traversable Data.Foldable.WithIndex 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
imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()indexed-traversable Data.Foldable.WithIndex 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.
mapM_ ≡ imapM . const
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.