traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Put block length computations in a more logical order.

This commit is contained in:
Raymond Hettinger 2016-03-02 00:06:21 -08:00
parent 2ad474ba5e
commit 589106b206
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Modules/_collectionsmodule.c
View File

@ -589,8 +589,8 @@ deque_clear(dequeobject *deque)
/* Now the old size, leftblock, and leftindex are disconnected from
the empty deque and we can use them to decref the pointers.
*/
itemptr = &leftblock->data[leftindex];
m = (BLOCKLEN - leftindex > n) ? n : BLOCKLEN - leftindex;
itemptr = &leftblock->data[leftindex];
limit = &leftblock->data[leftindex + m];
n -= m;
while (1) {
@ -600,8 +600,8 @@ deque_clear(dequeobject *deque)
CHECK_NOT_END(leftblock->rightlink);
prevblock = leftblock;
leftblock = leftblock->rightlink;
itemptr = leftblock->data;
m = (n > BLOCKLEN) ? BLOCKLEN : n;
itemptr = leftblock->data;
limit = &leftblock->data[m];
n -= m;
freeblock(prevblock);