<B>Digest::PearsonB> is an implementation of Peter K. Pearsons hash algorithm
presented in Fast Hashing of Variable Length Text Strings - ACM 1990.
This hashing technique yields good distribution of hashed results for variable
length input strings on the range 0-255, and thus, it is well suited for data
The implementation is in C, so it is fast. If you prefer a pure Perl version
and can tolerate slower speed, you might want to consider Digest::Pearson::PurePerl instead.
This module does not export anything by default. To use this hash function,
do either of the following.
<B>use Digest::Pearson qw(pearson);B>