Release calc version 2.11.0t8.5

This commit is contained in:
Landon Curt Noll
1999-10-27 00:16:03 -07:00
parent 8db10967e8
commit a7e363da8b
34 changed files with 290 additions and 202 deletions

View File

@@ -1,5 +1,5 @@
NAME
hash - hash value
hash - FNV-1 hash value
SYNOPSIS
hash(x_1 [, x_2, x_3, ...])
@@ -12,23 +12,32 @@ TYPES
DESCRIPTION
Returns a hash value for one or more values of arbitrary types.
This function implements the Fowler/Noll/Vo hash-1 (FNV-1 hash).
The basis of the hash algorithm was taken from an idea sent
by Email to the IEEE POSIX P1003.2 mailing list from Phong Vo
(kpv@research.att.com) and Glenn Fowler (gsf@research.att.com).
Landon Curt Noll (http://reality.sgi.com/chongo) later improved on
their algorithm to come up with Fowler/Noll/Vo hash.
The basis of this hash algorithm was taken from an idea sent
as reviewer comments to the IEEE POSIX P1003.2 committee by:
See:
Phong Vo (http://www.research.att.com/info/kpv)
Glenn Fowler (http://www.research.att.com/~gsf/)
http://reality.sgi.com/chongo/tech/comp/fnv/index.html
In a subsequent ballot round:
for more information in this hash.
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
to Landon, they named it ``Fowler/Noll/Vo'' or the FNV hash.
FNV hashes are architected to be fast while maintaining a low
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/
for more details as well as other forms of the FNV hash.
EXAMPLE
> a = isqrt(2e1000); s = "xyz";
> hash(a,s)
1916476840
2378490456
LIMITS
The number of arguments is not to exceed 100.
@@ -37,3 +46,4 @@ LIBRARY
none
SEE ALSO
sha, sha1, md5