Next: iklib hashtables tcbuckets, Previous: iklib hashtables iterators, Up: iklib hashtables [Index]
Return a non–negative fixnum representing the hash value for bv,
based on its current contents. When creating hash tables using
bytevectors as keys: this hash function is suitable for use with
bytevector=?
as an equivalence function.
About the max-len argument:
#f
or not present: if the length of bv
is greater than 256 bytes, only the first 256 bytes are
used to compute the hash.
#t
: all the bytes in bv are used.
NOTE When the hash value is computed using a number of bytes N less than the bytevector length: applications must not assume that two bytevectors having the first N bytes equal will have the same hash value.
Return a non–negative fixnum representing the hash value for vec,
based on its current contents. When creating hash tables using vectors
as keys: this hash function is suitable for use with vector=?
as
an equivalence function.
About the max-len argument:
#f
or not present: if the length of
vec is greater than 3 items, only the first 3 items
are used to compute the hash.
#t
: all the items in vec are used.
NOTE When the hash value is computed using a number of items N less than the vector length: applications must not assume that two vectors having the first N items equal will have the same hash value.
Return a non–negative fixnum representing the hash value for ell,
based on its current contents. When creating hash tables using lists as
keys: this hash function is suitable for use with equal?
as an
equivalence function.
About the max-len argument:
#f
or not present: if the length of
ell is greater than 3 items, only the first 3 items
are used to compute the hash.
#t
: all the items in ell are used.
NOTE When the hash value is computed using a number of items N less than the list length: applications must not assume that two lists having the first N items equal will have the same hash value.
Hash functions for pairs and immutable pairs.
Hash function for characters. char-ci-hash
first applies
char-foldcase
to ch.
Hash function for booleans.
Hash function for fixnums.
Hash function for bignums.
Hash function for exact integers, fixnums and bignums.
Hash function for flonums.
Hash function for ratnums.
Hash function for cflonums.
Hash function for flonums.
Hash function for compnum objects.
Hash function for Vicare structs. This is a very low quality hash function.
NOTE The result returned by this hash function depends on the values in the struct fields, so: it will change if the struct is mutated.
Hash function for R6RS records. This is a very low quality hash function. Notice that it does not use the custom hash function of reco (if any).
NOTE The result returned by this hash function depends on the values in the record fields, so: it will change if the record is mutated.
Hash function for enumeration sets.
Return a fixnum representing the hash value of ptr.
Hash function for promise objects.
Ignore obj and return a non–negative exact integer representing
the hash value for (void)
, (eof-object)
,
(would-block-object)
and (sentinel)
.
Hash function for any Scheme object. For some object types: this is a very low quality hash function.
When obj is a record whose record–type defines a custom hash
function: object-hash
makes use of such custom function;
otherwise record-hash
is used.
This is used by eq?
hashtables to obtain a fixnum from references
to objects that are meant to be compared with eq?
.
Next: iklib hashtables tcbuckets, Previous: iklib hashtables iterators, Up: iklib hashtables [Index]