head	1.2;
access;
symbols
	RELEASE_8_3_0:1.2
	RELEASE_9_0_0:1.2
	RELEASE_7_4_0:1.2
	RELEASE_8_2_0:1.2
	RELEASE_6_EOL:1.2
	RELEASE_8_1_0:1.2
	RELEASE_7_3_0:1.2
	RELEASE_8_0_0:1.2
	RELEASE_7_2_0:1.2
	RELEASE_7_1_0:1.2
	RELEASE_6_4_0:1.2
	RELEASE_5_EOL:1.2
	RELEASE_7_0_0:1.2
	RELEASE_6_3_0:1.2
	PRE_XORG_7:1.2
	RELEASE_4_EOL:1.2
	RELEASE_6_2_0:1.2
	RELEASE_6_1_0:1.2
	RELEASE_5_5_0:1.2;
locks; strict;
comment	@# @;


1.2
date	2006.02.20.20.50.19;	author fenner;	state Exp;
branches;
next	1.1;

1.1
date	2005.12.17.21.50.56;	author erwin;	state Exp;
branches;
next	;


desc
@@


1.2
log
@Update search.cpan.org WWW: entries to have a trailing slash.
Change some URLs from author dirs to dist dirs.

The example in the porter's handbook didn't have the trailing slash;
mea culpa for not having caught that when it went in.
@
text
@Digest::Pearson is an implementation of Peter K. Pearson's 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 load balancing.
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.

WWW: http://search.cpan.org/dist/Digest-MD5-Pearson/
@


1.1
log
@Digest::Pearson is an implementation of Peter K. Pearson's 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 load balancing.
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.

WWW: http://search.cpan.org/dist/Digest-MD5-Pearson

PR:		ports/90578
Submitted by:	Gabor Kovesdan
@
text
@d10 1
a10 1
WWW: http://search.cpan.org/dist/Digest-MD5-Pearson
@

