úÎ_Ñ     +return the number of elements in the queue  >return the whole contents of the queue (if possible) without  altering the queue'+s contents. Obviously in cases where this  can'9t be done lazily this can be a very expensive operation. =peek a specified number of items off the queue. The default C implementation is hideously wasteful in cases where peekQueue is ' not able to get the contents lazily. :Pull an item matching the given predicate out of a queue. =Pull an item out of a queue. Should not block. No ordering B constraints are implied other than that any item that went into  the queue really ought to come out before  returns  . <Put an item into a queue. May block while trying to do so. C No constraint is placed on the behavior of the queue except that  every item put in really ought to come out sometime before   returns a . HA type class carrying an altered set of functional dependencies used to K constrain queues when the type of the queue never escapes far enough for ' a more deliberate choice to be made. Construct a new FIFO queue.       3 : write-only newtype wrapper for arbitrary queues 2 : read-only newtype wrapper for arbitrary queues IConstruct a new FIFO of a type suitable for carrying the supplied thing. 9 Does not actually do anything with the thing supplied.           !"#$%&'()*+ queue-0.1.2Data.Queue.InstancesData.Queue.Classes Data.QueueData.Queue.Instances.STMbaseControl.Concurrent.ChanChan GHC.Conc.Sync atomicallySTMGHC.MVarMVar stm-2.2.0.1Control.Concurrent.STM.TMVarTMVarControl.Concurrent.STM.TChanTChan QueueSize queueSize PeekQueue peekQueuepeekQueueTaking DequeueWhere dequeueWhereDequeuedequeue dequeueBatchEnqueueenqueue enqueueBatch DefaultFifoNewFifonewFifoWQueueRQueuemkRQueuemkWQueue Data.MaybeNothingWQRQnewDefaultFifoFor