Lines Matching refs:count
64 * is > count, then trailing zeros between the digits[count-1] and the
73 * unlimited magnitude. The count value contains the number of significant
76 * Zero is represented by any DigitList with count == 0 or with each digits[i]
77 * for all i <= count == '0'.
80 public int count = 0;
96 for (int i=0; i<count; ++i) if (digits[i] != '0') return false;
105 // * you hit the decimal point, you set myDigitList.decimalAt = myDigitList.count;
110 // count = 0;
117 ensureCapacity(count+1, count);
118 digits[count++] = (byte) digit;
127 * If (count == 0) this throws a NumberFormatException, which
131 if (count == 0) return 0.0;
132 StringBuilder temp = new StringBuilder(count);
134 for (int i = 0; i < count; ++i) temp.append((char)(digits[i]));
139 // return (value * Math.pow(10, decimalAt - count));
144 * If (count == 0) this returns 0, unlike Long.parseLong().
149 if (count == 0) return 0;
156 StringBuilder temp = new StringBuilder(count);
159 temp.append((i < count) ? (char)(digits[i]) : '0');
176 StringBuilder stringRep = new StringBuilder(count);
180 for (int i=0; i<count; ++i) {
184 while (d-- > count) {
189 int len = decimalAt > count ? decimalAt : count;
197 for (int i = 0; i < count; ++i) {
200 n = count+1;
202 for (int i = 0; i < count; ++i) {
205 n = count;
216 StringBuilder stringRep = new StringBuilder(count+1);
229 for (int i=0; i<count; ++i) {
235 while (d-- > count) {
256 long scale = (long)count - (long)decimalAt;
258 int numDigits = count;
262 if (numShift < count) {
290 while (count > 0 && digits[count - 1] == (byte)'0') --count;
291 return count == 0 || decimalAt >= count;
303 // // then check the size. If the digit count is 18 or less, then
308 // while (count > 0 && digits[count - 1] == (byte)'0') --count;
310 // if (count == 0) {
316 // if (decimalAt < count || decimalAt > MAX_LONG_DIGITS) return false;
320 // // At this point we have decimalAt == count, and count == MAX_LONG_DIGITS.
323 // for (int i=0; i<count; ++i)
330 // // At this point the first count digits match. If decimalAt is less
331 // // than count, then the remaining digits are zero, and we return true.
332 // if (count < decimalAt) return true;
382 count = 0;
386 count = 1;
390 count = 0;
398 while (count > 1 && digits[count - 1] == '0')
399 --count;
413 count = 0;
427 decimalAt = count;
436 } else if (count < maxCount) {
445 ensureCapacity(count+1, count);
446 digits[count++] = (byte)c;
451 decimalAt = count;
462 * <code>count-1</code>. If 0, then all digits are rounded away, and
474 if (maximumDigits < count) {
478 for (int i=maximumDigits+1; i<count; ++i) {
492 * Upon return, count will be less than or equal to maximumDigits.
499 if (maximumDigits >= 0 && maximumDigits < count) {
513 maximumDigits = 0; // Adjust the count
523 ++maximumDigits; // Increment for use as count
525 count = maximumDigits;
530 while (count > 1 && digits[count-1] == '0') {
531 --count;
576 decimalAt = count = MAX_LONG_DIGITS;
577 System.arraycopy(LONG_MIN_REP, 0, digits, 0, count);
579 count = 0;
594 count = right - left + 1;
595 System.arraycopy(digits, left, digits, 0, count);
611 count = decimalAt = stringDigits.length();
615 while (count > 1 && stringDigits.charAt(count - 1) == '0') --count;
620 --count;
624 ensureCapacity(count, 0);
625 for (int i = 0; i < count; ++i) {
677 //| count = last - first;
679 //| ++count;
686 //| ensureCapacity(count, 0);
687 //| for (int i = 0; i < count; ++i) {
746 if (decimalAt != count || count != MAX_LONG_DIGITS)
749 for (int i = 0; i < count; ++i)
810 if (count != other.count ||
813 for (int i = 0; i < count; i++)
826 for (int i = 0; i < count; i++)
837 for (int i=0; i<count; ++i) buf.append((char)digits[i]);
