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.^{90Last change: version 9.3.28} The term_hash/2 predicate is cycle-safe.^{bugAll arguments that (indirectly) lead to a cycle have the same hash key. bugHashes differ between big and little endian machines and hashes for big integers (currently > 2^56) differ depending on the big integer backend (GMP or LibBF). See gmp_version.}