/macosx-10.10.1/Libc-1044.1.2/stdlib/OpenBSD/ |
H A D | gcvt.c | 34 char *digits, *dst, *src; local 44 digits = __dtoa(value, 2, ndigit, &decpt, &sign, NULL); 45 if (digits == NULL) 53 *digits == 'I' ? "inf" : "nan"); 54 __freedtoa(digits); 69 src = digits; 95 for (i = 0, src = digits; i < decpt; i++) { 102 if (src == digits) 105 for (i = decpt; digits[i] != '\0'; i++) { 106 *dst++ = digits[ [all...] |
/macosx-10.10.1/ruby-106/ruby/test/bigdecimal/ |
H A D | test_bigdecimal_util.rb | 23 digits = 5 24 delta = 1.0/10**(digits) 25 assert_in_delta(BigDecimal(0.5, 5), 0.5.to_d(digits), delta) 26 assert_in_delta(BigDecimal(355.0/113.0, 5), (355.0/113.0).to_d(digits), delta) 30 digits = 100 31 delta = 1.0/10**(digits) 32 assert_in_delta(BigDecimal(1.quo(2), digits), 1.quo(2).to_d(digits), delta) 33 assert_in_delta(BigDecimal(355.quo(113), digits), 355.quo(113).to_d(digits), delt [all...] |
/macosx-10.10.1/JavaScriptCore-7600.1.17/tests/mozilla/js1_2/regexp/ |
H A D | 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 [all...] |
/macosx-10.10.1/ntp-92/libntp/ |
H A D | hextolfp.c | 22 static const char *digits = "0123456789abcdefABCDEF"; local 37 (ind = strchr(digits, *cp)) != NULL) { 39 dec_i += ((ind - digits) > 15) ? (ind - digits) - 6 40 : (ind - digits); 51 (ind = strchr(digits, *cp)) != NULL) { 53 dec_f += ((ind - digits) > 15) ? (ind - digits) - 6 54 : (ind - digits);
|
H A D | atolfp.c | 40 static const char *digits = "0123456789"; local 52 * [spaces][-|+][digits][.][digits][spaces|\n|\0] 68 while (*cp != '\0' && (ind = strchr(digits, *cp)) != NULL) { 70 dec_i += (ind - digits); 79 && (ind = strchr(digits, *cp)) != NULL) { 82 dec_f += (ind - digits);
|
/macosx-10.10.1/file_cmds-242/csh/ |
H A D | strpct.c | 43 * "digits" is the number of digits past the decimal place you want 57 strpct(numerator, denominator, digits) 59 u_int digits; 67 for(i = 0; i < digits; i++) { 84 if (digits == 0) { 90 (void) snprintf(fmt, sizeof(fmt), "%%lu.%%0%ulu%%%%", digits);
|
/macosx-10.10.1/bind9-45.101/bind9/contrib/idn/idnkit-1.0-src/wsock/common/ |
H A D | dump.c | 61 char digits[8]; local 63 sprintf(digits, "%d", (addr[i] & 0xff)); 65 strcat(digits, "."); 67 if (strlen(digits) >= size) { 70 strcpy(p, digits); 71 p += strlen(digits); 72 size -= strlen(digits);
|
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | bn_mp_rand.c | 20 mp_rand (mp_int * a, int digits) argument 26 if (digits <= 0) { 39 while (--digits > 0) {
|
/macosx-10.10.1/libxslt-13/libxslt/libxslt/ |
H A D | 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, [all...] |
/macosx-10.10.1/bc-21/bc/Examples/ |
H A D | pi.b | 2 This is a program to determine the distribution of digits in the 3 fraction part of PI. It will look at the first scale digits. 5 The results are left in the global variable digits. 6 digits[0] is the number of 0's in PI. 16 print "\n\nCalculating PI to ",scale," digits. Please wait . . ."; 21 print "\nCounting digits. . ."; 22 for (ix = 0; ix < 10; ix++) digits[ix] = 0; 38 digits[one_digit] += 1; 46 print "PI to ", scale, " digits is:\n", pi/1, "\n\n" 47 print "The frequency of the digits ar [all...] |
/macosx-10.10.1/msdosfs-209.1.1/ |
H A D | HexDump.py | 3 digits = "0123456789ABCDEF" 4 return digits[byte >> 4] + digits[byte & 0x0F]
|
/macosx-10.10.1/ksh-23/ksh/src/lib/libast/sfio/ |
H A D | sfstrtof.h | 153 int digits; member in struct:S2F_part_s 205 register int digits; local 245 digits = 0; 263 digits++; 270 fraction = digits; 310 m -= 4 * (digits - fraction); 340 digits++; 398 digits++; 404 parts[part].digits = digits; [all...] |
/macosx-10.10.1/groff-38/groff/src/libs/libgroff/ |
H A D | strtol.c | 55 static char digits[] = "0123456789abcdefghijklmnopqrstuvwxyz"; local 81 p = strchr(digits, (ISASCII((unsigned char)*str) 85 if (p == 0 || (val = (p - digits)) >= base) { 103 p = strchr(digits, (ISASCII((unsigned char)*str) 108 n = p - digits;
|
/macosx-10.10.1/Libc-1044.1.2/net/FreeBSD/ |
H A D | inet_net_pton.c | 70 static const char digits[] = "0123456789"; local 109 n = strchr(digits, ch) - digits; 138 n = strchr(digits, ch) - digits; 197 static const char digits[] = "0123456789"; local 207 pch = strchr(digits, ch); 212 val += (pch - digits); 227 static const char digits[] = "0123456789"; local 238 pch = strchr(digits, c 276 int digits; local [all...] |
/macosx-10.10.1/ICU-531.30/icuSources/i18n/ |
H A D | digitlst.cpp | 50 * This is the zero digit. The base for the digits returned by getDigit() 71 fContext.digits = fStorage.getCapacity(); 108 // Always reset the fContext.digits, even if fDecNumber was not reallocated, 110 fContext.digits = fStorage.getCapacity(); 142 c.digits = 1; 158 int32_t savedDigits = fContext.digits; 159 fContext.digits = 1; 161 fContext.digits = savedDigits; 175 // Reduce - remove trailing zero digits. 183 // trim - remove trailing fraction zero digits [all...] |
H A D | decNumber.c | 60 /* precision (up to 999,999,999 digits) and arbitrary exponent */ 64 /* tightly: digits, emax, and -emin in the context must be <= */ 69 /* be finite, positive, have an exponent of zero, and all digits */ 70 /* must be either 0 or 1. The result will only contain digits */ 150 /* 6. The digits count is allowed to rise to a multiple of DECDPUN */ 152 /* accounting of digits is not needed. The correct digits value */ 154 /* This must be called before any rounding if the number of digits */ 158 /* numbers up to four digits, using appropriate constants. This */ 216 /* round-for-reround digits */ 6727 decShiftToMost(Unit *uar, Int digits, Int shift) argument 7812 Int digits=(len-1)*DECDPUN+1; /* possible digits excluding msu */ local 8002 Int ae, d, digits; /* .. */ local [all...] |
/macosx-10.10.1/libresolv-57/ |
H A D | ns_ttl.c | 105 int ch, digits, dirty; local 109 digits = 0; 117 digits++; 120 if (digits == 0) 134 digits = 0; 137 if (digits > 0) {
|
/macosx-10.10.1/Heimdal-398.1.2/lib/roken/ |
H A D | inet_ntop.c | 45 const char digits[] = "0123456789"; local 60 *dst++ = digits[n / 100]; 65 *dst++ = digits[n / 10]; 69 *dst++ = digits[n];
|
/macosx-10.10.1/ICU-531.30/icuSources/samples/datefmt/ |
H A D | util.cpp | 22 int8_t digits, 25 while (digits > 0) { 26 target += DIGIT_STRING[(number >> ((--digits) * 4)) & 0xF]; 21 appendHex(uint32_t number, int8_t digits, UnicodeString& target) argument
|
/macosx-10.10.1/ICU-531.30/icuSources/samples/msgfmt/ |
H A D | util.cpp | 22 int8_t digits, 25 while (digits > 0) { 26 target += DIGIT_STRING[(number >> ((--digits) * 4)) & 0xF]; 21 appendHex(uint32_t number, int8_t digits, UnicodeString& target) argument
|
/macosx-10.10.1/ICU-531.30/icuSources/samples/translit/ |
H A D | util.cpp | 22 int8_t digits, 25 while (digits > 0) { 26 target += DIGIT_STRING[(number >> ((--digits) * 4)) & 0xF]; 21 appendHex(uint32_t number, int8_t digits, UnicodeString& target) argument
|
/macosx-10.10.1/shell_cmds-179/hexdump/ |
H A D | odsyntax.c | 322 int digits; local 350 digits = FLT_DIG; 353 digits = DBL_DIG; 357 digits = LDBL_DIG; 364 16UL / (u_long)isize, (u_long)isize, digits + 8, digits); 378 int digits; local 414 * Calculate the maximum number of digits we need to 420 digits = 0; 422 digits [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/ |
H A D | feeRandom.c | 69 int digits = bits / GIANT_BITS_PER_DIGIT; local 71 for(j = (digits-1); j >= 0; j--) { 81 int digits = RAND_GIANT_DIGITS * 4; local 87 rinst->SEED = newGiant(digits); 88 rinst->C = newGiant(digits); 89 rinst->A = newGiant(digits); 90 rinst->x = newGiant(digits);
|
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/lib/ |
H A D | feeRandom.c | 69 int digits = bits / GIANT_BITS_PER_DIGIT; local 71 for(j = (digits-1); j >= 0; j--) { 81 int digits = RAND_GIANT_DIGITS * 4; local 87 rinst->SEED = newGiant(digits); 88 rinst->C = newGiant(digits); 89 rinst->A = newGiant(digits); 90 rinst->x = newGiant(digits);
|
/macosx-10.10.1/ruby-106/ruby/test/ruby/ |
H A D | test_sprintf_comb.rb | 172 digits = [] 176 digits << (abs % radix) 182 digits.map! {|d| radix-1 - d } 184 digits.each_index {|i| 185 digits[i] += carry 187 if radix <= digits[i] 188 digits[i] -= radix 192 if digits.last != radix-1 193 digits << (radix-1) 207 dlen = digits [all...] |