| /external/icu/icu4c/source/i18n/ |
| precision.cpp | 136 FixedPrecision::handleNonNumeric(DigitList &value, VisibleDigits &digits) {
138 digits.setNaN();
142 digits.setInfinite();
144 digits.setNegative();
154 VisibleDigits &digits,
157 return digits;
159 digits.clear();
160 if (handleNonNumeric(value, digits)) {
161 return digits;
164 digits.setNegative()
[all...] |
| digitaffixesandpadding.cpp | 46 VisibleDigitsWithExponent digits; local
48 (int64_t) value, digits, status);
50 digits,
89 const VisibleDigitsWithExponent &digits,
100 if (!digits.isNaN()) {
101 UBool bPositive = !digits.isNegative();
104 if (optPluralRules == NULL || digits.isInfinite()) {
108 UnicodeString count(optPluralRules->select(digits));
115 formatter.format(digits, handler, appendTo);
118 int32_t codePointCount = countAffixChar32(prefix) + formatter.countChar32(digits) + countAffixChar32(suffix)
155 VisibleDigitsWithExponent digits; local
[all...] |
| precision.h | 41 * fraction digits.
47 * Default is all digits.
52 * Min and max significant digits allowed. The default is no constraints.
70 * rounded number has more than maximum integer digits. Default is FALSE.
126 * @param digits This is the value that is initialized.
128 * @return digits
132 VisibleDigits &digits,
138 * @param digits This is the value that is initialized.
140 * @return digits
144 VisibleDigits &digits,
[all...] |
| /external/avb/test/ |
| avb_unittest_util.cc | 29 char digits[17] = "0123456789abcdef"; local
31 ret.push_back(digits[data[n] >> 4]);
32 ret.push_back(digits[data[n] & 0x0f]);
|
| /libcore/ojluni/src/main/java/sun/misc/ |
| FormattedFloatingDecimal.java | 63 char[] digits = getBuffer(); local
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, nDigits, exp, isNegative)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| JavaScriptTarget.java | 65 private void writeHexWithPadding(StringBuffer buf, String digits) {
66 digits = digits.toUpperCase();
67 int padding = 8 - digits.length();
72 buf.append(digits);
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| DigitList_Android.java | 35 * characters, which are the digits radix 10, from '0' to '9'. It also has a
38 * <em>f</em>, where 0 <= <em>f</em> < 1, derived by placing all the digits of
53 * The maximum number of significant digits in an IEEE 754 double, that
54 * is, in a Java double. This must not be increased, or garbage digits
64 * digits[decimalAt]. If decimalAt is < 0, then leading zeros between
66 * is > count, then trailing zeros between the digits[count-1] and the
70 * f is a value 0.1 <= f < 1 arrived at by placing the digits in Digits to
76 * digits present in digits[]
83 public byte[] digits = new byte[MAX_LONG_DIGITS]; field in class:DigitList_Android
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| DigitList_Android.java | 34 * characters, which are the digits radix 10, from '0' to '9'. It also has a
37 * <em>f</em>, where 0 <= <em>f</em> < 1, derived by placing all the digits of
51 * The maximum number of significant digits in an IEEE 754 double, that
52 * is, in a Java double. This must not be increased, or garbage digits
62 * digits[decimalAt]. If decimalAt is < 0, then leading zeros between
64 * is > count, then trailing zeros between the digits[count-1] and the
68 * f is a value 0.1 <= f < 1 arrived at by placing the digits in Digits to
74 * digits present in digits[]
81 public byte[] digits = new byte[MAX_LONG_DIGITS]; field in class:DigitList_Android
[all...] |
| /libcore/luni/src/main/java/java/math/ |
| Logical.java | 51 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[i] & positive.digits[i]
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| numberformat2test.cpp | 135 DigitList &digits,
148 const DigitList &digits);
152 const VisibleDigits &digits);
156 const VisibleDigitsWithExponent &digits);
160 const VisibleDigits &digits,
167 const VisibleDigitsWithExponent &digits,
186 int64_t expected, const VisibleDigits &digits);
188 double expected, const VisibleDigits &digits);
393 DigitList digits; local
396 digits.set((int32_t)1)
418 DigitList digits; local
499 DigitList digits; local
507 DigitList digits; local
805 VisibleDigits digits; local
1676 VisibleDigits digits; local
1725 VisibleDigits digits; local
1868 VisibleDigits digits; local
1915 VisibleDigits digits; local
2029 VisibleDigits digits; local
2065 VisibleDigits digits; local
2093 VisibleDigits digits; local
2108 precision.initVisibleDigits(uprv_getInfinity(), digits, status); local
2117 precision.initVisibleDigits(uprv_getNaN(), digits, status); local
2124 VisibleDigitsWithExponent digits; local
2255 DigitList digits; local
2380 DigitList digits; local
2490 DigitList digits; local
2706 DigitList digits; local
2861 DigitList digits; local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/duration/impl/ |
| Utils.java | 52 * - Sequences of 0 digits and their units are replaced by a single 0 and no unit.
53 * - If there are two such sequences of 0 digits in a level (1000's and 10's), the 1000's 0 is also omitted.
66 return String.valueOf(zh.digits[(int)n]);
71 char[] digits = String.valueOf(n).toCharArray(); local
73 // first, generate all the digits in place
79 for (int i = digits.length, u = -1, l = -1; --i >= 0;) {
94 int d = digits[i] - '0';
102 buf[--x] = zh.digits[0];
108 buf[--x] = zh.digits[d];
128 if (buf[i] == zh.digits[0] && !last)
193 final char[] digits; field in class:Utils.ChineseDigits
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/impl/ |
| Utils.java | 48 * - Sequences of 0 digits and their units are replaced by a single 0 and no unit.
49 * - If there are two such sequences of 0 digits in a level (1000's and 10's), the 1000's 0 is also omitted.
62 return String.valueOf(zh.digits[(int)n]);
67 char[] digits = String.valueOf(n).toCharArray(); local
69 // first, generate all the digits in place
75 for (int i = digits.length, u = -1, l = -1; --i >= 0;) {
90 int d = digits[i] - '0';
98 buf[--x] = zh.digits[0];
104 buf[--x] = zh.digits[d];
124 if (buf[i] == zh.digits[0] && !last)
189 final char[] digits; field in class:Utils.ChineseDigits
[all...] |
| /external/libcxx/test/std/language.support/support.limits/limits/numeric.limits.members/ |
| digits.pass.cpp | 12 // digits
21 static_assert(std::numeric_limits<T>::digits == expected, "digits test 1");
22 static_assert(std::numeric_limits<const T>::digits == expected, "digits test 2");
23 static_assert(std::numeric_limits<volatile T>::digits == expected, "digits test 3");
24 static_assert(std::numeric_limits<const volatile T>::digits == expected, "digits test 4");
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/language.support/support.limits/limits/numeric.limits.members/ |
| digits.pass.cpp | 12 // digits
21 static_assert(std::numeric_limits<T>::digits == expected, "digits test 1");
22 static_assert(std::numeric_limits<const T>::digits == expected, "digits test 2");
23 static_assert(std::numeric_limits<volatile T>::digits == expected, "digits test 3");
24 static_assert(std::numeric_limits<const volatile T>::digits == expected, "digits test 4");
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_strtod.py | 108 # exact halfway cases with a small number of significant digits
119 # with small number of significant digits.
128 # until n * 2**p2 has more than 20 significant digits.
129 digits, exponent = n, e
130 while digits < 10**20:
131 s = '{}e{}'.format(digits, exponent)
134 s = '{}e{}'.format(digits * 10**40, exponent - 40)
136 digits *= 2
140 digits, exponent = n, e
141 while digits < 10**20:
[all...] |
| test_fpformat.py | 17 # digits instead of 2.
23 def checkFix(self, n, digits):
24 result = fix(n, digits)
27 expected = "%.*f" % (digits, float(n))
31 def checkSci(self, n, digits):
32 result = sci(n, digits)
35 expected = "%.*e" % (digits, float(n))
|
| /external/python/cpython3/Modules/_decimal/tests/ |
| randfloat.py | 12 # exact halfway cases with a small number of significant digits
23 # with small number of significant digits.
32 # until n * 2**p2 has more than 20 significant digits.
33 digits, exponent = n, e
34 while digits < 10**20:
35 s = '{}e{}'.format(digits, exponent)
38 s = '{}e{}'.format(digits * 10**40, exponent - 40)
40 digits *= 2
44 digits, exponent = n, e
45 while digits < 10**20
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_strtod.py | 108 # exact halfway cases with a small number of significant digits
119 # with small number of significant digits.
128 # until n * 2**p2 has more than 20 significant digits.
129 digits, exponent = n, e
130 while digits < 10**20:
131 s = '{}e{}'.format(digits, exponent)
134 s = '{}e{}'.format(digits * 10**40, exponent - 40)
136 digits *= 2
140 digits, exponent = n, e
141 while digits < 10**20
[all...] |
| test_fpformat.py | 17 # digits instead of 2.
23 def checkFix(self, n, digits):
24 result = fix(n, digits)
27 expected = "%.*f" % (digits, float(n))
31 def checkSci(self, n, digits):
32 result = sci(n, digits)
35 expected = "%.*e" % (digits, float(n))
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_strtod.py | 108 # exact halfway cases with a small number of significant digits
119 # with small number of significant digits.
128 # until n * 2**p2 has more than 20 significant digits.
129 digits, exponent = n, e
130 while digits < 10**20:
131 s = '{}e{}'.format(digits, exponent)
134 s = '{}e{}'.format(digits * 10**40, exponent - 40)
136 digits *= 2
140 digits, exponent = n, e
141 while digits < 10**20
[all...] |
| test_fpformat.py | 17 # digits instead of 2.
23 def checkFix(self, n, digits):
24 result = fix(n, digits)
27 expected = "%.*f" % (digits, float(n))
31 def checkSci(self, n, digits):
32 result = sci(n, digits)
35 expected = "%.*e" % (digits, float(n))
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_strtod.py | 108 # exact halfway cases with a small number of significant digits
119 # with small number of significant digits.
128 # until n * 2**p2 has more than 20 significant digits.
129 digits, exponent = n, e
130 while digits < 10**20:
131 s = '{}e{}'.format(digits, exponent)
134 s = '{}e{}'.format(digits * 10**40, exponent - 40)
136 digits *= 2
140 digits, exponent = n, e
141 while digits < 10**20
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_strtod.py | 108 # exact halfway cases with a small number of significant digits
119 # with small number of significant digits.
128 # until n * 2**p2 has more than 20 significant digits.
129 digits, exponent = n, e
130 while digits < 10**20:
131 s = '{}e{}'.format(digits, exponent)
134 s = '{}e{}'.format(digits * 10**40, exponent - 40)
136 digits *= 2
140 digits, exponent = n, e
141 while digits < 10**20
[all...] |
| /external/syslinux/core/ |
| writehex.c | 22 static inline void __writehex(uint32_t h, int digits)
24 while (digits) {
28 shift = --digits;
|
| /external/python/cpython2/Lib/test/ |
| test_fpformat.py | 17 # digits instead of 2.
23 def checkFix(self, n, digits):
24 result = fix(n, digits)
27 expected = "%.*f" % (digits, float(n))
31 def checkSci(self, n, digits):
32 result = sci(n, digits)
35 expected = "%.*e" % (digits, float(n))
|
