Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: comparing nested data structures

by CountZero (Bishop)
on Nov 02, 2011 at 10:19 UTC ( #935340=note: print w/ replies, xml ) Need Help??


in reply to comparing nested data structures

I think Test::Deep might solve your problems, or at the very least its code could give you some ideas to implement it yourself.

Deep::Hash::Utils also gives some "easier" access to deeply nested hashes and arrays, without the need to write yourself the recursive routines.

CountZero

A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James


Comment on Re: comparing nested data structures
Re^2: comparing nested data structures
by LanX (Canon) on Nov 02, 2011 at 13:19 UTC
    Very good, thanks a lot! :)

    Cheers Rolf

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (16)
As of 2014-07-29 15:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (220 votes), past polls