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

Test.Credit.Queue.Bankers

Documentation

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

Constructors

BQueue 

Fields

Instances

Instances details
BoundedQueue BQueue Source # 
Instance details

Defined in Test.Credit.Queue.Bankers

Methods

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

Queue BQueue Source # 
Instance details

Defined in Test.Credit.Queue.Bankers

Methods

empty :: MonadLazy m => m (BQueue a m) Source #

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

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

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

Defined in Test.Credit.Queue.Bankers

Methods

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

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

Defined in Test.Credit.Queue.Bankers

Methods

prettyStructure :: MonadMemory m => BQueue (PrettyCell a) m -> m Memory Source #

allEvaluated :: MonadInherit m => StreamCell m a -> m () Source #

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

allInvariant :: MonadInherit m => Maybe Int -> StreamCell m a -> m () Source #

invariant :: MonadInherit m => Stream m a -> Maybe Int -> m () Source #

bqueue :: MonadInherit m => Int -> Int -> Stream m a -> Stream m a -> m (BQueue a m) Source #

isEmpty :: forall a (m :: Type -> Type). BQueue a m -> Bool Source #

lazyqueue :: MonadInherit m => BQueue a m -> m [a] Source #