Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re: Fastest data structure compare?

by Your Mother (Canon)
on Oct 08, 2009 at 16:31 UTC ( #800028=note: print w/ replies, xml ) Need Help??

in reply to Fastest data structure compare?

As repellent noted, JSON::XS is *very* fast. For some data sizes (in some benchmarks) it beats Storable. Here's a sample. Note the examples show the main caveat, JSON cares whether things are numbers or strings.

use JSON::XS; my %bingo = ( one => 1, two => 2, three => 5, ); my %bongo = ( three => 5, two => 2, one => 1, ); my %bango = ( one => "1", two => "2", three => "5", ); print "Is bingo bongo? ", encode_json(\%bingo) eq encode_json(\%bongo) ? "yes!\n" : "noes :( +\n"; print "Is bango bongo? ", encode_json(\%bango) eq encode_json(\%bongo) ? "yes!\n" : "noes :( +\n";
Is bingo bongo? yes! Is bango bongo? noes :(

Comment on Re: Fastest data structure compare?
Select or Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (8)
As of 2014-12-22 07:24 GMT
Find Nodes?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?

    Results (112 votes), past polls