Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

  1. module Rebase.Data.UUID

    No documentation available.

  2. unId :: Id a -> a

    rebase Rebase.Data.Vector.Fusion.Util

    No documentation available.

  3. module Rebase.Data.Void

    No documentation available.

  4. class Semigroup a => Monoid a

    rebase Rebase.Prelude

    The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

    You can alternatively define mconcat instead of mempty, in which case the laws are: The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

  5. pattern ThreadId :: () => ThreadId# -> ThreadId

    rebase Rebase.Prelude

    No documentation available.

  6. data UUID

    rebase Rebase.Prelude

    Type representing Universally Unique Identifiers (UUID) as specified in RFC 4122.

  7. data Validation e a

    rebase Rebase.Prelude

    Selective instance for the standard applicative functor Validation. This is a good example of a non-trivial selective functor which is not a monad.

  8. clId :: forall (m :: Type -> Type) cl a . Monad m => ClSF m cl a a

    rhine FRP.Rhine.ClSF.Util

    The identity synchronous stream function.

  9. newtype WorkerId

    scheduler Control.Scheduler

    A unique id for the worker in the Scheduler context. It will always be a number from 0 up to, but not including, the number of workers a scheduler has, which in turn can always be determined with numWorkers function.

  10. WorkerId :: Int -> WorkerId

    scheduler Control.Scheduler

    No documentation available.

Page 1323 of many | Previous | Next