Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. firstNode :: forall n (x :: Extensibility) . Block n C x -> n C O

   ghc-lib-parser	GHC.Cmm.Dataflow.Block

   No documentation available.

2. fIRST_TAG :: ConTag

   ghc-lib-parser	GHC.Core.DataCon

   Tags are allocated from here for real constructors or for superclass selectors

3. firstJust :: Maybe a -> Maybe a -> Maybe a

   ghc-lib-parser	GHC.Data.Maybe

   No documentation available.

4. firstJusts :: Foldable f => f (Maybe a) -> Maybe a

   ghc-lib-parser	GHC.Data.Maybe

   Takes a list of Maybes and returns the first Just if there is one, or Nothing otherwise.

5. firstJustsM :: (Monad m, Foldable f) => f (m (Maybe a)) -> m (Maybe a)

   ghc-lib-parser	GHC.Data.Maybe

   Takes computations returnings Maybes; tries each one in order. The first one to return a Just wins. Returns Nothing if all computations return Nothing.

6. first_code :: GenStackFrame b -> !b

   ghc-lib-parser	GHC.Exts.Heap.Closures

   No documentation available.

7. fIRST_TAG :: ConTag

   ghc-lib-parser	GHC.Types.Basic

   Tags are allocated from here for real constructors or for superclass selectors

8. firstDataDefnCon :: DataDefnCons a -> Maybe a

   ghc-lib-parser	Language.Haskell.Syntax.Decls

   Retrieve the first data constructor in a DataDefnCons (if one exists).

9. first' :: Strong p => p i a b -> p i (a, c) (b, c)

   indexed-profunctors	Data.Profunctor.Indexed

   No documentation available.

10. firstMap :: forall d (f :: Type -> Type -> Type) a b . (DFunctor d, Bifunctor f) => (a -> b) -> d (f a) -> d (f b)

    yaya	Yaya.Functor

    This isn’t a Functor instance because of the position of the a, but you can use it like: > newtype List a = List (Mu (XNor a)) > instance Functor List where > fmap f (List mu) = List (firstMap f mu)

Page 22 of many | Previous | Next