Sponsored Content
Full Discussion: String - Segmentation Fault
Top Forums Programming String - Segmentation Fault Post 302736229 by alister on Tuesday 27th of November 2012 02:18:55 AM
Old 11-27-2012
name_1 is uninitialized and may be pointing anywhere. You need to allocate some memory and then assign its location to name_1.

Regards,
Alister
This User Gave Thanks to alister For This Post:
 

10 More Discussions You Might Find Interesting

1. Programming

segmentation fault

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

Segmentation fault

I am tring to install Lotus Domino/Notes 5.0.5 on a AIX 4.3.3 server. I go to run the cdrom/ibmpow/install and I get the following error. Lotus Notes for Unix Install Program --------------------------------------------- ./install: 10088 Segmentation fault This had Lotus Notes installed... (1 Reply)
Discussion started by: jshaulis
1 Replies

3. Programming

segmentation fault

sometimes for this code i get a segmentation fault for codes llike this : int main{ int * a= 0; int b; a = (int*)malloc(sizeof(int)); ///some code using these variable but no freeing of a if(a){ free(a); a = 0; } return... (3 Replies)
Discussion started by: wojtyla
3 Replies

4. Programming

Why not a segmentation fault??

Hi, Why I don't receive a segmentation fault in the following sample. int main(void) { char buff; sprintf(buff,"Hello world"); printf("%s\n",buff); } If I define a buffer of 10 elements and I'm trying to put inside it twelve elements, Should I receive a sigsev... (22 Replies)
Discussion started by: lagigliaivan
22 Replies

5. UNIX for Dummies Questions & Answers

Segmentation Fault

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

6. Programming

segmentation fault

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

7. Programming

Using gdb, ignore beginning segmentation fault until reproduce environment segmentation fault

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. Programming

Segmentation fault

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

9. UNIX for Dummies Questions & Answers

Find a string across line break (because of "segmentation fault core dumped")

Hi, thanks to a precedent post, and thanks to the reply of derekludwig of the forum, I have convert my first awk command as : test.txt is : AAAAAGHIJKLAjKMEFJKLjklABCDJkLEFGHIJKL awk -f findstring.awk test.txt > textreturn.txtfindstring.awk is : BEGIN{ SLENGTH = 3 } { ... (3 Replies)
Discussion started by: thewizarde6
3 Replies

10. Programming

C. To segmentation fault or not to segmentation fault, that is the question.

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
MakeMethods::Composite::Hash(3pm)			User Contributed Perl Documentation			 MakeMethods::Composite::Hash(3pm)

NAME
Class::MakeMethods::Composite::Hash - Composite hash methods SYNOPSIS
package MyObject; use Class::MakeMethods::Composite::Hash ( new => 'new', scalar => [ 'foo', 'bar' ], array => 'my_list', hash => 'my_index', ); ... my $obj = MyObject->new( foo => 'Foozle' ); print $obj->foo(); $obj->bar('Barbados'); print $obj->bar(); $obj->my_list(0 => 'Foozle', 1 => 'Bang!'); print $obj->my_list(1); $obj->my_index('broccoli' => 'Blah!', 'foo' => 'Fiddle'); print $obj->my_index('foo'); DESCRIPTION
The Composite::Hash suclass of MakeMethods provides a basic constructor and accessors for blessed-hash object instances. Class::MakeMethods Calling Interface When you "use" this package, the method declarations you provide as arguments cause subroutines to be generated and installed in your module. You can also omit the arguments to "use" and instead make methods at runtime by passing the declarations to a subsequent call to "make()". You may include any number of declarations in each call to "use" or "make()". If methods with the same name already exist, earlier calls to "use" or "make()" win over later ones, but within each call, later declarations superceed earlier ones. You can install methods in a different package by passing "-TargetClass => package" as your first arguments to "use" or "make". See Class::MakeMethods for more details. Class::MakeMethods::Basic Declaration Syntax The following types of Basic declarations are supported: o generator_type => "method_name" o generator_type => "name_1 name_2..." o generator_type => [ "name_1", "name_2", ...] See the "METHOD GENERATOR TYPES" section below for a list of the supported values of generator_type. For each method name you provide, a subroutine of the indicated type will be generated and installed under that name in your module. Method names should start with a letter, followed by zero or more letters, numbers, or underscores. Class::MakeMethods::Composite Declaration Syntax The Composite syntax also provides several ways to optionally associate a hash of additional parameters with a given method name. o generator_type => [ "name_1" => { param=>value... }, ... ] A hash of parameters to use just for this method name. (Note: to prevent confusion with self-contained definition hashes, described below, parameter hashes following a method name must not contain the key 'name'.) o generator_type => [ [ "name_1", "name_2", ... ] => { param=>value... } ] Each of these method names gets a copy of the same set of parameters. o generator_type => [ { "name"=>"name_1", param=>value... }, ... ] By including the reserved parameter "name", you create a self-contained declaration with that name and any associated hash values. Basic declarations, as described above, are given an empty parameter hash. METHOD GENERATOR TYPES
new - Constructor For each method name passed, returns a subroutine with the following characteristics: o Has a reference to a sample item to copy. This defaults to a reference to an empty hash, but you may override this with the "'defaults' => hash_ref" method parameter. o If called as a class method, makes a new hash and blesses it into that class. o If called on a hash-based instance, makes a copy of it and blesses the copy into the same class as the original instance. o If passed a list of key-value pairs, appends them to the new hash. These arguments override any copied values, and later arguments with the same name will override earlier ones. o Returns the new instance. Sample declaration and usage: package MyObject; use Class::MakeMethods::Composite::Hash ( new => 'new', ); ... # Bare constructor my $empty = MyObject->new(); # Constructor with initial values my $obj = MyObject->new( foo => 'Foozle', bar => 'Barbados' ); # Copy with overriding value my $copy = $obj->new( bar => 'Bob' ); new --with_values - Constructor For each method name passed, returns a subroutine with the following characteristics: o May be called as a class method, or (equivalently) on any existing object of that class. o Creates a hash, blesses it into the class, and returns the new instance. o If no arguments are provided, the returned hash will be empty. If passed a single hash-ref argument, copies its contents into the new hash. If called with multiple arguments, treats them as key-value pairs, and copies them into the new hash. (Note that this is a "shallow" copy, not a "deep" clone.) scalar - Instance Accessor For each method name passed, uses a closure to generate a subroutine with the following characteristics: o Must be called on a hash-based instance. o Has a specific hash key to use to access the related value for each instance. This defaults to the method name, but you may override this with the "'hash_key' =" string> method parameter. o If called without any arguments returns the current value. o If called with an argument, stores that as the value, and returns it. o If called with multiple arguments, stores a reference to a new array with those arguments as contents, and returns that array reference. Sample declaration and usage: package MyObject; use Class::MakeMethods::Composite::Hash ( scalar => 'foo', ); ... # Store value $obj->foo('Foozle'); # Retrieve value print $obj->foo; array - Instance Ref Accessor For each method name passed, uses a closure to generate a subroutine with the following characteristics: o Must be called on a hash-based instance. o Has a specific hash key to use to access the related value for each instance. This defaults to the method name, but you may override this with the "'hash_key' =" string> method parameter. o The value for each instance will be a reference to an array (or undef). o If called without any arguments, returns the current array-ref value (or undef). o If called with a single non-ref argument, uses that argument as an index to retrieve from the referenced array, and returns that value (or undef). o If called with a single array ref argument, uses that list to return a slice of the referenced array. o If called with a list of argument pairs, each with a non-ref index and an associated value, stores the value at the given index in the referenced array. If the instance's value was previously undefined, a new array is autovivified. The current value in each position will be overwritten, and later arguments with the same index will override earlier ones. Returns the current array-ref value. o If called with a list of argument pairs, each with the first item being a reference to an array of up to two numbers, loops over each pair and uses those numbers to splice the value array. The first controlling number is the position at which the splice will begin. Zero will start before the first item in the list. Negative numbers count backwards from the end of the array. The second number is the number of items to be removed from the list. If it is omitted, or undefined, or zero, no items are removed. If it is a positive integer, that many items will be returned. If both numbers are omitted, or are both undefined, they default to containing the entire value array. If the second argument is undef, no values will be inserted; if it is a non-reference value, that one value will be inserted; if it is an array-ref, its values will be copied. The method returns the items that removed from the array, if any. Sample declaration and usage: package MyObject; use Class::MakeMethods::Composite::Hash ( array => 'bar', ); ... # Clear and set contents of list print $obj->bar([ 'Spume', 'Frost' ] ); # Set values by position $obj->bar(0 => 'Foozle', 1 => 'Bang!'); # Positions may be overwritten, and in any order $obj->bar(2 => 'And Mash', 1 => 'Blah!'); # Retrieve value by position print $obj->bar(1); # Direct access to referenced array print scalar @{ $obj->bar() }; There are also calling conventions for slice and splice operations: # Retrieve slice of values by position print join(', ', $obj->bar( undef, [0, 2] ) ); # Insert an item at position in the array $obj->bar([3], 'Potatoes' ); # Remove 1 item from position 3 in the array $obj->bar([3, 1], undef ); # Set a new value at position 2, and return the old value print $obj->bar([2, 1], 'Froth' ); hash - Instance Ref Accessor For each method name passed, uses a closure to generate a subroutine with the following characteristics: o Must be called on a hash-based instance. o Has a specific hash key to use to access the related value for each instance. This defaults to the method name, but you may override this with the "'hash_key' =" string> method parameter. o The value for each instance will be a reference to a hash (or undef). o If called without any arguments, returns the contents of the hash in list context, or a hash reference in scalar context (or undef). o If called with one non-ref argument, uses that argument as an index to retrieve from the referenced hash, and returns that value (or undef). o If called with one array-ref argument, uses the contents of that array to retrieve a slice of the referenced hash. o If called with one hash-ref argument, sets the contents of the referenced hash to match that provided. o If called with a list of key-value pairs, stores the value under the given key in the referenced hash. If the instance's value was previously undefined, a new hash is autovivified. The current value under each key will be overwritten, and later arguments with the same key will override earlier ones. Returns the contents of the hash in list context, or a hash reference in scalar context. Sample declaration and usage: package MyObject; use Class::MakeMethods::Composite::Hash ( hash => 'baz', ); ... # Set values by key $obj->baz('foo' => 'Foozle', 'bar' => 'Bang!'); # Values may be overwritten, and in any order $obj->baz('broccoli' => 'Blah!', 'foo' => 'Fiddle'); # Retrieve value by key print $obj->baz('foo'); # Retrive slice of values by position print join(', ', $obj->baz( ['foo', 'bar'] ) ); # Direct access to referenced hash print keys %{ $obj->baz() }; # Reset the hash contents to empty @{ $obj->baz() } = (); object - Instance Ref Accessor For each method name passed, uses a closure to generate a subroutine with the following characteristics: o Must be called on a hash-based instance. o Has a specific hash key to use to access the related value for each instance. This defaults to the method name, but you may override this with the "'hash_key' =" string> method parameter. o The value for each instance will be a reference to an object (or undef). o If called without any arguments returns the current value. o If called with an argument, stores that as the value, and returns it, Sample declaration and usage: package MyObject; use Class::MakeMethods::Composite::Hash ( object => 'foo', ); ... # Store value $obj->foo( Foozle->new() ); # Retrieve value print $obj->foo; SEE ALSO
See Class::MakeMethods for general information about this distribution. See Class::MakeMethods::Composite for more about this family of subclasses. perl v5.10.1 2004-09-06 MakeMethods::Composite::Hash(3pm)
All times are GMT -4. The time now is 07:05 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy