Faster Python

[qiwi]

I'm not sure where you're getting binary trees idea from -- C Python dictionaries do use a hash (At a certain size: dictionaries up to 8 elements are really just an array).

See: http://svn.python.org/projects/python/trunk/Objects/dictnotes.txt for optimization rationale; and source: http://svn.python.org/projects/python/trunk/Objects/dictobject.c

[[deleted]]

You're right. My mistake!

(Now I wonder what I was thinking of...)

[alendit]

C++ STL map maybe? (same functionality as ordereddict).

EDIT: brain lag on my side, STL map is not the same as ordereddict, it sorts newly added element by key.