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
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.
[ Parent
| on HN ]
There are no comments on this comment yet.