package Array::Heap::PriorityQueue::Numeric;
use strict;
use warnings;
use vars qw( $VERSION );
$VERSION = '1.10';
use Array::Heap qw( make_heap pop_heap push_heap );

=head1 NAME

Array::Heap::PriorityQueue::Numeric - Numeric priority queue


   use Array::Heap::PriorityQueue::Numeric;
   my $pq = Array::Heap::PriorityQueue::Numeric->new();
   $pq->add('fish', 42);
   $pq->add('banana', 27);
   print $pq->get(), "\n"; # banana
   print $pq->peek(), "\n"; # fish


This module implements a priority queue, which is a data structure that can
efficiently locate the item with the lowest weight at any time. This is useful
for writing cost-minimizing and shortest-path algorithms.

Weights are numeric values.

This module is a wrapper for the *_heap methods provided by L<Array::Heap>.


=over 4

=item Array::Heap::PriorityQueue::Numeric->new()

Create a new, empty priority queue.


sub new {
   my ($class) = @_;
   return bless [ ] => $class;

=item $pq->add($item, $weight)

Add an item to the priority queue with the given weight. Weight must be
numeric, and defaults to item.


sub add {
   my ($self, $item, $weight) = @_;
   $weight = $item + 0 unless defined $weight;
   push_heap @$self, [ $weight, $item ];

=item $pq->peek()

Return the first (numerically lowest weight) item from the queue.
Does not modify the queue. Returns undef if the queue is empty.


sub peek {
   my ($self) = @_;
   my $node = $self->[0] or return;
   return $node->[1];

=item $pq->get()

Removes the first item from the priority queue and returns it.
Returns undef if the queue is empty. If two items in the queue
have equal weight, this module makes no guarantee as to which
one will be returned first.


sub get {
   my ($self) = @_;
   my $node = pop_heap @$self or return;
   return $node->[1];

=item $pq->min_weight()

Returns the weight of the lowest item in the queue, or undef if empty.


sub min_weight {
   my ($self) = @_;
   my $node = $self->[0] or return;
   return $node->[0];

=item $pq->size()

Returns the number of items in the priority queue.


sub size {
   my ($self) = @_;
   return scalar @$self;

=item $pq->items()

Returns all items in the heap, in an arbitrary order.


sub items {
   my ($self) = @_;
   return map { $_->[1] } @$self;

=item $pq->sorted_items()

Returns all items in the heap, in weight order.


sub sorted_items {
   my ($self) = @_;
   return map { $_->[1] } sort { $a->[0] <=> $b->[0] } @$self;

=item $pq->add_unordered($item, $weight)

Add an item to the priority queue or change its weight, without updating
the heap structure. If you are adding a bunch of items at once, it may be
more efficient to use add_unordered, then call $pq->restore_order() once
you are done. Weight defaults to item.


sub add_unordered {
   my ($self, $item, $weight) = @_;
   $weight = $item + 0 unless defined $weight;
   push @$self, [ $weight, $item ];

=item $pq->restore_order()

Restore the heap structure after calling add_unordered. You need to do this
before calling any of the ordered methods (add, peek, or get).


sub restore_order {
   my ($self) = @_;
   make_heap @$self;



Weights are sorted in increasing order only. If you want it the other way,
use the negative of the weights you have.

=head1 SEE ALSO


=head1 AUTHOR

Bob Mathews <>




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

The full text of the license can be found in the
LICENSE file included with this module.


1 # end