[BACK]Return to Queue.pm CVS log [TXT] [DIR] Up to [LON-CAPA] / loncom / types
File:  [LON-CAPA] / loncom / types / Queue.pm
Revision 1.4: download - view: text, annotated - select for diffs
Thu Apr 24 15:12:40 2003 UTC (22 years ago) by albertel
Branches: MAIN
CVS tags: version_2_9_X, version_2_9_99_0, version_2_9_1, version_2_9_0, version_2_8_X, version_2_8_99_1, version_2_8_99_0, version_2_8_2, version_2_8_1, version_2_8_0, version_2_7_X, version_2_7_99_1, version_2_7_99_0, version_2_7_1, version_2_7_0, version_2_6_X, version_2_6_99_1, version_2_6_99_0, version_2_6_3, version_2_6_2, version_2_6_1, version_2_6_0, version_2_5_X, version_2_5_99_1, version_2_5_99_0, version_2_5_2, version_2_5_1, version_2_5_0, version_2_4_X, version_2_4_99_0, version_2_4_2, version_2_4_1, version_2_4_0, version_2_3_X, version_2_3_99_0, version_2_3_2, version_2_3_1, version_2_3_0, version_2_2_X, version_2_2_99_1, version_2_2_99_0, version_2_2_2, version_2_2_1, version_2_2_0, version_2_1_X, version_2_1_99_3, version_2_1_99_2, version_2_1_99_1, version_2_1_99_0, version_2_1_3, version_2_1_2, version_2_1_1, version_2_1_0, version_2_12_X, version_2_11_X, version_2_11_6_msu, version_2_11_6, version_2_11_5_msu, version_2_11_5, version_2_11_4_uiuc, version_2_11_4_msu, version_2_11_4, version_2_11_3_uiuc, version_2_11_3_msu, version_2_11_3, version_2_11_2_uiuc, version_2_11_2_msu, version_2_11_2_educog, version_2_11_2, version_2_11_1, version_2_11_0_RC3, version_2_11_0_RC2, version_2_11_0_RC1, version_2_11_0, version_2_10_X, version_2_10_1, version_2_10_0_RC2, version_2_10_0_RC1, version_2_10_0, version_2_0_X, version_2_0_99_1, version_2_0_2, version_2_0_1, version_2_0_0, version_1_99_3, version_1_99_2, version_1_99_1_tmcc, version_1_99_1, version_1_99_0_tmcc, version_1_99_0, version_1_3_X, version_1_3_3, version_1_3_2, version_1_3_1, version_1_3_0, version_1_2_X, version_1_2_99_1, version_1_2_99_0, version_1_2_1, version_1_2_0, version_1_1_X, version_1_1_99_5, version_1_1_99_4, version_1_1_99_3, version_1_1_99_2, version_1_1_99_1, version_1_1_99_0, version_1_1_3, version_1_1_2, version_1_1_1, version_1_1_0, version_1_0_99_3, version_1_0_99_2, version_1_0_99_1, version_1_0_99, version_1_0_3, version_1_0_2, version_1_0_1, version_1_0_0, version_0_99_5, version_0_99_4, version_0_99_3, version_0_99_2, version_0_99_1, version_0_99_0, loncapaMITrelate_1, language_hyphenation_merge, language_hyphenation, conference_2003, bz6209-base, bz6209, bz5969, bz2851, PRINT_INCOMPLETE_base, PRINT_INCOMPLETE, HEAD, GCI_3, GCI_2, GCI_1, BZ5971-printing-apage, BZ5434-fox, BZ4492-merge, BZ4492-feature_horizontal_radioresponse
- fixing pod

#  Implement a simple queue in terms of a list.
#
# $Id: Queue.pm,v 1.4 2003/04/24 15:12:40 albertel Exp $
#
# Copyright Michigan State University Board of Trustees
#
# This file is part of the LearningOnline Network with CAPA (LON-CAPA).
#
# LON-CAPA is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# LON-CAPA is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with LON-CAPA; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
#
# /home/httpd/html/adm/gpl.txt
#
# http://www.lon-capa.org/
#

=pod

=head1 Queue

An object oriented implementation of a queue data structure.  queues
are first in last out data structures.

=head1 Member functions:

=cut

package Queue;


=pod

=head2 new 

  Construct a new queue.

=cut

sub new {
    my $class = shift;		# Class name to bless into.
    my $self  = [];		# Our data is a reference to an anon. array.

    bless($self, $class);	# Type this as an object.

    return $self;
}

=pod

=head2 enqueue

   Add an element to the tail of the queue.

=cut

sub enqueue {
    my $self = shift;		# Get object reference.
    my $item = shift;		# Get the item to enqueue...
    push(@$self, $item);		# Push the item to the back of the array.


}

=pod

=head2 dequeue

   Remove an element from the front of the queue.

=cut

sub dequeue {
    my $self = shift;		# Get object reference....
    return shift @$self;		# Remove from the front of the queue.
}


=pod  

=head1 Count

Returns number of items in a queue.

=cut

sub Count {
    my $self = shift;
    my $count = scalar(@$self);
    return $count;
}

1;

=pod

=head1 Theory

The queue is implemented as an array... enqueue is a thinly disguised
push, and dequeue is a thinly disguised shift.  This is probably quite
in efficient for large queues, but should be fine for reasonably sized
queues.

Note that since Perl is a dynamically typed language, queues can
contain objects of any data type and can even be heterogenously typed.

=cut
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>