18 #define BLOCKLEN 62  macro
19 #define CENTER ((BLOCKLEN - 1) / 2)
51     PyObject *data[BLOCKLEN];
65     if (len >= PY_SSIZE_T_MAX - 2*BLOCKLEN) {  in newblock()
143     assert(BLOCKLEN >= 2);  in deque_new()
184             deque->rightindex = BLOCKLEN - 1;  in deque_pop()
208     if (deque->leftindex == BLOCKLEN) {  in deque_popleft()
234     if (deque->rightindex == BLOCKLEN-1) {  in deque_append()
264         deque->leftindex = BLOCKLEN;  in deque_appendleft()
318         if (deque->rightindex == BLOCKLEN-1) {  in deque_extend()
381             deque->leftindex = BLOCKLEN;  in deque_extendleft()
436             deque->leftindex = BLOCKLEN;  in _deque_rotate()
460             deque->rightindex = BLOCKLEN - 1;  in _deque_rotate()
464         if (deque->rightindex == BLOCKLEN - 1) {  in _deque_rotate()
473         assert (deque->rightindex < BLOCKLEN - 1);  in _deque_rotate()
476         if (m > BLOCKLEN - deque->leftindex)  in _deque_rotate()
477             m = BLOCKLEN - deque->leftindex;  in _deque_rotate()
478         if (m > BLOCKLEN - 1 - deque->rightindex)  in _deque_rotate()
479             m = BLOCKLEN - 1 - deque->rightindex;  in _deque_rotate()
488         if (deque->leftindex == BLOCKLEN) {  in _deque_rotate()
538         if (leftindex == BLOCKLEN) {  in deque_reverse()
551             rightindex = BLOCKLEN - 1;  in deque_reverse()
588         if (leftindex == BLOCKLEN) {  in deque_count()
694         if (leftindex == BLOCKLEN && n) {  in deque_clear()
736         n = i / BLOCKLEN;  in deque_item()
737         i %= BLOCKLEN;  in deque_item()
743             n = (deque->leftindex + deque->len - 1) / BLOCKLEN - n;  in deque_item()
793     n = i / BLOCKLEN;  in deque_ass_item()
794     i %= BLOCKLEN;  in deque_ass_item()
800         n = (deque->leftindex + len - 1) / BLOCKLEN - n;  in deque_ass_item()
848                      BLOCKLEN - 1;  in deque_traverse()
1115     blocks = (deque->leftindex + deque->len + BLOCKLEN - 1) / BLOCKLEN;  in deque_sizeof()
1117            (blocks - 1) * BLOCKLEN + deque->rightindex);  in deque_sizeof()
1309     if (it->index == BLOCKLEN && it->counter > 0) {  in dequeiter_next()
1408         it->index = BLOCKLEN - 1;  in dequereviter_next()