Searched refs:digits (Results 1 - 14 of 14) sorted by relevance

/libcore/ojluni/src/main/java/sun/misc/
H A DFormattedFloatingDecimal.java63 char[] digits = getBuffer();
64 int nDigits = fdConverter.getDigits(digits);
72 fillCompatible(precision, digits, nDigits, exp, isNegative);
75 exp = applyPrecision(decExp, digits, nDigits, decExp + precision);
76 fillDecimal(precision, digits, nDigits, exp, isNegative);
80 exp = applyPrecision(decExp, digits, nDigits, precision + 1);
81 fillScientific(precision, digits, nDigits, exp, isNegative);
85 exp = applyPrecision(decExp, digits, nDigits, precision);
86 // adjust precision to be the number of digits to right of decimal
91 fillScientific(precision, digits, nDigit
120 applyPrecision(int decExp, char[] digits, int nDigits, int prec) argument
163 fillCompatible(int precision, char[] digits, int nDigits, int exp, boolean isNegative) argument
262 fillDecimal(int precision, char[] digits, int nDigits, int exp, boolean isNegative) argument
314 fillScientific(int precision, char[] digits, int nDigits, int exp, boolean isNegative) argument
[all...]
H A DFloatingDecimal.java149 * Retrieves the value as an array of digits.
150 * @param digits The digit array.
151 * @return The number of valid digits copied into the array.
153 public int getDigits(char[] digits); argument
220 public int getDigits(char[] digits) { argument
221 throw new IllegalArgumentException("Exceptional value does not have digits");
264 private final char[] digits; field in class:FloatingDecimal.BinaryToASCIIBuffer
269 // the binary to decimal digits conversion done in dtoa() and roundup()
285 this.digits = new char[20];
291 BinaryToASCIIBuffer(boolean isNegative, char[] digits){ argument
323 getDigits(char[] digits) argument
1037 char digits[]; field in class:FloatingDecimal.ASCIIToBinaryBuffer
1040 ASCIIToBinaryBuffer( boolean negSign, int decExponent, char[] digits, int n) argument
[all...]
H A DFDBigInteger.java194 * decimal digits.
197 * @param digits The decimal digits.
198 * @param kDigits The initial index into <code>digits</code>.
199 * @param nDigits The final index into <code>digits</code>.
202 @ requires digits != null;
203 @ requires 0 <= kDigits && kDigits <= nDigits && nDigits <= digits.length;
204 @ requires (\forall int i; 0 <= i && i < nDigits; '0' <= digits[i] && digits[i] <= '9');
205 @ ensures this.value() == \old(lValue * pow10(nDigits - kDigits) + (\sum int i; kDigits <= i && i < nDigits; (digits[
207 FDBigInteger(long lValue, char[] digits, int kDigits, int nDigits) argument
[all...]
/libcore/luni/src/main/java/java/math/
H A DLogical.java51 if (val.digits[val.numberLength - 1] != -1) {
52 for (i = 0; val.digits[i] == -1; i++) {
56 for (i = 0; (i < val.numberLength) && (val.digits[i] == -1); i++) {
67 for (i = 0; val.digits[i] == 0; i++) {
73 resDigits[i] = val.digits[i] + val.sign;
76 resDigits[i] = val.digits[i];
122 resDigits[i] = val.digits[i] & that.digits[i];
135 // the positive digits
145 resDigits[i] = -negative.digits[
[all...]
H A DBigInteger.java54 transient int[] digits; field in class:BigInteger
58 * digits.length().
113 * @param digits a reference of some array created before.
115 BigInteger(int sign, int numberLength, int[] digits) { argument
116 setJavaRepresentation(sign, numberLength, digits);
136 int[] digits = new int[numberLength];
138 digits[i] = random.nextInt();
141 digits[numberLength - 1] >>>= (-numBits) & 31;
142 setJavaRepresentation(sign, numberLength, digits);
207 * non-empty sequence of decimal digits
333 setJavaRepresentation(int sign, int numberLength, int[] digits) argument
[all...]
H A DBitLevel.java47 int highDigit = val.digits[val.numberLength - 1];
73 bCount += Integer.bitCount(val.digits[i]);
77 bCount += Integer.bitCount(-val.digits[i]);
79 bCount += Integer.bitCount(~val.digits[i]);
94 return ((val.digits[n >> 5] & (1 << (n & 31))) != 0);
103 static boolean nonZeroDroppedBits(int numberOfBits, int[] digits) { argument
108 for (i = 0; (i < intCount) && (digits[i] == 0); i++) {
111 return ((i != intCount) || (digits[i] << (32 - bitCount) != 0));
131 shiftLeftOneBit(resDigits, source.digits, srcLen);
147 shiftRight(resDigits, resLength, source.digits, intCoun
[all...]
H A DConversion.java57 int[] digits = val.digits;
63 int highDigit = digits[numberLength - 1];
84 System.arraycopy(digits, 0, temp, 0, numberLength);
91 // divide the array of digits by bigRadix and convert remainders
116 resDigit = digits[i] >> (j << 2) & 0xf;
141 int[] digits = val.digits;
173 // one 32-bit unsigned value may contains 10 decimal digits
178 // inserting necessary scaled digits
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DUUID.java376 return (digits(mostSigBits >> 32, 8) + "-" +
377 digits(mostSigBits >> 16, 4) + "-" +
378 digits(mostSigBits, 4) + "-" +
379 digits(leastSigBits >> 48, 4) + "-" +
380 digits(leastSigBits, 12));
383 /** Returns val represented by the specified number of hex digits. */
384 private static String digits(long val, int digits) { argument
385 long hi = 1L << (digits * 4);
H A DScanner.java385 // A pattern for non-ASCII digits
420 private String digits = "0123456789abcdefghijklmnopqrstuvwxyz"; field in class:Scanner
424 String radixDigits = digits.substring(0, radix);
425 // Android-changed: Support non-decimal starting digits. (i.e, a-z are valid radix digits).
426 String nonZeroRadixDigits = "((?i)[" + digits.substring(1, radix) + "]|(" + non0Digit + "))";
433 // Android-changed: Support non-decimal starting digits.
1871 * specific suffixes, then mapping non-ASCII digits into ASCII
1872 * digits via {@link Character#digit Character.digit}, prepending a
1977 * specific suffixes, then mapping non-ASCII digits int
[all...]
/libcore/ojluni/src/main/java/java/lang/
H A DByte.java109 * string must all be digits, of the specified radix (as
158 * byte}. The characters in the string must all be decimal digits,
257 * except that underscores are not accepted between digits.
526 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS;
527 char[] buf = new char[2]; // We always want two digits.
528 buf[0] = digits[(b >> 4) & 0xf];
529 buf[1] = digits[b & 0xf];
H A DInteger.java78 final static char[] digits = { field in class:Integer
105 * character. The following ASCII characters are used as digits:
115 * are used as radix-<var>N</var> digits in the order shown. Thus,
116 * the digits for hexadecimal (radix 16) are
149 buf[charPos--] = digits[-(i % radix)];
152 buf[charPos] = digits[-i];
178 * <p>The behavior of radixes and the characters used as digits
197 * argument. This value is converted to a string of ASCII digits
210 * following characters are used as hexadecimal digits:
243 * argument. This value is converted to a string of ASCII digits
[all...]
H A DLong.java95 * character. The following ASCII characters are used as digits:
105 * are used as radix-<var>N</var> digits in the order shown. Thus,
106 * the digits for hexadecimal (radix 16) are
135 buf[charPos--] = Integer.digits[(int)(-(i % radix))];
138 buf[charPos] = Integer.digits[(int)(-i)];
164 * <p>The behavior of radixes and the characters used as digits
192 * allows the last digit and preceding digits to be
236 * ASCII digits in hexadecimal (base&nbsp;16) with no extra
248 * following characters are used as hexadecimal digits:
283 * ASCII digits i
[all...]
/libcore/ojluni/src/main/java/java/text/
H A DDecimalFormat.java64 * locale, including support for Western, Arabic, and Indic digits. It also
137 * serves only to specify the negative prefix and suffix; the number of digits,
138 * minimal digits, and other characteristics are all the same as the positive
142 * <p>The prefixes, suffixes, and various symbols used for infinity, digits,
155 * of digits between the grouping characters, such as 3 for 100,000,000 or 4 for
267 * <li>The minimum and maximum number of integer digits are interpreted
271 * <li>If the maximum number of integer digits is greater than their minimum number
273 * number of integer digits, and the minimum number of integer digits to be
280 * <li>Otherwise, the minimum number of integer digits i
[all...]
/libcore/benchmarks/src/benchmarks/regression/
H A DR.java1530 public static final int digits = 0; field in class:R

Completed in 236 milliseconds