A CPAN search yields several implementations, yet I am not familiar with any of them.
In reply to Re: Best way to look-up a string amongst 100 million of its peers
by akho
in thread Best way to look-up a string amongst 100 million of its peers
by anson
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |