in reply to (jeffa) Re: Unique Array Entries
in thread Unique Array Entries
The idea is, once you have that structure, to walk down that structure, and each time you end up in a leaf (that is, you find no more children), to output the whole path you've taken :
# Just walk the created structure, and output # the name whenever we hit a leaf : sub walk { my ($hashref, $path) = @_; #print $path,"\n"; my @keys = keys %$hashref; if (@keys) { walk( $hashref->{$_}, $path . "/$_" ) foreach (@keys); } else { print "$path\n"; }; }; walk( \%thingy, "" );
Of course, the whole method of hashes has the problem of not maintaining the order of the keys, but it's not clear if that will be a problem for The_Rev :-))
perl -MHTTP::Daemon -MHTTP::Response -MLWP::Simple -e ' ; # The $d = new HTTP::Daemon and fork and getprint $d->url and exit;#spider ($c = $d->accept())->get_request(); $c->send_response( new #in the HTTP::Response(200,$_,$_,qq(Just another Perl hacker\n))); ' # web
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: Re: (jeffa) Re: Unique Array Entries
by The_Rev (Acolyte) on Mar 02, 2002 at 16:48 UTC | |
by Corion (Patriarch) on Mar 02, 2002 at 16:58 UTC | |
by The_Rev (Acolyte) on Mar 02, 2002 at 16:56 UTC | |
by The_Rev (Acolyte) on Mar 02, 2002 at 16:59 UTC |