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

123456

/external/clang/test/CodeGenCXX/
H A Dtemplate-dependent-bind-temporary.cpp16 T digit; local
17 char((digit < 10 ? '0' : 'a') + digit) + result;
/external/chromium_org/third_party/icu/source/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.c159 uint8_t digit; local
174 digit = (uint8_t)(uval % radix);
175 tbuf[--tbx] = (char)(T_CString_itosOffset(digit));
197 uint8_t digit; local
212 digit = (uint8_t)(uval % radix);
213 tbuf[--tbx] = (char)(T_CString_itosOffset(digit));
/external/icu/icu4c/source/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.c159 uint8_t digit; local
174 digit = (uint8_t)(uval % radix);
175 tbuf[--tbx] = (char)(T_CString_itosOffset(digit));
197 uint8_t digit; local
212 digit = (uint8_t)(uval % radix);
213 tbuf[--tbx] = (char)(T_CString_itosOffset(digit));
/external/chromium_org/third_party/webrtc/base/
H A Dlinuxfdwalk.c32 int digit = *s++ - '0'; local
33 val = val * 10 + digit;
H A Durlencode.cc20 int digit = *pch; local
21 if (digit >= '0' && digit <= '9') {
22 value += digit - '0';
24 else if (digit >= 'A' && digit <= 'F') {
25 value += digit - 'A' + 10;
27 else if (digit >= 'a' && digit <= 'f') {
28 value += digit
[all...]
/external/llvm/lib/MC/
H A DMCInstPrinter.cpp59 // For asm-style hex (e.g. 0ffh) the first digit always has to be a number.
64 uint64_t digit = (Value >> 60) & 0xf; local
65 if (digit != 0)
66 return (digit >= 0xa);
/external/chromium_org/rlz/lib/
H A Dstring_utils.cc52 int digit = 0; local
54 if (!GetHexValue(text[idx], &digit)) {
63 number = (number << 4) | digit;
85 string->at(2 * index) = kHex[data[index] >> 4]; // high digit
86 string->at(2 * index + 1) = kHex[data[index] & 0x0F]; // low digit
/external/chromium_org/third_party/icu/source/tools/genrb/
H A Drbutil.c72 int digit; local
82 digit = (int)(i % radix);
83 buffer[length++]= digits[digit];
/external/icu/icu4c/source/tools/genrb/
H A Drbutil.c72 int digit; local
82 digit = (int)(i % radix);
83 buffer[length++]= digits[digit];
/external/chromium_org/third_party/icu/source/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/chromium_org/v8/src/
H A Dconversions-inl.h148 int digit; local
150 digit = static_cast<char>(*current) - '0';
152 digit = static_cast<char>(*current) - 'a' + 10;
154 digit = static_cast<char>(*current) - 'A' + 10;
164 number = number * radix + digit;
553 insignificant_digits++; // Move the digit into the exponential part.
651 int digit = *current - '0';
653 && !(num == max_exponent / 10 && digit <= max_exponent % 10)) {
656 num = num * 10 + digit;
H A Dstrtod.cc100 // The input buffer has been trimmed. Therefore the last digit must be
103 // Set the last digit to be non-zero. This is sufficient to guarantee
113 // When the string starts with "1844674407370955161" no further digit is read.
115 // digit if it was less or equal than 6, but this would complicate the code.
121 int digit = buffer[i++] - '0'; local
122 DCHECK(0 <= digit && digit <= 9);
123 result = 10 * result + digit;
/external/icu/icu4c/source/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/chromium_org/components/autofill/core/browser/
H A Dvalidation.cc95 int digit = *iter - '0'; local
97 digit *= 2;
98 sum += digit / 10 + digit % 10;
100 sum += digit;
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
H A Dstrtod.cc122 // The input buffer has been trimmed. Therefore the last digit must be
125 // Set the last digit to be non-zero. This is sufficient to guarantee
134 // When the string starts with "1844674407370955161" no further digit is read.
136 // digit if it was less or equal than 6, but this would complicate the code.
142 int digit = buffer[i++] - '0'; local
143 ASSERT(0 <= digit && digit <= 9);
144 result = 10 * result + digit;
H A Dbignum-dtoa.cc169 // If 1 <= (numerator+delta_plus) / denominator < 10 then no leading 0 digit
182 uint16_t digit; local
183 digit = numerator->DivideModuloIntBignum(*denominator);
184 ASSERT(digit <= 9); // digit is a uint16_t and therefore always positive.
185 // digit = numerator / denominator (integer division).
187 buffer[(*length)++] = digit + '0';
220 // If yes, then the next digit would be < 5 and we can round down.
226 // Note that the last digit could not be a '9' as otherwise the whole
251 // Note again that the last digit coul
274 uint16_t digit; local
284 uint16_t digit; local
[all...]
H A Dbignum.cc97 int digit = buffer[i] - '0'; local
98 ASSERT(0 <= digit && digit <= 9);
99 result = result * 10 + digit;
111 // Let's just say that each digit needs 4 bits.
357 // In the worst case we have to accumulate nb-digits products of digit*digit.
372 // Process temporary digit i with power i.
512 // Remove the multiples of the first digit.
631 // Otherwise they are equal up to this digit
[all...]
H A Dfixed-dtoa.cc138 int digit = number % 10; local
140 buffer[(*length) + number_length] = '0' + digit;
201 // Round the last digit until we either have a digit that was not '9' or until
202 // we reached the first digit.
211 // If the first digit is now '0' + 10, we would need to set it to '0' and add
212 // a '1' in front. However we reach the first digit only if all following
214 // we simply switch the first digit to '1' and update the decimal-point
215 // (indicating that the point is now one digit to the right).
259 int digit local
280 int digit = fractionals128.DivModPowerOf2(point); local
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/
H A Dnasmlib.c26 int digit; local
79 if (*p<'0' || (*p>'9' && *p<'A') || (digit = numvalue(*p)) >= radix)
/external/guava/guava/src/com/google/common/primitives/
H A DUnsignedLongs.java268 int digit = Character.digit(s.charAt(pos), radix);
269 if (digit == -1) {
272 if (pos > max_safe_pos && overflowInParse(value, digit, radix)) {
275 value = (value * radix) + digit;
282 * Returns true if (current * radix) + digit is a number too large to be represented by an
287 private static boolean overflowInParse(long current, int digit, int radix) { argument
296 return (digit > maxValueMods[radix]);
/external/libunwind/src/
H A Dos-linux.h114 unsigned long num_digits = 0, digit, val = 0; local
122 digit = *cp;
123 if ((digit - '0') <= 9)
124 digit -= '0';
125 else if ((digit - 'a') < 6)
126 digit -= 'a' - 10;
127 else if ((digit - 'A') < 6)
128 digit -= 'A' - 10;
131 val = (val << 4) | digit;
144 unsigned long num_digits = 0, digit, va local
[all...]
/external/chromium_org/chrome/browser/devtools/device/usb/
H A Dandroid_rsa.cc157 int digit = a[oa] < b[ob] ? oa - ob - 1 : oa - ob; local
159 for (; digit >= 0; --digit) {
161 BnLeftShift(shifted_b, digit);
164 q[digit] = value;
/external/chromium_org/third_party/WebKit/Source/core/html/shadow/
H A DDateTimeNumericFieldElement.cpp123 const int digit = number[0] - '0'; local
124 if (digit < 0 || digit > 9)

Completed in 9657 milliseconds

123456