Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #45770
| Date | 2013-05-22 20:31 -0700 |
|---|---|
| Subject | Ordered dictionaries compared |
| From | Dan Stromberg <drsalists@gmail.com> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.1989.1369279892.3114.python-list@python.org> (permalink) |
[Multipart message — attachments visible in raw view] - view raw
What kind of ordered dictionaries? Sorted by key. I've redone the previous comparison, this time with a better red-black tree implementation courtesy of Duncan G. Smith. The comparison is at http://stromberg.dnsalias.org/~strombrg/python-tree-and-heap-comparison/just-trees/ The Red-Black tree gave a much better showing this time, but it gave just one 2nd place on one workload-interpreter - still kinda lackluster. It took 1st place 0 times.
Back to comp.lang.python | Previous | Next — Next in thread | Find similar | Unroll thread
Ordered dictionaries compared Dan Stromberg <drsalists@gmail.com> - 2013-05-22 20:31 -0700
Re: Ordered dictionaries compared duncan smith <buzzard@invalid.invalid> - 2013-05-23 17:41 +0100
Re: Ordered dictionaries compared Dan Stromberg <drsalists@gmail.com> - 2013-05-23 10:44 -0700
Re: Ordered dictionaries compared duncan smith <buzzard@invalid.invalid> - 2013-05-24 00:57 +0100
csiph-web