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

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
Comment on Re: comparing nested data structures
Replies are listed 'Best First'.
Re^2: comparing nested data structures
by LanX (Chancellor) 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?
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 wandering the Monastery: (7)
As of 2016-04-30 12:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    :nehw tseb si esrever ni gnitirW







    Results (441 votes). Check out past polls.