weakref, memory management and execution slow down in PyQt4

Chris Angelico rosuav at gmail.com
Tue Sep 9 17:37:01 CEST 2014

On Wed, Sep 10, 2014 at 1:32 AM, Michael Torrie <torriem at 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).


More information about the Python-list mailing list