Thread::Queue - thread-safe queues
A queue, as implemented by
is a thread-safe
data structure much like a list. Any number of threads can safely
add elements to the end of the list, or remove elements from the head
of the list. (Queues don't permit adding or removing elements from
the middle of the list).
function creates a new empty queue.
method adds a list of scalars on to the end of the queue.
The queue will grow as needed to accommodate the list.
method removes a scalar from the head of the queue and
returns it. If the queue is currently empty,
will block the
thread until another thread
s a scalar.
method, like the
method, removes a scalar from
the head of the queue and returns it. Unlike
won't block if the queue is empty, instead returning
method returns the number of items still in the queue.