NAME

SWISH::Prog::Queue - simple in-memory FIFO queue class

SYNOPSIS

 use SWISH::Prog::Queue;
 my $queue = SWISH::Prog::Queue->new;
 
 $queue->put( 'foo' );
 $queue->size;          # returns number of items in queue (1)
 $queue->peek;          # returns 'foo' (next value for get())
 $queue->get;           # returns 'foo' and removes it from queue

DESCRIPTION

SWISH::Prog::Queue is basically a Perl array, but it defines an API that can be implemented using any kind of storage and logic you want. One example would be a database that tracks items to be evaluated, or a flat file list.

METHODS

See SWISH::Prog::Class.

init

Overrides base method.

put( item )

Add item to the queue. Default is to push() it to end of queue.

get

Returns the next item. Default is to shift() it from the front of the queue.

peek

Returns the next item value, but leaves it on the stack.

size

Returns the number of items currently in the queue.

AUTHOR

Peter Karman, <perl@peknet.com>

COPYRIGHT AND LICENSE

Copyright 2008 by Peter Karman

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.