On Fri, Apr 18, 2014 at 02:57:55PM -0700, Benjamin Peterson wrote: > On Fri, Apr 18, 2014, at 14:46, Jim J. Jewett wrote: > > (1) I believe the recent consensus was that the number of comparisons > > made in a dict lookup is an implementation detail. (Please correct me > > if I am wrong.) > > Absolutely. > > > > > (2) Is "the item will be hashed at least once" a language guarantee? > > No. (Would that be useful at all?) I'm curious under what circumstances a key won't be hashed at all. -- Steven
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4