in reply to Re: Fuzzy hash key lookups
in thread Fuzzy hash key lookups

Well a B-Tree is sorted, isn't it?

And by fuzzy I mean lookups by regexes like in Tie::Hash::Regex. If the lookup matches multiple keys, they're all returned.

If you search for just "abadabafupla" it should return the data for "abadabafupla" and only "abadabafupla".

Replies are listed 'Best First'.
Re: Fuzzy hash key lookups
by Abigail-II (Bishop) on Aug 01, 2002 at 16:50 UTC
    A B-Tree isn't a hash, is it?

    Your second line confuses me. If you want to do the same as in Tie::Hash::Regex, why don't you use Tie::Hash::Regex?

    Oh, you want to do it without searching all the keys, and you think that sorting will help? How would you sort if the regex could contain a leading dot?

    Abigail

[reply]

In Section Seekers of Perl Wisdom