in reply to Fastest data structure compare?
But you want more than that. Basically, you want to get a unique, reproducable, representation of your datastructure - after all, after you've found a hash that you've seen before, you want to return the same thing as before.
I'd go for Data::Dumper or YAML.
But I am curious. What kind of application are you making where the constructor is such a bottle neck you're are looking for the fastest way of serialization?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Fastest data structure compare?
by swartz (Beadle) on May 20, 2009 at 20:54 UTC | |
by JavaFan (Canon) on May 20, 2009 at 21:39 UTC |