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

Test.Credit.Queue.Realtime

Synopsis

Documentation

indirect :: MonadInherit m => SLazyCon m (Stream m a) -> m (Stream m a) Source #

Delay a computation, but do not consume any credits

data RQueue a (m :: Type -> Type) Source #

Constructors

RQueue 

Fields

Instances

Instances details
BoundedQueue RQueue Source # 
Instance details

Defined in Test.Credit.Queue.Realtime

Methods

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

Queue RQueue Source # 
Instance details

Defined in Test.Credit.Queue.Realtime

Methods

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

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

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

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

Defined in Test.Credit.Queue.Realtime

Methods

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

Pretty a => MemoryStructure (RQueue (PrettyCell a)) Source # 
Instance details

Defined in Test.Credit.Queue.Realtime

rqueue :: MonadInherit m => RQueue a m -> m (RQueue a m) Source #