Lines Matching defs:lastofs
1381 Py_ssize_t lastofs;
1387 lastofs = 0;
1391 * a[hint + lastofs] < key <= a[hint + ofs]
1396 lastofs = ofs;
1406 lastofs += hint;
1411 * a[hint - ofs] < key <= a[hint - lastofs]
1418 lastofs = ofs;
1425 k = lastofs;
1426 lastofs = hint - ofs;
1431 assert(-1 <= lastofs && lastofs < ofs && ofs <= n);
1432 /* Now a[lastofs] < key <= a[ofs], so key belongs somewhere to the
1433 * right of lastofs but no farther right than ofs. Do a binary
1434 * search, with invariant a[lastofs-1] < key <= a[ofs].
1436 ++lastofs;
1437 while (lastofs < ofs) {
1438 Py_ssize_t m = lastofs + ((ofs - lastofs) >> 1);
1441 lastofs = m+1; /* a[m] < key */
1445 assert(lastofs == ofs); /* so a[ofs-1] < key <= a[ofs] */
1470 Py_ssize_t lastofs;
1476 lastofs = 0;
1480 * a[hint - ofs] <= key < a[hint - lastofs]
1485 lastofs = ofs;
1495 k = lastofs;
1496 lastofs = hint - ofs;
1501 * a[hint + lastofs] <= key < a[hint + ofs]
1508 lastofs = ofs;
1515 lastofs += hint;
1520 assert(-1 <= lastofs && lastofs < ofs && ofs <= n);
1521 /* Now a[lastofs] <= key < a[ofs], so key belongs somewhere to the
1522 * right of lastofs but no farther right than ofs. Do a binary
1523 * search, with invariant a[lastofs-1] <= key < a[ofs].
1525 ++lastofs;
1526 while (lastofs < ofs) {
1527 Py_ssize_t m = lastofs + ((ofs - lastofs) >> 1);
1532 lastofs = m+1; /* a[m] <= key */
1534 assert(lastofs == ofs); /* so a[ofs-1] <= key < a[ofs] */