2409cfe44d
in a way that the addition or removal of one slot does not significantly change the mapping of keys to slots. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped. Consistent hashing was introduced in 1997 as a way of distributing requests among a changing population of web servers. More recently, it and similar techniques have been employed in distributed hash tables. WWW: http://search.cpan.org/dist/Set-ConsistentHash/ PR: ports/119587 Submitted by: Gea-Suan Lin <gslin at gslin.org>
24 lines
519 B
Makefile
24 lines
519 B
Makefile
# New ports collection makefile for: p5-Set-ConsistentHash
|
|
# Date created: 2008-01-12
|
|
# Whom: Gea-Suan Lin <gslin@gslin.org>
|
|
#
|
|
# $FreeBSD$
|
|
#
|
|
|
|
PORTNAME= Set-ConsistentHash
|
|
PORTVERSION= 0.91
|
|
CATEGORIES= devel perl5
|
|
MASTER_SITES= CPAN
|
|
MASTER_SITE_SUBDIR= Set
|
|
PKGNAMEPREFIX= p5-
|
|
|
|
MAINTAINER= gslin@gslin.org
|
|
COMMENT= Library for doing consistent hashing
|
|
|
|
RUN_DEPENDS= ${SITE_PERL}/${PERL_ARCH}/Digest/SHA1.pm:${PORTSDIR}/security/p5-Digest-SHA1
|
|
|
|
PERL_CONFIGURE= yes
|
|
|
|
MAN3= Set::ConsistentHash.3
|
|
|
|
.include <bsd.port.mk>
|