-
package threads::shared::queue;
use threads::shared;
use strict;
-sub new {
- my $class = shift;
- my @q : shared = @_;
- my $q = \@q;
- return bless $q, $class;
-}
-
-sub dequeue {
- my $q = shift;
- lock(@$q);
- until(@$q) {
- cond_wait(@$q);
- }
- return shift @$q;
-}
-
-sub dequeue_nb {
- my $q = shift;
- lock(@$q);
- if (@$q) {
- return shift @$q;
- } else {
- return undef;
- }
-}
-
-sub enqueue {
- my $q = shift;
- lock(@$q);
- push(@$q, @_) and cond_broadcast @$q;
-}
-
-sub pending {
- my $q = shift;
- lock(@$q);
- return scalar(@$q);
-}
-
-1;
+our $VERSION = '1.00';
=head1 NAME
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)
+the middle of the list).
=head1 FUNCTIONS AND METHODS
=item enqueue LIST
The C<enqueue> method adds a list of scalars on to the end of the queue.
-The queue will grow as needed to accomodate the list.
+The queue will grow as needed to accommodate the list.
=item dequeue
=head1 SEE ALSO
-L<threads> L<threads::shared>
+L<threads>, L<threads::shared>
=cut
+sub new {
+ my $class = shift;
+ my @q : shared = @_;
+ return bless \@q, $class;
+}
+
+sub dequeue {
+ my $q = shift;
+ lock(@$q);
+ cond_wait @$q until @$q;
+ cond_signal @$q if @$q > 1;
+ return shift @$q;
+}
+
+sub dequeue_nb {
+ my $q = shift;
+ lock(@$q);
+ return shift @$q;
+}
+
+sub enqueue {
+ my $q = shift;
+ lock(@$q);
+ push @$q, @_ and cond_signal @$q;
+}
+
+sub pending {
+ my $q = shift;
+ lock(@$q);
+ return scalar(@$q);
+}
+
+1;
+
+