Heap::Elem::NumRev(3pm) User Contributed Perl Documentation Heap::Elem::NumRev(3pm)NAME
Heap::Elem::NumRev - Reversed Numeric Heap Elements
SYNOPSIS
use Heap::Elem::NumRev( NumRElem );
use Heap::Fibonacci;
my $heap = Heap::Fibonacci->new;
my $elem;
foreach $i ( 1..100 ) {
$elem = NumRElem( $i );
$heap->add( $elem );
}
while( defined( $elem = $heap->extract_top ) ) {
print "Largest is ", $elem->val, "
";
}
DESCRIPTION
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 Heap::Elem::Num if you want the heap to always return the smallest element.)
The details of the Elem interface are described in Heap::Elem.
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), Heap::Elem(3), Heap::Elem::Num(3).
perl v5.8.8 2007-10-23 Heap::Elem::NumRev(3pm)
Check Out this Related Man Page
Heap::Elem::Ref(3pm) User Contributed Perl Documentation Heap::Elem::Ref(3pm)NAME
Heap::Elem::Ref - Object Reference Heap Elements
SYNOPSIS
use Heap::Elem::Ref( RefElem );
use Heap::Fibonacci;
my $heap = Heap::Fibonacci->new;
my $elem;
foreach $i ( 1..100 ) {
$obj = myObject->new( $i );
$elem = RefElem( $obj );
$heap->add( $elem );
}
while( defined( $elem = $heap->extract_top ) ) {
# assume that myObject object have a method I<printable>
print "Smallest is ", $elem->val->printable, "
";
}
DESCRIPTION
Heap::Elem::Ref is used to wrap object reference values into an element that can be managed on a heap. Each referenced object must have a
method cmp which can compare itself with any of the other objects that have references on the same heap. These comparisons must be consis-
tant with normal arithmetic. The top of the heap will have the smallest (according to cmp) element still remaining. (See
Heap::Elem::RefRev if you want the heap to always return the largest element.)
The details of the Elem interface are described in Heap::Elem.
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), Heap::Elem(3), Heap::Elem::RefRev(3).
perl v5.8.8 2007-10-23 Heap::Elem::Ref(3pm)
I'm a new guy to this field and I'm learning a lot about UNIX! Can any explan to me what exactly does 'heap size' mean and how can i increase the size for AIX 4.3.3? (2 Replies)
Hi all,
Thanks 'thehoghunter' and 'hugo' for the comments!
I've to increase the size of the heap size for AIX 4.3.3. Now what's the command that I've and also is it something similar to growing the file system in Solaris (growfs) (1 Reply)
Hi,
I have a basic doubt here.
Consider the following code snippet:
main()
{
int *a;
.
.
}
Here the memory for a gets allocated in heap or stack. (5 Replies)
Hi Friends,
i need a unix command to check the heap space availability on unix system as I am getting following error:
Error occurred during initialization of VM
Could not reserve enough space for object heap
Error occurred during initialization of VM
Could not reserve enough space for... (2 Replies)
Hi,
I am getting '911-S Internal error - Dictionary heap failure 0000003E' when I am trying to debug one of the cobol programs. Usually in Unix we run the debugger script and then run the exe files to Unit Test the cobol program, but in my case when I do QC to check the value that the variable... (0 Replies)
Hi,
I cant seem to figure out how I add a character to an existing one. Heres my problem.
So I have a line that looks like this:
>56
584848392394958586858484849393
What I want to do is add Num in front of the 56. So basically I want to recognize the > and add Num in front of the... (6 Replies)
The Resident size(as observed from top) of my process is increasing. But, the behaviour is very random. My process works on request reponse model. So when i put some request load on my process the memory starts increasing. For initial few hours (approx ~3 hrs) it increase at a rapid rate and after... (1 Reply)
Hello,
I am working on solving an NP-Complete problem, so it is very important that operations and data with limited integer-argument ranges be computed using immutable look-up-tables contained entirely in CPU cache. Retrieval of the look-up-table data must never leave the CPU once initially... (6 Replies)
i'm using the below perl code to get a list of ips:
my @allipsfound ;
for my $elem (@gatches) {
my ($ip) = split ":",$elem;
print "$ip \n";
}
it spits out several lines of ips. most of those ips are the same. how do i do sort and uniq in the above code to make it so that it only... (3 Replies)
Hello, I am a beginner to shell programming. Coded the following for Fibonacci series.
#!/bin/bash
fib() {
i=0
j=1
arr=0
arr=1
echo "enter the limit:"
read n
while
do
fo= expr $j - 1
f1=$j
f2= expr $j + 1
arr= expr ${arr} + ${arr}
echo ${arr} (3 Replies)