9 More Discussions You Might Find Interesting
1. UNIX for Advanced & Expert Users
Being a moderator at openATV, a forum for Linux settup boxes, I have seen reports, and sometimes am experiencing myself, artefacts during video playback or timeshift.
As the artefacts are non repetetive (rewinding and watching again does not show artefacts), I can exclude a corrupted video source.... (23 Replies)
Discussion started by: Fischreiher
23 Replies
2. IP Networking
Hello all, I am experiencing a problem with IP fragmentation.
I am receiving an udp packet that is larger than the MTU and it is fragmented along the network.
I am receiving the two fragments but they are not being reassembled correclty.
The MTU of the system is 1500 and I cannot increase it,... (2 Replies)
Discussion started by: arichard
2 Replies
3. Emergency UNIX and Linux Support
hi
sorry for grammar mistakes but i am writting these fro tablet and am not realy used to ot so well yet....
i am in the middle of doing work here and hope some1 ca answear my question asap please :-)
How to calculate the amount of internal fragmentation using script.
cd directory ...... (6 Replies)
Discussion started by: me.
6 Replies
4. HP-UX
I'm sharing this in case anybody needs it. Modified from the original solaris pwage script. This modified hpux script will check /etc/password file on hpux trusted systems search /tcb and grep the required u_succhg field. Calculate days to expiry and notify users via email.
original solaris... (2 Replies)
Discussion started by: sparcguy
2 Replies
5. HP-UX
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)
Discussion started by: atgoel
1 Replies
6. Shell Programming and Scripting
I am running HPUX and using WLM (workload manager). I want to write a script to fork CPUs to basically take CPUs from other servers to show that the communication is working and CPU licensing is working. Basically, I want to build a script that will use up CPU on a server. Any ideas? (2 Replies)
Discussion started by: cpolikowsky
2 Replies
7. Solaris
All.
How can i calculate the fragmentation ratio on a mounted disk, given that i have no root privilege and i cannot switch to single user mode. (0 Replies)
Discussion started by: Negm
0 Replies
8. UNIX for Dummies Questions & Answers
Hi,
Please let me know more details on fragmentation in redhat linux and command to check fragmented files?
Thanks,
Bache Gowda (2 Replies)
Discussion started by: bache_gowda
2 Replies
9. IP Networking
HI all,
I am in urgent need of this answer.
In TCP/IP protocol, If the IP datagram size > MTU of the any
routing network then the IP fragmentation takes place!
Where exactly the Fragmentation takes place? is it at the source network layer or in between at some router?
If so, which of the... (1 Reply)
Discussion started by: reddyb
1 Replies
Heap::Elem(3pm) User Contributed Perl Documentation Heap::Elem(3pm)
NAME
Heap::Elem - Base class for elements in a Heap
SYNOPSIS
use Heap::Elem::SomeInheritor;
use Heap::SomeHeapClass;
$elem = Heap::Elem::SomeInheritor->new( $value );
$heap = Heap::SomeHeapClass->new;
$heap->add($elem);
DESCRIPTION
This is an inheritable class for Heap Elements. It provides the interface documentation and some inheritable methods. Only a child
classes can be used - this class is not complete.
METHODS
$elem = Heap::Elem::SomeInheritor->new( [args] );
Creates a new Elem. If there is exactly one arg, the Elem's value will be set to that value. If there is more than one arg provided,
the Elem's value will be set to an anonymous hash initialized to the provided args (which must have an even number, of course).
$elem->heap( $val ); $elem->heap;
Provides a method for use by the Heap processing routines. If a value argument is provided, it will be saved. The new saved value is
always returned. If no value argument is provided, the old saved value is returned.
The Heap processing routines use this method to map an element into its internal structure. This is needed to support the Heap methods
that affect elements that are not are the top of the heap - decrease_key and delete.
The Heap processing routines will ensure that this value is undef when this elem is removed from a heap, and is not undef after it is
inserted into a heap. This means that you can check whether an element is currently contained within a heap or not. (It cannot be
used to determine which heap an element is contained in, if you have multiple heaps. Keeping that information accurate would make the
operation of merging two heaps into a single one take longer - it would have to traverse all of the elements in the merged heap to
update them; for Binomial and Fibonacci heaps that would turn an O(1) operation into an O(n) one.)
$elem->val( $val ); $elem->val;
Provides a method to get and/or set the value of the element.
$elem1->cmp($elem2)
A routine to compare two elements. It must return a negative value if this element should go higher on the heap than $elem2, 0 if they
are equal, or a positive value if this element should go lower on the heap than $elem2. Just as with sort, the Perl operators <=> and
cmp cause the smaller value to be returned first; similarly you can negate the meaning to reverse the order - causing the heap to
always return the largest element instead of the smallest.
INHERITING
This class can be inherited to provide an object with the ability to be heaped. If the object is implemented as a hash, and if it can deal
with a key of heap, leaving it unchanged for use by the heap routines, then the following implemetation will work.
package myObject;
require Exporter;
@ISA = qw(Heap::Elem);
sub new {
my $self = shift;
my $class = ref($self) || $self;
my $self = SUPER::new($class);
# set $self->{key} = $value;
}
sub cmp {
my $self = shift;
my $other = shift;
$self->{key} cmp $other->{key};
}
# other methods for the rest of myObject's functionality
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::Num(3), Heap::Elem::NumRev(3), Heap::Elem::Str(3), Heap::Elem::StrRev(3).
perl v5.8.8 2007-10-23 Heap::Elem(3pm)