[Python-Dev] Optimization (original) (raw)

Serhiy Storchaka storchaka at gmail.com
Sat Oct 5 23:02:14 CEST 2013

05.10.13 23:11, Georg Brandl написав(ла):

Am 05.10.2013 21:42, schrieb Serhiy Storchaka:

Please remember me, what was common decision about CPython-only optimizations which change computation complexity? I.g. constant amortization time of += for byte objects and strings, or linear time of sum() for sequences? This appears to be about changeset 499a96611baa: Issue #19087: Improve bytearray allocation in order to allow cheap popping of data at the front (slice deletion).

I just need something to which I can refer in similar situations (there was several similar rejected proposition last months).

I'm not sure issue #19087 is in same category as constant time += for strings. But the converse was not proven.

More information about the Python-Dev mailing list