Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re: For loop: Hash

by Happy-the-monk (Monsignor)
on Jul 02, 2013 at 08:58 UTC ( #1041982=note: print w/ replies, xml ) Need Help??

in reply to For loop: Hash

No objection to what hdb said above.
If you have to use the exact data structure you presented above, this might be the way to go:

for my $i ( sort keys %{$router_href} ) { for my $j ( sort keys %{$router_href->{$i}->{bgpPeer}} ) { print "($i:$j) " , $router_href->{$i}{bgpPeer}{$j}{Name} , ":\t" , $router_href->{$i}{bgpPeer}{$j}{prefixList} , "\n" } }

Cheers, Sören

(hooked on the Perl Programming language)

Comment on Re: For loop: Hash
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (9)
As of 2014-12-28 04:35 GMT
Find Nodes?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?

    Results (178 votes), past polls