@kne-components/components-admin 1.1.25 → 1.1.26

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 (78) hide show
  1. package/build/asset-manifest.json +54 -50
  2. package/build/index.html +1 -1
  3. package/build/remoteEntry.js +1 -1
  4. package/build/remoteEntry.js.map +1 -1
  5. package/build/static/css/3066.cf4075eb.chunk.css +2 -0
  6. package/build/static/css/{3066.dc31dbc0.chunk.css.map → 3066.cf4075eb.chunk.css.map} +1 -1
  7. package/build/static/css/369.f468af01.chunk.css +2 -0
  8. package/build/static/css/{369.4e425294.chunk.css.map → 369.f468af01.chunk.css.map} +1 -1
  9. package/build/static/css/4168.b4ca737e.chunk.css +2 -0
  10. package/build/static/css/{4168.d040d109.chunk.css.map → 4168.b4ca737e.chunk.css.map} +1 -1
  11. package/build/static/css/4460.f6bca362.chunk.css +2 -0
  12. package/build/static/css/4460.f6bca362.chunk.css.map +1 -0
  13. package/build/static/css/4948.eea1c5f6.chunk.css +2 -0
  14. package/build/static/css/{4948.c27c1bb2.chunk.css.map → 4948.eea1c5f6.chunk.css.map} +1 -1
  15. package/build/static/css/{5084.ddc5e70e.chunk.css → 5084.f04eefae.chunk.css} +2 -2
  16. package/build/static/css/{5084.ddc5e70e.chunk.css.map → 5084.f04eefae.chunk.css.map} +1 -1
  17. package/build/static/css/5425.f468af01.chunk.css +2 -0
  18. package/build/static/css/{5425.4e425294.chunk.css.map → 5425.f468af01.chunk.css.map} +1 -1
  19. package/build/static/css/5795.a93a6cb7.chunk.css +2 -0
  20. package/build/static/css/{5795.138e7d4d.chunk.css.map → 5795.a93a6cb7.chunk.css.map} +1 -1
  21. package/build/static/css/6024.cb5d801f.chunk.css +2 -0
  22. package/build/static/css/{6024.2d74587b.chunk.css.map → 6024.cb5d801f.chunk.css.map} +1 -1
  23. package/build/static/css/7687.d33fb935.chunk.css +2 -0
  24. package/build/static/css/7687.d33fb935.chunk.css.map +1 -0
  25. package/build/static/css/875.73c1d7bd.chunk.css +12 -0
  26. package/build/static/css/875.73c1d7bd.chunk.css.map +1 -0
  27. package/build/static/js/{369.e1f9c751.chunk.js → 369.b78442fe.chunk.js} +3 -3
  28. package/build/static/js/{369.e1f9c751.chunk.js.map → 369.b78442fe.chunk.js.map} +1 -1
  29. package/build/static/js/3690.9a50be09.chunk.js +2 -0
  30. package/build/static/js/3690.9a50be09.chunk.js.map +1 -0
  31. package/build/static/js/{4836.e1f53cfe.chunk.js → 4836.74f296ea.chunk.js} +2 -2
  32. package/build/static/js/{4836.e1f53cfe.chunk.js.map → 4836.74f296ea.chunk.js.map} +1 -1
  33. package/build/static/js/{4948.3284a018.chunk.js → 4948.69740a43.chunk.js} +3 -3
  34. package/build/static/js/{4948.3284a018.chunk.js.map → 4948.69740a43.chunk.js.map} +1 -1
  35. package/build/static/js/{5084.99e2b83e.chunk.js → 5084.06a38430.chunk.js} +2 -2
  36. package/build/static/js/{5084.99e2b83e.chunk.js.map → 5084.06a38430.chunk.js.map} +1 -1
  37. package/build/static/js/{5272.b987cd40.chunk.js → 5272.ee8c301b.chunk.js} +2 -2
  38. package/build/static/js/{5272.b987cd40.chunk.js.map → 5272.ee8c301b.chunk.js.map} +1 -1
  39. package/build/static/js/{5425.ee671541.chunk.js → 5425.3a6321a3.chunk.js} +3 -3
  40. package/build/static/js/{5425.ee671541.chunk.js.map → 5425.3a6321a3.chunk.js.map} +1 -1
  41. package/build/static/js/{5795.05d21882.chunk.js → 5795.a6bfd18a.chunk.js} +3 -3
  42. package/build/static/js/{5795.05d21882.chunk.js.map → 5795.a6bfd18a.chunk.js.map} +1 -1
  43. package/build/static/js/{7517.3c13b48e.chunk.js → 7517.5b0506e9.chunk.js} +2 -2
  44. package/build/static/js/{7517.3c13b48e.chunk.js.map → 7517.5b0506e9.chunk.js.map} +1 -1
  45. package/build/static/js/{7687.810c9e57.chunk.js → 7687.0e4dc21a.chunk.js} +2 -2
  46. package/build/static/js/{7687.810c9e57.chunk.js.map → 7687.0e4dc21a.chunk.js.map} +1 -1
  47. package/build/static/js/{7747.556a6701.chunk.js → 7747.5fce18ee.chunk.js} +2 -2
  48. package/build/static/js/7747.5fce18ee.chunk.js.map +1 -0
  49. package/build/static/js/8406.6fb30c10.chunk.js +2 -0
  50. package/build/static/js/{8406.e8abf05d.chunk.js.map → 8406.6fb30c10.chunk.js.map} +1 -1
  51. package/build/static/js/{main.71bda9a2.js → main.d18c90b0.js} +2 -2
  52. package/build/static/js/{main.71bda9a2.js.map → main.d18c90b0.js.map} +1 -1
  53. package/build/static/media/check~elxgVvVe.d6bb9a199bf3a5853749ecea3ce6a127.svg +3 -0
  54. package/build/static/media/collapse~vphRLfPi.378d83c01100d172e79c04ba3179be58.svg +6 -0
  55. package/build/static/media/copy~drOLfxzP.5880fbbaf59db852794c06f32786d138.svg +4 -0
  56. package/build/static/media/expand~blSbUwvt.8a0d1f9fb3339d7da34c3117df14b545.svg +6 -0
  57. package/package.json +2 -2
  58. package/build/static/css/3066.dc31dbc0.chunk.css +0 -2
  59. package/build/static/css/369.4e425294.chunk.css +0 -2
  60. package/build/static/css/4168.d040d109.chunk.css +0 -2
  61. package/build/static/css/4460.9a69ea92.chunk.css +0 -2
  62. package/build/static/css/4460.9a69ea92.chunk.css.map +0 -1
  63. package/build/static/css/4948.c27c1bb2.chunk.css +0 -2
  64. package/build/static/css/5425.4e425294.chunk.css +0 -2
  65. package/build/static/css/5795.138e7d4d.chunk.css +0 -2
  66. package/build/static/css/6024.2d74587b.chunk.css +0 -2
  67. package/build/static/css/7687.e31548b1.chunk.css +0 -2
  68. package/build/static/css/7687.e31548b1.chunk.css.map +0 -1
  69. package/build/static/css/875.e7d143b9.chunk.css +0 -12
  70. package/build/static/css/875.e7d143b9.chunk.css.map +0 -1
  71. package/build/static/js/3556.7b6f32dc.chunk.js +0 -2
  72. package/build/static/js/3556.7b6f32dc.chunk.js.map +0 -1
  73. package/build/static/js/7747.556a6701.chunk.js.map +0 -1
  74. package/build/static/js/8406.e8abf05d.chunk.js +0 -2
  75. /package/build/static/js/{369.e1f9c751.chunk.js.LICENSE.txt → 369.b78442fe.chunk.js.LICENSE.txt} +0 -0
  76. /package/build/static/js/{4948.3284a018.chunk.js.LICENSE.txt → 4948.69740a43.chunk.js.LICENSE.txt} +0 -0
  77. /package/build/static/js/{5425.ee671541.chunk.js.LICENSE.txt → 5425.3a6321a3.chunk.js.LICENSE.txt} +0 -0
  78. /package/build/static/js/{5795.05d21882.chunk.js.LICENSE.txt → 5795.a6bfd18a.chunk.js.LICENSE.txt} +0 -0
@@ -0,0 +1,2 @@
1
+ (globalThis.webpackChunk_kne_components_components_admin=globalThis.webpackChunk_kne_components_components_admin||[]).push([[3690,8139],{43690(e,t,n){"use strict";n.r(t),n.d(t,{default:()=>_e});var s=n(52526),r=n(73884),i=n(98139),o=n.n(i);function c(e){return Array.isArray?Array.isArray(e):"[object Array]"===p(e)}function a(e){return"string"===typeof e}function l(e){return"number"===typeof e}function u(e){return!0===e||!1===e||function(e){return h(e)&&null!==e}(e)&&"[object Boolean]"==p(e)}function h(e){return"object"===typeof e}function d(e){return void 0!==e&&null!==e}function g(e){return!e.trim().length}function p(e){return null==e?void 0===e?"[object Undefined]":"[object Null]":Object.prototype.toString.call(e)}const f=Object.prototype.hasOwnProperty;class m{constructor(e){this._keys=[],this._keyMap={};let t=0;e.forEach(e=>{let n=x(e);this._keys.push(n),this._keyMap[n.id]=n,t+=n.weight}),this._keys.forEach(e=>{e.weight/=t})}get(e){return this._keyMap[e]}keys(){return this._keys}toJSON(){return JSON.stringify(this._keys)}}function x(e){let t=null,n=null,s=null,r=1,i=null;if(a(e)||c(e))s=e,t=A(e),n=y(e);else{if(!f.call(e,"name"))throw new Error((e=>`Missing ${e} property in key`)("name"));const o=e.name;if(s=o,f.call(e,"weight")&&(r=e.weight,r<=0))throw new Error((e=>`Property 'weight' in key '${e}' must be a positive integer`)(o));t=A(o),n=y(o),i=e.getFn}return{path:t,id:n,weight:r,src:s,getFn:i}}function A(e){return c(e)?e:e.split(".")}function y(e){return c(e)?e.join("."):e}var C={isCaseSensitive:!1,ignoreDiacritics:!1,includeScore:!1,keys:[],shouldSort:!0,sortFn:(e,t)=>e.score===t.score?e.idx<t.idx?-1:1:e.score<t.score?-1:1,includeMatches:!1,findAllMatches:!1,minMatchCharLength:1,location:0,threshold:.6,distance:100,...{useExtendedSearch:!1,getFn:function(e,t){let n=[],s=!1;const r=(e,t,i)=>{if(d(e))if(t[i]){const o=e[t[i]];if(!d(o))return;if(i===t.length-1&&(a(o)||l(o)||u(o)))n.push(function(e){return null==e?"":function(e){if("string"==typeof e)return e;let t=e+"";return"0"==t&&1/e==-1/0?"-0":t}(e)}(o));else if(c(o)){s=!0;for(let e=0,n=o.length;e<n;e+=1)r(o[e],t,i+1)}else t.length&&r(o,t,i+1)}else n.push(e)};return r(e,a(t)?t.split("."):t,0),s?n:n[0]},ignoreLocation:!1,ignoreFieldNorm:!1,fieldNormWeight:1}};const E=/[^ ]+/g;class v{constructor(){let{getFn:e=C.getFn,fieldNormWeight:t=C.fieldNormWeight}=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};this.norm=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:1,t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:3;const n=new Map,s=Math.pow(10,t);return{get(t){const r=t.match(E).length;if(n.has(r))return n.get(r);const i=1/Math.pow(r,.5*e),o=parseFloat(Math.round(i*s)/s);return n.set(r,o),o},clear(){n.clear()}}}(t,3),this.getFn=e,this.isCreated=!1,this.setIndexRecords()}setSources(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[];this.docs=e}setIndexRecords(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[];this.records=e}setKeys(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[];this.keys=e,this._keysMap={},e.forEach((e,t)=>{this._keysMap[e.id]=t})}create(){!this.isCreated&&this.docs.length&&(this.isCreated=!0,a(this.docs[0])?this.docs.forEach((e,t)=>{this._addString(e,t)}):this.docs.forEach((e,t)=>{this._addObject(e,t)}),this.norm.clear())}add(e){const t=this.size();a(e)?this._addString(e,t):this._addObject(e,t)}removeAt(e){this.records.splice(e,1);for(let t=e,n=this.size();t<n;t+=1)this.records[t].i-=1}getValueForItemAtKeyId(e,t){return e[this._keysMap[t]]}size(){return this.records.length}_addString(e,t){if(!d(e)||g(e))return;let n={v:e,i:t,n:this.norm.get(e)};this.records.push(n)}_addObject(e,t){let n={i:t,$:{}};this.keys.forEach((t,s)=>{let r=t.getFn?t.getFn(e):this.getFn(e,t.path);if(d(r))if(c(r)){let e=[];const t=[{nestedArrIndex:-1,value:r}];for(;t.length;){const{nestedArrIndex:n,value:s}=t.pop();if(d(s))if(a(s)&&!g(s)){let t={v:s,i:n,n:this.norm.get(s)};e.push(t)}else c(s)&&s.forEach((e,n)=>{t.push({nestedArrIndex:n,value:e})})}n.$[s]=e}else if(a(r)&&!g(r)){let e={v:r,n:this.norm.get(r)};n.$[s]=e}}),this.records.push(n)}toJSON(){return{keys:this.keys,records:this.records}}}function b(e,t){let{getFn:n=C.getFn,fieldNormWeight:s=C.fieldNormWeight}=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};const r=new v({getFn:n,fieldNormWeight:s});return r.setKeys(e.map(x)),r.setSources(t),r.create(),r}function j(e){let{errors:t=0,currentLocation:n=0,expectedLocation:s=0,distance:r=C.distance,ignoreLocation:i=C.ignoreLocation}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const o=t/e.length;if(i)return o;const c=Math.abs(s-n);return r?o+c/r:c?1:o}const M=32;function w(e,t,n){let{location:s=C.location,distance:r=C.distance,threshold:i=C.threshold,findAllMatches:o=C.findAllMatches,minMatchCharLength:c=C.minMatchCharLength,includeMatches:a=C.includeMatches,ignoreLocation:l=C.ignoreLocation}=arguments.length>3&&void 0!==arguments[3]?arguments[3]:{};if(t.length>M)throw new Error(`Pattern length exceeds max of ${M}.`);const u=t.length,h=e.length,d=Math.max(0,Math.min(s,h));let g=i,p=d;const f=c>1||a,m=f?Array(h):[];let x;for(;(x=e.indexOf(t,p))>-1;){let e=j(t,{currentLocation:x,expectedLocation:d,distance:r,ignoreLocation:l});if(g=Math.min(e,g),p=x+u,f){let e=0;for(;e<u;)m[x+e]=1,e+=1}}p=-1;let A=[],y=1,E=u+h;const v=1<<u-1;for(let C=0;C<u;C+=1){let s=0,i=E;for(;s<i;){j(t,{errors:C,currentLocation:d+i,expectedLocation:d,distance:r,ignoreLocation:l})<=g?s=i:E=i,i=Math.floor((E-s)/2+s)}E=i;let c=Math.max(1,d-i+1),a=o?h:Math.min(d+i,h)+u,x=Array(a+2);x[a+1]=(1<<C)-1;for(let o=a;o>=c;o-=1){let s=o-1,i=n[e.charAt(s)];if(f&&(m[s]=+!!i),x[o]=(x[o+1]<<1|1)&i,C&&(x[o]|=(A[o+1]|A[o])<<1|1|A[o+1]),x[o]&v&&(y=j(t,{errors:C,currentLocation:s,expectedLocation:d,distance:r,ignoreLocation:l}),y<=g)){if(g=y,p=s,p<=d)break;c=Math.max(1,2*d-p)}}if(j(t,{errors:C+1,currentLocation:d,expectedLocation:d,distance:r,ignoreLocation:l})>g)break;A=x}const b={isMatch:p>=0,score:Math.max(.001,y)};if(f){const e=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[],t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:C.minMatchCharLength,n=[],s=-1,r=-1,i=0;for(let o=e.length;i<o;i+=1){let o=e[i];o&&-1===s?s=i:o||-1===s||(r=i-1,r-s+1>=t&&n.push([s,r]),s=-1)}return e[i-1]&&i-s>=t&&n.push([s,i-1]),n}(m,c);e.length?a&&(b.indices=e):b.isMatch=!1}return b}function F(e){let t={};for(let n=0,s=e.length;n<s;n+=1){const r=e.charAt(n);t[r]=(t[r]||0)|1<<s-n-1}return t}const k=String.prototype.normalize?e=>e.normalize("NFD").replace(/[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u08D3-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B62\u0B63\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0C00-\u0C04\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D82\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EB9\u0EBB\u0EBC\u0EC8-\u0ECD\u0F18\u0F19\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F\u109A-\u109D\u135D-\u135F\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u180B-\u180D\u1885\u1886\u18A9\u1920-\u192B\u1930-\u193B\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F\u1AB0-\u1ABE\u1B00-\u1B04\u1B34-\u1B44\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BE6-\u1BF3\u1C24-\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF2-\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DF9\u1DFB-\u1DFF\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA880\uA881\uA8B4-\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9E5\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F]/g,""):e=>e;class B{constructor(e){let{location:t=C.location,threshold:n=C.threshold,distance:s=C.distance,includeMatches:r=C.includeMatches,findAllMatches:i=C.findAllMatches,minMatchCharLength:o=C.minMatchCharLength,isCaseSensitive:c=C.isCaseSensitive,ignoreDiacritics:a=C.ignoreDiacritics,ignoreLocation:l=C.ignoreLocation}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(this.options={location:t,threshold:n,distance:s,includeMatches:r,findAllMatches:i,minMatchCharLength:o,isCaseSensitive:c,ignoreDiacritics:a,ignoreLocation:l},e=c?e:e.toLowerCase(),e=a?k(e):e,this.pattern=e,this.chunks=[],!this.pattern.length)return;const u=(e,t)=>{this.chunks.push({pattern:e,alphabet:F(e),startIndex:t})},h=this.pattern.length;if(h>M){let e=0;const t=h%M,n=h-t;for(;e<n;)u(this.pattern.substr(e,M),e),e+=M;if(t){const e=h-M;u(this.pattern.substr(e),e)}}else u(this.pattern,0)}searchIn(e){const{isCaseSensitive:t,ignoreDiacritics:n,includeMatches:s}=this.options;if(e=t?e:e.toLowerCase(),e=n?k(e):e,this.pattern===e){let t={isMatch:!0,score:0};return s&&(t.indices=[[0,e.length-1]]),t}const{location:r,distance:i,threshold:o,findAllMatches:c,minMatchCharLength:a,ignoreLocation:l}=this.options;let u=[],h=0,d=!1;this.chunks.forEach(t=>{let{pattern:n,alphabet:g,startIndex:p}=t;const{isMatch:f,score:m,indices:x}=w(e,n,g,{location:r+p,distance:i,threshold:o,findAllMatches:c,minMatchCharLength:a,includeMatches:s,ignoreLocation:l});f&&(d=!0),h+=m,f&&x&&(u=[...u,...x])});let g={isMatch:d,score:d?h/this.chunks.length:1};return d&&s&&(g.indices=u),g}}class D{constructor(e){this.pattern=e}static isMultiMatch(e){return _(e,this.multiRegex)}static isSingleMatch(e){return _(e,this.singleRegex)}search(){}}function _(e,t){const n=e.match(t);return n?n[1]:null}class L extends D{constructor(e){let{location:t=C.location,threshold:n=C.threshold,distance:s=C.distance,includeMatches:r=C.includeMatches,findAllMatches:i=C.findAllMatches,minMatchCharLength:o=C.minMatchCharLength,isCaseSensitive:c=C.isCaseSensitive,ignoreDiacritics:a=C.ignoreDiacritics,ignoreLocation:l=C.ignoreLocation}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};super(e),this._bitapSearch=new B(e,{location:t,threshold:n,distance:s,includeMatches:r,findAllMatches:i,minMatchCharLength:o,isCaseSensitive:c,ignoreDiacritics:a,ignoreLocation:l})}static get type(){return"fuzzy"}static get multiRegex(){return/^"(.*)"$/}static get singleRegex(){return/^(.*)$/}search(e){return this._bitapSearch.searchIn(e)}}class N extends D{constructor(e){super(e)}static get type(){return"include"}static get multiRegex(){return/^'"(.*)"$/}static get singleRegex(){return/^'(.*)$/}search(e){let t,n=0;const s=[],r=this.pattern.length;for(;(t=e.indexOf(this.pattern,n))>-1;)n=t+r,s.push([t,n-1]);const i=!!s.length;return{isMatch:i,score:i?0:1,indices:s}}}const S=[class extends D{constructor(e){super(e)}static get type(){return"exact"}static get multiRegex(){return/^="(.*)"$/}static get singleRegex(){return/^=(.*)$/}search(e){const t=e===this.pattern;return{isMatch:t,score:t?0:1,indices:[0,this.pattern.length-1]}}},N,class extends D{constructor(e){super(e)}static get type(){return"prefix-exact"}static get multiRegex(){return/^\^"(.*)"$/}static get singleRegex(){return/^\^(.*)$/}search(e){const t=e.startsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,this.pattern.length-1]}}},class extends D{constructor(e){super(e)}static get type(){return"inverse-prefix-exact"}static get multiRegex(){return/^!\^"(.*)"$/}static get singleRegex(){return/^!\^(.*)$/}search(e){const t=!e.startsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},class extends D{constructor(e){super(e)}static get type(){return"inverse-suffix-exact"}static get multiRegex(){return/^!"(.*)"\$$/}static get singleRegex(){return/^!(.*)\$$/}search(e){const t=!e.endsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},class extends D{constructor(e){super(e)}static get type(){return"suffix-exact"}static get multiRegex(){return/^"(.*)"\$$/}static get singleRegex(){return/^(.*)\$$/}search(e){const t=e.endsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[e.length-this.pattern.length,e.length-1]}}},class extends D{constructor(e){super(e)}static get type(){return"inverse-exact"}static get multiRegex(){return/^!"(.*)"$/}static get singleRegex(){return/^!(.*)$/}search(e){const t=-1===e.indexOf(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},L],I=S.length,$=/ +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/;const O=new Set([L.type,N.type]);class J{constructor(e){let{isCaseSensitive:t=C.isCaseSensitive,ignoreDiacritics:n=C.ignoreDiacritics,includeMatches:s=C.includeMatches,minMatchCharLength:r=C.minMatchCharLength,ignoreLocation:i=C.ignoreLocation,findAllMatches:o=C.findAllMatches,location:c=C.location,threshold:a=C.threshold,distance:l=C.distance}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};this.query=null,this.options={isCaseSensitive:t,ignoreDiacritics:n,includeMatches:s,minMatchCharLength:r,findAllMatches:o,ignoreLocation:i,location:c,threshold:a,distance:l},e=t?e:e.toLowerCase(),e=n?k(e):e,this.pattern=e,this.query=function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};return e.split("|").map(e=>{let n=e.trim().split($).filter(e=>e&&!!e.trim()),s=[];for(let r=0,i=n.length;r<i;r+=1){const e=n[r];let i=!1,o=-1;for(;!i&&++o<I;){const n=S[o];let r=n.isMultiMatch(e);r&&(s.push(new n(r,t)),i=!0)}if(!i)for(o=-1;++o<I;){const n=S[o];let r=n.isSingleMatch(e);if(r){s.push(new n(r,t));break}}}return s})}(this.pattern,this.options)}static condition(e,t){return t.useExtendedSearch}searchIn(e){const t=this.query;if(!t)return{isMatch:!1,score:1};const{includeMatches:n,isCaseSensitive:s,ignoreDiacritics:r}=this.options;e=s?e:e.toLowerCase(),e=r?k(e):e;let i=0,o=[],c=0;for(let a=0,l=t.length;a<l;a+=1){const s=t[a];o.length=0,i=0;for(let t=0,r=s.length;t<r;t+=1){const r=s[t],{isMatch:a,indices:l,score:u}=r.search(e);if(!a){c=0,i=0,o.length=0;break}if(i+=1,c+=u,n){const e=r.constructor.type;O.has(e)?o=[...o,...l]:o.push(l)}}if(i){let e={isMatch:!0,score:c/i};return n&&(e.indices=o),e}}return{isMatch:!1,score:1}}}const V=[];function R(e,t){for(let n=0,s=V.length;n<s;n+=1){let s=V[n];if(s.condition(e,t))return new s(e,t)}return new B(e,t)}const W="$and",P="$or",z="$path",T="$val",K=e=>!(!e[W]&&!e[P]),q=e=>({[W]:Object.keys(e).map(t=>({[t]:e[t]}))});function Q(e,t){let{auto:n=!0}=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};const s=e=>{let r=Object.keys(e);const i=(e=>!!e[z])(e);if(!i&&r.length>1&&!K(e))return s(q(e));if((e=>!c(e)&&h(e)&&!K(e))(e)){const s=i?e[z]:r[0],o=i?e[T]:e[s];if(!a(o))throw new Error((e=>`Invalid value for key ${e}`)(s));const c={keyId:y(s),pattern:o};return n&&(c.searcher=R(o,t)),c}let o={children:[],operator:r[0]};return r.forEach(t=>{const n=e[t];c(n)&&n.forEach(e=>{o.children.push(s(e))})}),o};return K(e)||(e=q(e)),s(e)}function U(e,t){const n=e.matches;t.matches=[],d(n)&&n.forEach(e=>{if(!d(e.indices)||!e.indices.length)return;const{indices:n,value:s}=e;let r={indices:n,value:s};e.key&&(r.key=e.key.src),e.idx>-1&&(r.refIndex=e.idx),t.matches.push(r)})}function H(e,t){t.score=e.score}class X{constructor(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},n=arguments.length>2?arguments[2]:void 0;this.options={...C,...t},this.options.useExtendedSearch,this._keyStore=new m(this.options.keys),this.setCollection(e,n)}setCollection(e,t){if(this._docs=e,t&&!(t instanceof v))throw new Error("Incorrect 'index' type");this._myIndex=t||b(this.options.keys,this._docs,{getFn:this.options.getFn,fieldNormWeight:this.options.fieldNormWeight})}add(e){d(e)&&(this._docs.push(e),this._myIndex.add(e))}remove(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:()=>!1;const t=[];for(let n=0,s=this._docs.length;n<s;n+=1){const r=this._docs[n];e(r,n)&&(this.removeAt(n),n-=1,s-=1,t.push(r))}return t}removeAt(e){this._docs.splice(e,1),this._myIndex.removeAt(e)}getIndex(){return this._myIndex}search(e){let{limit:t=-1}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const{includeMatches:n,includeScore:s,shouldSort:r,sortFn:i,ignoreFieldNorm:o}=this.options;let c=a(e)?a(this._docs[0])?this._searchStringList(e):this._searchObjectList(e):this._searchLogical(e);return function(e,t){let{ignoreFieldNorm:n=C.ignoreFieldNorm}=t;e.forEach(e=>{let t=1;e.matches.forEach(e=>{let{key:s,norm:r,score:i}=e;const o=s?s.weight:null;t*=Math.pow(0===i&&o?Number.EPSILON:i,(o||1)*(n?1:r))}),e.score=t})}(c,{ignoreFieldNorm:o}),r&&c.sort(i),l(t)&&t>-1&&(c=c.slice(0,t)),function(e,t){let{includeMatches:n=C.includeMatches,includeScore:s=C.includeScore}=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};const r=[];return n&&r.push(U),s&&r.push(H),e.map(e=>{const{idx:n}=e,s={item:t[n],refIndex:n};return r.length&&r.forEach(t=>{t(e,s)}),s})}(c,this._docs,{includeMatches:n,includeScore:s})}_searchStringList(e){const t=R(e,this.options),{records:n}=this._myIndex,s=[];return n.forEach(e=>{let{v:n,i:r,n:i}=e;if(!d(n))return;const{isMatch:o,score:c,indices:a}=t.searchIn(n);o&&s.push({item:n,idx:r,matches:[{score:c,value:n,norm:i,indices:a}]})}),s}_searchLogical(e){const t=Q(e,this.options),n=(e,t,s)=>{if(!e.children){const{keyId:n,searcher:r}=e,i=this._findMatches({key:this._keyStore.get(n),value:this._myIndex.getValueForItemAtKeyId(t,n),searcher:r});return i&&i.length?[{idx:s,item:t,matches:i}]:[]}const r=[];for(let i=0,o=e.children.length;i<o;i+=1){const o=e.children[i],c=n(o,t,s);if(c.length)r.push(...c);else if(e.operator===W)return[]}return r},s=this._myIndex.records,r={},i=[];return s.forEach(e=>{let{$:s,i:o}=e;if(d(s)){let e=n(t,s,o);e.length&&(r[o]||(r[o]={idx:o,item:s,matches:[]},i.push(r[o])),e.forEach(e=>{let{matches:t}=e;r[o].matches.push(...t)}))}}),i}_searchObjectList(e){const t=R(e,this.options),{keys:n,records:s}=this._myIndex,r=[];return s.forEach(e=>{let{$:s,i:i}=e;if(!d(s))return;let o=[];n.forEach((e,n)=>{o.push(...this._findMatches({key:e,value:s[n],searcher:t}))}),o.length&&r.push({idx:i,item:s,matches:o})}),r}_findMatches(e){let{key:t,value:n,searcher:s}=e;if(!d(n))return[];let r=[];if(c(n))n.forEach(e=>{let{v:n,i:i,n:o}=e;if(!d(n))return;const{isMatch:c,score:a,indices:l}=s.searchIn(n);c&&r.push({score:a,key:t,value:n,idx:i,norm:o,indices:l})});else{const{v:e,n:i}=n,{isMatch:o,score:c,indices:a}=s.searchIn(e);o&&r.push({score:c,key:t,value:e,norm:i,indices:a})}return r}}X.version="7.1.0",X.createIndex=b,X.parseIndex=function(e){let{getFn:t=C.getFn,fieldNormWeight:n=C.fieldNormWeight}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const{keys:s,records:r}=e,i=new v({getFn:t,fieldNormWeight:n});return i.setKeys(s),i.setIndexRecords(r),i},X.config=C,X.parseQuery=Q,function(){V.push(...arguments)}(J);var Z,G,Y=n(70579);function ee(){return ee=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var s in n)({}).hasOwnProperty.call(n,s)&&(e[s]=n[s])}return e},ee.apply(null,arguments)}function te(e,t){let{title:n,titleId:s,...i}=e;return r.createElement("svg",ee({width:16,height:16,viewBox:"0 0 24 24",fill:"none",stroke:"currentColor",strokeWidth:2,strokeLinecap:"round",strokeLinejoin:"round",ref:t,"aria-labelledby":s},i),n?r.createElement("title",{id:s},n):null,Z||(Z=r.createElement("rect",{x:9,y:9,width:13,height:13,rx:2,ry:2})),G||(G=r.createElement("path",{d:"M5 15H4a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h9a2 2 0 0 1 2 2v1"})))}const ne=r.forwardRef(te);n.p;var se;function re(){return re=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var s in n)({}).hasOwnProperty.call(n,s)&&(e[s]=n[s])}return e},re.apply(null,arguments)}function ie(e,t){let{title:n,titleId:s,...i}=e;return r.createElement("svg",re({width:16,height:16,viewBox:"0 0 24 24",fill:"none",stroke:"currentColor",strokeWidth:2,strokeLinecap:"round",strokeLinejoin:"round",ref:t,"aria-labelledby":s},i),n?r.createElement("title",{id:s},n):null,se||(se=r.createElement("polyline",{points:"20 6 9 17 4 12"})))}const oe=r.forwardRef(ie);n.p;var ce,ae,le,ue;function he(){return he=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var s in n)({}).hasOwnProperty.call(n,s)&&(e[s]=n[s])}return e},he.apply(null,arguments)}function de(e,t){let{title:n,titleId:s,...i}=e;return r.createElement("svg",he({width:16,height:16,viewBox:"0 0 24 24",fill:"none",stroke:"currentColor",strokeWidth:2,strokeLinecap:"round",strokeLinejoin:"round",ref:t,"aria-labelledby":s},i),n?r.createElement("title",{id:s},n):null,ce||(ce=r.createElement("polyline",{points:"15 3 21 3 21 9"})),ae||(ae=r.createElement("polyline",{points:"9 21 3 21 3 15"})),le||(le=r.createElement("line",{x1:21,y1:3,x2:14,y2:10})),ue||(ue=r.createElement("line",{x1:3,y1:21,x2:10,y2:14})))}const ge=r.forwardRef(de);n.p;var pe,fe,me,xe;function Ae(){return Ae=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var s in n)({}).hasOwnProperty.call(n,s)&&(e[s]=n[s])}return e},Ae.apply(null,arguments)}function ye(e,t){let{title:n,titleId:s,...i}=e;return r.createElement("svg",Ae({width:16,height:16,viewBox:"0 0 24 24",fill:"none",stroke:"currentColor",strokeWidth:2,strokeLinecap:"round",strokeLinejoin:"round",ref:t,"aria-labelledby":s},i),n?r.createElement("title",{id:s},n):null,pe||(pe=r.createElement("polyline",{points:"4 14 10 14 10 20"})),fe||(fe=r.createElement("polyline",{points:"20 10 14 10 14 4"})),me||(me=r.createElement("line",{x1:14,y1:10,x2:21,y2:3})),xe||(xe=r.createElement("line",{x1:3,y1:21,x2:10,y2:14})))}const Ce=r.forwardRef(ye),Ee=(n.p,(0,s.createWithIntlProvider)({defaultLocale:"zh-CN",messages:{"zh-CN":{"JsonView.label":"JSON \u67e5\u770b\u5668","JsonView.searchPlaceholder":"\u641c\u7d22...","JsonView.expand":"\u5c55\u5f00","JsonView.collapse":"\u6536\u8d77","JsonView.expandAll":"\u5c55\u5f00\u5168\u90e8","JsonView.collapseAll":"\u6536\u8d77\u5168\u90e8","JsonView.items":"\u9879","JsonView.keys":"\u4e2a\u952e","JsonView.copy":"\u590d\u5236","JsonView.copied":"\u5df2\u590d\u5236"},"en-US":{"JsonView.label":"JSON Viewer","JsonView.searchPlaceholder":"Search...","JsonView.expand":"Expand","JsonView.collapse":"Collapse","JsonView.expandAll":"Expand All","JsonView.collapseAll":"Collapse All","JsonView.items":"items","JsonView.keys":"keys","JsonView.copy":"Copy","JsonView.copied":"Copied"}},namespace:"json-view"})),ve=e=>null===e?"null":Array.isArray(e)?"array":typeof e,be=e=>{const t=ve(e);if("array"!==t&&"object"!==t)return 1;if("array"===t)return 0===e.length?1:1+e.reduce((e,t)=>e+be(t),0)+1;if("object"===t){const t=Object.keys(e);return 0===t.length?1:1+t.reduce((t,n)=>t+be(e[n]),0)+1}return 1},je=function(e,t){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:["root"],s=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;const r=new Set,i=ve(e);return"array"!==i&&"object"!==i||(s>=t&&r.add(n.join(".")),"array"===i?e.forEach((e,i)=>{je(e,t,[...n,i],s+1).forEach(e=>r.add(e))}):"object"===i&&Object.entries(e).forEach(e=>{let[i,o]=e;je(o,t,[...n,i],s+1).forEach(e=>r.add(e))})),r},Me=function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:["root"];const n=[],s=ve(e),r=t.join(".");return n.push({path:r,value:e,type:s}),"array"===s?e.forEach((e,s)=>{n.push(...Me(e,[...t,s]))}):"object"===s&&null!==e&&Object.entries(e).forEach(e=>{let[s,r]=e;n.push(...Me(r,[...t,s]))}),n},we=function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:["root"];const n=new Set,s=ve(e);return"array"!==s&&"object"!==s||"array"===s&&0===e.length||"object"===s&&0===Object.keys(e).length||(n.add(t.join(".")),"array"===s?e.forEach((e,s)=>{we(e,[...t,s]).forEach(e=>n.add(e))}):Object.entries(e).forEach(e=>{let[s,r]=e;we(r,[...t,s]).forEach(e=>n.add(e))})),n};var Fe={wrapper:"_Gah47",toolbar:"_oesko","toolbar-right":"_QwxDF","search-wrapper":"_qC3rr","search-input":"_zHTh7","clear-btn":"_dc0JP","action-btn":"_mLgqh","button-group":"_pC1Lu",container:"_AIhaC","show-line-numbers":"_U5LlB",line:"_60jp6","close-line":"_Ilatn",highlight:"_zuXAP",matched:"_QVax6","theme-light":"_zDNAx",toggle:"_Tnz1N",arrow:"_Ktfhg",bracket:"_Z-pL9",preview:"_tIMOh",content:"_XZmmG",key:"_7jiBE",colon:"_KtY8d",comma:"_A0uZ4",string:"_gs9ka",number:"_EiXo7",boolean:"_ku2F-",null:"_nRonT","open-line":"_F5rST","theme-dark":"_Vozlg",collapsible:"_3UbHF",expanded:"_4RR-f"};const ke=e=>{let{text:t,highlight:n}=e;if(!n)return(0,Y.jsx)(Y.Fragment,{children:t});const s=new RegExp(`(${n.replace(/[.*+?^${}()|[\]\\]/g,"\\$&")})`,"gi"),r=t.split(s);return(0,Y.jsx)(Y.Fragment,{children:r.map((e,t)=>s.test(e)?(0,Y.jsx)("span",{className:Fe.highlight,children:e},t):(0,Y.jsx)("span",{children:e},t))})},Be=e=>{let{data:t,path:n,onToggle:i,collapsedKeys:c,highlight:a,matchedPaths:l,indentWidth:u,showComma:h}=e;const{formatMessage:d}=(0,s.useIntl)(),g=ve(t),p=n.join("."),f=c.has(p),m=l.has(p),x=(0,r.useCallback)(()=>{i(p)},[p,i]);if("null"===g)return(0,Y.jsxs)(Y.Fragment,{children:[(0,Y.jsx)("span",{className:o()(Fe.null,{[Fe.matched]:m}),children:"null"}),h&&(0,Y.jsx)("span",{className:Fe.comma,children:","})]});if("undefined"===g)return(0,Y.jsxs)(Y.Fragment,{children:[(0,Y.jsx)("span",{className:o()(Fe.null,{[Fe.matched]:m}),children:"undefined"}),h&&(0,Y.jsx)("span",{className:Fe.comma,children:","})]});if("boolean"===g)return(0,Y.jsxs)(Y.Fragment,{children:[(0,Y.jsx)("span",{className:o()(Fe.boolean,{[Fe.matched]:m}),children:(0,Y.jsx)(ke,{text:t?"true":"false",highlight:a})}),h&&(0,Y.jsx)("span",{className:Fe.comma,children:","})]});if("number"===g)return(0,Y.jsxs)(Y.Fragment,{children:[(0,Y.jsx)("span",{className:o()(Fe.number,{[Fe.matched]:m}),children:(0,Y.jsx)(ke,{text:String(t),highlight:a})}),h&&(0,Y.jsx)("span",{className:Fe.comma,children:","})]});if("string"===g)return(0,Y.jsxs)(Y.Fragment,{children:[(0,Y.jsxs)("span",{className:o()(Fe.string,{[Fe.matched]:m}),children:['"',(0,Y.jsx)(ke,{text:t,highlight:a}),'"']}),h&&(0,Y.jsx)("span",{className:Fe.comma,children:","})]});if("array"===g||"object"===g){const e="array"===g?t.map((e,t)=>[t,e]):Object.entries(t),s=0===e.length,r="array"===g?"[":"{",p="array"===g?"]":"}";return s?(0,Y.jsxs)("span",{className:Fe.bracket,children:[r,p]}):(0,Y.jsxs)("span",{className:Fe.collapsible,children:[(0,Y.jsx)("span",{className:Fe["open-line"],children:(0,Y.jsxs)("span",{className:Fe.toggle,onClick:x,children:[(0,Y.jsx)("span",{className:o()(Fe.arrow,{[Fe.expanded]:!f}),children:"\u25b6"}),(0,Y.jsx)("span",{className:Fe.bracket,children:r})]})}),f&&(0,Y.jsxs)("span",{className:Fe.preview,children:["...",e.length," ",d({id:"JsonView."+("array"===g?"items":"keys")})]}),f&&(0,Y.jsxs)(Y.Fragment,{children:[(0,Y.jsx)("span",{className:Fe.bracket,children:p}),h&&(0,Y.jsx)("span",{className:Fe.comma,children:","})]}),!f&&(0,Y.jsxs)(Y.Fragment,{children:[(0,Y.jsx)("span",{className:Fe.content,style:{paddingLeft:`${u}px`},children:e.map((t,s)=>{let[r,o]=t;const h=[...n,r],d=ve(o),p=h.join("."),f=c.has(p),m="array"===d||"object"===d?be(o):1,x=f&&m>1;return(0,Y.jsxs)("div",{className:Fe.line,style:x?{"--line-count":m}:void 0,children:[(0,Y.jsx)("span",{className:Fe.key,children:"object"===g?`"${r}"`:r}),(0,Y.jsx)("span",{className:Fe.colon,children:":"}),(0,Y.jsx)(Be,{data:o,path:h,onToggle:i,collapsedKeys:c,highlight:a,matchedPaths:l,indentWidth:u,showComma:s<e.length-1})]},r)})}),(0,Y.jsxs)("span",{className:Fe["close-line"],children:[(0,Y.jsx)("span",{className:Fe.bracket,children:p}),h&&(0,Y.jsx)("span",{className:Fe.comma,children:","})]})]})]})}return(0,Y.jsx)("span",{children:String(t)})},De=e=>{let{searchQuery:t,onSearchChange:n,onToggleExpand:i,isAllExpanded:c,theme:a,searchable:l,collapsable:u,data:h}=e;const{formatMessage:d}=(0,s.useIntl)(),[g,p]=(0,r.useState)(!1);return(0,Y.jsxs)("div",{className:o()(Fe.toolbar,Fe[`theme-${a}`],{[Fe["toolbar-right"]]:!l&&u}),children:[l&&(0,Y.jsxs)("div",{className:Fe["search-wrapper"],children:[(0,Y.jsx)("input",{type:"text",value:t,onChange:e=>n(e.target.value),placeholder:d({id:"JsonView.searchPlaceholder"}),className:Fe["search-input"]}),t&&(0,Y.jsx)("button",{className:Fe["clear-btn"],onClick:()=>n(""),children:"\xd7"})]}),(0,Y.jsxs)("div",{className:Fe["button-group"],children:[(0,Y.jsx)("button",{className:Fe["action-btn"],onClick:async()=>{try{const e=JSON.stringify(h,null,2);await navigator.clipboard.writeText(e),p(!0),setTimeout(()=>p(!1),2e3)}catch(e){console.error("Failed to copy:",e)}},title:d({id:g?"JsonView.copied":"JsonView.copy"}),children:g?(0,Y.jsx)(oe,{}):(0,Y.jsx)(ne,{})}),u&&(0,Y.jsx)("button",{className:Fe["action-btn"],onClick:i,title:d({id:c?"JsonView.collapseAll":"JsonView.expandAll"}),children:c?(0,Y.jsx)(Ce,{}):(0,Y.jsx)(ge,{})})]})]})},_e=Ee(e=>{let{data:t,collapsedFrom:n=1/0,theme:s="dark",searchable:i=!0,collapsable:c=!0,indentWidth:a=20,showLineNumbers:l=!0,className:u}=e;const[h,d]=(0,r.useState)(""),g=(0,r.useMemo)(()=>void 0===t||n===1/0?new Set:je(t,n),[t,n]),[p,f]=(0,r.useState)(g),m=(0,r.useMemo)(()=>void 0===t?new Set:we(t),[t]),x=(0,r.useMemo)(()=>void 0===t?[]:Me(t),[t]),A=(0,r.useMemo)(()=>new X(x,{keys:["value"],includeMatches:!0,threshold:.3,ignoreLocation:!0,minMatchCharLength:1}),[x]),y=(0,r.useMemo)(()=>((e,t)=>{if(!t||!e)return new Set;const n=e.search(t),s=new Set;return n.forEach(e=>{const t=e.item.path;s.add(t);const n=t.split(".");for(let r=1;r<n.length;r++)s.add(n.slice(0,r).join("."))}),s})(A,h),[A,h]);(0,r.useEffect)(()=>{h&&y.size>0&&f(e=>{const t=new Set(e);return y.forEach(e=>{t.has(e)&&t.delete(e)}),t})},[h,y]);const C=(0,r.useCallback)(e=>{f(t=>{const n=new Set(t);return n.has(e)?n.delete(e):n.add(e),n})},[]),E=(0,r.useCallback)(()=>{f(new Set)},[]),v=(0,r.useCallback)(()=>{f(new Set(m))},[m]),b=0===p.size,j=(0,r.useMemo)(()=>void 0===t?1:be(t),[t]),M=(0,r.useMemo)(()=>{const e=ve(t);return"array"!==e&&"object"!==e?1:p.has("root")?j:1},[t,p,j]),w=(0,r.useMemo)(()=>{const e=String(j).length;return Math.max(32,Math.ceil(7.5*e+12))},[j]),F=(0,r.useCallback)(()=>{b?v():E()},[b,E,v]);return void 0===t?(0,Y.jsx)("div",{className:o()(Fe.container,Fe[`theme-${s}`],u),children:(0,Y.jsx)("span",{className:Fe.null,children:"undefined"})}):(0,Y.jsxs)("div",{className:o()(Fe.wrapper,Fe[`theme-${s}`],u),children:[(i||c)&&(0,Y.jsx)(De,{searchQuery:h,onSearchChange:d,onToggleExpand:F,isAllExpanded:b,theme:s,searchable:i,collapsable:c,data:t}),(0,Y.jsx)("div",{className:o()(Fe.container,{[Fe["show-line-numbers"]]:l}),style:l?{"--line-number-width":`${w}px`}:void 0,children:(0,Y.jsx)("div",{className:Fe.line,style:M>1?{"--line-count":M}:void 0,children:(0,Y.jsx)(Be,{data:t,path:["root"],onToggle:C,collapsedKeys:p,highlight:h,matchedPaths:y,indentWidth:a})})})]})})},98139(e,t){var n;!function(){"use strict";var s={}.hasOwnProperty;function r(){for(var e="",t=0;t<arguments.length;t++){var n=arguments[t];n&&(e=o(e,i(n)))}return e}function i(e){if("string"===typeof e||"number"===typeof e)return e;if("object"!==typeof e)return"";if(Array.isArray(e))return r.apply(null,e);if(e.toString!==Object.prototype.toString&&!e.toString.toString().includes("[native code]"))return e.toString();var t="";for(var n in e)s.call(e,n)&&e[n]&&(t=o(t,n));return t}function o(e,t){return t?e?e+" "+t:e+t:e}e.exports?(r.default=r,e.exports=r):void 0===(n=function(){return r}.apply(t,[]))||(e.exports=n)}()}}]);
2
+ //# sourceMappingURL=3690.9a50be09.chunk.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"static/js/3690.9a50be09.chunk.js","mappings":"gPASA,SAASA,EAAQC,GACf,OAAQC,MAAMF,QAEVE,MAAMF,QAAQC,GADI,mBAAlBE,EAAOF,EAEb,CAiBA,SAASG,EAASH,GAChB,MAAwB,kBAAVA,CAChB,CAEA,SAASI,EAASJ,GAChB,MAAwB,kBAAVA,CAChB,CAGA,SAASK,EAAUL,GACjB,OACY,IAAVA,IACU,IAAVA,GAUJ,SAAsBA,GACpB,OAAOM,EAASN,IAAoB,OAAVA,CAC5B,CAXKO,CAAaP,IAA2B,oBAAjBE,EAAOF,EAEnC,CAEA,SAASM,EAASN,GAChB,MAAwB,kBAAVA,CAChB,CAOA,SAASQ,EAAUR,GACjB,YAAiBS,IAAVT,GAAiC,OAAVA,CAChC,CAEA,SAASU,EAAQV,GACf,OAAQA,EAAMW,OAAOC,MACvB,CAIA,SAASV,EAAOF,GACd,OAAgB,MAATA,OACOS,IAAVT,EACE,qBACA,gBACFa,OAAOC,UAAUC,SAASC,KAAKhB,EACrC,CAEA,MAeMiB,EAASJ,OAAOC,UAAUI,eAEhC,MAAMC,EACJC,WAAAA,CAAYC,GACVC,KAAKC,MAAQ,GACbD,KAAKE,QAAU,CAAC,EAEhB,IAAIC,EAAc,EAElBJ,EAAKK,QAASC,IACZ,IAAIC,EAAMC,EAAUF,GAEpBL,KAAKC,MAAMO,KAAKF,GAChBN,KAAKE,QAAQI,EAAIG,IAAMH,EAEvBH,GAAeG,EAAII,SAIrBV,KAAKC,MAAMG,QAASC,IAClBA,EAAIK,QAAUP,GAElB,CACAQ,GAAAA,CAAIC,GACF,OAAOZ,KAAKE,QAAQU,EACtB,CACAb,IAAAA,GACE,OAAOC,KAAKC,KACd,CACAY,MAAAA,GACE,OAAOC,KAAKC,UAAUf,KAAKC,MAC7B,EAGF,SAASM,EAAUF,GACjB,IAAIW,EAAO,KACPP,EAAK,KACLQ,EAAM,KACNP,EAAS,EACTQ,EAAQ,KAEZ,GAAIrC,EAASwB,IAAQ5B,EAAQ4B,GAC3BY,EAAMZ,EACNW,EAAOG,EAAcd,GACrBI,EAAKW,EAAYf,OACZ,CACL,IAAKV,EAAOD,KAAKW,EAAK,QACpB,MAAM,IAAIgB,MApDcC,IAAS,WAAWA,oBAoD5BC,CAAqB,SAGvC,MAAMD,EAAOjB,EAAIiB,KAGjB,GAFAL,EAAMK,EAEF3B,EAAOD,KAAKW,EAAK,YACnBK,EAASL,EAAIK,OAETA,GAAU,GACZ,MAAM,IAAIW,MA5DgBhB,IAChC,6BAA6BA,gCA2DPmB,CAAyBF,IAI7CN,EAAOG,EAAcG,GACrBb,EAAKW,EAAYE,GACjBJ,EAAQb,EAAIa,KACd,CAEA,MAAO,CAAEF,OAAMP,KAAIC,SAAQO,MAAKC,QAClC,CAEA,SAASC,EAAcd,GACrB,OAAO5B,EAAQ4B,GAAOA,EAAMA,EAAIoB,MAAM,IACxC,CAEA,SAASL,EAAYf,GACnB,OAAO5B,EAAQ4B,GAAOA,EAAIqB,KAAK,KAAOrB,CACxC,CA6GA,IAAIsB,EAAS,CA9CXC,iBAAiB,EAEjBC,kBAAkB,EAElBC,cAAc,EAEd/B,KAAM,GAENgC,YAAY,EAEZC,OAAQA,CAACC,EAAGC,IACVD,EAAEE,QAAUD,EAAEC,MAASF,EAAEG,IAAMF,EAAEE,KAAO,EAAI,EAAKH,EAAEE,MAAQD,EAAEC,OAAS,EAAI,EAtB5EE,gBAAgB,EAGhBC,gBAAgB,EAEhBC,mBAAoB,EAsBpBC,SAAU,EAGVC,UAAW,GAMXC,SAAU,OAGY,CAEtBC,mBAAmB,EAGnBzB,MA9FF,SAAaZ,EAAKU,GAChB,IAAI4B,EAAO,GACPC,GAAM,EAEV,MAAMC,EAAUA,CAACxC,EAAKU,EAAM+B,KAC1B,GAAK7D,EAAUoB,GAGf,GAAKU,EAAK+B,GAGH,CAGL,MAAMrE,EAAQ4B,EAFJU,EAAK+B,IAIf,IAAK7D,EAAUR,GACb,OAKF,GACEqE,IAAU/B,EAAK1B,OAAS,IACvBT,EAASH,IAAUI,EAASJ,IAAUK,EAAUL,IAEjDkE,EAAKpC,KAtKb,SAAkB9B,GAChB,OAAgB,MAATA,EAAgB,GAVzB,SAAsBA,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,IAAIsE,EAAStE,EAAQ,GACrB,MAAiB,KAAVsE,GAAiB,EAAItE,IAAS,IAAY,KAAOsE,CAC1D,CAG8BC,CAAavE,EAC3C,CAoKkBe,CAASf,SACd,GAAID,EAAQC,GAAQ,CACzBmE,GAAM,EAEN,IAAK,IAAIK,EAAI,EAAGC,EAAMzE,EAAMY,OAAQ4D,EAAIC,EAAKD,GAAK,EAChDJ,EAAQpE,EAAMwE,GAAIlC,EAAM+B,EAAQ,EAEpC,MAAW/B,EAAK1B,QAEdwD,EAAQpE,EAAOsC,EAAM+B,EAAQ,EAEjC,MA3BEH,EAAKpC,KAAKF,IAiCd,OAFAwC,EAAQxC,EAAKzB,EAASmC,GAAQA,EAAKS,MAAM,KAAOT,EAAM,GAE/C6B,EAAMD,EAAOA,EAAK,EAC3B,EAsDEQ,gBAAgB,EAIhBC,iBAAiB,EAEjBC,gBAAiB,IAUnB,MAAMC,EAAQ,SAgCd,MAAMC,EACJ1D,WAAAA,GAGQ,IAHI,MACVoB,EAAQS,EAAOT,MAAK,gBACpBoC,EAAkB3B,EAAO2B,iBAC1BG,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EACHzD,KAAK0D,KAjCT,WAAwC,IAA1BhD,EAAM+C,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,EAAGE,EAAQF,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,EACnC,MAAMG,EAAQ,IAAIC,IACZC,EAAIC,KAAKC,IAAI,GAAIL,GAEvB,MAAO,CACLhD,GAAAA,CAAIjC,GACF,MAAMuF,EAAYvF,EAAMwF,MAAMX,GAAOjE,OAErC,GAAIsE,EAAMO,IAAIF,GACZ,OAAOL,EAAMjD,IAAIsD,GAInB,MAAMP,EAAO,EAAIK,KAAKC,IAAIC,EAAW,GAAMvD,GAGrC0D,EAAIC,WAAWN,KAAKO,MAAMZ,EAAOI,GAAKA,GAI5C,OAFAF,EAAMW,IAAIN,EAAWG,GAEdA,CACT,EACAI,KAAAA,GACEZ,EAAMY,OACR,EAEJ,CAOgBd,CAAKJ,EAAiB,GAClCtD,KAAKkB,MAAQA,EACblB,KAAKyE,WAAY,EAEjBzE,KAAK0E,iBACP,CACAC,UAAAA,GAAsB,IAAXC,EAAInB,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,GAChBzD,KAAK4E,KAAOA,CACd,CACAF,eAAAA,GAA8B,IAAdG,EAAOpB,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,GACxBzD,KAAK6E,QAAUA,CACjB,CACAC,OAAAA,GAAmB,IAAX/E,EAAI0D,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,GACbzD,KAAKD,KAAOA,EACZC,KAAK+E,SAAW,CAAC,EACjBhF,EAAKK,QAAQ,CAACC,EAAK+B,KACjBpC,KAAK+E,SAAS1E,EAAII,IAAM2B,GAE5B,CACA4C,MAAAA,IACMhF,KAAKyE,WAAczE,KAAK4E,KAAKtF,SAIjCU,KAAKyE,WAAY,EAGb5F,EAASmB,KAAK4E,KAAK,IACrB5E,KAAK4E,KAAKxE,QAAQ,CAAC6E,EAAKC,KACtBlF,KAAKmF,WAAWF,EAAKC,KAIvBlF,KAAK4E,KAAKxE,QAAQ,CAAC6E,EAAKC,KACtBlF,KAAKoF,WAAWH,EAAKC,KAIzBlF,KAAK0D,KAAKc,QACZ,CAEAa,GAAAA,CAAIJ,GACF,MAAM7C,EAAMpC,KAAKsF,OAEbzG,EAASoG,GACXjF,KAAKmF,WAAWF,EAAK7C,GAErBpC,KAAKoF,WAAWH,EAAK7C,EAEzB,CAEAmD,QAAAA,CAASnD,GACPpC,KAAK6E,QAAQW,OAAOpD,EAAK,GAGzB,IAAK,IAAIc,EAAId,EAAKe,EAAMnD,KAAKsF,OAAQpC,EAAIC,EAAKD,GAAK,EACjDlD,KAAK6E,QAAQ3B,GAAGA,GAAK,CAEzB,CACAuC,sBAAAA,CAAuBC,EAAM9E,GAC3B,OAAO8E,EAAK1F,KAAK+E,SAASnE,GAC5B,CACA0E,IAAAA,GACE,OAAOtF,KAAK6E,QAAQvF,MACtB,CACA6F,UAAAA,CAAWF,EAAKC,GACd,IAAKhG,EAAU+F,IAAQ7F,EAAQ6F,GAC7B,OAGF,IAAIU,EAAS,CACXC,EAAGX,EACH/B,EAAGgC,EACHd,EAAGpE,KAAK0D,KAAK/C,IAAIsE,IAGnBjF,KAAK6E,QAAQrE,KAAKmF,EACpB,CACAP,UAAAA,CAAWH,EAAKC,GACd,IAAIS,EAAS,CAAEzC,EAAGgC,EAAUW,EAAG,CAAC,GAGhC7F,KAAKD,KAAKK,QAAQ,CAACC,EAAKyF,KACtB,IAAIpH,EAAQ2B,EAAIa,MAAQb,EAAIa,MAAM+D,GAAOjF,KAAKkB,MAAM+D,EAAK5E,EAAIW,MAE7D,GAAK9B,EAAUR,GAIf,GAAID,EAAQC,GAAQ,CAClB,IAAIqH,EAAa,GACjB,MAAMC,EAAQ,CAAC,CAAEC,gBAAiB,EAAGvH,UAErC,KAAOsH,EAAM1G,QAAQ,CACnB,MAAM,eAAE2G,EAAc,MAAEvH,GAAUsH,EAAME,MAExC,GAAKhH,EAAUR,GAIf,GAAIG,EAASH,KAAWU,EAAQV,GAAQ,CACtC,IAAIyH,EAAY,CACdP,EAAGlH,EACHwE,EAAG+C,EACH7B,EAAGpE,KAAK0D,KAAK/C,IAAIjC,IAGnBqH,EAAWvF,KAAK2F,EAClB,MAAW1H,EAAQC,IACjBA,EAAM0B,QAAQ,CAACsF,EAAMU,KACnBJ,EAAMxF,KAAK,CACTyF,eAAgBG,EAChB1H,MAAOgH,KAIf,CACAC,EAAOE,EAAEC,GAAYC,CACvB,MAAO,GAAIlH,EAASH,KAAWU,EAAQV,GAAQ,CAC7C,IAAIyH,EAAY,CACdP,EAAGlH,EACH0F,EAAGpE,KAAK0D,KAAK/C,IAAIjC,IAGnBiH,EAAOE,EAAEC,GAAYK,CACvB,IAGFnG,KAAK6E,QAAQrE,KAAKmF,EACpB,CACA9E,MAAAA,GACE,MAAO,CACLd,KAAMC,KAAKD,KACX8E,QAAS7E,KAAK6E,QAElB,EAGF,SAASwB,EACPtG,EACA6E,GAEA,IADA,MAAE1D,EAAQS,EAAOT,MAAK,gBAAEoC,EAAkB3B,EAAO2B,iBAAiBG,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEtE,MAAM6C,EAAU,IAAI9C,EAAU,CAAEtC,QAAOoC,oBAIvC,OAHAgD,EAAQxB,QAAQ/E,EAAKwG,IAAIhG,IACzB+F,EAAQ3B,WAAWC,GACnB0B,EAAQtB,SACDsB,CACT,CAaA,SAASE,EACPC,GAQA,IAPA,OACEC,EAAS,EAAC,gBACVC,EAAkB,EAAC,iBACnBC,EAAmB,EAAC,SACpBlE,EAAWf,EAAOe,SAAQ,eAC1BU,EAAiBzB,EAAOyB,gBACzBK,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEL,MAAMoD,EAAWH,EAASD,EAAQnH,OAElC,GAAI8D,EACF,OAAOyD,EAGT,MAAMC,EAAY/C,KAAKgD,IAAIH,EAAmBD,GAE9C,OAAKjE,EAKEmE,EAAWC,EAAYpE,EAHrBoE,EAAY,EAAMD,CAI7B,CAiCA,MAAMG,EAAW,GAEjB,SAASC,EACPC,EACAT,EACAU,GAUA,IATA,SACE3E,EAAWb,EAAOa,SAAQ,SAC1BE,EAAWf,EAAOe,SAAQ,UAC1BD,EAAYd,EAAOc,UAAS,eAC5BH,EAAiBX,EAAOW,eAAc,mBACtCC,EAAqBZ,EAAOY,mBAAkB,eAC9CF,EAAiBV,EAAOU,eAAc,eACtCe,EAAiBzB,EAAOyB,gBACzBK,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEL,GAAIgD,EAAQnH,OAAS0H,EACnB,MAAM,IAAI3F,MAtdZ,iCAsd2C2F,MAG3C,MAAMI,EAAaX,EAAQnH,OAErB+H,EAAUH,EAAK5H,OAEfsH,EAAmB7C,KAAKuD,IAAI,EAAGvD,KAAKwD,IAAI/E,EAAU6E,IAExD,IAAIG,EAAmB/E,EAEnBgF,EAAeb,EAInB,MAAMc,EAAiBnF,EAAqB,GAAKF,EAE3CsF,EAAYD,EAAiB/I,MAAM0I,GAAW,GAEpD,IAAItE,EAGJ,MAAQA,EAAQmE,EAAKU,QAAQnB,EAASgB,KAAkB,GAAG,CACzD,IAAItF,EAAQqE,EAAeC,EAAS,CAClCE,gBAAiB5D,EACjB6D,mBACAlE,WACAU,mBAMF,GAHAoE,EAAmBzD,KAAKwD,IAAIpF,EAAOqF,GACnCC,EAAe1E,EAAQqE,EAEnBM,EAAgB,CAClB,IAAIxE,EAAI,EACR,KAAOA,EAAIkE,GACTO,EAAU5E,EAAQG,GAAK,EACvBA,GAAK,CAET,CACF,CAGAuE,GAAgB,EAEhB,IAAII,EAAa,GACbC,EAAa,EACbC,EAASX,EAAaC,EAE1B,MAAMW,EAAO,GAAMZ,EAAa,EAEhC,IAAK,IAAIlE,EAAI,EAAGA,EAAIkE,EAAYlE,GAAK,EAAG,CAItC,IAAI+E,EAAS,EACTC,EAASH,EAEb,KAAOE,EAASC,GAAQ,CACR1B,EAAeC,EAAS,CACpCC,OAAQxD,EACRyD,gBAAiBC,EAAmBsB,EACpCtB,mBACAlE,WACAU,oBAGWoE,EACXS,EAASC,EAETH,EAASG,EAGXA,EAASnE,KAAKoE,OAAOJ,EAASE,GAAU,EAAIA,EAC9C,CAGAF,EAASG,EAET,IAAIE,EAAQrE,KAAKuD,IAAI,EAAGV,EAAmBsB,EAAS,GAChDG,EAAS/F,EACT+E,EACAtD,KAAKwD,IAAIX,EAAmBsB,EAAQb,GAAWD,EAG/CkB,EAAS3J,MAAM0J,EAAS,GAE5BC,EAAOD,EAAS,IAAM,GAAKnF,GAAK,EAEhC,IAAK,IAAIqF,EAAIF,EAAQE,GAAKH,EAAOG,GAAK,EAAG,CACvC,IAAI5B,EAAkB4B,EAAI,EACtBC,EAAYrB,EAAgBD,EAAKuB,OAAO9B,IAgB5C,GAdIe,IAEFC,EAAUhB,MAAsB6B,GAIlCF,EAAOC,IAAOD,EAAOC,EAAI,IAAM,EAAK,GAAKC,EAGrCtF,IACFoF,EAAOC,KACHV,EAAWU,EAAI,GAAKV,EAAWU,KAAO,EAAK,EAAIV,EAAWU,EAAI,IAGhED,EAAOC,GAAKP,IACdF,EAAatB,EAAeC,EAAS,CACnCC,OAAQxD,EACRyD,kBACAC,mBACAlE,WACAU,mBAKE0E,GAAcN,GAAkB,CAMlC,GAJAA,EAAmBM,EACnBL,EAAed,EAGXc,GAAgBb,EAClB,MAIFwB,EAAQrE,KAAKuD,IAAI,EAAG,EAAIV,EAAmBa,EAC7C,CAEJ,CAWA,GARcjB,EAAeC,EAAS,CACpCC,OAAQxD,EAAI,EACZyD,gBAAiBC,EACjBA,mBACAlE,WACAU,mBAGUoE,EACV,MAGFK,EAAaS,CACf,CAEA,MAAMtF,EAAS,CACb0F,QAASjB,GAAgB,EAEzBtF,MAAO4B,KAAKuD,IAAI,KAAOQ,IAGzB,GAAIJ,EAAgB,CAClB,MAAMiB,EA7MV,WAGE,IAFAC,EAASnF,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,GACZlB,EAAkBkB,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG9B,EAAOY,mBAExBoG,EAAU,GACVP,GAAS,EACTS,GAAO,EACP3F,EAAI,EAER,IAAK,IAAIC,EAAMyF,EAAUtJ,OAAQ4D,EAAIC,EAAKD,GAAK,EAAG,CAChD,IAAIgB,EAAQ0E,EAAU1F,GAClBgB,IAAoB,IAAXkE,EACXA,EAAQlF,EACEgB,IAAoB,IAAXkE,IACnBS,EAAM3F,EAAI,EACN2F,EAAMT,EAAQ,GAAK7F,GACrBoG,EAAQnI,KAAK,CAAC4H,EAAOS,IAEvBT,GAAS,EAEb,CAOA,OAJIQ,EAAU1F,EAAI,IAAMA,EAAIkF,GAAS7F,GACnCoG,EAAQnI,KAAK,CAAC4H,EAAOlF,EAAI,IAGpByF,CACT,CAiLoBG,CAAqBnB,EAAWpF,GAC3CoG,EAAQrJ,OAEF+C,IACTW,EAAO2F,QAAUA,GAFjB3F,EAAO0F,SAAU,CAIrB,CAEA,OAAO1F,CACT,CAEA,SAAS+F,EAAsBtC,GAC7B,IAAIuB,EAAO,CAAC,EAEZ,IAAK,IAAI9E,EAAI,EAAGC,EAAMsD,EAAQnH,OAAQ4D,EAAIC,EAAKD,GAAK,EAAG,CACrD,MAAM8F,EAAOvC,EAAQgC,OAAOvF,GAC5B8E,EAAKgB,IAAShB,EAAKgB,IAAS,GAAM,GAAM7F,EAAMD,EAAI,CACpD,CAEA,OAAO8E,CACT,CAEA,MAAMiB,EAAkBC,OAAO1J,UAAU2J,UACjCC,GAAQA,EAAID,UAAU,OAAOE,QAAQ,ykEAA0kE,IAC/mED,GAAQA,EAEhB,MAAME,EACJxJ,WAAAA,CACE2G,GAYA,IAXA,SACEjE,EAAWb,EAAOa,SAAQ,UAC1BC,EAAYd,EAAOc,UAAS,SAC5BC,EAAWf,EAAOe,SAAQ,eAC1BL,EAAiBV,EAAOU,eAAc,eACtCC,EAAiBX,EAAOW,eAAc,mBACtCC,EAAqBZ,EAAOY,mBAAkB,gBAC9CX,EAAkBD,EAAOC,gBAAe,iBACxCC,EAAmBF,EAAOE,iBAAgB,eAC1CuB,EAAiBzB,EAAOyB,gBACzBK,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAoBL,GAlBAzD,KAAKuJ,QAAU,CACb/G,WACAC,YACAC,WACAL,iBACAC,iBACAC,qBACAX,kBACAC,mBACAuB,kBAGFqD,EAAU7E,EAAkB6E,EAAUA,EAAQ+C,cAC9C/C,EAAU5E,EAAmBoH,EAAgBxC,GAAWA,EACxDzG,KAAKyG,QAAUA,EAEfzG,KAAKyJ,OAAS,IAETzJ,KAAKyG,QAAQnH,OAChB,OAGF,MAAMoK,EAAWA,CAACjD,EAASkD,KACzB3J,KAAKyJ,OAAOjJ,KAAK,CACfiG,UACAmD,SAAUb,EAAsBtC,GAChCkD,gBAIExG,EAAMnD,KAAKyG,QAAQnH,OAEzB,GAAI6D,EAAM6D,EAAU,CAClB,IAAI9D,EAAI,EACR,MAAM2G,EAAY1G,EAAM6D,EAClB6B,EAAM1F,EAAM0G,EAElB,KAAO3G,EAAI2F,GACTa,EAAS1J,KAAKyG,QAAQqD,OAAO5G,EAAG8D,GAAW9D,GAC3CA,GAAK8D,EAGP,GAAI6C,EAAW,CACb,MAAMF,EAAaxG,EAAM6D,EACzB0C,EAAS1J,KAAKyG,QAAQqD,OAAOH,GAAaA,EAC5C,CACF,MACED,EAAS1J,KAAKyG,QAAS,EAE3B,CAEAsD,QAAAA,CAAS7C,GACP,MAAM,gBAAEtF,EAAe,iBAAEC,EAAgB,eAAEQ,GAAmBrC,KAAKuJ,QAMnE,GAJArC,EAAOtF,EAAkBsF,EAAOA,EAAKsC,cACrCtC,EAAOrF,EAAmBoH,EAAgB/B,GAAQA,EAG9ClH,KAAKyG,UAAYS,EAAM,CACzB,IAAIlE,EAAS,CACX0F,SAAS,EACTvG,MAAO,GAOT,OAJIE,IACFW,EAAO2F,QAAU,CAAC,CAAC,EAAGzB,EAAK5H,OAAS,KAG/B0D,CACT,CAGA,MAAM,SACJR,EAAQ,SACRE,EAAQ,UACRD,EAAS,eACTH,EAAc,mBACdC,EAAkB,eAClBa,GACEpD,KAAKuJ,QAET,IAAIS,EAAa,GACbC,EAAa,EACbC,GAAa,EAEjBlK,KAAKyJ,OAAOrJ,QAAQ+J,IAAuC,IAAtC,QAAE1D,EAAO,SAAEmD,EAAQ,WAAED,GAAYQ,EACpD,MAAM,QAAEzB,EAAO,MAAEvG,EAAK,QAAEwG,GAAY1B,EAAOC,EAAMT,EAASmD,EAAU,CAClEpH,SAAUA,EAAWmH,EACrBjH,WACAD,YACAH,iBACAC,qBACAF,iBACAe,mBAGEsF,IACFwB,GAAa,GAGfD,GAAc9H,EAEVuG,GAAWC,IACbqB,EAAa,IAAIA,KAAerB,MAIpC,IAAI3F,EAAS,CACX0F,QAASwB,EACT/H,MAAO+H,EAAaD,EAAajK,KAAKyJ,OAAOnK,OAAS,GAOxD,OAJI4K,GAAc7H,IAChBW,EAAO2F,QAAUqB,GAGZhH,CACT,EAGF,MAAMoH,EACJtK,WAAAA,CAAY2G,GACVzG,KAAKyG,QAAUA,CACjB,CACA,mBAAO4D,CAAa5D,GAClB,OAAO6D,EAAS7D,EAASzG,KAAKuK,WAChC,CACA,oBAAOC,CAAc/D,GACnB,OAAO6D,EAAS7D,EAASzG,KAAKyK,YAChC,CACAxD,MAAAA,GAAkB,EAGpB,SAASqD,EAAS7D,EAASiE,GACzB,MAAMC,EAAUlE,EAAQvC,MAAMwG,GAC9B,OAAOC,EAAUA,EAAQ,GAAK,IAChC,CA8JA,MAAMC,UAAmBR,EACvBtK,WAAAA,CACE2G,GAYA,IAXA,SACEjE,EAAWb,EAAOa,SAAQ,UAC1BC,EAAYd,EAAOc,UAAS,SAC5BC,EAAWf,EAAOe,SAAQ,eAC1BL,EAAiBV,EAAOU,eAAc,eACtCC,EAAiBX,EAAOW,eAAc,mBACtCC,EAAqBZ,EAAOY,mBAAkB,gBAC9CX,EAAkBD,EAAOC,gBAAe,iBACxCC,EAAmBF,EAAOE,iBAAgB,eAC1CuB,EAAiBzB,EAAOyB,gBACzBK,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAELoH,MAAMpE,GACNzG,KAAK8K,aAAe,IAAIxB,EAAY7C,EAAS,CAC3CjE,WACAC,YACAC,WACAL,iBACAC,iBACAC,qBACAX,kBACAC,mBACAuB,kBAEJ,CACA,eAAW2H,GACT,MAAO,OACT,CACA,qBAAWR,GACT,MAAO,UACT,CACA,sBAAWE,GACT,MAAO,QACT,CACAxD,MAAAA,CAAOC,GACL,OAAOlH,KAAK8K,aAAaf,SAAS7C,EACpC,EAKF,MAAM8D,UAAqBZ,EACzBtK,WAAAA,CAAY2G,GACVoE,MAAMpE,EACR,CACA,eAAWsE,GACT,MAAO,SACT,CACA,qBAAWR,GACT,MAAO,WACT,CACA,sBAAWE,GACT,MAAO,SACT,CACAxD,MAAAA,CAAOC,GACL,IACInE,EADAP,EAAW,EAGf,MAAMmG,EAAU,GACVvB,EAAapH,KAAKyG,QAAQnH,OAGhC,MAAQyD,EAAQmE,EAAKU,QAAQ5H,KAAKyG,QAASjE,KAAc,GACvDA,EAAWO,EAAQqE,EACnBuB,EAAQnI,KAAK,CAACuC,EAAOP,EAAW,IAGlC,MAAMkG,IAAYC,EAAQrJ,OAE1B,MAAO,CACLoJ,UACAvG,MAAOuG,EAAU,EAAI,EACrBC,UAEJ,EAIF,MAAMsC,EAAY,CA3OlB,cAAyBb,EACvBtK,WAAAA,CAAY2G,GACVoE,MAAMpE,EACR,CACA,eAAWsE,GACT,MAAO,OACT,CACA,qBAAWR,GACT,MAAO,WACT,CACA,sBAAWE,GACT,MAAO,SACT,CACAxD,MAAAA,CAAOC,GACL,MAAMwB,EAAUxB,IAASlH,KAAKyG,QAE9B,MAAO,CACLiC,UACAvG,MAAOuG,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAG3I,KAAKyG,QAAQnH,OAAS,GAEvC,GAwNA0L,EAxLF,cAA+BZ,EAC7BtK,WAAAA,CAAY2G,GACVoE,MAAMpE,EACR,CACA,eAAWsE,GACT,MAAO,cACT,CACA,qBAAWR,GACT,MAAO,YACT,CACA,sBAAWE,GACT,MAAO,UACT,CACAxD,MAAAA,CAAOC,GACL,MAAMwB,EAAUxB,EAAKgE,WAAWlL,KAAKyG,SAErC,MAAO,CACLiC,UACAvG,MAAOuG,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAG3I,KAAKyG,QAAQnH,OAAS,GAEvC,GAKF,cAAsC8K,EACpCtK,WAAAA,CAAY2G,GACVoE,MAAMpE,EACR,CACA,eAAWsE,GACT,MAAO,sBACT,CACA,qBAAWR,GACT,MAAO,aACT,CACA,sBAAWE,GACT,MAAO,WACT,CACAxD,MAAAA,CAAOC,GACL,MAAMwB,GAAWxB,EAAKgE,WAAWlL,KAAKyG,SAEtC,MAAO,CACLiC,UACAvG,MAAOuG,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAGzB,EAAK5H,OAAS,GAE/B,GA+BF,cAAsC8K,EACpCtK,WAAAA,CAAY2G,GACVoE,MAAMpE,EACR,CACA,eAAWsE,GACT,MAAO,sBACT,CACA,qBAAWR,GACT,MAAO,aACT,CACA,sBAAWE,GACT,MAAO,WACT,CACAxD,MAAAA,CAAOC,GACL,MAAMwB,GAAWxB,EAAKiE,SAASnL,KAAKyG,SACpC,MAAO,CACLiC,UACAvG,MAAOuG,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAGzB,EAAK5H,OAAS,GAE/B,GA9CF,cAA+B8K,EAC7BtK,WAAAA,CAAY2G,GACVoE,MAAMpE,EACR,CACA,eAAWsE,GACT,MAAO,cACT,CACA,qBAAWR,GACT,MAAO,YACT,CACA,sBAAWE,GACT,MAAO,UACT,CACAxD,MAAAA,CAAOC,GACL,MAAMwB,EAAUxB,EAAKiE,SAASnL,KAAKyG,SAEnC,MAAO,CACLiC,UACAvG,MAAOuG,EAAU,EAAI,EACrBC,QAAS,CAACzB,EAAK5H,OAASU,KAAKyG,QAAQnH,OAAQ4H,EAAK5H,OAAS,GAE/D,GApGF,cAAgC8K,EAC9BtK,WAAAA,CAAY2G,GACVoE,MAAMpE,EACR,CACA,eAAWsE,GACT,MAAO,eACT,CACA,qBAAWR,GACT,MAAO,WACT,CACA,sBAAWE,GACT,MAAO,SACT,CACAxD,MAAAA,CAAOC,GACL,MACMwB,GAAqB,IADbxB,EAAKU,QAAQ5H,KAAKyG,SAGhC,MAAO,CACLiC,UACAvG,MAAOuG,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAGzB,EAAK5H,OAAS,GAE/B,GAmMAsL,GAGIQ,EAAeH,EAAU3L,OAGzB+L,EAAW,qCAmDjB,MAAMC,EAAgB,IAAIC,IAAI,CAACX,EAAWG,KAAMC,EAAaD,OA8B7D,MAAMS,EACJ1L,WAAAA,CACE2G,GAYA,IAXA,gBACE7E,EAAkBD,EAAOC,gBAAe,iBACxCC,EAAmBF,EAAOE,iBAAgB,eAC1CQ,EAAiBV,EAAOU,eAAc,mBACtCE,EAAqBZ,EAAOY,mBAAkB,eAC9Ca,EAAiBzB,EAAOyB,eAAc,eACtCd,EAAiBX,EAAOW,eAAc,SACtCE,EAAWb,EAAOa,SAAQ,UAC1BC,EAAYd,EAAOc,UAAS,SAC5BC,EAAWf,EAAOe,UACnBe,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAELzD,KAAKyL,MAAQ,KACbzL,KAAKuJ,QAAU,CACb3H,kBACAC,mBACAQ,iBACAE,qBACAD,iBACAc,iBACAZ,WACAC,YACAC,YAGF+D,EAAU7E,EAAkB6E,EAAUA,EAAQ+C,cAC9C/C,EAAU5E,EAAmBoH,EAAgBxC,GAAWA,EACxDzG,KAAKyG,QAAUA,EACfzG,KAAKyL,MA1GT,SAAoBhF,GAAuB,IAAd8C,EAAO9F,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EACtC,OAAOgD,EAAQhF,MANA,KAMgB8E,IAAKb,IAClC,IAAI+F,EAAQ/F,EACTrG,OACAoC,MAAM4J,GACNK,OAAQhG,GAASA,KAAUA,EAAKrG,QAE/BsM,EAAU,GACd,IAAK,IAAIzI,EAAI,EAAGC,EAAMsI,EAAMnM,OAAQ4D,EAAIC,EAAKD,GAAK,EAAG,CACnD,MAAM0I,EAAYH,EAAMvI,GAGxB,IAAI2I,GAAQ,EACRzJ,GAAO,EACX,MAAQyJ,KAAWzJ,EAAMgJ,GAAc,CACrC,MAAMU,EAAWb,EAAU7I,GAC3B,IAAI2J,EAAQD,EAASzB,aAAauB,GAC9BG,IACFJ,EAAQnL,KAAK,IAAIsL,EAASC,EAAOxC,IACjCsC,GAAQ,EAEZ,CAEA,IAAIA,EAMJ,IADAzJ,GAAO,IACEA,EAAMgJ,GAAc,CAC3B,MAAMU,EAAWb,EAAU7I,GAC3B,IAAI2J,EAAQD,EAAStB,cAAcoB,GACnC,GAAIG,EAAO,CACTJ,EAAQnL,KAAK,IAAIsL,EAASC,EAAOxC,IACjC,KACF,CACF,CACF,CAEA,OAAOoC,GAEX,CAiEiBK,CAAWhM,KAAKyG,QAASzG,KAAKuJ,QAC7C,CAEA,gBAAO0C,CAAUC,EAAG3C,GAClB,OAAOA,EAAQ5G,iBACjB,CAEAoH,QAAAA,CAAS7C,GACP,MAAMuE,EAAQzL,KAAKyL,MAEnB,IAAKA,EACH,MAAO,CACL/C,SAAS,EACTvG,MAAO,GAIX,MAAM,eAAEE,EAAc,gBAAET,EAAe,iBAAEC,GAAqB7B,KAAKuJ,QAEnErC,EAAOtF,EAAkBsF,EAAOA,EAAKsC,cACrCtC,EAAOrF,EAAmBoH,EAAgB/B,GAAQA,EAElD,IAAIiF,EAAa,EACbnC,EAAa,GACbC,EAAa,EAGjB,IAAK,IAAI/G,EAAI,EAAGkJ,EAAOX,EAAMnM,OAAQ4D,EAAIkJ,EAAMlJ,GAAK,EAAG,CACrD,MAAM+H,EAAYQ,EAAMvI,GAGxB8G,EAAW1K,OAAS,EACpB6M,EAAa,EAGb,IAAK,IAAI5D,EAAI,EAAG8D,EAAOpB,EAAU3L,OAAQiJ,EAAI8D,EAAM9D,GAAK,EAAG,CACzD,MAAMuD,EAAWb,EAAU1C,IACrB,QAAEG,EAAO,QAAEC,EAAO,MAAExG,GAAU2J,EAAS7E,OAAOC,GAEpD,IAAIwB,EAWG,CACLuB,EAAa,EACbkC,EAAa,EACbnC,EAAW1K,OAAS,EACpB,KACF,CAbE,GAFA6M,GAAc,EACdlC,GAAc9H,EACVE,EAAgB,CAClB,MAAM0I,EAAOe,EAAShM,YAAYiL,KAC9BO,EAAcnH,IAAI4G,GACpBf,EAAa,IAAIA,KAAerB,GAEhCqB,EAAWxJ,KAAKmI,EAEpB,CAOJ,CAGA,GAAIwD,EAAY,CACd,IAAInJ,EAAS,CACX0F,SAAS,EACTvG,MAAO8H,EAAakC,GAOtB,OAJI9J,IACFW,EAAO2F,QAAUqB,GAGZhH,CACT,CACF,CAGA,MAAO,CACL0F,SAAS,EACTvG,MAAO,EAEX,EAGF,MAAMmK,EAAsB,GAM5B,SAASC,EAAe9F,EAAS8C,GAC/B,IAAK,IAAIrG,EAAI,EAAGC,EAAMmJ,EAAoBhN,OAAQ4D,EAAIC,EAAKD,GAAK,EAAG,CACjE,IAAIsJ,EAAgBF,EAAoBpJ,GACxC,GAAIsJ,EAAcP,UAAUxF,EAAS8C,GACnC,OAAO,IAAIiD,EAAc/F,EAAS8C,EAEtC,CAEA,OAAO,IAAID,EAAY7C,EAAS8C,EAClC,CAEA,MAAMkD,EACC,OADDA,EAEA,MAGAC,EACE,QADFA,EAEK,OAGLC,EAAgBlB,MACjBA,EAAMgB,KAAwBhB,EAAMgB,IAOnCG,EAAqBnB,IAAK,CAC9B,CAACgB,GAAsBlN,OAAOQ,KAAK0L,GAAOlF,IAAKlG,IAAG,CAChD,CAACA,GAAMoL,EAAMpL,QAMjB,SAASwM,EAAMpB,EAAOlC,GAA+B,IAAtB,KAAEuD,GAAO,GAAMrJ,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAChD,MAAMsJ,EAAQtB,IACZ,IAAI1L,EAAOR,OAAOQ,KAAK0L,GAEvB,MAAMuB,EAjBMvB,MAAYA,EAAMiB,GAiBVO,CAAOxB,GAE3B,IAAKuB,GAAejN,EAAKT,OAAS,IAAMqN,EAAalB,GACnD,OAAOsB,EAAKH,EAAkBnB,IAGhC,GArBYA,KACbhN,EAAQgN,IAAUzM,EAASyM,KAAWkB,EAAalB,GAoB9CyB,CAAOzB,GAAQ,CACjB,MAAMpL,EAAM2M,EAAcvB,EAAMiB,GAAgB3M,EAAK,GAE/C0G,EAAUuG,EAAcvB,EAAMiB,GAAmBjB,EAAMpL,GAE7D,IAAKxB,EAAS4H,GACZ,MAAM,IAAIpF,MAjyC4BhB,IAC5C,yBAAyBA,IAgyCH8M,CAAqC9M,IAGvD,MAAMC,EAAM,CACVM,MAAOQ,EAAYf,GACnBoG,WAOF,OAJIqG,IACFxM,EAAIwL,SAAWS,EAAe9F,EAAS8C,IAGlCjJ,CACT,CAEA,IAAI8M,EAAO,CACTC,SAAU,GACVC,SAAUvN,EAAK,IAajB,OAVAA,EAAKK,QAASC,IACZ,MAAM3B,EAAQ+M,EAAMpL,GAEhB5B,EAAQC,IACVA,EAAM0B,QAASsF,IACb0H,EAAKC,SAAS7M,KAAKuM,EAAKrH,QAKvB0H,GAOT,OAJKT,EAAalB,KAChBA,EAAQmB,EAAkBnB,IAGrBsB,EAAKtB,EACd,CAuBA,SAAS8B,EAAiBvK,EAAQwK,GAChC,MAAM7C,EAAU3H,EAAO2H,QACvB6C,EAAK7C,QAAU,GAEVzL,EAAUyL,IAIfA,EAAQvK,QAAS8D,IACf,IAAKhF,EAAUgF,EAAMyE,WAAazE,EAAMyE,QAAQrJ,OAC9C,OAGF,MAAM,QAAEqJ,EAAO,MAAEjK,GAAUwF,EAE3B,IAAI5D,EAAM,CACRqI,UACAjK,SAGEwF,EAAM7D,MACRC,EAAID,IAAM6D,EAAM7D,IAAIY,KAGlBiD,EAAM9B,KAAO,IACf9B,EAAImN,SAAWvJ,EAAM9B,KAGvBoL,EAAK7C,QAAQnK,KAAKF,IAEtB,CAEA,SAASoN,EAAe1K,EAAQwK,GAC9BA,EAAKrL,MAAQa,EAAOb,KACtB,CAiCA,MAAMwL,EACJ7N,WAAAA,CAAY8E,GAA2B,IAArB2E,EAAO9F,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAAGV,EAAKU,UAAAnE,OAAA,EAAAmE,UAAA,QAAAtE,EACnCa,KAAKuJ,QAAU,IAAK5H,KAAW4H,GAG7BvJ,KAAKuJ,QAAQ5G,kBAMf3C,KAAK4N,UAAY,IAAI/N,EAASG,KAAKuJ,QAAQxJ,MAE3CC,KAAK6N,cAAcjJ,EAAM7B,EAC3B,CAEA8K,aAAAA,CAAcjJ,EAAM7B,GAGlB,GAFA/C,KAAK8N,MAAQlJ,EAET7B,KAAWA,aAAiBS,GAC9B,MAAM,IAAInC,MAv7Ca,0BA07CzBrB,KAAK+N,SACHhL,GACAsD,EAAYrG,KAAKuJ,QAAQxJ,KAAMC,KAAK8N,MAAO,CACzC5M,MAAOlB,KAAKuJ,QAAQrI,MACpBoC,gBAAiBtD,KAAKuJ,QAAQjG,iBAEpC,CAEA+B,GAAAA,CAAIJ,GACG/F,EAAU+F,KAIfjF,KAAK8N,MAAMtN,KAAKyE,GAChBjF,KAAK+N,SAAS1I,IAAIJ,GACpB,CAEA+I,MAAAA,GAA8C,IAAvCC,EAASxK,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,KAAoB,EACrC,MAAMkI,EAAU,GAEhB,IAAK,IAAIzI,EAAI,EAAGC,EAAMnD,KAAK8N,MAAMxO,OAAQ4D,EAAIC,EAAKD,GAAK,EAAG,CACxD,MAAM+B,EAAMjF,KAAK8N,MAAM5K,GACnB+K,EAAUhJ,EAAK/B,KACjBlD,KAAKuF,SAASrC,GACdA,GAAK,EACLC,GAAO,EAEPwI,EAAQnL,KAAKyE,GAEjB,CAEA,OAAO0G,CACT,CAEApG,QAAAA,CAASnD,GACPpC,KAAK8N,MAAMtI,OAAOpD,EAAK,GACvBpC,KAAK+N,SAASxI,SAASnD,EACzB,CAEA8L,QAAAA,GACE,OAAOlO,KAAK+N,QACd,CAEA9G,MAAAA,CAAOwE,GAA4B,IAArB,MAAE0C,GAAQ,GAAI1K,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAC9B,MAAM,eACJpB,EAAc,aACdP,EAAY,WACZC,EAAU,OACVC,EAAM,gBACNqB,GACErD,KAAKuJ,QAET,IAAIoC,EAAU9M,EAAS4M,GACnB5M,EAASmB,KAAK8N,MAAM,IAClB9N,KAAKoO,kBAAkB3C,GACvBzL,KAAKqO,kBAAkB5C,GACzBzL,KAAKsO,eAAe7C,GAYxB,OAlLJ,SACEE,EAAO4C,GAEP,IADA,gBAAElL,EAAkB1B,EAAO0B,iBAAiBkL,EAE5C5C,EAAQvL,QAAS4C,IACf,IAAIiH,EAAa,EAEjBjH,EAAO2H,QAAQvK,QAAQoO,IAA0B,IAAzB,IAAEnO,EAAG,KAAEqD,EAAI,MAAEvB,GAAOqM,EAC1C,MAAM9N,EAASL,EAAMA,EAAIK,OAAS,KAElCuJ,GAAclG,KAAKC,IACP,IAAV7B,GAAezB,EAAS+N,OAAOC,QAAUvM,GACxCzB,GAAU,IAAM2C,EAAkB,EAAIK,MAI3CV,EAAOb,MAAQ8H,GAEnB,CAsJI0E,CAAahD,EAAS,CAAEtI,oBAEpBtB,GACF4J,EAAQiD,KAAK5M,GAGXlD,EAASqP,IAAUA,GAAS,IAC9BxC,EAAUA,EAAQkD,MAAM,EAAGV,IAvHjC,SACExC,EACA/G,GAKA,IAJA,eACEvC,EAAiBV,EAAOU,eAAc,aACtCP,EAAeH,EAAOG,cACvB2B,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEL,MAAMqL,EAAe,GAKrB,OAHIzM,GAAgByM,EAAatO,KAAK+M,GAClCzL,GAAcgN,EAAatO,KAAKkN,GAE7B/B,EAAQpF,IAAKvD,IAClB,MAAM,IAAEZ,GAAQY,EAEVwK,EAAO,CACX9H,KAAMd,EAAKxC,GACXqL,SAAUrL,GASZ,OANI0M,EAAaxP,QACfwP,EAAa1O,QAAS2O,IACpBA,EAAY/L,EAAQwK,KAIjBA,GAEX,CA6FWwB,CAAOrD,EAAS3L,KAAK8N,MAAO,CACjCzL,iBACAP,gBAEJ,CAEAsM,iBAAAA,CAAkB3C,GAChB,MAAMK,EAAWS,EAAed,EAAOzL,KAAKuJ,UACtC,QAAE1E,GAAY7E,KAAK+N,SACnBpC,EAAU,GAmBhB,OAhBA9G,EAAQzE,QAAQ6O,IAAkC,IAA/BrJ,EAAGsB,EAAMhE,EAAGd,EAAKgC,EAAGV,GAAMuL,EAC3C,IAAK/P,EAAUgI,GACb,OAGF,MAAM,QAAEwB,EAAO,MAAEvG,EAAK,QAAEwG,GAAYmD,EAAS/B,SAAS7C,GAElDwB,GACFiD,EAAQnL,KAAK,CACXkF,KAAMwB,EACN9E,MACAuI,QAAS,CAAC,CAAExI,QAAOzD,MAAOwI,EAAMxD,OAAMiF,gBAKrCgD,CACT,CAEA2C,cAAAA,CAAe7C,GAEb,MAAMyD,EAAarC,EAAMpB,EAAOzL,KAAKuJ,SAE/B4F,EAAWA,CAAC/B,EAAM1H,EAAMtD,KAC5B,IAAKgL,EAAKC,SAAU,CAClB,MAAM,MAAEzM,EAAK,SAAEkL,GAAasB,EAEtBzC,EAAU3K,KAAKoP,aAAa,CAChC/O,IAAKL,KAAK4N,UAAUjN,IAAIC,GACxBlC,MAAOsB,KAAK+N,SAAStI,uBAAuBC,EAAM9E,GAClDkL,aAGF,OAAInB,GAAWA,EAAQrL,OACd,CACL,CACE8C,MACAsD,OACAiF,YAKC,EACT,CAEA,MAAM0E,EAAM,GACZ,IAAK,IAAInM,EAAI,EAAGC,EAAMiK,EAAKC,SAAS/N,OAAQ4D,EAAIC,EAAKD,GAAK,EAAG,CAC3D,MAAMoM,EAAQlC,EAAKC,SAASnK,GACtBF,EAASmM,EAASG,EAAO5J,EAAMtD,GACrC,GAAIY,EAAO1D,OACT+P,EAAI7O,QAAQwC,QACP,GAAIoK,EAAKE,WAAab,EAC3B,MAAO,EAEX,CACA,OAAO4C,GAGHxK,EAAU7E,KAAK+N,SAASlJ,QACxB0K,EAAY,CAAC,EACb5D,EAAU,GAmBhB,OAjBA9G,EAAQzE,QAAQoP,IAAyB,IAAtB3J,EAAGH,EAAMxC,EAAGd,GAAKoN,EAClC,GAAItQ,EAAUwG,GAAO,CACnB,IAAI+J,EAAaN,EAASD,EAAYxJ,EAAMtD,GAExCqN,EAAWnQ,SAERiQ,EAAUnN,KACbmN,EAAUnN,GAAO,CAAEA,MAAKsD,OAAMiF,QAAS,IACvCgB,EAAQnL,KAAK+O,EAAUnN,KAEzBqN,EAAWrP,QAAQsP,IAAiB,IAAhB,QAAE/E,GAAS+E,EAC7BH,EAAUnN,GAAKuI,QAAQnK,QAAQmK,KAGrC,IAGKgB,CACT,CAEA0C,iBAAAA,CAAkB5C,GAChB,MAAMK,EAAWS,EAAed,EAAOzL,KAAKuJ,UACtC,KAAExJ,EAAI,QAAE8E,GAAY7E,KAAK+N,SACzBpC,EAAU,GA8BhB,OA3BA9G,EAAQzE,QAAQuP,IAAyB,IAAtB9J,EAAGH,EAAMxC,EAAGd,GAAKuN,EAClC,IAAKzQ,EAAUwG,GACb,OAGF,IAAIiF,EAAU,GAGd5K,EAAKK,QAAQ,CAACC,EAAKyF,KACjB6E,EAAQnK,QACHR,KAAKoP,aAAa,CACnB/O,MACA3B,MAAOgH,EAAKI,GACZgG,gBAKFnB,EAAQrL,QACVqM,EAAQnL,KAAK,CACX4B,MACAsD,OACAiF,cAKCgB,CACT,CACAyD,YAAAA,CAAYQ,GAA2B,IAA1B,IAAEvP,EAAG,MAAE3B,EAAK,SAAEoN,GAAU8D,EACnC,IAAK1Q,EAAUR,GACb,MAAO,GAGT,IAAIiM,EAAU,GAEd,GAAIlM,EAAQC,GACVA,EAAM0B,QAAQyP,IAAkC,IAA/BjK,EAAGsB,EAAMhE,EAAGd,EAAKgC,EAAGV,GAAMmM,EACzC,IAAK3Q,EAAUgI,GACb,OAGF,MAAM,QAAEwB,EAAO,MAAEvG,EAAK,QAAEwG,GAAYmD,EAAS/B,SAAS7C,GAElDwB,GACFiC,EAAQnK,KAAK,CACX2B,QACA9B,MACA3B,MAAOwI,EACP9E,MACAsB,OACAiF,kBAID,CACL,MAAQ/C,EAAGsB,EAAM9C,EAAGV,GAAShF,GAEvB,QAAEgK,EAAO,MAAEvG,EAAK,QAAEwG,GAAYmD,EAAS/B,SAAS7C,GAElDwB,GACFiC,EAAQnK,KAAK,CAAE2B,QAAO9B,MAAK3B,MAAOwI,EAAMxD,OAAMiF,WAElD,CAEA,OAAOgC,CACT,EAGFgD,EAAKmC,QAAU,QACfnC,EAAKtH,YAAcA,EACnBsH,EAAKoC,WAnyCL,SACEvC,GAEA,IADA,MAAEtM,EAAQS,EAAOT,MAAK,gBAAEoC,EAAkB3B,EAAO2B,iBAAiBG,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEtE,MAAM,KAAE1D,EAAI,QAAE8E,GAAY2I,EACpBlH,EAAU,IAAI9C,EAAU,CAAEtC,QAAOoC,oBAGvC,OAFAgD,EAAQxB,QAAQ/E,GAChBuG,EAAQ5B,gBAAgBG,GACjByB,CACT,EA2xCAqH,EAAKqC,OAASrO,EAGZgM,EAAK3B,WAAaa,EApcpB,WACEP,EAAoB9L,QAAKiD,UAC3B,CAscEwM,CAASzE,G,IC9vDP0E,EAAOC,E,WACX,SAASC,KAAa,OAAOA,GAAW7Q,OAAO8Q,OAAS9Q,OAAO8Q,OAAOC,OAAS,SAAUlM,GAAK,IAAK,IAAImM,EAAI,EAAGA,EAAI9M,UAAUnE,OAAQiR,IAAK,CAAE,IAAIC,EAAI/M,UAAU8M,GAAI,IAAK,IAAIE,KAAKD,GAAG,CAAG,GAAE5Q,eAAeF,KAAK8Q,EAAGC,KAAOrM,EAAEqM,GAAKD,EAAEC,GAAK,CAAE,OAAOrM,CAAG,EAAGgM,GAASM,MAAM,KAAMjN,UAAY,CAEnR,SAASkN,GAAgBxG,EAAMyG,GAC7B,IAAI,MACFC,EAAK,QACLC,KACGC,GACD5G,EACJ,OAAoB,gBAAoB,MAAOiG,GAAS,CACtDY,MAAO,GACPC,OAAQ,GACRC,QAAS,YACTC,KAAM,OACNC,OAAQ,eACRC,YAAa,EACbC,cAAe,QACfC,eAAgB,QAChBC,IAAKZ,EACL,kBAAmBE,GAClBC,GAAQF,EAAqB,gBAAoB,QAAS,CAC3DpQ,GAAIqQ,GACHD,GAAS,KAAMX,IAAUA,EAAqB,gBAAoB,OAAQ,CAC3EuB,EAAG,EACHC,EAAG,EACHV,MAAO,GACPC,OAAQ,GACRU,GAAI,EACJC,GAAI,KACDzB,IAAUA,EAAqB,gBAAoB,OAAQ,CAC9D0B,EAAG,6DAEP,CACA,MAAMC,GAA0B,aAAiBnB,IAClC,IClCf,IAAIoB,GACJ,SAAS,KAAa,OAAO,GAAWxS,OAAO8Q,OAAS9Q,OAAO8Q,OAAOC,OAAS,SAAUlM,GAAK,IAAK,IAAImM,EAAI,EAAGA,EAAI9M,UAAUnE,OAAQiR,IAAK,CAAE,IAAIC,EAAI/M,UAAU8M,GAAI,IAAK,IAAIE,KAAKD,GAAG,CAAG,GAAE5Q,eAAeF,KAAK8Q,EAAGC,KAAOrM,EAAEqM,GAAKD,EAAEC,GAAK,CAAE,OAAOrM,CAAG,EAAG,GAASsM,MAAM,KAAMjN,UAAY,CAEnR,SAASuO,GAAiB7H,EAAMyG,GAC9B,IAAI,MACFC,EAAK,QACLC,KACGC,GACD5G,EACJ,OAAoB,gBAAoB,MAAO,GAAS,CACtD6G,MAAO,GACPC,OAAQ,GACRC,QAAS,YACTC,KAAM,OACNC,OAAQ,eACRC,YAAa,EACbC,cAAe,QACfC,eAAgB,QAChBC,IAAKZ,EACL,kBAAmBE,GAClBC,GAAQF,EAAqB,gBAAoB,QAAS,CAC3DpQ,GAAIqQ,GACHD,GAAS,KAAMkB,KAAcA,GAAyB,gBAAoB,WAAY,CACvFE,OAAQ,oBAEZ,CACA,MAAM,GAA0B,aAAiBD,IAClC,IC3Bf,IAAI,GAAWE,GAAYC,GAAOC,GAClC,SAAS,KAAa,OAAO,GAAW7S,OAAO8Q,OAAS9Q,OAAO8Q,OAAOC,OAAS,SAAUlM,GAAK,IAAK,IAAImM,EAAI,EAAGA,EAAI9M,UAAUnE,OAAQiR,IAAK,CAAE,IAAIC,EAAI/M,UAAU8M,GAAI,IAAK,IAAIE,KAAKD,GAAG,CAAG,GAAE5Q,eAAeF,KAAK8Q,EAAGC,KAAOrM,EAAEqM,GAAKD,EAAEC,GAAK,CAAE,OAAOrM,CAAG,EAAG,GAASsM,MAAM,KAAMjN,UAAY,CAEnR,SAAS4O,GAAkBlI,EAAMyG,GAC/B,IAAI,MACFC,EAAK,QACLC,KACGC,GACD5G,EACJ,OAAoB,gBAAoB,MAAO,GAAS,CACtD6G,MAAO,GACPC,OAAQ,GACRC,QAAS,YACTC,KAAM,OACNC,OAAQ,eACRC,YAAa,EACbC,cAAe,QACfC,eAAgB,QAChBC,IAAKZ,EACL,kBAAmBE,GAClBC,GAAQF,EAAqB,gBAAoB,QAAS,CAC3DpQ,GAAIqQ,GACHD,GAAS,KAAM,KAAc,GAAyB,gBAAoB,WAAY,CACvFoB,OAAQ,oBACLC,KAAeA,GAA0B,gBAAoB,WAAY,CAC5ED,OAAQ,oBACLE,KAAUA,GAAqB,gBAAoB,OAAQ,CAC9DG,GAAI,GACJC,GAAI,EACJC,GAAI,GACJC,GAAI,MACDL,KAAWA,GAAsB,gBAAoB,OAAQ,CAChEE,GAAI,EACJC,GAAI,GACJC,GAAI,GACJC,GAAI,MAER,CACA,MAAM,GAA0B,aAAiBJ,IAClC,ICvCf,IAAI,GAAW,GAAY,GAAO,GAClC,SAAS,KAAa,OAAO,GAAW9S,OAAO8Q,OAAS9Q,OAAO8Q,OAAOC,OAAS,SAAUlM,GAAK,IAAK,IAAImM,EAAI,EAAGA,EAAI9M,UAAUnE,OAAQiR,IAAK,CAAE,IAAIC,EAAI/M,UAAU8M,GAAI,IAAK,IAAIE,KAAKD,GAAG,CAAG,GAAE5Q,eAAeF,KAAK8Q,EAAGC,KAAOrM,EAAEqM,GAAKD,EAAEC,GAAK,CAAE,OAAOrM,CAAG,EAAG,GAASsM,MAAM,KAAMjN,UAAY,CAEnR,SAASiP,GAAoBvI,EAAMyG,GACjC,IAAI,MACFC,EAAK,QACLC,KACGC,GACD5G,EACJ,OAAoB,gBAAoB,MAAO,GAAS,CACtD6G,MAAO,GACPC,OAAQ,GACRC,QAAS,YACTC,KAAM,OACNC,OAAQ,eACRC,YAAa,EACbC,cAAe,QACfC,eAAgB,QAChBC,IAAKZ,EACL,kBAAmBE,GAClBC,GAAQF,EAAqB,gBAAoB,QAAS,CAC3DpQ,GAAIqQ,GACHD,GAAS,KAAM,KAAc,GAAyB,gBAAoB,WAAY,CACvFoB,OAAQ,sBACL,KAAe,GAA0B,gBAAoB,WAAY,CAC5EA,OAAQ,sBACL,KAAU,GAAqB,gBAAoB,OAAQ,CAC9DK,GAAI,GACJC,GAAI,GACJC,GAAI,GACJC,GAAI,KACD,KAAW,GAAsB,gBAAoB,OAAQ,CAChEH,GAAI,EACJC,GAAI,GACJC,GAAI,GACJC,GAAI,MAER,CACA,MAAM,GAA0B,aAAiBC,IClC3CC,IDmCS,KCnCIC,EAAAA,EAAAA,wBAAuB,CACxCC,cAAe,QACfC,SAAU,CACR,QCPW,CACb,iBAAkB,0BAClB,6BAA8B,kBAC9B,kBAAmB,eACnB,oBAAqB,eACrB,qBAAsB,2BACtB,uBAAwB,2BACxB,iBAAkB,SAClB,gBAAiB,eACjB,gBAAiB,eACjB,kBAAmB,sBDFjB,QERW,CACb,iBAAkB,cAClB,6BAA8B,YAC9B,kBAAmB,SACnB,oBAAqB,WACrB,qBAAsB,aACtB,uBAAwB,eACxB,iBAAkB,QAClB,gBAAiB,OACjB,gBAAiB,OACjB,kBAAmB,WFAnBC,UAAW,eGVAC,GAAcxF,GACZ,OAATA,EAAsB,OACtB7O,MAAMF,QAAQ+O,GAAc,eAClBA,EAIHyF,GAAmBzF,IAC9B,MAAMzC,EAAOiI,GAAYxF,GAEzB,GAAa,UAATzC,GAA6B,WAATA,EACtB,OAAO,EAGT,GAAa,UAATA,EACF,OAAoB,IAAhByC,EAAKlO,OAAqB,EAEvB,EAAIkO,EAAK0F,OAAO,CAACC,EAAKzN,IAASyN,EAAMF,GAAiBvN,GAAO,GAAK,EAG3E,GAAa,WAATqF,EAAmB,CACrB,MAAMhL,EAAOR,OAAOQ,KAAKyN,GACzB,OAAoB,IAAhBzN,EAAKT,OAAqB,EAEvB,EAAIS,EAAKmT,OAAO,CAACC,EAAK9S,IAAQ8S,EAAMF,GAAiBzF,EAAKnN,IAAO,GAAK,CAC/E,CAEA,OAAO,GAGI+S,GAAuB,SAAC5F,EAAM6F,GAA8C,IAA/BrS,EAAIyC,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,QAAS6P,EAAK7P,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,EACjF,MAAM1D,EAAO,IAAIwL,IACXR,EAAOiI,GAAYxF,GAEzB,MAAa,UAATzC,GAA6B,WAATA,IAIpBuI,GAASD,GACXtT,EAAKsF,IAAIrE,EAAKU,KAAK,MAGR,UAATqJ,EACFyC,EAAKpN,QAAQ,CAACsF,EAAM3C,KACAqQ,GAAqB1N,EAAM2N,EAAe,IAAIrS,EAAM+B,GAAQuQ,EAAQ,GAC5ElT,QAAQC,GAAON,EAAKsF,IAAIhF,MAElB,WAAT0K,GACTxL,OAAOgU,QAAQ/F,GAAMpN,QAAQ+J,IAAsB,IAApBqJ,EAAS9U,GAAMyL,EAC1BiJ,GAAqB1U,EAAO2U,EAAe,IAAIrS,EAAMwS,GAAUF,EAAQ,GAC/ElT,QAAQC,GAAON,EAAKsF,IAAIhF,OAf7BN,CAoBX,EAEa0T,GAAiB,SAACjG,GAA0B,IAApBxM,EAAIyC,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,QAC3C,MAAMiQ,EAAQ,GACR3I,EAAOiI,GAAYxF,GAEnBmG,EAAU3S,EAAKU,KAAK,KAa1B,OAZAgS,EAAMlT,KAAK,CAAEQ,KAAM2S,EAASjV,MAAO8O,EAAMzC,SAE5B,UAATA,EACFyC,EAAKpN,QAAQ,CAACsF,EAAM3C,KAClB2Q,EAAMlT,QAAQiT,GAAe/N,EAAM,IAAI1E,EAAM+B,OAE7B,WAATgI,GAA8B,OAATyC,GAC9BjO,OAAOgU,QAAQ/F,GAAMpN,QAAQmO,IAAsB,IAApBiF,EAAS9U,GAAM6P,EAC5CmF,EAAMlT,QAAQiT,GAAe/U,EAAO,IAAIsC,EAAMwS,OAI3CE,CACT,EAEaE,GAA4B,SAACpG,GAA0B,IAApBxM,EAAIyC,UAAAnE,OAAA,QAAAH,IAAAsE,UAAA,GAAAA,UAAA,GAAG,CAAC,QACtD,MAAM1D,EAAO,IAAIwL,IACXR,EAAOiI,GAAYxF,GAEzB,MAAa,UAATzC,GAA6B,WAATA,GAKX,UAATA,GAAoC,IAAhByC,EAAKlO,QAChB,WAATyL,GAAkD,IAA7BxL,OAAOQ,KAAKyN,GAAMlO,SAE3CS,EAAKsF,IAAIrE,EAAKU,KAAK,MAEN,UAATqJ,EACFyC,EAAKpN,QAAQ,CAACsF,EAAM3C,KACA6Q,GAA0BlO,EAAM,IAAI1E,EAAM+B,IAClD3C,QAAQC,GAAON,EAAKsF,IAAIhF,MAGpCd,OAAOgU,QAAQ/F,GAAMpN,QAAQoO,IAAsB,IAApBgF,EAAS9U,GAAM8P,EAC1BoF,GAA0BlV,EAAO,IAAIsC,EAAMwS,IACnDpT,QAAQC,GAAON,EAAKsF,IAAIhF,OAjB7BN,CAsBX,E,slBCtGA,MAAM8T,GAAgB5E,IAAyB,IAAxB,KAAE/H,EAAI,UAAE4M,GAAW7E,EACxC,IAAK6E,EACH,OAAOC,EAAAA,EAAAA,KAAAC,EAAAA,SAAA,CAAA3G,SAAGnG,IAGZ,MAAM+M,EAAQ,IAAIC,OAAO,IAAIJ,EAAUzK,QAAQ,sBAAuB,WAAY,MAC5E8K,EAAQjN,EAAKzF,MAAMwS,GAEzB,OACEF,EAAAA,EAAAA,KAAAC,EAAAA,SAAA,CAAA3G,SACG8G,EAAM5N,IAAI,CAAC6N,EAAMrR,IAChBkR,EAAMI,KAAKD,IACTL,EAAAA,EAAAA,KAAA,QAAkBO,UAAWC,GAAMT,UAAUzG,SAC1C+G,GADQrR,IAIXgR,EAAAA,EAAAA,KAAA,QAAA1G,SAAmB+G,GAARrR,OCXfyR,GAAYhF,IAA8F,IAA7F,KAAEhC,EAAI,KAAExM,EAAI,SAAEyT,EAAQ,cAAEC,EAAa,UAAEZ,EAAS,aAAEa,EAAY,YAAEC,EAAW,UAAEC,GAAWrF,EACzG,MAAM,cAAEsF,IAAkBC,EAAAA,EAAAA,WACpBhK,EAAOiI,GAAYxF,GACnBnN,EAAMW,EAAKU,KAAK,KAChBsT,EAAcN,EAAcvQ,IAAI9D,GAChC4U,EAAYN,EAAaxQ,IAAI9D,GAE7B6U,GAAeC,EAAAA,EAAAA,aAAY,KAC/BV,EAASpU,IACR,CAACA,EAAKoU,IAET,GAAa,SAAT1J,EACF,OACEqK,EAAAA,EAAAA,MAAApB,EAAAA,SAAA,CAAA3G,SAAA,EACE0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWe,IAAWd,GAAMe,KAAM,CAAE,CAACf,GAAMgB,SAAUN,IAAa5H,SAAC,SACxEwH,IAAad,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMiB,MAAMnI,SAAC,SAKlD,GAAa,cAATtC,EACF,OACEqK,EAAAA,EAAAA,MAAApB,EAAAA,SAAA,CAAA3G,SAAA,EACE0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWe,IAAWd,GAAMe,KAAM,CAAE,CAACf,GAAMgB,SAAUN,IAAa5H,SAAC,cACxEwH,IAAad,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMiB,MAAMnI,SAAC,SAKlD,GAAa,YAATtC,EACF,OACEqK,EAAAA,EAAAA,MAAApB,EAAAA,SAAA,CAAA3G,SAAA,EACE0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWe,IAAWd,GAAMkB,QAAS,CAAE,CAAClB,GAAMgB,SAAUN,IAAa5H,UACzE0G,EAAAA,EAAAA,KAACF,GAAa,CAAC3M,KAAMsG,EAAO,OAAS,QAASsG,UAAWA,MAE1De,IAAad,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMiB,MAAMnI,SAAC,SAKlD,GAAa,WAATtC,EACF,OACEqK,EAAAA,EAAAA,MAAApB,EAAAA,SAAA,CAAA3G,SAAA,EACE0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWe,IAAWd,GAAMmB,OAAQ,CAAE,CAACnB,GAAMgB,SAAUN,IAAa5H,UACxE0G,EAAAA,EAAAA,KAACF,GAAa,CAAC3M,KAAMgC,OAAOsE,GAAOsG,UAAWA,MAE/Ce,IAAad,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMiB,MAAMnI,SAAC,SAKlD,GAAa,WAATtC,EACF,OACEqK,EAAAA,EAAAA,MAAApB,EAAAA,SAAA,CAAA3G,SAAA,EACE+H,EAAAA,EAAAA,MAAA,QAAMd,UAAWe,IAAWd,GAAMoB,OAAQ,CAAE,CAACpB,GAAMgB,SAAUN,IAAa5H,SAAC,MACxE0G,EAAAA,EAAAA,KAACF,GAAa,CAAC3M,KAAMsG,EAAMsG,UAAWA,IACzC,OACCe,IAAad,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMiB,MAAMnI,SAAC,SAKlD,GAAa,UAATtC,GAA6B,WAATA,EAAmB,CACzC,MAAMwI,EAAmB,UAATxI,EAAmByC,EAAKjH,IAAI,CAACb,EAAM3C,IAAU,CAACA,EAAO2C,IAASnG,OAAOgU,QAAQ/F,GACvFoI,EAA6B,IAAnBrC,EAAQjU,OAClBuW,EAAuB,UAAT9K,EAAmB,IAAM,IACvC+K,EAAwB,UAAT/K,EAAmB,IAAM,IAE9C,OAAI6K,GAEAR,EAAAA,EAAAA,MAAA,QAAMd,UAAWC,GAAMwB,QAAQ1I,SAAA,CAC5BwI,EACAC,MAMLV,EAAAA,EAAAA,MAAA,QAAMd,UAAWC,GAAMyB,YAAY3I,SAAA,EACjC0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAM,aAAalH,UAClC+H,EAAAA,EAAAA,MAAA,QAAMd,UAAWC,GAAM0B,OAAQC,QAAShB,EAAa7H,SAAA,EACnD0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWe,IAAWd,GAAM4B,MAAO,CAAE,CAAC5B,GAAM6B,WAAYpB,IAAe3H,SAAC,YAC9E0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMwB,QAAQ1I,SAAEwI,SAGpCb,IACCI,EAAAA,EAAAA,MAAA,QAAMd,UAAWC,GAAM8B,QAAQhJ,SAAA,CAAC,MAC1BkG,EAAQjU,OAAO,IAAEwV,EAAc,CAAErU,GAAI,aAAqB,UAATsK,EAAmB,QAAU,aAGrFiK,IACCI,EAAAA,EAAAA,MAAApB,EAAAA,SAAA,CAAA3G,SAAA,EACE0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMwB,QAAQ1I,SAAEyI,IAChCjB,IAAad,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMiB,MAAMnI,SAAC,UAG9C2H,IACAI,EAAAA,EAAAA,MAAApB,EAAAA,SAAA,CAAA3G,SAAA,EACE0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAM+B,QAAS/B,MAAO,CAAEgC,YAAa,GAAG3B,OAAkBvH,SACxEkG,EAAQhN,IAAI,CAAAmJ,EAAmB3M,KAAU,IAA3ByQ,EAAS9U,GAAMgR,EAC5B,MAAM8G,EAAY,IAAIxV,EAAMwS,GACtBiD,EAAYzD,GAAYtU,GACxBgY,EAAWF,EAAU9U,KAAK,KAC1BiV,EAAmBjC,EAAcvQ,IAAIuS,GACrCE,EAA+B,UAAdH,GAAuC,WAAdA,EAAyBxD,GAAiBvU,GAAS,EAC7FmY,EAAkBF,GAAoBC,EAAiB,EAE7D,OACExB,EAAAA,EAAAA,MAAA,OAAmBd,UAAWC,GAAMuC,KAAMvC,MAAOsC,EAAkB,CAAE,eAAgBD,QAAmBzX,EAAUkO,SAAA,EAChH0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMlU,IAAIgN,SAAW,WAATtC,EAAoB,IAAIyI,KAAaA,KAClEO,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMwC,MAAM1J,SAAC,OAC9B0G,EAAAA,EAAAA,KAACS,GAAS,CAAChH,KAAM9O,EAAOsC,KAAMwV,EAAW/B,SAAUA,EAAUC,cAAeA,EAAeZ,UAAWA,EAAWa,aAAcA,EAAcC,YAAaA,EAAaC,UAAW9R,EAAQwQ,EAAQjU,OAAS,MAHnMkU,QAQhB4B,EAAAA,EAAAA,MAAA,QAAMd,UAAWC,GAAM,cAAclH,SAAA,EACnC0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMwB,QAAQ1I,SAAEyI,IAChCjB,IAAad,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMiB,MAAMnI,SAAC,cAMxD,CAEA,OAAO0G,EAAAA,EAAAA,KAAA,QAAA1G,SAAOnE,OAAOsE,MC/HjBwJ,GAAUrH,IAA0G,IAAzG,YAAEsH,EAAW,eAAEC,EAAc,eAAEC,EAAc,cAAEC,EAAa,MAAEC,EAAK,WAAEC,EAAU,YAAEC,EAAW,KAAE/J,GAAMmC,EACnH,MAAM,cAAEmF,IAAkBC,EAAAA,EAAAA,YACnByC,EAAQC,IAAaC,EAAAA,EAAAA,WAAS,GAarC,OACEtC,EAAAA,EAAAA,MAAA,OAAKd,UAAWe,IAAWd,GAAMoD,QAASpD,GAAM,SAAS8C,KAAU,CAAE,CAAC9C,GAAM,mBAAoB+C,GAAcC,IAAelK,SAAA,CAC1HiK,IACClC,EAAAA,EAAAA,MAAA,OAAKd,UAAWC,GAAM,kBAAkBlH,SAAA,EACtC0G,EAAAA,EAAAA,KAAA,SAAOhJ,KAAK,OAAOrM,MAAOuY,EAAaW,SAAUrH,GAAK2G,EAAe3G,EAAEsH,OAAOnZ,OAAQoZ,YAAahD,EAAc,CAAErU,GAAI,+BAAiC6T,UAAWC,GAAM,kBACxK0C,IACClD,EAAAA,EAAAA,KAAA,UAAQO,UAAWC,GAAM,aAAc2B,QAASA,IAAMgB,EAAe,IAAI7J,SAAC,aAMhF+H,EAAAA,EAAAA,MAAA,OAAKd,UAAWC,GAAM,gBAAgBlH,SAAA,EACpC0G,EAAAA,EAAAA,KAAA,UAAQO,UAAWC,GAAM,cAAe2B,QAxB3B6B,UACjB,IACE,MAAMC,EAAUlX,KAAKC,UAAUyM,EAAM,KAAM,SACrCyK,UAAUC,UAAUC,UAAUH,GACpCP,GAAU,GACVW,WAAW,IAAMX,GAAU,GAAQ,I,CACnC,MAAOY,GACPC,QAAQC,MAAM,kBAAmBF,EACnC,GAgBiExH,MAAOiE,EAAc,CAAErU,GAAI+W,EAAS,kBAAoB,kBAAmBnK,SACrImK,GAASzD,EAAAA,EAAAA,KAACyE,GAAW,KAAIzE,EAAAA,EAAAA,KAAC0E,GAAU,MAEtClB,IACCxD,EAAAA,EAAAA,KAAA,UAAQO,UAAWC,GAAM,cAAe2B,QAASiB,EAAgBtG,MAAOiE,EAAc,CAAErU,GAAI2W,EAAgB,uBAAyB,uBAAwB/J,SAC1J+J,GAAgBrD,EAAAA,EAAAA,KAAC2E,GAAc,KAAI3E,EAAAA,EAAAA,KAAC4E,GAAY,aC7BvDC,GAAWjG,GAAW/C,IAAoJ,IAAnJ,KAAEpC,EAAM6F,cAAAwF,EAAgBC,IAAUzB,MAAA0B,EAAQ,OAAQzB,WAAA0B,GAAa,EAAMzB,YAAA0B,GAAc,EAAMrE,YAAAsE,EAAc,GAAIC,gBAAAC,GAAkB,EAAI,UAAE9E,GAAW1E,EACzK,MAAOqH,EAAaoC,IAAkB3B,EAAAA,EAAAA,UAAS,IAEzC4B,GAAuBC,EAAAA,EAAAA,SAAQ,SACtBpa,IAATqO,GAAsBqL,IAAkBC,IACnC,IAAIvN,IAEN6H,GAAqB5F,EAAMqL,GACjC,CAACrL,EAAMqL,KAEHnE,EAAe8E,IAAoB9B,EAAAA,EAAAA,UAAS4B,GAE7CG,GAAqBF,EAAAA,EAAAA,SAAQ,SACpBpa,IAATqO,EAA2B,IAAIjC,IAC5BqI,GAA0BpG,GAChC,CAACA,IAEEkM,GAAUH,EAAAA,EAAAA,SAAQ,SACTpa,IAATqO,EAA2B,GACxBiG,GAAejG,GACrB,CAACA,IAEEmM,GAAOJ,EAAAA,EAAAA,SAAQ,IACZ,IAAI5L,EAAK+L,EAAS,CACvB3Z,KAAM,CAAC,SACPsC,gBAAgB,EAChBI,UAAW,GACXW,gBAAgB,EAChBb,mBAAoB,IAErB,CAACmX,IAEE/E,GAAe4E,EAAAA,EAAAA,SAAQ,IJgEAK,EAACD,EAAMlO,KACpC,IAAKA,IAAUkO,EAAM,OAAO,IAAIpO,IAEhC,MAAMI,EAAUgO,EAAK1S,OAAOwE,GACtBkJ,EAAe,IAAIpJ,IAWzB,OATAI,EAAQvL,QAAQ4C,IACd,MAAMhC,EAAOgC,EAAO0C,KAAK1E,KACzB2T,EAAatP,IAAIrE,GACjB,MAAMmT,EAAQnT,EAAKS,MAAM,KACzB,IAAK,IAAIyB,EAAI,EAAGA,EAAIiR,EAAM7U,OAAQ4D,IAChCyR,EAAatP,IAAI8O,EAAMtF,MAAM,EAAG3L,GAAGxB,KAAK,QAIrCiT,GI9EEiF,CAAgBD,EAAM1C,GAC5B,CAAC0C,EAAM1C,KAEV4C,EAAAA,EAAAA,WAAU,KACJ5C,GAAetC,EAAarP,KAAO,GACrCkU,EAAiBM,IACf,MAAM/M,EAAO,IAAIxB,IAAIuO,GAMrB,OALAnF,EAAavU,QAAQY,IACf+L,EAAK5I,IAAInD,IACX+L,EAAKgN,OAAO/Y,KAGT+L,KAGV,CAACkK,EAAatC,IAEjB,MAAMO,GAAeC,EAAAA,EAAAA,aAAY9U,IAC/BmZ,EAAiBM,IACf,MAAM/M,EAAO,IAAIxB,IAAIuO,GAMrB,OALI/M,EAAK5I,IAAI9D,GACX0M,EAAKgN,OAAO1Z,GAEZ0M,EAAK1H,IAAIhF,GAEJ0M,KAER,IAEGiN,GAAkB7E,EAAAA,EAAAA,aAAY,KAClCqE,EAAiB,IAAIjO,MACpB,IAEG0O,GAAoB9E,EAAAA,EAAAA,aAAY,KACpCqE,EAAiB,IAAIjO,IAAIkO,KACxB,CAACA,IAGErC,EAAuC,IAAvB1C,EAAcpP,KAG9B4U,GAAiBX,EAAAA,EAAAA,SAAQ,SAChBpa,IAATqO,EAA2B,EACxByF,GAAiBzF,GACvB,CAACA,IAGE2M,GAAgBZ,EAAAA,EAAAA,SAAQ,KAC5B,MAAMxO,EAAOiI,GAAYxF,GACzB,MAAa,UAATzC,GAA6B,WAATA,EAA0B,EAC7C2J,EAAcvQ,IAAI,QAChB+V,EADgC,GAEtC,CAAC1M,EAAMkH,EAAewF,IAGnBE,GAAkBb,EAAAA,EAAAA,SAAQ,KAC9B,MAAMc,EAASnR,OAAOgR,GAAgB5a,OACtC,OAAOyE,KAAKuD,IAAI,GAAIvD,KAAKuW,KAAc,IAATD,EAAe,MAC5C,CAACH,IAGEK,GAAqBpF,EAAAA,EAAAA,aAAY,KACjCiC,EACF6C,IAEAD,KAED,CAAC5C,EAAe4C,EAAiBC,IAEpC,YAAa9a,IAATqO,GAEAuG,EAAAA,EAAAA,KAAA,OAAKO,UAAWe,IAAWd,GAAMiG,UAAWjG,GAAM,SAASwE,KAAUzE,GAAWjH,UAC9E0G,EAAAA,EAAAA,KAAA,QAAMO,UAAWC,GAAMe,KAAKjI,SAAC,iBAMjC+H,EAAAA,EAAAA,MAAA,OAAKd,UAAWe,IAAWd,GAAMkG,QAASlG,GAAM,SAASwE,KAAUzE,GAAWjH,SAAA,EAC1E2L,GAAcC,KACdlF,EAAAA,EAAAA,KAACiD,GAAO,CAACC,YAAaA,EAAaC,eAAgBmC,EAAgBlC,eAAgBoD,EAAoBnD,cAAeA,EAAeC,MAAO0B,EAAOzB,WAAY0B,EAAYzB,YAAa0B,EAAazL,KAAMA,KAE7MuG,EAAAA,EAAAA,KAAA,OAAKO,UAAWe,IAAWd,GAAMiG,UAAW,CAAE,CAACjG,GAAM,sBAAuB6E,IAAoB7E,MAAO6E,EAAkB,CAAE,sBAAuB,GAAGgB,YAAwBjb,EAAUkO,UACrL0G,EAAAA,EAAAA,KAAA,OAAKO,UAAWC,GAAMuC,KAAMvC,MAAO4F,EAAgB,EAAI,CAAE,eAAgBA,QAAkBhb,EAAUkO,UACnG0G,EAAAA,EAAAA,KAACS,GAAS,CAAChH,KAAMA,EAAMxM,KAAM,CAAC,QAASyT,SAAUS,EAAcR,cAAeA,EAAeZ,UAAWmD,EAAatC,aAAcA,EAAcC,YAAasE,Y,aCxHvK,kBACA,aAEA,IAAIvZ,EAAS,CAAC,EAAEC,eAEhB,SAASyV,IAGR,IAFA,IAAIqF,EAAU,GAELxX,EAAI,EAAGA,EAAIO,UAAUnE,OAAQ4D,IAAK,CAC1C,IAAIyX,EAAMlX,UAAUP,GAChByX,IACHD,EAAUE,EAAYF,EAASG,EAAWF,IAE5C,CAEA,OAAOD,CACR,CAEA,SAASG,EAAYF,GACpB,GAAmB,kBAARA,GAAmC,kBAARA,EACrC,OAAOA,EAGR,GAAmB,kBAARA,EACV,MAAO,GAGR,GAAIhc,MAAMF,QAAQkc,GACjB,OAAOtF,EAAW3E,MAAM,KAAMiK,GAG/B,GAAIA,EAAIlb,WAAaF,OAAOC,UAAUC,WAAakb,EAAIlb,SAASA,WAAWqb,SAAS,iBACnF,OAAOH,EAAIlb,WAGZ,IAAIib,EAAU,GAEd,IAAK,IAAIra,KAAOsa,EACXhb,EAAOD,KAAKib,EAAKta,IAAQsa,EAAIta,KAChCqa,EAAUE,EAAYF,EAASra,IAIjC,OAAOqa,CACR,CAEA,SAASE,EAAalc,EAAOqc,GAC5B,OAAKA,EAIDrc,EACIA,EAAQ,IAAMqc,EAGfrc,EAAQqc,EAPPrc,CAQT,CAEqCsc,EAAOC,SAC3C5F,EAAW6F,QAAU7F,EACrB2F,EAAOC,QAAU5F,QAKhB,KAFwB,EAAF,WACtB,OAAOA,CACP,UAFoB,OAEpB,YAIF,CArEA,E","sources":["../node_modules/fuse.js/dist/fuse.mjs","../node_modules/@kne/json-view/dist/copy~drOLfxzP.svg","../node_modules/@kne/json-view/dist/check~elxgVvVe.svg","../node_modules/@kne/json-view/dist/expand~blSbUwvt.svg","../node_modules/@kne/json-view/dist/collapse~vphRLfPi.svg","../node_modules/@kne/json-view/src/withLocale.js","../node_modules/@kne/json-view/src/locale/zh-CN.js","../node_modules/@kne/json-view/src/locale/en-US.js","../node_modules/@kne/json-view/src/utils/helpers.js","../node_modules/@kne/json-view/src/components/HighlightText.js","../node_modules/@kne/json-view/src/components/JsonValue.js","../node_modules/@kne/json-view/src/components/Toolbar.js","../node_modules/@kne/json-view/src/index.js","../node_modules/classnames/index.js"],"sourcesContent":["/**\n * Fuse.js v7.1.0 - Lightweight fuzzy-search (http://fusejs.io)\n *\n * Copyright (c) 2025 Kiro Risk (http://kiro.me)\n * All Rights Reserved. Apache Software License 2.0\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n */\n\nfunction isArray(value) {\n return !Array.isArray\n ? getTag(value) === '[object Array]'\n : Array.isArray(value)\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/baseToString.js\nconst INFINITY = 1 / 0;\nfunction baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value\n }\n let result = value + '';\n return result == '0' && 1 / value == -INFINITY ? '-0' : result\n}\n\nfunction toString(value) {\n return value == null ? '' : baseToString(value)\n}\n\nfunction isString(value) {\n return typeof value === 'string'\n}\n\nfunction isNumber(value) {\n return typeof value === 'number'\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js\nfunction isBoolean(value) {\n return (\n value === true ||\n value === false ||\n (isObjectLike(value) && getTag(value) == '[object Boolean]')\n )\n}\n\nfunction isObject(value) {\n return typeof value === 'object'\n}\n\n// Checks if `value` is object-like.\nfunction isObjectLike(value) {\n return isObject(value) && value !== null\n}\n\nfunction isDefined(value) {\n return value !== undefined && value !== null\n}\n\nfunction isBlank(value) {\n return !value.trim().length\n}\n\n// Gets the `toStringTag` of `value`.\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js\nfunction getTag(value) {\n return value == null\n ? value === undefined\n ? '[object Undefined]'\n : '[object Null]'\n : Object.prototype.toString.call(value)\n}\n\nconst EXTENDED_SEARCH_UNAVAILABLE = 'Extended search is not available';\n\nconst INCORRECT_INDEX_TYPE = \"Incorrect 'index' type\";\n\nconst LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = (key) =>\n `Invalid value for key ${key}`;\n\nconst PATTERN_LENGTH_TOO_LARGE = (max) =>\n `Pattern length exceeds max of ${max}.`;\n\nconst MISSING_KEY_PROPERTY = (name) => `Missing ${name} property in key`;\n\nconst INVALID_KEY_WEIGHT_VALUE = (key) =>\n `Property 'weight' in key '${key}' must be a positive integer`;\n\nconst hasOwn = Object.prototype.hasOwnProperty;\n\nclass KeyStore {\n constructor(keys) {\n this._keys = [];\n this._keyMap = {};\n\n let totalWeight = 0;\n\n keys.forEach((key) => {\n let obj = createKey(key);\n\n this._keys.push(obj);\n this._keyMap[obj.id] = obj;\n\n totalWeight += obj.weight;\n });\n\n // Normalize weights so that their sum is equal to 1\n this._keys.forEach((key) => {\n key.weight /= totalWeight;\n });\n }\n get(keyId) {\n return this._keyMap[keyId]\n }\n keys() {\n return this._keys\n }\n toJSON() {\n return JSON.stringify(this._keys)\n }\n}\n\nfunction createKey(key) {\n let path = null;\n let id = null;\n let src = null;\n let weight = 1;\n let getFn = null;\n\n if (isString(key) || isArray(key)) {\n src = key;\n path = createKeyPath(key);\n id = createKeyId(key);\n } else {\n if (!hasOwn.call(key, 'name')) {\n throw new Error(MISSING_KEY_PROPERTY('name'))\n }\n\n const name = key.name;\n src = name;\n\n if (hasOwn.call(key, 'weight')) {\n weight = key.weight;\n\n if (weight <= 0) {\n throw new Error(INVALID_KEY_WEIGHT_VALUE(name))\n }\n }\n\n path = createKeyPath(name);\n id = createKeyId(name);\n getFn = key.getFn;\n }\n\n return { path, id, weight, src, getFn }\n}\n\nfunction createKeyPath(key) {\n return isArray(key) ? key : key.split('.')\n}\n\nfunction createKeyId(key) {\n return isArray(key) ? key.join('.') : key\n}\n\nfunction get(obj, path) {\n let list = [];\n let arr = false;\n\n const deepGet = (obj, path, index) => {\n if (!isDefined(obj)) {\n return\n }\n if (!path[index]) {\n // If there's no path left, we've arrived at the object we care about.\n list.push(obj);\n } else {\n let key = path[index];\n\n const value = obj[key];\n\n if (!isDefined(value)) {\n return\n }\n\n // If we're at the last value in the path, and if it's a string/number/bool,\n // add it to the list\n if (\n index === path.length - 1 &&\n (isString(value) || isNumber(value) || isBoolean(value))\n ) {\n list.push(toString(value));\n } else if (isArray(value)) {\n arr = true;\n // Search each item in the array.\n for (let i = 0, len = value.length; i < len; i += 1) {\n deepGet(value[i], path, index + 1);\n }\n } else if (path.length) {\n // An object. Recurse further.\n deepGet(value, path, index + 1);\n }\n }\n };\n\n // Backwards compatibility (since path used to be a string)\n deepGet(obj, isString(path) ? path.split('.') : path, 0);\n\n return arr ? list : list[0]\n}\n\nconst MatchOptions = {\n // Whether the matches should be included in the result set. When `true`, each record in the result\n // set will include the indices of the matched characters.\n // These can consequently be used for highlighting purposes.\n includeMatches: false,\n // When `true`, the matching function will continue to the end of a search pattern even if\n // a perfect match has already been located in the string.\n findAllMatches: false,\n // Minimum number of characters that must be matched before a result is considered a match\n minMatchCharLength: 1\n};\n\nconst BasicOptions = {\n // When `true`, the algorithm continues searching to the end of the input even if a perfect\n // match is found before the end of the same input.\n isCaseSensitive: false,\n // When `true`, the algorithm will ignore diacritics (accents) in comparisons\n ignoreDiacritics: false,\n // When true, the matching function will continue to the end of a search pattern even if\n includeScore: false,\n // List of properties that will be searched. This also supports nested properties.\n keys: [],\n // Whether to sort the result list, by score\n shouldSort: true,\n // Default sort function: sort by ascending score, ascending index\n sortFn: (a, b) =>\n a.score === b.score ? (a.idx < b.idx ? -1 : 1) : a.score < b.score ? -1 : 1\n};\n\nconst FuzzyOptions = {\n // Approximately where in the text is the pattern expected to be found?\n location: 0,\n // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match\n // (of both letters and location), a threshold of '1.0' would match anything.\n threshold: 0.6,\n // Determines how close the match must be to the fuzzy location (specified above).\n // An exact letter match which is 'distance' characters away from the fuzzy location\n // would score as a complete mismatch. A distance of '0' requires the match be at\n // the exact location specified, a threshold of '1000' would require a perfect match\n // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.\n distance: 100\n};\n\nconst AdvancedOptions = {\n // When `true`, it enables the use of unix-like search commands\n useExtendedSearch: false,\n // The get function to use when fetching an object's properties.\n // The default will search nested paths *ie foo.bar.baz*\n getFn: get,\n // When `true`, search will ignore `location` and `distance`, so it won't matter\n // where in the string the pattern appears.\n // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score\n ignoreLocation: false,\n // When `true`, the calculation for the relevance score (used for sorting) will\n // ignore the field-length norm.\n // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm\n ignoreFieldNorm: false,\n // The weight to determine how much field length norm effects scoring.\n fieldNormWeight: 1\n};\n\nvar Config = {\n ...BasicOptions,\n ...MatchOptions,\n ...FuzzyOptions,\n ...AdvancedOptions\n};\n\nconst SPACE = /[^ ]+/g;\n\n// Field-length norm: the shorter the field, the higher the weight.\n// Set to 3 decimals to reduce index size.\nfunction norm(weight = 1, mantissa = 3) {\n const cache = new Map();\n const m = Math.pow(10, mantissa);\n\n return {\n get(value) {\n const numTokens = value.match(SPACE).length;\n\n if (cache.has(numTokens)) {\n return cache.get(numTokens)\n }\n\n // Default function is 1/sqrt(x), weight makes that variable\n const norm = 1 / Math.pow(numTokens, 0.5 * weight);\n\n // In place of `toFixed(mantissa)`, for faster computation\n const n = parseFloat(Math.round(norm * m) / m);\n\n cache.set(numTokens, n);\n\n return n\n },\n clear() {\n cache.clear();\n }\n }\n}\n\nclass FuseIndex {\n constructor({\n getFn = Config.getFn,\n fieldNormWeight = Config.fieldNormWeight\n } = {}) {\n this.norm = norm(fieldNormWeight, 3);\n this.getFn = getFn;\n this.isCreated = false;\n\n this.setIndexRecords();\n }\n setSources(docs = []) {\n this.docs = docs;\n }\n setIndexRecords(records = []) {\n this.records = records;\n }\n setKeys(keys = []) {\n this.keys = keys;\n this._keysMap = {};\n keys.forEach((key, idx) => {\n this._keysMap[key.id] = idx;\n });\n }\n create() {\n if (this.isCreated || !this.docs.length) {\n return\n }\n\n this.isCreated = true;\n\n // List is Array<String>\n if (isString(this.docs[0])) {\n this.docs.forEach((doc, docIndex) => {\n this._addString(doc, docIndex);\n });\n } else {\n // List is Array<Object>\n this.docs.forEach((doc, docIndex) => {\n this._addObject(doc, docIndex);\n });\n }\n\n this.norm.clear();\n }\n // Adds a doc to the end of the index\n add(doc) {\n const idx = this.size();\n\n if (isString(doc)) {\n this._addString(doc, idx);\n } else {\n this._addObject(doc, idx);\n }\n }\n // Removes the doc at the specified index of the index\n removeAt(idx) {\n this.records.splice(idx, 1);\n\n // Change ref index of every subsquent doc\n for (let i = idx, len = this.size(); i < len; i += 1) {\n this.records[i].i -= 1;\n }\n }\n getValueForItemAtKeyId(item, keyId) {\n return item[this._keysMap[keyId]]\n }\n size() {\n return this.records.length\n }\n _addString(doc, docIndex) {\n if (!isDefined(doc) || isBlank(doc)) {\n return\n }\n\n let record = {\n v: doc,\n i: docIndex,\n n: this.norm.get(doc)\n };\n\n this.records.push(record);\n }\n _addObject(doc, docIndex) {\n let record = { i: docIndex, $: {} };\n\n // Iterate over every key (i.e, path), and fetch the value at that key\n this.keys.forEach((key, keyIndex) => {\n let value = key.getFn ? key.getFn(doc) : this.getFn(doc, key.path);\n\n if (!isDefined(value)) {\n return\n }\n\n if (isArray(value)) {\n let subRecords = [];\n const stack = [{ nestedArrIndex: -1, value }];\n\n while (stack.length) {\n const { nestedArrIndex, value } = stack.pop();\n\n if (!isDefined(value)) {\n continue\n }\n\n if (isString(value) && !isBlank(value)) {\n let subRecord = {\n v: value,\n i: nestedArrIndex,\n n: this.norm.get(value)\n };\n\n subRecords.push(subRecord);\n } else if (isArray(value)) {\n value.forEach((item, k) => {\n stack.push({\n nestedArrIndex: k,\n value: item\n });\n });\n } else ;\n }\n record.$[keyIndex] = subRecords;\n } else if (isString(value) && !isBlank(value)) {\n let subRecord = {\n v: value,\n n: this.norm.get(value)\n };\n\n record.$[keyIndex] = subRecord;\n }\n });\n\n this.records.push(record);\n }\n toJSON() {\n return {\n keys: this.keys,\n records: this.records\n }\n }\n}\n\nfunction createIndex(\n keys,\n docs,\n { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n myIndex.setKeys(keys.map(createKey));\n myIndex.setSources(docs);\n myIndex.create();\n return myIndex\n}\n\nfunction parseIndex(\n data,\n { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n const { keys, records } = data;\n const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n myIndex.setKeys(keys);\n myIndex.setIndexRecords(records);\n return myIndex\n}\n\nfunction computeScore$1(\n pattern,\n {\n errors = 0,\n currentLocation = 0,\n expectedLocation = 0,\n distance = Config.distance,\n ignoreLocation = Config.ignoreLocation\n } = {}\n) {\n const accuracy = errors / pattern.length;\n\n if (ignoreLocation) {\n return accuracy\n }\n\n const proximity = Math.abs(expectedLocation - currentLocation);\n\n if (!distance) {\n // Dodge divide by zero error.\n return proximity ? 1.0 : accuracy\n }\n\n return accuracy + proximity / distance\n}\n\nfunction convertMaskToIndices(\n matchmask = [],\n minMatchCharLength = Config.minMatchCharLength\n) {\n let indices = [];\n let start = -1;\n let end = -1;\n let i = 0;\n\n for (let len = matchmask.length; i < len; i += 1) {\n let match = matchmask[i];\n if (match && start === -1) {\n start = i;\n } else if (!match && start !== -1) {\n end = i - 1;\n if (end - start + 1 >= minMatchCharLength) {\n indices.push([start, end]);\n }\n start = -1;\n }\n }\n\n // (i-1 - start) + 1 => i - start\n if (matchmask[i - 1] && i - start >= minMatchCharLength) {\n indices.push([start, i - 1]);\n }\n\n return indices\n}\n\n// Machine word size\nconst MAX_BITS = 32;\n\nfunction search(\n text,\n pattern,\n patternAlphabet,\n {\n location = Config.location,\n distance = Config.distance,\n threshold = Config.threshold,\n findAllMatches = Config.findAllMatches,\n minMatchCharLength = Config.minMatchCharLength,\n includeMatches = Config.includeMatches,\n ignoreLocation = Config.ignoreLocation\n } = {}\n) {\n if (pattern.length > MAX_BITS) {\n throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS))\n }\n\n const patternLen = pattern.length;\n // Set starting location at beginning text and initialize the alphabet.\n const textLen = text.length;\n // Handle the case when location > text.length\n const expectedLocation = Math.max(0, Math.min(location, textLen));\n // Highest score beyond which we give up.\n let currentThreshold = threshold;\n // Is there a nearby exact match? (speedup)\n let bestLocation = expectedLocation;\n\n // Performance: only computer matches when the minMatchCharLength > 1\n // OR if `includeMatches` is true.\n const computeMatches = minMatchCharLength > 1 || includeMatches;\n // A mask of the matches, used for building the indices\n const matchMask = computeMatches ? Array(textLen) : [];\n\n let index;\n\n // Get all exact matches, here for speed up\n while ((index = text.indexOf(pattern, bestLocation)) > -1) {\n let score = computeScore$1(pattern, {\n currentLocation: index,\n expectedLocation,\n distance,\n ignoreLocation\n });\n\n currentThreshold = Math.min(score, currentThreshold);\n bestLocation = index + patternLen;\n\n if (computeMatches) {\n let i = 0;\n while (i < patternLen) {\n matchMask[index + i] = 1;\n i += 1;\n }\n }\n }\n\n // Reset the best location\n bestLocation = -1;\n\n let lastBitArr = [];\n let finalScore = 1;\n let binMax = patternLen + textLen;\n\n const mask = 1 << (patternLen - 1);\n\n for (let i = 0; i < patternLen; i += 1) {\n // Scan for the best match; each iteration allows for one more error.\n // Run a binary search to determine how far from the match location we can stray\n // at this error level.\n let binMin = 0;\n let binMid = binMax;\n\n while (binMin < binMid) {\n const score = computeScore$1(pattern, {\n errors: i,\n currentLocation: expectedLocation + binMid,\n expectedLocation,\n distance,\n ignoreLocation\n });\n\n if (score <= currentThreshold) {\n binMin = binMid;\n } else {\n binMax = binMid;\n }\n\n binMid = Math.floor((binMax - binMin) / 2 + binMin);\n }\n\n // Use the result from this iteration as the maximum for the next.\n binMax = binMid;\n\n let start = Math.max(1, expectedLocation - binMid + 1);\n let finish = findAllMatches\n ? textLen\n : Math.min(expectedLocation + binMid, textLen) + patternLen;\n\n // Initialize the bit array\n let bitArr = Array(finish + 2);\n\n bitArr[finish + 1] = (1 << i) - 1;\n\n for (let j = finish; j >= start; j -= 1) {\n let currentLocation = j - 1;\n let charMatch = patternAlphabet[text.charAt(currentLocation)];\n\n if (computeMatches) {\n // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`)\n matchMask[currentLocation] = +!!charMatch;\n }\n\n // First pass: exact match\n bitArr[j] = ((bitArr[j + 1] << 1) | 1) & charMatch;\n\n // Subsequent passes: fuzzy match\n if (i) {\n bitArr[j] |=\n ((lastBitArr[j + 1] | lastBitArr[j]) << 1) | 1 | lastBitArr[j + 1];\n }\n\n if (bitArr[j] & mask) {\n finalScore = computeScore$1(pattern, {\n errors: i,\n currentLocation,\n expectedLocation,\n distance,\n ignoreLocation\n });\n\n // This match will almost certainly be better than any existing match.\n // But check anyway.\n if (finalScore <= currentThreshold) {\n // Indeed it is\n currentThreshold = finalScore;\n bestLocation = currentLocation;\n\n // Already passed `loc`, downhill from here on in.\n if (bestLocation <= expectedLocation) {\n break\n }\n\n // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.\n start = Math.max(1, 2 * expectedLocation - bestLocation);\n }\n }\n }\n\n // No hope for a (better) match at greater error levels.\n const score = computeScore$1(pattern, {\n errors: i + 1,\n currentLocation: expectedLocation,\n expectedLocation,\n distance,\n ignoreLocation\n });\n\n if (score > currentThreshold) {\n break\n }\n\n lastBitArr = bitArr;\n }\n\n const result = {\n isMatch: bestLocation >= 0,\n // Count exact matches (those with a score of 0) to be \"almost\" exact\n score: Math.max(0.001, finalScore)\n };\n\n if (computeMatches) {\n const indices = convertMaskToIndices(matchMask, minMatchCharLength);\n if (!indices.length) {\n result.isMatch = false;\n } else if (includeMatches) {\n result.indices = indices;\n }\n }\n\n return result\n}\n\nfunction createPatternAlphabet(pattern) {\n let mask = {};\n\n for (let i = 0, len = pattern.length; i < len; i += 1) {\n const char = pattern.charAt(i);\n mask[char] = (mask[char] || 0) | (1 << (len - i - 1));\n }\n\n return mask\n}\n\nconst stripDiacritics = String.prototype.normalize\n ? ((str) => str.normalize('NFD').replace(/[\\u0300-\\u036F\\u0483-\\u0489\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065F\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u07FD\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0859-\\u085B\\u08D3-\\u08E1\\u08E3-\\u0903\\u093A-\\u093C\\u093E-\\u094F\\u0951-\\u0957\\u0962\\u0963\\u0981-\\u0983\\u09BC\\u09BE-\\u09C4\\u09C7\\u09C8\\u09CB-\\u09CD\\u09D7\\u09E2\\u09E3\\u09FE\\u0A01-\\u0A03\\u0A3C\\u0A3E-\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81-\\u0A83\\u0ABC\\u0ABE-\\u0AC5\\u0AC7-\\u0AC9\\u0ACB-\\u0ACD\\u0AE2\\u0AE3\\u0AFA-\\u0AFF\\u0B01-\\u0B03\\u0B3C\\u0B3E-\\u0B44\\u0B47\\u0B48\\u0B4B-\\u0B4D\\u0B56\\u0B57\\u0B62\\u0B63\\u0B82\\u0BBE-\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCD\\u0BD7\\u0C00-\\u0C04\\u0C3E-\\u0C44\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0C81-\\u0C83\\u0CBC\\u0CBE-\\u0CC4\\u0CC6-\\u0CC8\\u0CCA-\\u0CCD\\u0CD5\\u0CD6\\u0CE2\\u0CE3\\u0D00-\\u0D03\\u0D3B\\u0D3C\\u0D3E-\\u0D44\\u0D46-\\u0D48\\u0D4A-\\u0D4D\\u0D57\\u0D62\\u0D63\\u0D82\\u0D83\\u0DCA\\u0DCF-\\u0DD4\\u0DD6\\u0DD8-\\u0DDF\\u0DF2\\u0DF3\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EB9\\u0EBB\\u0EBC\\u0EC8-\\u0ECD\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F3E\\u0F3F\\u0F71-\\u0F84\\u0F86\\u0F87\\u0F8D-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102B-\\u103E\\u1056-\\u1059\\u105E-\\u1060\\u1062-\\u1064\\u1067-\\u106D\\u1071-\\u1074\\u1082-\\u108D\\u108F\\u109A-\\u109D\\u135D-\\u135F\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17B4-\\u17D3\\u17DD\\u180B-\\u180D\\u1885\\u1886\\u18A9\\u1920-\\u192B\\u1930-\\u193B\\u1A17-\\u1A1B\\u1A55-\\u1A5E\\u1A60-\\u1A7C\\u1A7F\\u1AB0-\\u1ABE\\u1B00-\\u1B04\\u1B34-\\u1B44\\u1B6B-\\u1B73\\u1B80-\\u1B82\\u1BA1-\\u1BAD\\u1BE6-\\u1BF3\\u1C24-\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE8\\u1CED\\u1CF2-\\u1CF4\\u1CF7-\\u1CF9\\u1DC0-\\u1DF9\\u1DFB-\\u1DFF\\u20D0-\\u20F0\\u2CEF-\\u2CF1\\u2D7F\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F-\\uA672\\uA674-\\uA67D\\uA69E\\uA69F\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA823-\\uA827\\uA880\\uA881\\uA8B4-\\uA8C5\\uA8E0-\\uA8F1\\uA8FF\\uA926-\\uA92D\\uA947-\\uA953\\uA980-\\uA983\\uA9B3-\\uA9C0\\uA9E5\\uAA29-\\uAA36\\uAA43\\uAA4C\\uAA4D\\uAA7B-\\uAA7D\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uAAEB-\\uAAEF\\uAAF5\\uAAF6\\uABE3-\\uABEA\\uABEC\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE2F]/g, ''))\n : ((str) => str);\n\nclass BitapSearch {\n constructor(\n pattern,\n {\n location = Config.location,\n threshold = Config.threshold,\n distance = Config.distance,\n includeMatches = Config.includeMatches,\n findAllMatches = Config.findAllMatches,\n minMatchCharLength = Config.minMatchCharLength,\n isCaseSensitive = Config.isCaseSensitive,\n ignoreDiacritics = Config.ignoreDiacritics,\n ignoreLocation = Config.ignoreLocation\n } = {}\n ) {\n this.options = {\n location,\n threshold,\n distance,\n includeMatches,\n findAllMatches,\n minMatchCharLength,\n isCaseSensitive,\n ignoreDiacritics,\n ignoreLocation\n };\n\n pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n this.pattern = pattern;\n\n this.chunks = [];\n\n if (!this.pattern.length) {\n return\n }\n\n const addChunk = (pattern, startIndex) => {\n this.chunks.push({\n pattern,\n alphabet: createPatternAlphabet(pattern),\n startIndex\n });\n };\n\n const len = this.pattern.length;\n\n if (len > MAX_BITS) {\n let i = 0;\n const remainder = len % MAX_BITS;\n const end = len - remainder;\n\n while (i < end) {\n addChunk(this.pattern.substr(i, MAX_BITS), i);\n i += MAX_BITS;\n }\n\n if (remainder) {\n const startIndex = len - MAX_BITS;\n addChunk(this.pattern.substr(startIndex), startIndex);\n }\n } else {\n addChunk(this.pattern, 0);\n }\n }\n\n searchIn(text) {\n const { isCaseSensitive, ignoreDiacritics, includeMatches } = this.options;\n\n text = isCaseSensitive ? text : text.toLowerCase();\n text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n // Exact match\n if (this.pattern === text) {\n let result = {\n isMatch: true,\n score: 0\n };\n\n if (includeMatches) {\n result.indices = [[0, text.length - 1]];\n }\n\n return result\n }\n\n // Otherwise, use Bitap algorithm\n const {\n location,\n distance,\n threshold,\n findAllMatches,\n minMatchCharLength,\n ignoreLocation\n } = this.options;\n\n let allIndices = [];\n let totalScore = 0;\n let hasMatches = false;\n\n this.chunks.forEach(({ pattern, alphabet, startIndex }) => {\n const { isMatch, score, indices } = search(text, pattern, alphabet, {\n location: location + startIndex,\n distance,\n threshold,\n findAllMatches,\n minMatchCharLength,\n includeMatches,\n ignoreLocation\n });\n\n if (isMatch) {\n hasMatches = true;\n }\n\n totalScore += score;\n\n if (isMatch && indices) {\n allIndices = [...allIndices, ...indices];\n }\n });\n\n let result = {\n isMatch: hasMatches,\n score: hasMatches ? totalScore / this.chunks.length : 1\n };\n\n if (hasMatches && includeMatches) {\n result.indices = allIndices;\n }\n\n return result\n }\n}\n\nclass BaseMatch {\n constructor(pattern) {\n this.pattern = pattern;\n }\n static isMultiMatch(pattern) {\n return getMatch(pattern, this.multiRegex)\n }\n static isSingleMatch(pattern) {\n return getMatch(pattern, this.singleRegex)\n }\n search(/*text*/) {}\n}\n\nfunction getMatch(pattern, exp) {\n const matches = pattern.match(exp);\n return matches ? matches[1] : null\n}\n\n// Token: 'file\n\nclass ExactMatch extends BaseMatch {\n constructor(pattern) {\n super(pattern);\n }\n static get type() {\n return 'exact'\n }\n static get multiRegex() {\n return /^=\"(.*)\"$/\n }\n static get singleRegex() {\n return /^=(.*)$/\n }\n search(text) {\n const isMatch = text === this.pattern;\n\n return {\n isMatch,\n score: isMatch ? 0 : 1,\n indices: [0, this.pattern.length - 1]\n }\n }\n}\n\n// Token: !fire\n\nclass InverseExactMatch extends BaseMatch {\n constructor(pattern) {\n super(pattern);\n }\n static get type() {\n return 'inverse-exact'\n }\n static get multiRegex() {\n return /^!\"(.*)\"$/\n }\n static get singleRegex() {\n return /^!(.*)$/\n }\n search(text) {\n const index = text.indexOf(this.pattern);\n const isMatch = index === -1;\n\n return {\n isMatch,\n score: isMatch ? 0 : 1,\n indices: [0, text.length - 1]\n }\n }\n}\n\n// Token: ^file\n\nclass PrefixExactMatch extends BaseMatch {\n constructor(pattern) {\n super(pattern);\n }\n static get type() {\n return 'prefix-exact'\n }\n static get multiRegex() {\n return /^\\^\"(.*)\"$/\n }\n static get singleRegex() {\n return /^\\^(.*)$/\n }\n search(text) {\n const isMatch = text.startsWith(this.pattern);\n\n return {\n isMatch,\n score: isMatch ? 0 : 1,\n indices: [0, this.pattern.length - 1]\n }\n }\n}\n\n// Token: !^fire\n\nclass InversePrefixExactMatch extends BaseMatch {\n constructor(pattern) {\n super(pattern);\n }\n static get type() {\n return 'inverse-prefix-exact'\n }\n static get multiRegex() {\n return /^!\\^\"(.*)\"$/\n }\n static get singleRegex() {\n return /^!\\^(.*)$/\n }\n search(text) {\n const isMatch = !text.startsWith(this.pattern);\n\n return {\n isMatch,\n score: isMatch ? 0 : 1,\n indices: [0, text.length - 1]\n }\n }\n}\n\n// Token: .file$\n\nclass SuffixExactMatch extends BaseMatch {\n constructor(pattern) {\n super(pattern);\n }\n static get type() {\n return 'suffix-exact'\n }\n static get multiRegex() {\n return /^\"(.*)\"\\$$/\n }\n static get singleRegex() {\n return /^(.*)\\$$/\n }\n search(text) {\n const isMatch = text.endsWith(this.pattern);\n\n return {\n isMatch,\n score: isMatch ? 0 : 1,\n indices: [text.length - this.pattern.length, text.length - 1]\n }\n }\n}\n\n// Token: !.file$\n\nclass InverseSuffixExactMatch extends BaseMatch {\n constructor(pattern) {\n super(pattern);\n }\n static get type() {\n return 'inverse-suffix-exact'\n }\n static get multiRegex() {\n return /^!\"(.*)\"\\$$/\n }\n static get singleRegex() {\n return /^!(.*)\\$$/\n }\n search(text) {\n const isMatch = !text.endsWith(this.pattern);\n return {\n isMatch,\n score: isMatch ? 0 : 1,\n indices: [0, text.length - 1]\n }\n }\n}\n\nclass FuzzyMatch extends BaseMatch {\n constructor(\n pattern,\n {\n location = Config.location,\n threshold = Config.threshold,\n distance = Config.distance,\n includeMatches = Config.includeMatches,\n findAllMatches = Config.findAllMatches,\n minMatchCharLength = Config.minMatchCharLength,\n isCaseSensitive = Config.isCaseSensitive,\n ignoreDiacritics = Config.ignoreDiacritics,\n ignoreLocation = Config.ignoreLocation\n } = {}\n ) {\n super(pattern);\n this._bitapSearch = new BitapSearch(pattern, {\n location,\n threshold,\n distance,\n includeMatches,\n findAllMatches,\n minMatchCharLength,\n isCaseSensitive,\n ignoreDiacritics,\n ignoreLocation\n });\n }\n static get type() {\n return 'fuzzy'\n }\n static get multiRegex() {\n return /^\"(.*)\"$/\n }\n static get singleRegex() {\n return /^(.*)$/\n }\n search(text) {\n return this._bitapSearch.searchIn(text)\n }\n}\n\n// Token: 'file\n\nclass IncludeMatch extends BaseMatch {\n constructor(pattern) {\n super(pattern);\n }\n static get type() {\n return 'include'\n }\n static get multiRegex() {\n return /^'\"(.*)\"$/\n }\n static get singleRegex() {\n return /^'(.*)$/\n }\n search(text) {\n let location = 0;\n let index;\n\n const indices = [];\n const patternLen = this.pattern.length;\n\n // Get all exact matches\n while ((index = text.indexOf(this.pattern, location)) > -1) {\n location = index + patternLen;\n indices.push([index, location - 1]);\n }\n\n const isMatch = !!indices.length;\n\n return {\n isMatch,\n score: isMatch ? 0 : 1,\n indices\n }\n }\n}\n\n// ❗Order is important. DO NOT CHANGE.\nconst searchers = [\n ExactMatch,\n IncludeMatch,\n PrefixExactMatch,\n InversePrefixExactMatch,\n InverseSuffixExactMatch,\n SuffixExactMatch,\n InverseExactMatch,\n FuzzyMatch\n];\n\nconst searchersLen = searchers.length;\n\n// Regex to split by spaces, but keep anything in quotes together\nconst SPACE_RE = / +(?=(?:[^\\\"]*\\\"[^\\\"]*\\\")*[^\\\"]*$)/;\nconst OR_TOKEN = '|';\n\n// Return a 2D array representation of the query, for simpler parsing.\n// Example:\n// \"^core go$ | rb$ | py$ xy$\" => [[\"^core\", \"go$\"], [\"rb$\"], [\"py$\", \"xy$\"]]\nfunction parseQuery(pattern, options = {}) {\n return pattern.split(OR_TOKEN).map((item) => {\n let query = item\n .trim()\n .split(SPACE_RE)\n .filter((item) => item && !!item.trim());\n\n let results = [];\n for (let i = 0, len = query.length; i < len; i += 1) {\n const queryItem = query[i];\n\n // 1. Handle multiple query match (i.e, once that are quoted, like `\"hello world\"`)\n let found = false;\n let idx = -1;\n while (!found && ++idx < searchersLen) {\n const searcher = searchers[idx];\n let token = searcher.isMultiMatch(queryItem);\n if (token) {\n results.push(new searcher(token, options));\n found = true;\n }\n }\n\n if (found) {\n continue\n }\n\n // 2. Handle single query matches (i.e, once that are *not* quoted)\n idx = -1;\n while (++idx < searchersLen) {\n const searcher = searchers[idx];\n let token = searcher.isSingleMatch(queryItem);\n if (token) {\n results.push(new searcher(token, options));\n break\n }\n }\n }\n\n return results\n })\n}\n\n// These extended matchers can return an array of matches, as opposed\n// to a singl match\nconst MultiMatchSet = new Set([FuzzyMatch.type, IncludeMatch.type]);\n\n/**\n * Command-like searching\n * ======================\n *\n * Given multiple search terms delimited by spaces.e.g. `^jscript .python$ ruby !java`,\n * search in a given text.\n *\n * Search syntax:\n *\n * | Token | Match type | Description |\n * | ----------- | -------------------------- | -------------------------------------- |\n * | `jscript` | fuzzy-match | Items that fuzzy match `jscript` |\n * | `=scheme` | exact-match | Items that are `scheme` |\n * | `'python` | include-match | Items that include `python` |\n * | `!ruby` | inverse-exact-match | Items that do not include `ruby` |\n * | `^java` | prefix-exact-match | Items that start with `java` |\n * | `!^earlang` | inverse-prefix-exact-match | Items that do not start with `earlang` |\n * | `.js$` | suffix-exact-match | Items that end with `.js` |\n * | `!.go$` | inverse-suffix-exact-match | Items that do not end with `.go` |\n *\n * A single pipe character acts as an OR operator. For example, the following\n * query matches entries that start with `core` and end with either`go`, `rb`,\n * or`py`.\n *\n * ```\n * ^core go$ | rb$ | py$\n * ```\n */\nclass ExtendedSearch {\n constructor(\n pattern,\n {\n isCaseSensitive = Config.isCaseSensitive,\n ignoreDiacritics = Config.ignoreDiacritics,\n includeMatches = Config.includeMatches,\n minMatchCharLength = Config.minMatchCharLength,\n ignoreLocation = Config.ignoreLocation,\n findAllMatches = Config.findAllMatches,\n location = Config.location,\n threshold = Config.threshold,\n distance = Config.distance\n } = {}\n ) {\n this.query = null;\n this.options = {\n isCaseSensitive,\n ignoreDiacritics,\n includeMatches,\n minMatchCharLength,\n findAllMatches,\n ignoreLocation,\n location,\n threshold,\n distance\n };\n\n pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n pattern = ignoreDiacritics ? stripDiacritics(pattern) : pattern;\n this.pattern = pattern;\n this.query = parseQuery(this.pattern, this.options);\n }\n\n static condition(_, options) {\n return options.useExtendedSearch\n }\n\n searchIn(text) {\n const query = this.query;\n\n if (!query) {\n return {\n isMatch: false,\n score: 1\n }\n }\n\n const { includeMatches, isCaseSensitive, ignoreDiacritics } = this.options;\n\n text = isCaseSensitive ? text : text.toLowerCase();\n text = ignoreDiacritics ? stripDiacritics(text) : text;\n\n let numMatches = 0;\n let allIndices = [];\n let totalScore = 0;\n\n // ORs\n for (let i = 0, qLen = query.length; i < qLen; i += 1) {\n const searchers = query[i];\n\n // Reset indices\n allIndices.length = 0;\n numMatches = 0;\n\n // ANDs\n for (let j = 0, pLen = searchers.length; j < pLen; j += 1) {\n const searcher = searchers[j];\n const { isMatch, indices, score } = searcher.search(text);\n\n if (isMatch) {\n numMatches += 1;\n totalScore += score;\n if (includeMatches) {\n const type = searcher.constructor.type;\n if (MultiMatchSet.has(type)) {\n allIndices = [...allIndices, ...indices];\n } else {\n allIndices.push(indices);\n }\n }\n } else {\n totalScore = 0;\n numMatches = 0;\n allIndices.length = 0;\n break\n }\n }\n\n // OR condition, so if TRUE, return\n if (numMatches) {\n let result = {\n isMatch: true,\n score: totalScore / numMatches\n };\n\n if (includeMatches) {\n result.indices = allIndices;\n }\n\n return result\n }\n }\n\n // Nothing was matched\n return {\n isMatch: false,\n score: 1\n }\n }\n}\n\nconst registeredSearchers = [];\n\nfunction register(...args) {\n registeredSearchers.push(...args);\n}\n\nfunction createSearcher(pattern, options) {\n for (let i = 0, len = registeredSearchers.length; i < len; i += 1) {\n let searcherClass = registeredSearchers[i];\n if (searcherClass.condition(pattern, options)) {\n return new searcherClass(pattern, options)\n }\n }\n\n return new BitapSearch(pattern, options)\n}\n\nconst LogicalOperator = {\n AND: '$and',\n OR: '$or'\n};\n\nconst KeyType = {\n PATH: '$path',\n PATTERN: '$val'\n};\n\nconst isExpression = (query) =>\n !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]);\n\nconst isPath = (query) => !!query[KeyType.PATH];\n\nconst isLeaf = (query) =>\n !isArray(query) && isObject(query) && !isExpression(query);\n\nconst convertToExplicit = (query) => ({\n [LogicalOperator.AND]: Object.keys(query).map((key) => ({\n [key]: query[key]\n }))\n});\n\n// When `auto` is `true`, the parse function will infer and initialize and add\n// the appropriate `Searcher` instance\nfunction parse(query, options, { auto = true } = {}) {\n const next = (query) => {\n let keys = Object.keys(query);\n\n const isQueryPath = isPath(query);\n\n if (!isQueryPath && keys.length > 1 && !isExpression(query)) {\n return next(convertToExplicit(query))\n }\n\n if (isLeaf(query)) {\n const key = isQueryPath ? query[KeyType.PATH] : keys[0];\n\n const pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];\n\n if (!isString(pattern)) {\n throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key))\n }\n\n const obj = {\n keyId: createKeyId(key),\n pattern\n };\n\n if (auto) {\n obj.searcher = createSearcher(pattern, options);\n }\n\n return obj\n }\n\n let node = {\n children: [],\n operator: keys[0]\n };\n\n keys.forEach((key) => {\n const value = query[key];\n\n if (isArray(value)) {\n value.forEach((item) => {\n node.children.push(next(item));\n });\n }\n });\n\n return node\n };\n\n if (!isExpression(query)) {\n query = convertToExplicit(query);\n }\n\n return next(query)\n}\n\n// Practical scoring function\nfunction computeScore(\n results,\n { ignoreFieldNorm = Config.ignoreFieldNorm }\n) {\n results.forEach((result) => {\n let totalScore = 1;\n\n result.matches.forEach(({ key, norm, score }) => {\n const weight = key ? key.weight : null;\n\n totalScore *= Math.pow(\n score === 0 && weight ? Number.EPSILON : score,\n (weight || 1) * (ignoreFieldNorm ? 1 : norm)\n );\n });\n\n result.score = totalScore;\n });\n}\n\nfunction transformMatches(result, data) {\n const matches = result.matches;\n data.matches = [];\n\n if (!isDefined(matches)) {\n return\n }\n\n matches.forEach((match) => {\n if (!isDefined(match.indices) || !match.indices.length) {\n return\n }\n\n const { indices, value } = match;\n\n let obj = {\n indices,\n value\n };\n\n if (match.key) {\n obj.key = match.key.src;\n }\n\n if (match.idx > -1) {\n obj.refIndex = match.idx;\n }\n\n data.matches.push(obj);\n });\n}\n\nfunction transformScore(result, data) {\n data.score = result.score;\n}\n\nfunction format(\n results,\n docs,\n {\n includeMatches = Config.includeMatches,\n includeScore = Config.includeScore\n } = {}\n) {\n const transformers = [];\n\n if (includeMatches) transformers.push(transformMatches);\n if (includeScore) transformers.push(transformScore);\n\n return results.map((result) => {\n const { idx } = result;\n\n const data = {\n item: docs[idx],\n refIndex: idx\n };\n\n if (transformers.length) {\n transformers.forEach((transformer) => {\n transformer(result, data);\n });\n }\n\n return data\n })\n}\n\nclass Fuse {\n constructor(docs, options = {}, index) {\n this.options = { ...Config, ...options };\n\n if (\n this.options.useExtendedSearch &&\n !true\n ) {\n throw new Error(EXTENDED_SEARCH_UNAVAILABLE)\n }\n\n this._keyStore = new KeyStore(this.options.keys);\n\n this.setCollection(docs, index);\n }\n\n setCollection(docs, index) {\n this._docs = docs;\n\n if (index && !(index instanceof FuseIndex)) {\n throw new Error(INCORRECT_INDEX_TYPE)\n }\n\n this._myIndex =\n index ||\n createIndex(this.options.keys, this._docs, {\n getFn: this.options.getFn,\n fieldNormWeight: this.options.fieldNormWeight\n });\n }\n\n add(doc) {\n if (!isDefined(doc)) {\n return\n }\n\n this._docs.push(doc);\n this._myIndex.add(doc);\n }\n\n remove(predicate = (/* doc, idx */) => false) {\n const results = [];\n\n for (let i = 0, len = this._docs.length; i < len; i += 1) {\n const doc = this._docs[i];\n if (predicate(doc, i)) {\n this.removeAt(i);\n i -= 1;\n len -= 1;\n\n results.push(doc);\n }\n }\n\n return results\n }\n\n removeAt(idx) {\n this._docs.splice(idx, 1);\n this._myIndex.removeAt(idx);\n }\n\n getIndex() {\n return this._myIndex\n }\n\n search(query, { limit = -1 } = {}) {\n const {\n includeMatches,\n includeScore,\n shouldSort,\n sortFn,\n ignoreFieldNorm\n } = this.options;\n\n let results = isString(query)\n ? isString(this._docs[0])\n ? this._searchStringList(query)\n : this._searchObjectList(query)\n : this._searchLogical(query);\n\n computeScore(results, { ignoreFieldNorm });\n\n if (shouldSort) {\n results.sort(sortFn);\n }\n\n if (isNumber(limit) && limit > -1) {\n results = results.slice(0, limit);\n }\n\n return format(results, this._docs, {\n includeMatches,\n includeScore\n })\n }\n\n _searchStringList(query) {\n const searcher = createSearcher(query, this.options);\n const { records } = this._myIndex;\n const results = [];\n\n // Iterate over every string in the index\n records.forEach(({ v: text, i: idx, n: norm }) => {\n if (!isDefined(text)) {\n return\n }\n\n const { isMatch, score, indices } = searcher.searchIn(text);\n\n if (isMatch) {\n results.push({\n item: text,\n idx,\n matches: [{ score, value: text, norm, indices }]\n });\n }\n });\n\n return results\n }\n\n _searchLogical(query) {\n\n const expression = parse(query, this.options);\n\n const evaluate = (node, item, idx) => {\n if (!node.children) {\n const { keyId, searcher } = node;\n\n const matches = this._findMatches({\n key: this._keyStore.get(keyId),\n value: this._myIndex.getValueForItemAtKeyId(item, keyId),\n searcher\n });\n\n if (matches && matches.length) {\n return [\n {\n idx,\n item,\n matches\n }\n ]\n }\n\n return []\n }\n\n const res = [];\n for (let i = 0, len = node.children.length; i < len; i += 1) {\n const child = node.children[i];\n const result = evaluate(child, item, idx);\n if (result.length) {\n res.push(...result);\n } else if (node.operator === LogicalOperator.AND) {\n return []\n }\n }\n return res\n };\n\n const records = this._myIndex.records;\n const resultMap = {};\n const results = [];\n\n records.forEach(({ $: item, i: idx }) => {\n if (isDefined(item)) {\n let expResults = evaluate(expression, item, idx);\n\n if (expResults.length) {\n // Dedupe when adding\n if (!resultMap[idx]) {\n resultMap[idx] = { idx, item, matches: [] };\n results.push(resultMap[idx]);\n }\n expResults.forEach(({ matches }) => {\n resultMap[idx].matches.push(...matches);\n });\n }\n }\n });\n\n return results\n }\n\n _searchObjectList(query) {\n const searcher = createSearcher(query, this.options);\n const { keys, records } = this._myIndex;\n const results = [];\n\n // List is Array<Object>\n records.forEach(({ $: item, i: idx }) => {\n if (!isDefined(item)) {\n return\n }\n\n let matches = [];\n\n // Iterate over every key (i.e, path), and fetch the value at that key\n keys.forEach((key, keyIndex) => {\n matches.push(\n ...this._findMatches({\n key,\n value: item[keyIndex],\n searcher\n })\n );\n });\n\n if (matches.length) {\n results.push({\n idx,\n item,\n matches\n });\n }\n });\n\n return results\n }\n _findMatches({ key, value, searcher }) {\n if (!isDefined(value)) {\n return []\n }\n\n let matches = [];\n\n if (isArray(value)) {\n value.forEach(({ v: text, i: idx, n: norm }) => {\n if (!isDefined(text)) {\n return\n }\n\n const { isMatch, score, indices } = searcher.searchIn(text);\n\n if (isMatch) {\n matches.push({\n score,\n key,\n value: text,\n idx,\n norm,\n indices\n });\n }\n });\n } else {\n const { v: text, n: norm } = value;\n\n const { isMatch, score, indices } = searcher.searchIn(text);\n\n if (isMatch) {\n matches.push({ score, key, value: text, norm, indices });\n }\n }\n\n return matches\n }\n}\n\nFuse.version = '7.1.0';\nFuse.createIndex = createIndex;\nFuse.parseIndex = parseIndex;\nFuse.config = Config;\n\n{\n Fuse.parseQuery = parse;\n}\n\n{\n register(ExtendedSearch);\n}\n\nexport { Fuse as default };\n","var _rect, _path;\nfunction _extends() { return _extends = Object.assign ? Object.assign.bind() : function (n) { for (var e = 1; e < arguments.length; e++) { var t = arguments[e]; for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]); } return n; }, _extends.apply(null, arguments); }\nimport * as React from \"react\";\nfunction SvgCopydrOLfxzP(_ref, svgRef) {\n let {\n title,\n titleId,\n ...props\n } = _ref;\n return /*#__PURE__*/React.createElement(\"svg\", _extends({\n width: 16,\n height: 16,\n viewBox: \"0 0 24 24\",\n fill: \"none\",\n stroke: \"currentColor\",\n strokeWidth: 2,\n strokeLinecap: \"round\",\n strokeLinejoin: \"round\",\n ref: svgRef,\n \"aria-labelledby\": titleId\n }, props), title ? /*#__PURE__*/React.createElement(\"title\", {\n id: titleId\n }, title) : null, _rect || (_rect = /*#__PURE__*/React.createElement(\"rect\", {\n x: 9,\n y: 9,\n width: 13,\n height: 13,\n rx: 2,\n ry: 2\n })), _path || (_path = /*#__PURE__*/React.createElement(\"path\", {\n d: \"M5 15H4a2 2 0 0 1-2-2V4a2 2 0 0 1 2-2h9a2 2 0 0 1 2 2v1\"\n })));\n}\nconst ForwardRef = /*#__PURE__*/React.forwardRef(SvgCopydrOLfxzP);\nexport default __webpack_public_path__ + \"static/media/copy~drOLfxzP.5880fbbaf59db852794c06f32786d138.svg\";\nexport { ForwardRef as ReactComponent };","var _polyline;\nfunction _extends() { return _extends = Object.assign ? Object.assign.bind() : function (n) { for (var e = 1; e < arguments.length; e++) { var t = arguments[e]; for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]); } return n; }, _extends.apply(null, arguments); }\nimport * as React from \"react\";\nfunction SvgCheckelxgVvVe(_ref, svgRef) {\n let {\n title,\n titleId,\n ...props\n } = _ref;\n return /*#__PURE__*/React.createElement(\"svg\", _extends({\n width: 16,\n height: 16,\n viewBox: \"0 0 24 24\",\n fill: \"none\",\n stroke: \"currentColor\",\n strokeWidth: 2,\n strokeLinecap: \"round\",\n strokeLinejoin: \"round\",\n ref: svgRef,\n \"aria-labelledby\": titleId\n }, props), title ? /*#__PURE__*/React.createElement(\"title\", {\n id: titleId\n }, title) : null, _polyline || (_polyline = /*#__PURE__*/React.createElement(\"polyline\", {\n points: \"20 6 9 17 4 12\"\n })));\n}\nconst ForwardRef = /*#__PURE__*/React.forwardRef(SvgCheckelxgVvVe);\nexport default __webpack_public_path__ + \"static/media/check~elxgVvVe.d6bb9a199bf3a5853749ecea3ce6a127.svg\";\nexport { ForwardRef as ReactComponent };","var _polyline, _polyline2, _line, _line2;\nfunction _extends() { return _extends = Object.assign ? Object.assign.bind() : function (n) { for (var e = 1; e < arguments.length; e++) { var t = arguments[e]; for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]); } return n; }, _extends.apply(null, arguments); }\nimport * as React from \"react\";\nfunction SvgExpandblSbUwvt(_ref, svgRef) {\n let {\n title,\n titleId,\n ...props\n } = _ref;\n return /*#__PURE__*/React.createElement(\"svg\", _extends({\n width: 16,\n height: 16,\n viewBox: \"0 0 24 24\",\n fill: \"none\",\n stroke: \"currentColor\",\n strokeWidth: 2,\n strokeLinecap: \"round\",\n strokeLinejoin: \"round\",\n ref: svgRef,\n \"aria-labelledby\": titleId\n }, props), title ? /*#__PURE__*/React.createElement(\"title\", {\n id: titleId\n }, title) : null, _polyline || (_polyline = /*#__PURE__*/React.createElement(\"polyline\", {\n points: \"15 3 21 3 21 9\"\n })), _polyline2 || (_polyline2 = /*#__PURE__*/React.createElement(\"polyline\", {\n points: \"9 21 3 21 3 15\"\n })), _line || (_line = /*#__PURE__*/React.createElement(\"line\", {\n x1: 21,\n y1: 3,\n x2: 14,\n y2: 10\n })), _line2 || (_line2 = /*#__PURE__*/React.createElement(\"line\", {\n x1: 3,\n y1: 21,\n x2: 10,\n y2: 14\n })));\n}\nconst ForwardRef = /*#__PURE__*/React.forwardRef(SvgExpandblSbUwvt);\nexport default __webpack_public_path__ + \"static/media/expand~blSbUwvt.8a0d1f9fb3339d7da34c3117df14b545.svg\";\nexport { ForwardRef as ReactComponent };","var _polyline, _polyline2, _line, _line2;\nfunction _extends() { return _extends = Object.assign ? Object.assign.bind() : function (n) { for (var e = 1; e < arguments.length; e++) { var t = arguments[e]; for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]); } return n; }, _extends.apply(null, arguments); }\nimport * as React from \"react\";\nfunction SvgCollapsevphRLfPi(_ref, svgRef) {\n let {\n title,\n titleId,\n ...props\n } = _ref;\n return /*#__PURE__*/React.createElement(\"svg\", _extends({\n width: 16,\n height: 16,\n viewBox: \"0 0 24 24\",\n fill: \"none\",\n stroke: \"currentColor\",\n strokeWidth: 2,\n strokeLinecap: \"round\",\n strokeLinejoin: \"round\",\n ref: svgRef,\n \"aria-labelledby\": titleId\n }, props), title ? /*#__PURE__*/React.createElement(\"title\", {\n id: titleId\n }, title) : null, _polyline || (_polyline = /*#__PURE__*/React.createElement(\"polyline\", {\n points: \"4 14 10 14 10 20\"\n })), _polyline2 || (_polyline2 = /*#__PURE__*/React.createElement(\"polyline\", {\n points: \"20 10 14 10 14 4\"\n })), _line || (_line = /*#__PURE__*/React.createElement(\"line\", {\n x1: 14,\n y1: 10,\n x2: 21,\n y2: 3\n })), _line2 || (_line2 = /*#__PURE__*/React.createElement(\"line\", {\n x1: 3,\n y1: 21,\n x2: 10,\n y2: 14\n })));\n}\nconst ForwardRef = /*#__PURE__*/React.forwardRef(SvgCollapsevphRLfPi);\nexport default __webpack_public_path__ + \"static/media/collapse~vphRLfPi.378d83c01100d172e79c04ba3179be58.svg\";\nexport { ForwardRef as ReactComponent };","import { createWithIntlProvider } from '@kne/react-intl';\nimport zhCN from './locale/zh-CN';\nimport enUS from './locale/en-US';\n\nconst withLocale = createWithIntlProvider({\n defaultLocale: 'zh-CN',\n messages: {\n 'zh-CN': zhCN,\n 'en-US': enUS\n },\n namespace: 'json-view'\n});\n\nexport default withLocale;\n","const locale = {\n 'JsonView.label': 'JSON 查看器',\n 'JsonView.searchPlaceholder': '搜索...',\n 'JsonView.expand': '展开',\n 'JsonView.collapse': '收起',\n 'JsonView.expandAll': '展开全部',\n 'JsonView.collapseAll': '收起全部',\n 'JsonView.items': '项',\n 'JsonView.keys': '个键',\n 'JsonView.copy': '复制',\n 'JsonView.copied': '已复制'\n};\n\nexport default locale;\n","const locale = {\n 'JsonView.label': 'JSON Viewer',\n 'JsonView.searchPlaceholder': 'Search...',\n 'JsonView.expand': 'Expand',\n 'JsonView.collapse': 'Collapse',\n 'JsonView.expandAll': 'Expand All',\n 'JsonView.collapseAll': 'Collapse All',\n 'JsonView.items': 'items',\n 'JsonView.keys': 'keys',\n 'JsonView.copy': 'Copy',\n 'JsonView.copied': 'Copied'\n};\n\nexport default locale;\n","export const getDataType = data => {\n if (data === null) return 'null';\n if (Array.isArray(data)) return 'array';\n return typeof data;\n};\n\n// 计算节点展开后的总行数\nexport const getNodeLineCount = data => {\n const type = getDataType(data);\n\n if (type !== 'array' && type !== 'object') {\n return 1;\n }\n\n if (type === 'array') {\n if (data.length === 0) return 1; // [] 算一行\n // 开括号 + 子节点行数之和 + 闭括号\n return 1 + data.reduce((sum, item) => sum + getNodeLineCount(item), 0) + 1;\n }\n\n if (type === 'object') {\n const keys = Object.keys(data);\n if (keys.length === 0) return 1; // {} 算一行\n // 开括号 + 子节点行数之和 + 闭括号\n return 1 + keys.reduce((sum, key) => sum + getNodeLineCount(data[key]), 0) + 1;\n }\n\n return 1;\n};\n\nexport const collectCollapsedKeys = (data, collapsedFrom, path = ['root'], depth = 0) => {\n const keys = new Set();\n const type = getDataType(data);\n\n if (type !== 'array' && type !== 'object') {\n return keys;\n }\n\n if (depth >= collapsedFrom) {\n keys.add(path.join('.'));\n }\n\n if (type === 'array') {\n data.forEach((item, index) => {\n const childKeys = collectCollapsedKeys(item, collapsedFrom, [...path, index], depth + 1);\n childKeys.forEach(key => keys.add(key));\n });\n } else if (type === 'object') {\n Object.entries(data).forEach(([keyName, value]) => {\n const childKeys = collectCollapsedKeys(value, collapsedFrom, [...path, keyName], depth + 1);\n childKeys.forEach(key => keys.add(key));\n });\n }\n\n return keys;\n};\n\nexport const collectAllData = (data, path = ['root']) => {\n const items = [];\n const type = getDataType(data);\n\n const pathStr = path.join('.');\n items.push({ path: pathStr, value: data, type });\n\n if (type === 'array') {\n data.forEach((item, index) => {\n items.push(...collectAllData(item, [...path, index]));\n });\n } else if (type === 'object' && data !== null) {\n Object.entries(data).forEach(([keyName, value]) => {\n items.push(...collectAllData(value, [...path, keyName]));\n });\n }\n\n return items;\n};\n\nexport const collectAllCollapsibleKeys = (data, path = ['root']) => {\n const keys = new Set();\n const type = getDataType(data);\n\n if (type !== 'array' && type !== 'object') {\n return keys;\n }\n\n const entries = type === 'array' ? data : Object.entries(data);\n if (type === 'array' && data.length === 0) return keys;\n if (type === 'object' && Object.keys(data).length === 0) return keys;\n\n keys.add(path.join('.'));\n\n if (type === 'array') {\n data.forEach((item, index) => {\n const childKeys = collectAllCollapsibleKeys(item, [...path, index]);\n childKeys.forEach(key => keys.add(key));\n });\n } else {\n Object.entries(data).forEach(([keyName, value]) => {\n const childKeys = collectAllCollapsibleKeys(value, [...path, keyName]);\n childKeys.forEach(key => keys.add(key));\n });\n }\n\n return keys;\n};\n\nexport const getMatchedPaths = (fuse, query) => {\n if (!query || !fuse) return new Set();\n\n const results = fuse.search(query);\n const matchedPaths = new Set();\n\n results.forEach(result => {\n const path = result.item.path;\n matchedPaths.add(path);\n const parts = path.split('.');\n for (let i = 1; i < parts.length; i++) {\n matchedPaths.add(parts.slice(0, i).join('.'));\n }\n });\n\n return matchedPaths;\n};\n","import style from '../style.module.scss';\n\nconst HighlightText = ({ text, highlight }) => {\n if (!highlight) {\n return <>{text}</>;\n }\n\n const regex = new RegExp(`(${highlight.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')})`, 'gi');\n const parts = text.split(regex);\n\n return (\n <>\n {parts.map((part, index) =>\n regex.test(part) ? (\n <span key={index} className={style.highlight}>\n {part}\n </span>\n ) : (\n <span key={index}>{part}</span>\n )\n )}\n </>\n );\n};\n\nexport default HighlightText;\n","import { useIntl } from '@kne/react-intl';\nimport { useCallback } from 'react';\nimport classNames from 'classnames';\nimport { getDataType, getNodeLineCount } from '../utils/helpers';\nimport HighlightText from './HighlightText';\nimport style from '../style.module.scss';\n\nconst JsonValue = ({ data, path, onToggle, collapsedKeys, highlight, matchedPaths, indentWidth, showComma }) => {\n const { formatMessage } = useIntl();\n const type = getDataType(data);\n const key = path.join('.');\n const isCollapsed = collapsedKeys.has(key);\n const isMatched = matchedPaths.has(key);\n\n const handleToggle = useCallback(() => {\n onToggle(key);\n }, [key, onToggle]);\n\n if (type === 'null') {\n return (\n <>\n <span className={classNames(style.null, { [style.matched]: isMatched })}>null</span>\n {showComma && <span className={style.comma}>,</span>}\n </>\n );\n }\n\n if (type === 'undefined') {\n return (\n <>\n <span className={classNames(style.null, { [style.matched]: isMatched })}>undefined</span>\n {showComma && <span className={style.comma}>,</span>}\n </>\n );\n }\n\n if (type === 'boolean') {\n return (\n <>\n <span className={classNames(style.boolean, { [style.matched]: isMatched })}>\n <HighlightText text={data ? 'true' : 'false'} highlight={highlight} />\n </span>\n {showComma && <span className={style.comma}>,</span>}\n </>\n );\n }\n\n if (type === 'number') {\n return (\n <>\n <span className={classNames(style.number, { [style.matched]: isMatched })}>\n <HighlightText text={String(data)} highlight={highlight} />\n </span>\n {showComma && <span className={style.comma}>,</span>}\n </>\n );\n }\n\n if (type === 'string') {\n return (\n <>\n <span className={classNames(style.string, { [style.matched]: isMatched })}>\n \"<HighlightText text={data} highlight={highlight} />\"\n </span>\n {showComma && <span className={style.comma}>,</span>}\n </>\n );\n }\n\n if (type === 'array' || type === 'object') {\n const entries = type === 'array' ? data.map((item, index) => [index, item]) : Object.entries(data);\n const isEmpty = entries.length === 0;\n const openBracket = type === 'array' ? '[' : '{';\n const closeBracket = type === 'array' ? ']' : '}';\n\n if (isEmpty) {\n return (\n <span className={style.bracket}>\n {openBracket}\n {closeBracket}\n </span>\n );\n }\n\n return (\n <span className={style.collapsible}>\n <span className={style['open-line']}>\n <span className={style.toggle} onClick={handleToggle}>\n <span className={classNames(style.arrow, { [style.expanded]: !isCollapsed })}>▶</span>\n <span className={style.bracket}>{openBracket}</span>\n </span>\n </span>\n {isCollapsed && (\n <span className={style.preview}>\n ...{entries.length} {formatMessage({ id: `JsonView.${type === 'array' ? 'items' : 'keys'}` })}\n </span>\n )}\n {isCollapsed && (\n <>\n <span className={style.bracket}>{closeBracket}</span>\n {showComma && <span className={style.comma}>,</span>}\n </>\n )}\n {!isCollapsed && (\n <>\n <span className={style.content} style={{ paddingLeft: `${indentWidth}px` }}>\n {entries.map(([keyName, value], index) => {\n const childPath = [...path, keyName];\n const childType = getDataType(value);\n const childKey = childPath.join('.');\n const isChildCollapsed = collapsedKeys.has(childKey);\n const childLineCount = childType === 'array' || childType === 'object' ? getNodeLineCount(value) : 1;\n const shouldSkipLines = isChildCollapsed && childLineCount > 1;\n\n return (\n <div key={keyName} className={style.line} style={shouldSkipLines ? { '--line-count': childLineCount } : undefined}>\n <span className={style.key}>{type === 'object' ? `\"${keyName}\"` : keyName}</span>\n <span className={style.colon}>:</span>\n <JsonValue data={value} path={childPath} onToggle={onToggle} collapsedKeys={collapsedKeys} highlight={highlight} matchedPaths={matchedPaths} indentWidth={indentWidth} showComma={index < entries.length - 1} />\n </div>\n );\n })}\n </span>\n <span className={style['close-line']}>\n <span className={style.bracket}>{closeBracket}</span>\n {showComma && <span className={style.comma}>,</span>}\n </span>\n </>\n )}\n </span>\n );\n }\n\n return <span>{String(data)}</span>;\n};\n\nexport default JsonValue;\n","import { useIntl } from '@kne/react-intl';\nimport { useState } from 'react';\nimport classNames from 'classnames';\nimport style from '../style.module.scss';\nimport { CopyIcon, CheckIcon, ExpandIcon, CollapseIcon } from '../icons';\n\nconst Toolbar = ({ searchQuery, onSearchChange, onToggleExpand, isAllExpanded, theme, searchable, collapsable, data }) => {\n const { formatMessage } = useIntl();\n const [copied, setCopied] = useState(false);\n\n const handleCopy = async () => {\n try {\n const jsonStr = JSON.stringify(data, null, 2);\n await navigator.clipboard.writeText(jsonStr);\n setCopied(true);\n setTimeout(() => setCopied(false), 2000);\n } catch (err) {\n console.error('Failed to copy:', err);\n }\n };\n\n return (\n <div className={classNames(style.toolbar, style[`theme-${theme}`], { [style['toolbar-right']]: !searchable && collapsable })}>\n {searchable && (\n <div className={style['search-wrapper']}>\n <input type=\"text\" value={searchQuery} onChange={e => onSearchChange(e.target.value)} placeholder={formatMessage({ id: 'JsonView.searchPlaceholder' })} className={style['search-input']} />\n {searchQuery && (\n <button className={style['clear-btn']} onClick={() => onSearchChange('')}>\n ×\n </button>\n )}\n </div>\n )}\n <div className={style['button-group']}>\n <button className={style['action-btn']} onClick={handleCopy} title={formatMessage({ id: copied ? 'JsonView.copied' : 'JsonView.copy' })}>\n {copied ? <CheckIcon /> : <CopyIcon />}\n </button>\n {collapsable && (\n <button className={style['action-btn']} onClick={onToggleExpand} title={formatMessage({ id: isAllExpanded ? 'JsonView.collapseAll' : 'JsonView.expandAll' })}>\n {isAllExpanded ? <CollapseIcon /> : <ExpandIcon />}\n </button>\n )}\n </div>\n </div>\n );\n};\n\nexport default Toolbar;\n","import { useIntl } from '@kne/react-intl';\nimport withLocale from './withLocale';\nimport { useState, useCallback, useMemo, useEffect } from 'react';\nimport classNames from 'classnames';\nimport Fuse from 'fuse.js';\nimport { collectCollapsedKeys, collectAllData, collectAllCollapsibleKeys, getMatchedPaths, getDataType, getNodeLineCount } from './utils/helpers';\nimport JsonValue from './components/JsonValue';\nimport Toolbar from './components/Toolbar';\nimport style from './style.module.scss';\n\nconst JsonView = withLocale(({ data, collapsedFrom = Infinity, theme = 'dark', searchable = true, collapsable = true, indentWidth = 20, showLineNumbers = true, className }) => {\n const [searchQuery, setSearchQuery] = useState('');\n\n const initialCollapsedKeys = useMemo(() => {\n if (data === undefined || collapsedFrom === Infinity) {\n return new Set();\n }\n return collectCollapsedKeys(data, collapsedFrom);\n }, [data, collapsedFrom]);\n\n const [collapsedKeys, setCollapsedKeys] = useState(initialCollapsedKeys);\n\n const allCollapsibleKeys = useMemo(() => {\n if (data === undefined) return new Set();\n return collectAllCollapsibleKeys(data);\n }, [data]);\n\n const allData = useMemo(() => {\n if (data === undefined) return [];\n return collectAllData(data);\n }, [data]);\n\n const fuse = useMemo(() => {\n return new Fuse(allData, {\n keys: ['value'],\n includeMatches: true,\n threshold: 0.3,\n ignoreLocation: true,\n minMatchCharLength: 1\n });\n }, [allData]);\n\n const matchedPaths = useMemo(() => {\n return getMatchedPaths(fuse, searchQuery);\n }, [fuse, searchQuery]);\n\n useEffect(() => {\n if (searchQuery && matchedPaths.size > 0) {\n setCollapsedKeys(prev => {\n const next = new Set(prev);\n matchedPaths.forEach(path => {\n if (next.has(path)) {\n next.delete(path);\n }\n });\n return next;\n });\n }\n }, [searchQuery, matchedPaths]);\n\n const handleToggle = useCallback(key => {\n setCollapsedKeys(prev => {\n const next = new Set(prev);\n if (next.has(key)) {\n next.delete(key);\n } else {\n next.add(key);\n }\n return next;\n });\n }, []);\n\n const handleExpandAll = useCallback(() => {\n setCollapsedKeys(new Set());\n }, []);\n\n const handleCollapseAll = useCallback(() => {\n setCollapsedKeys(new Set(allCollapsibleKeys));\n }, [allCollapsibleKeys]);\n\n // 判断是否全部展开\n const isAllExpanded = collapsedKeys.size === 0;\n\n // 计算完全展开后的总行数\n const totalLineCount = useMemo(() => {\n if (data === undefined) return 1;\n return getNodeLineCount(data);\n }, [data]);\n\n // 根节点收起时的行数\n const rootLineCount = useMemo(() => {\n const type = getDataType(data);\n if (type !== 'array' && type !== 'object') return 1;\n if (!collapsedKeys.has('root')) return 1; // 展开时正常处理\n return totalLineCount;\n }, [data, collapsedKeys, totalLineCount]);\n\n // 计算行号区域宽度 (等宽字体 12px 约 7.2px/字符,最小 32px,右侧加 12px 边距)\n const lineNumberWidth = useMemo(() => {\n const digits = String(totalLineCount).length;\n return Math.max(32, Math.ceil(digits * 7.5 + 12));\n }, [totalLineCount]);\n\n // 切换展开/收起\n const handleToggleExpand = useCallback(() => {\n if (isAllExpanded) {\n handleCollapseAll();\n } else {\n handleExpandAll();\n }\n }, [isAllExpanded, handleExpandAll, handleCollapseAll]);\n\n if (data === undefined) {\n return (\n <div className={classNames(style.container, style[`theme-${theme}`], className)}>\n <span className={style.null}>undefined</span>\n </div>\n );\n }\n\n return (\n <div className={classNames(style.wrapper, style[`theme-${theme}`], className)}>\n {(searchable || collapsable) && (\n <Toolbar searchQuery={searchQuery} onSearchChange={setSearchQuery} onToggleExpand={handleToggleExpand} isAllExpanded={isAllExpanded} theme={theme} searchable={searchable} collapsable={collapsable} data={data} />\n )}\n <div className={classNames(style.container, { [style['show-line-numbers']]: showLineNumbers })} style={showLineNumbers ? { '--line-number-width': `${lineNumberWidth}px` } : undefined}>\n <div className={style.line} style={rootLineCount > 1 ? { '--line-count': rootLineCount } : undefined}>\n <JsonValue data={data} path={['root']} onToggle={handleToggle} collapsedKeys={collapsedKeys} highlight={searchQuery} matchedPaths={matchedPaths} indentWidth={indentWidth} />\n </div>\n </div>\n </div>\n );\n});\n\nexport default JsonView;\n","/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames () {\n\t\tvar classes = '';\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (arg) {\n\t\t\t\tclasses = appendClass(classes, parseValue(arg));\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction parseValue (arg) {\n\t\tif (typeof arg === 'string' || typeof arg === 'number') {\n\t\t\treturn arg;\n\t\t}\n\n\t\tif (typeof arg !== 'object') {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (Array.isArray(arg)) {\n\t\t\treturn classNames.apply(null, arg);\n\t\t}\n\n\t\tif (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n\t\t\treturn arg.toString();\n\t\t}\n\n\t\tvar classes = '';\n\n\t\tfor (var key in arg) {\n\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\tclasses = appendClass(classes, key);\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction appendClass (value, newClass) {\n\t\tif (!newClass) {\n\t\t\treturn value;\n\t\t}\n\t\n\t\tif (value) {\n\t\t\treturn value + ' ' + newClass;\n\t\t}\n\t\n\t\treturn value + newClass;\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n"],"names":["isArray","value","Array","getTag","isString","isNumber","isBoolean","isObject","isObjectLike","isDefined","undefined","isBlank","trim","length","Object","prototype","toString","call","hasOwn","hasOwnProperty","KeyStore","constructor","keys","this","_keys","_keyMap","totalWeight","forEach","key","obj","createKey","push","id","weight","get","keyId","toJSON","JSON","stringify","path","src","getFn","createKeyPath","createKeyId","Error","name","MISSING_KEY_PROPERTY","INVALID_KEY_WEIGHT_VALUE","split","join","Config","isCaseSensitive","ignoreDiacritics","includeScore","shouldSort","sortFn","a","b","score","idx","includeMatches","findAllMatches","minMatchCharLength","location","threshold","distance","useExtendedSearch","list","arr","deepGet","index","result","baseToString","i","len","ignoreLocation","ignoreFieldNorm","fieldNormWeight","SPACE","FuseIndex","arguments","norm","mantissa","cache","Map","m","Math","pow","numTokens","match","has","n","parseFloat","round","set","clear","isCreated","setIndexRecords","setSources","docs","records","setKeys","_keysMap","create","doc","docIndex","_addString","_addObject","add","size","removeAt","splice","getValueForItemAtKeyId","item","record","v","$","keyIndex","subRecords","stack","nestedArrIndex","pop","subRecord","k","createIndex","myIndex","map","computeScore$1","pattern","errors","currentLocation","expectedLocation","accuracy","proximity","abs","MAX_BITS","search","text","patternAlphabet","patternLen","textLen","max","min","currentThreshold","bestLocation","computeMatches","matchMask","indexOf","lastBitArr","finalScore","binMax","mask","binMin","binMid","floor","start","finish","bitArr","j","charMatch","charAt","isMatch","indices","matchmask","end","convertMaskToIndices","createPatternAlphabet","char","stripDiacritics","String","normalize","str","replace","BitapSearch","options","toLowerCase","chunks","addChunk","startIndex","alphabet","remainder","substr","searchIn","allIndices","totalScore","hasMatches","_ref","BaseMatch","isMultiMatch","getMatch","multiRegex","isSingleMatch","singleRegex","exp","matches","FuzzyMatch","super","_bitapSearch","type","IncludeMatch","searchers","startsWith","endsWith","searchersLen","SPACE_RE","MultiMatchSet","Set","ExtendedSearch","query","filter","results","queryItem","found","searcher","token","parseQuery","condition","_","numMatches","qLen","pLen","registeredSearchers","createSearcher","searcherClass","LogicalOperator","KeyType","isExpression","convertToExplicit","parse","auto","next","isQueryPath","isPath","isLeaf","LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY","node","children","operator","transformMatches","data","refIndex","transformScore","Fuse","_keyStore","setCollection","_docs","_myIndex","remove","predicate","getIndex","limit","_searchStringList","_searchObjectList","_searchLogical","_ref2","_ref3","Number","EPSILON","computeScore","sort","slice","transformers","transformer","format","_ref4","expression","evaluate","_findMatches","res","child","resultMap","_ref5","expResults","_ref6","_ref7","_ref8","_ref9","version","parseIndex","config","register","_rect","_path","_extends","assign","bind","e","t","r","apply","SvgCopydrOLfxzP","svgRef","title","titleId","props","width","height","viewBox","fill","stroke","strokeWidth","strokeLinecap","strokeLinejoin","ref","x","y","rx","ry","d","ForwardRef","_polyline","SvgCheckelxgVvVe","points","_polyline2","_line","_line2","SvgExpandblSbUwvt","x1","y1","x2","y2","SvgCollapsevphRLfPi","withLocale","createWithIntlProvider","defaultLocale","messages","namespace","getDataType","getNodeLineCount","reduce","sum","collectCollapsedKeys","collapsedFrom","depth","entries","keyName","collectAllData","items","pathStr","collectAllCollapsibleKeys","HighlightText","highlight","jsx","Fragment","regex","RegExp","parts","part","test","className","style","JsonValue","onToggle","collapsedKeys","matchedPaths","indentWidth","showComma","formatMessage","useIntl","isCollapsed","isMatched","handleToggle","useCallback","jsxs","classNames","null","matched","comma","boolean","number","string","isEmpty","openBracket","closeBracket","bracket","collapsible","toggle","onClick","arrow","expanded","preview","content","paddingLeft","childPath","childType","childKey","isChildCollapsed","childLineCount","shouldSkipLines","line","colon","Toolbar","searchQuery","onSearchChange","onToggleExpand","isAllExpanded","theme","searchable","collapsable","copied","setCopied","useState","toolbar","onChange","target","placeholder","async","jsonStr","navigator","clipboard","writeText","setTimeout","err","console","error","ReactComponent","ReactComponent$1","ReactComponent$2","ReactComponent$3","JsonView","_collapsedFrom","Infinity","_theme","_searchable","_collapsable","_indentWidth","showLineNumbers","_showLineNumbers","setSearchQuery","initialCollapsedKeys","useMemo","setCollapsedKeys","allCollapsibleKeys","allData","fuse","getMatchedPaths","useEffect","prev","delete","handleExpandAll","handleCollapseAll","totalLineCount","rootLineCount","lineNumberWidth","digits","ceil","handleToggleExpand","container","wrapper","classes","arg","appendClass","parseValue","includes","newClass","module","exports","default"],"sourceRoot":""}