| A linked list based channel implementation. The algorithm avoids contention
between puts and takes when the queue is not empty. Normally a put and a
take can proceed simultaneously. (Although it does not allow multiple
concurrent puts or takes.) This class tends to perform more efficently than
other Queue implementations in producer/consumer applications.
[
Introduction to this package. ]
|