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. runMaybeF :: MaybeF (f :: k -> Type) (a :: k) -> Maybe (f a)

   functor-combinators	Control.Applicative.ListF

   No documentation available.

2. runMaybeF :: MaybeF (f :: k -> Type) (a :: k) -> Maybe (f a)

   functor-combinators	Data.Functor.Combinator

   No documentation available.

3. data PMaybe (a :: k -> Type) (b :: Maybe k)

   functor-products	Data.Type.Functor.Product

   A PMaybe f 'Nothing contains nothing, and a PMaybe f ('Just a) contains an f a. In practice this can be useful to write polymorphic functions/abstractions that contain an argument that can be "turned off" for different instances.

4. type XMaybe (f :: k -> Type) = PMaybe XData f

   functor-products	Data.Type.Functor.XProduct

   PMaybe over HKD-d types.

5. warnFromMaybe :: forall (m :: Type -> Type) p a h . Monad m => RuntimeError p -> a -> Maybe a -> Run p m h a

   ginger	Text.Ginger.Run.Type

   No documentation available.

6. traverseMaybe :: Applicative f => forall a . () => (a -> f (Maybe b)) -> OrderedMap a -> f (OrderedMap b)

   graphql	Language.GraphQL.Execute.OrderedMap

   Traverse over the elements and collect the Just results.

7. arbitraryMaybe :: Gen a -> Gen (Maybe a)

   haskoin-core	Haskoin.Util.Arbitrary.Util

   Generate a Maybe from a Gen a

8. eitherToMaybe :: Either a b -> Maybe b

   haskoin-core	Haskoin.Util.Helpers

   Transform an Either value into a Maybe value. Right is mapped to Just and Left is mapped to Nothing. The value inside Left is lost.

9. getMaybe :: MonadGet m => m a -> m (Maybe a)

   haskoin-core	Haskoin.Util.Helpers

   No documentation available.

10. liftMaybe :: forall (m :: Type -> Type) b a . Monad m => b -> Maybe a -> ExceptT b m a

    haskoin-core	Haskoin.Util.Helpers

    Lift a Maybe computation into the ExceptT monad.

Page 242 of many | Previous | Next