These hashing functions are for use in quickly classifying objects. Hash tables use these functions.
Returns an exact non-negative integer less than k. For each non-negative integer less than k there are arguments obj for which the hashing functions applied to obj and k returns that integer.
(eq? obj1 obj2) implies
(= (hashq obj1 k)
(eqv? obj1 obj2) implies
(= (hashv obj1 k)
(equal? obj1 obj2) implies
(= (hash obj1 k)
hashq return in time bounded by a
constant. Notice that items having the same
hash implies the
items have the same
hashv implies the items have the same