equal-hash

Computes hash ids for objects such that two objects that are =-equal have the same hash id.

Methods on equal-hash should return hash ids such that the id for two =-equal objects are the same.  There is a default method defined on all instances of <object>, and it returns a valid hash id in all cases.  However, performance will suck horribly (algorithmically, even) if you don’t define better methods for your own objects that will live in <equal-table> instances.

Good methods for equal-hash are defined for:

Exported from

Modifiers

open

Arguments

objectAn instance of <object>.
hash-stateAn instance of <hash-state>.

Values

hash-idAn instance of <integer>.
hash-stateAn instance of <hash-state>.
Compares two objects for equality.
Computes hash ids for objects such that two objects that are =-equal have the same hash id.
The class of all Dylan objects.
Implements a class which compares keys using \=.
The class of integers.
The class of floating-point numbers.
The class of symbols.
The class of all types, including classes and other types.
The class of objects that can be applied to arguments.
The class of boolean values.
The class of objects used by the condition system to connect a signaler with an appropriate handler.
The class of collections, aggregate data structures.
The class of sequences with elements that are characters.
The table-extensions module.
The type of hash states.