Searched defs:digit (Results 1 - 25 of 56) sorted by relevance

123

/external/clang/test/CodeGenCXX/
H A Dtemplate-dependent-bind-temporary.cpp16 T digit; local
17 char((digit < 10 ? '0' : 'a') + digit) + result;
/external/icu4c/common/
H A Dustrfmt.c32 int digit; local
37 digit = (int)(i % radix);
38 buffer[length++]=(UChar)(digit<=9?(0x0030+digit):(0x0030+digit+7));
H A Dcstring.c148 uint8_t digit; local
163 digit = (uint8_t)(uval % radix);
164 tbuf[--tbx] = (char)(T_CString_itosOffset(digit));
186 uint8_t digit; local
201 digit = (uint8_t)(uval % radix);
202 tbuf[--tbx] = (char)(T_CString_itosOffset(digit));
H A Dpunycode.c90 digitToBasic(int32_t digit, UBool uppercase) { argument
93 if(digit<26) {
95 return (char)(_CAPITAL_A+digit);
97 return (char)(_SMALL_A+digit);
100 return (char)((_ZERO_-26)+digit);
376 int32_t n, destLength, i, bias, basicLength, j, in, oldi, w, k, digit, t, local
452 digit=basicToDigit[(uint8_t)src[in++]];
453 if(digit<0) {
457 if(digit>(0x7fffffff-i)/w) {
463 i+=digit*
[all...]
H A Dutil.cpp57 int32_t digit = n / r; local
58 result.append(DIGITS[digit]);
59 n -= digit * r;
/external/chromium/third_party/libjingle/source/talk/base/
H A Durlencode.cc37 int digit = *pch++; local
38 if (digit >= '0' && digit <= '9') {
39 value += digit - '0';
41 else if (digit >= 'A' && digit <= 'F') {
42 value += digit - 'A' + 10;
44 else if (digit >= 'a' && digit <= 'f') {
45 value += digit
[all...]
/external/icu4c/tools/genrb/
H A Drbutil.c72 int digit; local
82 digit = (int)(i % radix);
83 buffer[length++]= digits[digit];
/external/chromium/chrome/browser/metrics/
H A Dmetrics_log_unittest.cc36 char digit = xml_encoded->at(i); local
37 ASSERT_GE(digit, '0');
38 ASSERT_LE(digit, '9');
/external/icu4c/samples/numfmt/
H A Dutil.cpp35 uint32_t digit; local
37 digit = (number >> ((--digits) * 4)) & 0xF;
38 target += (UChar)(digit < 10 ? 0x30 + digit : 0x41 - 10 + digit);
/external/v8/src/
H A Dconversions.cc155 int digit; local
157 digit = static_cast<char>(*current) - '0';
159 digit = static_cast<char>(*current) - 'a' + 10;
161 digit = static_cast<char>(*current) - 'A' + 10;
171 number = number * radix + digit;
532 insignificant_digits++; // Move the digit into the exponential part.
632 int digit = *current - '0';
634 && !(num == max_exponent / 10 && digit <= max_exponent % 10)) {
637 num = num * 10 + digit;
801 // Build the string backwards from the least significant digit
[all...]
H A Dstrtod.cc121 // The input buffer has been trimmed. Therefore the last digit must be
124 // Set the last digit to be non-zero. This is sufficient to guarantee
133 // When the string starts with "1844674407370955161" no further digit is read.
135 // digit if it was less or equal than 6, but this would complicate the code.
141 int digit = buffer[i++] - '0'; local
142 ASSERT(0 <= digit && digit <= 9);
143 result = 10 * result + digit;
H A Dbignum-dtoa.cc167 // If 1 <= (numerator+delta_plus) / denominator < 10 then no leading 0 digit
180 uint16_t digit; local
181 digit = numerator->DivideModuloIntBignum(*denominator);
182 ASSERT(digit <= 9); // digit is a uint16_t and therefore always positive.
183 // digit = numerator / denominator (integer division).
185 buffer[(*length)++] = digit + '0';
218 // If yes, then the next digit would be < 5 and we can round down.
224 // Note that the last digit could not be a '9' as otherwise the whole
249 // Note again that the last digit coul
272 uint16_t digit; local
282 uint16_t digit; local
[all...]
H A Dbignum.cc96 int digit = buffer[i] - '0'; local
97 ASSERT(0 <= digit && digit <= 9);
98 result = result * 10 + digit;
110 // Let's just say that each digit needs 4 bits.
356 // In the worst case we have to accumulate nb-digits products of digit*digit.
371 // Process temporary digit i with power i.
511 // Remove the multiples of the first digit.
630 // Otherwise they are equal up to this digit
[all...]
H A Dfast-dtoa.cc43 // A different range might be chosen on a different platform, to optimize digit
49 // Adjusts the last digit of the generated number, and screens out generated
208 // Increment the last digit recursively until we find a non '9' digit.
215 // If the first digit is now '0'+ 10 we had a buffer with all '9's. With the
216 // exception of the first digit all digits are now '0'. Simply switch the
217 // first digit to '1' and adjust the kappa. Example: "99" becomes "10" and
358 // * buffer contains the shortest possible decimal digit-sequence
376 // get each digit. Example the first digit afte
432 int digit = integrals / divisor; local
467 int digit = static_cast<int>(fractionals >> -one.e()); local
541 int digit = integrals / divisor; local
574 int digit = static_cast<int>(fractionals >> -one.e()); local
[all...]
H A Dfixed-dtoa.cc137 int digit = number % 10; local
139 buffer[(*length) + number_length] = '0' + digit;
200 // Round the last digit until we either have a digit that was not '9' or until
201 // we reached the first digit.
210 // If the first digit is now '0' + 10, we would need to set it to '0' and add
211 // a '1' in front. However we reach the first digit only if all following
213 // we simply switch the first digit to '1' and update the decimal-point
214 // (indicating that the point is now one digit to the right).
258 int digit local
279 int digit = fractionals128.DivModPowerOf2(point); local
[all...]
/external/webkit/Source/WebCore/html/parser/
H A DHTMLParserIdioms.cpp127 int digit, exponentSign; local
133 switch (digit = string[cursor]) {
137 digit = string[++cursor];
139 if (digit >= '0' && digit <= '9') {
140 while (cursor < length && digit == '0')
141 digit = string[++cursor];
142 if (digit > '0' && digit <= '9') {
143 exponent32 = digit
[all...]
/external/icu4c/i18n/
H A Dregexcmp.cpp1004 // Scanned a digit from the lower value of an {lower,upper} interval
1016 // Scanned a digit from the upper value of an {lower,upper} interval
1257 // Loop once per digit, for max allowed number of digits in a back reference.
1258 int32_t digit = u_charDigitValue(c); local
1259 groupNum = groupNum * 10 + digit;
3803 // the three digit number would be > 0xff
3822 // The last digit made the number too big. Forget we saw it.
H A Dunesctrn.cpp228 int32_t digit = u_digit(ch, radix); local
229 if (digit < 0) {
233 u = (u * radix) + digit;
/external/icu4c/io/
H A Dufmt_cmn.c71 uint32_t digit; local
75 digit = (uint32_t)(value % radix);
77 buffer[length++] = (UChar)(uselower ? TO_LC_DIGIT(digit)
78 : TO_UC_DIGIT(digit));
149 /* read the next digit */
/external/icu4c/test/intltest/
H A Dpunyref.c73 /* is undefined if flag is nonzero and digit d has no uppercase form. */
223 b, j, in, oldi, w, k, digit, t; local
260 digit = decode_digit(input[in++]);
261 if (digit >= base) return punycode_bad_input;
262 if (digit > (maxint - i) / w) return punycode_overflow;
263 i += digit * w;
266 if (digit < t) break;
/external/ppp/pppd/plugins/pppoatm/
H A Dans.c179 int digit; local
183 digit = addr[i] & 0x0F;
184 *(buf++) = digit + (digit >= 10 ? '7' : '0');
186 digit = ((unsigned char) (addr[i])) >> 4;
187 *(buf++) = digit + (digit >= 10 ? '7' : '0');
/external/protobuf/src/google/protobuf/io/
H A Dtokenizer.cc145 // Given a char, interpret it as a numeric digit and return its value.
147 inline int DigitValue(char digit) { argument
148 if ('0' <= digit && digit <= '9') return digit - '0';
149 if ('a' <= digit && digit <= 'z') return digit - 'a' + 10;
150 if ('A' <= digit && digit <
586 int digit = DigitValue(*ptr); local
[all...]
/external/skia/src/utils/
H A DSkParse.cpp125 int digit; local
127 while ((digit = to_hex(*str)) >= 0)
131 n = (n << 4) | digit;
/external/stlport/stlport/stl/
H A D_ctype.h48 digit = _Locale_DIGIT, enumerator in enum:ctype_base::mask
51 alnum = alpha | digit,
/external/webkit/Source/JavaScriptCore/runtime/
H A DJSGlobalObjectFunctions.cpp162 int digit = -1; local
165 digit = c - '0';
167 digit = c - 'A' + 10;
169 digit = c - 'a' + 10;
171 if (digit >= radix)
173 return digit;
188 int digit = parseDigit(*p, radix); local
189 number += digit * radixMultiplier;
210 int digit = parseDigit(*p, radix); local
211 number += digit * radixMultiplie
256 int digit = parseDigit(data[p], radix); local
[all...]

Completed in 5004 milliseconds

123