Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #77742 > unrolled thread
| Started by | Chris Angelico <rosuav@gmail.com> |
|---|---|
| First post | 2014-09-10 01:37 +1000 |
| Last post | 2014-09-10 01:37 +1000 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.lang.python
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: weakref, memory management and execution slow down in PyQt4 Chris Angelico <rosuav@gmail.com> - 2014-09-10 01:37 +1000
| From | Chris Angelico <rosuav@gmail.com> |
|---|---|
| Date | 2014-09-10 01:37 +1000 |
| Subject | Re: weakref, memory management and execution slow down in PyQt4 |
| Message-ID | <mailman.13906.1410277030.18130.python-list@python.org> |
On Wed, Sep 10, 2014 at 1:32 AM, Michael Torrie <torriem@gmail.com> wrote: > Yes you're correct. It is the equivalent. But it always involves > lookup in the object's dictionary, which is big O order O(n log n) > complexity for each and every access. Where do you get that figure from? A CPython dictionary is implemented as a hashtable, so algorithmic complexity of lookups ought to be O(1). ChrisA
Back to top | Article view | comp.lang.python
csiph-web