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. arrayLengthsMap :: Callable -> [(Arg, Arg)]

   haskell-gi	Data.GI.CodeGen.Callable

   No documentation available.

2. getC2HMap :: CodeGen e (Map CRef Hyperlink)

   haskell-gi	Data.GI.CodeGen.Code

   Return the C -> Haskell available to the generator.

3. elementMap :: Type -> Text -> Maybe Text

   haskell-gi	Data.GI.CodeGen.Conversions

   No documentation available.

4. 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.

5. module Data.GI.CodeGen.CtoHaskellMap

   Construct a map from C identifiers to the corresponding Haskell elements in the bindings.

6. cToHaskellMap :: [(Name, API)] -> Map CRef Hyperlink

   haskell-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.

7. 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
   

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

   indexed-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
   

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

   indexed-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
   

10. 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
    

Page 473 of many | Previous | Next