| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| stringold.py | 16 digits -- a string containing all characters considered decimal digits
17 hexdigits -- a string containing all characters considered hexadecimal digits
18 octdigits -- a string containing all characters considered octal digits
30 digits = '0123456789' variable
31 hexdigits = digits + 'abcdef' + 'ABCDEF'
215 or more digits, possibly preceded by a sign. If base is 0, it
242 of one or more digits, possibly preceded by a sign. If base
|
| /bionic/libc/dns/nameser/ |
| ns_name.c | 51 static const char digits[] = "0123456789"; variable
162 *dn++ = digits[c / 100];
163 *dn++ = digits[(c % 100) / 10];
164 *dn++ = digits[c % 10];
254 else if ((cp = strchr(digits, c)) != NULL) {
255 n = (int)(cp - digits) * 100;
257 (cp = strchr(digits, c)) == NULL) {
261 n += (int)(cp - digits) * 10;
263 (cp = strchr(digits, c)) == NULL) {
267 n += (int)(cp - digits);
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| string.py | 14 digits -- a string containing all characters considered decimal digits
15 hexdigits -- a string containing all characters considered hexadecimal digits
16 octdigits -- a string containing all characters considered octal digits
30 digits = '0123456789'
variable
31 hexdigits = digits + 'abcdef' + 'ABCDEF'
34 printable = digits + letters + punctuation + whitespace
399 or more digits, possibly preceded by a sign. If base is 0, it
414 of one or more digits, possibly preceded by a sign. If base
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/ |
| codecs.c | 610 int digits;
local
624 digits = 1;
628 digits = 2;
632 digits = 3;
636 digits = 4;
640 digits = 5;
644 digits = 6;
648 digits = 7;
651 while (digits-->0) {
|
| pystrtod.c | 406 The exponent always contains at least two digits, and only as many more digits
440 /* If there are 2 exactly digits, we're done,
446 /* There are more than 2 digits in the exponent. See
464 /* If there are fewer than 2 digits, add zeros
478 remove the decimal point if all digits following it are zero. The numeric
497 /* scan any digits after the point */
523 adding a '.0' would produce too many significant digits (see issue 5864).
564 significant digits as were requested. Switch to
702 MIN_EXPONENT_DIGITS digits, providing the buffer is large enough
945 char *digits, *digits_end; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| string.py | 14 digits -- a string containing all characters considered decimal digits
15 hexdigits -- a string containing all characters considered hexadecimal digits
16 octdigits -- a string containing all characters considered octal digits
30 digits = '0123456789'
variable
31 hexdigits = digits + 'abcdef' + 'ABCDEF'
34 printable = digits + letters + punctuation + whitespace
397 or more digits, possibly preceded by a sign. If base is 0, it
412 of one or more digits, possibly preceded by a sign. If base
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/ |
| codecs.c | 599 int digits;
local
604 digits = 1;
608 digits = 2;
612 digits = 3;
616 digits = 4;
621 digits = 5;
626 digits = 5;
630 digits = 6;
634 digits = 7;
638 while (digits-->0) {
[all...] |
| pystrtod.c | 406 The exponent always contains at least two digits, and only as many more digits
440 /* If there are 2 exactly digits, we're done,
446 /* There are more than 2 digits in the exponent. See
464 /* If there are fewer than 2 digits, add zeros
478 remove the decimal point if all digits following it are zero. The numeric
497 /* scan any digits after the point */
523 adding a '.0' would produce too many significant digits (see issue 5864).
564 significant digits as were requested. Switch to
702 MIN_EXPONENT_DIGITS digits, providing the buffer is large enough
945 char *digits, *digits_end; local
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| WNafUtil.java | 126 int digits = Math.max(g.bitLength(), h.bitLength()) + 1; local
127 byte[] jsf = new byte[digits];
194 int digits = _3k.bitLength() - 1; local
195 byte[] naf = new byte[digits];
199 for (int i = 1; i < digits; ++i)
208 naf[digits - 1] = 1;
217 * <code>w</code> consecutive digits in the resulting representation, at
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| DigitList_Android.java | 35 * characters, which are the digits radix 10, from '0' to '9'. It also has a
38 * <em>f</em>, where 0 <= <em>f</em> < 1, derived by placing all the digits of
53 * The maximum number of significant digits in an IEEE 754 double, that
54 * is, in a Java double. This must not be increased, or garbage digits
64 * digits[decimalAt]. If decimalAt is < 0, then leading zeros between
66 * is > count, then trailing zeros between the digits[count-1] and the
70 * f is a value 0.1 <= f < 1 arrived at by placing the digits in Digits to
76 * digits present in digits[]
83 public byte[] digits = new byte[MAX_LONG_DIGITS]; field in class:DigitList_Android
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| VersionInfo.java | 332 // preserve only digits, separated by single '.'
606 * @param minDigits Minimum number of version digits
607 * @param maxDigits Maximum number of version digits
620 int[] digits = new int[4]; local
621 digits[0] = getMajor();
622 digits[1] = getMinor();
623 digits[2] = getMilli();
624 digits[3] = getMicro();
628 if (digits[numDigits - 1] != 0) {
635 verStr.append(digits[0])
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationiterator.cpp | 688 // Collect digits.
689 CharString digits; local
693 digits.append(digit, errorCode);
710 digits.append(digit, errorCode);
723 char *p = digits.data();
724 char *q = p + digits.length() - 1;
735 while(pos < (digits.length() - 1) && digits[pos] == 0) { ++pos; }
736 // Write a sequence of CEs for at most 254 digits at a time.
737 int32_t segmentLength = digits.length() - pos
[all...] |
| decimfmtimpl.cpp | 280 DigitList digits; local
281 digits.set(number);
282 digits.mult(fMultiplier, status);
283 digits.shiftDecimalRight(fScale);
284 formatAdjustedDigitList(digits, appendTo, handler, status);
288 DigitList digits; local
289 digits.set(number);
290 digits.shiftDecimalRight(fScale);
291 formatAdjustedDigitList(digits, appendTo, handler, status);
303 DigitList digits; local
311 DigitList digits; local
348 VisibleDigitsWithExponent digits; local
360 VisibleDigitsWithExponent digits; local
482 VisibleDigitsWithExponent digits; local
538 VisibleDigits digits; local
549 VisibleDigits digits; local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| DigitList_Android.java | 34 * characters, which are the digits radix 10, from '0' to '9'. It also has a
37 * <em>f</em>, where 0 <= <em>f</em> < 1, derived by placing all the digits of
51 * The maximum number of significant digits in an IEEE 754 double, that
52 * is, in a Java double. This must not be increased, or garbage digits
62 * digits[decimalAt]. If decimalAt is < 0, then leading zeros between
64 * is > count, then trailing zeros between the digits[count-1] and the
68 * f is a value 0.1 <= f < 1 arrived at by placing the digits in Digits to
74 * digits present in digits[]
81 public byte[] digits = new byte[MAX_LONG_DIGITS]; field in class:DigitList_Android
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| VersionInfo.java | 364 // preserve only digits, separated by single '.'
646 * @param minDigits Minimum number of version digits
647 * @param maxDigits Maximum number of version digits
659 int[] digits = new int[4]; local
660 digits[0] = getMajor();
661 digits[1] = getMinor();
662 digits[2] = getMilli();
663 digits[3] = getMicro();
667 if (digits[numDigits - 1] != 0) {
674 verStr.append(digits[0])
[all...] |
| /external/mksh/src/ |
| shf.c | 975 const char *digits = (flags & FL_UPPER) ? local
978 *--cp = digits[lnum & 0xF];
|
| /external/protobuf/src/google/protobuf/stubs/ |
| strutil.h | 60 // Like above, but only accepts digits.
273 // arbitrary number of hex digits, but all of them together must
278 // hex digits, upper or lower case) or \Uhhhhhhhh (exactly eight
279 // hex digits, upper or lower case) to specify a Unicode code
615 char digits[kFastToBufferSize]; member in struct:google::protobuf::strings::AlphaNum
621 : piece_data_(digits),
622 piece_size_(FastInt32ToBufferLeft(i32, digits) - &digits[0]) {}
624 : piece_data_(digits),
625 piece_size_(FastUInt32ToBufferLeft(u32, digits) - &digits[0]) {
[all...] |
| /external/python/cpython2/Lib/ |
| string.py | 14 digits -- a string containing all characters considered decimal digits
15 hexdigits -- a string containing all characters considered hexadecimal digits
16 octdigits -- a string containing all characters considered octal digits
30 digits = '0123456789' variable
31 hexdigits = digits + 'abcdef' + 'ABCDEF'
34 printable = digits + letters + punctuation + whitespace
399 or more digits, possibly preceded by a sign. If base is 0, it
414 of one or more digits, possibly preceded by a sign. If base
|
| /external/python/cpython2/Python/ |
| codecs.c | 766 int digits; local
780 digits = 1;
784 digits = 2;
788 digits = 3;
792 digits = 4;
796 digits = 5;
800 digits = 6;
804 digits = 7;
807 while (digits-->0) {
|
| pystrtod.c | 406 The exponent always contains at least two digits, and only as many more digits
440 /* If there are 2 exactly digits, we're done,
446 /* There are more than 2 digits in the exponent. See
464 /* If there are fewer than 2 digits, add zeros
478 remove the decimal point if all digits following it are zero. The numeric
497 /* scan any digits after the point */
523 adding a '.0' would produce too many significant digits (see issue 5864).
564 significant digits as were requested. Switch to
702 MIN_EXPONENT_DIGITS digits, providing the buffer is large enoug
945 char *digits, *digits_end; local
[all...] |
| /external/python/cpython3/Python/ |
| pystrtod.c | 404 /* Underscores are only allowed after digits. */
411 /* Underscores are only allowed before digits. */
475 The exponent always contains at least two digits, and only as many more digits
509 /* If there are 2 exactly digits, we're done,
515 /* There are more than 2 digits in the exponent. See
533 /* If there are fewer than 2 digits, add zeros
547 remove the decimal point if all digits following it are zero. The numeric
566 /* scan any digits after the point */
592 adding a '.0' would produce too many significant digits (see issue 5864)
1000 char *digits, *digits_end; local
[all...] |
| /external/v8/src/ |
| i18n.cc | 199 // same digits as NumberFormat/Calendar would.
319 int32_t digits; local
321 isolate, options, "minimumIntegerDigits", &digits)) {
322 number_format->setMinimumIntegerDigits(digits);
326 isolate, options, "minimumFractionDigits", &digits)) {
327 number_format->setMinimumFractionDigits(digits);
331 isolate, options, "maximumFractionDigits", &digits)) {
332 number_format->setMaximumFractionDigits(digits);
337 isolate, options, "minimumSignificantDigits", &digits)) {
338 number_format->setMinimumSignificantDigits(digits);
[all...] |
| json-parser.cc | 535 int digits = 0; local
539 digits++;
542 if (c0_ != '.' && c0_ != 'e' && c0_ != 'E' && digits < 10) {
|
| /external/valgrind/coregrind/ |
| m_debuglog.c | 766 const HChar* digits = capitalised ? "0123456789ABCDEF" : "0123456789abcdef"; local
787 buf[ind++] = digits[p % base];
1053 /* Silently limit the precision to 10 digits. */
[all...] |
| /external/valgrind/exp-sgcheck/tests/ |
| bad_percentify.c | 277 HChar* digits = capitalised ? "0123456789ABCDEF" : "0123456789abcdef"; local
298 buf[ind++] = digits[p % base];
|
