Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. unEnumMap :: EnumMap k a -> IntMap a

   regex-tdfa	Data.IntMap.EnumMap2

   No documentation available.

2. dfaMap :: DFA -> Map SetIndex DFA

   regex-tdfa	Text.Regex.TDFA.TDFA

   No documentation available.

3. bimapThese :: (a -> c) -> (b -> d) -> These a b -> These c d

   these	Data.These.Combinators

   Bifunctor bimap.

4. arrayLengthsMap :: Callable -> [(Arg, Arg)]

   haskell-gi	Data.GI.CodeGen.Callable

   No documentation available.

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

   haskell-gi	Data.GI.CodeGen.Code

   Return the C -> Haskell available to the generator.

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

   haskell-gi	Data.GI.CodeGen.Conversions

   No documentation available.

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

8. module Data.GI.CodeGen.CtoHaskellMap

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

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

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

Page 473 of many | Previous | Next