
ForSyDe.Shallow.Queue  Portability  portable  Stability  experimental  Maintainer  forsydedev@ict.kth.se 



Description 
This provides two data types, that can be used to model queue
structures, such as FIFOs. There is a data type for an queue of
infinite size Queue and one for finite size FiniteQueue.


Synopsis 



Documentation 


A queue is modeled as a list. The data type Queue modelles an queue of infinite size.
 Constructors   Instances  



The data type FiniteQueue has an additional parameter, that determines the size of the queue.
 Constructors   Instances  



pushQ pushes one element into an infinite queue.



pushListQ pushes a list of elements into an infinite queue.



popQ pops one element from an infinite queue.



queue transforms a list into an infinite queue.



pushFQ pushes one element into a finite queue.



pushListFQ pushes a list of elements into a finite queue.



popFQ pops one element from a finite queue.



finiteQueue transforms a list into an infinite queue.


Produced by Haddock version 2.1.0 