Lines Matching defs:product
305 * Returns {@code n!}, that is, the product of the first {@code n} positive
330 long product = LongMath.factorials[startingNumber - 1];
332 int shift = Long.numberOfTrailingZeros(product);
333 product >>= shift;
336 int productBits = LongMath.log2(product, FLOOR) + 1;
354 // If it won't fit in a long, then we store off the intermediate product.
356 bignums.add(BigInteger.valueOf(product));
357 product = 1;
360 product *= normalizedNum;
361 productBits = LongMath.log2(product, FLOOR) + 1;
364 if (product > 1) {
365 bignums.add(BigInteger.valueOf(product));
