creditmonad-1.0.0: Reasoning about amortized time complexity
Safe HaskellNone
LanguageGHC2021

Test.Credit.Queue.Batched

Documentation

data Batched a (m :: k) Source #

Constructors

Batched [a] [a] 

Instances

Instances details
(MonadMemory m, MemoryCell m a) => MemoryCell m (Batched a m) Source # 
Instance details

Defined in Test.Credit.Queue.Batched

Methods

prettyCell :: Batched a m -> m Memory Source #

BoundedQueue (Batched :: Type -> (Type -> Type) -> Type) Source # 
Instance details

Defined in Test.Credit.Queue.Batched

Methods

qcost :: Size -> QueueOp a -> Credit Source #

Queue (Batched :: Type -> (Type -> Type) -> Type) Source # 
Instance details

Defined in Test.Credit.Queue.Batched

Methods

empty :: MonadInherit m => m (Batched a m) Source #

snoc :: MonadInherit m => Batched a m -> a -> m (Batched a m) Source #

uncons :: MonadInherit m => Batched a m -> m (Maybe (a, Batched a m)) Source #

Pretty a => MemoryStructure (Batched (PrettyCell a) :: (Type -> Type) -> Type) Source # 
Instance details

Defined in Test.Credit.Queue.Batched

rev :: MonadCount m => [a] -> [a] -> m [a] Source #

bqueue :: MonadCount m => Batched a m -> m (Batched a m) Source #