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.
newtype
SequenceT (m :: Type -> Type) amonad-schedule Control.Monad.Schedule.Sequence Any monad can be trivially scheduled by executing all actions sequentially.
SequenceT :: m a -> SequenceT (m :: Type -> Type) amonad-schedule Control.Monad.Schedule.Sequence No documentation available.
unSequence :: SequenceT (m :: Type -> Type) a -> m amonad-schedule Control.Monad.Schedule.Sequence No documentation available.
-
mutable-containers Data.Mutable A Deque specialized to boxed vectors. Since 0.2.0
data
Deque (v :: Type -> Type -> Type) s amutable-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
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
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
-
mutable-containers Data.Mutable A Deque specialized to storable vectors. Since 0.2.0
-
mutable-containers Data.Mutable A Deque specialized to unboxed vectors. Since 0.2.0
asBDeque :: BDeque s a -> BDeque s amutable-containers Data.Mutable Since 0.2.0