This package contains a lock-free implementation of two kinds of queues: FIFO and LIFO.
There is no hard guarantees from currently existing VMs about an atomicity of certain operations.
However, a current VMs implementation can't interrupt a running process between two simple assignments:
x := y.
y := z.
Therefore, these two operations can be considered as one atomic operation, and can be used by various lock-free algorithms.
Use Collections-Atomic package
Collections-Atomic-IgorStasenko.1.mcz