Lines Matching defs:and
32 // am1: use a single mult and divide to get the high bits,
43 // am2 avoids a big mult-and-extract completely.
131 // (protected) set from string and radix
354 // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
436 // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
447 // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
449 // we really want the negative inverse, and -DV < y < DV
514 // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
1184 BigInteger.prototype.and = bnAnd;
1344 // Pool size must be a multiple of 4 and greater than 32.