Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^2: comparing nested data structures

by LanX (Canon)
on Nov 02, 2011 at 10:13 UTC ( #935335=note: print w/ replies, xml ) Need Help??


in reply to Re: comparing nested data structures
in thread comparing nested data structures

>...going to be faster than a direct comparison?

Well dumping and diffing is done by XS-modules and the dumps can be stored in advance. (BTW: dumping is meant for persistence)

So what are the alternatives you offer?

Cheers Rolf


Comment on Re^2: comparing nested data structures
Replies are listed 'Best First'.
Re^3: comparing nested data structures
by DrHyde (Prior) on Nov 02, 2011 at 10:16 UTC
    If the dumping and diffing can be done using XS, then so can the recursive comparison.
      Dumping and diffing can already be done using XS (respectively built-ins) in practice.

      Cheers Rolf

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (9)
As of 2015-07-31 00:39 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 (274 votes), past polls