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

Re: iterators: traversing arbitrary data structure

by eric256 (Parson)
on Jan 11, 2006 at 21:21 UTC ( #522568=note: print w/ replies, xml ) Need Help??


in reply to iterators: traversing arbitrary data structure

Hey, Not an iterator, but it works.

use strict; use warnings; use Scalar::Util qw(reftype); use Data::Dumper; my $oWkBook = { students =>[ {fname=>'joe',lname=>'bloe',age=>'18'}, {fname=>'jill',lname=>'bill',age=>'16'}, ], teachers => [ {fname=>'joe',lname=>'sloe',age=>'38'}, {fname=>'jill',lname=>'sill',age=>'36'}, ], admins =>[ {fname=>'koe',lname=>'moe',age=>'58'}, {fname=>'dill',lname=>'mill',age=>'56'}, ], }; print reftype($oWkBook); my @test = getScalars($oWkBook); for (@test) { $$_ .= "test"; } my $link = \$oWkBook->{students}->[0]->{fname}; print $link; $$link .= "test"; print Dumper($oWkBook); print Dumper(@test); sub getScalars { my $it = shift; my $type = reftype($it); my @out; if (defined $type && $type eq "HASH") { for my $key (keys %$it) { if (!defined reftype($it->{$key})) { push @out, \$it->{$key}; } else { push @out, getScalars($it->{$key}); } } } elsif (defined $type && $type eq "ARRAY") { for ( @$it ) { if (!defined reftype($_)) { push @out, \$_; } else { push @out, getScalars($_); } } } elsif (defined $type && $type eq "SCALAR") { push @out, $it; } else { return \$it; } return @out; }

Left some of my fumbling in there, you can feel free to ignore that part. ;)


___________
Eric Hodges


Comment on Re: iterators: traversing arbitrary data structure
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (7)
As of 2015-07-29 08:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (261 votes), past polls