This predicate may be used to build hash tables as well as to exploit argument indexing to find complex terms more quickly.
The hash key does not rely on temporary information like addresses of
atoms and may be assumed constant over different invocations and
versions of SWI-Prolog.91Last
change: version 10.1.20 Numbers are hashed by their value,
so the hash does not depend on how a number is represented. The term_hash/2
predicate is cycle-safe.bugAll
arguments that (indirectly) lead to a cycle have the same hash key.
Hashes are the same on all platforms (byte order, word size and size of wchar_t).