Hashes are not sorted, so your premises of "assume that the
hash is lexically sorted" makes as much sense as "assume that
the array is Wednesday". At best what you can
archieve is to have some sort of datastructure that keeps
the keys sorted, and you have a tied hash interface to that
datastructure.
A sorted search tree might be the solution you are
looking for, but that depends on what you mean by "fuzzy".
Do you want to do a "nearest" query, nearest measured over
the way you have sorted your data? In that case, a tree will
work. Or do you mean that if you search with "abadabafupla",
a result of "abadabaxupla" is wanted because there's only
on letter that's different? In that case you need a completely
different datastructure.
Of course, any datastructure whose search queries take a scalar
and give a scalar as return can be hidden being a tied hash.
Abigail
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: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.