Heap::Elem::RefRev(3pm) User Contributed Perl Documentation Heap::Elem::RefRev(3pm)NAME
Heap::Elem::RefRev - Reversed Object Reverence Heap Elements
SYNOPSIS
use Heap::Elem::RefRev( RefRElem );
use Heap::Fibonacci;
my $heap = Heap::Fibonacci->new;
my $elem;
foreach $i ( 1..100 ) {
$obj = myObject->new( $i );
$elem = RefRElem( $obj );
$heap->add( $elem );
}
while( defined( $elem = $heap->extract_top ) ) {
# assume that myObject object have a method I<printable>
print "Largest is ", $elem->val->printable, "
";
}
DESCRIPTION
Heap::Elem::RefRev 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 con-
sistant with normal arithmetic. The top of the heap will have the largest (according to cmp) element still remaining. (See
Heap::Elem::Ref 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::Ref(3).
perl v5.8.8 2007-10-23 Heap::Elem::RefRev(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)
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)
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)
Hi All,
We are facing issues on HPUX with the C heap region growing. We use a product for CRM by name ClarifyCRM and it uses a native layer for DB access. so there are best practices in place to actual control memory. recently we have seen issues that the C heap region is growing faster than... (0 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)