Performance ordered dictionary vs normal dictionary

[Navkirat Singh]

On 29-Jul-2010, at 11:41 AM, Chris Rebert wrote:

> On Wed, Jul 28, 2010 at 8:12 PM, Navkirat Singh <navkirats at gmail.com> wrote:
>> Sorry, I might have been a bit vague:
>> (Also, I am new to pythong)
>> I am trying to do construct my own web session tracking algorithm for a web
>> server (which also I have constructed). The book keeping is for the session
>> information I track. The dictionary object will do this for me. I was
>> initially using a plain dictionary object, but I read this in the
>> documentation that made me think about the question I asked :-
> 
> Does your program actually make use of the ordering? If so, then yes,
> using OrderedDict is obviously preferable (Why reimplement something
> needlessly?). If not, then why bother with the extra complication?
> 
> (You are aware that the "ordered" in OrderedDict means that its keys
> are ordered, and not that, say, a list containing OrderedDicts can be
> sorted, right?)
> 
> Cheers,
> Chris
> --
> http://blog.rebertia.com


I am still in the analysis phase/experimental phase and the need might arise. Hence, I just wanted to know my options. If a collections object will improve performance than an ordinary dictionary, then yes I would like to go with the OrderedDict.

Thanks,
Nav