Lines Matching defs:zero
97 // the strategy is to shift until we get a non-zero sign bit
294 * lvalue > 0L (not zero, nor negative).
443 digits = zero;
503 digits = zero;
710 * was too high, our first quotient will be zero. In this
721 // oops. Usually ignore leading zero.
763 * was too high, our first quotient will be zero. In this
774 // oops. Usually ignore leading zero.
828 * was too high, our first quotient will be zero. In this
838 // oops. Usually ignore leading zero.
924 System.arraycopy(zero, 0, result, i, charLength);
942 System.arraycopy(zero, 0, result, i, -decExponent);
1129 * special hack: if we saw no non-zero digits, then the
1130 * answer is zero!
1134 digits = zero;
1200 // infinity or zero, as appropriate.
1299 * trailing zeros, so simple values (including zero)
1420 * zero. Cut to the chase.
1511 // (if not actually zero).
1609 * ( because of the preference to a zero low-order bit ).
1648 * trailing zeros, so simple values (including zero)
1728 * zero. Cut to the chase.
1860 private static final char zero[] = { '0', '0', '0', '0', '0', '0', '0', '0' };
1903 * normalization. If the significand is zero, the
1905 * will be zero.
1947 * If the significand is exactly zero, return a properly
1948 * signed zero.
2006 // If the significand is zero, the exponent doesn't
2007 // matter; return a properly signed zero.
2034 // checked for a zero significand. Thus the signs
2053 // Starting copying non-zero bits into proper position in
2203 // zero or subnormal; however after the
2219 } else { // Subnormal or zero
2318 * zero; otherwise, float round bit is properly set
2330 // will be zero or infinity.
2361 // low-order bits be zero. Therefore,
2372 // low-order bits zero, the significand
2540 // oops. Value is zero. Cannot normalize it!
2541 throw new IllegalArgumentException("zero value");
2544 * In most cases, we assume that wordcount is zero. This only
2742 // if any of my high-order words is non-zero,
2748 // if any of other's high-order words is non-zero,