summaryrefslogtreecommitdiffstats
path: root/Doc/whatsnew
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2004-02-13 21:50:27 (GMT)
committerRaymond Hettinger <python@rcn.com>2004-02-13 21:50:27 (GMT)
commit238b267bf6da6311f7f2b1e6b1ee570f7d482db4 (patch)
treef1a7ec73cef79a7fd4c6ed6149122b47bd26578e /Doc/whatsnew
parent55cf434735380ce51034c64722cf422457f891e0 (diff)
downloadcpython-238b267bf6da6311f7f2b1e6b1ee570f7d482db4.zip
cpython-238b267bf6da6311f7f2b1e6b1ee570f7d482db4.tar.gz
cpython-238b267bf6da6311f7f2b1e6b1ee570f7d482db4.tar.bz2
Lists are measured in elements not bytes.
Diffstat (limited to 'Doc/whatsnew')
-rw-r--r--Doc/whatsnew/whatsnew24.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/whatsnew/whatsnew24.tex b/Doc/whatsnew/whatsnew24.tex
index 3530c12..1fbc298 100644
--- a/Doc/whatsnew/whatsnew24.tex
+++ b/Doc/whatsnew/whatsnew24.tex
@@ -260,8 +260,8 @@ yellow 5
\begin{itemize}
\item The machinery for growing and shrinking lists was optimized
- for speed and for space efficiency. Small lists (under six bytes)
- never over-allocate by more than one byte. Large lists do not
+ for speed and for space efficiency. Small lists (under six elements)
+ never over-allocate by more than one element. Large lists do not
over-allocate by more than 1/8th. Appending and popping from lists
now runs faster due to more efficient code paths and less frequent
use of the underlying system realloc(). List comprehensions also