Lines Matching defs:nd
296 int e0, nd, nd0, scale;
487 /* convert a string s containing nd decimal digits (possibly containing a
494 s2b(const char *s, int nd0, int nd, ULong y9)
500 x = (nd + 8) / 9;
508 if (nd <= 9)
518 for(; i < nd; i++) {
1280 given by the bd->nd digits of s0) * 10**e0
1282 bc->nd gives the total number of significant digits of s0. It will
1287 bc->nd.
1302 int b2, d2, dd, i, nd, nd0, odd, p2, p5;
1304 nd = bc->nd;
1306 p5 = nd + bc->e0;
1391 dd = i < nd;
1394 if (!(i < nd)) {
1442 int esign, i, j, k, lz, nd, nd0, odd, sign;
1518 nd = (int)ndigits;
1567 e -= nd - nd0;
1569 nd0 = nd;
1577 if (!nd)
1579 for (i = nd; i > 0; ) {
1586 e += nd - i;
1587 nd = i;
1588 if (nd0 > nd)
1589 nd0 = nd;
1592 * inputs, we have values s0, nd0, nd, e, sign, where:
1596 * - nd is the total number of significant digits (here, and
1602 * satisfies 1 <= nd0 <= nd. The nd significant digits are in
1603 * s0[0:nd0] and s0[nd0+1:nd+1] using the usual Python half-open slice
1604 * notation. (If nd0 < nd, then s0[nd0] contains a '.' character; if
1605 * nd0 == nd, then s0[nd0] could be any non-digit character.)
1610 * s0[0:nd0] and s0[nd0+1:nd+1]
1619 * - y contains the value represented by the first min(9, nd)
1622 * - if nd > 9, z contains the value represented by significant digits
1623 * with indices in [9, min(16, nd)). So y * 10**(min(16, nd) - 9) + z
1624 * gives the value represented by the first min(16, nd) sig. digits.
1629 for (i = 0; i < nd; i++) {
1638 k = nd < DBL_DIG + 1 ? nd : DBL_DIG + 1;
1643 if (nd <= DBL_DIG
1653 i = DBL_DIG - nd;
1669 e1 += nd - k;
1745 bc.nd = nd;
1746 bc.nd0 = nd0; /* Only needed if nd > STRTOD_DIGLIM, but done here */
1749 if (nd > STRTOD_DIGLIM) {
1755 zeros on the result by updating nd, nd0, e and y suitably. (There's
1766 e += nd - i;
1767 nd = i;
1768 if (nd0 > nd)
1769 nd0 = nd;
1770 if (nd < 9) { /* must recompute y */
1774 for(; i < nd; ++i)
1778 bd0 = s2b(s0, nd0, nd, y);
1921 if (bc.nd > nd && i <= 0) {
1949 bc.nd = nd;
2004 if (bc.nd > nd)
2021 if (bc.nd >nd)
2034 if (bc.nd >nd)
2095 if (bc.nd == nd) {
2116 if (bc.nd > nd) {