Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

1. nullPtrForType :: Type -> CodeGen e (Maybe Text)

   haskell-gi	Data.GI.CodeGen.Conversions

   An appropriate NULL value for the given type, for types which are represented by pointers on the C side.

2. DocBeforeSymbol :: RelativeDocPosition

   haskell-gi	Data.GI.CodeGen.Haddock

   No documentation available.

3. callbackHaskellToForeign :: Text -> Text

   haskell-gi	Data.GI.CodeGen.SymbolNaming

   The name of the Haskell to foreign wrapper for the given callback type. It can be passed in qualified.

4. callbackHaskellToForeignWithClosures :: Text -> Text

   haskell-gi	Data.GI.CodeGen.SymbolNaming

   The name of the Haskell to foreign wrapper for the given callback type, keeping the closure arguments (we usually elide them). The callback type can be passed in qualified.

5. ScopeTypeForever :: Scope

   haskell-gi	Data.GI.GIR.Arg

   No documentation available.

6. gtypeStructFor :: Struct -> Maybe Name

   haskell-gi	Data.GI.GIR.Struct

   No documentation available.

7. structForceVisible :: Struct -> Bool

   haskell-gi	Data.GI.GIR.Struct

   No documentation available.

8. iforM_ :: (FoldableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> 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 (with the arguments flipped).

   iforM_ ≡ flip imapM_
   

   When you don't need access to the index then forM_ is more flexible in what it accepts.

   forM_ a ≡ iforM a . const
   

9. ifor_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f ()

   indexed-traversable	Data.Foldable.WithIndex

   Traverse elements with access to the index i, discarding the results (with the arguments flipped).

   ifor_ ≡ flip itraverse_
   

   When you don't need access to the index then for_ is more flexible in what it accepts.

   for_ a ≡ ifor_ a . const
   

10. ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b)

    indexed-traversable	Data.Traversable.WithIndex

    Traverse with an index (and the arguments flipped).

    for a ≡ ifor a . const
    ifor ≡ flip itraverse
    

Page 518 of many | Previous | Next