STINNER Victor added the comment:

> Then perhaps we need notes about algorithmic complexity of bytes, bytearray, 
> list and tuple and dict indexing, set.add and set.discard, dict.__delitem__, 
> list.pop, len(), + and += for all basic sequences and containers, 
> memoryview() for bytes, bytearray and array.array, etc, etc.

That would be awesome :-) Please open a new issue for that. We can use
for example these data:
https://wiki.python.org/moin/TimeComplexity

Such data should be close to the definition of the type, or even close
to the method. Maybe directly in the documentation of each method?

----------

_______________________________________
Python tracker <rep...@bugs.python.org>
<http://bugs.python.org/issue21667>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe: 
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com

Reply via email to