Lines Matching defs:result
374 char result [];
376 result = new char[ ndigits ];
377 System.arraycopy( digits, digitno, result, 0, ndigits );
378 this.digits = result;
410 // Given the desired number of digits predict the result's exponent.
425 char [] result = new char[nDigits];
426 for (int i = 0; i < result.length; i++) result[i] = '0';
430 System.arraycopy(digits, 0, result, 0, nDigits);
431 return result;
437 result[0] = '1';
439 return result;
452 result[0] = '1';
453 return result;
456 result[i] = (char)(q + 1);
459 result[i] = digits[i];
461 return result;
613 // with scaling by 10^nTinyBits, the result will fit in
622 * result is easily converted to a string.
628 * in the result. The integer you get from this can
967 StringBuffer result = new StringBuffer( nDigits+8 );
968 if ( isNegative ){ result.append( '-' ); }
970 result.append( digits, 0, nDigits );
972 result.append( "0.");
973 result.append( digits, 0, nDigits );
974 result.append('e');
975 result.append( decExponent );
977 return new String(result);
990 public int getChars(char[] result) {
993 if (isNegative) { result[0] = '-'; i = 1; }
995 System.arraycopy(digits, 0, result, i, nDigits);
1035 System.arraycopy(digits, 0, result, i, charLength);
1040 result[i++] = '0';
1045 result[i++] = '.';
1046 result[i++] = '0';
1053 result[i++] = '.';
1056 System.arraycopy(digits, charLength, result, i, t);
1059 result[i++] = '0';
1064 result[i++] = '.';
1065 System.arraycopy(digits, charLength, result, i, t);
1075 result[i++] = '0';
1080 result[i++] = '.';
1082 result[i++] = '0';
1088 result[i++] = '.';
1090 System.arraycopy(digits, 0, result, i, t);
1094 result[i++] = digits[0];
1096 result[i++] = '.';
1098 System.arraycopy(digits, 1, result, i, nDigits-1);
1101 result[i++] = '0';
1103 result[i++] = 'E';
1108 result[i++] = '.';
1109 System.arraycopy(digits, 1, result, i, t);
1113 result[i++] = 'e';
1117 result[i++] = '-';
1121 result[i++] = '+';
1127 result[i++] = '0';
1128 result[i++] = (char)(e+'0');
1130 result[i++] = (char)(e/10 +'0');
1131 result[i++] = (char)(e%10 + '0');
1133 result[i++] = (char)(e/100+'0');
1135 result[i++] = (char)(e/10+'0');
1136 result[i++] = (char)(e%10 + '0');
1155 * ROUNDING DIRECTION in case the result is really destined
1302 * Look more closely at the result.
1305 * value. Else call the result infinity
1308 * rounding forces the result here to be
1349 * Look more closely at the result.
1352 * value. Else call the result 0.0
1355 * rounding forces the result here to be
1371 * dValue is now approximately the result.
1374 * Formulate the EXACT big-number result as