Marc-Andre Lemburg added the comment:
On 07.11.2012 13:06, Mark Dickinson wrote:
>
> Mark Dickinson added the comment:
>
> And I'm probably repeating myself too, but: the predictability of (and
> difficulty of changing of) hashing for numeric types is why I'm strongly
> opposed to hash collision / slot collision limits: they'd end up disallowing
> reasonably natural looking Python numeric sets (e.g. {2**k for k in range(n)}
> for smallish n). I don't think core Python should be solving this issue at
> all---I think that's a job for the web frameworks. Christian's idea of
> providing more suitable types in the std. lib. sounds like the right
> direction to me.
I definitely agree on that last sentence. Having more suitable data
types in Python (like e.g. tries, b-trees or red-black-trees) would certainly
be a better solution than trying to build everything into dictionaries.
Nice comparison:
http://en.wikipedia.org/wiki/Trie
----------
_______________________________________
Python tracker <rep...@bugs.python.org>
<http://bugs.python.org/issue14621>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe:
http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
