/external/webkit/Source/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...] |
/external/chromium/third_party/libjingle/source/talk/base/ |
urlencode.cc | 112 static const char *digits = "0123456789ABCDEF"; local 129 *dest++ = digits[(ch >> 4) & 0x0F]; 130 *dest++ = digits[ ch & 0x0F];
|
/external/icu4c/tools/genrb/ |
rbutil.c | 68 const char digits[16] = {'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'}; local 83 buffer[length++]= digits[digit];
|
/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) {
|
ns_name.c | 56 static const char digits[] = "0123456789"; variable 167 *dn++ = digits[c / 100]; 168 *dn++ = digits[(c % 100) / 10]; 169 *dn++ = digits[c % 10]; 240 else if ((cp = strchr(digits, c)) != NULL) { 241 n = (cp - digits) * 100; 243 (cp = strchr(digits, c)) == NULL) { 247 n += (cp - digits) * 10; 249 (cp = strchr(digits, c)) == NULL) { 253 n += (cp - digits); [all...] |
/external/tcpdump/missing/ |
inet_ntop.c | 66 const char digits[] = "0123456789"; local 81 *dst++ = digits[n / 100]; 86 *dst++ = digits[n / 10]; 90 *dst++ = digits[n];
|
/external/icu4c/i18n/ |
decNumber.h | 57 #define DECDPUN 1 /* DECimal Digits Per UNit [must be >0 */ 60 /* DECNUMDIGITS is the default number of digits that can be held in */ 69 /* number of digits it will hold. */ 82 int32_t digits; /* Count of digits in the coefficient; >0 */ member in struct:__anon6254 91 /* 1. If digits is > DECDPUN then there will one or more */ 93 /* These contain the remaining (more significant) digits of the */ 100 /* contains DECDPUN digits (e.g., a value in the range 0 through */ 103 /* 2. A decNumber converted to a string may need up to digits+14 */ 192 && (dn)->digits==1 [all...] |
digitlst.h | 36 // Decimal digits in a 64-bit int 92 * precision to represent all digits of a long. 95 * which are the digits radix 10, from '0' to '9'. It also has a radix 98 * derived by placing all the digits of the list to the right of the 105 * DigitList stores digits with the most significant first. 106 * decNumber stores digits with the least significant first. 116 * digitList, digits are platform invariant chars, '0' - '9' 117 * decNumber, digits are binary, one per byte, 0 - 9. 119 * (decNumber library is configurable in how digits are stored, ICU has configured 154 * Clears out the digits 296 int32_t digits() const {return fDecNumber->digits;}; function in class:DigitList [all...] |
/external/libxslt/libxslt/ |
extra.c | 175 char digits[5]; local 202 memset(digits, 0, sizeof(digits)); 203 strncpy(digits, str+7, 4); 204 field = strtol(digits, NULL, 10); 207 memset(digits, 0, sizeof(digits)); 208 strncpy(digits, str+12, 2); 209 field = strtol(digits, NULL, 10); 212 memset(digits, 0, sizeof(digits)) [all...] |
/external/markdown/markdown/extensions/ |
headerid.py | 71 from string import ascii_lowercase, digits, punctuation namespace 73 ID_CHARS = ascii_lowercase + digits + '-_'
|
/external/stlport/test/unit/ |
num_facets_test.cpp | 59 string digits = "7"; local 60 complete_digits(digits); 61 ref += digits; 69 digits = "9"; 70 complete_digits(digits); 71 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits ); 86 digits = "7"; 87 complete_digits(digits); 88 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
|
money_facets_test.cpp | 173 string digits; local 178 fmg.get(istr, istreambuf_iterator<char, char_traits<char> >(), true, ostr, err, digits); 180 CPPUNIT_ASSERT( digits == "123456" ); 275 // Test for bug in case when number of digits in value less then number 276 // of digits in fraction. I.e. '9' should be printed as '0.09',
|
num_put_get_test.cpp | 400 string output, digits; local 407 digits = "17"; 408 complete_digits(digits); 409 CPPUNIT_CHECK(output == string("1.23457e+") + digits ); 463 digits = "1"; 464 complete_digits(digits); 465 CPPUNIT_CHECK(output == string("1.23456780e-") + digits ); 1153 // we may loss some digits here, but not more than mantissa: [all...] |
/external/webkit/Source/JavaScriptCore/runtime/ |
NumberPrototype.cpp | 194 // demands a minimum of (exponent + 1) digits to represent a number, for example 195 // 1234 (1.234e+3) requires 4 digits. (See ECMA-262 15.7.4.7.10.c) 222 static const char* const digits = "0123456789abcdefghijklmnopqrstuvwxyz"; local 230 return JSValue::encode(globalData->smallStrings.singleCharacterString(globalData, digits[x])); 259 *--p = digits[remainderDigit]; 277 *p++ = digits[digit];
|
/ndk/tests/device/test-gnustl-full/unit/ |
num_facets_test.cpp | 59 string digits = "7"; local 60 complete_digits(digits); 61 ref += digits; 69 digits = "9"; 70 complete_digits(digits); 71 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits ); 86 digits = "7"; 87 complete_digits(digits); 88 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
|
/ndk/tests/device/test-stlport/unit/ |
num_facets_test.cpp | 59 string digits = "7"; local 60 complete_digits(digits); 61 ref += digits; 69 digits = "9"; 70 complete_digits(digits); 71 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits ); 86 digits = "7"; 87 complete_digits(digits); 88 CPPUNIT_ASSERT( fostr.str() == string("1e+") + digits );
|
/libcore/luni/src/main/java/java/io/ |
StreamTokenizer.java | 309 * Check for digits before checking for words since digits can be 313 StringBuilder digits = new StringBuilder(20); local 319 digits.append((char) currentChar); 327 if (checkJustNegative && digits.length() == 1) { 328 // Didn't get any other digits other than '-' 332 nval = Double.valueOf(digits.toString()).doubleValue();
|
/external/jhead/ |
gpsinfo.c | 212 int den, digits; local 215 digits = 0; 216 while (den > 1 && digits <= 6){ 218 digits += 1; 220 if (digits > 6) digits = 6; 221 FmtString[1+a*7] = (char)('2'+digits+(digits ? 1 : 0)); 222 FmtString[3+a*7] = (char)('0'+digits);
|
/external/v8/src/ |
bignum.cc | 83 // Clear the excess digits (if there were any). 112 uint64_t digits = ReadUInt64(value, pos, kMaxUint64DecimalDigits); local 116 AddUInt64(digits); 118 uint64_t digits = ReadUInt64(value, pos, length); local 120 AddUInt64(digits); 356 // In the worst case we have to accumulate nb-digits products of digit*digit. 364 // First shift the digits so we don't overwrite them. 494 // Easy case: if we have less digits than the divisor than the result is 0. 505 // number of digits. 520 // Since other has more than 0 digits we know that the access t [all...] |
scanner-base.cc | 48 uc32 digits[4]; local 51 digits[i] = c0_; 58 // Push back digits read, except the last one (in c0_). 60 PushBack(digits[j]); 597 // Parse decimal digits and allow trailing fractional part. 726 // only "safe" characters are allowed (letters, digits, underscore),
|
/libcore/luni/src/main/java/java/lang/ |
IntegralToString.java | 102 * The digits for every supported radix. 104 private static final char[] DIGITS = { 151 buf[--cursor] = DIGITS[radix * q - i]; 219 // Calculate digits two-at-a-time till remaining digits fit in 16 bits 229 // Calculate remaining digits one-at-a-time for performance 234 buf[--cursor] = DIGITS[r]; 285 buf[--cursor] = DIGITS[(int) (radix * q - v)]; 337 int low = (int) (n % 1000000000); // Extract low-order 9 digits 340 // Zero-pad Low order part to 9 digits 458 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local 465 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local 473 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local 488 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local [all...] |
/external/bluetooth/glib/glib/gnulib/ |
vasnprintf.c | 95 const char *digits; local 115 digits = lower; 120 digits = lower; 125 digits = upper; 130 digits = lower; 142 *pointer-- = digits[number % base]; 210 EMIT(digits[16]);
|
/external/chromium/googleurl/src/ |
url_parse.cc | 444 // we copy the digits to a small stack buffer (since we know the maximum number 445 // of digits in a valid port number) that we can NULL terminate. 462 return 0; // All digits were 0. 464 // Verify we don't have too many digits (we'll be copying to our buffer so 469 // Copy valid digits to the buffer. 470 char digits[kMaxDigits + 1]; // +1 for null terminator local 477 digits[i] = static_cast<char>(ch); 481 // only digits, atoi's lack of error handling is OK. 482 digits[digits_comp.len] = 0; 483 int port = atoi(digits); [all...] |
/external/opencv/cxcore/src/ |
cxdxt.cpp | 223 int digits[34], radix[34]; local 261 digits[nf] = 0; 264 digits[i] = 0; 307 digits[1]++; 318 for( k = 1; ++digits[k] >= factors[k]; k++ ) 320 digits[k] = 0; 334 for( k = 0; ++digits[k] >= factors[k]; k++ ) 336 digits[k] = 0; [all...] |
/external/opencv/otherlibs/highgui/ |
grfmt_pxm.cpp | 87 int digits = 0; local 115 if( ++digits >= maxdigits ) break;
|