Lines Matching defs:zero
105 // the strategy is to shift until we get a non-zero sign bit
302 * lvalue > 0L (not zero, nor negative).
513 digits = zero;
580 digits = zero;
787 * was too high, our first quotient will be zero. In this
798 // oops. Usually ignore leading zero.
840 * was too high, our first quotient will be zero. In this
851 // oops. Usually ignore leading zero.
905 * was too high, our first quotient will be zero. In this
915 // oops. Usually ignore leading zero.
1205 * trailing zeros, so simple values (including zero)
1326 * zero. Cut to the chase.
1417 // (if not actually zero).
1515 * ( because of the preference to a zero low-order bit ).
1554 * trailing zeros, so simple values (including zero)
1634 * zero. Cut to the chase.
1766 private static final char zero[] = { '0', '0', '0', '0', '0', '0', '0', '0' };