Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 55cf434 commit 238b267Copy full SHA for 238b267
1 file changed
Doc/whatsnew/whatsnew24.tex
@@ -260,8 +260,8 @@ \subsection{Optimizations}
260
\begin{itemize}
261
262
\item The machinery for growing and shrinking lists was optimized
263
- for speed and for space efficiency. Small lists (under six bytes)
264
- 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
265
over-allocate by more than 1/8th. Appending and popping from lists
266
now runs faster due to more efficient code paths and less frequent
267
use of the underlying system realloc(). List comprehensions also
0 commit comments