Instances1DequeClass
DequeClass LinkedQueueDefined in lockfree-queue-0.2.4 · Data.Concurrent.Queue.MichaelScott
Modulelockfree-queue-0.2.4Haskell2010
Data.Concurrent.Queue.MichaelScott
Michael and Scott lock-free, single-ended queues.
This is a straightforward implementation of classic Michael & Scott Queues. Pseudocode for this algorithm can be found here:
http://www.cs.rochester.edu/research/synchronization/pseudocode/queues.html
Synopsis
- data LinkedQueue
- value newQ
- value nullQ
- value pushL
- value tryPopR
- Packagelockfree-queue-0.2.4
- Exports5
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceMichaelScott.hs
Create a new queue.
Is the queue currently empty? Beware that this can be a highly transient state.
Push a new element onto the queue. Because the queue can grow, this always succeeds.
Attempt to pop an element from the queue if one is available. tryPop will return semi-promptly (depending on contention), but will return Nothing if the queue is empty.