@qubit-ltd/json 1.2.3 → 1.2.5

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.
Files changed (14) hide show
  1. package/README.md +4 -4
  2. package/README.zh_CN.md +4 -4
  3. package/dist/json.cjs +25 -12
  4. package/dist/json.cjs.map +1 -1
  5. package/dist/json.min.cjs +1 -1
  6. package/dist/json.min.cjs.map +1 -1
  7. package/dist/json.min.mjs +1 -1
  8. package/dist/json.min.mjs.map +1 -1
  9. package/dist/json.mjs +25 -12
  10. package/dist/json.mjs.map +1 -1
  11. package/doc/api/index.html +2 -2
  12. package/doc/json.min.visualization.html +1 -1
  13. package/doc/json.visualization.html +1 -1
  14. package/package.json +11 -12
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-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/collection-replacer.js","../src/json.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////////////////////////////////////////////////////////////////////////////////\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////////////////////////////////////////////////////////////////////////////////\nimport { parse as parseJson, stringify as stringifyJson } from 'json-custom-numbers';\nimport parseNumber from './parse-number';\nimport formatNumber from './format-number';\nimport collectionReplacer from './collection-replacer';\n\n/**\n * A customized class for JSON object which supports lossless number parsing and\n * stringifying.\n *\n * The instance of this class is similar to the standard `JSON` object, but with\n * enhanced capabilities for handling large integers, floating-point numbers, and\n * collections like `Set` and `Map`.\n *\n * Features:\n * - Lossless parsing of large integers (converted to BigInt)\n * - Lossless parsing of large floating-point numbers (converted to LosslessNumber)\n * - Support for Set and Map serialization/deserialization\n * - Compatible with standard JSON.parse/stringify API\n *\n * @example\n * // Parse large integers without precision loss\n * const obj = json.parse('{\"bigInt\": 9007199254740993}');\n * console.log(typeof obj.bigInt); // 'bigint'\n *\n * // Parse large floats without precision loss\n * const obj2 = json.parse('{\"bigFloat\": 2.3e+500}');\n * console.log(obj2.bigFloat instanceof LosslessNumber); // true\n *\n * // Stringify collections\n * const obj3 = { set: new Set([1, 2, 3]), map: new Map([['a', 1]]) };\n * console.log(json.stringify(obj3)); // '{\"set\":[1,2,3],\"map\":[[\"a\",1]]}'\n *\n * @author Haixing Hu\n */\nclass Json {\n /**\n * The string tag used by Object.prototype.toString() to identify this object.\n *\n * This property makes instances of the Json class return '[object JSON]' when\n * converted to string via Object.prototype.toString.call(), providing better\n * debugging and inspection experience.\n *\n * @type {string}\n * @readonly\n * @example\n * const json = new Json();\n * console.log(Object.prototype.toString.call(json)); // '[object JSON]'\n */\n [Symbol.toStringTag] = 'JSON';\n\n /**\n * Parses the specified JSON string and returns the resulting object.\n *\n * This method works like the standard JSON.parse(), but with enhanced number\n * handling:\n * - Safe numbers are parsed as regular JavaScript numbers\n * - Large integers are parsed as BigInt\n * - Large floating-point numbers are parsed as LosslessNumber instances\n *\n * @param {string} text\n * The JSON string to be parsed. Must be a valid JSON string.\n * @param {Function} [reviver]\n * Optional function to transform the results. This function is called for\n * each member of the object. If a member contains nested objects, the nested\n * objects are transformed before the parent object is.\n * @returns {*}\n * The resulting JavaScript value/object. The type depends on the JSON content.\n * @throws {SyntaxError}\n * Thrown if the text is not valid JSON.\n * @example\n * // Parse regular JSON\n * const obj = json.parse('{\"name\": \"John\", \"age\": 30}');\n *\n * // Parse with large integer (becomes BigInt)\n * const obj2 = json.parse('{\"id\": 9007199254740993}');\n * console.log(typeof obj2.id); // 'bigint'\n *\n * // Parse with reviver function\n * const obj3 = json.parse('{\"date\": \"2023-01-01\"}', (key, value) => {\n * if (key === 'date') return new Date(value);\n * return value;\n * });\n */\n parse(text, reviver) {\n if (typeof text !== 'string') {\n throw new TypeError('JSON.parse requires a string argument');\n }\n if ((reviver != null) && (typeof reviver !== 'function')) {\n throw new TypeError('JSON.parse reviver argument must be a function');\n }\n try {\n return parseJson(text, reviver, parseNumber);\n } catch (error) {\n // Re-throw with more context if needed\n if (error instanceof SyntaxError) {\n throw new SyntaxError(`Invalid JSON: ${error.message}`);\n }\n throw error;\n }\n }\n\n /**\n * Stringifies the specified value and returns the resulting JSON string.\n *\n * This method works like the standard JSON.stringify(), but with enhanced\n * support for:\n * - BigInt values (converted to number strings)\n * - LosslessNumber instances (converted to their string representation)\n * - Set instances (converted to arrays)\n * - Map instances (converted to arrays of key-value pairs)\n *\n * @param {*} value\n * The value to be stringified. Can be any JavaScript value.\n * @param {Function|Array} [replacer]\n * Optional function or array to transform the results. If a function, it's\n * called for each member of the object. If an array, it specifies the\n * properties to be included in the result.\n * @param {string|number} [space]\n * Optional string or number to control spacing in the output. If a number,\n * it indicates the number of space characters to use as white space. If a\n * string, it's used as white space.\n * @returns {string|undefined}\n * The resulting JSON string, or undefined if the value cannot be serialized.\n * @example\n * // Stringify regular object\n * const str = json.stringify({name: \"John\", age: 30});\n *\n * // Stringify with BigInt (preserved as number)\n * const str2 = json.stringify({id: 9007199254740993n});\n * // Result: '{\"id\":9007199254740993}'\n *\n * // Stringify with collections\n * const str3 = json.stringify({\n * set: new Set([1, 2, 3]),\n * map: new Map([['a', 1], ['b', 2]])\n * });\n * // Result: '{\"set\":[1,2,3],\"map\":[[\"a\",1],[\"b\",2]]}'\n *\n * // Stringify with custom replacer\n * const str4 = json.stringify({a: 1, b: 2}, (key, value) => {\n * return key === 'a' ? undefined : value;\n * });\n * // Result: '{\"b\":2}'\n */\n stringify(value, replacer, space) {\n // Validate replacer parameter\n if ((replacer != null) && (typeof replacer !== 'function') && (!Array.isArray(replacer))) {\n throw new TypeError('JSON.stringify replacer argument must be a function or array');\n }\n // Validate space parameter\n if ((space != null) && (typeof space !== 'string') && (typeof space !== 'number')) {\n throw new TypeError('JSON.stringify space argument must be a string or number');\n }\n try {\n // Optimize: create combined replacer function only when needed\n const combinedReplacer = replacer\n ? (k, v) => collectionReplacer(k, v, replacer)\n : collectionReplacer;\n\n return stringifyJson(value, combinedReplacer, space, formatNumber);\n } catch (error) {\n // Handle circular reference and other stringify errors\n if ((error.message.includes('circular'))\n || (error.message.includes('Converting circular structure'))) {\n throw new TypeError('Converting circular structure to JSON');\n }\n throw error;\n }\n }\n}\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 * Key differences from standard JSON:\n * - Large integers are preserved as BigInt instead of losing precision\n * - Large floating-point numbers are preserved as LosslessNumber instances\n * - Set and Map collections are automatically serialized as arrays\n * - Maintains full compatibility with standard JSON API\n *\n * @type {Json}\n * @example\n * import json from '@qubit-ltd/json';\n *\n * // Use exactly like standard JSON\n * const obj = json.parse('{\"value\": 9007199254740993}');\n * const str = json.stringify(obj);\n *\n * // Works with collections\n * const data = { items: new Set([1, 2, 3]) };\n * const serialized = json.stringify(data); // '{\"items\":[1,2,3]}'\n */\nconst json = new 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 * 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","collectionReplacer","fallbackReplacer","Map","from","Json","Symbol","toStringTag","parse","text","reviver","parseJson","error","message","replacer","space","combinedReplacer","stringifyJson","includes","json","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,CAAA,EAAGE,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,CAAA,EAC9EE,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,CAAA,GAAI2B,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,KAD8B,QAAlBuC,EAAGE,aAAO,EAAPA,EAASM,cAAM,IAAAR,EAAAA,EAAIF,GAEhC,OAAO,EAOT,IAAMW,EAAwC,QAA1BR,EAAGC,aAAO,EAAPA,EAASO,sBAAc,IAAAR,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,MAAK,YAAA2G,OAAWI,EAAY,KAAG,cAAAJ,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,SAASgG,mBAAmBP,EAAK7G,EAAOqH,GACtC,OAAIrH,aAAiBqE,KAGjBrE,aAAiBsH,IAFZrD,MAAMsD,KAAKvH,GAKhBqH,EACKA,EAAiBR,EAAK7G,GAExBA,CACT,CCpBA,IA6BMwH,EAAI,WAcqB,OAAAhI,GAdrB,SAAAgI,OAAAjI,OAAAiI,MACR/H,EAAAmH,KAaCa,OAAOC,YAAe,OAAM,GAAA,CAAA,CAAAb,IAAA,QAAA7G,MAmC7B,SAAA2H,MAAMC,EAAMC,GACV,GAAoB,iBAATD,EACT,MAAM,IAAIhD,UAAU,yCAEtB,GAAgB,MAAXiD,GAAwC,mBAAZA,EAC/B,MAAM,IAAIjD,UAAU,kDAEtB,IACE,OAAOkD,IAAUF,EAAMC,EAASZ,YAClC,CAAE,MAAOc,GAEP,GAAIA,aAAiBpF,YACnB,MAAM,IAAIA,YAAW,iBAAAgE,OAAkBoB,EAAMC,UAE/C,MAAMD,CACR,CACF,GAEA,CAAAlB,IAAA,YAAA7G,MA2CA,SAAAyE,UAAUzE,EAAOiI,EAAUC,GAEzB,GAAiB,MAAZD,GAA0C,mBAAbA,IAA8BhE,MAAMC,QAAQ+D,GAC5E,MAAM,IAAIrD,UAAU,gEAGtB,GAAc,MAATsD,GAAoC,iBAAVA,GAAyC,iBAAVA,EAC5D,MAAM,IAAItD,UAAU,4DAEtB,IAEE,IAAMuD,EAAmBF,EACrB,SAACtH,EAAGT,GAAC,OAAKkH,mBAAmBzG,EAAGT,EAAG+H,EAAS,EAC5Cb,mBAEJ,OAAOgB,EAAcpI,EAAOmI,EAAkBD,EAAOhB,aACvD,CAAE,MAAOa,GAEP,GAAKA,EAAMC,QAAQK,SAAS,aACpBN,EAAMC,QAAQK,SAAS,iCAC7B,MAAM,IAAIzD,UAAU,yCAEtB,MAAMmD,CACR,CACF,IAAC,CAtIO,GAkKJO,EAAO,IAAId,EC9LXe,EAAoB,cAU1B,SAASC,SAASxI,GAChB,OAAOuI,EAAkBvF,KAAKhD,EAChC,CCFO,SAASyI,oBAAoBzI,GAA4B,IAAA4F,EAArBE,EAAOC,UAAAxE,OAAA,QAAAyE,IAAAD,UAAA,GAAAA,UAAA,QAAGC,EAC7C0C,EAASxC,WAAWlG,GACpB+G,EAAeR,gBAAgBvG,GACrC,GAAqB,SAAjB+G,EACF,OAAO2B,EAIT,IAF8B,QAAlB9C,EAAGE,aAAO,EAAPA,EAASM,cAAM,IAAAR,EAAAA,EAAIF,IAEF,mBAAjBqB,EACb,OAAO2B,EAET,IAAMC,EAAmB5B,aAAY,EAAZA,EAAcxB,QAAQ,IAAK,KACpD,MAAM,IAAImB,MAAM,oCAAmC,cAAAC,OAC/B3G,EAAK,YAAA2G,OAAWgC,EAAgB,gBAAAhC,OAAe+B,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/collection-replacer.js","../src/json.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 - 2026.\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 if (typeof value !== 'string') {\n return false;\n }\n return INTEGER_REGEX.test(value);\n}\n\nexport default isInteger;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2026.\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 const result = 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 return result;\n}\n\nexport default extractSignificantDigits;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2026.\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 if (typeof value !== 'string') {\n return false;\n }\n return NUMBER_REGEX.test(value);\n}\n\nexport default isNumber;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2026.\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 - 2026.\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\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 if (typeof value !== 'string') {\n value = String(value);\n }\n if (!isNumber(value) || value === '' || value === 'NaN') {\n return 'none';\n }\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 - 2026.\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 - 2026.\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 - 2026.\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 - 2026.\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 - 2026.\n// Haixing Hu, Qubit Co. Ltd.\n//\n// All rights reserved.\n//\n////////////////////////////////////////////////////////////////////////////////\nimport { parse as parseJson, stringify as stringifyJson } from 'json-custom-numbers';\nimport parseNumber from './parse-number';\nimport formatNumber from './format-number';\nimport collectionReplacer from './collection-replacer';\n\n/**\n * A customized class for JSON object which supports lossless number parsing and\n * stringifying.\n *\n * The instance of this class is similar to the standard `JSON` object, but with\n * enhanced capabilities for handling large integers, floating-point numbers, and\n * collections like `Set` and `Map`.\n *\n * Features:\n * - Lossless parsing of large integers (converted to BigInt)\n * - Lossless parsing of large floating-point numbers (converted to LosslessNumber)\n * - Support for Set and Map serialization/deserialization\n * - Compatible with standard JSON.parse/stringify API\n *\n * @example\n * // Parse large integers without precision loss\n * const obj = json.parse('{\"bigInt\": 9007199254740993}');\n * console.log(typeof obj.bigInt); // 'bigint'\n *\n * // Parse large floats without precision loss\n * const obj2 = json.parse('{\"bigFloat\": 2.3e+500}');\n * console.log(obj2.bigFloat instanceof LosslessNumber); // true\n *\n * // Stringify collections\n * const obj3 = { set: new Set([1, 2, 3]), map: new Map([['a', 1]]) };\n * console.log(json.stringify(obj3)); // '{\"set\":[1,2,3],\"map\":[[\"a\",1]]}'\n *\n * @author Haixing Hu\n */\nclass Json {\n /**\n * The string tag used by Object.prototype.toString() to identify this object.\n *\n * This property makes instances of the Json class return '[object JSON]' when\n * converted to string via Object.prototype.toString.call(), providing better\n * debugging and inspection experience.\n *\n * @type {string}\n * @readonly\n * @example\n * const json = new Json();\n * console.log(Object.prototype.toString.call(json)); // '[object JSON]'\n */\n [Symbol.toStringTag] = 'JSON';\n\n /**\n * Parses the specified JSON string and returns the resulting object.\n *\n * This method works like the standard JSON.parse(), but with enhanced number\n * handling:\n * - Safe numbers are parsed as regular JavaScript numbers\n * - Large integers are parsed as BigInt\n * - Large floating-point numbers are parsed as LosslessNumber instances\n *\n * @param {string} text\n * The JSON string to be parsed. Must be a valid JSON string.\n * @param {Function} [reviver]\n * Optional function to transform the results. This function is called for\n * each member of the object. If a member contains nested objects, the nested\n * objects are transformed before the parent object is.\n * @returns {*}\n * The resulting JavaScript value/object. The type depends on the JSON content.\n * @throws {SyntaxError}\n * Thrown if the text is not valid JSON.\n * @example\n * // Parse regular JSON\n * const obj = json.parse('{\"name\": \"John\", \"age\": 30}');\n *\n * // Parse with large integer (becomes BigInt)\n * const obj2 = json.parse('{\"id\": 9007199254740993}');\n * console.log(typeof obj2.id); // 'bigint'\n *\n * // Parse with reviver function\n * const obj3 = json.parse('{\"date\": \"2023-01-01\"}', (key, value) => {\n * if (key === 'date') return new Date(value);\n * return value;\n * });\n */\n parse(text, reviver) {\n if (typeof text !== 'string') {\n throw new TypeError('JSON.parse requires a string argument');\n }\n if ((reviver != null) && (typeof reviver !== 'function')) {\n throw new TypeError('JSON.parse reviver argument must be a function');\n }\n try {\n return parseJson(text, reviver, parseNumber);\n } catch (error) {\n // Re-throw with more context if needed\n if (error instanceof SyntaxError) {\n throw new SyntaxError(`Invalid JSON: ${error.message}`);\n }\n throw error;\n }\n }\n\n /**\n * Stringifies the specified value and returns the resulting JSON string.\n *\n * This method works like the standard JSON.stringify(), but with enhanced\n * support for:\n * - BigInt values (converted to number strings)\n * - LosslessNumber instances (converted to their string representation)\n * - Set instances (converted to arrays)\n * - Map instances (converted to arrays of key-value pairs)\n *\n * @param {*} value\n * The value to be stringified. Can be any JavaScript value.\n * @param {Function|Array} [replacer]\n * Optional function or array to transform the results. If a function, it's\n * called for each member of the object. If an array, it specifies the\n * properties to be included in the result.\n * @param {string|number} [space]\n * Optional string or number to control spacing in the output. If a number,\n * it indicates the number of space characters to use as white space. If a\n * string, it's used as white space.\n * @returns {string|undefined}\n * The resulting JSON string, or undefined if the value cannot be serialized.\n * @example\n * // Stringify regular object\n * const str = json.stringify({name: \"John\", age: 30});\n *\n * // Stringify with BigInt (preserved as number)\n * const str2 = json.stringify({id: 9007199254740993n});\n * // Result: '{\"id\":9007199254740993}'\n *\n * // Stringify with collections\n * const str3 = json.stringify({\n * set: new Set([1, 2, 3]),\n * map: new Map([['a', 1], ['b', 2]])\n * });\n * // Result: '{\"set\":[1,2,3],\"map\":[[\"a\",1],[\"b\",2]]}'\n *\n * // Stringify with custom replacer\n * const str4 = json.stringify({a: 1, b: 2}, (key, value) => {\n * return key === 'a' ? undefined : value;\n * });\n * // Result: '{\"b\":2}'\n */\n stringify(value, replacer, space) {\n // Validate replacer parameter\n if ((replacer != null) && (typeof replacer !== 'function') && (!Array.isArray(replacer))) {\n throw new TypeError('JSON.stringify replacer argument must be a function or array');\n }\n // Validate space parameter\n if ((space != null) && (typeof space !== 'string') && (typeof space !== 'number')) {\n throw new TypeError('JSON.stringify space argument must be a string or number');\n }\n try {\n // Optimize: create combined replacer function only when needed\n const combinedReplacer = replacer\n ? (k, v) => collectionReplacer(k, v, replacer)\n : collectionReplacer;\n\n return stringifyJson(value, combinedReplacer, space, formatNumber);\n } catch (error) {\n // Handle circular reference and other stringify errors\n if ((error.message.includes('circular'))\n || (error.message.includes('Converting circular structure'))) {\n throw new TypeError('Converting circular structure to JSON');\n }\n throw error;\n }\n }\n}\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 * Key differences from standard JSON:\n * - Large integers are preserved as BigInt instead of losing precision\n * - Large floating-point numbers are preserved as LosslessNumber instances\n * - Set and Map collections are automatically serialized as arrays\n * - Maintains full compatibility with standard JSON API\n *\n * @type {Json}\n * @example\n * import json from '@qubit-ltd/json';\n *\n * // Use exactly like standard JSON\n * const obj = json.parse('{\"value\": 9007199254740993}');\n * const str = json.stringify(obj);\n *\n * // Works with collections\n * const data = { items: new Set([1, 2, 3]) };\n * const serialized = json.stringify(data); // '{\"items\":[1,2,3]}'\n */\nconst json = new Json();\n\nexport default json;\n","////////////////////////////////////////////////////////////////////////////////\n//\n// Copyright (c) 2022 - 2026.\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 - 2026.\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","collectionReplacer","fallbackReplacer","Map","from","Json","Symbol","toStringTag","parse","text","reviver","parseJson","error","message","replacer","space","combinedReplacer","stringifyJson","includes","json","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,CAAA,EAAGE,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,CAAA,EAC9EE,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,CAAA,GAAI2B,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,MAAqB,iBAAVA,GAGJgF,EAAchC,KAAKhD,EAC5B,CCrBA,IAAMkF,EAAyB,gBACzBC,EAAgC,WAChCC,EAAY,KACZC,EAAuB,MAiB7B,SAASC,yBAAyBtF,GAMhC,OALeA,EACZuF,QAAQL,EAAwB,IAChCK,QAAQH,EAAW,IACnBG,QAAQF,EAAsB,IAC9BE,QAAQJ,EAA+B,GAE5C,CCpBA,IAAMK,EAAe,gDAUrB,SAASC,SAASzF,GAChB,MAAqB,iBAAVA,GAGJwF,EAAaxC,KAAKhD,EAC3B,CCnBA,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,KAD8B,QAAlBuC,EAAGE,aAAO,EAAPA,EAASM,cAAM,IAAAR,EAAAA,EAAIF,GAEhC,OAAO,EAOT,IAAMW,EAAwC,QAA1BR,EAAGC,aAAO,EAAPA,EAASO,sBAAc,IAAAR,EAAAA,EAlDhB,GAsD9B,QADqBZ,UAAUjF,IAMbqD,EAAE9B,QAAU8E,MAMZnG,EAAEqB,QAAU8E,IAIZnG,EAAEoG,UAAU,EAAGD,KACfhD,EAAEiD,UAAU,EAAGD,GAMnC,CChEA,SAASE,gBAAgBvG,GAIvB,GAHqB,iBAAVA,IACTA,EAAQiB,OAAOjB,KAEZyF,SAASzF,IAAoB,KAAVA,GAA0B,QAAVA,EACtC,MAAO,OAET,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,CCzCA,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,MAAK,YAAA2G,OAAWI,EAAY,KAAG,cAAAJ,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,SAASgG,mBAAmBP,EAAK7G,EAAOqH,GACtC,OAAIrH,aAAiBqE,KAGjBrE,aAAiBsH,IAFZrD,MAAMsD,KAAKvH,GAKhBqH,EACKA,EAAiBR,EAAK7G,GAExBA,CACT,CCpBA,IA6BMwH,EAAI,WAcqB,OAAAhI,GAdrB,SAAAgI,OAAAjI,OAAAiI,MACR/H,EAAAmH,KAaCa,OAAOC,YAAe,OAAM,GAAA,CAAA,CAAAb,IAAA,QAAA7G,MAmC7B,SAAA2H,MAAMC,EAAMC,GACV,GAAoB,iBAATD,EACT,MAAM,IAAIhD,UAAU,yCAEtB,GAAgB,MAAXiD,GAAwC,mBAAZA,EAC/B,MAAM,IAAIjD,UAAU,kDAEtB,IACE,OAAOkD,IAAUF,EAAMC,EAASZ,YAClC,CAAE,MAAOc,GAEP,GAAIA,aAAiBpF,YACnB,MAAM,IAAIA,YAAW,iBAAAgE,OAAkBoB,EAAMC,UAE/C,MAAMD,CACR,CACF,GAEA,CAAAlB,IAAA,YAAA7G,MA2CA,SAAAyE,UAAUzE,EAAOiI,EAAUC,GAEzB,GAAiB,MAAZD,GAA0C,mBAAbA,IAA8BhE,MAAMC,QAAQ+D,GAC5E,MAAM,IAAIrD,UAAU,gEAGtB,GAAc,MAATsD,GAAoC,iBAAVA,GAAyC,iBAAVA,EAC5D,MAAM,IAAItD,UAAU,4DAEtB,IAEE,IAAMuD,EAAmBF,EACrB,SAACtH,EAAGT,GAAC,OAAKkH,mBAAmBzG,EAAGT,EAAG+H,EAAS,EAC5Cb,mBAEJ,OAAOgB,EAAcpI,EAAOmI,EAAkBD,EAAOhB,aACvD,CAAE,MAAOa,GAEP,GAAKA,EAAMC,QAAQK,SAAS,aACpBN,EAAMC,QAAQK,SAAS,iCAC7B,MAAM,IAAIzD,UAAU,yCAEtB,MAAMmD,CACR,CACF,IAAC,CAtIO,GAkKJO,EAAO,IAAId,EC9LXe,EAAoB,cAU1B,SAASC,SAASxI,GAChB,OAAOuI,EAAkBvF,KAAKhD,EAChC,CCFO,SAASyI,oBAAoBzI,GAA4B,IAAA4F,EAArBE,EAAOC,UAAAxE,OAAA,QAAAyE,IAAAD,UAAA,GAAAA,UAAA,QAAGC,EAC7C0C,EAASxC,WAAWlG,GACpB+G,EAAeR,gBAAgBvG,GACrC,GAAqB,SAAjB+G,EACF,OAAO2B,EAIT,IAF8B,QAAlB9C,EAAGE,aAAO,EAAPA,EAASM,cAAM,IAAAR,EAAAA,EAAIF,IAEF,mBAAjBqB,EACb,OAAO2B,EAET,IAAMC,EAAmB5B,aAAY,EAAZA,EAAcxB,QAAQ,IAAK,KACpD,MAAM,IAAImB,MAAM,oCAAmC,cAAAC,OAC/B3G,EAAK,YAAA2G,OAAWgC,EAAgB,gBAAAhC,OAAe+B,GACrE","x_google_ignoreList":[0,1]}
package/dist/json.mjs CHANGED
@@ -106,7 +106,7 @@ p.add(s);}}while(n!==0);return y||void 0}K(C,"stringify");
106
106
 
107
107
  ////////////////////////////////////////////////////////////////////////////////
108
108
  //
109
- // Copyright (c) 2022 - 2024.
109
+ // Copyright (c) 2022 - 2026.
110
110
  // Haixing Hu, Qubit Co. Ltd.
111
111
  //
112
112
  // All rights reserved.
@@ -130,12 +130,15 @@ var INTEGER_REGEX = /^[+-]?\d+$/;
130
130
  * true if the string contains an integer; false otherwise.
131
131
  */
132
132
  function isInteger(value) {
133
+ if (typeof value !== 'string') {
134
+ return false;
135
+ }
133
136
  return INTEGER_REGEX.test(value);
134
137
  }
135
138
 
136
139
  ////////////////////////////////////////////////////////////////////////////////
137
140
  //
138
- // Copyright (c) 2022 - 2024.
141
+ // Copyright (c) 2022 - 2026.
139
142
  // Haixing Hu, Qubit Co. Ltd.
140
143
  //
141
144
  // All rights reserved.
@@ -163,15 +166,16 @@ var TRAILING_ZEROS_REGEX = /0+$/;
163
166
  * @private
164
167
  */
165
168
  function extractSignificantDigits(value) {
166
- return value.replace(EXPONENTIAL_PART_REGEX, '') // from "-0.250e+30" to "-0.250"
169
+ var result = value.replace(EXPONENTIAL_PART_REGEX, '') // from "-0.250e+30" to "-0.250"
167
170
  .replace(DOT_REGEX, '') // from "-0.250" to "-0250"
168
171
  .replace(TRAILING_ZEROS_REGEX, '') // from "-0250" to "-025"
169
172
  .replace(LEADING_MINUS_AND_ZEROS_REGEX, ''); // from "-025" to "25"
173
+ return result;
170
174
  }
171
175
 
172
176
  ////////////////////////////////////////////////////////////////////////////////
173
177
  //
174
- // Copyright (c) 2022 - 2024.
178
+ // Copyright (c) 2022 - 2026.
175
179
  // Haixing Hu, Qubit Co. Ltd.
176
180
  //
177
181
  // All rights reserved.
@@ -196,12 +200,15 @@ var NUMBER_REGEX = /^-?(?:0|[1-9]\d*)(?:\.\d+)?(?:[eE][+-]?\d+)?$/;
196
200
  * true if the string contains a number; false otherwise.
197
201
  */
198
202
  function isNumber(value) {
203
+ if (typeof value !== 'string') {
204
+ return false;
205
+ }
199
206
  return NUMBER_REGEX.test(value);
200
207
  }
201
208
 
202
209
  ////////////////////////////////////////////////////////////////////////////////
203
210
  //
204
- // Copyright (c) 2022 - 2024.
211
+ // Copyright (c) 2022 - 2026.
205
212
  // Haixing Hu, Qubit Co. Ltd.
206
213
  //
207
214
  // All rights reserved.
@@ -288,7 +295,7 @@ function isSafeNumber(value) {
288
295
 
289
296
  ////////////////////////////////////////////////////////////////////////////////
290
297
  //
291
- // Copyright (c) 2022 - 2024.
298
+ // Copyright (c) 2022 - 2026.
292
299
  // Haixing Hu, Qubit Co. Ltd.
293
300
  //
294
301
  // All rights reserved.
@@ -309,6 +316,12 @@ function isSafeNumber(value) {
309
316
  * The reason why the value is unsafe. Returns `'none'` when the value is safe.
310
317
  */
311
318
  function getUnsafeReason(value) {
319
+ if (typeof value !== 'string') {
320
+ value = String(value);
321
+ }
322
+ if (!isNumber(value) || value === '' || value === 'NaN') {
323
+ return 'none';
324
+ }
312
325
  var num = parseFloat(value);
313
326
  var str = String(num);
314
327
  if (value === str) {
@@ -416,7 +429,7 @@ var LosslessNumber = /*#__PURE__*/function () {
416
429
 
417
430
  ////////////////////////////////////////////////////////////////////////////////
418
431
  //
419
- // Copyright (c) 2022 - 2024.
432
+ // Copyright (c) 2022 - 2026.
420
433
  // Haixing Hu, Qubit Co. Ltd.
421
434
  //
422
435
  // All rights reserved.
@@ -452,7 +465,7 @@ function parseNumber(key, value) {
452
465
 
453
466
  ////////////////////////////////////////////////////////////////////////////////
454
467
  //
455
- // Copyright (c) 2022 - 2024.
468
+ // Copyright (c) 2022 - 2026.
456
469
  // Haixing Hu, Qubit Co. Ltd.
457
470
  //
458
471
  // All rights reserved.
@@ -494,7 +507,7 @@ function formatNumber(key, value, type) {
494
507
 
495
508
  ////////////////////////////////////////////////////////////////////////////////
496
509
  //
497
- // Copyright (c) 2022 - 2024.
510
+ // Copyright (c) 2022 - 2026.
498
511
  // Haixing Hu, Qubit Co. Ltd.
499
512
  //
500
513
  // All rights reserved.
@@ -727,7 +740,7 @@ var json = new Json();
727
740
 
728
741
  ////////////////////////////////////////////////////////////////////////////////
729
742
  //
730
- // Copyright (c) 2022 - 2024.
743
+ // Copyright (c) 2022 - 2026.
731
744
  // Haixing Hu, Qubit Co. Ltd.
732
745
  //
733
746
  // All rights reserved.
@@ -755,7 +768,7 @@ function isBigInt(value) {
755
768
 
756
769
  ////////////////////////////////////////////////////////////////////////////////
757
770
  //
758
- // Copyright (c) 2022 - 2024.
771
+ // Copyright (c) 2022 - 2026.
759
772
  // Haixing Hu, Qubit Co. Ltd.
760
773
  //
761
774
  // All rights reserved.
@@ -794,7 +807,7 @@ function toSafeNumberOrThrow(value) {
794
807
 
795
808
  ////////////////////////////////////////////////////////////////////////////////
796
809
  //
797
- // Copyright (c) 2022 - 2024.
810
+ // Copyright (c) 2022 - 2026.
798
811
  // Haixing Hu, Qubit Co. Ltd.
799
812
  //
800
813
  // All rights reserved.