A class that provides a very simply unbounded queue.
The main requirement here is that the class support constant time (very fast)
deletion of arbitrary elements. An instance of this class must be thread safe,
either by locking or by using a wait-free algorithm (preferred).
The interface is made as simple is possible to make it easier to produce
a wait-free implementation. |