Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. newtype SequenceT (m :: Type -> Type) a

    monad-schedule Control.Monad.Schedule.Sequence

    Any monad can be trivially scheduled by executing all actions sequentially.

  2. SequenceT :: m a -> SequenceT (m :: Type -> Type) a

    monad-schedule Control.Monad.Schedule.Sequence

    No documentation available.

  3. unSequence :: SequenceT (m :: Type -> Type) a -> m a

    monad-schedule Control.Monad.Schedule.Sequence

    No documentation available.

  4. type BDeque = Deque MVector

    mutable-containers Data.Mutable

    A Deque specialized to boxed vectors. Since 0.2.0

  5. data Deque (v :: Type -> Type -> Type) s a

    mutable-containers Data.Mutable

    A double-ended queue supporting any underlying vector type and any monad. This implements a circular double-ended queue with exponential growth. Since 0.2.0

  6. type MutableDeque c = (MutableQueue c, MutablePushFront c, MutablePopBack c)

    mutable-containers Data.Mutable

    Collections which allow pushing and popping at the front and back. Since 0.2.0

  7. type MutableQueue c = (MutablePopFront c, MutablePushBack c)

    mutable-containers Data.Mutable

    Collections which allow pushing and popping at the front (aka FIFOs). Since 0.2.0

  8. type SDeque = Deque MVector

    mutable-containers Data.Mutable

    A Deque specialized to storable vectors. Since 0.2.0

  9. type UDeque = Deque MVector

    mutable-containers Data.Mutable

    A Deque specialized to unboxed vectors. Since 0.2.0

  10. asBDeque :: BDeque s a -> BDeque s a

    mutable-containers Data.Mutable

    Since 0.2.0

Page 497 of many | Previous | Next