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

Re: comparing nested data structures

by GrandFather (Sage)
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

Replies are listed 'Best First'.
Re^2: comparing nested data structures
by LanX (Bishop) 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

      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?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://935334]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (4)
As of 2017-12-17 14:18 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (464 votes). Check out past polls.