>>>>> foo = set([1, 65537]) >>>>> foo.pop() >> 1 >>>>> foo = set([65537, 1]) >>>>> foo.pop() >> 65537 > > You wrote a program to find the two smallest ints that would have a > hash collision in the CPython set implementation? I'm impressed. And > by impressed I mean frightened. Well, Mark is the guy who deals with floating point numbers for fun. *That* should frighten you :-) Martin
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