Lines Matching defs:zero
88 // the strategy is to shift until we get a non-zero sign bit
285 * lvalue > 0L (not zero, nor negative).
448 digits = zero;
512 digits = zero;
720 * was too high, our first quotient will be zero. In this
731 // oops. Usually ignore leading zero.
773 * was too high, our first quotient will be zero. In this
784 // oops. Usually ignore leading zero.
838 * was too high, our first quotient will be zero. In this
848 // oops. Usually ignore leading zero.
934 System.arraycopy(zero, 0, result, i, charLength);
953 System.arraycopy(zero, 0, result, i, -decExponent);
1012 buf.append(zero, 0 , charLength);
1025 buf.append(zero, 0, -decExponent);
1189 * special hack: if we saw no non-zero digits, then the
1190 * answer is zero!
1194 digits = zero;
1260 // infinity or zero, as appropriate.
1364 * trailing zeros, so simple values (including zero)
1485 * zero. Cut to the chase.
1576 // (if not actually zero).
1674 * ( because of the preference to a zero low-order bit ).
1713 * trailing zeros, so simple values (including zero)
1793 * zero. Cut to the chase.
1925 private static final char zero[] = { '0', '0', '0', '0', '0', '0', '0', '0' };
1968 * normalization. If the significand is zero, the
1970 * will be zero.
2012 * If the significand is exactly zero, return a properly
2013 * signed zero.
2071 // If the significand is zero, the exponent doesn't
2072 // matter; return a properly signed zero.
2099 // checked for a zero significand. Thus the signs
2118 // Starting copying non-zero bits into proper position in
2268 // zero or subnormal; however after the
2284 } else { // Subnormal or zero
2383 * zero; otherwise, float round bit is properly set
2395 // will be zero or infinity.
2426 // low-order bits be zero. Therefore,
2437 // low-order bits zero, the significand