If it would just be the comparison between two hashes, then any serializing-based solution isn't going to be the fastest, unless almost all your comparisons will be between hashes that are the same. Fast solutions will terminate comparing as soon as a difference has been found.

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?

In reply to Re: Fastest data structure compare? by JavaFan
in thread Fastest data structure compare? by swartz

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.