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

Re: comparing nested data structures

by GrandFather (Cardinal)
on Nov 02, 2011 at 10:09 UTC ( #935334=note: print w/ replies, xml ) Need Help??


in reply to comparing nested data structures

So how is dumping the structures as text (which has to traverse the structures in any case) then parsing the text to recreate some internal representation to allow comparison of the structures going to be faster than a direct comparison?

True laziness is hard work


Comment on Re: comparing nested data structures
Re^2: comparing nested data structures
by LanX (Monsignor) on Nov 02, 2011 at 10:13 UTC
    >...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

[reply]
      If the dumping and diffing can be done using XS, then so can the recursive comparison.
[reply]
        Dumping and diffing can already be done using XS (respectively built-ins) in practice.

        Cheers Rolf

[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (8)
As of 2013-05-23 16:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best material for plates (tableware) is:









    Results (486 votes), past polls