(codePoints)
| 952 | return isDigit(c1); |
| 953 | }; |
| 954 | var stringToNumber = function (codePoints) { |
| 955 | var c = 0; |
| 956 | var sign = 1; |
| 957 | if (codePoints[c] === PLUS_SIGN || codePoints[c] === HYPHEN_MINUS) { |
| 958 | if (codePoints[c] === HYPHEN_MINUS) { |
| 959 | sign = -1; |
| 960 | } |
| 961 | c++; |
| 962 | } |
| 963 | var integers = []; |
| 964 | while (isDigit(codePoints[c])) { |
| 965 | integers.push(codePoints[c++]); |
| 966 | } |
| 967 | var int = integers.length ? parseInt(fromCodePoint$1.apply(void 0, integers), 10) : 0; |
| 968 | if (codePoints[c] === FULL_STOP) { |
| 969 | c++; |
| 970 | } |
| 971 | var fraction = []; |
| 972 | while (isDigit(codePoints[c])) { |
| 973 | fraction.push(codePoints[c++]); |
| 974 | } |
| 975 | var fracd = fraction.length; |
| 976 | var frac = fracd ? parseInt(fromCodePoint$1.apply(void 0, fraction), 10) : 0; |
| 977 | if (codePoints[c] === E || codePoints[c] === e) { |
| 978 | c++; |
| 979 | } |
| 980 | var expsign = 1; |
| 981 | if (codePoints[c] === PLUS_SIGN || codePoints[c] === HYPHEN_MINUS) { |
| 982 | if (codePoints[c] === HYPHEN_MINUS) { |
| 983 | expsign = -1; |
| 984 | } |
| 985 | c++; |
| 986 | } |
| 987 | var exponent = []; |
| 988 | while (isDigit(codePoints[c])) { |
| 989 | exponent.push(codePoints[c++]); |
| 990 | } |
| 991 | var exp = exponent.length ? parseInt(fromCodePoint$1.apply(void 0, exponent), 10) : 0; |
| 992 | return sign * (int + frac * Math.pow(10, -fracd)) * Math.pow(10, expsign * exp); |
| 993 | }; |
| 994 | var LEFT_PARENTHESIS_TOKEN = { |
| 995 | type: 2 /* LEFT_PARENTHESIS_TOKEN */ |
| 996 | }; |
no test coverage detected
searching dependent graphs…