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.

Exact lookup

1. remap2 :: Remap m => (a -> b) -> (b -> a) -> m a -> m b

   cmdargs	System.Console.CmdArgs.Explicit

   Restricted version of remap where the values are isomorphic.

2. remapUpdate :: (a -> b) -> (b -> (a, a -> b)) -> Update a -> Update b

   cmdargs	System.Console.CmdArgs.Explicit

   Version of remap for the Update type alias.

3. packMapStorableArray :: forall a b . Storable b => (a -> b) -> [a] -> IO (Ptr b)

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

4. packMapZeroTerminatedStorableArray :: forall a b . (Num b, Storable b) => (a -> b) -> [a] -> IO (Ptr b)

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

5. unpackMapStorableArrayWithLength :: (Integral a, Storable b) => (b -> c) -> a -> Ptr b -> IO [c]

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

6. unpackMapZeroTerminatedStorableArray :: (Eq a, Num a, Storable a) => (a -> b) -> Ptr a -> IO [b]

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

7. gvariantFromMap :: (IsGVariant key, IsGVariantBasicType key, IsGVariant value) => Map key value -> IO GVariant

   haskell-gi-base	Data.GI.Base.GVariant

   Pack a Map into a GVariant for dictionary type, which is just an array of GVariantDictEntry.

8. gvariantToMap :: (IsGVariant key, IsGVariantBasicType key, IsGVariant value) => GVariant -> IO (Maybe (Map key value))

   haskell-gi-base	Data.GI.Base.GVariant

   Unpack a GVariant into a Map. Notice that this assumes that all the elements in the GVariant array of GVariantDictEntry are of the same type, which is not necessary for a generic GVariant, so this is somewhat restrictive. For the general case it is necessary to use gvariantToList plus gvariantToDictEntry directly.

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

   these	Data.These.Combinators

   Bifunctor bimap.

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