Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. module Data.Histogram.Bin.MaybeBin

    No documentation available.

  2. newtype MaybeBin bin

    histogram-fill Data.Histogram.Bin.MaybeBin

    This binning algorithms adds special case of no value.

  3. MaybeBin :: bin -> MaybeBin bin

    histogram-fill Data.Histogram.Bin.MaybeBin

    No documentation available.

  4. data MaybeStep

    hledger-iadd Model

    No documentation available.

  5. newtype MaybeBij

    mappings Data.Bijection

    A newtype, just to get a partial monoidal structure representing consistent unions.

  6. MaybeBij :: Maybe Bij -> MaybeBij

    mappings Data.Bijection

    No documentation available.

  7. 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)

  8. class MaybeLike a v | a -> v

    monad-memo Data.MaybeLike

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

  9. module Control.Monad.Ology.Specific.MaybeT

    No documentation available.

  10. 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.

Page 25 of many | Previous | Next