@sheetxl/studio-mui 0.2.6 → 0.3.1

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 (193) hide show
  1. package/LICENSE.md +11 -11
  2. package/README.md +24 -24
  3. package/browser/cjs/1YEg8ptbpW_zo0_c.cjs +12 -0
  4. package/browser/cjs/{DcfFE-9fEUZBZGYb.cjs → 3mnCV1wkKu4YCs7n.cjs} +1 -1
  5. package/browser/cjs/{q-dzAmj40gPkjihq.cjs → B1CCk3o0Nv4mJ1Ff.cjs} +2 -2
  6. package/browser/cjs/{DumPMC-rnRHr8-wv.cjs → B1WSHW4lt2L5wJO3.cjs} +3 -3
  7. package/browser/cjs/{BCCAhtAp38W0aA2_.cjs → B6QgPFUbEVsL1O-L.cjs} +1 -12
  8. package/browser/cjs/B79CHYVWaVXMRmoE.cjs +6 -0
  9. package/browser/cjs/{BKJ9ra0EXRoTjhrm.cjs → BEt_uFICH24FzpOe.cjs} +2 -2
  10. package/browser/cjs/BEzNZIQy5IlW0iAl.cjs +238 -0
  11. package/browser/cjs/{A-kIxFkabK3vI1sL.cjs → BHq8j-aNWkuYkURM.cjs} +1 -1
  12. package/browser/cjs/{CcohrNf7jKsQZIFn.cjs → BKo9DTgY_3d6nE0E.cjs} +1 -1
  13. package/browser/cjs/{Bc-jz0R0rXytSMXu.cjs → BNA6r4S5nm_CzUm6.cjs} +1 -1
  14. package/browser/cjs/BNpz92-BEgkxWvh6.cjs +11 -0
  15. package/browser/cjs/{D0oKia0Q4Z-VEt4y.cjs → BQeCI5I748X8pDto.cjs} +1 -1
  16. package/browser/cjs/BR4KYl8frdYrZXhN.cjs +13 -0
  17. package/browser/cjs/{CcaZ_MaUUJtP2kPz.cjs → BSnfy-ivJTWdlK3A.cjs} +2 -2
  18. package/browser/cjs/{CjG3a4ASN8Bh9Mns.cjs → BVB95JnDB-sUQttP.cjs} +1 -1
  19. package/browser/cjs/{BTMsbaHkNYURVq3q.cjs → BbzI8ABw0DHCij-A.cjs} +1 -1
  20. package/browser/cjs/{BqTkfjWtPFreuEyX.cjs → BcQkD2UP3Iqsf8Fi.cjs} +2 -46
  21. package/browser/cjs/{DEn58fOngaOuXk87.cjs → BdV3cCQa36ZCkL4H.cjs} +1 -1
  22. package/browser/cjs/{DFCZhJ1yoWYbIHX4.cjs → Bh2zzNItZd-6FD_Z.cjs} +2 -2
  23. package/browser/cjs/{CARphvDrvgNZSvpL.cjs → By_cIz-TMire5bw7.cjs} +9 -24
  24. package/browser/cjs/C-_njVetl9K8CJri.cjs +15 -0
  25. package/browser/cjs/{Bd5PAp2WEspFHuBM.cjs → C5yXi0ZLdk8cegEV.cjs} +4 -4
  26. package/browser/cjs/{3VmRVOqC0V5eOt6T.cjs → CD9-AAL5QOuUXpGa.cjs} +2 -2
  27. package/browser/cjs/{BgchUdZIMhzjZD7g.cjs → CFyRrZrtTj0szEBJ.cjs} +20 -25
  28. package/browser/cjs/{B56-Gd1i2lJ8BRJd.cjs → CFz-gPnOVecGhXAQ.cjs} +1 -1
  29. package/browser/cjs/{BAusl_QfcY1JMqpp.cjs → CIDji1QOkywtvqEU.cjs} +1 -1
  30. package/browser/cjs/{e-DDwce0TpQ_TexX.cjs → CMZ7PzY_xBaB01Wa.cjs} +1 -1
  31. package/browser/cjs/{D5-ucaPYR4lDqsZ9.cjs → CP8909XpM31di_I4.cjs} +1 -1
  32. package/browser/cjs/CS3l6TIh0gU3sA2R.cjs +6 -0
  33. package/browser/cjs/{BPOJmxDK9_nXZLH8.cjs → Cb7Ywgxnsg32GtZC.cjs} +4 -19
  34. package/browser/cjs/{BZa96NNYHjAfkSan.cjs → CdlodVmE_U6kq13A.cjs} +2 -2
  35. package/browser/cjs/{_S68RY90vM_e1zsj.cjs → ChDhTJyaQVGQ_AAW.cjs} +2 -7
  36. package/browser/cjs/{BUjDHTRE5EkpxE-5.cjs → CoAUFW3rE-ZU04sj.cjs} +1 -1
  37. package/browser/cjs/{DqCUzFDdqqzMG3IA.cjs → CoGNjOqAsq3v4dNU.cjs} +1 -1
  38. package/browser/cjs/{Cht-fwncVGDrV-dV.cjs → CqwNicmb3Ve75UKg.cjs} +1 -1
  39. package/browser/cjs/CsjmqYMv0yUjJuEa.cjs +7 -0
  40. package/browser/cjs/{sMBUSvkfszgn5xpU.cjs → CthhJsNSsNw003nz.cjs} +1 -1
  41. package/browser/cjs/{D0tkUlc6HiUeWXHb.cjs → CtuayTMsg15Ek7N2.cjs} +1 -1
  42. package/browser/cjs/{ChbycWu8n4KJ9P_8.cjs → D0KbXmifGL9COnTn.cjs} +2 -2
  43. package/browser/cjs/{DHj1XMth0CI-rsF3.cjs → D1z2rxTd4juxWblf.cjs} +1 -1
  44. package/browser/cjs/D4zF1Hhc3mBlNNoX.cjs +6 -0
  45. package/browser/cjs/{cthkM4mww6TbaE2K.cjs → D8eS_vce5B9menV5.cjs} +2 -2
  46. package/browser/cjs/{B7qpzVnF4F9SYhxC.cjs → DVU4idIDTTz9Pu5P.cjs} +1 -1
  47. package/browser/cjs/DW9WwmeG2vVMGbYU.cjs +15 -0
  48. package/browser/cjs/{CmtIrxDwWvlPHJUs.cjs → DrJyN_0T5kyWuuIh.cjs} +1 -1
  49. package/browser/cjs/{CtfhnekVduodhLIA.cjs → DxACtr3WZnBFuXpu.cjs} +2 -2
  50. package/browser/cjs/{PY2QyFSYSg7sBTA7.cjs → K4bhbGLflu3pYFHS.cjs} +3 -8
  51. package/browser/cjs/{BjCKeHVvA1xjpUzr.cjs → PdwwTxM_DHCgQrxv.cjs} +2 -2
  52. package/browser/cjs/Q-_8LHrKWcpj3r7F.cjs +6 -0
  53. package/browser/cjs/{DbMXeK1wVS3pxKYM.cjs → RrCz-1Q4Q9suB7j_.cjs} +1 -1
  54. package/browser/cjs/index.cjs +3 -3
  55. package/browser/cjs/{CghPaqu-wj2wQhzE.cjs → kB-8OyiedI6iKdlv.cjs} +1 -1
  56. package/browser/cjs/{cACgBWYD93-PUTiy.cjs → nKP8-E-UOOscXlg2.cjs} +1 -1
  57. package/browser/cjs/{Coa67FdOXG2DCroa.cjs → nMYwRU0M-HXpWQ6C.cjs} +1 -1
  58. package/browser/cjs/q0y6NDefblRQrS_O.cjs +6 -0
  59. package/browser/cjs/{DrMsDMUSrXxdqj0B.cjs → qvN5BhYwdxsmB52p.cjs} +1 -1
  60. package/browser/cjs/{6FbSQA1Rt7lJ6lKo.cjs → tavAzhljteQQ_ct2.cjs} +1 -1
  61. package/browser/esm/{CyjmSNFuJLe4C6GU.mjs → 0lX_9VGN9S6inxKd.mjs} +1 -13
  62. package/browser/esm/{Bpxy50wvXdJKyLXv.mjs → 18HMxDJcGi3erlU-.mjs} +28 -28
  63. package/browser/esm/{RQov8ayqdzOoQpX-.mjs → AZqmGzpPMrJbgV2W.mjs} +1 -7
  64. package/browser/esm/{ClSRwCaGmF-ZAeHf.mjs → B3EG6jjfR2LEnrAU.mjs} +2 -8
  65. package/{node/esm/BpyV-yDD7Q1yf4Xl.mjs → browser/esm/B64E2zQmL6hLVfZj.mjs} +1 -7
  66. package/browser/esm/{C-YZuTBEk1H4qRZw.mjs → B6ELdf71jSY39vY1.mjs} +1 -1
  67. package/browser/esm/{nvGwSrvzuLol9r3q.mjs → B7scZi_VczEUXidh.mjs} +1 -7
  68. package/browser/esm/{s5RrSnHWfpUhw_f7.mjs → BDch4FvLXEr0f6ZQ.mjs} +2 -2
  69. package/browser/esm/{B8fcDd71qlYgsjQE.mjs → BGEuFRd7CprH18Ux.mjs} +1 -7
  70. package/browser/esm/{DKaf3tT7wwZpsjGx.mjs → BHTWupqElPJQagv4.mjs} +1 -7
  71. package/{node/esm/CKDzJBremVM6A2BK.mjs → browser/esm/BOL63BcaR86vXxt8.mjs} +1 -7
  72. package/browser/esm/{BA3viQkVygVJk5u3.mjs → BPZsd5vtzGJ4PtJr.mjs} +4 -22
  73. package/browser/esm/{CopRY0jQqxFp_FgA.mjs → B_eHwwd9-PXWYLMA.mjs} +1 -7
  74. package/browser/esm/{9I55e62spuTYG4ZW.mjs → BbloSfJTNz8-g7pa.mjs} +4 -4
  75. package/browser/esm/{CJfLrSecdinnFnTp.mjs → BhfMnNKVTfBV03lK.mjs} +3 -9
  76. package/browser/esm/{BQOI_VqILP8DPGHW.mjs → BkY6jPvgDNSHVjm1.mjs} +6 -6
  77. package/browser/esm/{BLvCbBnh1u-PCvQU.mjs → BmOgysv2Oa-vQXE0.mjs} +2 -2
  78. package/browser/esm/{C48RP2m6OEU-0HbW.mjs → BpTfL8wDDLWCFbUW.mjs} +1 -7
  79. package/browser/esm/{Dl5vdu8CswaKdxX-.mjs → Bsirmjdfj8W9sVx5.mjs} +2 -2
  80. package/browser/esm/{CULFfZBvgvDiBJdO.mjs → BslEgsLB-o1nc3NJ.mjs} +1 -7
  81. package/browser/esm/{BQXesHmVIi0Ciqyk.mjs → BvJx_QZ4eKWrufFK.mjs} +9167 -9247
  82. package/{node/esm/DKGH-lIiU-RC6Fhl.mjs → browser/esm/Bwbk5CiNsPh4oG-e.mjs} +1 -7
  83. package/browser/esm/{BOv89COIpbKdAknV.mjs → C-I7rCun0hGkuQ6J.mjs} +1 -7
  84. package/{node/esm/BC7Dh7hbqqpNE_R_.mjs → browser/esm/CF7ede_gzDlyTqfP.mjs} +1 -7
  85. package/browser/esm/{BbpexLwHskV3-WlQ.mjs → CXVZIbnDZdhdPDsS.mjs} +2 -2
  86. package/browser/esm/{kIL1Gxa0JjHFYofa.mjs → CcSG0PBy9Xc99VMv.mjs} +1 -7
  87. package/browser/esm/{2JTr5xr3HqzaYVss.mjs → CcSdpe6QFrIBEfxa.mjs} +1 -7
  88. package/browser/esm/{Byu18onYK7Tci1M0.mjs → CdCJMJxXOSz6lxOy.mjs} +1 -7
  89. package/browser/esm/CjHkOkuQRYMpUxe5.mjs +21 -0
  90. package/browser/esm/{BpLnvCI8Rec_NRFL.mjs → Cldrd9EWLvrv7OmM.mjs} +3 -21
  91. package/{node/esm/Dt1cY4iiw-zMuj1J.mjs → browser/esm/CnEgkW6Z3qXNMA3o.mjs} +1 -7
  92. package/browser/esm/{lzzOY1Hvt3MEkWR9.mjs → DKyHs94FV1bG9frs.mjs} +1 -7
  93. package/browser/esm/{BOhnmZGY65-Wuhpv.mjs → DSy9HoHQkEeO33eC.mjs} +1 -7
  94. package/browser/esm/{DOO9dsv93EJCLjyA.mjs → DTuQMORnquJOYPd_.mjs} +2 -2
  95. package/browser/esm/DYfYa5shdr1OHSo9.mjs +24 -0
  96. package/browser/esm/{D6QupBl_xr9yYAwS.mjs → DbaMa7xh1JERqjfu.mjs} +1 -7
  97. package/{node/esm/By92Bb_J4Ytgmbzs.mjs → browser/esm/DdvoohT27nSi_3cd.mjs} +1 -7
  98. package/browser/esm/{CLJx7XpjMSv3Fb8S.mjs → DfomV5Es6zAn4RZi.mjs} +96 -102
  99. package/browser/esm/{D7QRtksLLOBLdAO0.mjs → Dr9yLItWEDzTQl2s.mjs} +2 -2
  100. package/{node/esm/Ccm70JSlV0fhlDB3.mjs → browser/esm/DskzH7zTkxNR4kmu.mjs} +1 -7
  101. package/browser/esm/{BzNcfQCKkfMt8dWK.mjs → DyJFrpwrf2hOoMB8.mjs} +1 -7
  102. package/browser/esm/{mcUlQGlsbPzzuiho.mjs → E57nRNXAFyQlfQcA.mjs} +4 -10
  103. package/browser/esm/{Cl7QJRrhftlzkhqs.mjs → LyNZuqChCFhEwsot.mjs} +1 -7
  104. package/browser/esm/{BDrcicchSYx4eM0s.mjs → OA194vapZVgAyYfI.mjs} +1 -7
  105. package/browser/esm/{BBRYZwY3yNfYBw4S.mjs → OAJjLDFVSai0yCAH.mjs} +2 -14
  106. package/browser/esm/{BRQ0QBfS9LsSiOyz.mjs → YWavBpnhyEFk5GMG.mjs} +8 -25
  107. package/browser/esm/{fs-asavS_s3NTcba.mjs → aApOir3D3mXBHnvi.mjs} +12 -10
  108. package/browser/esm/{Cd_u7MoOV_ZyXJzX.mjs → bKlq3J1NJoYG9nEK.mjs} +7 -71
  109. package/browser/esm/{DL6wIGG4hYcCtEEM.mjs → i5M3BzX6_TbbFlH5.mjs} +1 -9
  110. package/browser/esm/index.mjs +10 -10
  111. package/browser/esm/{EtvIZwUdXJxvXl1f.mjs → j8ncnjiLyFIkRpRY.mjs} +37 -57
  112. package/browser/esm/{DmlZKqVxIPtD63ni.mjs → oISMsYlGCPZ7-0lX.mjs} +2 -8
  113. package/browser/esm/{Cy03aAlPY6mm61hO.mjs → oPlD2dUf3YmsFkON.mjs} +2 -14
  114. package/browser/esm/{T3P52FxGXCNTD0Ta.mjs → orOLzbRzqosIA5-M.mjs} +1 -7
  115. package/browser/esm/{BMTrlbulVxBjrzie.mjs → sBOX_jXfdNOE_89x.mjs} +134 -134
  116. package/{node/esm/Cb3vZp2l3WvXVMoL.mjs → browser/esm/siOdsSC0nSzvcV6e.mjs} +1 -7
  117. package/browser/esm/{DMXzIgGwC69G4F64.mjs → v7U7eI9QzTNkm3Bw.mjs} +2 -2
  118. package/browser/esm/{008089VkqY1UzPRf.mjs → xLRSe1qHuVdyTRam.mjs} +1 -14
  119. package/licenses/dependencies.txt +77 -77
  120. package/node/assets/style.css +1 -1
  121. package/node/esm/{DnwH6EIA8MEba58K.mjs → 2LRTxgV_lBAeZ-P_.mjs} +3 -9
  122. package/node/esm/{RQov8ayqdzOoQpX-.mjs → AZqmGzpPMrJbgV2W.mjs} +1 -7
  123. package/node/esm/{BE7hdyaid4Bw3ui4.mjs → B200JUCQCqtoXtze.mjs} +11 -29
  124. package/node/esm/{Inau3Pc873w_RGko.mjs → B4FapexYISkwv2PP.mjs} +1 -7
  125. package/{browser/esm/BpyV-yDD7Q1yf4Xl.mjs → node/esm/B64E2zQmL6hLVfZj.mjs} +1 -7
  126. package/node/esm/{C4lYM3UlxwrQKADA.mjs → B6wRJIobYG51nE8k.mjs} +1 -1
  127. package/node/esm/{BRrMn7hPXzif2G6O.mjs → BD9x8fkvhcvJ7xjU.mjs} +1 -8
  128. package/node/esm/{B8fcDd71qlYgsjQE.mjs → BGEuFRd7CprH18Ux.mjs} +1 -7
  129. package/node/esm/{DcVSy-k9TDLo0gol.mjs → BI5BlWbeESiI0CbN.mjs} +4 -10
  130. package/node/esm/{D61p-3Q8B1RX5mQr.mjs → BLdoPiUZ3PSw_Jx4.mjs} +2 -2
  131. package/{browser/esm/CKDzJBremVM6A2BK.mjs → node/esm/BOL63BcaR86vXxt8.mjs} +1 -7
  132. package/node/esm/{CrOzSKDJNW87Aq_H.mjs → BV8QMkxYffe5YuKF.mjs} +8 -8
  133. package/node/esm/{DAAzlKHi7HFpUsB_.mjs → BXtDB7WZJlFEKr8M.mjs} +1 -3
  134. package/node/esm/{SSc-k3S20cX9Eb-W.mjs → BkyuOVy2KETQMFCO.mjs} +1 -7
  135. package/node/esm/{C48RP2m6OEU-0HbW.mjs → BpTfL8wDDLWCFbUW.mjs} +1 -7
  136. package/node/esm/{D7xOVobPr2VJF5P_.mjs → BqgsCpsX8xl4a-gQ.mjs} +1 -7
  137. package/node/esm/{CgkvDf6SYHSFyDWa.mjs → Bqi23kQTBoGLm5F8.mjs} +7 -71
  138. package/{browser/esm/DKGH-lIiU-RC6Fhl.mjs → node/esm/Bwbk5CiNsPh4oG-e.mjs} +1 -7
  139. package/node/esm/{izxVY7wx0Kslljlx.mjs → Bzn7iPRWVFns38as.mjs} +1 -7
  140. package/node/esm/{BA6PG-5hzYtPR40k.mjs → C5AyRET8yEW8AHCx.mjs} +6 -26
  141. package/{browser/esm/BC7Dh7hbqqpNE_R_.mjs → node/esm/CF7ede_gzDlyTqfP.mjs} +1 -7
  142. package/node/esm/{Dw5FxHNESE8YKV64.mjs → CHa8zqxxqN37UAbT.mjs} +1 -7
  143. package/node/esm/{DngX8PCQe42AuyJC.mjs → CJZtnupg7aYCcfKR.mjs} +2 -2
  144. package/node/esm/CaTPeRd3yej1D44o.mjs +80 -0
  145. package/node/esm/{kIL1Gxa0JjHFYofa.mjs → CcSG0PBy9Xc99VMv.mjs} +1 -7
  146. package/node/esm/{2JTr5xr3HqzaYVss.mjs → CcSdpe6QFrIBEfxa.mjs} +1 -7
  147. package/{browser/esm/Dt1cY4iiw-zMuj1J.mjs → node/esm/CnEgkW6Z3qXNMA3o.mjs} +1 -7
  148. package/node/esm/{DlXOFRa93fhpjG-m.mjs → CsyP8mzSIyH_j_gx.mjs} +2 -14
  149. package/node/esm/CtwI3UxESNeLVKz4.mjs +14 -0
  150. package/node/esm/{6dnP0LDTVUbsEi8D.mjs → Cz3i5M3BNm_sU7VM.mjs} +1 -7
  151. package/node/esm/D0I-t4XarGx9tL2X.mjs +16 -0
  152. package/node/esm/{CLly5-f4m1j1zudv.mjs → D9FIPE6c82obo0bd.mjs} +1 -7
  153. package/node/esm/{Ykc4N6XMztkXC03p.mjs → DCnTdfW-zrlDozHu.mjs} +1 -1
  154. package/node/esm/{BBWJER8qZpvaPjl8.mjs → DDMv9FFsdYN-wjV1.mjs} +4 -22
  155. package/node/esm/{OnXbuckULN_uTYk_.mjs → DMYhiPgHOvCK0e6G.mjs} +1 -7
  156. package/node/esm/{21rqbpsAfJiOpkQ2.mjs → DSRKBM2nh9iYul8L.mjs} +1 -7
  157. package/node/esm/{BOhnmZGY65-Wuhpv.mjs → DSy9HoHQkEeO33eC.mjs} +1 -7
  158. package/node/esm/{B8bp6LG5l5P3vr6v.mjs → DToXdyBIJDYd1rr4.mjs} +38 -38
  159. package/{browser/esm/By92Bb_J4Ytgmbzs.mjs → node/esm/DdvoohT27nSi_3cd.mjs} +1 -7
  160. package/node/esm/{Bx4S7lVflo23fezQ.mjs → Dht5yjzp4Y9-leiH.mjs} +5 -5
  161. package/node/esm/{DJg3-jma4liVkIke.mjs → DqyrRbgk1-rYiye4.mjs} +12 -10
  162. package/{browser/esm/Ccm70JSlV0fhlDB3.mjs → node/esm/DskzH7zTkxNR4kmu.mjs} +1 -7
  163. package/node/esm/{dszswUwDk6xiVPKQ.mjs → IoNOHrmO_TsKnDiU.mjs} +13 -13
  164. package/node/esm/{D9W7LRX78B_wOf4G.mjs → KDwQLyg7m49Cqgq7.mjs} +1 -1
  165. package/node/esm/{Cl7QJRrhftlzkhqs.mjs → LyNZuqChCFhEwsot.mjs} +1 -7
  166. package/node/esm/{Do9djLsMipyoIsuo.mjs → MIFyb4jWS5pgkDzZ.mjs} +1 -7
  167. package/node/esm/{B089fKTCoJ4ltdgf.mjs → Q7QGn0xIiDXbz-EN.mjs} +1 -1
  168. package/node/esm/{DcQaGzeq19KwMhC6.mjs → Roo316g8NJiFWbdh.mjs} +2 -8
  169. package/node/esm/{DODDu6rlCzLntY1I.mjs → W7ETXZ0lNEjio8UF.mjs} +1 -1
  170. package/node/esm/{FSY5o2jwUa-lbt-6.mjs → a5F0VHG5l1_KNuMk.mjs} +2 -2
  171. package/node/esm/{D5mzoVB3O_KSA1oK.mjs → egkfJ6xKy_CP5Yv6.mjs} +2 -2
  172. package/node/esm/index.mjs +20168 -20203
  173. package/node/esm/{gonzEGWDV9bvHTN6.mjs → j5PgCeWLt7VlfOPK.mjs} +7 -7
  174. package/node/esm/{T3P52FxGXCNTD0Ta.mjs → orOLzbRzqosIA5-M.mjs} +1 -7
  175. package/{browser/esm/Cb3vZp2l3WvXVMoL.mjs → node/esm/siOdsSC0nSzvcV6e.mjs} +1 -7
  176. package/package.json +8 -8
  177. package/browser/cjs/B53yJDhFGzBrJKct.cjs +0 -28
  178. package/browser/cjs/BN2S8VBhkkrjADDL.cjs +0 -6
  179. package/browser/cjs/BiNUwPaqU7ZzDunu.cjs +0 -28
  180. package/browser/cjs/BmAmjiguOzBNHAM1.cjs +0 -16
  181. package/browser/cjs/Bqrb5qV8GvT9RYs8.cjs +0 -11
  182. package/browser/cjs/Bxz5WZLYKDxHOy8K.cjs +0 -17
  183. package/browser/cjs/CAaRveNYGc5NY2_v.cjs +0 -25
  184. package/browser/cjs/CrhLl6UDX2kwPnOI.cjs +0 -20
  185. package/browser/cjs/D4_odzIQHnpzsdH9.cjs +0 -12
  186. package/browser/cjs/DHphrv6zNxEz8u2X.cjs +0 -11
  187. package/browser/cjs/DQrfhqvZNAC1CLSW.cjs +0 -314
  188. package/browser/cjs/DzP_k-VBWZZZZ0jz.cjs +0 -16
  189. package/browser/esm/B66bNZdYFJ9iiqmZ.mjs +0 -34
  190. package/browser/esm/D4So2WMowD70kXxw.mjs +0 -36
  191. package/node/esm/B4H9qitY11LeDYmY.mjs +0 -28
  192. package/node/esm/DsmTBSyQ3wIgMDQ6.mjs +0 -26
  193. package/node/esm/noG0ULmWnxsE9HiI.mjs +0 -92
@@ -1,12 +1,6 @@
1
- import { L as Gs, Y as D, F as ft, f as Ye, p as Ks, D as Xt, q as jn, a as zs, s as Vs, V as Xe, x as Hs, J as se, b as Ue, m as Fe } from "./BQXesHmVIi0Ciqyk.mjs";
1
+ import { z as Gs, Y as D, F as ft, _ as Ye, S as zs, D as Xt, X as jn, c as Ks, s as Vs, G as Xe, A as Hs, a as se, q as Ue, m as Fe } from "./BvJx_QZ4eKWrufFK.mjs";
2
2
  /**
3
- * @license @sheetxl/studio-mui - Studio - Spreadsheet UI built with SheetXL SDK using React & MUI. - v0.2.6
4
- *
5
- * (C) 2025-present SheetXL Inc. & Michael T. Ford
6
- * License: The license can be found at https://www.sheetxl.com/license.
7
- */
8
- /**
9
- * @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.2.6
3
+ * @license @sheetxl/studio-mui - Studio - Spreadsheet UI built with SheetXL SDK using React & MUI. - v0.3.1
10
4
  *
11
5
  * (C) 2025-present SheetXL Inc. & Michael T. Ford
12
6
  * License: The license can be found at https://www.sheetxl.com/license.
@@ -161,13 +155,13 @@ function Ln(t, e) {
161
155
  function jr(t, e, n) {
162
156
  e == "__proto__" && pn ? pn(t, e, { configurable: !0, enumerable: !0, value: n, writable: !0 }) : t[e] = n;
163
157
  }
164
- function ze(t, e) {
158
+ function Ke(t, e) {
165
159
  return t === e || t != t && e != e;
166
160
  }
167
161
  var Aa = Object.prototype.hasOwnProperty;
168
162
  function xn(t, e, n) {
169
163
  var r = t[e];
170
- Aa.call(t, e) && ze(r, n) && (n !== void 0 || e in t) || jr(t, e, n);
164
+ Aa.call(t, e) && Ke(r, n) && (n !== void 0 || e in t) || jr(t, e, n);
171
165
  }
172
166
  function Er(t, e, n, r) {
173
167
  var i = !n;
@@ -209,7 +203,7 @@ function Mt(t) {
209
203
  function Go(t, e, n) {
210
204
  if (!Nt(n)) return !1;
211
205
  var r = typeof e;
212
- return !!(r == "number" ? Mt(n) && Ln(e, n.length) : r == "string" && e in n) && ze(n[e], t);
206
+ return !!(r == "number" ? Mt(n) && Ln(e, n.length) : r == "string" && e in n) && Ke(n[e], t);
213
207
  }
214
208
  var Ia = Object.prototype;
215
209
  function Ve(t) {
@@ -219,26 +213,26 @@ function Ve(t) {
219
213
  function ai(t) {
220
214
  return Ot(t) && Jt(t) == "[object Arguments]";
221
215
  }
222
- var Ko = Object.prototype, Na = Ko.hasOwnProperty, ya = Ko.propertyIsEnumerable, Cn = ai(/* @__PURE__ */ function() {
216
+ var zo = Object.prototype, Na = zo.hasOwnProperty, ya = zo.propertyIsEnumerable, Cn = ai(/* @__PURE__ */ function() {
223
217
  return arguments;
224
218
  }()) ? ai : function(t) {
225
219
  return Ot(t) && Na.call(t, "callee") && !ya.call(t, "callee");
226
- }, zo = typeof exports == "object" && exports && !exports.nodeType && exports, ci = zo && typeof module == "object" && module && !module.nodeType && module, ui = ci && ci.exports === zo ? wt.Buffer : void 0, De = (ui ? ui.isBuffer : void 0) || function() {
220
+ }, Ko = typeof exports == "object" && exports && !exports.nodeType && exports, ci = Ko && typeof module == "object" && module && !module.nodeType && module, ui = ci && ci.exports === Ko ? wt.Buffer : void 0, De = (ui ? ui.isBuffer : void 0) || function() {
227
221
  return !1;
228
- }, z = {};
222
+ }, K = {};
229
223
  function kn(t) {
230
224
  return function(e) {
231
225
  return t(e);
232
226
  };
233
227
  }
234
- z["[object Float32Array]"] = z["[object Float64Array]"] = z["[object Int8Array]"] = z["[object Int16Array]"] = z["[object Int32Array]"] = z["[object Uint8Array]"] = z["[object Uint8ClampedArray]"] = z["[object Uint16Array]"] = z["[object Uint32Array]"] = !0, z["[object Arguments]"] = z["[object Array]"] = z["[object ArrayBuffer]"] = z["[object Boolean]"] = z["[object DataView]"] = z["[object Date]"] = z["[object Error]"] = z["[object Function]"] = z["[object Map]"] = z["[object Number]"] = z["[object Object]"] = z["[object RegExp]"] = z["[object Set]"] = z["[object String]"] = z["[object WeakMap]"] = !1;
228
+ K["[object Float32Array]"] = K["[object Float64Array]"] = K["[object Int8Array]"] = K["[object Int16Array]"] = K["[object Int32Array]"] = K["[object Uint8Array]"] = K["[object Uint8ClampedArray]"] = K["[object Uint16Array]"] = K["[object Uint32Array]"] = !0, K["[object Arguments]"] = K["[object Array]"] = K["[object ArrayBuffer]"] = K["[object Boolean]"] = K["[object DataView]"] = K["[object Date]"] = K["[object Error]"] = K["[object Function]"] = K["[object Map]"] = K["[object Number]"] = K["[object Object]"] = K["[object RegExp]"] = K["[object Set]"] = K["[object String]"] = K["[object WeakMap]"] = !1;
235
229
  var Vo = typeof exports == "object" && exports && !exports.nodeType && exports, ke = Vo && typeof module == "object" && module && !module.nodeType && module, Gn = ke && ke.exports === Vo && Fo.process, Zt = function() {
236
230
  try {
237
231
  return ke && ke.require && ke.require("util").types || Gn && Gn.binding && Gn.binding("util");
238
232
  } catch {
239
233
  }
240
234
  }(), li = Zt && Zt.isTypedArray, Wr = li ? kn(li) : function(t) {
241
- return Ot(t) && $r(t.length) && !!z[Jt(t)];
235
+ return Ot(t) && $r(t.length) && !!K[Jt(t)];
242
236
  }, Ra = Object.prototype.hasOwnProperty;
243
237
  function Ho(t, e) {
244
238
  var n = B(t), r = !n && Cn(t), i = !n && !r && De(t), o = !n && !r && !i && Wr(t), s = n || r || i || o, a = s ? function(l, h) {
@@ -263,14 +257,14 @@ function Xo(t) {
263
257
  function yt(t) {
264
258
  return Mt(t) ? Ho(t) : Xo(t);
265
259
  }
266
- var Kn, Sa = Object.prototype.hasOwnProperty, pt = (Kn = function(t, e) {
260
+ var zn, Sa = Object.prototype.hasOwnProperty, pt = (zn = function(t, e) {
267
261
  if (Ve(e) || Mt(e)) Er(e, yt(e), t);
268
262
  else for (var n in e) Sa.call(e, n) && xn(t, n, e[n]);
269
263
  }, Br(function(t, e) {
270
264
  var n = -1, r = e.length, i = r > 1 ? e[r - 1] : void 0, o = r > 2 ? e[2] : void 0;
271
- for (i = Kn.length > 3 && typeof i == "function" ? (r--, i) : void 0, o && Go(e[0], e[1], o) && (i = r < 3 ? void 0 : i, r = 1), t = Object(t); ++n < r; ) {
265
+ for (i = zn.length > 3 && typeof i == "function" ? (r--, i) : void 0, o && Go(e[0], e[1], o) && (i = r < 3 ? void 0 : i, r = 1), t = Object(t); ++n < r; ) {
272
266
  var s = e[n];
273
- s && Kn(t, s);
267
+ s && zn(t, s);
274
268
  }
275
269
  return t;
276
270
  })), _a = Object.prototype.hasOwnProperty;
@@ -301,7 +295,7 @@ function re(t) {
301
295
  }
302
296
  }
303
297
  function qe(t, e) {
304
- for (var n = t.length; n--; ) if (ze(t[n][0], e)) return n;
298
+ for (var n = t.length; n--; ) if (Ke(t[n][0], e)) return n;
305
299
  return -1;
306
300
  }
307
301
  re.prototype.clear = function() {
@@ -380,14 +374,14 @@ Gt.prototype.clear = function() {
380
374
  var n = Ze(this, t), r = n.size;
381
375
  return n.set(t, e), this.size += n.size == r ? 0 : 1, this;
382
376
  }, Gr.Cache = Gt;
383
- var zn, Vn, Pa = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, wa = /\\(\\)?/g, Ma = (zn = Gr(function(t) {
377
+ var Kn, Vn, Pa = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, wa = /\\(\\)?/g, Ma = (Kn = Gr(function(t) {
384
378
  var e = [];
385
379
  return t.charCodeAt(0) === 46 && e.push(""), t.replace(Pa, function(n, r, i, o) {
386
380
  e.push(i ? o.replace(wa, "$1") : r || n);
387
381
  }), e;
388
382
  }, function(t) {
389
383
  return Vn.size === 500 && Vn.clear(), t;
390
- }), Vn = zn.cache, zn);
384
+ }), Vn = Kn.cache, Kn);
391
385
  function bn(t, e) {
392
386
  return B(t) ? t : gr(t, e) ? [t] : Ma(function(n) {
393
387
  return n == null ? "" : jo(n);
@@ -402,7 +396,7 @@ function Tr(t, e) {
402
396
  for (var n = 0, r = (e = bn(e, t)).length; t != null && n < r; ) t = t[Be(e[n++])];
403
397
  return n && n == r ? t : void 0;
404
398
  }
405
- function Kr(t, e) {
399
+ function zr(t, e) {
406
400
  for (var n = -1, r = e.length, i = t.length; ++n < r; ) t[i + n] = e[n];
407
401
  return t;
408
402
  }
@@ -410,16 +404,16 @@ var hi = It ? It.isConcatSpreadable : void 0;
410
404
  function Ua(t) {
411
405
  return B(t) || Cn(t) || !!(hi && t && t[hi]);
412
406
  }
413
- function zr(t, e, n, r, i) {
407
+ function Kr(t, e, n, r, i) {
414
408
  var o = -1, s = t.length;
415
409
  for (n || (n = Ua), i || (i = []); ++o < s; ) {
416
410
  var a = t[o];
417
- n(a) ? Kr(i, a) : r || (i[i.length] = a);
411
+ n(a) ? zr(i, a) : r || (i[i.length] = a);
418
412
  }
419
413
  return i;
420
414
  }
421
415
  function Rt(t) {
422
- return t != null && t.length ? zr(t) : [];
416
+ return t != null && t.length ? Kr(t) : [];
423
417
  }
424
418
  var Zo = Yo(Object.getPrototypeOf, Object);
425
419
  function Qo(t, e, n) {
@@ -471,17 +465,17 @@ var Da = Object.prototype.propertyIsEnumerable, mi = Object.getOwnPropertySymbol
471
465
  return Da.call(t, e);
472
466
  }));
473
467
  } : ts, ja = Object.getOwnPropertySymbols ? function(t) {
474
- for (var e = []; t; ) Kr(e, Hr(t)), t = Zo(t);
468
+ for (var e = []; t; ) zr(e, Hr(t)), t = Zo(t);
475
469
  return e;
476
470
  } : ts;
477
471
  function es(t, e, n) {
478
472
  var r = e(t);
479
- return B(t) ? r : Kr(r, n(t));
473
+ return B(t) ? r : zr(r, n(t));
480
474
  }
481
475
  function Ar(t) {
482
476
  return es(t, yt, Hr);
483
477
  }
484
- var Ir = ce(wt, "DataView"), Nr = ce(wt, "Promise"), pe = ce(wt, "Set"), Ei = "[object Map]", gi = "[object Promise]", Ti = "[object Set]", Ai = "[object WeakMap]", Ii = "[object DataView]", Ba = ae(Ir), $a = ae(je), Wa = ae(Nr), Ga = ae(pe), Ka = ae(mr), At = Jt;
478
+ var Ir = ce(wt, "DataView"), Nr = ce(wt, "Promise"), pe = ce(wt, "Set"), Ei = "[object Map]", gi = "[object Promise]", Ti = "[object Set]", Ai = "[object WeakMap]", Ii = "[object DataView]", Ba = ae(Ir), $a = ae(je), Wa = ae(Nr), Ga = ae(pe), za = ae(mr), At = Jt;
485
479
  (Ir && At(new Ir(new ArrayBuffer(1))) != Ii || je && At(new je()) != Ei || Nr && At(Nr.resolve()) != gi || pe && At(new pe()) != Ti || mr && At(new mr()) != Ai) && (At = function(t) {
486
480
  var e = Jt(t), n = e == "[object Object]" ? t.constructor : void 0, r = n ? ae(n) : "";
487
481
  if (r) switch (r) {
@@ -493,12 +487,12 @@ var Ir = ce(wt, "DataView"), Nr = ce(wt, "Promise"), pe = ce(wt, "Set"), Ei = "[
493
487
  return gi;
494
488
  case Ga:
495
489
  return Ti;
496
- case Ka:
490
+ case za:
497
491
  return Ai;
498
492
  }
499
493
  return e;
500
494
  });
501
- var za = Object.prototype.hasOwnProperty, mn = wt.Uint8Array, Va = /\w*$/, Ni = It ? It.prototype : void 0, yi = Ni ? Ni.valueOf : void 0, Ri = Zt && Zt.isMap, Ha = Ri ? kn(Ri) : function(t) {
495
+ var Ka = Object.prototype.hasOwnProperty, mn = wt.Uint8Array, Va = /\w*$/, Ni = It ? It.prototype : void 0, yi = Ni ? Ni.valueOf : void 0, Ri = Zt && Zt.isMap, Ha = Ri ? kn(Ri) : function(t) {
502
496
  return Ot(t) && At(t) == "[object Map]";
503
497
  }, vi = Zt && Zt.isSet, Ya = vi ? kn(vi) : function(t) {
504
498
  return Ot(t) && At(t) == "[object Set]";
@@ -508,7 +502,7 @@ function sn(t, e, n, r, i, o) {
508
502
  if (s !== void 0) return s;
509
503
  if (!Nt(t)) return t;
510
504
  var a, c, u, l = B(t);
511
- if (l) return c = (a = t).length, u = new a.constructor(c), c && typeof a[0] == "string" && za.call(a, "index") && (u.index = a.index, u.input = a.input), function(m, y) {
505
+ if (l) return c = (a = t).length, u = new a.constructor(c), c && typeof a[0] == "string" && Ka.call(a, "index") && (u.index = a.index, u.input = a.input), function(m, y) {
512
506
  var p = -1, T = m.length;
513
507
  for (y || (y = Array(T)); ++p < T; ) y[p] = m[p];
514
508
  return y;
@@ -657,7 +651,7 @@ function yr(t, e, n, r, i) {
657
651
  case "[object Boolean]":
658
652
  case "[object Date]":
659
653
  case "[object Number]":
660
- return ze(+f, +d);
654
+ return Ke(+f, +d);
661
655
  case "[object Error]":
662
656
  return f.name == d.name && f.message == d.message;
663
657
  case "[object RegExp]":
@@ -807,7 +801,7 @@ var as = Object.prototype, tc = as.hasOwnProperty, Rr = Br(function(t, e) {
807
801
  var n = -1, r = e.length, i = r > 2 ? e[2] : void 0;
808
802
  for (i && Go(e[0], e[1], i) && (r = 1); ++n < r; ) for (var o = e[n], s = qo(o), a = -1, c = s.length; ++a < c; ) {
809
803
  var u = s[a], l = t[u];
810
- (l === void 0 || ze(l, as[u]) && !tc.call(t, u)) && (t[u] = o[u]);
804
+ (l === void 0 || Ke(l, as[u]) && !tc.call(t, u)) && (t[u] = o[u]);
811
805
  }
812
806
  return t;
813
807
  });
@@ -827,7 +821,7 @@ var En = Br(function(t, e) {
827
821
  } else o(r, h, void 0) || c.push(l);
828
822
  }
829
823
  return c;
830
- }(t, zr(e, 0, Pi, !0)) : [];
824
+ }(t, Kr(e, 0, Pi, !0)) : [];
831
825
  });
832
826
  function ge(t) {
833
827
  var e = t == null ? 0 : t.length;
@@ -896,7 +890,7 @@ function k(t, e) {
896
890
  return (B(t) ? Sn : ic)(t, Pt(e));
897
891
  }
898
892
  function Tt(t, e) {
899
- return zr(k(t, e));
893
+ return Kr(k(t, e));
900
894
  }
901
895
  var Mi, oc = Object.prototype.hasOwnProperty, sc = (Mi = function(t, e, n) {
902
896
  oc.call(t, n) ? t[n].push(e) : jr(t, n, [e]);
@@ -929,7 +923,7 @@ function Ui(t, e, n) {
929
923
  return t != null && t.length ? Dr(t, e, 0) : -1;
930
924
  }
931
925
  var lc = Object.prototype.hasOwnProperty;
932
- function K(t) {
926
+ function z(t) {
933
927
  if (t == null) return !0;
934
928
  if (Mt(t) && (B(t) || typeof t == "string" || typeof t.splice == "function" || De(t) || Wr(t) || Cn(t))) return !t.length;
935
929
  var e = At(t);
@@ -938,7 +932,7 @@ function K(t) {
938
932
  for (var n in t) if (lc.call(t, n)) return !1;
939
933
  return !0;
940
934
  }
941
- var Fi = Zt && Zt.isRegExp, Kt = Fi ? kn(Fi) : function(t) {
935
+ var Fi = Zt && Zt.isRegExp, zt = Fi ? kn(Fi) : function(t) {
942
936
  return Ot(t) && Jt(t) == "[object RegExp]";
943
937
  };
944
938
  function Ht(t) {
@@ -1156,7 +1150,7 @@ function cn(t) {
1156
1150
  const n = { type: "Terminal", name: t.terminalType.name, label: mc(t.terminalType), idx: t.idx };
1157
1151
  ut(t.label) && (n.terminalLabel = t.label);
1158
1152
  const r = t.terminalType.PATTERN;
1159
- return t.terminalType.PATTERN && (n.pattern = Kt(r) ? r.source : r), n;
1153
+ return t.terminalType.PATTERN && (n.pattern = zt(r) ? r.source : r), n;
1160
1154
  }
1161
1155
  if (t instanceof Ae) return { type: "Rule", name: t.name, orgText: t.orgText, definition: e(t.definition) };
1162
1156
  throw Error("non exhaustive match");
@@ -2058,13 +2052,13 @@ function Gi(t) {
2058
2052
  const e = t.ignoreCase ? "i" : "";
2059
2053
  return new RegExp(`^(?:${t.source})`, e);
2060
2054
  }
2061
- function Ki(t) {
2055
+ function zi(t) {
2062
2056
  const e = t.ignoreCase ? "iy" : "y";
2063
2057
  return new RegExp(`${t.source}`, e);
2064
2058
  }
2065
2059
  function ms(t) {
2066
2060
  const e = t.PATTERN;
2067
- if (Kt(e)) return !1;
2061
+ if (zt(e)) return !1;
2068
2062
  if (Yt(e) || b(e, "exec")) return !0;
2069
2063
  if (ut(e)) return !1;
2070
2064
  throw Error("non exhaustive match");
@@ -2081,9 +2075,9 @@ const Oc = { test: function(t) {
2081
2075
  }
2082
2076
  return !1;
2083
2077
  }, lastIndex: 0 };
2084
- function zi(t, e) {
2078
+ function Ki(t, e) {
2085
2079
  if (b(t, "LINE_BREAKS")) return !1;
2086
- if (Kt(t.PATTERN)) {
2080
+ if (zt(t.PATTERN)) {
2087
2081
  try {
2088
2082
  xr(e, t.PATTERN);
2089
2083
  } catch (n) {
@@ -2121,7 +2115,7 @@ function He(t) {
2121
2115
  for (; o; ) {
2122
2116
  i = $e(Rt(k(i, (a) => a.CATEGORIES)));
2123
2117
  const s = En(i, r);
2124
- r = r.concat(s), K(s) ? o = !1 : i = s;
2118
+ r = r.concat(s), z(s) ? o = !1 : i = s;
2125
2119
  }
2126
2120
  return r;
2127
2121
  }(t);
@@ -2210,7 +2204,7 @@ a boolean 2nd argument is no longer supported`);
2210
2204
  let h = !1;
2211
2205
  const N = an($e(Rt(Q(a.modes))), (_) => _[ne] === ot.NA), S = Vi(u);
2212
2206
  return c && w(N, (_) => {
2213
- const m = zi(_, S);
2207
+ const m = Ki(_, S);
2214
2208
  if (m !== !1) {
2215
2209
  const y = { message: function(p, T) {
2216
2210
  if (T.issue === H.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.
@@ -2247,13 +2241,13 @@ a boolean 2nd argument is no longer supported`);
2247
2241
  const S = function(m) {
2248
2242
  const y = gt(m, (p) => {
2249
2243
  const T = p[ne];
2250
- return !(Kt(T) || Yt(T) || b(T, "exec") || ut(T));
2244
+ return !(zt(T) || Yt(T) || b(T, "exec") || ut(T));
2251
2245
  });
2252
2246
  return { errors: k(y, (p) => ({ message: "Token Type: ->" + p.name + "<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.", type: H.INVALID_PATTERN, tokenTypes: [p] })), valid: En(m, y) };
2253
2247
  }(N.valid), _ = S.valid;
2254
2248
  return h = h.concat(S.errors), h = h.concat(function(m) {
2255
2249
  let y = [];
2256
- const p = gt(m, (T) => Kt(T[ne]));
2250
+ const p = gt(m, (T) => zt(T[ne]));
2257
2251
  return y = y.concat(function(T) {
2258
2252
  class g extends Sr {
2259
2253
  constructor() {
@@ -2314,13 +2308,13 @@ a boolean 2nd argument is no longer supported`);
2314
2308
  }(_, l)), h = h.concat(function(m) {
2315
2309
  const y = [], p = dt(m, (T, g, A) => {
2316
2310
  const v = g.PATTERN;
2317
- return v === ot.NA || (ut(v) ? T.push({ str: v, idx: A, tokenType: g }) : Kt(v) && (f = v, Te([".", "\\", "[", "]", "|", "^", "$", "(", ")", "?", "*", "+", "{"], (d) => f.source.indexOf(d) !== -1) === void 0) && T.push({ str: v.source, idx: A, tokenType: g })), T;
2311
+ return v === ot.NA || (ut(v) ? T.push({ str: v, idx: A, tokenType: g }) : zt(v) && (f = v, Te([".", "\\", "[", "]", "|", "^", "$", "(", ")", "?", "*", "+", "{"], (d) => f.source.indexOf(d) !== -1) === void 0) && T.push({ str: v.source, idx: A, tokenType: g })), T;
2318
2312
  var f;
2319
2313
  }, []);
2320
2314
  return w(m, (T, g) => {
2321
2315
  w(p, ({ str: A, idx: v, tokenType: f }) => {
2322
2316
  if (g < v && function(d, I) {
2323
- if (Kt(I)) {
2317
+ if (zt(I)) {
2324
2318
  const E = I.exec(d);
2325
2319
  return E !== null && E.index === 0;
2326
2320
  }
@@ -2338,7 +2332,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2338
2332
  }), y;
2339
2333
  }(_)), h;
2340
2334
  }(a, s));
2341
- }), K(this.lexerDefinitionErrors)) {
2335
+ }), z(this.lexerDefinitionErrors)) {
2342
2336
  let u;
2343
2337
  He(a), this.TRACE_INIT("analyzeTokenTypes", () => {
2344
2338
  u = function(l, h) {
@@ -2347,7 +2341,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2347
2341
  let S;
2348
2342
  N("initCharCodeToOptimizedIndexMap", () => {
2349
2343
  (function() {
2350
- if (K(ln)) {
2344
+ if (z(ln)) {
2351
2345
  ln = new Array(65536);
2352
2346
  for (let L = 0; L < 65536; L++) ln[L] = L > 255 ? 255 + ~~(L / 255) : L;
2353
2347
  }
@@ -2359,9 +2353,9 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2359
2353
  N("Transform Patterns", () => {
2360
2354
  E = !1, _ = k(S, (L) => {
2361
2355
  const O = L[ne];
2362
- if (Kt(O)) {
2356
+ if (zt(O)) {
2363
2357
  const P = O.source;
2364
- return P.length !== 1 || P === "^" || P === "$" || P === "." || O.ignoreCase ? P.length !== 2 || P[0] !== "\\" || at(["d", "D", "s", "S", "t", "r", "n", "t", "0", "c", "b", "B", "f", "v", "w", "W"], P[1]) ? h.useSticky ? Ki(O) : Gi(O) : P[1] : P;
2358
+ return P.length !== 1 || P === "^" || P === "$" || P === "." || O.ignoreCase ? P.length !== 2 || P[0] !== "\\" || at(["d", "D", "s", "S", "t", "r", "n", "t", "0", "c", "b", "B", "f", "v", "w", "W"], P[1]) ? h.useSticky ? zi(O) : Gi(O) : P[1] : P;
2365
2359
  }
2366
2360
  if (Yt(O)) return E = !0, { exec: O };
2367
2361
  if (typeof O == "object") return E = !0, O;
@@ -2369,7 +2363,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2369
2363
  if (O.length === 1) return O;
2370
2364
  {
2371
2365
  const P = O.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&"), x = new RegExp(P);
2372
- return h.useSticky ? Ki(x) : Gi(x);
2366
+ return h.useSticky ? zi(x) : Gi(x);
2373
2367
  }
2374
2368
  }
2375
2369
  throw Error("non exhaustive match");
@@ -2388,7 +2382,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2388
2382
  }), T = k(S, (L) => L.PUSH_MODE), g = k(S, (L) => b(L, "POP_MODE"));
2389
2383
  }), N("Line Terminator Handling", () => {
2390
2384
  const L = Vi(h.lineTerminatorCharacters);
2391
- A = k(S, (O) => !1), h.positionTracking !== "onlyOffset" && (A = k(S, (O) => b(O, "LINE_BREAKS") ? !!O.LINE_BREAKS : zi(O, L) === !1 && xr(L, O.PATTERN)));
2385
+ A = k(S, (O) => !1), h.positionTracking !== "onlyOffset" && (A = k(S, (O) => b(O, "LINE_BREAKS") ? !!O.LINE_BREAKS : Ki(O, L) === !1 && xr(L, O.PATTERN)));
2392
2386
  }), N("Misc Mapping #2", () => {
2393
2387
  v = k(S, ms), f = k(_, vc), d = dt(S, (L, O) => {
2394
2388
  const P = O.GROUP;
@@ -2407,13 +2401,13 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2407
2401
  const $ = qt(typeof C == "string" ? C.charCodeAt(0) : C);
2408
2402
  x !== $ && (x = $, qn(L, $, I[P]));
2409
2403
  });
2410
- } else if (Kt(O.PATTERN)) if (O.PATTERN.unicode) R = !1, h.ensureOptimizations && Or(`${Nn} Unable to analyze < ${O.PATTERN.toString()} > pattern.
2404
+ } else if (zt(O.PATTERN)) if (O.PATTERN.unicode) R = !1, h.ensureOptimizations && Or(`${Nn} Unable to analyze < ${O.PATTERN.toString()} > pattern.
2411
2405
  The regexp unicode flag is not currently supported by the regexp-to-ast library.
2412
2406
  This will disable the lexer's first char optimizations.
2413
2407
  For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
2414
2408
  else {
2415
2409
  const x = Ic(O.PATTERN, h.ensureOptimizations);
2416
- K(x) && (R = !1), w(x, (C) => {
2410
+ z(x) && (R = !1), w(x, (C) => {
2417
2411
  qn(L, C, I[P]);
2418
2412
  });
2419
2413
  }
@@ -2427,7 +2421,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2427
2421
  }), this.patternIdxToConfig[c] = u.patternIdxToConfig, this.charCodeToPatternIdxToConfig[c] = u.charCodeToPatternIdxToConfig, this.emptyGroups = pt({}, this.emptyGroups, u.emptyGroups), this.hasCustom = u.hasCustom || this.hasCustom, this.canModeBeOptimized[c] = u.canBeOptimized;
2428
2422
  }
2429
2423
  });
2430
- }), this.defaultMode = i.defaultMode, !K(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
2424
+ }), this.defaultMode = i.defaultMode, !z(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
2431
2425
  const a = k(this.lexerDefinitionErrors, (c) => c.message).join(`-----------------------
2432
2426
  `);
2433
2427
  throw new Error(`Errors detected in definition of Lexer:
@@ -2445,7 +2439,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2445
2439
  this.hasCustom ? (this.addToken = this.addTokenUsingPush, this.handlePayload = this.handlePayloadWithCustom) : (this.addToken = this.addTokenUsingMemberAccess, this.handlePayload = this.handlePayloadNoCustom);
2446
2440
  }), this.TRACE_INIT("Failed Optimization Warnings", () => {
2447
2441
  const a = dt(this.canModeBeOptimized, (c, u, l) => (u === !1 && c.push(l), c), []);
2448
- if (n.ensureOptimizations && !K(a)) throw Error(`Lexer Modes: < ${a.join(", ")} > cannot be optimized.
2442
+ if (n.ensureOptimizations && !z(a)) throw Error(`Lexer Modes: < ${a.join(", ")} > cannot be optimized.
2449
2443
  Disable the "ensureOptimizations" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.
2450
2444
  Or inspect the console log for details on how to resolve these issues.`);
2451
2445
  }), this.TRACE_INIT("clearRegExpParserCache", () => {
@@ -2456,7 +2450,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
2456
2450
  });
2457
2451
  }
2458
2452
  tokenize(e, n = this.defaultMode) {
2459
- if (!K(this.lexerDefinitionErrors)) {
2453
+ if (!z(this.lexerDefinitionErrors)) {
2460
2454
  const r = k(this.lexerDefinitionErrors, (i) => i.message).join(`-----------------------
2461
2455
  `);
2462
2456
  throw new Error(`Unable to Tokenize because Errors detected in definition of Lexer:
@@ -2721,7 +2715,7 @@ class xc extends Pn {
2721
2715
  }
2722
2716
  }
2723
2717
  updateExpectedNext() {
2724
- K(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
2718
+ z(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
2725
2719
  }
2726
2720
  }
2727
2721
  class Cc extends xc {
@@ -2797,7 +2791,7 @@ function Cr(t, e, n = []) {
2797
2791
  r = o(a);
2798
2792
  } else {
2799
2793
  if (s instanceof xt) return w(s.definition, (a) => {
2800
- K(a.definition) === !1 && (r = o(a.definition));
2794
+ z(a.definition) === !1 && (r = o(a.definition));
2801
2795
  }), r;
2802
2796
  if (!(s instanceof V)) throw Error("non exhaustive match");
2803
2797
  n.push(s.terminalType);
@@ -2811,14 +2805,14 @@ function Is(t, e, n, r) {
2811
2805
  const i = "EXIT_NONE_TERMINAL", o = [i], s = "EXIT_ALTERNATIVE";
2812
2806
  let a = !1;
2813
2807
  const c = e.length, u = c - r - 1, l = [], h = [];
2814
- for (h.push({ idx: -1, def: t, ruleStack: [], occurrenceStack: [] }); !K(h); ) {
2808
+ for (h.push({ idx: -1, def: t, ruleStack: [], occurrenceStack: [] }); !z(h); ) {
2815
2809
  const N = h.pop();
2816
2810
  if (N === s) {
2817
2811
  a && ge(h).idx <= u && h.pop();
2818
2812
  continue;
2819
2813
  }
2820
2814
  const S = N.def, _ = N.idx, m = N.ruleStack, y = N.occurrenceStack;
2821
- if (K(S)) continue;
2815
+ if (z(S)) continue;
2822
2816
  const p = S[0];
2823
2817
  if (p === i) {
2824
2818
  const T = { idx: _, def: tt(S), ruleStack: We(m), occurrenceStack: We(y) };
@@ -2934,7 +2928,7 @@ function Mc(t, e, n) {
2934
2928
  const r = vt(t, (o) => o.length === 1), i = t.length;
2935
2929
  if (r && !n) {
2936
2930
  const o = Rt(t);
2937
- if (o.length === 1 && K(o[0].categoryMatches)) {
2931
+ if (o.length === 1 && z(o[0].categoryMatches)) {
2938
2932
  const s = o[0].tokenTypeIdx;
2939
2933
  return function() {
2940
2934
  return this.LA(1).tokenTypeIdx === s;
@@ -3063,7 +3057,7 @@ function ys(t, e) {
3063
3057
  const u = a[c];
3064
3058
  for (let l = 0; l < u.length; l++) {
3065
3059
  const h = u[l].partialPath, N = u[l].suffixDef, S = Zn(h);
3066
- if (Fc(i, S, c) || K(N) || h.length === e) {
3060
+ if (Fc(i, S, c) || z(N) || h.length === e) {
3067
3061
  const _ = r[c];
3068
3062
  if (Pr(_, h) === !1) {
3069
3063
  _.push(h);
@@ -3109,7 +3103,7 @@ function Pr(t, e) {
3109
3103
  return !1;
3110
3104
  }
3111
3105
  function co(t) {
3112
- return vt(t, (e) => vt(e, (n) => vt(n, (r) => K(r.categoryMatches))));
3106
+ return vt(t, (e) => vt(e, (n) => vt(n, (r) => z(r.categoryMatches))));
3113
3107
  }
3114
3108
  function Dc(t) {
3115
3109
  return `${kt(t)}_#_${t.idx}_#_${Rs(t)}`;
@@ -3148,7 +3142,7 @@ class jc extends Ie {
3148
3142
  }
3149
3143
  function vs(t, e, n, r = []) {
3150
3144
  const i = [], o = hn(e.definition);
3151
- if (K(o)) return [];
3145
+ if (z(o)) return [];
3152
3146
  {
3153
3147
  const s = t.name;
3154
3148
  at(o, t) && i.push({ message: n.buildLeftRecursionError({ topLevelRule: t, leftRecursionPath: r }), type: st.LEFT_RECURSION, ruleName: s });
@@ -3161,7 +3155,7 @@ function vs(t, e, n, r = []) {
3161
3155
  }
3162
3156
  function hn(t) {
3163
3157
  let e = [];
3164
- if (K(t)) return e;
3158
+ if (z(t)) return e;
3165
3159
  const n = St(t);
3166
3160
  if (n instanceof mt) e.push(n.referencedRule);
3167
3161
  else if (n instanceof ht || n instanceof lt || n instanceof Ft || n instanceof Dt || n instanceof Lt || n instanceof J) e = e.concat(hn(n.definition));
@@ -3230,12 +3224,12 @@ class Gc extends Mn {
3230
3224
  }
3231
3225
  }
3232
3226
  const Qn = {}, Cs = "InRuleRecoveryException";
3233
- class Kc extends Error {
3227
+ class zc extends Error {
3234
3228
  constructor(e) {
3235
3229
  super(e), this.name = Cs;
3236
3230
  }
3237
3231
  }
3238
- function zc(t, e, n, r, i, o, s) {
3232
+ function Kc(t, e, n, r, i, o, s) {
3239
3233
  const a = this.getKeyForAutomaticLookahead(r, i);
3240
3234
  let c = this.firstAfterRepMap[a];
3241
3235
  if (c === void 0) {
@@ -3253,11 +3247,11 @@ function er(t, e, n) {
3253
3247
  class Vc {
3254
3248
  constructor(e) {
3255
3249
  var n;
3256
- this.maxLookahead = (n = e?.maxLookahead) !== null && n !== void 0 ? n : zt.maxLookahead;
3250
+ this.maxLookahead = (n = e?.maxLookahead) !== null && n !== void 0 ? n : Kt.maxLookahead;
3257
3251
  }
3258
3252
  validate(e) {
3259
3253
  const n = this.validateNoLeftRecursion(e.rules);
3260
- if (K(n)) {
3254
+ if (z(n)) {
3261
3255
  const r = this.validateEmptyOrAlternatives(e.rules), i = this.validateAmbiguousAlternationAlternatives(e.rules, this.maxLookahead), o = this.validateSomeNonEmptyLookaheadPath(e.rules, this.maxLookahead);
3262
3256
  return [...n, ...r, ...i, ...o];
3263
3257
  }
@@ -3269,7 +3263,7 @@ class Vc {
3269
3263
  validateEmptyOrAlternatives(e) {
3270
3264
  return Tt(e, (n) => function(r, i) {
3271
3265
  const o = new wr();
3272
- return r.accept(o), Tt(o.alternations, (s) => Tt(We(s.definition), (a, c) => K(Is([a], [], Pe, 1)) ? [{ message: i.buildEmptyAlternationError({ topLevelRule: r, alternation: s, emptyChoiceIdx: c }), type: st.NONE_LAST_EMPTY_ALT, ruleName: r.name, occurrence: s.idx, alternative: c + 1 }] : []));
3266
+ return r.accept(o), Tt(o.alternations, (s) => Tt(We(s.definition), (a, c) => z(Is([a], [], Pe, 1)) ? [{ message: i.buildEmptyAlternationError({ topLevelRule: r, alternation: s, emptyChoiceIdx: c }), type: st.NONE_LAST_EMPTY_ALT, ruleName: r.name, occurrence: s.idx, alternative: c + 1 }] : []));
3273
3267
  }(n, oe));
3274
3268
  }
3275
3269
  validateAmbiguousAlternationAlternatives(e, n) {
@@ -3320,7 +3314,7 @@ class Vc {
3320
3314
  const c = new Bc();
3321
3315
  a.accept(c), w(c.allProductions, (u) => {
3322
3316
  const l = so(u), h = u.maxLookahead || i;
3323
- if (K(Rt(br(u.idx, a, l, h)[0]))) {
3317
+ if (z(Rt(br(u.idx, a, l, h)[0]))) {
3324
3318
  const N = o.buildEmptyRepetitionError({ topLevelRule: a, repetition: u });
3325
3319
  s.push({ message: N, type: st.NO_NON_EMPTY_LOOKAHEAD, ruleName: a.name });
3326
3320
  }
@@ -3426,7 +3420,7 @@ function Rn(t) {
3426
3420
  }
3427
3421
  const fn = qr(ie, "", NaN, NaN, NaN, NaN, NaN, NaN);
3428
3422
  Object.freeze(fn);
3429
- const zt = Object.freeze({ recoveryEnabled: !1, maxLookahead: 3, dynamicTokensEnabled: !1, outputCst: !0, errorMessageProvider: As, nodeLocationTracking: "none", traceInitPerf: !1, skipValidations: !1 }), on = Object.freeze({ recoveryValueFunc: () => {
3423
+ const Kt = Object.freeze({ recoveryEnabled: !1, maxLookahead: 3, dynamicTokensEnabled: !1, outputCst: !0, errorMessageProvider: As, nodeLocationTracking: "none", traceInitPerf: !1, skipValidations: !1 }), on = Object.freeze({ recoveryValueFunc: () => {
3430
3424
  }, resyncEnabled: !0 });
3431
3425
  var st, nr;
3432
3426
  (function(t) {
@@ -3468,7 +3462,7 @@ class Ge {
3468
3462
  }(s, o.errMsgProvider);
3469
3463
  }({ rules: Q(this.gastProductionsCache) }), this.definitionErrors = this.definitionErrors.concat(r);
3470
3464
  }), this.TRACE_INIT("Grammar Validations", () => {
3471
- if (K(r) && this.skipValidations === !1) {
3465
+ if (z(r) && this.skipValidations === !1) {
3472
3466
  const s = (o = { rules: Q(this.gastProductionsCache), tokenTypes: Q(this.tokensMap), errMsgProvider: oe, grammarName: n }, function(c, u, l, h) {
3473
3467
  const N = Tt(c, (y) => function(p, T) {
3474
3468
  const g = new jc();
@@ -3503,7 +3497,7 @@ class Ge {
3503
3497
  this.definitionErrors = this.definitionErrors.concat(s, a);
3504
3498
  }
3505
3499
  var i, o;
3506
- }), K(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
3500
+ }), z(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
3507
3501
  const i = function(o) {
3508
3502
  const s = {};
3509
3503
  return w(o, (a) => {
@@ -3515,7 +3509,7 @@ class Ge {
3515
3509
  }), this.TRACE_INIT("ComputeLookaheadFunctions", () => {
3516
3510
  var i, o;
3517
3511
  (o = (i = this.lookaheadStrategy).initialize) === null || o === void 0 || o.call(i, { rules: Q(this.gastProductionsCache) }), this.preComputeLookaheadFunctions(Q(this.gastProductionsCache));
3518
- })), !Ge.DEFER_DEFINITION_ERRORS_HANDLING && !K(this.definitionErrors)) throw e = k(this.definitionErrors, (i) => i.message), new Error(`Parser Definition Errors detected:
3512
+ })), !Ge.DEFER_DEFINITION_ERRORS_HANDLING && !z(this.definitionErrors)) throw e = k(this.definitionErrors, (i) => i.message), new Error(`Parser Definition Errors detected:
3519
3513
  ${e.join(`
3520
3514
  -------------------------------
3521
3515
  `)}`);
@@ -3528,12 +3522,12 @@ class Ge {
3528
3522
  Please use the <IGNORE_AMBIGUITIES> flag on the relevant DSL method instead.
3529
3523
  See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#IGNORING_AMBIGUITIES
3530
3524
  For further details.`);
3531
- this.skipValidations = b(n, "skipValidations") ? n.skipValidations : zt.skipValidations;
3525
+ this.skipValidations = b(n, "skipValidations") ? n.skipValidations : Kt.skipValidations;
3532
3526
  }
3533
3527
  }
3534
3528
  Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
3535
3529
  initRecoverable(t) {
3536
- this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = b(t, "recoveryEnabled") ? t.recoveryEnabled : zt.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = zc);
3530
+ this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = b(t, "recoveryEnabled") ? t.recoveryEnabled : Kt.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = Kc);
3537
3531
  }
3538
3532
  getTokenToInsert(t) {
3539
3533
  const e = qr(t, "", NaN, NaN, NaN, NaN, NaN, NaN);
@@ -3574,13 +3568,13 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
3574
3568
  const n = this.SKIP_TOKEN();
3575
3569
  return this.consumeToken(), n;
3576
3570
  }
3577
- throw new Kc("sad sad panda");
3571
+ throw new zc("sad sad panda");
3578
3572
  }
3579
3573
  canPerformInRuleRecovery(t, e) {
3580
3574
  return this.canRecoverWithSingleTokenInsertion(t, e) || this.canRecoverWithSingleTokenDeletion(t);
3581
3575
  }
3582
3576
  canRecoverWithSingleTokenInsertion(t, e) {
3583
- if (!this.canTokenTypeBeInsertedInRecovery(t) || K(e)) return !1;
3577
+ if (!this.canTokenTypeBeInsertedInRecovery(t) || z(e)) return !1;
3584
3578
  const n = this.LA(1);
3585
3579
  return Te(e, (r) => this.tokenMatcher(n, r)) !== void 0;
3586
3580
  }
@@ -3636,7 +3630,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
3636
3630
  }
3637
3631
  }, class {
3638
3632
  initLooksAhead(t) {
3639
- this.dynamicTokensEnabled = b(t, "dynamicTokensEnabled") ? t.dynamicTokensEnabled : zt.dynamicTokensEnabled, this.maxLookahead = b(t, "maxLookahead") ? t.maxLookahead : zt.maxLookahead, this.lookaheadStrategy = b(t, "lookaheadStrategy") ? t.lookaheadStrategy : new Vc({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
3633
+ this.dynamicTokensEnabled = b(t, "dynamicTokensEnabled") ? t.dynamicTokensEnabled : Kt.dynamicTokensEnabled, this.maxLookahead = b(t, "maxLookahead") ? t.maxLookahead : Kt.maxLookahead, this.lookaheadStrategy = b(t, "lookaheadStrategy") ? t.lookaheadStrategy : new Vc({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
3640
3634
  }
3641
3635
  preComputeLookaheadFunctions(t) {
3642
3636
  w(t, (e) => {
@@ -3683,7 +3677,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
3683
3677
  }
3684
3678
  }, class {
3685
3679
  initTreeBuilder(t) {
3686
- if (this.CST_STACK = [], this.outputCst = t.outputCst, this.nodeLocationTracking = b(t, "nodeLocationTracking") ? t.nodeLocationTracking : zt.nodeLocationTracking, this.outputCst) if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = ho, this.setNodeLocationFromNode = ho, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
3680
+ if (this.CST_STACK = [], this.outputCst = t.outputCst, this.nodeLocationTracking = b(t, "nodeLocationTracking") ? t.nodeLocationTracking : Kt.nodeLocationTracking, this.outputCst) if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = ho, this.setNodeLocationFromNode = ho, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
3687
3681
  else if (/onlyOffset/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = lo, this.setNodeLocationFromNode = lo, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleOnlyOffset, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRegular);
3688
3682
  else {
3689
3683
  if (!/none/i.test(this.nodeLocationTracking)) throw Error(`Invalid <nodeLocationTracking> config option: "${t.nodeLocationTracking}"`);
@@ -3739,7 +3733,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
3739
3733
  }, validateVisitor: function() {
3740
3734
  const i = (o = this, $e(k(gt(n, (s) => Yt(o[s]) === !1), (s) => ({ msg: `Missing visitor method: <${s}> on ${o.constructor.name} CST Visitor.`, type: Mr.MISSING_METHOD, methodName: s }))));
3741
3735
  var o;
3742
- if (!K(i)) {
3736
+ if (!z(i)) {
3743
3737
  const s = k(i, (a) => a.msg);
3744
3738
  throw Error(`Errors Detected in CST Visitor <${this.constructor.name}>:
3745
3739
  ${s.join(`
@@ -3822,7 +3816,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
3822
3816
  See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0
3823
3817
  For Further details.`);
3824
3818
  if (B(t)) {
3825
- if (K(t)) throw Error(`A Token Vocabulary cannot be empty.
3819
+ if (z(t)) throw Error(`A Token Vocabulary cannot be empty.
3826
3820
  Note that the first argument for the parser constructor
3827
3821
  is no longer a Token vector (since v4.0).`);
3828
3822
  if (typeof t[0].startOffset == "number") throw Error(`The Parser constructor no longer accepts a token vector as the first argument.
@@ -3838,7 +3832,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
3838
3832
  this.tokensMap = et(t);
3839
3833
  }
3840
3834
  this.tokensMap.EOF = ie;
3841
- const n = vt(b(t, "modes") ? Rt(Q(t.modes)) : Q(t), (r) => K(r.categoryMatches));
3835
+ const n = vt(b(t, "modes") ? Rt(Q(t.modes)) : Q(t), (r) => z(r.categoryMatches));
3842
3836
  this.tokenMatcher = n ? yn : Pe, He(Q(this.tokensMap));
3843
3837
  }
3844
3838
  defineRule(t, e, n) {
@@ -4358,7 +4352,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
4358
4352
  }
4359
4353
  }, class {
4360
4354
  initErrorHandler(t) {
4361
- this._errors = [], this.errorMessageProvider = b(t, "errorMessageProvider") ? t.errorMessageProvider : zt.errorMessageProvider;
4355
+ this._errors = [], this.errorMessageProvider = b(t, "errorMessageProvider") ? t.errorMessageProvider : Kt.errorMessageProvider;
4362
4356
  }
4363
4357
  SAVE_ERROR(t) {
4364
4358
  if (en(t)) return t.context = { ruleStack: this.getHumanReadableRuleStack(), ruleOccurrenceStack: et(this.RULE_OCCURRENCE_STACK) }, this._errors.push(t), t;
@@ -4509,7 +4503,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
4509
4503
  if (b(t, "traceInitPerf")) {
4510
4504
  const e = t.traceInitPerf, n = typeof e == "number";
4511
4505
  this.traceInitMaxIdent = n ? e : 1 / 0, this.traceInitPerf = n ? e > 0 : e;
4512
- } else this.traceInitMaxIdent = 0, this.traceInitPerf = zt.traceInitPerf;
4506
+ } else this.traceInitMaxIdent = 0, this.traceInitPerf = Kt.traceInitPerf;
4513
4507
  this.traceInitIndent = -1;
4514
4508
  }
4515
4509
  TRACE_INIT(t, e) {
@@ -4531,7 +4525,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
4531
4525
  });
4532
4526
  });
4533
4527
  class qc extends Ge {
4534
- constructor(e, n = zt) {
4528
+ constructor(e, n = Kt) {
4535
4529
  const r = et(n);
4536
4530
  r.outputCst = !1, super(e, r);
4537
4531
  }
@@ -4591,10 +4585,10 @@ const Qt = { boolean: 3, string: 2, number: 1 }, wu = (t, e) => {
4591
4585
  }, Gu = (t = null, e = null) => {
4592
4586
  const n = typeof t, r = typeof e;
4593
4587
  return n === r ? t <= e : Qt[n] <= Qt[r];
4594
- }, Ku = { type: se.Number, coerce: !0, includeBoolean: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, zu = { type: se.String, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, $s = { type: null, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, de = (t, e, n, r) => {
4588
+ }, zu = { type: se.Number, coerce: !0, includeBoolean: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, Ku = { type: se.String, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, $s = { type: null, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, de = (t, e, n, r) => {
4595
4589
  if (e !== null && e.colStart !== void 0 && (e = t.getValueAt(e.rowStart, e.colStart)), n !== null && n.colStart !== void 0 && (n = t.getValueAt(n.rowStart, n.colStart)), typeof e == "number" && typeof n == "number") return r(e, n);
4596
4590
  let i, o;
4597
- return e?.isIRange ? i = e : n?.isIRange && (o = n), i || o ? (i || (i = t.getRange(e)), i.broadcast(n, r, Ku).fillEmpty(0)) : (e = Ue(e, Fe(e, !0), se.Number, !0, !1), n = Ue(n, Fe(n, !0), se.Number, !0, !1), e instanceof D.Value ? e : n instanceof D.Value ? n : r(e, n));
4591
+ return e?.isIRange ? i = e : n?.isIRange && (o = n), i || o ? (i || (i = t.getRange(e)), i.broadcast(n, r, zu).fillEmpty(0)) : (e = Ue(e, Fe(e, !0), se.Number, !0, !1), n = Ue(n, Fe(n, !0), se.Number, !0, !1), e instanceof D.Value ? e : n instanceof D.Value ? n : r(e, n));
4598
4592
  }, he = (t, e, n, r) => {
4599
4593
  let i, o;
4600
4594
  return e !== null && e.colStart !== void 0 && (e = t.getValueAt(e.rowStart, e.colStart)), n !== null && n.colStart !== void 0 && (n = t.getValueAt(n.rowStart, n.colStart)), e?.isIRange ? (i = e, o = n) : n?.isIRange && (i = n, o = e), i ? i.broadcast(o, r, $s) : r(e, n);
@@ -4622,7 +4616,7 @@ const Qt = { boolean: 3, string: 2, number: 1 }, wu = (t, e) => {
4622
4616
  }, "&": (t, e, n) => ((r, i, o, s) => {
4623
4617
  if (i !== null && i.colStart !== void 0 && (i = r.getValueAt(i.rowStart, i.colStart)), o !== null && o.colStart !== void 0 && (o = r.getValueAt(o.rowStart, o.colStart)), typeof i == "string" && typeof o == "string") return s(i, o);
4624
4618
  let a, c;
4625
- return i?.isIRange ? a = i : o?.isIRange && (c = o), a || c ? (a || (a = r.getRange(i)), a.broadcast(o, s, zu)) : s(i = Ue(i, Fe(i, !0), se.String), o = Ue(o, Fe(o, !0), se.String));
4619
+ return i?.isIRange ? a = i : o?.isIRange && (c = o), a || c ? (a || (a = r.getRange(i)), a.broadcast(o, s, Ku)) : s(i = Ue(i, Fe(i, !0), se.String), o = Ue(o, Fe(o, !0), se.String));
4626
4620
  })(t, e, n, Fu), "=": (t, e, n) => he(t, e, n, Du), "<>": (t, e, n) => he(t, e, n, ju), ">": (t, e, n) => he(t, e, n, Bu), "<": (t, e, n) => he(t, e, n, Wu), ">=": (t, e, n) => he(t, e, n, $u), "<=": (t, e, n) => he(t, e, n, Gu) }, Hu = { "-": (t, e) => To("-", e), "+": (t, e) => To("+", e), "@": (t, e) => {
4627
4621
  if (!e || !e.isIReferenceRange) return e;
4628
4622
  const n = e.getCoords(), r = e, i = t.getPosition(), o = r.getHeight(), s = r.getWidth();
@@ -4698,7 +4692,7 @@ function vo(t) {
4698
4692
  function vn(t) {
4699
4693
  return { type: "error", value: t ? D.getBuiltInByLabel(t.toUpperCase()) : D.BuiltIn.Ref, inputs: null, isReference: !0 };
4700
4694
  }
4701
- function Ke(t, e) {
4695
+ function ze(t, e) {
4702
4696
  return function n(r, i) {
4703
4697
  const o = r.inputs;
4704
4698
  let s;
@@ -4714,14 +4708,14 @@ function Ke(t, e) {
4714
4708
  }(t, void 0) || this;
4715
4709
  }
4716
4710
  function dn(t, e) {
4717
- let n = 0, r = Ke(t, (g) => {
4711
+ let n = 0, r = ze(t, (g) => {
4718
4712
  const A = { ...g };
4719
4713
  return A.evalIndex = n++, A;
4720
4714
  });
4721
4715
  const i = new Array(n), o = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map();
4722
4716
  let a;
4723
4717
  const c = /* @__PURE__ */ new Map(), u = [], l = [];
4724
- r = Ke(r, (g, A) => {
4718
+ r = ze(r, (g, A) => {
4725
4719
  const v = g.type, f = g.evalIndex;
4726
4720
  if (i[f] = null, g.isReference) {
4727
4721
  const d = g, I = { node: g, index: c.size, op: null, value: null, inputs: null };
@@ -5215,7 +5209,7 @@ class Sl extends qc {
5215
5209
  const o = r.tokens;
5216
5210
  this.input = o, this.inputTextLength = n.length;
5217
5211
  const s = e.getPosition();
5218
- return this.position = s, this.astErrors = [], this.reset(), i = this.intersectOp(), i = Ke(i, (a, c) => {
5212
+ return this.position = s, this.astErrors = [], this.reset(), i = this.intersectOp(), i = ze(i, (a, c) => {
5219
5213
  let u = a.type;
5220
5214
  if (u === "function" && a.value && a.value.toUpperCase().startsWith("_XLFN.")) {
5221
5215
  const l = a.value.substring(6);
@@ -5260,7 +5254,7 @@ class Me {
5260
5254
  this._options = e, this._compiled = n;
5261
5255
  }
5262
5256
  getTextAt(e, n, r = !1) {
5263
- return r ? Ye(this._compiled.tokens) : Ks(this._compiled.tokens, e, n);
5257
+ return r ? Ye(this._compiled.tokens) : zs(this._compiled.tokens, e, n);
5264
5258
  }
5265
5259
  getTokens() {
5266
5260
  return this._compiled.tokens;
@@ -5308,7 +5302,7 @@ class Me {
5308
5302
  if (c.type !== "cell") throw a.op === "named" ? new Error("Cannot setReference for a named reference") : new Error(`Invalidate reference index: ${e}`);
5309
5303
  _ = c.evalIndex;
5310
5304
  }
5311
- const y = this._compiled.ast, p = Ke(y, (A) => {
5305
+ const y = this._compiled.ast, p = ze(y, (A) => {
5312
5306
  if (!A || !A.isReference) return;
5313
5307
  const v = A.type;
5314
5308
  if (!n && Ws.includes(A.value)) {
@@ -5400,7 +5394,7 @@ class Me {
5400
5394
  let a = this._compiled;
5401
5395
  if (n !== void 0) {
5402
5396
  let f;
5403
- if (Ke(a.ast, (d) => {
5397
+ if (ze(a.ast, (d) => {
5404
5398
  d.evalIndex === n && (f = d);
5405
5399
  }), !f) throw new Error(`Invalid evalIndex: ${n}`);
5406
5400
  a = dn(f, a.error);
@@ -5526,7 +5520,7 @@ class Me {
5526
5520
  if (i.type === "cell") return this;
5527
5521
  if (i.value === "@") return this;
5528
5522
  if (!r) return this;
5529
- const o = zs(n) + Vs(e);
5523
+ const o = Ks(n) + Vs(e);
5530
5524
  if (r.has(o)) return this;
5531
5525
  const s = dn(Ce("@", i, !0), this._compiled.error);
5532
5526
  return new Me(this._options, s);