Lines Matching defs:right
86 /* For exponentiation, use the binary left-to-right algorithm unless the
1598 /* Shift digit vector a[0:m] d bits right, with 0 <= d < PyLong_SHIFT. Put
1879 /* fill the string right-to-left */
2227 /* Read string from right, and fill in int from left; i.e.,
2989 digits. If shifting right, we use
3170 The right-hand side is just the result of rotating the
3804 sdigit right = b->ob_digit[0];
3812 mod = left % right;
3816 mod = right - 1 - (left - 1) % right;
3827 sdigit right = b->ob_digit[0];
3835 div = left / right;
3839 div = -1 - (left - 1) / right;
4023 1. The integer 'shift' is chosen so that x has the right number of
4039 if shift <= 0, right shift bits if shift > 0) and then dividing by
4542 /* Left-to-right binary exponentiation (HAC Algorithm 14.79) */
4545 /* Find the first significant exponent bit. Search right to left
4575 /* Left-to-right k-ary sliding window exponentiation
4727 /* Clip the value. With such large wordshift the right shift
4735 integer right by PyLong_SHIFT*wordshift + remshift bits.