| /ndk/tests/device/test-gnustl-full/unit/ |
| complete_digits.h | 8 complete_digits(std::string &digits)
10 complete_digits(string &digits)
13 while (digits.size() < 2)
15 digits.insert(digits.begin(), '0');
|
| /ndk/tests/device/test-stlport/unit/ |
| complete_digits.h | 8 complete_digits(std::string &digits)
10 complete_digits(string &digits)
13 while (digits.size() < 2)
15 digits.insert(digits.begin(), '0');
|
| /hardware/bsp/intel/peripheral/libupm/src/tm1637/ |
| javaupm_tm1637.i | 8 %rename("writeArray") write(uint8_t *digits);
9 %rename("writeString") write(std::string digits);
11 %apply uint8_t *INPUT { uint8_t *digits }
|
| jsupm_tm1637.i | 7 %rename("writeArray") write(uint8_t *digits);
8 %rename("writeString") write(std::string digits);
|
| /external/icu/icu4c/source/i18n/ |
| precision.cpp | 134 FixedPrecision::handleNonNumeric(DigitList &value, VisibleDigits &digits) {
136 digits.setNaN();
140 digits.setInfinite();
142 digits.setNegative();
152 VisibleDigits &digits,
155 return digits;
157 digits.clear();
158 if (handleNonNumeric(value, digits)) {
159 return digits;
162 digits.setNegative()
[all...] |
| digitaffixesandpadding.cpp | 44 VisibleDigitsWithExponent digits; local
46 (int64_t) value, digits, status);
48 digits,
87 const VisibleDigitsWithExponent &digits,
98 if (!digits.isNaN()) {
99 UBool bPositive = !digits.isNegative();
102 if (optPluralRules == NULL || digits.isInfinite()) {
106 UnicodeString count(optPluralRules->select(digits));
113 formatter.format(digits, handler, appendTo);
116 int32_t codePointCount = countAffixChar32(prefix) + formatter.countChar32(digits) + countAffixChar32(suffix)
153 VisibleDigitsWithExponent digits; local
[all...] |
| precision.h | 39 * fraction digits.
45 * Default is all digits.
50 * Min and max significant digits allowed. The default is no constraints.
68 * rounded number has more than maximum integer digits. Default is FALSE.
124 * @param digits This is the value that is initialized.
126 * @return digits
130 VisibleDigits &digits,
136 * @param digits This is the value that is initialized.
138 * @return digits
142 VisibleDigits &digits,
[all...] |
| /libcore/ojluni/src/main/java/java/text/ |
| DigitList.java | 56 * precision to represent all digits of a long.
59 * which are the digits radix 10, from '0' to '9'. It also has a radix
62 * derived by placing all the digits of the list to the right of the
75 * The maximum number of significant digits in an IEEE 754 double, that
76 * is, in a Java double. This must not be increased, or garbage digits
85 * digits[decimalAt]. If decimalAt is < 0, then leading zeros between
87 * is > count, then trailing zeros between the digits[count-1] and the
91 * f is a value 0.1 <= f < 1 arrived at by placing the digits in Digits to
97 * digits present in digits[]
104 public char[] digits = new char[MAX_COUNT]; field in class:DigitList
[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);
|
| /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 | 133 DigitList &digits,
146 const DigitList &digits);
150 const VisibleDigits &digits);
154 const VisibleDigitsWithExponent &digits);
158 const VisibleDigits &digits,
165 const VisibleDigitsWithExponent &digits,
184 int64_t expected, const VisibleDigits &digits);
186 double expected, const VisibleDigits &digits);
391 DigitList digits; local
394 digits.set(1)
416 DigitList digits; local
497 DigitList digits; local
505 DigitList digits; local
803 VisibleDigits digits; local
1674 VisibleDigits digits; local
1723 VisibleDigits digits; local
1866 VisibleDigits digits; local
1913 VisibleDigits digits; local
2027 VisibleDigits digits; local
2063 VisibleDigits digits; local
2091 VisibleDigits digits; local
2106 precision.initVisibleDigits(uprv_getInfinity(), digits, status); local
2115 precision.initVisibleDigits(uprv_getNaN(), digits, status); local
2122 VisibleDigitsWithExponent digits; local
2253 DigitList digits; local
2378 DigitList digits; local
2488 DigitList digits; local
2704 DigitList digits; local
2859 DigitList digits; local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/duration/impl/ |
| Utils.java | 50 * - Sequences of 0 digits and their units are replaced by a single 0 and no unit.
51 * - If there are two such sequences of 0 digits in a level (1000's and 10's), the 1000's 0 is also omitted.
64 return String.valueOf(zh.digits[(int)n]);
69 char[] digits = String.valueOf(n).toCharArray(); local
71 // first, generate all the digits in place
77 for (int i = digits.length, u = -1, l = -1; --i >= 0;) {
92 int d = digits[i] - '0';
100 buf[--x] = zh.digits[0];
106 buf[--x] = zh.digits[d];
126 if (buf[i] == zh.digits[0] && !last)
191 final char[] digits; field in class:Utils.ChineseDigits
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/impl/ |
| Utils.java | 46 * - Sequences of 0 digits and their units are replaced by a single 0 and no unit.
47 * - If there are two such sequences of 0 digits in a level (1000's and 10's), the 1000's 0 is also omitted.
60 return String.valueOf(zh.digits[(int)n]);
65 char[] digits = String.valueOf(n).toCharArray(); local
67 // first, generate all the digits in place
73 for (int i = digits.length, u = -1, l = -1; --i >= 0;) {
88 int d = digits[i] - '0';
96 buf[--x] = zh.digits[0];
102 buf[--x] = zh.digits[d];
122 if (buf[i] == zh.digits[0] && !last)
187 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");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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/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...] |
| 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/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/icu/android_icu4j/src/main/java/android/icu/text/ |
| DigitList.java | 30 * characters, which are the digits radix 10, from '0' to '9'. It also has a
33 * <em>f</em>, where 0 <= <em>f</em> < 1, derived by placing all the digits of
47 * The maximum number of significant digits in an IEEE 754 double, that
48 * is, in a Java double. This must not be increased, or garbage digits
58 * digits[decimalAt]. If decimalAt is < 0, then leading zeros between
60 * is > count, then trailing zeros between the digits[count-1] and the
64 * f is a value 0.1 <= f < 1 arrived at by placing the digits in Digits to
70 * digits present in digits[]
77 public byte[] digits = new byte[MAX_LONG_DIGITS]; field in class:DigitList
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| DigitList.java | 29 * characters, which are the digits radix 10, from '0' to '9'. It also has a
32 * <em>f</em>, where 0 <= <em>f</em> < 1, derived by placing all the digits of
46 * The maximum number of significant digits in an IEEE 754 double, that
47 * is, in a Java double. This must not be increased, or garbage digits
57 * digits[decimalAt]. If decimalAt is < 0, then leading zeros between
59 * is > count, then trailing zeros between the digits[count-1] and the
63 * f is a value 0.1 <= f < 1 arrived at by placing the digits in Digits to
69 * digits present in digits[]
76 public byte[] digits = new byte[MAX_LONG_DIGITS]; field in class:DigitList
[all...] |
| /libcore/ojluni/src/main/java/sun/misc/ |
| FormattedFloatingDecimal.java | 38 char digits[]; field in class:FormattedFloatingDecimal
45 int precision; // number of digits to the right of decimal
51 private FormattedFloatingDecimal( boolean negSign, int decExponent, char []digits, int n, boolean e, int precision, Form form )
56 this.digits = digits;
304 * The only reason that we develop the digits here, rather than
311 char digits[]; local
337 digits = (char[])(perThreadBuffer.get());
347 digits[digitno--] = (char)(c+'0');
352 digits[digitno] = (char)(c+'0')
755 char digits[] = this.digits = new char[18]; local
[all...] |
