sequence-hash

Like collection-hash, only a more efficient version just for sequences.  This is similar to an equal-hash for the collection, except that it hashes things with ordered: #t and ignores the sequence keys.

USE WITH CAUTION: This isn’t a proper equal-hash because two collections of different types but identical key/element pairs won’t generate the same hash id, even though the two collections are =.

Exported from

Arguments

element-hashAn instance of <function>.  Computes hash ids for the elements.  It takes an object and a <hash-state> as the arguments, and returns a hash id and a hash state.
seqAn instance of <sequence>.
initial-stateAn instance of <hash-state>.

Values

hash-idAn instance of <integer>.
hash-stateAn instance of <hash-state>.
A function for building hash functions that test collection equivalence.
Computes hash ids for objects such that two objects that are =-equal have the same hash id.
The table-extensions module.
The class of objects that can be applied to arguments.
The type of hash states.
The class of collections whose keys are consecutive integers starting from zero.
The class of integers.