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