Am 01.07.2012 22:36, schrieb Chris Smith:
Are you aware that there is now an ordered dictionary in python? It
was backported to 2.7.3, I believe.
This looks fine, but do you some data as to the speed? [0] says that
it keeps the items in the order in which they were inserted. That
smells of sequential storage and thus doesn't sound terribly cool
performance-wise, when random-access is needed.
Some details at http://tinyurl.com/8y4h9ad
They're discussing performance differences from a theoretical
perspective there.
From hands-on practice in the Java world, I can report that the
difference between hash tables and sorted trees is usually negligible.
(I.e. I never found any real difference, but I didn't do any systematic
tests.)
So... talk is cheap, show the benchmark numbers :-)
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
