Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: various hash construction/ printing questions..

by demerphq (Chancellor)
on Jun 13, 2009 at 16:42 UTC ( #771257=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    sub print_inorder {
       my $node= shift;
    ...
          for sort { $a->{name} cmp $b->{name} } 
              values %{ $node->{kids} || {} };
    }
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://771257]
help
Chatterbox?
[ambrus]: Corion: no, backwards. It's possible in the general case, but not in the specific case of bad data we have. Which is why it's harder to explain.
[marto]: that reminds me, to donate...
[ambrus]: If it was possible in this specific case, then the burden to argue for that would be his.
[Corion]: ambrus: Ah, but he's the boss, so the burden to show that it's impossible still lies on you :-)
[Corion]: ambrus: I would work with him through an example

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (8)
As of 2017-12-12 13:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (332 votes). Check out past polls.

    Notices?