Lines Matching refs:s0
1360 the corresponding digits of s0.
1367 s0 points to the first significant digit of the input string.
1378 given by the bd->nd digits of s0) * 10**e0
1380 bc->nd gives the total number of significant digits of s0. It will
1383 bc->nd0 gives the number of significant digits of s0 before the
1397 bigcomp(U *rv, const char *s0, BCinfo *bc)
1468 /* Compare s0 with b/d: set dd to -1, 0, or 1 according as s0 < b/d, s0 ==
1469 * b/d, or s0 > b/d. Here the digits of s0 are thought of as representing
1482 dd = s0[i < nd0 ? i : i+1] - '0' - quorem(b, d);
1493 /* b/d != 0, but digits of s0 exhausted */
1511 const char *s, *s0, *s1;
1541 /* Point s0 at the first nonzero digit (if any). fraclen will be the
1545 s0 = s1 = s;
1560 s0 = s;
1648 if (s0[i < nd0 ? i : i+1] != '0') {
1659 * inputs, we have values s0, nd0, nd, e, sign, where:
1661 * - s0 points to the first significant digit of the input string
1670 * s0[0:nd0] and s0[nd0+1:nd+1] using the usual Python half-open slice
1671 * notation. (If nd0 < nd, then s0[nd0] contains a '.' character; if
1672 * nd0 == nd, then s0[nd0] could be any non-digit character.)
1677 * s0[0:nd0] and s0[nd0+1:nd+1]
1698 y = 10*y + s0[i < nd0 ? i : i+1] - '0';
1700 z = 10*z + s0[i < nd0 ? i : i+1] - '0';
1827 is s0[i] if i < nd0, s0[i+1] if i >= nd0. */
1829 if (s0[i < nd0 ? i : i+1] != '0') {
1841 y = 10*y + s0[i] - '0';
1843 y = 10*y + s0[i+1] - '0';
1846 bd0 = s2b(s0, nd0, nd, y);
2227 error = bigcomp(&rv, s0, &bc);
2391 char *s, *s0;
2396 s0 = 0;
2533 s0 = rv_alloc(i);
2534 if (s0 == NULL)
2536 s = s0;
2631 s = s0;
2660 if (s == s0) {
2907 if (s == s0) {
2931 return s0;
2941 if (s0)
2942 _Py_dg_freedtoa(s0);