| /external/stlport/test/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/sources/android/stlport/test/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');
|
| /external/astl/include/ |
| limits | 47 // Template to return the number of decimal digits in a number
79 // The number of radix digits that be represented without change. For
81 // floating-point types, the number of radix digits in the mantissa.
83 static const int digits = 0;
85 // The number of base 10 digits that can be represented without change.
117 static const int digits = __FLT_MANT_DIG__;
133 static const int digits = __DBL_MANT_DIG__;
149 static const int digits = static_cast<int>(sizeof(int) * CHAR_BIT);
150 static const int digits10 = digits10<int, digits, is_signed>::value;
165 static const int digits = static_cast<int>(sizeof(unsigned int) * CHAR_BIT)
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/js1_2/regexp/ |
| digit.js | 43 var digits = "1234567890"; variable
45 // be sure all digits are matched by \d
47 "'" + digits + "'.match(new RegExp('\\d+'))",
48 String([digits]), String(digits.match(new RegExp('\\d+'))));
50 // be sure all non-digits are matched by \D
55 // be sure all non-digits are not matched by \d
60 // be sure all digits are not matched by \D
62 "'" + digits + "'.match(new RegExp('\\D'))",
63 null, digits.match(new RegExp('\\D')))
[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...] |
| BigInteger.java | 60 transient int[] digits; field in class:BigInteger
64 * digits.length().
119 * @param digits a reference of some array created before.
121 BigInteger(int sign, int numberLength, int[] digits) {
122 setJavaRepresentation(sign, numberLength, digits);
142 int[] digits = new int[numberLength]; local
144 digits[i] = random.nextInt();
147 digits[numberLength - 1] >>>= (-numBits) & 31;
148 setJavaRepresentation(sign, numberLength, digits);
179 * non-empty sequence of decimal digits. Digits are interpreted as if b
330 int[] digits = (sign != 0) ? bigInt.littleEndianIntsMagnitude() : new int[] { 0 }; local
1164 int[] digits = new int[bigRadixDigitsLength]; local
[all...] |
| BitLevel.java | 47 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) {
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, intCount, count)
[all...] |
| /external/dropbear/libtommath/ |
| bn_mp_rand.c | 20 mp_rand (mp_int * a, int digits)
26 if (digits <= 0) {
39 while (--digits > 0) {
|
| /external/stlport/src/ |
| num_get.cpp | 78 bool _STLP_CALL __get_fdigit(wchar_t& c, const wchar_t* digits) {
79 const wchar_t* p = find(digits, digits + 10, c);
80 if (p != digits + 10) {
81 c = (char)('0' + (p - digits));
89 const wchar_t * digits) {
95 return __get_fdigit(c, digits);
|
| 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/android/stlport/src/ |
| num_get.cpp | 78 bool _STLP_CALL __get_fdigit(wchar_t& c, const wchar_t* digits) {
79 const wchar_t* p = find(digits, digits + 10, c);
80 if (p != digits + 10) {
81 c = (char)('0' + (p - digits));
89 const wchar_t * digits) {
95 return __get_fdigit(c, digits);
|
| 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/icu4c/i18n/ |
| decNumber.c | 60 /* precision (up to 999,999,999 digits) and arbitrary exponent */
64 /* tightly: digits, emax, and -emin in the context must be <= */
69 /* be finite, positive, have an exponent of zero, and all digits */
70 /* must be either 0 or 1. The result will only contain digits */
150 /* 6. The digits count is allowed to rise to a multiple of DECDPUN */
152 /* accounting of digits is not needed. The correct digits value */
154 /* This must be called before any rounding if the number of digits */
158 /* numbers up to four digits, using appropriate constants. This */
321 /* complement of digits (where appropriate -- this is not the case *
7769 Int digits=(len-1)*DECDPUN+1; \/* possible digits excluding msu *\/ local
7959 Int ae, d, digits; \/* .. *\/ local
[all...] |
| digitlst.cpp | 52 * This is the zero digit. The base for the digits returned by getDigit()
73 fContext.digits = fStorage.getCapacity() - sizeof(decNumber);
130 c.digits = 1;
146 int32_t savedDigits = fContext.digits;
147 fContext.digits = 1;
149 fContext.digits = savedDigits;
163 // Reduce - remove trailing zero digits.
171 // trim - remove trailing fraction zero digits.
178 // Resets the digit list; sets all the digits to zero.
195 * @return the number of digits written, not including the sign
[all...] |
| /bionic/libc/netbsd/nameser/ |
| ns_ttl.c | 103 int ch, digits, dirty; local
107 digits = 0;
115 digits++;
118 if (digits == 0)
132 digits = 0;
135 if (digits > 0) {
|
| /external/icu4c/samples/datefmt/ |
| util.cpp | 22 int8_t digits,
25 while (digits > 0) {
26 target += DIGIT_STRING[(number >> ((--digits) * 4)) & 0xF];
|
| /external/icu4c/samples/msgfmt/ |
| util.cpp | 22 int8_t digits,
25 while (digits > 0) {
26 target += DIGIT_STRING[(number >> ((--digits) * 4)) & 0xF];
|
| /external/icu4c/samples/translit/ |
| util.cpp | 22 int8_t digits,
25 while (digits > 0) {
26 target += DIGIT_STRING[(number >> ((--digits) * 4)) & 0xF];
|
| /libcore/luni/src/main/java/java/net/ |
| URLEncoder.java | 28 static final String digits = "0123456789ABCDEF"; field in class:URLEncoder
65 buf.append(digits.charAt((bytes[j] & 0xf0) >> 4));
66 buf.append(digits.charAt(bytes[j] & 0xf));
130 buf.append(digits.charAt((bytes[j] & 0xf0) >> 4));
131 buf.append(digits.charAt(bytes[j] & 0xf));
|
| /libcore/luni/src/main/java/java/lang/ |
| StrictMath.java | 312 * cancellation of significant digits).
1132 long digits = factor + Double.EXPONENT_BIAS + subNormalFactor; local
1184 int digits = factor + Float.EXPONENT_BIAS + subNormalFactor; local
[all...] |
| RealToString.java | 28 * An array of decimal digits, filled by longDigitGenerator or bigIntDigitGenerator.
30 private final int[] digits = new int[64]; field in class:RealToString
33 * Number of valid entries in 'digits'.
194 sb.append0((char) ('0' + digits[digitIndex++]));
204 sb.append0((char) ('0' + digits[digitIndex++]));
227 int U = digits[digitIndex++];
238 U = digitIndex < digitCount ? digits[digitIndex++] : -1;
299 digits[digitCount++] = U;
302 digits[digitCount++] = U;
304 digits[digitCount++] = U + 1
[all...] |
| /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/sql/ |
| Date.java | 193 private void format(int date, int digits, StringBuilder sb) {
195 if (digits - str.length() > 0) {
196 sb.append(PADDING.substring(0, digits - str.length()));
238 * 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()));
|
| /external/chromium/base/ |
| rand_util.cc | 33 static const int kBits = std::numeric_limits<double>::digits;
|
