grinder,
I understand that importance. There is a reference to the POD to look at the README for comparison to similar modules. Here is an advanced copy of the README. 
Tie::SortedHash version 1.00
===========================

INTRODUCTION
This module allows you to retrieve keys/values from a hash in a sorted
+ order.


COMPARISON
Q:  Is this module any different from Tie::IxHash or Tie::SortHash?
A:  Yes, let me explain

    *** Tie::IxHash vs Tie::SortedHash ***
1.  Preserves insertion order - maintains order regardless of insertio
+n
2.  Provides static simple sort on keys/values - provides dynamic arbi
+trary sort routine

    *** Tie::SortHash vs Tie::SortedHash ***
1.  Uses psuedo hashes - uses an array
2.  It uses eval string for sort - uses a code ref for sort
3.  Loops (keys^2 + keys)/2 times through hash - retrieves array value
4.  Inflexible calling syntax - flexible/expandable calling syntax
5.  Extremely slow - provides for optimization where applicable
   

WHAT IS THIS ABOUT POSSIBLE OPTIMIZATION?
There are two circumstances when you can safley enable optimizations
1.  You have a simple one-level hash
2.  You have a complex hash, but the sort routine only depends on the 
    keys/values of the root level
By enabling optimization, the array that stores the sorted order will
only be re-generated when a change to the hash is detected.  Unfortuna
+tely, 
it is not possible to detect when the hash changes below the root leve
+l, and
the sort routine may depend on it.


WHY I WROTE IT
Tie::SortHash was a perfect answer to a question on perlmonks (http://
+www.perlmonks.org)
Unfortunately it had a lot of issues with it and attempts to contact t
+he author went 
unanswered.  Originally, I had intended just to correct that module, b
+ut it became nearly
impossible to do that and maintain backwards compatability.


INSTALLATION

To install this module type the following:

   perl Makefile.PL
   make
   make test
   make install


COPYRIGHT

Copyright (c) 2003 Joshua Gatcomb. All rights reserved.
This program is free software; you can redistribute it
and/or modify it under the same terms as Perl itself.

[download]

Cheers - L~R

In reply to Re: Re:x2 Any Point in Uploading Tie::SortedHash (say why) by Limbic~Region
in thread Any Point in Uploading Tie::SortedHash by Limbic~Region

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.