Python is recursively checking each element of the dictionaries to ensure equality. See the C dict_equal()
implementation, which checks each and every key and value (provided the dictionaries are the same length); if dictionary b
has the same key, then a PyObject_RichCompareBool
tests if the values match too; this is essentially a recursive call.
Dictionaries are not hashable because their __hash__
attribute is set to None
, and most of all they are mutable, which is disallowed when used as a dictionary key.
If you were to use a dictionary as a key, and through an existing reference then change the key, then that key would no longer slot to the same position in the hash table. Using another, equal dictionary (be it equal to the unchanged dictionary or the changed dictionary) to try and retrieve the value would now no longer work because the wrong slot would be picked, or the key would no longer be equal.
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…