I’m glad it’s got you thinking. Here’s a little more to play with. The only part it answers directly is the delete function. I think you will start to understand more the more you play around with the code. Part of what makes Perl so easy/fun is how easy it is to test ideas, adjust and run. Remember, you have great built-in documentation. Just run perldoc -f delete for functions for example. Or perldoc perltoc or perldoc Data::Dumper, etc… :P
use strict; use warnings; use Data::Dumper; $Data::Dumper::Terse = 1; # Raw structures, no $VAR1 style names. # One hash, with a (hash) reference taken to it– my %stuff = ( somekey => "someval", o => "hai" ); my $stuff_ref = \%stuff; # reference literally *references* original. print "Same hash, two ways to access: $stuff{o} eq $stuff_ref->{o}\n"; # See the hash right now. print "Original hash: ", Dumper( $stuff_ref ); my $value = delete $stuff_ref->{o}; print "Hash after deleting key o: ", Dumper( $stuff_ref ); print "Print it directly (uninitialized now): o => ", $stuff_ref->{o}, + $/; # Add a new dimension to the data– $stuff_ref->{new_key}{sub_key} = "new value"; # Give it a friend, old key/value, new position– $stuff_ref->{new_key}{o} = $value; print "Hash after moving stuff around: ", Dumper( $stuff_ref ); $stuff_ref->{as}{deep}{as}{you} = "please"; $stuff_ref->{as}{deep}{as}{array_ref} = [ "one", "two" ]; $stuff_ref->{subroutine} = sub { print "OHAI!\n" }; $stuff_ref->{fancy_data} = [ "one", { two => "is a hash(ref)" }, ["ano +ther","array"], "last" ]; print "Perl data structures are *flexible* ", Dumper( $stuff_ref ); print "Excecuting code ref through data..."; $stuff_ref->{subroutine}->();
Same hash, two ways to access: hai eq hai Original hash: { 'somekey' => 'someval', 'o' => 'hai' } Hash deleting key o: { 'somekey' => 'someval' } Use of uninitialized value in print at /Users/moo/Desktop/pm.pl line 1 +7. Print it directly (unintialized now): o => Hash after moving stuff around: { 'new_key' => { 'o' => 'hai', 'sub_key' => 'new value' }, 'somekey' => 'someval' } Perl data structures are *flexible* { 'subroutine' => sub { "DUMMY" }, 'fancy_data' => [ 'one', { 'two' => 'is a hash(ref)' }, [ 'another', 'array' ], 'last' ], 'somekey' => 'someval', 'as' => { 'deep' => { 'as' => { 'array_ref' => [ 'one', 'two' ], 'you' => 'please' } } }, 'new_key' => { 'o' => 'hai', 'sub_key' => 'new value' } } Excecuting code ref through data...OHAI!
In reply to Re^5: Find a Position and Insert Text
by Your Mother
in thread Find a Position and Insert Text
by jlb333333
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |