bit/div.fj¶
Macros¶
bit¶
bit.div10—dst[:n], src[:n] = src[:n] / 10, src[:n] % 10.bit.idiv— Signed integer division:q = a/b,r = a%bwithsign(r)==sign(a). Jumps toendifb==0.q,a,b,rare bit[:n]. Wasteful …bit.div— Unsigned integer division:q = a/b,r = a%b. Jumps toendifb==0.q,a,b,rare bit[:n]. Wasteful in space — prefer …bit.idiv_loop— Compact signed integer division (slower thanbit.idiv, but uses much less program space):q = a/b,r = a%bwithsign(r)==sign(a). …bit.div_loop— Compact unsigned integer division (slower thanbit.div, but uses much less program space):q = a/b,r = a%b. Jumps toendifb==0.
bit.div10¶
bit.div10.cmp_sub_10—if (val > 10) {
bit.div¶
bit.div.div_step— One step of bit-level long division:R[0] ^= N; then ifR[:n] >= D[:n], doR -= Dand toggleQ[0]. The inner loop ofbit.div/ …