Home
last modified time | relevance | path

Searched refs:digit (Results 1 - 25 of 302) sorted by relevance

12345678910>>...13

/third_party/python/Include/cpython/
H A Dlongintrepr.h13 integer type, and one set for 15-bit digits with each digit stored in an
15 configure time or in pyport.h, is used to decide which digit size to use.
17 Type 'digit' should be able to hold 2*PyLong_BASE-1, and type 'twodigits'
19 PyLong_BASE*PyLong_BASE-1. x_sub assumes that 'digit' is an unsigned type,
36 digit; with the current values this forces PyLong_SHIFT >= 9
43 typedef uint32_t digit; typedef
44 typedef int32_t sdigit; /* signed variant of digit */
48 #define _PyLong_DECIMAL_SHIFT 9 /* max(e such that 10**e fits in a digit) */
49 #define _PyLong_DECIMAL_BASE ((digit)1000000000) /* 10 ** DECIMAL_SHIFT */
51 typedef unsigned short digit; typedef
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DDateNumberFormat.java224 int digit = ch - digits[0]; in parse()
225 if (digit < 0 || 9 < digit) { in parse()
226 digit = UCharacter.digit(ch); in parse()
228 if (digit < 0 || 9 < digit) { in parse()
229 for ( digit = 0 ; digit < 10 ; digit in parse()
[all...]
H A DPunycode.java102 private static char digitToBasic(int digit, boolean uppercase) { in digitToBasic() argument
105 if(digit<26) { in digitToBasic()
107 return (char)(CAPITAL_A+digit); in digitToBasic()
109 return (char)(SMALL_A+digit); in digitToBasic()
112 return (char)((ZERO-26)+digit); in digitToBasic()
281 int n, i, bias, basicLength, j, in, oldi, w, k, digit, t, in decode()
338 digit=decodeDigit(src.charAt(in++)); in decode()
339 if(digit<0) { in decode()
342 if(digit>(0x7fffffff-i)/w) { in decode()
347 i+=digit* in decode()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DDateNumberFormat.java228 int digit = ch - digits[0]; in parse()
229 if (digit < 0 || 9 < digit) { in parse()
230 digit = UCharacter.digit(ch); in parse()
232 if (digit < 0 || 9 < digit) { in parse()
233 for ( digit = 0 ; digit < 10 ; digit in parse()
[all...]
H A DPunycode.java112 private static char digitToBasic(int digit, boolean uppercase) { in digitToBasic() argument
115 if(digit<26) { in digitToBasic()
117 return (char)(CAPITAL_A+digit); in digitToBasic()
119 return (char)(SMALL_A+digit); in digitToBasic()
122 return (char)((ZERO-26)+digit); in digitToBasic()
278 int n, i, bias, basicLength, j, in, oldi, w, k, digit, t, in decode()
335 digit=basicToDigit[src.charAt(in++) & 0xFF]; in decode()
336 if(digit<0) { in decode()
339 if(digit>(0x7fffffff-i)/w) { in decode()
344 i+=digit* in decode()
[all...]
/third_party/libunwind/libunwind/src/
H A Dos-linux.h112 unsigned long num_digits = 0, digit, val = 0; in scan_hex() local
120 digit = *cp; in scan_hex()
121 if ((digit - '0') <= 9) in scan_hex()
122 digit -= '0'; in scan_hex()
123 else if ((digit - 'a') < 6) in scan_hex()
124 digit -= 'a' - 10; in scan_hex()
125 else if ((digit - 'A') < 6) in scan_hex()
126 digit -= 'A' - 10; in scan_hex()
129 val = (val << 4) | digit; in scan_hex()
142 unsigned long num_digits = 0, digit, va in scan_dec() local
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_intern.c19 * with the exception that the most significant digit may be only
20 * w-1 zeros away from that next non-zero digit.
61 * Modified wNAF may be one digit longer than binary representation in bn_compute_wNAF()
74 int digit = 0; in bn_compute_wNAF() local
82 digit = window_val - next_bit; /* -2^w < digit < 0 */ in bn_compute_wNAF()
89 * so using a positive digit here will decrease in bn_compute_wNAF()
93 digit = window_val & (mask >> 1); /* 0 < digit < 2^w */ in bn_compute_wNAF()
97 digit in bn_compute_wNAF()
[all...]
/third_party/openssl/crypto/bn/
H A Dbn_intern.c19 * with the exception that the most significant digit may be only
20 * w-1 zeros away from that next non-zero digit.
61 * Modified wNAF may be one digit longer than binary representation in bn_compute_wNAF()
74 int digit = 0; in bn_compute_wNAF() local
82 digit = window_val - next_bit; /* -2^w < digit < 0 */ in bn_compute_wNAF()
89 * so using a positive digit here will decrease in bn_compute_wNAF()
93 digit = window_val & (mask >> 1); /* 0 < digit < 2^w */ in bn_compute_wNAF()
97 digit in bn_compute_wNAF()
[all...]
/third_party/node/deps/v8/src/bigint/
H A Dtostring.cc9 #include "src/bigint/digit-arithmetic.h"
181 // When processing the last (most significant) digit, don't write leading
183 char* BasecaseLast(digit_t digit, char* out) { in BasecaseLast() argument
184 if (radix_ == 10) return BasecaseFixedLast<10>(digit, out); in BasecaseLast()
187 *(--out) = kConversionChars[digit % radix_]; in BasecaseLast()
188 digit /= radix_; in BasecaseLast()
189 } while (digit > 0); in BasecaseLast()
193 // When processing a middle (non-most significant) digit, always write the
195 char* BasecaseMiddle(digit_t digit, char* out) { in BasecaseMiddle() argument
198 *(--out) = kConversionChars[digit in BasecaseMiddle()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dpgxdec.c30 char digit; in pgx_get_number() local
37 digit = bytestream2_get_byteu(g); in pgx_get_number()
38 if (digit == ' ' || digit == 0xA || digit == 0xD) in pgx_get_number()
40 else if (digit < '0' || digit > '9') in pgx_get_number()
43 temp = (uint64_t)10 * (*number) + (digit - '0'); in pgx_get_number()
/third_party/rust/crates/syn/src/
H A Dbigint.rs17 for digit in self.digits.iter().rev() {
18 has_nonzero |= *digit != 0;
20 repr.push((*digit + b'0') as char);
60 for digit in &mut self.digits { in mul_assign()
61 let prod = *digit * base + carry; in mul_assign()
62 *digit = prod % 10; in mul_assign()
/third_party/node/deps/v8/src/objects/
H A Dbigint.cc248 // 0-indexed position of most significant bit in the most significant digit. in NewFromDouble()
253 // Next digit under construction. in NewFromDouble()
254 digit_t digit; in NewFromDouble() local
259 digit = mantissa >> remaining_mantissa_bits; in NewFromDouble()
263 digit = mantissa << (msd_topbit - kMantissaTopBit); in NewFromDouble()
266 result->set_digit(digits - 1, digit); in NewFromDouble()
271 if (sizeof(digit) == 4) { in NewFromDouble()
272 digit = mantissa >> 32; in NewFromDouble()
275 DCHECK_EQ(sizeof(digit), 8); in NewFromDouble()
276 digit in NewFromDouble()
911 digit_t digit = x->digit(digit_index); CompareToDouble() local
938 digit_t digit = bigint->digit(0); ToString() local
1358 const digit_t* digit = reinterpret_cast<const digit_t*>(digits); SerializeDigits() local
1387 digit_t* digit = reinterpret_cast<digit_t*>(digits); FromSerializedDigits() local
[all...]
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dbignum-dtoa.cc183 // If 1 <= (numerator+delta_plus) / denominator < 10 then no leading 0 digit
196 uint16_t digit; in GenerateShortestDigits() local
197 digit = numerator->DivideModuloIntBignum(*denominator); in GenerateShortestDigits()
198 DOUBLE_CONVERSION_ASSERT(digit <= 9); // digit is a uint16_t and therefore always positive. in GenerateShortestDigits()
199 // digit = numerator / denominator (integer division). in GenerateShortestDigits()
201 buffer[(*length)++] = static_cast<char>(digit + '0'); in GenerateShortestDigits()
234 // If yes, then the next digit would be < 5 and we can round down. in GenerateShortestDigits()
240 // Note that the last digit could not be a '9' as otherwise the whole in GenerateShortestDigits()
265 // Note again that the last digit coul in GenerateShortestDigits()
288 uint16_t digit; GenerateCountedDigits() local
298 uint16_t digit; GenerateCountedDigits() local
[all...]
/third_party/icu/icu4c/source/i18n/
H A Ddouble-conversion-bignum-dtoa.cpp197 // If 1 <= (numerator+delta_plus) / denominator < 10 then no leading 0 digit
210 uint16_t digit; in GenerateShortestDigits() local
211 digit = numerator->DivideModuloIntBignum(*denominator); in GenerateShortestDigits()
212 DOUBLE_CONVERSION_ASSERT(digit <= 9); // digit is a uint16_t and therefore always positive. in GenerateShortestDigits()
213 // digit = numerator / denominator (integer division). in GenerateShortestDigits()
215 buffer[(*length)++] = static_cast<char>(digit + '0'); in GenerateShortestDigits()
248 // If yes, then the next digit would be < 5 and we can round down. in GenerateShortestDigits()
254 // Note that the last digit could not be a '9' as otherwise the whole in GenerateShortestDigits()
279 // Note again that the last digit coul in GenerateShortestDigits()
302 uint16_t digit; GenerateCountedDigits() local
312 uint16_t digit; GenerateCountedDigits() local
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Ddouble-conversion-bignum-dtoa.cpp197 // If 1 <= (numerator+delta_plus) / denominator < 10 then no leading 0 digit
210 uint16_t digit; in GenerateShortestDigits() local
211 digit = numerator->DivideModuloIntBignum(*denominator); in GenerateShortestDigits()
212 DOUBLE_CONVERSION_ASSERT(digit <= 9); // digit is a uint16_t and therefore always positive. in GenerateShortestDigits()
213 // digit = numerator / denominator (integer division). in GenerateShortestDigits()
215 buffer[(*length)++] = static_cast<char>(digit + '0'); in GenerateShortestDigits()
248 // If yes, then the next digit would be < 5 and we can round down. in GenerateShortestDigits()
254 // Note that the last digit could not be a '9' as otherwise the whole in GenerateShortestDigits()
279 // Note again that the last digit coul in GenerateShortestDigits()
302 uint16_t digit; GenerateCountedDigits() local
312 uint16_t digit; GenerateCountedDigits() local
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Ddouble-conversion-bignum-dtoa.cpp197 // If 1 <= (numerator+delta_plus) / denominator < 10 then no leading 0 digit
210 uint16_t digit; in GenerateShortestDigits() local
211 digit = numerator->DivideModuloIntBignum(*denominator); in GenerateShortestDigits()
212 DOUBLE_CONVERSION_ASSERT(digit <= 9); // digit is a uint16_t and therefore always positive. in GenerateShortestDigits()
213 // digit = numerator / denominator (integer division). in GenerateShortestDigits()
215 buffer[(*length)++] = static_cast<char>(digit + '0'); in GenerateShortestDigits()
248 // If yes, then the next digit would be < 5 and we can round down. in GenerateShortestDigits()
254 // Note that the last digit could not be a '9' as otherwise the whole in GenerateShortestDigits()
279 // Note again that the last digit coul in GenerateShortestDigits()
302 uint16_t digit; GenerateCountedDigits() local
312 uint16_t digit; GenerateCountedDigits() local
[all...]
/third_party/python/Objects/
H A Dlongobject.c81 * being an internal Python int digit, in base BASE).
111 * multiple of a long digit's max bit length (15 or 30 so far).
142 ((PY_SSIZE_T_MAX - offsetof(PyLongObject, ob_digit))/sizeof(digit))
153 /* Fast operations for single digit integers (including zero) in _PyLong_New()
154 * assume that there is always at least one digit present. */ in _PyLong_New()
157 sizeof(digit)*size. Previous incarnations of this code used in _PyLong_New()
162 ndigits*sizeof(digit)); in _PyLong_New()
209 digit abs_x = x < 0 ? -x : x; in _PyLong_FromMedium()
242 digit *p = v->ob_digit; in _PyLong_FromLarge()
247 t & PyLong_MASK, twodigits, digit); in _PyLong_FromLarge()
[all...]
/third_party/icu/icu4c/source/common/
H A Dustrfmt.cpp34 int digit; in uprv_itou() local
39 digit = (int)(i % radix); in uprv_itou()
40 buffer[length++]=(UChar)(digit<=9?(0x0030+digit):(0x0030+digit+7)); in uprv_itou()
H A Dpunycode.cpp95 digitToBasic(int32_t digit, UBool uppercase) { in digitToBasic() argument
98 if(digit<26) { in digitToBasic()
100 return (char)(_CAPITAL_A+digit); in digitToBasic()
102 return (char)(_SMALL_A+digit); in digitToBasic()
105 return (char)((_ZERO_-26)+digit); in digitToBasic()
378 int32_t n, destLength, i, bias, basicLength, j, in, oldi, w, k, digit, t, in u_strFromPunycode() local
459 digit=decodeDigit(src[in++]); in u_strFromPunycode()
460 if(digit<0) { in u_strFromPunycode()
464 if(digit>(0x7fffffff-i)/w) { in u_strFromPunycode()
470 i+=digit* in u_strFromPunycode()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dustrfmt.cpp34 int digit; in uprv_itou() local
39 digit = (int)(i % radix); in uprv_itou()
40 buffer[length++]=(char16_t)(digit<=9?(0x0030+digit):(0x0030+digit+7)); in uprv_itou()
/third_party/skia/third_party/externals/icu/source/common/
H A Dustrfmt.cpp34 int digit; in uprv_itou() local
39 digit = (int)(i % radix); in uprv_itou()
40 buffer[length++]=(UChar)(digit<=9?(0x0030+digit):(0x0030+digit+7)); in uprv_itou()
/third_party/backends/sanei/
H A Dsanei_codec_ascii.c71 unsigned digit; in get_digit() local
74 digit = tolower(*w->buffer.curr++) - '0'; in get_digit()
75 if (digit > 9) in get_digit()
76 digit -= 'a' - ('9' + 1); in get_digit()
77 if (digit > 0xf) in get_digit()
82 return digit; in get_digit()
/third_party/node/deps/v8/src/base/
H A Dvlq-base64.cc40 int32_t digit; in VLQBase64Decode() local
46 digit = static_cast<int>(charToDigitDecode(start[*pos])); in VLQBase64Decode()
48 if (digit == -1 || (is_last_byte && (digit >> 2) != 0)) { in VLQBase64Decode()
51 res += (digit & kDataMask) << shift; in VLQBase64Decode()
54 } while (digit & kContinueMask); in VLQBase64Decode()
/third_party/node/deps/v8/src/base/numbers/
H A Dbignum-dtoa.cc133 // If 1 <= (numerator+delta_plus) / denominator < 10 then no leading 0 digit
146 uint16_t digit; in GenerateShortestDigits() local
147 digit = numerator->DivideModuloIntBignum(*denominator); in GenerateShortestDigits()
148 DCHECK_LE(digit, 9); // digit is a uint16_t and therefore always positive. in GenerateShortestDigits()
149 // digit = numerator / denominator (integer division). in GenerateShortestDigits()
151 buffer[(*length)++] = digit + '0'; in GenerateShortestDigits()
184 // If yes, then the next digit would be < 5 and we can round down. in GenerateShortestDigits()
190 // Note that the last digit could not be a '9' as otherwise the whole in GenerateShortestDigits()
215 // Note again that the last digit coul in GenerateShortestDigits()
237 uint16_t digit; GenerateCountedDigits() local
247 uint16_t digit; GenerateCountedDigits() local
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DDigitSequence.java25 * A small, fast, immutable representation of a phone number digit sequence. This class represents
54 /** The maximum number of digits which can be held in a digit sequence. */
67 // A table of adjustment values to convert a digit sequence into an absolute index in the
68 // integer domain, to impose a true lexicographical ordering. The value of a digit sequence is
71 // an absolute ordering of all digit sequences. For example the digit sequence "0123" is length
103 * Returns the domain in which phone number digit sequences exist. This is needed when creating
104 * canonical {@link com.google.common.collect.Range Ranges} of digit-sequences.
155 /** Returns the digit sequence of length one representing the given digit valu
156 singleton(int digit) singleton() argument
254 extendBy(int digit) extendBy() argument
[all...]

Completed in 17 milliseconds

12345678910>>...13