mirror of
https://github.com/lcn2/calc.git
synced 2025-08-19 01:13:27 +03:00
Release calc version 2.11.0t10
This commit is contained in:
@@ -15,12 +15,12 @@ DESCRIPTION
|
||||
The basis of this hash algorithm was taken from an idea sent
|
||||
as reviewer comments to the IEEE POSIX P1003.2 committee by:
|
||||
|
||||
Phong Vo (http://www.research.att.com/info/kpv/)
|
||||
Glenn Fowler (http://www.research.att.com/~gsf/)
|
||||
Phong Vo (http://www.research.att.com/info/kpv/)
|
||||
Glenn Fowler (http://www.research.att.com/~gsf/)
|
||||
|
||||
In a subsequent ballot round:
|
||||
|
||||
Landon Curt Noll (http://reality.sgi.com/chongo/)
|
||||
Landon Curt Noll (http://reality.sgi.com/chongo/)
|
||||
|
||||
improved on their algorithm. Some people tried this hash
|
||||
and found that it worked rather well. In an EMail message
|
||||
@@ -30,7 +30,7 @@ DESCRIPTION
|
||||
collision rate. The FNV speed allows one to quickly hash lots
|
||||
of data while maintaining a reasonable collision rate. See:
|
||||
|
||||
http://reality.sgi.com/chongo/tech/comp/fnv/
|
||||
http://reality.sgi.com/chongo/tech/comp/fnv/
|
||||
|
||||
for more details as well as other forms of the FNV hash.
|
||||
|
||||
|
Reference in New Issue
Block a user