diff options
| author | Andrew MacIntyre <andymac@bullseye.apana.org.au> | 2003-12-28 07:43:56 (GMT) |
|---|---|---|
| committer | Andrew MacIntyre <andymac@bullseye.apana.org.au> | 2003-12-28 07:43:56 (GMT) |
| commit | f1ca7f561c6e02509e17414825305ebcbd6f72b0 (patch) | |
| tree | 05e27b4da0e97b3fec8536beb820c9a6d9d96c36 /Misc/NEWS | |
| parent | 30973414c5ec31cbd6314591d2f359e4b4c5889f (diff) | |
| download | cpython-f1ca7f561c6e02509e17414825305ebcbd6f72b0.zip cpython-f1ca7f561c6e02509e17414825305ebcbd6f72b0.tar.gz cpython-f1ca7f561c6e02509e17414825305ebcbd6f72b0.tar.bz2 | |
complete backout of listobject.c v2.171
Diffstat (limited to 'Misc/NEWS')
| -rw-r--r-- | Misc/NEWS | 8 |
1 files changed, 0 insertions, 8 deletions
@@ -118,14 +118,6 @@ Core and builtins same as split() except that it scans the string from the end working towards the beginning. See SF feature request 801847. -- in a thread on comp.lang.python, several people noted that list() - was much slower than in 2.1 and earlier versions of Python, when used - to create new lists from existing lists. Duncan Booth did some - research that uncovered an optimisation that, for lists below - about 100 elements, was actually slower than the normal case. The - special case criteria have been tightened to rectify the performance - regression. - Extension modules ----------------- |