33   const char *q{p};  in ParseNumber()  local
34   isNegative_ = *q == '-';  in ParseNumber()
35   if (*q == '-' || *q == '+') {  in ParseNumber()
36     ++q;  in ParseNumber()
38   const char *start{q};  in ParseNumber()
39   for (; q != end && *q == '0'; ++q) {  in ParseNumber()
41   const char *firstDigit{q};  in ParseNumber()
42   for (; q != end && *q >= '0' && *q <= '9'; ++q) {  in ParseNumber()
45   if (q != end && *q == '.') {  in ParseNumber()
46     point = q;  in ParseNumber()
47     for (++q; q != end && *q >= '0' && *q <= '9'; ++q) {  in ParseNumber()
50   if (q == start || (q == start + 1 && start == point)) {  in ParseNumber()
55   p = q;  in ParseNumber()
58     while (q[-1] == '0') {  in ParseNumber()
59       --q;  in ParseNumber()
61     if (q[-1] == '.') {  in ParseNumber()
63       --q;  in ParseNumber()
67     while (q > firstDigit && q[-1] == '0') {  in ParseNumber()
68       --q;  in ParseNumber()
74   if (q > limit) {  in ParseNumber()
77       q = point;  in ParseNumber()
81       exponent_ += q - limit;  in ParseNumber()
83     q = limit;  in ParseNumber()
86     exponent_ -= static_cast<int>(q - point - 1);  in ParseNumber()
88   if (q == firstDigit) {  in ParseNumber()
92   for (auto times{radix}; q-- > firstDigit;) {  in ParseNumber()
93     if (*q != '.') {  in ParseNumber()
95         digit_[digits_++] = *q - '0';  in ParseNumber()
98         digit_[digits_ - 1] += times * (*q - '0');  in ParseNumber()
107   q = p;  in ParseNumber()
108   switch (*q) {  in ParseNumber()
115     if (++q == end) {  in ParseNumber()
118     bool negExpo{*q == '-'};  in ParseNumber()
119     if (*q == '-' || *q == '+') {  in ParseNumber()
120       ++q;  in ParseNumber()
122     if (q != end && *q >= '0' && *q <= '9') {  in ParseNumber()
124       for (; q != end && *q == '0'; ++q) {  in ParseNumber()
126       const char *expDig{q};  in ParseNumber()
127       for (; q != end && *q >= '0' && *q <= '9'; ++q) {  in ParseNumber()
128         expo = 10 * expo + *q - '0';  in ParseNumber()
130       if (q >= expDig + 8) {  in ParseNumber()
138       p = q; // exponent is valid; advance the termination pointer  in ParseNumber()
433       const char *q{p};  in ConvertToBinary()  local
434       if (!limit || q < limit) {  in ConvertToBinary()
435         isNegative_ = *q == '-';  in ConvertToBinary()
436         if (isNegative_ || *q == '+') {  in ConvertToBinary()
437           ++q;  in ConvertToBinary()
440       if ((!limit || limit >= q + 3) && toupper(q[0]) == 'I' &&  in ConvertToBinary()
441           toupper(q[1]) == 'N' && toupper(q[2]) == 'F') {  in ConvertToBinary()
442         if ((!limit || limit >= q + 8) && toupper(q[3]) == 'I' &&  in ConvertToBinary()
443             toupper(q[4]) == 'N' && toupper(q[5]) == 'I' &&  in ConvertToBinary()
444             toupper(q[6]) == 'T' && toupper(q[7]) == 'Y') {  in ConvertToBinary()
445           p = q + 8;  in ConvertToBinary()
447           p = q + 3;  in ConvertToBinary()