On Sun, Jan 6, 2013 at 10:40 PM, Kristján Valur Jónsson <krist...@ccpgames.com> wrote:
> A linear lookup in a handful of slots can't be that much of a bother, it is > only with larger number of entries that the O(1) property starts to matter. Something that I was thinking is if for small tables does make sense to actually do the hashing... a small table could be kept with just key/value pairs (saving also the hash space) with a linear scan first for identity and then a second scan for equality. Given the level of optimization of dicts however I'm 99% sure this was already tried before tho. _______________________________________________ Python-Dev mailing list Python-Dev@python.org http://mail.python.org/mailman/listinfo/python-dev Unsubscribe: http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
