On 1/27/2012 11:39 AM, martin at v.loewis.de wrote: > >> Another issue occurs to me: when a hash with colliding keys (one that >> has been attacked, and has trees) has a non-string key added, isn't >> the flattening process likely to have extremely poor performance? > > Correct. Thanks for the clarification. > "Don't do that, then" > > I don't consider it mandatory to fix all issues with hash collision. > In fact, none of the strategies fixes all issues with hash collisions; > even the hash-randomization solutions only deal with string keys, and > don't consider collisions on non-string keys. Which is fine, I just wanted the clarification. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://mail.python.org/pipermail/python-dev/attachments/20120127/50eb5844/attachment.html>
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