Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Manipulate deepest values in complex hash structures

by LanX (Saint)
on Apr 29, 2013 at 20:28 UTC ( [id://1031282]=note: print w/replies, xml ) Need Help??


in reply to Manipulate deepest values in complex hash structures

  • First of all operate on refs, don't do copies like my %hash = %{shift()}; just take $h_ref=shift

  • then allow the recursion to accept all ref types not only hashes

  • this seems pretty redundant:

    if (scalar( @{$hash{$key}} ) > 0) { foreach my $list_element (@{$hash{$key}}) {

  • I'd use if/elsif/else clauses if I were you for different types

  • you should handle unexpected types ( like objects) and warn

  • This recent post is an incomplete example only for HoHs, but pretty short.

  • why are you limiting yourself to a regex at the leaves? Better pass and execute a coderef to have a generic solution.

But I'm pretty sure you are reinventing the wheel, better search the archives or CPAN. (Maybe Data::Diver or Data::Walker already do what you want.)

Cheers Rolf

( addicted to the Perl Programming Language)

updates

various ...

Replies are listed 'Best First'.
Re^2: Manipulate deepest values in complex hash structures
by LanX (Saint) on Apr 29, 2013 at 21:21 UTC
    enough theory, now practical code:

    use strict; use warnings; use Data::Dump qw/pp/; use Scalar::Util qw/reftype/; sub walk { my ($entry,$code) =@_; my $type = reftype($entry); $type //= "SCALAR"; if ($type eq "HASH") { walk($_,$code) for values %$entry; } elsif ($type eq "ARRAY") { walk($_,$code) for @$entry; } elsif ($type eq "SCALAR" ) { $code->($_[0]); # alias of entry } else { warn "unknown type $type"; } } my $test = { a => [2, 3, [4, { b => 42 }]], c => 5 }; pp $test; walk $test, sub { $_[0]+=100 }; pp $test;

    Output

    /usr/bin/perl -w /tmp/walker.pl { a => [2, 3, [4, { b => 42 }]], c => 5 } { a => [102, 103, [104, { b => 142 }]], c => 105 }

    Cheers Rolf

    ( addicted to the Perl Programming Language)

    UPDATE

    of course you could extend walk to call optional $coderefs on every node and specify them as named parameters:

     walk $ref , SCALAR => sub { print $_[0] } , ARRAY => sub { Dump $_[0] }, ...

    But I think the original code is so small thats its easier to copy and manipulate it in place for different needs.

      Great post, LanX. I have two questions:

      For the line:

      $type //= "SCALAR";

      am I correct in thinking that this is using the or operator as you would like += or .=? So that $type takes the value "SCALAR" if it doesn't already have a value? I looked in perlop, but I wasn't aware you could use logical operators like that...

      My second question is how

      $code->($_[0]);

      performs the operation on $_[0]. Currently I'm trying to become more comfortable with references (and they're very confusing), so I'd appreciate it if you could point me in the correct direction. I've already read http://perldoc.perl.org/perlreftut.html, but I'm trying to make it stick now.

      Thanks in advance!

        > am I correct in thinking that this is using the or operator as you would like += or .=

        almost, you are describing ||= which assigns if the left side is false. you can find this combination in many languages.

        But current Perl versions also have // for defined-or, which only act on undef and not other false values.

        so $type //= "SCALAR" means $type = defined $type ? $type : "SCALAR";

        > performs the operation on $_[0]. Currently I'm trying to become more comfortable with references (and they're very confusing)

        It's even more confusing, cause it's not a reference but an alias. Changing elements of @_ means directly changing the passed arguments (see perlsub).

        Ironically references shouldn't be confusing, because in most languages arrays and hashes are always copied as references and automatically dereferenced. Perl is one of the rare languages which make a distinction between two flavours.

        In JS for instance something like a=[];b=a; a[1]=42; b[1] == 42 is true, because a and b are references to the same array.

        In Perl you need to explicitly copy references to achieve this, since @b=@a only copies the elements.

        But alternatively you can do like JS does with references:

        $a=[]; $b=$a; $a->[1]=42; $b->[1] == 42

        Cheers Rolf

        ( addicted to the Perl Programming Language)

Re^2: Manipulate deepest values in complex hash structures
by RecursionBane (Beadle) on Apr 29, 2013 at 20:30 UTC
    Thanks for the feedback, Rolf!
    I'll clean up my code and look into Data::Diver. It looks promising.

    ~RecursionBane

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1031282]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others pondering the Monastery: (6)
As of 2024-03-28 11:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found