Control.Monad.Queue.Allison

A library implementation of corecursive queues, see Circular Programs and Self-Referential Structures by Lloyd Allison, Software Practice and Experience, 19(2), pp.99-109, Feb 1989

http://www.csse.monash.edu.au/~lloyd/tildeFP/1989SPE/

For an explanation of the library implementation, see Lloyd Allison's Corecursive Queues: Why Continuations Matter by Leon P Smith, in The Monad Reader issue 14. This library corresponds to CorecQ in that paper.

Documentation

data Q e a

Instances

MonadQueue e (Q e)

Monad (Q e)

type LenType = Word

runQueue :: Q e a -> [e]

Returns a list of all elements enqueued during the queue computation

enQ :: e -> Q e ()

Enqueues an element to the queue

deQ :: Q e (Maybe e)

Dequeues an element, returns Nothing if the queue is empty.

deQs :: Integral len => len -> Q e [e]

Dequeues up to len elements from the queue

deQ_break :: Q e e

Dequeues an element: terminates the queue computation if the queue is empty.

peekQ :: Q e (Maybe e)

Examines the front element of the queue without removing it.

peekQn :: Integral index => index -> Q e (Maybe e)

Examines the element currently at position index in the queue, indexing starts with 0, like !!.

peekQs :: Integral maxlen => maxlen -> Q e [e]

Examines up to maxlen elements of the queue without removing them.

lenQ :: Integral len => Q e len

Returns the length of the queue

lenQ_ :: Q e LenType

Returns the length of the queue

callCC :: ((a -> forall b. Q e b) -> Q e a) -> Q e a