/external/python/cpython2/Lib/ |
D | fpformat.py | 65 def roundfrac(intpart, fraction, digs): argument 68 if f <= digs: 69 return intpart, fraction + '0'*(digs-f) 71 if i+digs < 0: 72 return '0'*-digs, '' 74 nextdigit = total[i+digs] 76 n = i + digs - 1 86 if digs >= 0: 87 return intpart, fraction[:digs] 89 return intpart[:digs] + '0'*-digs, '' [all …]
|
/external/python/cpython2/Doc/library/ |
D | fpformat.rst | 26 .. function:: fix(x, digs) 28 Format *x* as ``[-]ddd.ddd`` with *digs* digits after the point and at least one 29 digit before. If ``digs <= 0``, the decimal point is suppressed. 31 *x* can be either a number or a string that looks like one. *digs* is an 37 .. function:: sci(x, digs) 39 Format *x* as ``[-]d.dddE[+-]ddd`` with *digs* digits after the point and 40 exactly one digit before. If ``digs <= 0``, one digit is kept and the point is 43 *x* can be either a real number, or a string that looks like one. *digs* is an
|
/external/python/cpython2/Lib/test/ |
D | test_fpformat.py | 73 digs = 5 # irrelevant 76 self.assertEqual(fpformat.fix(attack, digs), attack) 79 fpformat.sci(attack, digs)
|
/external/wpa_supplicant_8/src/tls/ |
D | libtommath.c | 141 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs); 143 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs); 146 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs); 518 int digs = a->used + b->used + 1; in mp_mul() local 520 if ((digs < MP_WARRAY) && in mp_mul() 523 res = fast_s_mp_mul_digs (a, b, c, digs); in mp_mul() 2341 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in s_mp_mul_digs() argument 2351 if (((digs) < MP_WARRAY) && in s_mp_mul_digs() 2354 return fast_s_mp_mul_digs (a, b, c, digs); in s_mp_mul_digs() 2358 if ((res = mp_init_size (&t, digs)) != MP_OKAY) { in s_mp_mul_digs() [all …]
|
/external/bc/src/ |
D | num.c | 774 BcDig *digs, *dig_ptr; in bc_num_k() local 799 digs = dig_ptr = bc_vm_malloc(BC_NUM_SIZE(total)); in bc_num_k() 872 free(digs); in bc_num_k() 1568 size_t i, digs, len = strlen(val); in bc_num_parseBase() local 1611 for (i += 1, digs = 0; i < len && (c = val[i]); ++i, ++digs) { in bc_num_parseBase() 1634 bc_num_div(&result1, m1, &result2, digs * 2); in bc_num_parseBase() 1635 bc_num_truncate(&result2, digs); in bc_num_parseBase() 1636 bc_num_add(n, &result2, n, digs); in bc_num_parseBase() 1639 if (n->scale < digs) bc_num_extend(n, digs - n->scale); in bc_num_parseBase() 1743 BcDig digs[BC_NUM_BIGDIG_LOG10]; in bc_num_printExponent() local [all …]
|
/external/dnsmasq/src/ |
D | rfc1035.c | 82 unsigned int count, digs; in extract_name() local 90 digs = ((count - 1) >> 2) + 1; in extract_name() 93 if (cp - (unsigned char*) name + digs + 9 >= MAXDNAME) return 0; in extract_name() 99 for (j = 0; j < digs; j++) { in extract_name()
|
D | option.c | 657 int i, addrs, digs, is_addr, is_hex, is_dec, is_string, dots; in parse_dhcp_opt() local 715 addrs = digs = 1; in parse_dhcp_opt() 722 digs++; in parse_dhcp_opt() 754 if (is_hex && digs > 1) { in parse_dhcp_opt() 755 new->len = digs; in parse_dhcp_opt() 757 parse_hex(comma, new->val, digs, (flags & DHOPT_MATCH) ? &new->u.wildcard_mask : NULL, in parse_dhcp_opt()
|
/external/toybox/toys/pending/ |
D | bc.c | 2205 size_t pow, len, digs, digs1, resrdx, times = 0; in bc_num_sqrt() local 2255 x0->rdx = digs = digs1 = 0; in bc_num_sqrt() 2259 while (!TT.sig && (cmp || digs < len)) { in bc_num_sqrt() 2269 digs = x1->len - (unsigned long long) llabs(cmp); in bc_num_sqrt() 2271 if (cmp == cmp2 && digs == digs1) times += 1; in bc_num_sqrt() 2278 digs1 = digs; in bc_num_sqrt()
|
/external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
D | words.shakespeare.txt.gz | 1a
2A
3Aaron
4AARON
5abaissiez
6abandon
7abandoned
8abase
9Abase
10 ... |
D | ospd.txt.gz |
|
/external/jline/src/src/test/resources/jline/example/ |
D | english.gz |
|
/external/cldr/tools/java/org/unicode/cldr/util/data/transforms/ |
D | internal_raw_IPA-old.txt | 53933 digs %24550 dɪgz
|
D | internal_raw_IPA.txt | 45544 digs %33836 dɪgz
|