@qubit-ltd/json 1.1.4 → 1.2.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +206 -28
- package/README.zh_CN.md +205 -27
- package/dist/json.cjs +90 -63
- package/dist/json.cjs.map +1 -1
- package/dist/json.min.cjs +1 -1
- package/dist/json.min.cjs.map +1 -1
- package/dist/json.min.mjs +1 -1
- package/dist/json.min.mjs.map +1 -1
- package/dist/json.mjs +90 -63
- package/dist/json.mjs.map +1 -1
- package/doc/api/LosslessNumber.html +1 -1
- package/doc/api/global.html +1 -1
- package/doc/api/index.html +196 -29
- package/doc/json.min.visualization.html +1 -1
- package/doc/json.visualization.html +1 -1
- package/package.json +16 -14
package/dist/json.min.mjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"json.min.mjs","sources":["../node_modules/json-custom-numbers/parse.mjs","../node_modules/json-custom-numbers/stringify.mjs","../src/utils/is-integer.js","../src/utils/extract-significant-digits.js","../src/utils/is-safe-number.js","../src/utils/is-number.js","../src/utils/get-unsafe-reason.js","../src/utils/lossless-number.js","../src/parse-number.js","../src/format-number.js","../src/json.js","../src/collection-replacer.js","../src/utils/is-bigint.js","../src/utils/to-safe-number-or-throw.js"],"sourcesContent":["var T=Object.defineProperty;var C=(t,a)=>T(t,\"name\",{value:a,configurable:!0});/**\n * https://github.com/jawj/json-custom-numbers\n * @copyright Copyright (c) 2023 George MacKerron\n * @license MIT\n * \n * This file implements a non-recursive JSON parser that's intended to\n * precisely match native `JSON.parse` behaviour but also allow for custom\n * number parsing.\n */const v=/[^\"\\\\\\u0000-\\u001f]*/y,D=/-?(0|[1-9][0-9]*)([.][0-9]+)?([eE][-+]?[0-9]+)?|true|false|null/y,\nJ=/[ \\n\\t\\r]*$/y,X=/^.{0,32}\\n[ \\t]/,h=/[ \\n\\t\\r]*/y,j=`........................\\\n..........\"............./.............................................\\\\......\\b..\\\n..\\f........\n....\\r..\t`.split(\".\"),x=C(()=>new Uint32Array(103),\"hlArr\"),k=x(),m=x(),w=x(),$=x();\nlet i=0;for(;i<48;i++)k[i]=m[i]=w[i]=$[i]=65536;for(;i<58;i++)k[i]=(m[i]=(w[i]=($[i]=\ni-48)<<4)<<4)<<4;for(;i<65;i++)k[i]=m[i]=w[i]=$[i]=65536;for(;i<71;i++)k[i]=(m[i]=\n(w[i]=($[i]=i-55)<<4)<<4)<<4;for(;i<97;i++)k[i]=m[i]=w[i]=$[i]=65536;for(;i<103;i++)\nk[i]=(m[i]=(w[i]=($[i]=i-87)<<4)<<4)<<4;function O(t,a=\"\"){if(!(t>=0))return\"end\\\n of JSON input\";if(t>31&&t<127)return`'${a}${String.fromCharCode(t)}'`;if(t===10)\nreturn\"\\\\n\";if(t===9)return\"\\\\t\";const p=t.toString(16),y=\"0000\".slice(p.length)+\np;return(t>31?`'${a}${String.fromCharCode(t)}' or `:\"\")+`\\\\u${y}`}C(O,\"chDesc\");\nfunction R(t,a){const p=Object.keys(a),y=p.length;for(let d=0;d<y;d++){const n=p[d],\ne=t.call(a,n,a[n]);e!==void 0?a[n]=e:delete a[n]}}C(R,\"revive\");function q(t,a,p){\nconst y=p===!0?\" in array\":p===!1?\" in object\":\"\",d=t.slice(0,a),n=d.match(/[^\\n]{0,69}$/)[0],\ne=n.length<d.length?\"...\"+n:n,o=a-(d.length-e.length),u=t.slice(a),r=u.match(/[^\\n]{0,5}/)[0],\nc=r.length<u.length?r+\"...\":r,A=e+c,I=\" \".repeat(o<1?0:o-1)+\"^\";return`${y}\nAt position ${a} in JSON:\n${A}\n${I}`}C(q,\"errContext\");const N={maxDepth:1/0};function K(t,a,p,y){var U;typeof t!=\n\"string\"&&(t=String(t)),typeof a!=\"function\"&&(a=void 0);const d=y===void 0?N.maxDepth:\ntypeof y==\"number\"?y:(U=y.maxDepth)!=null?U:N.maxDepth;let n=0,e,o,u,r,c;function A(l){\nthrow new SyntaxError(l+q(t,n,u))}C(A,\"err\");function I(){A(`JSON structure too \\\ndeeply nested (current max depth: ${d})`)}C(I,\"tooDeep\");function b(l){A(`Unexpe\\\ncted ${O(e)}, expecting ${l}`)}C(b,\"expected\");function E(){const l=n-1;if(D.lastIndex=\nl,D.test(t)!==!0&&b(\"JSON value\"),n=D.lastIndex,e<102){const g=t.slice(l,n);return p?\np.call(o,r,g):+g}return e===110?null:e===116}C(E,\"word\");function S(){let l=\"\";e:\nfor(;;){v.lastIndex=n,v.test(t);const f=v.lastIndex;for(f>n&&(l+=t.slice(n,f),n=\nf),e=t.charCodeAt(n++);;){switch(e){case 34:return l;case 92:if(e=t.charCodeAt(n++),\ne===117){const s=k[t.charCodeAt(n++)]+m[t.charCodeAt(n++)]+w[t.charCodeAt(n++)]+\n$[t.charCodeAt(n++)];if(s<65536){l+=String.fromCharCode(s);break}A(\"Invalid \\\\uXX\\\nXX escape in string\")}const g=j[e];if(g!==\"\"&&g!==void 0){l+=g;break}A(`Invalid \\\nescape sequence: ${O(e,\"\\\\\")} in string`);default:e>=0||A(\"Unterminated string\"),\nA(`Invalid unescaped ${O(e)} in string`)}if(e=t.charCodeAt(n),e!==92&&e!==34)continue e;\nn++}}}C(S,\"string\");e:{do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===\n13||e===9));switch(e){case 123:d===0&&I(),o={},r=void 0,u=!1;break;case 91:d===0&&\nI(),o=[],r=0,u=!0;break;case 34:c=S();break e;default:c=E();break e}const l=d+d-\n2,f=[],g=X.test(t);let s=0;t:for(;;)if(u===!0)for(;;){g===!0&&s>2&&(h.lastIndex=\nn,h.test(t),n=h.lastIndex);do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||\ne===13||e===9));if(e===93){if(a!==void 0&&R(a,o),c=o,s===0)break e;if(o=f[--s],r=\nf[--s],u=typeof r==\"number\",u===!0){o[r++]=c;continue}else{o[r]=c;continue t}}if(r!==\n0){e!==44&&b(\"',' or ']' after value\"),g===!0&&s>2&&(h.lastIndex=n,h.test(t),n=h.\nlastIndex);do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===9))}\nswitch(e){case 34:o[r++]=S();continue;case 123:s===l&&I(),f[s++]=r,f[s++]=o,o={},\nr=void 0,u=!1;continue t;case 91:s===l&&I(),f[s++]=r,f[s++]=o,o=[],r=0;continue;default:\no[r++]=E()}}else for(;;){g===!0&&s>2&&(h.lastIndex=n,h.test(t),n=h.lastIndex);do\ne=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===9));if(e===125){if(a!==\nvoid 0&&R(a,o),c=o,s===0)break e;if(o=f[--s],r=f[--s],u=typeof r==\"number\",u===!0){\no[r++]=c;continue t}else{o[r]=c;continue}}if(r!==void 0){e!==44&&b(\"',' or '}' a\\\nfter value\"),g===!0&&s>2&&(h.lastIndex=n,h.test(t),n=h.lastIndex);do e=t.charCodeAt(\nn++);while(e<=32&&(e===32||e===10||e===13||e===9))}e!==34&&b(\"'}' or double-quot\\\ned key\"),r=S();do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===\n9));e!==58&&b(\"':' after key\");do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===\n10||e===13||e===9));switch(e){case 34:o[r]=S();continue;case 123:s===l&&I(),f[s++]=\nr,f[s++]=o,o={},r=void 0;continue;case 91:s===l&&I(),f[s++]=r,f[s++]=o,o=[],r=0,\nu=!0;continue t;default:o[r]=E()}}}return J.lastIndex=n,J.test(t)===!1&&A(\"Unexp\\\nected data after end of JSON input\"),a!==void 0&&(c={\"\":c},R(a,c),c=c[\"\"]),c}C(K,\n\"parse\");export{K as parse};\n","var E=Object.defineProperty;var T=Object.getOwnPropertySymbols;var F=Object.prototype.hasOwnProperty,V=Object.prototype.propertyIsEnumerable;var D=(t,e,i)=>e in t?E(t,e,{enumerable:!0,configurable:!0,writable:!0,value:i}):\nt[e]=i,u=(t,e)=>{for(var i in e||(e={}))F.call(e,i)&&D(t,i,e[i]);if(T)for(var i of T(\ne))V.call(e,i)&&D(t,i,e[i]);return t};var K=(t,e)=>E(t,\"name\",{value:e,configurable:!0});/**\n * https://github.com/jawj/json-custom-numbers\n * @copyright Copyright (c) 2023 George MacKerron\n * @license MIT\n * \n * This file implements a non-recursive JSON stringifier that's intended to\n * precisely match native `JSON.stringify` behaviour but also allow for custom\n * stringifying of numbers.\n */const x=/[\"\\\\\\u0000-\\u001f]/,q=Object.prototype.hasOwnProperty,z={maxDepth:5e4,\nskipToJSON:!1};function C(t,e,i,j,g={}){typeof g==\"number\"&&(g={maxDepth:g}),g=u(\nu({},z),g);const{maxDepth:J,skipToJSON:L}=g;let O,S;e!==void 0&&(typeof e==\"func\\\ntion\"?O=e:Array.isArray(e)&&(S=e.map(l=>String(l)))),i!==void 0&&(i=typeof i==\"s\\\ntring\"?i.slice(0,10):typeof i==\"number\"?\" \".slice(0,i):void 0);const P=J*\n(i===void 0?5:6);let r,s={\"\":t},d=0,c=[\"\"],h=!1,k=1,f=[],n=0,y=\"\",b=`\n`,o,p=new Set([]);do{if(d===k){p.delete(s),i!==void 0&&(b=f[--n],y+=b),y+=c===void 0?\n\"]\":\"}\",k=f[--n],h=f[--n],c=f[--n],d=f[--n],s=f[--n];continue}let l,w;c===void 0?\n(r=String(d),t=s[d]):(r=c[d],t=s[r]);let a=typeof t;if(L===!1&&t&&a===\"object\"&&\ntypeof t.toJSON==\"function\"&&(t=t.toJSON(r),a=typeof t),O!==void 0&&(t=O.call(s,\nr,t),a=typeof t),j===void 0||(o=j(r,t,a))===void 0)switch(a){case\"string\":o=x.test(\nt)?JSON.stringify(t):'\"'+t+'\"';break;case\"number\":o=isFinite(t)?String(t):\"null\";\nbreak;case\"boolean\":o=t===!0?\"true\":\"false\";break;case\"object\":if(t===null){o=\"n\\\null\";break}if(Array.isArray(t)){const m=t.length;m===0?o=\"[]\":(o=\"[\",l=void 0,w=\nm);break}const N=S===void 0?Object.keys(t):S.filter(m=>q.call(t,m)),A=N.length;A===\n0?o=\"{}\":(o=\"{\",l=N,w=A);break;case\"bigint\":throw new TypeError(\"Do not know how\\\n to serialize a BigInt: please provide a custom serializer function\");default:o=\nvoid 0}if(c===void 0?(d>0&&(y+=\",\"),i!==void 0&&(y+=b),y+=o===void 0?\"null\":o):o!==\nvoid 0&&(h?y+=\",\":h=!0,n>0&&(y+=i===void 0?(x.test(r)?JSON.stringify(r):'\"'+r+'\"')+\n\":\":b+(x.test(r)?JSON.stringify(r):'\"'+r+'\"')+\": \"),y+=o),d++,w!==void 0){if(f[n++]=\ns,f[n++]=d,f[n++]=c,f[n++]=h,f[n++]=k,i!==void 0&&(f[n++]=b,b+=i),s=t,d=0,c=l,h=\n!1,k=w,n>P)throw new RangeError(`Maximum nesting depth exceeded (current maximum\\\n is ${J})`);if(p.has(s))throw new TypeError(\"Cannot stringify circular structure\");\np.add(s)}}while(n!==0);return y||void 0}K(C,\"stringify\");export{C as stringify};\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A regular expression for testing whether a string represents an integer.\n *\n * @type {RegExp}\n * @private\n */\nconst INTEGER_REGEX = /^[+-]?\\d+$/;\n\n/**\n * Test whether a string represents an integer.\n *\n * @param value\n * The string to test.\n * @return {boolean}\n * true if the string contains an integer; false otherwise.\n */\nfunction isInteger(value) {\n return INTEGER_REGEX.test(value);\n}\n\nexport default isInteger;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\nconst EXPONENTIAL_PART_REGEX = /[eE][+-]?\\d+$/;\nconst LEADING_MINUS_AND_ZEROS_REGEX = /^-?(0*)?/;\nconst DOT_REGEX = /\\./;\nconst TRAILING_ZEROS_REGEX = /0+$/;\n\n/**\n * Get the significant digits of a number.\n *\n * For example:\n * - '2.34' returns '234'\n * - '-77' returns '77'\n * - '0.003400' returns '34'\n * - '120.5e+30' returns '1205'\n *\n * @param {string} value\n * The string representation of the number.\n * @return {string}\n * The significant digits of the number.\n * @private\n */\nfunction extractSignificantDigits(value) {\n return value\n .replace(EXPONENTIAL_PART_REGEX, '') // from \"-0.250e+30\" to \"-0.250\"\n .replace(DOT_REGEX, '') // from \"-0.250\" to \"-0250\"\n .replace(TRAILING_ZEROS_REGEX, '') // from \"-0250\" to \"-025\"\n .replace(LEADING_MINUS_AND_ZEROS_REGEX, ''); // from \"-025\" to \"25\"\n}\n\nexport default extractSignificantDigits;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isInteger from './is-integer';\nimport extractSignificantDigits from './extract-significant-digits';\n\nconst DEFAULT_APPROX = false;\nconst DEFAULT_REQUIRED_DIGITS = 14;\n\n/**\n * Test whether a string can be safely represented with a number without\n * information loss.\n *\n * When the argument `approx` is true, floating point numbers that lose a few\n * digits but are still approximately equal in value are considered safe too.\n * Integer numbers must still be exactly equal.\n *\n * @param {string} value\n * The string to test.\n * @param {object} options\n * The options of the test. It may contain the following properties:\n * - `approx: boolean`: indicates whether to consider approximately equal\n * floating point numbers as safe. Default is `false`.\n * - `requiredDigits: number`: the number of significant digits required for\n * a floating point number to be considered approximately equal. Default\n * is `14`.\n * @return {boolean}\n * true if the string can be safely represented with a number; false\n * otherwise.\n */\nfunction isSafeNumber(value, options = undefined) {\n const num = parseFloat(value);\n const str = String(num);\n if (value === str) {\n return true;\n }\n const v = extractSignificantDigits(value);\n const s = extractSignificantDigits(str);\n if (v === s) {\n return true;\n }\n const approx = options?.approx ?? DEFAULT_APPROX;\n if (approx === true) {\n // A value is approximately equal when:\n // 1. it is a floating point number, not an integer\n // 2. it has at least requiredDigits digits\n // 3. the first requiredDigits digits are equal\n const requiredDigits = options?.requiredDigits ?? DEFAULT_REQUIRED_DIGITS;\n if (!isInteger(value)\n && (s.length >= requiredDigits)\n && v.startsWith(s.substring(0, requiredDigits))) {\n return true;\n }\n }\n return false;\n}\n\nexport {\n DEFAULT_APPROX,\n DEFAULT_REQUIRED_DIGITS,\n isSafeNumber,\n};\n\nexport default isSafeNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A regular expression for testing whether a string represents a number.\n *\n * @type {RegExp}\n * @see http://stackoverflow.com/questions/13340717/json-numbers-regular-expression\n * @private\n */\nconst NUMBER_REGEX = /^-?(?:0|[1-9]\\d*)(?:\\.\\d+)?(?:[eE][+-]?\\d+)?$/;\n\n/**\n * Test whether a string represents a number\n *\n * @param {string} value\n * The string to test.\n * @return {boolean}\n * true if the string contains a number; false otherwise.\n */\nfunction isNumber(value) {\n return NUMBER_REGEX.test(value);\n}\n\nexport default isNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isInteger from './is-integer';\nimport extractSignificantDigits from './extract-significant-digits';\n\n/**\n * When the provided value is an unsafe number, describe what the reason is\n * - `'overflow'`\n * - `'underflow'`\n * - `'truncate_integer'`\n * - `'truncate_float'`\n * - `'none'` (when the value is safe)\n *\n * @param {string} value\n * The string represents a number to test.\n * @return {string}\n * The reason why the value is unsafe. Returns `'none'` when the value is safe.\n */\nfunction getUnsafeReason(value) {\n const num = parseFloat(value);\n const str = String(num);\n if (value === str) {\n return 'none';\n }\n const v = extractSignificantDigits(value);\n const s = extractSignificantDigits(str);\n if (v === s) {\n return 'none';\n }\n if (isInteger(value)) {\n return 'truncate_integer';\n }\n if (!Number.isFinite(num)) {\n return 'overflow';\n }\n if (num === 0) {\n return 'underflow';\n }\n return 'truncate_float';\n}\n\nexport default getUnsafeReason;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isNumber from './is-number';\nimport getUnsafeReason from './get-unsafe-reason';\n\n/**\n * The class of lossless numbers, which stores its numeric value as string.\n */\nclass LosslessNumber {\n /**\n * The string representation of the number.\n *\n * @type {string}\n */\n value = '';\n\n /**\n * Whether the value is a lossless number.\n *\n * @type {boolean}\n */\n isLosslessNumber = true;\n\n /**\n * Constructs a new instance of `LosslessNumber`.\n *\n * @param {string} value\n * The string representation of the number.\n */\n constructor(value) {\n if (!isNumber(value)) {\n throw new Error(`Invalid number (value: \"${value}\")`);\n }\n this.value = value;\n }\n\n /**\n * Get the value of the LosslessNumber as number or bigint.\n *\n * - a number is returned for safe numbers and decimal values that only lose\n * some insignificant digits;\n * - a bigint is returned for big integer numbers;\n * - an Error is thrown for values that will overflow or underflow;\n *\n * Note that you can implement your own strategy for conversion by just\n * getting the value as string via `.toString()`, and using util functions\n * like `isInteger`, `isSafeNumber`, `getUnsafeReason`, and `toSafeNumberOrThrow`\n * to convert it to a numeric value.\n *\n * @return {number|bigint}\n * the numeric value of the LosslessNumber, as number or bigint.\n */\n valueOf() {\n const unsafeReason = getUnsafeReason(this.value);\n switch (unsafeReason) {\n case 'none':\n return parseFloat(this.value);\n case 'truncate_float':\n return parseFloat(this.value);\n case 'truncate_integer':\n return BigInt(this.value);\n case 'overflow':\n case 'underflow':\n throw new Error('Cannot safely CONVERT TO NUMBER: '\n + `the value '${this.value}' would ${unsafeReason} `\n + `and become ${parseFloat(this.value)}`);\n default:\n throw new Error('Unknown unsafe reason');\n }\n }\n\n /**\n * Get the value of this `LosslessNumber` as string.\n *\n * @return {string}\n * the string representation of this `LosslessNumber`.\n */\n toString() {\n return this.value;\n }\n\n // Note: we do NOT implement a .toJSON() method, and you should not implement\n // or use that, it cannot safely turn the numeric value in the string into\n // stringified JSON since it has to be parsed into a number first.\n}\n\nexport default LosslessNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isInteger from './utils/is-integer';\nimport isSafeNumber from './utils/is-safe-number';\nimport LosslessNumber from './utils/lossless-number';\n\n/**\n * A custom function to parse a number from a string, which supports lossless\n * number parsing.\n *\n * @param {string} key\n * The key of the property.\n * @param {string} value\n * The value of the property.\n * @return {any}\n * The parsed value.\n * @private\n */\nfunction parseNumber(key, value) {\n // if (isBigInt(value)) {\n // return BigInt(value.slice(0, -1));\n // }\n if (isSafeNumber(value, { approx: false })) {\n return parseFloat(value);\n }\n if (isInteger(value)) {\n return BigInt(value);\n }\n return new LosslessNumber(value);\n}\n\nexport default parseNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport LosslessNumber from './utils/lossless-number';\n\n/**\n * Formats a number value.\n *\n * @param {string} key\n * The key of the property.\n * @param {string} value\n * The value of the property.\n * @param {string} type\n * The type of the value.\n * @return {undefined|string}\n * The formatted value. If the value is not a number, then return undefined.\n * @private\n */\nfunction formatNumber(key, value, type) {\n switch (type) {\n case 'bigint':\n return value.toString();\n case 'object':\n // if (value instanceof Set) {\n // return Array.from(value);\n // }\n // if (value instanceof Map) {\n // return Array.from(value);\n // }\n if (value instanceof LosslessNumber) {\n return value.toString();\n }\n return undefined;\n default:\n return undefined;\n }\n}\n\nexport default formatNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport { parse, stringify } from 'json-custom-numbers';\nimport parseNumber from './parse-number';\nimport formatNumber from './format-number';\nimport collectionReplacer from './collection-replacer';\n\n/**\n * A customized JSON object which supports lossless number parsing and stringifying.\n *\n * This object provides two methods: `parse` and `stringify`, which are the same as the\n * `JSON.parse` and `JSON.stringify` methods, except that they support lossless number\n * parsing and stringifying.\n *\n * @type {object}\n */\nconst json = {\n parse: (text, reviver) => parse(text, reviver, parseNumber),\n stringify: (value, replacer, space) => stringify(value,\n (k, v) => collectionReplacer(k, v, replacer),\n space,\n formatNumber),\n};\n\njson[Symbol.toStringTag] = 'JSON';\n\nexport default json;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A JSON replacer which serialize collections as arrays.\n *\n * @param {string} key\n * The key of the property.\n * @param {any} value\n * The value of the property.\n * @param {undefined|null|function} fallbackReplacer\n * The fallback replacer.\n * @return {any}\n * The serialized value.\n * @private\n */\nfunction collectionReplacer(key, value, fallbackReplacer) {\n if (value instanceof Set) {\n return Array.from(value);\n }\n if (value instanceof Map) {\n return Array.from(value);\n }\n if (fallbackReplacer) {\n return fallbackReplacer(key, value);\n }\n return value;\n}\n\nexport default collectionReplacer;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n/**\n * A regular expression for testing whether a string represents a BigInt.\n *\n * @type {RegExp}\n * @private\n */\nconst BIG_INTEGER_REGEX = /^[+-]?\\d+n$/;\n\n/**\n * Test whether a string represents a BigInt.\n *\n * @param value\n * The string to test.\n * @return {boolean}\n * true if the string contains a BigInt; false otherwise.\n */\nfunction isBigInt(value) {\n return BIG_INTEGER_REGEX.test(value);\n}\n\nexport default isBigInt;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport getUnsafeReason from './get-unsafe-reason';\nimport { DEFAULT_APPROX } from './is-safe-number';\n\n/**\n * Convert a string into a number when it is safe to do so.\n * Throws an error otherwise, explaining the reason.\n *\n * @param {string} value\n * The string to convert into a number.\n * @param {object} options\n * The options for conversion.\n * @return {number}\n * The converted safe number.\n * @throws {Error}\n * When the value is not safe to convert.\n */\nexport function toSafeNumberOrThrow(value, options = undefined) {\n const number = parseFloat(value);\n const unsafeReason = getUnsafeReason(value);\n if (unsafeReason === 'none') {\n return number;\n }\n const approx = options?.approx ?? DEFAULT_APPROX;\n // when approx is true, we allow truncating float values\n if (approx && (unsafeReason === 'truncate_float')) {\n return number;\n }\n const unsafeReasonText = unsafeReason?.replace(/_/, ' ');\n throw new Error('Cannot safely convert to number: '\n + `the value '${value}' would ${unsafeReasonText} and become ${number}`);\n}\n\nexport default toSafeNumberOrThrow;\n"],"names":["_classCallCheck","_createClass","_defineProperty","T","Object","defineProperty","C","t","a","value","configurable","v","D","J","X","h","j","split","x","Uint32Array","k","m","w","$","i","O","String","fromCharCode","p","toString","y","slice","length","R","keys","d","n","e","call","q","match","o","u","r","repeat","N","maxDepth","K","U","c","A","l","SyntaxError","I","b","E","lastIndex","test","g","S","f","charCodeAt","s","getOwnPropertySymbols","F","prototype","hasOwnProperty","V","propertyIsEnumerable","enumerable","writable","z","skipToJSON","L","Array","isArray","map","P","Set","delete","toJSON","JSON","stringify","isFinite","filter","TypeError","RangeError","has","add","INTEGER_REGEX","isInteger","EXPONENTIAL_PART_REGEX","LEADING_MINUS_AND_ZEROS_REGEX","DOT_REGEX","TRAILING_ZEROS_REGEX","extractSignificantDigits","replace","DEFAULT_APPROX","DEFAULT_REQUIRED_DIGITS","isSafeNumber","_options$approx","options","arguments","undefined","num","parseFloat","str","approx","_options$requiredDigi","requiredDigits","startsWith","substring","NUMBER_REGEX","isNumber","getUnsafeReason","Number","LosslessNumber","Error","concat","this","key","valueOf","unsafeReason","BigInt","parseNumber","formatNumber","type","json","parse","text","reviver","replacer","space","collectionReplacer","fallbackReplacer","Map","from","Symbol","toStringTag","BIG_INTEGER_REGEX","isBigInt","toSafeNumberOrThrow","number","unsafeReasonText"],"mappings":"OAAAA,MAAA,+CAAAC,MAAA,4CAAAC,MAAA,wCAAA,IAAIC,EAAEC,OAAOC,eAAmBC,IAAE,CAACC,EAAEC,IAAIL,EAAEI,EAAE,OAAO,CAACE,MAAMD,EAAEE,cAAa,IAQvE,MAAMC,EAAE,wBAAwBC,EAAE,mEACrCC,EAAE,eAAeC,EAAE,kBAAkBC,EAAE,cAAcC,EAAE,qIAG5CC,MAAM,KAAKC,EAAEZ,KAAE,IAAI,IAAIa,YAAY,MAAK,SAASC,EAAEF,IAAIG,EAAEH,IAAII,EAAEJ,IAAIK,EAAEL,IAChF,IAAIM,EAAE,EAAE,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,GAAGH,EAAEG,GAAGF,EAAEE,GAAGD,EAAEC,GAAG,MAAM,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,IAAIH,EAAEG,IAAIF,EAAEE,IAAID,EAAEC,GAClFA,EAAE,KAAK,IAAI,IAAI,EAAE,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,GAAGH,EAAEG,GAAGF,EAAEE,GAAGD,EAAEC,GAAG,MAAM,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,IAAIH,EAAEG,IAC9EF,EAAEE,IAAID,EAAEC,GAAGA,EAAE,KAAK,IAAI,IAAI,EAAE,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,GAAGH,EAAEG,GAAGF,EAAEE,GAAGD,EAAEC,GAAG,MAAM,KAAKA,EAAE,IAAIA,IAChFJ,EAAEI,IAAIH,EAAEG,IAAIF,EAAEE,IAAID,EAAEC,GAAGA,EAAE,KAAK,IAAI,IAAI,EAAE,SAASC,EAAElB,EAAEC,EAAE,IAAI,KAAKD,GAAG,GAAG,MAAM,oBAC5D,GAAGA,EAAE,IAAIA,EAAE,IAAI,MAAM,IAAIC,IAAIkB,OAAOC,aAAapB,MAAM,GAAO,KAAJA,EAC1E,MAAM,MAAM,GAAO,IAAJA,EAAM,MAAM,MAAM,MAAMqB,EAAErB,EAAEsB,SAAS,IAAIC,EAAE,OAAOC,MAAMH,EAAEI,QACzEJ,EAAE,OAAOrB,EAAE,GAAG,IAAIC,IAAIkB,OAAOC,aAAapB,UAAU,IAAI,MAAMuB,GAAG,CACjE,SAASG,EAAE1B,EAAEC,GAAG,MAAMoB,EAAExB,OAAO8B,KAAK1B,GAAGsB,EAAEF,EAAEI,OAAO,IAAI,IAAIG,EAAE,EAAEA,EAAEL,EAAEK,IAAI,CAAC,MAAMC,EAAER,EAAEO,GACjFE,EAAE9B,EAAE+B,KAAK9B,EAAE4B,EAAE5B,EAAE4B,SAAQ,IAAJC,EAAW7B,EAAE4B,GAAGC,SAAS7B,EAAE4B,EAAE,CAAC,CAAe,SAASG,IAAEhC,EAAEC,EAAEoB,GAC/E,MAAME,GAAM,IAAJF,EAAO,aAAgB,IAAJA,EAAO,aAAa,GAAGO,EAAE5B,EAAEwB,MAAM,EAAEvB,GAAG4B,EAAED,EAAEK,MAAM,gBAAgB,GAC3FH,EAAED,EAAEJ,OAAOG,EAAEH,OAAO,MAAMI,EAAEA,EAAEK,EAAEjC,GAAG2B,EAAEH,OAAOK,EAAEL,QAAQU,EAAEnC,EAAEwB,MAAMvB,GAAGmC,EAAED,EAAEF,MAAM,cAAc,GAC3B,MAAM,GAAGV,kBAC3DtB,eADkB6B,GAA9BM,EAAEX,OAAOU,EAAEV,OAAOW,EAAE,MAAMA,OAAU,IAAIC,OAAOH,EAAE,EAAE,EAAEA,EAAE,GAAG,KAGvD,CAR6DnC,IAAEmB,EAAE,UAEpBnB,IAAE2B,EAAE,UAMhD3B,IAAEiC,IAAE,cAAc,MAAMM,EAAE,CAACC,SAAS,KAAK,SAASC,IAAExC,EAAEC,EAAEoB,EAAEE,GAAG,IAAIkB,EACvE,iBADgFzC,IACrEA,EAAEmB,OAAOnB,IAAc,mBAAHC,IAAgBA,OAAE,GAAQ,MAAM2B,OAAM,IAAJL,EAAWe,EAAEC,SACpE,iBAAHhB,EAAYA,EAAkB,OAAfkB,EAAElB,EAAEgB,UAAgBE,EAAEH,EAAEC,SAAS,IAAQT,EAAEI,EAAEC,EAAEC,EAAEM,EAAZb,EAAE,EAAY,SAASc,EAAEC,GACpF,MAAM,IAAIC,YAAYD,EAAEZ,IAAEhC,EAAE6B,EAAEM,GAAG,CAAY,SAASW,IAAIH,EAAE,wDACxBf,KAAK,CAAgB,SAASmB,EAAEH,GAAGD,EAAE,cAClEzB,EAAEY,iBAAiBc,IAAI,CAAiB,SAASI,IAAI,MAAMJ,EAAEf,EAAE,EAAE,GAAGxB,EAAE4C,UAC7EL,GAAc,IAAZvC,EAAE6C,KAAKlD,IAAS+C,EAAE,cAAclB,EAAExB,EAAE4C,UAAUnB,EAAE,IAAI,CAAC,MAAMqB,EAAEnD,EAAEwB,MAAMoB,EAAEf,GAAG,OAAOR,EACnFA,EAAEU,KAAKG,EAAEE,EAAEe,IAAIA,CAAC,CAAC,OAAW,MAAJrB,EAAQ,KAAS,MAAJA,CAAO,CAAa,SAASsB,IAAI,IAAIR,EAAE,GAAGd,EAC/E,OAAO,CAAC1B,EAAE6C,UAAUpB,EAAEzB,EAAE8C,KAAKlD,GAAG,MAAMqD,EAAEjD,EAAE6C,UAAU,IAAII,EAAExB,IAAIe,GAAG5C,EAAEwB,MAAMK,EAAEwB,GAAGxB,EAC9EwB,GAAGvB,EAAE9B,EAAEsD,WAAWzB,OAAO,CAAC,OAAOC,GAAG,KAAK,GAAG,OAAOc,EAAE,KAAK,GAAG,GAAGd,EAAE9B,EAAEsD,WAAWzB,KAC3E,MAAJC,EAAQ,CAAC,MAAMyB,EAAE1C,EAAEb,EAAEsD,WAAWzB,MAAMf,EAAEd,EAAEsD,WAAWzB,MAAMd,EAAEf,EAAEsD,WAAWzB,MAC1Eb,EAAEhB,EAAEsD,WAAWzB,MAAM,GAAG0B,EAAE,MAAM,CAACX,GAAGzB,OAAOC,aAAamC,GAAG,KAAK,CAACZ,EAAE,mCAC9C,CAAC,MAAMQ,EAAE1C,EAAEqB,GAAG,GAAO,KAAJqB,QAAY,IAAJA,EAAW,CAACP,GAAGO,EAAE,KAAK,CAACR,EAAE,4BACpDzB,EAAEY,EAAE,mBAAmB,QAAQA,GAAG,GAAGa,EAAE,uBAC1DA,EAAE,qBAAqBzB,EAAEY,gBAAgB,GAAGA,EAAE9B,EAAEsD,WAAWzB,GAAO,KAAJC,GAAY,KAAJA,EAAO,SAASA,EACtFD,GAAG,CAAC,CAAC,CAZ6B9B,IAAE4C,EAAE,OACI5C,IAAE+C,EAAE,WACf/C,IAAEgD,EAAE,YAEUhD,IAAEiD,EAAE,QAQ3CjD,IAAEqD,EAAE,UAAUtB,EAAE,CAAC,GAAGA,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GACpE,KAD4EA,GACpE,IAAJA,IAAQ,OAAOA,GAAG,KAAK,IAAQ,IAAJF,GAAOkB,IAAIZ,EAAE,GAAGE,OAAE,EAAOD,GAAE,EAAG,MAAM,KAAK,GAAO,IAAJP,GAC3EkB,IAAIZ,EAAE,GAAGE,EAAE,EAAED,GAAE,EAAG,MAAM,KAAK,GAAGO,EAAEU,IAAI,MAAMtB,EAAE,QAAQY,EAAEM,IAAI,MAAMlB,EAAE,MAAMc,EAAEhB,EAAEA,EAC9E,EAAEyB,EAAE,GAAGF,EAAE5C,EAAE2C,KAAKlD,GAAG,IAAIuD,EAAE,EAAEvD,EAAE,OAAO,IAAO,IAAJmC,EAAO,OAAO,EAAK,IAAJgB,GAAQI,EAAE,IAAI/C,EAAEyC,UACtEpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAAEyC,WAAW,GAAGnB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GACpE,KAAJA,GAAY,IAAJA,IAAQ,GAAO,KAAJA,EAAO,CAAC,QAAO,IAAJ7B,GAAYyB,EAAEzB,EAAEiC,GAAGQ,EAAER,EAAM,IAAJqB,EAAM,MAAMzB,EAAE,GAAGI,EAAEmB,IAAIE,GAAGnB,EAC/EiB,IAAIE,GAAGpB,EAAY,iBAAHC,GAAgB,IAAJD,EAAO,CAACD,EAAEE,KAAKM,EAAE,QAAQ,CAAMR,EAAEE,GAAGM,EAAE,SAAS1C,CAAE,CAAC,GAC9E,IADiFoC,EAC/E,CAAK,KAAJN,GAAQiB,EAAE,2BAA8B,IAAJI,GAAQI,EAAE,IAAI/C,EAAEyC,UAAUpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAC/EyC,WAAW,GAAGnB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GAAY,IAAJA,GAAO,CAC/E,OAAOA,GAAG,KAAK,GAAGI,EAAEE,KAAKgB,IAAI,SAAS,KAAK,IAAIG,IAAIX,GAAGE,IAAIO,EAAEE,KAAKnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,CAAE,EAChFE,OAAE,EAAOD,GAAE,EAAG,SAASnC,EAAE,KAAK,GAAGuD,IAAIX,GAAGE,IAAIO,EAAEE,KAAKnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,GAAGE,EAAE,EAAE,SAAS,QAChFF,EAAEE,KAAKY,IAAI,MAAM,OAAO,EAAK,IAAJG,GAAQI,EAAE,IAAI/C,EAAEyC,UAAUpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAAEyC,WAAW,GAC9EnB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GAAY,IAAJA,IAAQ,GAAO,MAAJA,EAAH,CAExB,QAAO,IAAJM,EAAW,CAAK,KAAJN,GAAQiB,EAAE,2BAClD,IAAJI,GAAQI,EAAE,IAAI/C,EAAEyC,UAAUpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAAEyC,WAAW,GAAGnB,EAAE9B,EAAEsD,WACzEzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GAAY,IAAJA,GAAO,CAAK,KAAJA,GAAQiB,EAAE,4BACpDX,EAAEgB,IAAI,GAAGtB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GACpE,IAD4EA,IACpE,KAAJA,GAAQiB,EAAE,iBAAiB,GAAGjB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GACpE,KAD4EA,GACpE,KAAJA,GAAY,IAAJA,IAAQ,OAAOA,GAAG,KAAK,GAAGI,EAAEE,GAAGgB,IAAI,SAAS,KAAK,IAAIG,IAAIX,GAAGE,IAAIO,EAAEE,KAC9EnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,GAAGE,OAAE,EAAO,SAAS,KAAK,GAAGmB,IAAIX,GAAGE,IAAIO,EAAEE,KAAKnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,GAAGE,EAAE,EAC9ED,GAAE,EAAG,SAASnC,EAAE,QAAQkC,EAAEE,GAAGY,IAPY,KAFyB,CAAY,QAC9E,IADiF/C,GACzEyB,EAAEzB,EAAEiC,GAAGQ,EAAER,EAAM,IAAJqB,EAAM,MAAMzB,EAAE,GAAGI,EAAEmB,IAAIE,GAAGnB,EAAEiB,IAAIE,GAAGpB,EAAY,iBAAHC,GAAgB,IAAJD,EAAO,CAClFD,EAAEE,KAAKM,EAAE,SAAS1C,CAAC,CAAMkC,EAAEE,GAAGM,CAAW,CAOR,CAAC,CAAC,OAAOpC,EAAE2C,UAAUpB,GAAc,IAAZvB,EAAE4C,KAAKlD,IAAS2C,EAAE,gDACjC,IAAJ1C,IAAayC,EAAE,CAAC,GAAGA,GAAGhB,EAAEzB,EAAEyC,GAAGA,EAAEA,EAAE,KAAKA,CAAC,CAAC3C,IAAEyC,IAC/E,SCjEA,IAAIQ,EAAEnD,OAAOC,eAAmBF,EAAEC,OAAO2D,sBAA0BC,EAAE5D,OAAO6D,UAAUC,eAAeC,EAAE/D,OAAO6D,UAAUG,qBAAyBxD,EAAE,CAACL,EAAE8B,EAAEb,IAAIa,KAAK9B,EAAEgD,EAAEhD,EAAE8B,EAAE,CAACgC,YAAW,EAAG3D,cAAa,EAAG4D,UAAS,EAAG7D,MAAMe,IAC1NjB,EAAE8B,GAAGb,EAAEkB,EAAE,CAACnC,EAAE8B,KAAK,IAAI,IAAIb,KAAKa,IAAIA,EAAE,CAAE,GAAE2B,EAAE1B,KAAKD,EAAEb,IAAIZ,EAAEL,EAAEiB,EAAEa,EAAEb,IAAI,GAAGrB,EAAE,IAAI,IAAIqB,KAAKrB,EACnFkC,GAAG8B,EAAE7B,KAAKD,EAAEb,IAAIZ,EAAEL,EAAEiB,EAAEa,EAAEb,IAAI,OAAOjB,GAQhC,MAAMW,EAAE,qBAAqBqB,EAAEnC,OAAO6D,UAAUC,eAAeK,EAAE,CAACzB,SAAS,IAC9E0B,YAAW,GAAI,SAASlE,EAAEC,EAAE8B,EAAEb,EAAER,EAAE0C,EAAE,CAAE,GAAY,iBAAHA,IAAcA,EAAE,CAACZ,SAASY,IAAIA,EAAEhB,EAC/EA,EAAE,CAAA,EAAG6B,GAAGb,GAAG,MAAMZ,SAASjC,EAAE2D,WAAWC,GAAGf,EAAE,IAAIjC,EAAEkC,OAAM,IAAJtB,IAAuB,mBAAHA,EAClEZ,EAAEY,EAAEqC,MAAMC,QAAQtC,KAAKsB,EAAEtB,EAAEuC,KAAIzB,GAAGzB,OAAOyB,YAAU,IAAJ3B,IAAaA,EAAY,iBAAHA,EACpEA,EAAEO,MAAM,EAAE,IAAc,iBAAHP,EAAY,aAAaO,MAAM,EAAEP,QAAG,GAAQ,MAAMqD,EAAEhE,QAC3E,IAAJW,EAAW,EAAE,GAAG,IAAImB,EACnBF,EADqBqB,EAAE,CAAC,GAAGvD,GAAG4B,EAAE,EAAEc,EAAE,CAAC,IAAIlC,GAAE,EAAGK,EAAE,EAAEwC,EAAE,GAAGxB,EAAE,EAAEN,EAAE,GAAGwB,EAAE,KAChE1B,EAAE,IAAIkD,IAAI,IAAI,EAAE,CAAC,GAAG3C,IAAIf,EAAE,CAACQ,EAAEmD,OAAOjB,QAAO,IAAJtC,IAAa8B,EAAEM,IAAIxB,GAAGN,GAAGwB,GAAGxB,QAAO,IAAJmB,EAC1E,IAAI,IAAI7B,EAAEwC,IAAIxB,GAAGrB,EAAE6C,IAAIxB,GAAGa,EAAEW,IAAIxB,GAAGD,EAAEyB,IAAIxB,GAAG0B,EAAEF,IAAIxB,GAAG,QAAQ,CAAC,IAAIe,EAAE7B,OAAM,IAAJ2B,GACrEN,EAAEjB,OAAOS,GAAG5B,EAAEuD,EAAE3B,KAAKQ,EAAEM,EAAEd,GAAG5B,EAAEuD,EAAEnB,IAAI,IAAInC,SAASD,EAAE,IAAO,IAAJkE,GAAQlE,GAAO,WAAJC,GACjD,mBAAVD,EAAEyE,SAAmCxE,SAAdD,EAAEA,EAAEyE,OAAOrC,UAAmB,IAAJlB,IACnDjB,SADgED,EAAEkB,EAAEa,KAAKwB,EAC9EnB,EAAEpC,UAAmB,IAAJS,QAA2B,KAAdyB,EAAEzB,EAAE2B,EAAEpC,EAAEC,IAAa,OAAOA,GAAG,IAAI,SAASiC,EAAEvB,EAAEuC,KAC9ElD,GAAG0E,KAAKC,UAAU3E,GAAG,IAAIA,EAAE,IAAI,MAAM,IAAI,SAASkC,EAAE0C,SAAS5E,GAAGmB,OAAOnB,GAAG,OAC1E,MAAM,IAAI,UAAUkC,GAAM,IAAJlC,EAAO,OAAO,QAAQ,MAAM,IAAI,SAAS,GAAO,OAAJA,EAAS,CAACkC,EAAE,OACzE,KAAK,CAAC,GAAGiC,MAAMC,QAAQpE,GAAG,CAAC,MAAMc,EAAEd,EAAEyB,OAAW,IAAJX,EAAMoB,EAAE,MAAMA,EAAE,IAAIU,OAAE,EAAO7B,EAC9ED,GAAG,KAAK,CAAC,MAAMwB,OAAM,IAAJc,EAAWvD,OAAO8B,KAAK3B,GAAGoD,EAAEyB,QAAO/D,GAAGkB,EAAED,KAAK/B,EAAEc,KAAI6B,EAAEL,EAAEb,OACxE,IAD+EkB,EAC7ET,EAAE,MAAMA,EAAE,IAAIU,EAAEN,EAAEvB,EAAE4B,GAAG,MAAM,IAAI,SAAS,MAAM,IAAImC,UAAU,sFACM,QAAQ5C,OAC9E,EAAO,QAAO,IAAJQ,GAAYd,EAAE,IAAIL,GAAG,UAAS,IAAJN,IAAaM,GAAGwB,GAAGxB,QAAO,IAAJW,EAAW,OAAOA,QAC5E,IAD+EA,IACtE1B,EAAEe,GAAG,IAAIf,GAAE,EAAGqB,EAAE,IAAIN,QAAO,IAAJN,GAAYN,EAAEuC,KAAKd,GAAGsC,KAAKC,UAAUvC,GAAG,IAAIA,EAAE,KAC9E,IAAIW,GAAGpC,EAAEuC,KAAKd,GAAGsC,KAAKC,UAAUvC,GAAG,IAAIA,EAAE,KAAK,MAAMb,GAAGW,GAAGN,SAAQ,IAAJb,EAAW,CAAC,GAAGsC,EAAExB,KAC/E0B,EAAEF,EAAExB,KAAKD,EAAEyB,EAAExB,KAAKa,EAAEW,EAAExB,KAAKrB,EAAE6C,EAAExB,KAAKhB,OAAM,IAAJI,IAAaoC,EAAExB,KAAKkB,EAAEA,GAAG9B,GAAGsC,EAAEvD,EAAE4B,EAAE,EAAEc,EAAEE,EAAEpC,GAC9E,EAAGK,EAAEE,EAAEc,EAAEyC,EAAE,MAAM,IAAIS,WAAW,sDAC1BzE,MAAM,GAAGe,EAAE2D,IAAIzB,GAAG,MAAM,IAAIuB,UAAU,uCAC5CzD,EAAE4D,IAAI1B,EAAE,CAAC,OAAW,IAAJ1B,GAAO,OAAON,QAAG,CAAM,CA/BYyB,EA+BTjD,EA/Ba,OAAO,CAACG,MA+BnB,YA/B2BC,cAAa,ICapF,IAAM+E,EAAgB,aAUtB,SAASC,UAAUjF,GACjB,OAAOgF,EAAchC,KAAKhD,EAC5B,CClBA,IAAMkF,EAAyB,gBACzBC,EAAgC,WAChCC,EAAY,KACZC,EAAuB,MAiB7B,SAASC,yBAAyBtF,GAChC,OAAOA,EACJuF,QAAQL,EAAwB,IAChCK,QAAQH,EAAW,IACnBG,QAAQF,EAAsB,IAC9BE,QAAQJ,EAA+B,GAC5C,CCxBA,IAAMK,GAAiB,EACjBC,EAA0B,GAuBhC,SAASC,aAAa1F,GAA4B,IAAA2F,EAArBC,EAAOC,UAAAtE,OAAA,QAAAuE,IAAAD,UAAA,GAAAA,UAAA,QAAGC,EAC/BC,EAAMC,WAAWhG,GACjBiG,EAAMhF,OAAO8E,GACnB,GAAI/F,IAAUiG,EACZ,OAAO,EAET,IAAM/F,EAAIoF,yBAAyBtF,GAC7BqD,EAAIiC,yBAAyBW,GACnC,GAAI/F,IAAMmD,EACR,OAAO,EAGT,IAAe,KADesC,QAAlBA,EAAGC,aAAO,EAAPA,EAASM,cAAMP,IAAAA,EAAAA,EAAIH,GACb,CAAA,IAAAW,EAKbC,EAAwCD,QAA1BA,EAAGP,aAAO,EAAPA,EAASQ,sBAAcD,IAAAA,EAAAA,EAAIV,EAClD,IAAKR,UAAUjF,IACPqD,EAAE9B,QAAU6E,GACblG,EAAEmG,WAAWhD,EAAEiD,UAAU,EAAGF,IACjC,OAAO,CAEX,CACA,OAAO,CACT,CC5CA,IAAMG,EAAe,gDAUrB,SAASC,SAASxG,GAChB,OAAOuG,EAAavD,KAAKhD,EAC3B,CCJA,SAASyG,gBAAgBzG,GACvB,IAAM+F,EAAMC,WAAWhG,GACjBiG,EAAMhF,OAAO8E,GACnB,OAAI/F,IAAUiG,GAGJX,yBAAyBtF,KACzBsF,yBAAyBW,GAH1B,OAOLhB,UAAUjF,GACL,mBAEJ0G,OAAOhC,SAASqB,GAGT,IAARA,EACK,YAEF,iBALE,UAMX,CClCA,IAGMY,EAAc,WA4BlB,OAAAnH,GAPA,SAAAmH,eAAY3G,GACV,GADiBT,OAAAoH,gBApBnBlH,eAKQ,IAERA,2BAKmB,IASZ+G,SAASxG,GACZ,MAAM,IAAI4G,MAAK,2BAAAC,OAA4B7G,SAE7C8G,KAAK9G,MAAQA,CACf,GAEA,CAAA,CAAA+G,IAAA,UAAA/G,MAgBA,SAAAgH,UACE,IAAMC,EAAeR,gBAAgBK,KAAK9G,OAC1C,OAAQiH,GACN,IAAK,OAEL,IAAK,iBACH,OAAOjB,WAAWc,KAAK9G,OACzB,IAAK,mBACH,OAAOkH,OAAOJ,KAAK9G,OACrB,IAAK,WACL,IAAK,YACH,MAAM,IAAI4G,MAAM,oCAAmC,cAAAC,OACjCC,KAAK9G,MAAK6G,YAAAA,OAAWI,EAAY,KAAGJ,cAAAA,OACpCb,WAAWc,KAAK9G,SACpC,QACE,MAAM,IAAI4G,MAAM,yBAEtB,GAEA,CAAAG,IAAA,WAAA/G,MAMA,SAAAoB,WACE,OAAO0F,KAAK9G,KACd,IAIA,CA3EkB,GCUpB,SAASmH,YAAYJ,EAAK/G,GAIxB,OAAI0F,aAAa1F,EAAO,CAAEkG,QAAQ,IACzBF,WAAWhG,GAEhBiF,UAAUjF,GACLkH,OAAOlH,GAET,IAAI2G,EAAe3G,EAC5B,CCZA,SAASoH,aAAaL,EAAK/G,EAAOqH,GAChC,OAAQA,GACN,IAAK,SACH,OAAOrH,EAAMoB,WACf,IAAK,SAOH,OAAIpB,aAAiB2G,EACZ3G,EAAMoB,gBAEf,EACF,QACE,OAEN,CCnBA,IAAMkG,EAAO,CACXC,MAAO,SAAPA,MAAQC,EAAMC,GAAO,OAAKF,IAAMC,EAAMC,EAASN,YAAY,EAC3D1C,UAAW,SAAXA,UAAYzE,EAAO0H,EAAUC,GAAK,OAAKlD,EAAUzE,GAC/C,SAACW,EAAGT,GAAC,OCHT,SAAS0H,mBAAmBb,EAAK/G,EAAO6H,GACtC,OAAI7H,aAAiBqE,KAGjBrE,aAAiB8H,IAFZ7D,MAAM8D,KAAK/H,GAKhB6H,EACKA,EAAiBd,EAAK/G,GAExBA,CACT,CDRc4H,CAAmBjH,EAAGT,EAAGwH,KACnCC,EACAP,aAAa,GAGjBE,EAAKU,OAAOC,aAAe,OEhB3B,IAAMC,EAAoB,cAU1B,SAASC,SAASnI,GAChB,OAAOkI,EAAkBlF,KAAKhD,EAChC,CCFO,SAASoI,oBAAoBpI,GAA4B,IAAA2F,EAArBC,EAAOC,UAAAtE,OAAA,QAAAuE,IAAAD,UAAA,GAAAA,UAAA,QAAGC,EAC7CuC,EAASrC,WAAWhG,GACpBiH,EAAeR,gBAAgBzG,GACrC,GAAqB,SAAjBiH,EACF,OAAOoB,EAIT,IAF8B1C,QAAlBA,EAAGC,aAAO,EAAPA,EAASM,cAAMP,IAAAA,EAAAA,EAAIH,IAEF,mBAAjByB,EACb,OAAOoB,EAET,IAAMC,EAAmBrB,aAAY,EAAZA,EAAc1B,QAAQ,IAAK,KACpD,MAAM,IAAIqB,MAAM,oCAAmC,cAAAC,OAC/B7G,EAAK6G,YAAAA,OAAWyB,EAAgB,gBAAAzB,OAAewB,GACrE","x_google_ignoreList":[0,1]}
|
|
1
|
+
{"version":3,"file":"json.min.mjs","sources":["../node_modules/json-custom-numbers/parse.mjs","../node_modules/json-custom-numbers/stringify.mjs","../src/utils/is-integer.js","../src/utils/extract-significant-digits.js","../src/utils/is-number.js","../src/utils/is-safe-number.js","../src/utils/get-unsafe-reason.js","../src/utils/lossless-number.js","../src/parse-number.js","../src/format-number.js","../src/json.js","../src/collection-replacer.js","../src/utils/is-bigint.js","../src/utils/to-safe-number-or-throw.js"],"sourcesContent":["var T=Object.defineProperty;var C=(t,a)=>T(t,\"name\",{value:a,configurable:!0});/**\n * https://github.com/jawj/json-custom-numbers\n * @copyright Copyright (c) 2023 George MacKerron\n * @license MIT\n * \n * This file implements a non-recursive JSON parser that's intended to\n * precisely match native `JSON.parse` behaviour but also allow for custom\n * number parsing.\n */const v=/[^\"\\\\\\u0000-\\u001f]*/y,D=/-?(0|[1-9][0-9]*)([.][0-9]+)?([eE][-+]?[0-9]+)?|true|false|null/y,\nJ=/[ \\n\\t\\r]*$/y,X=/^.{0,32}\\n[ \\t]/,h=/[ \\n\\t\\r]*/y,j=`........................\\\n..........\"............./.............................................\\\\......\\b..\\\n..\\f........\n....\\r..\t`.split(\".\"),x=C(()=>new Uint32Array(103),\"hlArr\"),k=x(),m=x(),w=x(),$=x();\nlet i=0;for(;i<48;i++)k[i]=m[i]=w[i]=$[i]=65536;for(;i<58;i++)k[i]=(m[i]=(w[i]=($[i]=\ni-48)<<4)<<4)<<4;for(;i<65;i++)k[i]=m[i]=w[i]=$[i]=65536;for(;i<71;i++)k[i]=(m[i]=\n(w[i]=($[i]=i-55)<<4)<<4)<<4;for(;i<97;i++)k[i]=m[i]=w[i]=$[i]=65536;for(;i<103;i++)\nk[i]=(m[i]=(w[i]=($[i]=i-87)<<4)<<4)<<4;function O(t,a=\"\"){if(!(t>=0))return\"end\\\n of JSON input\";if(t>31&&t<127)return`'${a}${String.fromCharCode(t)}'`;if(t===10)\nreturn\"\\\\n\";if(t===9)return\"\\\\t\";const p=t.toString(16),y=\"0000\".slice(p.length)+\np;return(t>31?`'${a}${String.fromCharCode(t)}' or `:\"\")+`\\\\u${y}`}C(O,\"chDesc\");\nfunction R(t,a){const p=Object.keys(a),y=p.length;for(let d=0;d<y;d++){const n=p[d],\ne=t.call(a,n,a[n]);e!==void 0?a[n]=e:delete a[n]}}C(R,\"revive\");function q(t,a,p){\nconst y=p===!0?\" in array\":p===!1?\" in object\":\"\",d=t.slice(0,a),n=d.match(/[^\\n]{0,69}$/)[0],\ne=n.length<d.length?\"...\"+n:n,o=a-(d.length-e.length),u=t.slice(a),r=u.match(/[^\\n]{0,5}/)[0],\nc=r.length<u.length?r+\"...\":r,A=e+c,I=\" \".repeat(o<1?0:o-1)+\"^\";return`${y}\nAt position ${a} in JSON:\n${A}\n${I}`}C(q,\"errContext\");const N={maxDepth:1/0};function K(t,a,p,y){var U;typeof t!=\n\"string\"&&(t=String(t)),typeof a!=\"function\"&&(a=void 0);const d=y===void 0?N.maxDepth:\ntypeof y==\"number\"?y:(U=y.maxDepth)!=null?U:N.maxDepth;let n=0,e,o,u,r,c;function A(l){\nthrow new SyntaxError(l+q(t,n,u))}C(A,\"err\");function I(){A(`JSON structure too \\\ndeeply nested (current max depth: ${d})`)}C(I,\"tooDeep\");function b(l){A(`Unexpe\\\ncted ${O(e)}, expecting ${l}`)}C(b,\"expected\");function E(){const l=n-1;if(D.lastIndex=\nl,D.test(t)!==!0&&b(\"JSON value\"),n=D.lastIndex,e<102){const g=t.slice(l,n);return p?\np.call(o,r,g):+g}return e===110?null:e===116}C(E,\"word\");function S(){let l=\"\";e:\nfor(;;){v.lastIndex=n,v.test(t);const f=v.lastIndex;for(f>n&&(l+=t.slice(n,f),n=\nf),e=t.charCodeAt(n++);;){switch(e){case 34:return l;case 92:if(e=t.charCodeAt(n++),\ne===117){const s=k[t.charCodeAt(n++)]+m[t.charCodeAt(n++)]+w[t.charCodeAt(n++)]+\n$[t.charCodeAt(n++)];if(s<65536){l+=String.fromCharCode(s);break}A(\"Invalid \\\\uXX\\\nXX escape in string\")}const g=j[e];if(g!==\"\"&&g!==void 0){l+=g;break}A(`Invalid \\\nescape sequence: ${O(e,\"\\\\\")} in string`);default:e>=0||A(\"Unterminated string\"),\nA(`Invalid unescaped ${O(e)} in string`)}if(e=t.charCodeAt(n),e!==92&&e!==34)continue e;\nn++}}}C(S,\"string\");e:{do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===\n13||e===9));switch(e){case 123:d===0&&I(),o={},r=void 0,u=!1;break;case 91:d===0&&\nI(),o=[],r=0,u=!0;break;case 34:c=S();break e;default:c=E();break e}const l=d+d-\n2,f=[],g=X.test(t);let s=0;t:for(;;)if(u===!0)for(;;){g===!0&&s>2&&(h.lastIndex=\nn,h.test(t),n=h.lastIndex);do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||\ne===13||e===9));if(e===93){if(a!==void 0&&R(a,o),c=o,s===0)break e;if(o=f[--s],r=\nf[--s],u=typeof r==\"number\",u===!0){o[r++]=c;continue}else{o[r]=c;continue t}}if(r!==\n0){e!==44&&b(\"',' or ']' after value\"),g===!0&&s>2&&(h.lastIndex=n,h.test(t),n=h.\nlastIndex);do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===9))}\nswitch(e){case 34:o[r++]=S();continue;case 123:s===l&&I(),f[s++]=r,f[s++]=o,o={},\nr=void 0,u=!1;continue t;case 91:s===l&&I(),f[s++]=r,f[s++]=o,o=[],r=0;continue;default:\no[r++]=E()}}else for(;;){g===!0&&s>2&&(h.lastIndex=n,h.test(t),n=h.lastIndex);do\ne=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===9));if(e===125){if(a!==\nvoid 0&&R(a,o),c=o,s===0)break e;if(o=f[--s],r=f[--s],u=typeof r==\"number\",u===!0){\no[r++]=c;continue t}else{o[r]=c;continue}}if(r!==void 0){e!==44&&b(\"',' or '}' a\\\nfter value\"),g===!0&&s>2&&(h.lastIndex=n,h.test(t),n=h.lastIndex);do e=t.charCodeAt(\nn++);while(e<=32&&(e===32||e===10||e===13||e===9))}e!==34&&b(\"'}' or double-quot\\\ned key\"),r=S();do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===\n9));e!==58&&b(\"':' after key\");do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===\n10||e===13||e===9));switch(e){case 34:o[r]=S();continue;case 123:s===l&&I(),f[s++]=\nr,f[s++]=o,o={},r=void 0;continue;case 91:s===l&&I(),f[s++]=r,f[s++]=o,o=[],r=0,\nu=!0;continue t;default:o[r]=E()}}}return J.lastIndex=n,J.test(t)===!1&&A(\"Unexp\\\nected data after end of JSON input\"),a!==void 0&&(c={\"\":c},R(a,c),c=c[\"\"]),c}C(K,\n\"parse\");export{K as parse};\n","var E=Object.defineProperty;var T=Object.getOwnPropertySymbols;var F=Object.prototype.hasOwnProperty,V=Object.prototype.propertyIsEnumerable;var D=(t,e,i)=>e in t?E(t,e,{enumerable:!0,configurable:!0,writable:!0,value:i}):\nt[e]=i,u=(t,e)=>{for(var i in e||(e={}))F.call(e,i)&&D(t,i,e[i]);if(T)for(var i of T(\ne))V.call(e,i)&&D(t,i,e[i]);return t};var K=(t,e)=>E(t,\"name\",{value:e,configurable:!0});/**\n * https://github.com/jawj/json-custom-numbers\n * @copyright Copyright (c) 2023 George MacKerron\n * @license MIT\n * \n * This file implements a non-recursive JSON stringifier that's intended to\n * precisely match native `JSON.stringify` behaviour but also allow for custom\n * stringifying of numbers.\n */const x=/[\"\\\\\\u0000-\\u001f]/,q=Object.prototype.hasOwnProperty,z={maxDepth:5e4,\nskipToJSON:!1};function C(t,e,i,j,g={}){typeof g==\"number\"&&(g={maxDepth:g}),g=u(\nu({},z),g);const{maxDepth:J,skipToJSON:L}=g;let O,S;e!==void 0&&(typeof e==\"func\\\ntion\"?O=e:Array.isArray(e)&&(S=e.map(l=>String(l)))),i!==void 0&&(i=typeof i==\"s\\\ntring\"?i.slice(0,10):typeof i==\"number\"?\" \".slice(0,i):void 0);const P=J*\n(i===void 0?5:6);let r,s={\"\":t},d=0,c=[\"\"],h=!1,k=1,f=[],n=0,y=\"\",b=`\n`,o,p=new Set([]);do{if(d===k){p.delete(s),i!==void 0&&(b=f[--n],y+=b),y+=c===void 0?\n\"]\":\"}\",k=f[--n],h=f[--n],c=f[--n],d=f[--n],s=f[--n];continue}let l,w;c===void 0?\n(r=String(d),t=s[d]):(r=c[d],t=s[r]);let a=typeof t;if(L===!1&&t&&a===\"object\"&&\ntypeof t.toJSON==\"function\"&&(t=t.toJSON(r),a=typeof t),O!==void 0&&(t=O.call(s,\nr,t),a=typeof t),j===void 0||(o=j(r,t,a))===void 0)switch(a){case\"string\":o=x.test(\nt)?JSON.stringify(t):'\"'+t+'\"';break;case\"number\":o=isFinite(t)?String(t):\"null\";\nbreak;case\"boolean\":o=t===!0?\"true\":\"false\";break;case\"object\":if(t===null){o=\"n\\\null\";break}if(Array.isArray(t)){const m=t.length;m===0?o=\"[]\":(o=\"[\",l=void 0,w=\nm);break}const N=S===void 0?Object.keys(t):S.filter(m=>q.call(t,m)),A=N.length;A===\n0?o=\"{}\":(o=\"{\",l=N,w=A);break;case\"bigint\":throw new TypeError(\"Do not know how\\\n to serialize a BigInt: please provide a custom serializer function\");default:o=\nvoid 0}if(c===void 0?(d>0&&(y+=\",\"),i!==void 0&&(y+=b),y+=o===void 0?\"null\":o):o!==\nvoid 0&&(h?y+=\",\":h=!0,n>0&&(y+=i===void 0?(x.test(r)?JSON.stringify(r):'\"'+r+'\"')+\n\":\":b+(x.test(r)?JSON.stringify(r):'\"'+r+'\"')+\": \"),y+=o),d++,w!==void 0){if(f[n++]=\ns,f[n++]=d,f[n++]=c,f[n++]=h,f[n++]=k,i!==void 0&&(f[n++]=b,b+=i),s=t,d=0,c=l,h=\n!1,k=w,n>P)throw new RangeError(`Maximum nesting depth exceeded (current maximum\\\n is ${J})`);if(p.has(s))throw new TypeError(\"Cannot stringify circular structure\");\np.add(s)}}while(n!==0);return y||void 0}K(C,\"stringify\");export{C as stringify};\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A regular expression for testing whether a string represents an integer.\n *\n * @type {RegExp}\n * @private\n */\nconst INTEGER_REGEX = /^[+-]?\\d+$/;\n\n/**\n * Test whether a string represents an integer.\n *\n * @param value\n * The string to test.\n * @return {boolean}\n * true if the string contains an integer; false otherwise.\n */\nfunction isInteger(value) {\n return INTEGER_REGEX.test(value);\n}\n\nexport default isInteger;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\nconst EXPONENTIAL_PART_REGEX = /[eE][+-]?\\d+$/;\nconst LEADING_MINUS_AND_ZEROS_REGEX = /^-?(0*)?/;\nconst DOT_REGEX = /\\./;\nconst TRAILING_ZEROS_REGEX = /0+$/;\n\n/**\n * Get the significant digits of a number.\n *\n * For example:\n * - '2.34' returns '234'\n * - '-77' returns '77'\n * - '0.003400' returns '34'\n * - '120.5e+30' returns '1205'\n *\n * @param {string} value\n * The string representation of the number.\n * @return {string}\n * The significant digits of the number.\n * @private\n */\nfunction extractSignificantDigits(value) {\n return value\n .replace(EXPONENTIAL_PART_REGEX, '') // from \"-0.250e+30\" to \"-0.250\"\n .replace(DOT_REGEX, '') // from \"-0.250\" to \"-0250\"\n .replace(TRAILING_ZEROS_REGEX, '') // from \"-0250\" to \"-025\"\n .replace(LEADING_MINUS_AND_ZEROS_REGEX, ''); // from \"-025\" to \"25\"\n}\n\nexport default extractSignificantDigits;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A regular expression for testing whether a string represents a number.\n *\n * @type {RegExp}\n * @see http://stackoverflow.com/questions/13340717/json-numbers-regular-expression\n * @private\n */\nconst NUMBER_REGEX = /^-?(?:0|[1-9]\\d*)(?:\\.\\d+)?(?:[eE][+-]?\\d+)?$/;\n\n/**\n * Test whether a string represents a number\n *\n * @param {string} value\n * The string to test.\n * @return {boolean}\n * true if the string contains a number; false otherwise.\n */\nfunction isNumber(value) {\n return NUMBER_REGEX.test(value);\n}\n\nexport default isNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isInteger from './is-integer';\nimport extractSignificantDigits from './extract-significant-digits';\nimport isNumber from './is-number';\n\nconst DEFAULT_APPROX = false;\nconst DEFAULT_REQUIRED_DIGITS = 14;\n\n/**\n * Test whether a string can be safely represented with a number without\n * information loss.\n *\n * When the argument `approx` is true, floating point numbers that lose a few\n * digits but are still approximately equal in value are considered safe too.\n * Integer numbers must still be exactly equal.\n *\n * @param {string} value\n * The string to test.\n * @param {object} options\n * The options of the test. It may contain the following properties:\n * - `approx: boolean`: indicates whether to consider approximately equal\n * floating point numbers as safe. Default is `false`.\n * - `requiredDigits: number`: the number of significant digits required for\n * a floating point number to be considered approximately equal. Default\n * is `14`.\n * @return {boolean}\n * true if the string can be safely represented with a number; false\n * otherwise.\n */\nfunction isSafeNumber(value, options = undefined) {\n // handle the edge cases\n if (!isNumber(value) || value === '' || value === 'NaN') {\n return false;\n }\n\n const num = parseFloat(value);\n const str = String(num);\n if (value === str) {\n return true;\n }\n const v = extractSignificantDigits(value);\n const s = extractSignificantDigits(str);\n if (v === s) {\n return true;\n }\n\n // use the default options\n const approx = options?.approx ?? DEFAULT_APPROX;\n if (!approx) {\n return false;\n }\n\n // A value is approximately equal when:\n // 1. it is a floating point number, not an integer\n // 2. both v and s have at least requiredDigits digits\n // 3. the first requiredDigits digits are equal\n const requiredDigits = options?.requiredDigits ?? DEFAULT_REQUIRED_DIGITS;\n\n // check if the value is an integer\n const isIntegerVal = isInteger(value);\n if (isIntegerVal) {\n return true; // when the input is an integer and approx=true, return true\n }\n\n // check if s has at least requiredDigits digits\n const sLengthOk = s.length >= requiredDigits;\n if (!sLengthOk) {\n return false;\n }\n\n // check if v has at least requiredDigits digits\n const vLengthOk = v.length >= requiredDigits;\n\n if (vLengthOk) {\n // check if the first requiredDigits digits are equal\n const vPrefix = v.substring(0, requiredDigits);\n const sPrefix = s.substring(0, requiredDigits);\n return vPrefix === sPrefix;\n } else {\n // if v length is not enough, return true\n return true;\n }\n}\n\nexport {\n DEFAULT_APPROX,\n DEFAULT_REQUIRED_DIGITS,\n isSafeNumber,\n};\n\nexport default isSafeNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isInteger from './is-integer';\nimport extractSignificantDigits from './extract-significant-digits';\n\n/**\n * When the provided value is an unsafe number, describe what the reason is\n * - `'overflow'`\n * - `'underflow'`\n * - `'truncate_integer'`\n * - `'truncate_float'`\n * - `'none'` (when the value is safe)\n *\n * @param {string} value\n * The string represents a number to test.\n * @return {string}\n * The reason why the value is unsafe. Returns `'none'` when the value is safe.\n */\nfunction getUnsafeReason(value) {\n const num = parseFloat(value);\n const str = String(num);\n if (value === str) {\n return 'none';\n }\n const v = extractSignificantDigits(value);\n const s = extractSignificantDigits(str);\n if (v === s) {\n return 'none';\n }\n if (isInteger(value)) {\n return 'truncate_integer';\n }\n if (!Number.isFinite(num)) {\n return 'overflow';\n }\n if (num === 0) {\n return 'underflow';\n }\n return 'truncate_float';\n}\n\nexport default getUnsafeReason;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isNumber from './is-number';\nimport getUnsafeReason from './get-unsafe-reason';\n\n/**\n * The class of lossless numbers, which stores its numeric value as string.\n */\nclass LosslessNumber {\n /**\n * The string representation of the number.\n *\n * @type {string}\n */\n value = '';\n\n /**\n * Whether the value is a lossless number.\n *\n * @type {boolean}\n */\n isLosslessNumber = true;\n\n /**\n * Constructs a new instance of `LosslessNumber`.\n *\n * @param {string} value\n * The string representation of the number.\n */\n constructor(value) {\n if (!isNumber(value)) {\n throw new Error(`Invalid number (value: \"${value}\")`);\n }\n this.value = value;\n }\n\n /**\n * Get the value of the LosslessNumber as number or bigint.\n *\n * - a number is returned for safe numbers and decimal values that only lose\n * some insignificant digits;\n * - a bigint is returned for big integer numbers;\n * - an Error is thrown for values that will overflow or underflow;\n *\n * Note that you can implement your own strategy for conversion by just\n * getting the value as string via `.toString()`, and using util functions\n * like `isInteger`, `isSafeNumber`, `getUnsafeReason`, and `toSafeNumberOrThrow`\n * to convert it to a numeric value.\n *\n * @return {number|bigint}\n * the numeric value of the LosslessNumber, as number or bigint.\n */\n valueOf() {\n const unsafeReason = getUnsafeReason(this.value);\n switch (unsafeReason) {\n case 'none':\n return parseFloat(this.value);\n case 'truncate_float':\n return parseFloat(this.value);\n case 'truncate_integer':\n return BigInt(this.value);\n case 'overflow':\n case 'underflow':\n throw new Error('Cannot safely CONVERT TO NUMBER: '\n + `the value '${this.value}' would ${unsafeReason} `\n + `and become ${parseFloat(this.value)}`);\n default:\n throw new Error('Unknown unsafe reason');\n }\n }\n\n /**\n * Get the value of this `LosslessNumber` as string.\n *\n * @return {string}\n * the string representation of this `LosslessNumber`.\n */\n toString() {\n return this.value;\n }\n\n // Note: we do NOT implement a .toJSON() method, and you should not implement\n // or use that, it cannot safely turn the numeric value in the string into\n // stringified JSON since it has to be parsed into a number first.\n}\n\nexport default LosslessNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport isInteger from './utils/is-integer';\nimport isSafeNumber from './utils/is-safe-number';\nimport LosslessNumber from './utils/lossless-number';\n\n/**\n * A custom function to parse a number from a string, which supports lossless\n * number parsing.\n *\n * @param {string} key\n * The key of the property.\n * @param {string} value\n * The value of the property.\n * @return {any}\n * The parsed value.\n * @private\n */\nfunction parseNumber(key, value) {\n // if (isBigInt(value)) {\n // return BigInt(value.slice(0, -1));\n // }\n if (isSafeNumber(value, { approx: false })) {\n return parseFloat(value);\n }\n if (isInteger(value)) {\n return BigInt(value);\n }\n return new LosslessNumber(value);\n}\n\nexport default parseNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport LosslessNumber from './utils/lossless-number';\n\n/**\n * Formats a number value.\n *\n * @param {string} key\n * The key of the property.\n * @param {string} value\n * The value of the property.\n * @param {string} type\n * The type of the value.\n * @return {undefined|string}\n * The formatted value. If the value is not a number, then return undefined.\n * @private\n */\nfunction formatNumber(key, value, type) {\n switch (type) {\n case 'bigint':\n return value.toString();\n case 'object':\n // if (value instanceof Set) {\n // return Array.from(value);\n // }\n // if (value instanceof Map) {\n // return Array.from(value);\n // }\n if (value instanceof LosslessNumber) {\n return value.toString();\n }\n return undefined;\n default:\n return undefined;\n }\n}\n\nexport default formatNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport { parse, stringify } from 'json-custom-numbers';\nimport parseNumber from './parse-number';\nimport formatNumber from './format-number';\nimport collectionReplacer from './collection-replacer';\n\n/**\n * A customized JSON object which supports lossless number parsing and stringifying.\n *\n * This object provides two methods: `parse` and `stringify`, which are the same as the\n * `JSON.parse` and `JSON.stringify` methods, except that they support lossless number\n * parsing and stringifying.\n *\n * @type {object}\n */\nconst json = {\n parse: (text, reviver) => parse(text, reviver, parseNumber),\n stringify: (value, replacer, space) => stringify(value,\n (k, v) => collectionReplacer(k, v, replacer),\n space,\n formatNumber),\n};\n\njson[Symbol.toStringTag] = 'JSON';\n\nexport default json;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A JSON replacer which serialize collections as arrays.\n *\n * @param {string} key\n * The key of the property.\n * @param {any} value\n * The value of the property.\n * @param {undefined|null|function} fallbackReplacer\n * The fallback replacer.\n * @return {any}\n * The serialized value.\n * @private\n */\nfunction collectionReplacer(key, value, fallbackReplacer) {\n if (value instanceof Set) {\n return Array.from(value);\n }\n if (value instanceof Map) {\n return Array.from(value);\n }\n if (fallbackReplacer) {\n return fallbackReplacer(key, value);\n }\n return value;\n}\n\nexport default collectionReplacer;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\n/**\n * A regular expression for testing whether a string represents a BigInt.\n *\n * @type {RegExp}\n * @private\n */\nconst BIG_INTEGER_REGEX = /^[+-]?\\d+n$/;\n\n/**\n * Test whether a string represents a BigInt.\n *\n * @param value\n * The string to test.\n * @return {boolean}\n * true if the string contains a BigInt; false otherwise.\n */\nfunction isBigInt(value) {\n return BIG_INTEGER_REGEX.test(value);\n}\n\nexport default isBigInt;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2024.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport getUnsafeReason from './get-unsafe-reason';\nimport { DEFAULT_APPROX } from './is-safe-number';\n\n/**\n * Convert a string into a number when it is safe to do so.\n * Throws an error otherwise, explaining the reason.\n *\n * @param {string} value\n * The string to convert into a number.\n * @param {object} options\n * The options for conversion.\n * @return {number}\n * The converted safe number.\n * @throws {Error}\n * When the value is not safe to convert.\n */\nexport function toSafeNumberOrThrow(value, options = undefined) {\n const number = parseFloat(value);\n const unsafeReason = getUnsafeReason(value);\n if (unsafeReason === 'none') {\n return number;\n }\n const approx = options?.approx ?? DEFAULT_APPROX;\n // when approx is true, we allow truncating float values\n if (approx && (unsafeReason === 'truncate_float')) {\n return number;\n }\n const unsafeReasonText = unsafeReason?.replace(/_/, ' ');\n throw new Error('Cannot safely convert to number: '\n + `the value '${value}' would ${unsafeReasonText} and become ${number}`);\n}\n\nexport default toSafeNumberOrThrow;\n"],"names":["_classCallCheck","_createClass","_defineProperty","T","Object","defineProperty","C","t","a","value","configurable","v","D","J","X","h","j","split","x","Uint32Array","k","m","w","$","i","O","String","fromCharCode","p","toString","y","slice","length","R","keys","d","n","e","call","q","match","o","u","r","repeat","N","maxDepth","K","U","c","A","l","SyntaxError","I","b","E","lastIndex","test","g","S","f","charCodeAt","s","getOwnPropertySymbols","F","prototype","hasOwnProperty","V","propertyIsEnumerable","enumerable","writable","z","skipToJSON","L","Array","isArray","map","P","Set","delete","toJSON","JSON","stringify","isFinite","filter","TypeError","RangeError","has","add","INTEGER_REGEX","isInteger","EXPONENTIAL_PART_REGEX","LEADING_MINUS_AND_ZEROS_REGEX","DOT_REGEX","TRAILING_ZEROS_REGEX","extractSignificantDigits","replace","NUMBER_REGEX","isNumber","DEFAULT_APPROX","isSafeNumber","_options$approx","_options$requiredDigi","options","arguments","undefined","num","parseFloat","str","approx","requiredDigits","substring","getUnsafeReason","Number","LosslessNumber","Error","concat","this","key","valueOf","unsafeReason","BigInt","parseNumber","formatNumber","type","json","parse","text","reviver","replacer","space","collectionReplacer","fallbackReplacer","Map","from","Symbol","toStringTag","BIG_INTEGER_REGEX","isBigInt","toSafeNumberOrThrow","number","unsafeReasonText"],"mappings":"OAAAA,MAAA,+CAAAC,MAAA,4CAAAC,MAAA,wCAAA,IAAIC,EAAEC,OAAOC,eAAmBC,IAAE,CAACC,EAAEC,IAAIL,EAAEI,EAAE,OAAO,CAACE,MAAMD,EAAEE,cAAa,IAQvE,MAAMC,EAAE,wBAAwBC,EAAE,mEACrCC,EAAE,eAAeC,EAAE,kBAAkBC,EAAE,cAAcC,EAAE,qIAG5CC,MAAM,KAAKC,EAAEZ,KAAE,IAAI,IAAIa,YAAY,MAAK,SAASC,EAAEF,IAAIG,EAAEH,IAAII,EAAEJ,IAAIK,EAAEL,IAChF,IAAIM,EAAE,EAAE,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,GAAGH,EAAEG,GAAGF,EAAEE,GAAGD,EAAEC,GAAG,MAAM,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,IAAIH,EAAEG,IAAIF,EAAEE,IAAID,EAAEC,GAClFA,EAAE,KAAK,IAAI,IAAI,EAAE,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,GAAGH,EAAEG,GAAGF,EAAEE,GAAGD,EAAEC,GAAG,MAAM,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,IAAIH,EAAEG,IAC9EF,EAAEE,IAAID,EAAEC,GAAGA,EAAE,KAAK,IAAI,IAAI,EAAE,KAAKA,EAAE,GAAGA,IAAIJ,EAAEI,GAAGH,EAAEG,GAAGF,EAAEE,GAAGD,EAAEC,GAAG,MAAM,KAAKA,EAAE,IAAIA,IAChFJ,EAAEI,IAAIH,EAAEG,IAAIF,EAAEE,IAAID,EAAEC,GAAGA,EAAE,KAAK,IAAI,IAAI,EAAE,SAASC,EAAElB,EAAEC,EAAE,IAAI,KAAKD,GAAG,GAAG,MAAM,oBAC5D,GAAGA,EAAE,IAAIA,EAAE,IAAI,MAAM,IAAIC,IAAIkB,OAAOC,aAAapB,MAAM,GAAO,KAAJA,EAC1E,MAAM,MAAM,GAAO,IAAJA,EAAM,MAAM,MAAM,MAAMqB,EAAErB,EAAEsB,SAAS,IAAIC,EAAE,OAAOC,MAAMH,EAAEI,QACzEJ,EAAE,OAAOrB,EAAE,GAAG,IAAIC,IAAIkB,OAAOC,aAAapB,UAAU,IAAI,MAAMuB,GAAG,CACjE,SAASG,EAAE1B,EAAEC,GAAG,MAAMoB,EAAExB,OAAO8B,KAAK1B,GAAGsB,EAAEF,EAAEI,OAAO,IAAI,IAAIG,EAAE,EAAEA,EAAEL,EAAEK,IAAI,CAAC,MAAMC,EAAER,EAAEO,GACjFE,EAAE9B,EAAE+B,KAAK9B,EAAE4B,EAAE5B,EAAE4B,SAAQ,IAAJC,EAAW7B,EAAE4B,GAAGC,SAAS7B,EAAE4B,EAAE,CAAC,CAAe,SAASG,IAAEhC,EAAEC,EAAEoB,GAC/E,MAAME,GAAM,IAAJF,EAAO,aAAgB,IAAJA,EAAO,aAAa,GAAGO,EAAE5B,EAAEwB,MAAM,EAAEvB,GAAG4B,EAAED,EAAEK,MAAM,gBAAgB,GAC3FH,EAAED,EAAEJ,OAAOG,EAAEH,OAAO,MAAMI,EAAEA,EAAEK,EAAEjC,GAAG2B,EAAEH,OAAOK,EAAEL,QAAQU,EAAEnC,EAAEwB,MAAMvB,GAAGmC,EAAED,EAAEF,MAAM,cAAc,GAC3B,MAAM,GAAGV,kBAC3DtB,eADkB6B,GAA9BM,EAAEX,OAAOU,EAAEV,OAAOW,EAAE,MAAMA,OAAU,IAAIC,OAAOH,EAAE,EAAE,EAAEA,EAAE,GAAG,KAGvD,CAR6DnC,IAAEmB,EAAE,UAEpBnB,IAAE2B,EAAE,UAMhD3B,IAAEiC,IAAE,cAAc,MAAMM,EAAE,CAACC,SAAS,KAAK,SAASC,IAAExC,EAAEC,EAAEoB,EAAEE,GAAG,IAAIkB,EACvE,iBADgFzC,IACrEA,EAAEmB,OAAOnB,IAAc,mBAAHC,IAAgBA,OAAE,GAAQ,MAAM2B,OAAM,IAAJL,EAAWe,EAAEC,SACpE,iBAAHhB,EAAYA,EAAkB,OAAfkB,EAAElB,EAAEgB,UAAgBE,EAAEH,EAAEC,SAAS,IAAQT,EAAEI,EAAEC,EAAEC,EAAEM,EAAZb,EAAE,EAAY,SAASc,EAAEC,GACpF,MAAM,IAAIC,YAAYD,EAAEZ,IAAEhC,EAAE6B,EAAEM,GAAG,CAAY,SAASW,IAAIH,EAAE,wDACxBf,KAAK,CAAgB,SAASmB,EAAEH,GAAGD,EAAE,cAClEzB,EAAEY,iBAAiBc,IAAI,CAAiB,SAASI,IAAI,MAAMJ,EAAEf,EAAE,EAAE,GAAGxB,EAAE4C,UAC7EL,GAAc,IAAZvC,EAAE6C,KAAKlD,IAAS+C,EAAE,cAAclB,EAAExB,EAAE4C,UAAUnB,EAAE,IAAI,CAAC,MAAMqB,EAAEnD,EAAEwB,MAAMoB,EAAEf,GAAG,OAAOR,EACnFA,EAAEU,KAAKG,EAAEE,EAAEe,IAAIA,CAAC,CAAC,OAAW,MAAJrB,EAAQ,KAAS,MAAJA,CAAO,CAAa,SAASsB,IAAI,IAAIR,EAAE,GAAGd,EAC/E,OAAO,CAAC1B,EAAE6C,UAAUpB,EAAEzB,EAAE8C,KAAKlD,GAAG,MAAMqD,EAAEjD,EAAE6C,UAAU,IAAII,EAAExB,IAAIe,GAAG5C,EAAEwB,MAAMK,EAAEwB,GAAGxB,EAC9EwB,GAAGvB,EAAE9B,EAAEsD,WAAWzB,OAAO,CAAC,OAAOC,GAAG,KAAK,GAAG,OAAOc,EAAE,KAAK,GAAG,GAAGd,EAAE9B,EAAEsD,WAAWzB,KAC3E,MAAJC,EAAQ,CAAC,MAAMyB,EAAE1C,EAAEb,EAAEsD,WAAWzB,MAAMf,EAAEd,EAAEsD,WAAWzB,MAAMd,EAAEf,EAAEsD,WAAWzB,MAC1Eb,EAAEhB,EAAEsD,WAAWzB,MAAM,GAAG0B,EAAE,MAAM,CAACX,GAAGzB,OAAOC,aAAamC,GAAG,KAAK,CAACZ,EAAE,mCAC9C,CAAC,MAAMQ,EAAE1C,EAAEqB,GAAG,GAAO,KAAJqB,QAAY,IAAJA,EAAW,CAACP,GAAGO,EAAE,KAAK,CAACR,EAAE,4BACpDzB,EAAEY,EAAE,mBAAmB,QAAQA,GAAG,GAAGa,EAAE,uBAC1DA,EAAE,qBAAqBzB,EAAEY,gBAAgB,GAAGA,EAAE9B,EAAEsD,WAAWzB,GAAO,KAAJC,GAAY,KAAJA,EAAO,SAASA,EACtFD,GAAG,CAAC,CAAC,CAZ6B9B,IAAE4C,EAAE,OACI5C,IAAE+C,EAAE,WACf/C,IAAEgD,EAAE,YAEUhD,IAAEiD,EAAE,QAQ3CjD,IAAEqD,EAAE,UAAUtB,EAAE,CAAC,GAAGA,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GACpE,KAD4EA,GACpE,IAAJA,IAAQ,OAAOA,GAAG,KAAK,IAAQ,IAAJF,GAAOkB,IAAIZ,EAAE,CAAE,EAACE,OAAE,EAAOD,GAAE,EAAG,MAAM,KAAK,GAAO,IAAJP,GAC3EkB,IAAIZ,EAAE,GAAGE,EAAE,EAAED,GAAE,EAAG,MAAM,KAAK,GAAGO,EAAEU,IAAI,MAAMtB,EAAE,QAAQY,EAAEM,IAAI,MAAMlB,EAAE,MAAMc,EAAEhB,EAAEA,EAC9E,EAAEyB,EAAE,GAAGF,EAAE5C,EAAE2C,KAAKlD,GAAG,IAAIuD,EAAE,EAAEvD,EAAE,OAAO,IAAO,IAAJmC,EAAO,OAAO,EAAK,IAAJgB,GAAQI,EAAE,IAAI/C,EAAEyC,UACtEpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAAEyC,WAAW,GAAGnB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GACpE,KAAJA,GAAY,IAAJA,IAAQ,GAAO,KAAJA,EAAO,CAAC,QAAO,IAAJ7B,GAAYyB,EAAEzB,EAAEiC,GAAGQ,EAAER,EAAM,IAAJqB,EAAM,MAAMzB,EAAE,GAAGI,EAAEmB,IAAIE,GAAGnB,EAC/EiB,IAAIE,GAAGpB,EAAY,iBAAHC,GAAgB,IAAJD,EAAO,CAACD,EAAEE,KAAKM,EAAE,QAAQ,CAAMR,EAAEE,GAAGM,EAAE,SAAS1C,CAAE,CAAC,GAC9E,IADiFoC,EAC/E,CAAK,KAAJN,GAAQiB,EAAE,2BAA8B,IAAJI,GAAQI,EAAE,IAAI/C,EAAEyC,UAAUpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAC/EyC,WAAW,GAAGnB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GAAY,IAAJA,GAAO,CAC/E,OAAOA,GAAG,KAAK,GAAGI,EAAEE,KAAKgB,IAAI,SAAS,KAAK,IAAIG,IAAIX,GAAGE,IAAIO,EAAEE,KAAKnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,CAAE,EAChFE,OAAE,EAAOD,GAAE,EAAG,SAASnC,EAAE,KAAK,GAAGuD,IAAIX,GAAGE,IAAIO,EAAEE,KAAKnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,GAAGE,EAAE,EAAE,SAAS,QAChFF,EAAEE,KAAKY,IAAI,MAAM,OAAO,EAAK,IAAJG,GAAQI,EAAE,IAAI/C,EAAEyC,UAAUpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAAEyC,WAAW,GAC9EnB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GAAY,IAAJA,IAAQ,GAAO,MAAJA,EAAH,CAExB,QAAO,IAAJM,EAAW,CAAK,KAAJN,GAAQiB,EAAE,2BAClD,IAAJI,GAAQI,EAAE,IAAI/C,EAAEyC,UAAUpB,EAAErB,EAAE0C,KAAKlD,GAAG6B,EAAErB,EAAEyC,WAAW,GAAGnB,EAAE9B,EAAEsD,WACzEzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GAAY,IAAJA,GAAO,CAAK,KAAJA,GAAQiB,EAAE,4BACpDX,EAAEgB,IAAI,GAAGtB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GAAY,KAAJA,GAAY,KAAJA,GACpE,IAD4EA,IACpE,KAAJA,GAAQiB,EAAE,iBAAiB,GAAGjB,EAAE9B,EAAEsD,WAAWzB,WAAWC,GAAG,KAAS,KAAJA,GACpE,KAD4EA,GACpE,KAAJA,GAAY,IAAJA,IAAQ,OAAOA,GAAG,KAAK,GAAGI,EAAEE,GAAGgB,IAAI,SAAS,KAAK,IAAIG,IAAIX,GAAGE,IAAIO,EAAEE,KAC9EnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,GAAGE,OAAE,EAAO,SAAS,KAAK,GAAGmB,IAAIX,GAAGE,IAAIO,EAAEE,KAAKnB,EAAEiB,EAAEE,KAAKrB,EAAEA,EAAE,GAAGE,EAAE,EAC9ED,GAAE,EAAG,SAASnC,EAAE,QAAQkC,EAAEE,GAAGY,IAPY,KAFyB,CAAY,QAC9E,IADiF/C,GACzEyB,EAAEzB,EAAEiC,GAAGQ,EAAER,EAAM,IAAJqB,EAAM,MAAMzB,EAAE,GAAGI,EAAEmB,IAAIE,GAAGnB,EAAEiB,IAAIE,GAAGpB,EAAY,iBAAHC,GAAgB,IAAJD,EAAO,CAClFD,EAAEE,KAAKM,EAAE,SAAS1C,CAAC,CAAMkC,EAAEE,GAAGM,CAAW,CAOR,CAAC,CAAC,OAAOpC,EAAE2C,UAAUpB,GAAc,IAAZvB,EAAE4C,KAAKlD,IAAS2C,EAAE,gDACjC,IAAJ1C,IAAayC,EAAE,CAAC,GAAGA,GAAGhB,EAAEzB,EAAEyC,GAAGA,EAAEA,EAAE,KAAKA,CAAC,CAAC3C,IAAEyC,IAC/E,SCjEA,IAAIQ,EAAEnD,OAAOC,eAAmBF,EAAEC,OAAO2D,sBAA0BC,EAAE5D,OAAO6D,UAAUC,eAAeC,EAAE/D,OAAO6D,UAAUG,qBAAyBxD,EAAE,CAACL,EAAE8B,EAAEb,IAAIa,KAAK9B,EAAEgD,EAAEhD,EAAE8B,EAAE,CAACgC,YAAW,EAAG3D,cAAa,EAAG4D,UAAS,EAAG7D,MAAMe,IAC1NjB,EAAE8B,GAAGb,EAAEkB,EAAE,CAACnC,EAAE8B,KAAK,IAAI,IAAIb,KAAKa,IAAIA,EAAE,CAAE,GAAE2B,EAAE1B,KAAKD,EAAEb,IAAIZ,EAAEL,EAAEiB,EAAEa,EAAEb,IAAI,GAAGrB,EAAE,IAAI,IAAIqB,KAAKrB,EACnFkC,GAAG8B,EAAE7B,KAAKD,EAAEb,IAAIZ,EAAEL,EAAEiB,EAAEa,EAAEb,IAAI,OAAOjB,GAQhC,MAAMW,EAAE,qBAAqBqB,EAAEnC,OAAO6D,UAAUC,eAAeK,EAAE,CAACzB,SAAS,IAC9E0B,YAAW,GAAI,SAASlE,EAAEC,EAAE8B,EAAEb,EAAER,EAAE0C,EAAE,CAAA,GAAc,iBAAHA,IAAcA,EAAE,CAACZ,SAASY,IAAIA,EAAEhB,EAC/EA,EAAE,CAAA,EAAG6B,GAAGb,GAAG,MAAMZ,SAASjC,EAAE2D,WAAWC,GAAGf,EAAE,IAAIjC,EAAEkC,OAAM,IAAJtB,IAAuB,mBAAHA,EAClEZ,EAAEY,EAAEqC,MAAMC,QAAQtC,KAAKsB,EAAEtB,EAAEuC,KAAIzB,GAAGzB,OAAOyB,YAAU,IAAJ3B,IAAaA,EAAY,iBAAHA,EACpEA,EAAEO,MAAM,EAAE,IAAc,iBAAHP,EAAY,aAAaO,MAAM,EAAEP,QAAG,GAAQ,MAAMqD,EAAEhE,QAC3E,IAAJW,EAAW,EAAE,GAAG,IAAImB,EACnBF,EADqBqB,EAAE,CAAC,GAAGvD,GAAG4B,EAAE,EAAEc,EAAE,CAAC,IAAIlC,GAAE,EAAGK,EAAE,EAAEwC,EAAE,GAAGxB,EAAE,EAAEN,EAAE,GAAGwB,EAAE,KAChE1B,EAAE,IAAIkD,IAAI,IAAI,EAAE,CAAC,GAAG3C,IAAIf,EAAE,CAACQ,EAAEmD,OAAOjB,QAAO,IAAJtC,IAAa8B,EAAEM,IAAIxB,GAAGN,GAAGwB,GAAGxB,QAAO,IAAJmB,EAC1E,IAAI,IAAI7B,EAAEwC,IAAIxB,GAAGrB,EAAE6C,IAAIxB,GAAGa,EAAEW,IAAIxB,GAAGD,EAAEyB,IAAIxB,GAAG0B,EAAEF,IAAIxB,GAAG,QAAQ,CAAC,IAAIe,EAAE7B,OAAM,IAAJ2B,GACrEN,EAAEjB,OAAOS,GAAG5B,EAAEuD,EAAE3B,KAAKQ,EAAEM,EAAEd,GAAG5B,EAAEuD,EAAEnB,IAAI,IAAInC,SAASD,EAAE,IAAO,IAAJkE,GAAQlE,GAAO,WAAJC,GACjD,mBAAVD,EAAEyE,SAAmCxE,SAAdD,EAAEA,EAAEyE,OAAOrC,UAAmB,IAAJlB,IACnDjB,SADgED,EAAEkB,EAAEa,KAAKwB,EAC9EnB,EAAEpC,UAAmB,IAAJS,QAA2B,KAAdyB,EAAEzB,EAAE2B,EAAEpC,EAAEC,IAAa,OAAOA,GAAG,IAAI,SAASiC,EAAEvB,EAAEuC,KAC9ElD,GAAG0E,KAAKC,UAAU3E,GAAG,IAAIA,EAAE,IAAI,MAAM,IAAI,SAASkC,EAAE0C,SAAS5E,GAAGmB,OAAOnB,GAAG,OAC1E,MAAM,IAAI,UAAUkC,GAAM,IAAJlC,EAAO,OAAO,QAAQ,MAAM,IAAI,SAAS,GAAO,OAAJA,EAAS,CAACkC,EAAE,OACzE,KAAK,CAAC,GAAGiC,MAAMC,QAAQpE,GAAG,CAAC,MAAMc,EAAEd,EAAEyB,OAAW,IAAJX,EAAMoB,EAAE,MAAMA,EAAE,IAAIU,OAAE,EAAO7B,EAC9ED,GAAG,KAAK,CAAC,MAAMwB,OAAM,IAAJc,EAAWvD,OAAO8B,KAAK3B,GAAGoD,EAAEyB,QAAO/D,GAAGkB,EAAED,KAAK/B,EAAEc,KAAI6B,EAAEL,EAAEb,OACxE,IAD+EkB,EAC7ET,EAAE,MAAMA,EAAE,IAAIU,EAAEN,EAAEvB,EAAE4B,GAAG,MAAM,IAAI,SAAS,MAAM,IAAImC,UAAU,sFACM,QAAQ5C,OAC9E,EAAO,QAAO,IAAJQ,GAAYd,EAAE,IAAIL,GAAG,UAAS,IAAJN,IAAaM,GAAGwB,GAAGxB,QAAO,IAAJW,EAAW,OAAOA,QAC5E,IAD+EA,IACtE1B,EAAEe,GAAG,IAAIf,GAAE,EAAGqB,EAAE,IAAIN,QAAO,IAAJN,GAAYN,EAAEuC,KAAKd,GAAGsC,KAAKC,UAAUvC,GAAG,IAAIA,EAAE,KAC9E,IAAIW,GAAGpC,EAAEuC,KAAKd,GAAGsC,KAAKC,UAAUvC,GAAG,IAAIA,EAAE,KAAK,MAAMb,GAAGW,GAAGN,SAAQ,IAAJb,EAAW,CAAC,GAAGsC,EAAExB,KAC/E0B,EAAEF,EAAExB,KAAKD,EAAEyB,EAAExB,KAAKa,EAAEW,EAAExB,KAAKrB,EAAE6C,EAAExB,KAAKhB,OAAM,IAAJI,IAAaoC,EAAExB,KAAKkB,EAAEA,GAAG9B,GAAGsC,EAAEvD,EAAE4B,EAAE,EAAEc,EAAEE,EAAEpC,GAC9E,EAAGK,EAAEE,EAAEc,EAAEyC,EAAE,MAAM,IAAIS,WAAW,sDAC1BzE,MAAM,GAAGe,EAAE2D,IAAIzB,GAAG,MAAM,IAAIuB,UAAU,uCAC5CzD,EAAE4D,IAAI1B,EAAE,CAAC,OAAW,IAAJ1B,GAAO,OAAON,QAAG,CAAM,CA/BYyB,EA+BTjD,EA/Ba,OAAO,CAACG,MA+BnB,YA/B2BC,cAAa,ICapF,IAAM+E,EAAgB,aAUtB,SAASC,UAAUjF,GACjB,OAAOgF,EAAchC,KAAKhD,EAC5B,CClBA,IAAMkF,EAAyB,gBACzBC,EAAgC,WAChCC,EAAY,KACZC,EAAuB,MAiB7B,SAASC,yBAAyBtF,GAChC,OAAOA,EACJuF,QAAQL,EAAwB,IAChCK,QAAQH,EAAW,IACnBG,QAAQF,EAAsB,IAC9BE,QAAQJ,EAA+B,GAC5C,CCnBA,IAAMK,EAAe,gDAUrB,SAASC,SAASzF,GAChB,OAAOwF,EAAaxC,KAAKhD,EAC3B,CChBA,IAAM0F,GAAiB,EAwBvB,SAASC,aAAa3F,GAA4B,IAAA4F,EAAAC,EAArBC,EAAOC,UAAAxE,OAAA,QAAAyE,IAAAD,UAAA,GAAAA,UAAA,QAAGC,EAErC,IAAKP,SAASzF,IAAoB,KAAVA,GAA0B,QAAVA,EACtC,OAAO,EAGT,IAAMiG,EAAMC,WAAWlG,GACjBmG,EAAMlF,OAAOgF,GACnB,GAAIjG,IAAUmG,EACZ,OAAO,EAET,IAAMjG,EAAIoF,yBAAyBtF,GAC7BqD,EAAIiC,yBAAyBa,GACnC,GAAIjG,IAAMmD,EACR,OAAO,EAKT,KAD8BuC,QAAlBA,EAAGE,aAAO,EAAPA,EAASM,cAAMR,IAAAA,EAAAA,EAAIF,GAEhC,OAAO,EAOT,IAAMW,EAAwCR,QAA1BA,EAAGC,aAAO,EAAPA,EAASO,sBAAcR,IAAAA,EAAAA,EAlDhB,GAsD9B,QADqBZ,UAAUjF,IAMbqD,EAAE9B,QAAU8E,MAMZnG,EAAEqB,QAAU8E,IAIZnG,EAAEoG,UAAU,EAAGD,KACfhD,EAAEiD,UAAU,EAAGD,GAMnC,CCjEA,SAASE,gBAAgBvG,GACvB,IAAMiG,EAAMC,WAAWlG,GACjBmG,EAAMlF,OAAOgF,GACnB,OAAIjG,IAAUmG,GAGJb,yBAAyBtF,KACzBsF,yBAAyBa,GAH1B,OAOLlB,UAAUjF,GACL,mBAEJwG,OAAO9B,SAASuB,GAGT,IAARA,EACK,YAEF,iBALE,UAMX,CClCA,IAGMQ,EAAc,WA4BlB,OAAAjH,GAPA,SAAAiH,eAAYzG,GACV,GADiBT,OAAAkH,gBApBnBhH,eAKQ,IAERA,2BAKmB,IASZgG,SAASzF,GACZ,MAAM,IAAI0G,MAAK,2BAAAC,OAA4B3G,SAE7C4G,KAAK5G,MAAQA,CACf,GAEA,CAAA,CAAA6G,IAAA,UAAA7G,MAgBA,SAAA8G,UACE,IAAMC,EAAeR,gBAAgBK,KAAK5G,OAC1C,OAAQ+G,GACN,IAAK,OAEL,IAAK,iBACH,OAAOb,WAAWU,KAAK5G,OACzB,IAAK,mBACH,OAAOgH,OAAOJ,KAAK5G,OACrB,IAAK,WACL,IAAK,YACH,MAAM,IAAI0G,MAAM,oCAAmC,cAAAC,OACjCC,KAAK5G,MAAK2G,YAAAA,OAAWI,EAAY,KAAGJ,cAAAA,OACpCT,WAAWU,KAAK5G,SACpC,QACE,MAAM,IAAI0G,MAAM,yBAEtB,GAEA,CAAAG,IAAA,WAAA7G,MAMA,SAAAoB,WACE,OAAOwF,KAAK5G,KACd,IAIA,CA3EkB,GCUpB,SAASiH,YAAYJ,EAAK7G,GAIxB,OAAI2F,aAAa3F,EAAO,CAAEoG,QAAQ,IACzBF,WAAWlG,GAEhBiF,UAAUjF,GACLgH,OAAOhH,GAET,IAAIyG,EAAezG,EAC5B,CCZA,SAASkH,aAAaL,EAAK7G,EAAOmH,GAChC,OAAQA,GACN,IAAK,SACH,OAAOnH,EAAMoB,WACf,IAAK,SAOH,OAAIpB,aAAiByG,EACZzG,EAAMoB,gBAEf,EACF,QACE,OAEN,CCnBA,IAAMgG,EAAO,CACXC,MAAO,SAAPA,MAAQC,EAAMC,GAAO,OAAKF,IAAMC,EAAMC,EAASN,YAAY,EAC3DxC,UAAW,SAAXA,UAAYzE,EAAOwH,EAAUC,GAAK,OAAKhD,EAAUzE,GAC/C,SAACW,EAAGT,GAAC,OCHT,SAASwH,mBAAmBb,EAAK7G,EAAO2H,GACtC,OAAI3H,aAAiBqE,KAGjBrE,aAAiB4H,IAFZ3D,MAAM4D,KAAK7H,GAKhB2H,EACKA,EAAiBd,EAAK7G,GAExBA,CACT,CDRc0H,CAAmB/G,EAAGT,EAAGsH,KACnCC,EACAP,aAAa,GAGjBE,EAAKU,OAAOC,aAAe,OEhB3B,IAAMC,EAAoB,cAU1B,SAASC,SAASjI,GAChB,OAAOgI,EAAkBhF,KAAKhD,EAChC,CCFO,SAASkI,oBAAoBlI,GAA4B,IAAA4F,EAArBE,EAAOC,UAAAxE,OAAA,QAAAyE,IAAAD,UAAA,GAAAA,UAAA,QAAGC,EAC7CmC,EAASjC,WAAWlG,GACpB+G,EAAeR,gBAAgBvG,GACrC,GAAqB,SAAjB+G,EACF,OAAOoB,EAIT,IAF8BvC,QAAlBA,EAAGE,aAAO,EAAPA,EAASM,cAAMR,IAAAA,EAAAA,EAAIF,IAEF,mBAAjBqB,EACb,OAAOoB,EAET,IAAMC,EAAmBrB,aAAY,EAAZA,EAAcxB,QAAQ,IAAK,KACpD,MAAM,IAAImB,MAAM,oCAAmC,cAAAC,OAC/B3G,EAAK2G,YAAAA,OAAWyB,EAAgB,gBAAAzB,OAAewB,GACrE","x_google_ignoreList":[0,1]}
|
package/dist/json.mjs
CHANGED
|
@@ -2,7 +2,7 @@ import _classCallCheck from '@babel/runtime/helpers/classCallCheck';
|
|
|
2
2
|
import _createClass from '@babel/runtime/helpers/createClass';
|
|
3
3
|
import _defineProperty from '@babel/runtime/helpers/defineProperty';
|
|
4
4
|
|
|
5
|
-
var T$1=Object.defineProperty;var C$1=(t,a)=>T$1(t,"name",{value:a,configurable
|
|
5
|
+
var T$1=Object.defineProperty;var C$1=(t,a)=>T$1(t,"name",{value:a,configurable:true});/**
|
|
6
6
|
* https://github.com/jawj/json-custom-numbers
|
|
7
7
|
* @copyright Copyright (c) 2023 George MacKerron
|
|
8
8
|
* @license MIT
|
|
@@ -24,7 +24,7 @@ return "\\n";if(t===9)return "\\t";const p=t.toString(16),y="0000".slice(p.lengt
|
|
|
24
24
|
p;return (t>31?`'${a}${String.fromCharCode(t)}' or `:"")+`\\u${y}`}C$1(O,"chDesc");
|
|
25
25
|
function R(t,a){const p=Object.keys(a),y=p.length;for(let d=0;d<y;d++){const n=p[d],
|
|
26
26
|
e=t.call(a,n,a[n]);e!==void 0?a[n]=e:delete a[n];}}C$1(R,"revive");function q$1(t,a,p){
|
|
27
|
-
const y=p
|
|
27
|
+
const y=p===true?" in array":p===false?" in object":"",d=t.slice(0,a),n=d.match(/[^\n]{0,69}$/)[0],
|
|
28
28
|
e=n.length<d.length?"..."+n:n,o=a-(d.length-e.length),u=t.slice(a),r=u.match(/[^\n]{0,5}/)[0],
|
|
29
29
|
c=r.length<u.length?r+"...":r,A=e+c,I=" ".repeat(o<1?0:o-1)+"^";return `${y}
|
|
30
30
|
At position ${a} in JSON:
|
|
@@ -35,7 +35,7 @@ typeof y=="number"?y:(U=y.maxDepth)!=null?U:N.maxDepth;let n=0,e,o,u,r,c;functio
|
|
|
35
35
|
throw new SyntaxError(l+q$1(t,n,u))}C$1(A,"err");function I(){A(`JSON structure too \
|
|
36
36
|
deeply nested (current max depth: ${d})`);}C$1(I,"tooDeep");function b(l){A(`Unexpe\
|
|
37
37
|
cted ${O(e)}, expecting ${l}`);}C$1(b,"expected");function E(){const l=n-1;if(D$1.lastIndex=
|
|
38
|
-
l,D$1.test(t)
|
|
38
|
+
l,D$1.test(t)!==true&&b("JSON value"),n=D$1.lastIndex,e<102){const g=t.slice(l,n);return p?
|
|
39
39
|
p.call(o,r,g):+g}return e===110?null:e===116}C$1(E,"word");function S(){let l="";e:
|
|
40
40
|
for(;;){v.lastIndex=n,v.test(t);const f=v.lastIndex;for(f>n&&(l+=t.slice(n,f),n=
|
|
41
41
|
f),e=t.charCodeAt(n++);;){switch(e){case 34:return l;case 92:if(e=t.charCodeAt(n++),
|
|
@@ -45,33 +45,33 @@ XX escape in string");}const g=j[e];if(g!==""&&g!==void 0){l+=g;break}A(`Invalid
|
|
|
45
45
|
escape sequence: ${O(e,"\\")} in string`);default:e>=0||A("Unterminated string"),
|
|
46
46
|
A(`Invalid unescaped ${O(e)} in string`);}if(e=t.charCodeAt(n),e!==92&&e!==34)continue e;
|
|
47
47
|
n++;}}}C$1(S,"string");e:{do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===
|
|
48
|
-
13||e===9));switch(e){case 123:d===0&&I(),o={},r=void 0,u
|
|
49
|
-
I(),o=[],r=0,u
|
|
50
|
-
2,f=[],g=X.test(t);let s=0;t:for(;;)if(u
|
|
48
|
+
13||e===9));switch(e){case 123:d===0&&I(),o={},r=void 0,u=false;break;case 91:d===0&&
|
|
49
|
+
I(),o=[],r=0,u=true;break;case 34:c=S();break e;default:c=E();break e}const l=d+d-
|
|
50
|
+
2,f=[],g=X.test(t);let s=0;t:for(;;)if(u===true)for(;;){g===true&&s>2&&(h.lastIndex=
|
|
51
51
|
n,h.test(t),n=h.lastIndex);do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||
|
|
52
52
|
e===13||e===9));if(e===93){if(a!==void 0&&R(a,o),c=o,s===0)break e;if(o=f[--s],r=
|
|
53
|
-
f[--s],u=typeof r=="number",u
|
|
54
|
-
0){e!==44&&b("',' or ']' after value"),g
|
|
53
|
+
f[--s],u=typeof r=="number",u===true){o[r++]=c;continue}else {o[r]=c;continue t}}if(r!==
|
|
54
|
+
0){e!==44&&b("',' or ']' after value"),g===true&&s>2&&(h.lastIndex=n,h.test(t),n=h.
|
|
55
55
|
lastIndex);do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===9))}
|
|
56
56
|
switch(e){case 34:o[r++]=S();continue;case 123:s===l&&I(),f[s++]=r,f[s++]=o,o={},
|
|
57
|
-
r=void 0,u
|
|
58
|
-
o[r++]=E();}}else for(;;){g
|
|
57
|
+
r=void 0,u=false;continue t;case 91:s===l&&I(),f[s++]=r,f[s++]=o,o=[],r=0;continue;default:
|
|
58
|
+
o[r++]=E();}}else for(;;){g===true&&s>2&&(h.lastIndex=n,h.test(t),n=h.lastIndex);do
|
|
59
59
|
e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===9));if(e===125){if(a!==
|
|
60
|
-
void 0&&R(a,o),c=o,s===0)break e;if(o=f[--s],r=f[--s],u=typeof r=="number",u
|
|
60
|
+
void 0&&R(a,o),c=o,s===0)break e;if(o=f[--s],r=f[--s],u=typeof r=="number",u===true){
|
|
61
61
|
o[r++]=c;continue t}else {o[r]=c;continue}}if(r!==void 0){e!==44&&b("',' or '}' a\
|
|
62
|
-
fter value"),g
|
|
62
|
+
fter value"),g===true&&s>2&&(h.lastIndex=n,h.test(t),n=h.lastIndex);do e=t.charCodeAt(
|
|
63
63
|
n++);while(e<=32&&(e===32||e===10||e===13||e===9))}e!==34&&b("'}' or double-quot\
|
|
64
64
|
ed key"),r=S();do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===10||e===13||e===
|
|
65
65
|
9));e!==58&&b("':' after key");do e=t.charCodeAt(n++);while(e<=32&&(e===32||e===
|
|
66
66
|
10||e===13||e===9));switch(e){case 34:o[r]=S();continue;case 123:s===l&&I(),f[s++]=
|
|
67
67
|
r,f[s++]=o,o={},r=void 0;continue;case 91:s===l&&I(),f[s++]=r,f[s++]=o,o=[],r=0,
|
|
68
|
-
u
|
|
68
|
+
u=true;continue t;default:o[r]=E();}}}return J.lastIndex=n,J.test(t)===false&&A("Unexp\
|
|
69
69
|
ected data after end of JSON input"),a!==void 0&&(c={"":c},R(a,c),c=c[""]),c}C$1(K$1,
|
|
70
70
|
"parse");
|
|
71
71
|
|
|
72
|
-
var E=Object.defineProperty;var T=Object.getOwnPropertySymbols;var F=Object.prototype.hasOwnProperty,V=Object.prototype.propertyIsEnumerable;var D=(t,e,i)=>e in t?E(t,e,{enumerable
|
|
72
|
+
var E=Object.defineProperty;var T=Object.getOwnPropertySymbols;var F=Object.prototype.hasOwnProperty,V=Object.prototype.propertyIsEnumerable;var D=(t,e,i)=>e in t?E(t,e,{enumerable:true,configurable:true,writable:true,value:i}):
|
|
73
73
|
t[e]=i,u=(t,e)=>{for(var i in e||(e={}))F.call(e,i)&&D(t,i,e[i]);if(T)for(var i of T(
|
|
74
|
-
e))V.call(e,i)&&D(t,i,e[i]);return t};var K=(t,e)=>E(t,"name",{value:e,configurable
|
|
74
|
+
e))V.call(e,i)&&D(t,i,e[i]);return t};var K=(t,e)=>E(t,"name",{value:e,configurable:true});/**
|
|
75
75
|
* https://github.com/jawj/json-custom-numbers
|
|
76
76
|
* @copyright Copyright (c) 2023 George MacKerron
|
|
77
77
|
* @license MIT
|
|
@@ -80,27 +80,27 @@ e))V.call(e,i)&&D(t,i,e[i]);return t};var K=(t,e)=>E(t,"name",{value:e,configura
|
|
|
80
80
|
* precisely match native `JSON.stringify` behaviour but also allow for custom
|
|
81
81
|
* stringifying of numbers.
|
|
82
82
|
*/const x=/["\\\u0000-\u001f]/,q=Object.prototype.hasOwnProperty,z={maxDepth:5e4,
|
|
83
|
-
skipToJSON
|
|
83
|
+
skipToJSON:false};function C(t,e,i,j,g={}){typeof g=="number"&&(g={maxDepth:g}),g=u(
|
|
84
84
|
u({},z),g);const{maxDepth:J,skipToJSON:L}=g;let O,S;e!==void 0&&(typeof e=="func\
|
|
85
85
|
tion"?O=e:Array.isArray(e)&&(S=e.map(l=>String(l)))),i!==void 0&&(i=typeof i=="s\
|
|
86
86
|
tring"?i.slice(0,10):typeof i=="number"?" ".slice(0,i):void 0);const P=J*
|
|
87
|
-
(i===void 0?5:6);let r,s={"":t},d=0,c=[""],h
|
|
87
|
+
(i===void 0?5:6);let r,s={"":t},d=0,c=[""],h=false,k=1,f=[],n=0,y="",b=`
|
|
88
88
|
`,o,p=new Set([]);do{if(d===k){p.delete(s),i!==void 0&&(b=f[--n],y+=b),y+=c===void 0?
|
|
89
89
|
"]":"}",k=f[--n],h=f[--n],c=f[--n],d=f[--n],s=f[--n];continue}let l,w;c===void 0?
|
|
90
|
-
(r=String(d),t=s[d]):(r=c[d],t=s[r]);let a=typeof t;if(L
|
|
90
|
+
(r=String(d),t=s[d]):(r=c[d],t=s[r]);let a=typeof t;if(L===false&&t&&a==="object"&&
|
|
91
91
|
typeof t.toJSON=="function"&&(t=t.toJSON(r),a=typeof t),O!==void 0&&(t=O.call(s,
|
|
92
|
-
r,t),a=typeof t),j===void 0||(o=j(r,t,a))===void 0)switch(a){case"string":o=x.test(
|
|
93
|
-
t)?JSON.stringify(t):'"'+t+'"';break;case"number":o=isFinite(t)?String(t):"null";
|
|
94
|
-
break;case"boolean":o=t
|
|
92
|
+
r,t),a=typeof t),j===void 0||(o=j(r,t,a))===void 0)switch(a){case "string":o=x.test(
|
|
93
|
+
t)?JSON.stringify(t):'"'+t+'"';break;case "number":o=isFinite(t)?String(t):"null";
|
|
94
|
+
break;case "boolean":o=t===true?"true":"false";break;case "object":if(t===null){o="n\
|
|
95
95
|
ull";break}if(Array.isArray(t)){const m=t.length;m===0?o="[]":(o="[",l=void 0,w=
|
|
96
96
|
m);break}const N=S===void 0?Object.keys(t):S.filter(m=>q.call(t,m)),A=N.length;A===
|
|
97
|
-
0?o="{}":(o="{",l=N,w=A);break;case"bigint":throw new TypeError("Do not know how\
|
|
97
|
+
0?o="{}":(o="{",l=N,w=A);break;case "bigint":throw new TypeError("Do not know how\
|
|
98
98
|
to serialize a BigInt: please provide a custom serializer function");default:o=
|
|
99
99
|
void 0;}if(c===void 0?(d>0&&(y+=","),i!==void 0&&(y+=b),y+=o===void 0?"null":o):o!==
|
|
100
|
-
void 0&&(h?y+=",":h
|
|
100
|
+
void 0&&(h?y+=",":h=true,n>0&&(y+=i===void 0?(x.test(r)?JSON.stringify(r):'"'+r+'"')+
|
|
101
101
|
":":b+(x.test(r)?JSON.stringify(r):'"'+r+'"')+": "),y+=o),d++,w!==void 0){if(f[n++]=
|
|
102
102
|
s,f[n++]=d,f[n++]=c,f[n++]=h,f[n++]=k,i!==void 0&&(f[n++]=b,b+=i),s=t,d=0,c=l,h=
|
|
103
|
-
|
|
103
|
+
false,k=w,n>P)throw new RangeError(`Maximum nesting depth exceeded (current maximum\
|
|
104
104
|
is ${J})`);if(p.has(s))throw new TypeError("Cannot stringify circular structure");
|
|
105
105
|
p.add(s);}}while(n!==0);return y||void 0}K(C,"stringify");
|
|
106
106
|
|
|
@@ -169,6 +169,36 @@ function extractSignificantDigits(value) {
|
|
|
169
169
|
.replace(LEADING_MINUS_AND_ZEROS_REGEX, ''); // from "-025" to "25"
|
|
170
170
|
}
|
|
171
171
|
|
|
172
|
+
////////////////////////////////////////////////////////////////////////////////
|
|
173
|
+
//
|
|
174
|
+
// Copyright (c) 2022 - 2024.
|
|
175
|
+
// Haixing Hu, Qubit Co. Ltd.
|
|
176
|
+
//
|
|
177
|
+
// All rights reserved.
|
|
178
|
+
//
|
|
179
|
+
////////////////////////////////////////////////////////////////////////////////
|
|
180
|
+
|
|
181
|
+
/**
|
|
182
|
+
* A regular expression for testing whether a string represents a number.
|
|
183
|
+
*
|
|
184
|
+
* @type {RegExp}
|
|
185
|
+
* @see http://stackoverflow.com/questions/13340717/json-numbers-regular-expression
|
|
186
|
+
* @private
|
|
187
|
+
*/
|
|
188
|
+
var NUMBER_REGEX = /^-?(?:0|[1-9]\d*)(?:\.\d+)?(?:[eE][+-]?\d+)?$/;
|
|
189
|
+
|
|
190
|
+
/**
|
|
191
|
+
* Test whether a string represents a number
|
|
192
|
+
*
|
|
193
|
+
* @param {string} value
|
|
194
|
+
* The string to test.
|
|
195
|
+
* @return {boolean}
|
|
196
|
+
* true if the string contains a number; false otherwise.
|
|
197
|
+
*/
|
|
198
|
+
function isNumber(value) {
|
|
199
|
+
return NUMBER_REGEX.test(value);
|
|
200
|
+
}
|
|
201
|
+
|
|
172
202
|
////////////////////////////////////////////////////////////////////////////////
|
|
173
203
|
//
|
|
174
204
|
// Copyright (c) 2022 - 2024.
|
|
@@ -202,8 +232,12 @@ var DEFAULT_REQUIRED_DIGITS = 14;
|
|
|
202
232
|
* otherwise.
|
|
203
233
|
*/
|
|
204
234
|
function isSafeNumber(value) {
|
|
205
|
-
var _options$approx;
|
|
235
|
+
var _options$approx, _options$requiredDigi;
|
|
206
236
|
var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : undefined;
|
|
237
|
+
// handle the edge cases
|
|
238
|
+
if (!isNumber(value) || value === '' || value === 'NaN') {
|
|
239
|
+
return false;
|
|
240
|
+
}
|
|
207
241
|
var num = parseFloat(value);
|
|
208
242
|
var str = String(num);
|
|
209
243
|
if (value === str) {
|
|
@@ -214,49 +248,42 @@ function isSafeNumber(value) {
|
|
|
214
248
|
if (v === s) {
|
|
215
249
|
return true;
|
|
216
250
|
}
|
|
251
|
+
|
|
252
|
+
// use the default options
|
|
217
253
|
var approx = (_options$approx = options === null || options === void 0 ? void 0 : options.approx) !== null && _options$approx !== void 0 ? _options$approx : DEFAULT_APPROX;
|
|
218
|
-
if (approx
|
|
219
|
-
|
|
220
|
-
// A value is approximately equal when:
|
|
221
|
-
// 1. it is a floating point number, not an integer
|
|
222
|
-
// 2. it has at least requiredDigits digits
|
|
223
|
-
// 3. the first requiredDigits digits are equal
|
|
224
|
-
var requiredDigits = (_options$requiredDigi = options === null || options === void 0 ? void 0 : options.requiredDigits) !== null && _options$requiredDigi !== void 0 ? _options$requiredDigi : DEFAULT_REQUIRED_DIGITS;
|
|
225
|
-
if (!isInteger(value) && s.length >= requiredDigits && v.startsWith(s.substring(0, requiredDigits))) {
|
|
226
|
-
return true;
|
|
227
|
-
}
|
|
254
|
+
if (!approx) {
|
|
255
|
+
return false;
|
|
228
256
|
}
|
|
229
|
-
return false;
|
|
230
|
-
}
|
|
231
257
|
|
|
232
|
-
|
|
233
|
-
//
|
|
234
|
-
//
|
|
235
|
-
//
|
|
236
|
-
|
|
237
|
-
// All rights reserved.
|
|
238
|
-
//
|
|
239
|
-
////////////////////////////////////////////////////////////////////////////////
|
|
258
|
+
// A value is approximately equal when:
|
|
259
|
+
// 1. it is a floating point number, not an integer
|
|
260
|
+
// 2. both v and s have at least requiredDigits digits
|
|
261
|
+
// 3. the first requiredDigits digits are equal
|
|
262
|
+
var requiredDigits = (_options$requiredDigi = options === null || options === void 0 ? void 0 : options.requiredDigits) !== null && _options$requiredDigi !== void 0 ? _options$requiredDigi : DEFAULT_REQUIRED_DIGITS;
|
|
240
263
|
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
* @private
|
|
247
|
-
*/
|
|
248
|
-
var NUMBER_REGEX = /^-?(?:0|[1-9]\d*)(?:\.\d+)?(?:[eE][+-]?\d+)?$/;
|
|
264
|
+
// check if the value is an integer
|
|
265
|
+
var isIntegerVal = isInteger(value);
|
|
266
|
+
if (isIntegerVal) {
|
|
267
|
+
return true; // when the input is an integer and approx=true, return true
|
|
268
|
+
}
|
|
249
269
|
|
|
250
|
-
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
270
|
+
// check if s has at least requiredDigits digits
|
|
271
|
+
var sLengthOk = s.length >= requiredDigits;
|
|
272
|
+
if (!sLengthOk) {
|
|
273
|
+
return false;
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
// check if v has at least requiredDigits digits
|
|
277
|
+
var vLengthOk = v.length >= requiredDigits;
|
|
278
|
+
if (vLengthOk) {
|
|
279
|
+
// check if the first requiredDigits digits are equal
|
|
280
|
+
var vPrefix = v.substring(0, requiredDigits);
|
|
281
|
+
var sPrefix = s.substring(0, requiredDigits);
|
|
282
|
+
return vPrefix === sPrefix;
|
|
283
|
+
} else {
|
|
284
|
+
// if v length is not enough, return true
|
|
285
|
+
return true;
|
|
286
|
+
}
|
|
260
287
|
}
|
|
261
288
|
|
|
262
289
|
////////////////////////////////////////////////////////////////////////////////
|