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) (hashq obj2)).
(eqv? obj1 obj2)implies
(= (hashv obj1 k) (hashv obj2)).
(equal? obj1 obj2)implies
(= (hash obj1 k) (hash obj2)).
hashqreturn in time bounded by a constant. Notice that items having the same
hashimplies the items have the same
hashvimplies the items have the same