Thread::Queue - thread-safe queues
my $q = new Thread::Queue;
$q->enqueue("foo", "bar");
my $foo = $q->dequeue; # The "bar" is still in the queue.
my $foo = $q->dequeue_nb; # returns "bar", or undef if the queue was empty
my $left = $q->pending; # returns the number of items still in the queue
A queue, as implemented by C<Thread::Queue> 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
=head1 FUNCTIONS AND METHODS
The C<new> function creates a new empty queue.
The C<enqueue> method adds a list of scalars on to the end of the queue.
The queue will grow as needed to accommodate the list.
The C<dequeue> method removes a scalar from the head of the queue and
returns it. If the queue is currently empty, C<dequeue> will block the
thread until another thread C<enqueue>s a scalar.
The C<dequeue_nb> method, like the C<dequeue> method, removes a scalar from
the head of the queue and returns it. Unlike C<dequeue>, though,
C<dequeue_nb> won't block if the queue is empty, instead returning
The C<pending> method returns the number of items still in the queue.
L<threads>, L<threads::shared>
return bless \
@q, $class;
cond_signal @
$q if @
$q > 1;
push @
$q, @_ and cond_signal @
$q;