To understand hashable objects in Python, it is important to review what a hash table is. Followingthe article on Wikipedia, a hash table is a data structure that can map keys to values and that implements a hash function to compute the index to an array of buckets or slots. Heavy words...
__eq__(other) # any non-hashable instance of a non-hashable class # ┌────────┴────────┐ isinstance(UnhashableClass(), Hashable)Traceback for (cpython) Python 3.13.1:Traceback (most recent call last): File "<frozen runpy>", line 198, in _run_module_as_main ...
It has always seemed strange to me to use a mutable object for a hash key; hence Python has tuples and lists, and only tuples can be used as dictionary keys. I don't have any magical solutions to the problem you propose. However, it seems to me that making [1] == [1] is more...