Special case the handling of hash tables within equalp. This brings
equalp in line with the CL spec. and is necessary because the new hash implementation maintains a reference back to the hash table within the hash vector (for the garbage collector) which could cause infinite recursion by equalp. Based on some good spotting and a patch from Raymond Toy.
Please register or sign in to comment