Re:An efficient way to make hash maps with insertion ordering
by joshuamorton on Thursday July 01, 2021 @03:48PM
(#27703721)
Note that this is an oversimplification, as
p = Path('a.txt')
q = Path('a.txt')
p is q # False
since p and q are different objects and "is" equality checks if the objects are the same (this can be interpreted approximately as "have the same memory address"), so it'll almost never be true. And in the cases where it is ( 2 is 2), you shouldn't rely on it, as most of them are optimizations.
Python dicts consider two keys the same if they have the same hash value and are "=="-equal. So __eq__ and __hash__ are the dunder methods to finagle. Python's sets are the same way.
A useful example is with the pathlib library.
"q" carries some different info than "p", but it refers to the same file location. So not considering them distinct values is a good decision for this package.