Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

  1. MaybeBij :: Maybe Bij -> MaybeBij

    mappings Data.Bijection

    No documentation available.

  2. module Data.MaybeLike

    Defines MaybeLike typeclass - a generic way to look at some types as if they were Maybe It is currently used to add maybe-ness to unboxed primitive types in cases when it isn't possuble to just use `Maybe a` (e.g. unboxed arrays)

  3. class MaybeLike a v | a -> v

    monad-memo Data.MaybeLike

    An abstract interface to a type which may not have a value

  4. module Control.Monad.Ology.Specific.MaybeT

    No documentation available.

  5. newtype MaybeT (m :: Type -> Type) a

    monadology Control.Monad.Ology.Specific.MaybeT

    The parameterizable maybe monad, obtained by composing an arbitrary monad with the Maybe monad. Computations are actions that may produce a value or exit. The return function yields a computation that produces that value, while >>= sequences two subcomputations, exiting if either computation does.

  6. MaybeT :: m (Maybe a) -> MaybeT (m :: Type -> Type) a

    monadology Control.Monad.Ology.Specific.MaybeT

    No documentation available.

  7. module Opaleye.Internal.MaybeFields

    No documentation available.

  8. data MaybeFields fields

    opaleye Opaleye.Internal.MaybeFields

    The Opaleye analogue of Maybe. A value of type MaybeFields a either contains a value of type a, or it contains nothing.

  9. MaybeFields :: Column SqlBool -> fields -> MaybeFields fields

    opaleye Opaleye.Internal.MaybeFields

    No documentation available.

  10. module Opaleye.MaybeFields

    MaybeFields is Opaleye's analogue to Maybe. You probably won't want to create values of type MaybeFields directly; instead they will appear as the result of left/right/outer join-like operations, such as optionalRestrict and optional.

Page 96 of many | Previous | Next