Given small number of searches and the ~40k values per search, you may well find that a simple linear search using List::MoreUtils::firstidx() is more than adequate for your needs.
Indeed, you may well find that as the linear search is coded in C, that it beats a binary search in Perl.
In reply to Re^3: Search a hash for closest match
by BrowserUk
in thread Search a hash for closest match
by aquinom
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |