Lines Matching defs:rotate
2457 /* decNumberRotate -- rotate the coefficient of a Number left/right */
2464 /* rhs is B, the number of digits to rotate (-ve to right) */
2471 /* before the rotate. Any leading zeros in the result are removed */
2484 Int rotate; /* rhs as an Int */
2497 rotate=decGetInt(rhs); /* [cannot fail] */
2498 if (rotate==BADINT /* something bad .. */
2499 || rotate==BIGODD || rotate==BIGEVEN /* .. very big .. */
2500 || abs(rotate)>set->digits) /* .. or out of range */
2504 /* convert -ve rotate to equivalent positive rotation */
2505 if (rotate<0) rotate=set->digits+rotate;
2506 if (rotate!=0 && rotate!=set->digits /* zero or full rotation */
2508 /* left-rotate to do; 0 < rotate < set->digits */
2522 /* [if there are no whole units left to rotate, the */
2530 /* 3. rotate all the units by reversing left part, right */
2533 /* example: rotate right 8 digits (2 units + 2), DECDPUN=3. */
2547 /* Step 1: amount to shift is the partial right-rotate count */
2548 rotate=set->digits-rotate; /* make it right-rotate */
2549 units=rotate/DECDPUN; /* whole units to rotate */
2550 shift=rotate%DECDPUN; /* left-over digits count */
2565 /* If whole units to rotate... */
2567 /* Step 2: the units to touch are the whole ones in rotate, */
2577 /* Step 3: rotate the units array using triple reverse */
2582 } /* whole units to rotate */
2586 } /* rotate needed */