package Heap
::Elem
::NumRev
;
use vars
qw($VERSION @ISA @EXPORT @EXPORT_OK);
@ISA = qw(Exporter AutoLoader);
# Available for export: NumRElem (to allocate a new Heap::Elem::NumRev value)
@EXPORT_OK = qw( NumRElem );
# Preloaded methods go here.
$class = ref($class) || $class;
# two slot array, 0 for the numeric value, 1 for use by Heap
my $self = [ shift, undef ];
return bless $self, $class;
sub NumRElem
{ # exportable synonym for new
Heap
::Elem
::NumRev
->new(@_);
@_ ?
($self->[0] = shift) : $self->[0];
@_ ?
($self->[1] = shift) : $self->[1];
# compare two NumR elems (reverse order)
return $other->[0] <=> $self->[0];
# Autoload methods go after =cut, and are processed by the autosplit program.
# Below is the stub of documentation for your module. You better edit it!
Heap::Elem::NumRev - Perl extension for Reversed Numeric Heap Elements
use Heap::Elem::NumRev( NumRElem );
my $heap = Heap::Fibonacci->new;
while( defined( $elem = $heap->extract_top ) ) {
print "Largest is ", $elem->val, "\n";
Heap::Elem::NumRev is used to wrap numeric values into an element
that can be managed on a heap. The top of the heap will have
the largest element still remaining. (See L<Heap::Elem::Num>
if you want the heap to always return the smallest element.)
The details of the Elem interface are described in L<Heap::Elem>.
The details of using a Heap interface are described in L<Heap>.
John Macdonald, jmm@perlwolf.com
Copyright 1998-2003, O'Reilly & Associates.
This code is distributed under the same copyright terms as perl itself.
Heap(3), Heap::Elem(3), Heap::Elem::Num(3).