# Heap::Elem::NumRev - Reversed Numeric Heap Elements - perldoc - [phpMan]

## NAME
    [Heap::Elem::NumRev](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AElem%3A%3ANumRev/markdown) - Reversed Numeric Heap Elements

## SYNOPSIS
      use [Heap::Elem::NumRev](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AElem%3A%3ANumRev/markdown)( NumRElem );
      use [Heap::Fibonacci](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AFibonacci/markdown);

      my $heap = [Heap::Fibonacci](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AFibonacci/markdown)->new;
      my $elem;

      foreach $i ( 1..100 ) {
          $elem = NumRElem( $i );
          $heap->add( $elem );
      }

      while( defined( $elem = $heap->extract_top ) ) {
          print "Largest is ", $elem->val, "\n";
      }

## DESCRIPTION
    [Heap::Elem::NumRev](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AElem%3A%3ANumRev/markdown) 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 [Heap::Elem::Num](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AElem%3A%3ANum/markdown) if you
    want the heap to always return the smallest element.)

    The details of the Elem interface are described in [Heap::Elem](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AElem/markdown).

    The details of using a Heap interface are described in Heap.

## AUTHOR
    John Macdonald, <john@perlwolf.com>

## COPYRIGHT
    Copyright 1998-2007, O'Reilly & Associates.

    This code is distributed under the same copyright terms as perl itself.

## SEE ALSO
    [Heap(3)](https://www.chedong.com/phpMan.php/man/Heap/3/markdown), Heap::[Elem(3)](https://www.chedong.com/phpMan.php/man/Elem/3/markdown), [Heap::Elem](https://www.chedong.com/phpMan.php/perldoc/Heap%3A%3AElem/markdown)::[Num(3)](https://www.chedong.com/phpMan.php/man/Num/3/markdown).