| /external/protobuf/src/google/protobuf/stubs/ |
| strutil.cc | 236 // The implementation of \x parses any positive number of hex digits,
296 case '0': case '1': case '2': case '3': // octal digit: 1 to 3 digits
318 while (isxdigit(p[1])) // arbitrarily many hex digits
328 // \uhhhh => convert 4 hex digits to UTF-8
336 << "\\u must be followed by 4 hex digits: \\"
345 // \Uhhhhhhhh => convert 8 hex digits to UTF-8
364 << "\\U must be followed by 8 hex digits: \\"
734 int digits; local
738 // and by outputting two digits at a time rather than one.
743 digits = u / 100000000; // 100,000,00
825 int digits; local
[all...] |
| /libcore/luni/src/main/java/java/lang/ |
| RealToString.java | 34 * An array of decimal digits, filled by longDigitGenerator or bigIntDigitGenerator.
36 private final int[] digits = new int[64]; field in class:RealToString
39 * Number of valid entries in 'digits'.
196 sb.append0((char) ('0' + digits[digitIndex++]));
206 sb.append0((char) ('0' + digits[digitIndex++]));
229 int U = digits[digitIndex++];
240 U = digitIndex < digitCount ? digits[digitIndex++] : -1;
308 digits[digitCount++] = U;
311 digits[digitCount++] = U;
313 digits[digitCount++] = U + 1
[all...] |
| IntegralToString.java | 102 * The digits for every supported radix.
104 private static final char[] DIGITS = {
151 buf[--cursor] = DIGITS[radix * q - i];
219 // Calculate digits two-at-a-time till remaining digits fit in 16 bits
229 // Calculate remaining digits one-at-a-time for performance
234 buf[--cursor] = DIGITS[r];
285 buf[--cursor] = DIGITS[(int) (radix * q - v)];
337 int low = (int) (n % 1000000000); // Extract low-order 9 digits
340 // Zero-pad Low order part to 9 digits
458 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
465 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
473 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
488 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
[all...] |
| /external/stlport/src/ |
| num_get_float.cpp | 86 wchar_t* digits) {
92 ct.widen(ndigits + 0, ndigits + 10, digits);
323 // Second argument is number of digits in buffer, 1 <= digits <= 17.
338 * 1) decimal digits as an integer
353 /* Convert the decimal digits to a binary integer. */
420 if (value == (ULL(1) << (limits::digits - 1))) { /* carry created normal number */
468 value &= ~(ULL(1) << (limits::digits - 1)); /* hide hidden bit */
487 /* Convert the decimal digits to a binary integer. */
530 if ( limits::digits < 64 )
653 char digits[max_digits]; local
759 char digits[max_digits]; local
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| num_get_float.cpp | 86 wchar_t* digits) {
92 ct.widen(ndigits + 0, ndigits + 10, digits);
323 // Second argument is number of digits in buffer, 1 <= digits <= 17.
338 * 1) decimal digits as an integer
353 /* Convert the decimal digits to a binary integer. */
420 if (value == (ULL(1) << (limits::digits - 1))) { /* carry created normal number */
468 value &= ~(ULL(1) << (limits::digits - 1)); /* hide hidden bit */
487 /* Convert the decimal digits to a binary integer. */
530 if ( limits::digits < 64 )
653 char digits[max_digits]; local
759 char digits[max_digits]; local
[all...] |
| /external/libcxx/test/numerics/rand/rand.util/rand.util.canonical/ |
| generate_canonical.pass.cpp | 38 F f = std::generate_canonical<F, std::numeric_limits<F>::digits - 1>(r);
45 F f = std::generate_canonical<F, std::numeric_limits<F>::digits>(r);
52 F f = std::generate_canonical<F, std::numeric_limits<F>::digits + 1>(r);
74 F f = std::generate_canonical<F, std::numeric_limits<F>::digits - 1>(r);
84 F f = std::generate_canonical<F, std::numeric_limits<F>::digits>(r);
94 F f = std::generate_canonical<F, std::numeric_limits<F>::digits + 1>(r);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.util/rand.util.canonical/ |
| generate_canonical.pass.cpp | 38 F f = std::generate_canonical<F, std::numeric_limits<F>::digits - 1>(r);
45 F f = std::generate_canonical<F, std::numeric_limits<F>::digits>(r);
52 F f = std::generate_canonical<F, std::numeric_limits<F>::digits + 1>(r);
74 F f = std::generate_canonical<F, std::numeric_limits<F>::digits - 1>(r);
84 F f = std::generate_canonical<F, std::numeric_limits<F>::digits>(r);
94 F f = std::generate_canonical<F, std::numeric_limits<F>::digits + 1>(r);
|
| /libcore/luni/src/main/java/java/sql/ |
| Date.java | 194 private void format(int date, int digits, StringBuilder sb) {
196 if (digits - str.length() > 0) {
197 sb.append(PADDING.substring(0, digits - str.length()));
235 * significance digits corresponding to milliseconds, seconds, minutes and
|
| Time.java | 202 private void format(int date, int digits, StringBuilder sb) {
204 if (digits - str.length() > 0) {
205 sb.append(PADDING.substring(0, digits - str.length()));
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| types.h | 130 static const int _CASable_bits = std::numeric_limits<_CASable>::digits;
|
| random_number.h | 76 _M_rand_sup(1ULL << std::numeric_limits<uint32_t>::digits),
87 _M_rand_sup(1ULL << std::numeric_limits<uint32_t>::digits),
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| types.h | 130 static const int _CASable_bits = std::numeric_limits<_CASable>::digits;
|
| random_number.h | 76 _M_rand_sup(1ULL << std::numeric_limits<uint32_t>::digits),
87 _M_rand_sup(1ULL << std::numeric_limits<uint32_t>::digits),
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| types.h | 130 static const int _CASable_bits = std::numeric_limits<_CASable>::digits;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| types.h | 130 static const int _CASable_bits = std::numeric_limits<_CASable>::digits;
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| MediaFragmentURIParser.cpp | 42 StringBuilder digits; local
47 digits.append(input[position++]);
48 return digits.toString();
53 StringBuilder digits; local
60 digits.append(input[position++]);
62 digits.append(input[position++]);
63 return digits.toString();
248 // seconds must be specified as exactly two digits, hours and fractional
249 // seconds can be any number of digits. The hours, minutes and seconds
274 String digits = collectFraction(timeString, length, offset)
[all...] |
| /external/jhead/ |
| gpsinfo.c | 212 int den, digits; local
215 digits = 0;
216 while (den > 1 && digits <= 6){
218 digits += 1;
220 if (digits > 6) digits = 6;
221 FmtString[1+a*7] = (char)('2'+digits+(digits ? 1 : 0));
222 FmtString[3+a*7] = (char)('0'+digits);
|
| /external/stlport/test/unit/ |
| num_facets_test.cpp | 59 string digits = "7"; local
60 complete_digits(digits);
61 ref += digits;
69 digits = "9";
70 complete_digits(digits);
71 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
86 digits = "7";
87 complete_digits(digits);
88 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| num_facets_test.cpp | 59 string digits = "7"; local
60 complete_digits(digits);
61 ref += digits;
69 digits = "9";
70 complete_digits(digits);
71 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
86 digits = "7";
87 complete_digits(digits);
88 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
|
| /ndk/tests/device/test-stlport/unit/ |
| num_facets_test.cpp | 59 string digits = "7"; local
60 complete_digits(digits);
61 ref += digits;
69 digits = "9";
70 complete_digits(digits);
71 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
86 digits = "7";
87 complete_digits(digits);
88 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
|
| /frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/java/ |
| IntegralToString.java | 95 * The digits for every supported radix.
97 private static final char[] DIGITS = {
144 buf[--cursor] = DIGITS[radix * q - i];
212 // Calculate digits two-at-a-time till remaining digits fit in 16 bits
222 // Calculate remaining digits one-at-a-time for performance
227 buf[--cursor] = DIGITS[r];
278 buf[--cursor] = DIGITS[(int) (radix * q - v)];
330 int low = (int) (n % 1000000000); // Extract low-order 9 digits
333 // Zero-pad Low order part to 9 digits
451 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
458 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
466 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
481 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
[all...] |
| /libcore/luni/src/main/java/java/math/ |
| Conversion.java | 57 int[] digits = val.digits; local
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; local
173 // one 32-bit unsigned value may contains 10 decimal digits
178 // inserting necessary scaled digits
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| WNafUtil.java | 18 int digits = _3k.bitLength() - 1; local
19 int[] naf = new int[(digits + 1) >> 1];
22 for (int i = 1; i <= digits; ++i)
111 int digits = Math.max(g.bitLength(), h.bitLength()) + 1; local
112 byte[] jsf = new byte[digits];
169 int digits = _3k.bitLength() - 1; local
170 byte[] naf = new byte[digits];
172 for (int i = 1; i <= digits; ++i)
187 * <code>w</code> consecutive digits in the resulting representation, at
|
| /external/chromium_org/third_party/icu/source/tools/genrb/ |
| rbutil.c | 68 const char digits[16] = {'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'}; local
83 buffer[length++]= digits[digit];
|
| /external/icu/icu4c/source/tools/genrb/ |
| rbutil.c | 68 const char digits[16] = {'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'}; local
83 buffer[length++]= digits[digit];
|
