| /external/robolectric-shadows/resources/src/main/java/org/robolectric/res/android/ |
| Formatter.java | 4 public static StringBuilder toHex(int value, int digits) {
5 StringBuilder sb = new StringBuilder(digits + 2);
8 for (int i = hex.length(); i < digits; i++) {
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| NumberingSystemsTest.java | 29 String digits = parts.getAttributeValue(2, "digits"); local
30 if (digits == null) {
34 UTF16.countCodePoint(digits));
37 for (int i = 0; i < digits.length(); i += UTF16.getCharCount(cp)) {
38 cp = UTF16.charAt(digits, i);
45 if (!script.containsAll(digits)) {
47 && digits.equals("0123456789")
49 && digits
53 errln("Script doesn't match digits: " + id + ",
[all...] |
| /external/antlr/tool/src/main/java/org/antlr/codegen/ |
| JavaScriptTarget.java | 67 private void writeHexWithPadding(StringBuffer buf, String digits) {
68 digits = digits.toUpperCase();
69 int padding = 8 - digits.length();
74 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...] |
| /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)
196 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
23 static_assert(std::numeric_limits<T>::digits == expected, "digits test 1");
24 static_assert(std::numeric_limits<const T>::digits == expected, "digits test 2");
25 static_assert(std::numeric_limits<volatile T>::digits == expected, "digits test 3");
26 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...] |
| /external/dynamic_depth/internal/strings/ |
| numbers.cc | 13 // Represents integer values of digits.
74 // "0x" with no digits after is invalid.
88 // "0x" with no digits after is invalid.
102 // Consume digits.
169 // loop over digits
210 // loop over digits
315 uint32 digits;
318 // steps of two digits at a time rather than one whenever possible.
323 digits = u / 100000000; // 100,000,000
324 u -= digits * 100000000
[all...] |
| /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))
|
| 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/desugar/test/java/com/google/devtools/build/android/desugar/testdata/java8/ |
| DefaultInterfaceWithLambda.java | 31 return digits();
34 public List<String> digits(); method in interface:DefaultInterfaceWithLambda
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| DateNumberFormat.java | 38 private char[] digits; field in class:DateNumberFormat
43 private static final int DECIMAL_BUF_SIZE = 20; // 20 digits is good enough to store Long.MAX_VALUE
53 throw new UnsupportedOperationException("DateNumberFormat does not support digits out of BMP.");
93 digits = new char[10];
94 System.arraycopy(elems, 0, digits, 0, 10);
95 zeroDigit = digits[0];
131 if (digits == null) {
132 digits = new char[10];
134 digits[0] = zero;
136 digits[i] = (char)(zero+i)
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| DateNumberFormat.java | 34 private char[] digits; field in class:DateNumberFormat
39 private static final int DECIMAL_BUF_SIZE = 20; // 20 digits is good enough to store Long.MAX_VALUE
49 throw new UnsupportedOperationException("DateNumberFormat does not support digits out of BMP.");
89 digits = new char[10];
90 System.arraycopy(elems, 0, digits, 0, 10);
91 zeroDigit = digits[0];
127 if (digits == null) {
128 digits = new char[10];
130 digits[0] = zero;
132 digits[i] = (char)(zero+i)
[all...] |
| /external/python/cpython3/Lib/test/ |
| test_strtod.py | 107 # exact halfway cases with a small number of significant digits
118 # with small number of significant digits.
127 # until n * 2**p2 has more than 20 significant digits.
128 digits, exponent = n, e
129 while digits < 10**20:
130 s = '{}e{}'.format(digits, exponent)
133 s = '{}e{}'.format(digits * 10**40, exponent - 40)
135 digits *= 2
139 digits, exponent = n, e
140 while digits < 10**20
[all...] |
| /external/guava/guava-tests/test/com/google/common/math/ |
| MathBenchmarking.java | 67 int digits = RANDOM_SOURCE.nextInt(numBits); local
68 if (digits == 0) {
71 return new BigInteger(digits, RANDOM_SOURCE)
72 .setBit(digits);
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| FixASCIIControlsReader.java | 40 /** count the digits of the sequence */
41 private int digits = 0; field in class:FixASCIIControlsReader
138 digits = 0;
144 digits = 1;
157 digits++;
158 if (digits <= 5)
184 digits++;
185 if (digits <= 4)
|
| /external/icu/icu4c/source/i18n/ |
| decNumber.cpp | 62 /* precision (up to 999,999,999 digits) and arbitrary exponent */
66 /* tightly: digits, emax, and -emin in the context must be <= */
71 /* be finite, positive, have an exponent of zero, and all digits */
72 /* must be either 0 or 1. The result will only contain digits */
152 /* 6. The digits count is allowed to rise to a multiple of DECDPUN */
154 /* accounting of digits is not needed. The correct digits value */
156 /* This must be called before any rounding if the number of digits */
160 /* numbers up to four digits, using appropriate constants. This */
218 /* round-for-reround digits */
7816 Int digits=(len-1)*DECDPUN+1; \/* possible digits excluding msu *\/ local
8006 Int ae, d, digits; \/* .. *\/ local
[all...] |
| /bionic/libc/dns/nameser/ |
| ns_ttl.c | 99 int ch, digits, dirty; local
103 digits = 0;
111 digits++;
114 if (digits == 0)
128 digits = 0;
131 if (digits > 0) {
|
| /device/linaro/bootloader/edk2/StdLib/BsdSocketLib/ |
| ns_ttl.c | 127 int ch, digits, dirty;
local
131 digits = 0;
139 digits++;
142 if (digits == 0)
156 digits = 0;
159 if (digits > 0) {
|
| /external/curl/docs/cmdline-opts/ |
| hostpubmd5.d | 7 Pass a string containing 32 hexadecimal digits. The string should
|
