| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
Notes:
svn path=/head/; revision=283147
|
|
|
|
|
|
|
| |
Approved by: erwin@ (portmgr)
Notes:
svn path=/head/; revision=274220
|
|
|
|
|
|
|
|
|
| |
so standarize and remove it
With Hat: perl@
Notes:
svn path=/head/; revision=261743
|
|
|
|
|
|
|
|
|
|
| |
Pass maintainer to perl@
PR: ports/148798
Submitted by: Gea-Suan Lin <gslin@gslin.org> (old maintainer)
Notes:
svn path=/head/; revision=258060
|
|
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>
Notes:
svn path=/head/; revision=206097
|