12-09-2007
I will look into it myself further
Thanks heaps so far for your insights. Im really learning something
Last edited by JamesGoh; 12-11-2007 at 06:48 AM..
10 More Discussions You Might Find Interesting
1. Programming
hi all
i'm trying to execute a c program under linux RH and it gives me segmentation fault, this program was running under unix at&t
anybody kow what the problem could be?
thanx in advance
regards (2 Replies)
Discussion started by: omran
2 Replies
2. AIX
Hi ,
During execution a backup binary i get following error
"Program error 11 (Segmentation fault), saving core file in '/usr/datatools"
Riyaz (2 Replies)
Discussion started by: rshaikh
2 Replies
3. Linux
Hi,
on a linux Red HAT(with Oracle DB 9.2.0.7) I have following error :
RMAN> delete obsolete;
RMAN retention policy will be applied to the command
RMAN retention policy is set to redundancy 2
using channel ORA_DISK_1
Segmentation fault
What does it mean ? And the solution ?
Many thanks. (0 Replies)
Discussion started by: big123456
0 Replies
4. UNIX for Dummies Questions & Answers
Hi,
While comparing primary key data of two tables thr bteq script I am getting this Error. This script is a shell script.
*** Error: The following error was encountered on the output file.
Script.sh: 3043492 Segmentation fault(coredump)
Please let me know how to get through it.
... (5 Replies)
Discussion started by: monika
5 Replies
5. Programming
If I do this.
Assume
struct life
{
char *nolife;
}
struct life **life;
// malloc initialization & everything
if(life->nolife == 0)
Would I get error at life->nolife if it is equal to 0.
wrong accession? (3 Replies)
Discussion started by: joey
3 Replies
6. Programming
What is segmentation fault(core dumped) (1 Reply)
Discussion started by: gokult
1 Replies
7. Programming
I use a binary name (ie polo) it gets some parameter , so for debugging normally i do this :
i wrote script for watchdog my app (polo) and check every second if it's not running then start it , the problem is , if my app , remain in state of segmentation fault for a while (ie 15 ... (6 Replies)
Discussion started by: pooyair
6 Replies
8. Homework & Coursework Questions
this is a network programming code to run a rock paper scissors in a client and server.
I completed it and it was working without any error. After I added the findWinner function to the server code it starts giving me segmentation fault.
-the segmentation fault is fixed
Current problem -Also... (3 Replies)
Discussion started by: femchi
3 Replies
9. Programming
I keep getting this fault on a lot of the codes I write, I'm not exactly sure why so I'd really appreciate it if someone could explain the idea to me.
For example this code
#include <stdio.h>
main()
{
unsigned long a=0;
unsigned long b=0;
int z;
{
printf("Enter two... (2 Replies)
Discussion started by: sizzler786
2 Replies
10. Programming
Oddities with gcc, 2.95.3 for the AMIGA and 4.2.1 for MY current OSX 10.14.1...
I am creating a basic calculator for the AMIGA ADE *NIX emulator in C as it does not have one.
Below are two very condensed snippets of which I have added the results inside the each code section.
IMPORTANT!... (11 Replies)
Discussion started by: wisecracker
11 Replies
LEARN ABOUT DEBIAN
heap071::elem
Heap071::Elem(3pm) User Contributed Perl Documentation Heap071::Elem(3pm)
NAME
Heap::Elem - Perl extension for elements to be put in Heaps
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.
$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.)
$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 oject 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, jmm@perlwolf.com
COPYRIGHT
Copyright 1998-2003, 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.10.0 2007-08-11 Heap071::Elem(3pm)