@singapore-editor/typescript-lsp 0.1.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 (297) hide show
  1. package/README.md +60 -0
  2. package/dist/assets/lib.d-DwhWWR8Z.js +6 -0
  3. package/dist/assets/lib.d-DwhWWR8Z.js.map +1 -0
  4. package/dist/assets/lib.decorators.d-DuSR_GRf.js +6 -0
  5. package/dist/assets/lib.decorators.d-DuSR_GRf.js.map +1 -0
  6. package/dist/assets/lib.decorators.legacy.d-B-dDdcGG.js +6 -0
  7. package/dist/assets/lib.decorators.legacy.d-B-dDdcGG.js.map +1 -0
  8. package/dist/assets/lib.dom.asynciterable.d-_FO6ryQN.js +6 -0
  9. package/dist/assets/lib.dom.asynciterable.d-_FO6ryQN.js.map +1 -0
  10. package/dist/assets/lib.dom.d-FmoblYYX.js +6 -0
  11. package/dist/assets/lib.dom.d-FmoblYYX.js.map +1 -0
  12. package/dist/assets/lib.dom.iterable.d-ByLwU5Nr.js +6 -0
  13. package/dist/assets/lib.dom.iterable.d-ByLwU5Nr.js.map +1 -0
  14. package/dist/assets/lib.es2015.collection.d-Cn7GxvBn.js +6 -0
  15. package/dist/assets/lib.es2015.collection.d-Cn7GxvBn.js.map +1 -0
  16. package/dist/assets/lib.es2015.core.d-CEe5-Olc.js +6 -0
  17. package/dist/assets/lib.es2015.core.d-CEe5-Olc.js.map +1 -0
  18. package/dist/assets/lib.es2015.d-D32bg7tQ.js +6 -0
  19. package/dist/assets/lib.es2015.d-D32bg7tQ.js.map +1 -0
  20. package/dist/assets/lib.es2015.generator.d-dVupUz58.js +6 -0
  21. package/dist/assets/lib.es2015.generator.d-dVupUz58.js.map +1 -0
  22. package/dist/assets/lib.es2015.iterable.d-C7bZJblq.js +6 -0
  23. package/dist/assets/lib.es2015.iterable.d-C7bZJblq.js.map +1 -0
  24. package/dist/assets/lib.es2015.promise.d-IkGeTpDc.js +6 -0
  25. package/dist/assets/lib.es2015.promise.d-IkGeTpDc.js.map +1 -0
  26. package/dist/assets/lib.es2015.proxy.d-D0hDQX0s.js +6 -0
  27. package/dist/assets/lib.es2015.proxy.d-D0hDQX0s.js.map +1 -0
  28. package/dist/assets/lib.es2015.reflect.d-Civj_UqB.js +6 -0
  29. package/dist/assets/lib.es2015.reflect.d-Civj_UqB.js.map +1 -0
  30. package/dist/assets/lib.es2015.symbol.d-DsPpWPoL.js +6 -0
  31. package/dist/assets/lib.es2015.symbol.d-DsPpWPoL.js.map +1 -0
  32. package/dist/assets/lib.es2015.symbol.wellknown.d-BYA6t3Ou.js +6 -0
  33. package/dist/assets/lib.es2015.symbol.wellknown.d-BYA6t3Ou.js.map +1 -0
  34. package/dist/assets/lib.es2016.array.include.d-C2VMejUq.js +6 -0
  35. package/dist/assets/lib.es2016.array.include.d-C2VMejUq.js.map +1 -0
  36. package/dist/assets/lib.es2016.d-BAvWL1yx.js +6 -0
  37. package/dist/assets/lib.es2016.d-BAvWL1yx.js.map +1 -0
  38. package/dist/assets/lib.es2016.full.d-CpWlQUaG.js +6 -0
  39. package/dist/assets/lib.es2016.full.d-CpWlQUaG.js.map +1 -0
  40. package/dist/assets/lib.es2016.intl.d-BfaDvaD_.js +6 -0
  41. package/dist/assets/lib.es2016.intl.d-BfaDvaD_.js.map +1 -0
  42. package/dist/assets/lib.es2017.arraybuffer.d-BELbsRS9.js +6 -0
  43. package/dist/assets/lib.es2017.arraybuffer.d-BELbsRS9.js.map +1 -0
  44. package/dist/assets/lib.es2017.d-DuXequj2.js +6 -0
  45. package/dist/assets/lib.es2017.d-DuXequj2.js.map +1 -0
  46. package/dist/assets/lib.es2017.date.d-C0q0CGCg.js +6 -0
  47. package/dist/assets/lib.es2017.date.d-C0q0CGCg.js.map +1 -0
  48. package/dist/assets/lib.es2017.full.d-JLz-PuTJ.js +6 -0
  49. package/dist/assets/lib.es2017.full.d-JLz-PuTJ.js.map +1 -0
  50. package/dist/assets/lib.es2017.intl.d-DEp-bfPU.js +6 -0
  51. package/dist/assets/lib.es2017.intl.d-DEp-bfPU.js.map +1 -0
  52. package/dist/assets/lib.es2017.object.d-DF15QOh6.js +6 -0
  53. package/dist/assets/lib.es2017.object.d-DF15QOh6.js.map +1 -0
  54. package/dist/assets/lib.es2017.sharedmemory.d-MqnPgaR9.js +6 -0
  55. package/dist/assets/lib.es2017.sharedmemory.d-MqnPgaR9.js.map +1 -0
  56. package/dist/assets/lib.es2017.string.d-DwuC1fbX.js +6 -0
  57. package/dist/assets/lib.es2017.string.d-DwuC1fbX.js.map +1 -0
  58. package/dist/assets/lib.es2017.typedarrays.d-CpxkvFtX.js +6 -0
  59. package/dist/assets/lib.es2017.typedarrays.d-CpxkvFtX.js.map +1 -0
  60. package/dist/assets/lib.es2018.asyncgenerator.d-Wkg7fB38.js +6 -0
  61. package/dist/assets/lib.es2018.asyncgenerator.d-Wkg7fB38.js.map +1 -0
  62. package/dist/assets/lib.es2018.asynciterable.d-BvEk_5iX.js +6 -0
  63. package/dist/assets/lib.es2018.asynciterable.d-BvEk_5iX.js.map +1 -0
  64. package/dist/assets/lib.es2018.d-BXVwdGZO.js +6 -0
  65. package/dist/assets/lib.es2018.d-BXVwdGZO.js.map +1 -0
  66. package/dist/assets/lib.es2018.full.d-B4RmLSI2.js +6 -0
  67. package/dist/assets/lib.es2018.full.d-B4RmLSI2.js.map +1 -0
  68. package/dist/assets/lib.es2018.intl.d-BvDGuNYR.js +6 -0
  69. package/dist/assets/lib.es2018.intl.d-BvDGuNYR.js.map +1 -0
  70. package/dist/assets/lib.es2018.promise.d-YpJpwYZt.js +6 -0
  71. package/dist/assets/lib.es2018.promise.d-YpJpwYZt.js.map +1 -0
  72. package/dist/assets/lib.es2018.regexp.d-DyHDHf4h.js +6 -0
  73. package/dist/assets/lib.es2018.regexp.d-DyHDHf4h.js.map +1 -0
  74. package/dist/assets/lib.es2019.array.d-1R2LMNDY.js +6 -0
  75. package/dist/assets/lib.es2019.array.d-1R2LMNDY.js.map +1 -0
  76. package/dist/assets/lib.es2019.d-Bm-cqGUH.js +6 -0
  77. package/dist/assets/lib.es2019.d-Bm-cqGUH.js.map +1 -0
  78. package/dist/assets/lib.es2019.full.d-CffTH14l.js +6 -0
  79. package/dist/assets/lib.es2019.full.d-CffTH14l.js.map +1 -0
  80. package/dist/assets/lib.es2019.intl.d-BwWDxo8Q.js +6 -0
  81. package/dist/assets/lib.es2019.intl.d-BwWDxo8Q.js.map +1 -0
  82. package/dist/assets/lib.es2019.object.d-DrUh3ccl.js +6 -0
  83. package/dist/assets/lib.es2019.object.d-DrUh3ccl.js.map +1 -0
  84. package/dist/assets/lib.es2019.string.d-BwcA52yE.js +6 -0
  85. package/dist/assets/lib.es2019.string.d-BwcA52yE.js.map +1 -0
  86. package/dist/assets/lib.es2019.symbol.d-D3ev_C6r.js +6 -0
  87. package/dist/assets/lib.es2019.symbol.d-D3ev_C6r.js.map +1 -0
  88. package/dist/assets/lib.es2020.bigint.d-CsEdGRdM.js +6 -0
  89. package/dist/assets/lib.es2020.bigint.d-CsEdGRdM.js.map +1 -0
  90. package/dist/assets/lib.es2020.d-BLkjC8-i.js +6 -0
  91. package/dist/assets/lib.es2020.d-BLkjC8-i.js.map +1 -0
  92. package/dist/assets/lib.es2020.date.d-DwjUBhDu.js +6 -0
  93. package/dist/assets/lib.es2020.date.d-DwjUBhDu.js.map +1 -0
  94. package/dist/assets/lib.es2020.full.d-HlsaXVND.js +6 -0
  95. package/dist/assets/lib.es2020.full.d-HlsaXVND.js.map +1 -0
  96. package/dist/assets/lib.es2020.intl.d-CDBQbuQi.js +6 -0
  97. package/dist/assets/lib.es2020.intl.d-CDBQbuQi.js.map +1 -0
  98. package/dist/assets/lib.es2020.number.d-CpXrxse_.js +6 -0
  99. package/dist/assets/lib.es2020.number.d-CpXrxse_.js.map +1 -0
  100. package/dist/assets/lib.es2020.promise.d-DR0sx4yx.js +6 -0
  101. package/dist/assets/lib.es2020.promise.d-DR0sx4yx.js.map +1 -0
  102. package/dist/assets/lib.es2020.sharedmemory.d-8MrR7EO9.js +6 -0
  103. package/dist/assets/lib.es2020.sharedmemory.d-8MrR7EO9.js.map +1 -0
  104. package/dist/assets/lib.es2020.string.d-BI6oDFA_.js +6 -0
  105. package/dist/assets/lib.es2020.string.d-BI6oDFA_.js.map +1 -0
  106. package/dist/assets/lib.es2020.symbol.wellknown.d-ORwr4Bzq.js +6 -0
  107. package/dist/assets/lib.es2020.symbol.wellknown.d-ORwr4Bzq.js.map +1 -0
  108. package/dist/assets/lib.es2021.d-CNcCFNpS.js +6 -0
  109. package/dist/assets/lib.es2021.d-CNcCFNpS.js.map +1 -0
  110. package/dist/assets/lib.es2021.full.d-DTy0Vh8p.js +6 -0
  111. package/dist/assets/lib.es2021.full.d-DTy0Vh8p.js.map +1 -0
  112. package/dist/assets/lib.es2021.intl.d-CrCTzh3D.js +6 -0
  113. package/dist/assets/lib.es2021.intl.d-CrCTzh3D.js.map +1 -0
  114. package/dist/assets/lib.es2021.promise.d-BzlY8AcN.js +6 -0
  115. package/dist/assets/lib.es2021.promise.d-BzlY8AcN.js.map +1 -0
  116. package/dist/assets/lib.es2021.string.d-DIlLhmID.js +6 -0
  117. package/dist/assets/lib.es2021.string.d-DIlLhmID.js.map +1 -0
  118. package/dist/assets/lib.es2021.weakref.d-QzlMigs1.js +6 -0
  119. package/dist/assets/lib.es2021.weakref.d-QzlMigs1.js.map +1 -0
  120. package/dist/assets/lib.es2022.array.d-D5QvdSDD.js +6 -0
  121. package/dist/assets/lib.es2022.array.d-D5QvdSDD.js.map +1 -0
  122. package/dist/assets/lib.es2022.d-B09f-wCO.js +6 -0
  123. package/dist/assets/lib.es2022.d-B09f-wCO.js.map +1 -0
  124. package/dist/assets/lib.es2022.error.d-ErJH7uZr.js +6 -0
  125. package/dist/assets/lib.es2022.error.d-ErJH7uZr.js.map +1 -0
  126. package/dist/assets/lib.es2022.full.d-BwSEmz18.js +6 -0
  127. package/dist/assets/lib.es2022.full.d-BwSEmz18.js.map +1 -0
  128. package/dist/assets/lib.es2022.intl.d-BEoK-I_u.js +6 -0
  129. package/dist/assets/lib.es2022.intl.d-BEoK-I_u.js.map +1 -0
  130. package/dist/assets/lib.es2022.object.d-DsEI5S2q.js +6 -0
  131. package/dist/assets/lib.es2022.object.d-DsEI5S2q.js.map +1 -0
  132. package/dist/assets/lib.es2022.regexp.d-CUlcf2UB.js +6 -0
  133. package/dist/assets/lib.es2022.regexp.d-CUlcf2UB.js.map +1 -0
  134. package/dist/assets/lib.es2022.string.d-ILMy0npm.js +6 -0
  135. package/dist/assets/lib.es2022.string.d-ILMy0npm.js.map +1 -0
  136. package/dist/assets/lib.es2023.array.d-GeAK2at2.js +6 -0
  137. package/dist/assets/lib.es2023.array.d-GeAK2at2.js.map +1 -0
  138. package/dist/assets/lib.es2023.collection.d-p3gBlGib.js +6 -0
  139. package/dist/assets/lib.es2023.collection.d-p3gBlGib.js.map +1 -0
  140. package/dist/assets/lib.es2023.d-4j237g35.js +6 -0
  141. package/dist/assets/lib.es2023.d-4j237g35.js.map +1 -0
  142. package/dist/assets/lib.es2023.full.d-oRGXreDe.js +6 -0
  143. package/dist/assets/lib.es2023.full.d-oRGXreDe.js.map +1 -0
  144. package/dist/assets/lib.es2023.intl.d-CtTPndlG.js +6 -0
  145. package/dist/assets/lib.es2023.intl.d-CtTPndlG.js.map +1 -0
  146. package/dist/assets/lib.es2024.arraybuffer.d-DimtN4hG.js +6 -0
  147. package/dist/assets/lib.es2024.arraybuffer.d-DimtN4hG.js.map +1 -0
  148. package/dist/assets/lib.es2024.collection.d-DuFWux5x.js +6 -0
  149. package/dist/assets/lib.es2024.collection.d-DuFWux5x.js.map +1 -0
  150. package/dist/assets/lib.es2024.d-Bc4hm-li.js +6 -0
  151. package/dist/assets/lib.es2024.d-Bc4hm-li.js.map +1 -0
  152. package/dist/assets/lib.es2024.full.d-NcbrywaK.js +6 -0
  153. package/dist/assets/lib.es2024.full.d-NcbrywaK.js.map +1 -0
  154. package/dist/assets/lib.es2024.object.d-Defz7Oqn.js +6 -0
  155. package/dist/assets/lib.es2024.object.d-Defz7Oqn.js.map +1 -0
  156. package/dist/assets/lib.es2024.promise.d-DOyC5VIh.js +6 -0
  157. package/dist/assets/lib.es2024.promise.d-DOyC5VIh.js.map +1 -0
  158. package/dist/assets/lib.es2024.regexp.d-DBmYnpDO.js +6 -0
  159. package/dist/assets/lib.es2024.regexp.d-DBmYnpDO.js.map +1 -0
  160. package/dist/assets/lib.es2024.sharedmemory.d-CM9RzBcy.js +6 -0
  161. package/dist/assets/lib.es2024.sharedmemory.d-CM9RzBcy.js.map +1 -0
  162. package/dist/assets/lib.es2024.string.d-CBDt9d69.js +6 -0
  163. package/dist/assets/lib.es2024.string.d-CBDt9d69.js.map +1 -0
  164. package/dist/assets/lib.es2025.collection.d-CsJViaMe.js +6 -0
  165. package/dist/assets/lib.es2025.collection.d-CsJViaMe.js.map +1 -0
  166. package/dist/assets/lib.es2025.d-De4KdpN7.js +6 -0
  167. package/dist/assets/lib.es2025.d-De4KdpN7.js.map +1 -0
  168. package/dist/assets/lib.es2025.float16.d-HHOhRN2_.js +6 -0
  169. package/dist/assets/lib.es2025.float16.d-HHOhRN2_.js.map +1 -0
  170. package/dist/assets/lib.es2025.full.d-BYMP75tw.js +6 -0
  171. package/dist/assets/lib.es2025.full.d-BYMP75tw.js.map +1 -0
  172. package/dist/assets/lib.es2025.intl.d-DOt7rg8n.js +6 -0
  173. package/dist/assets/lib.es2025.intl.d-DOt7rg8n.js.map +1 -0
  174. package/dist/assets/lib.es2025.iterator.d-u_YfGeZS.js +6 -0
  175. package/dist/assets/lib.es2025.iterator.d-u_YfGeZS.js.map +1 -0
  176. package/dist/assets/lib.es2025.promise.d-UjV5L1SF.js +6 -0
  177. package/dist/assets/lib.es2025.promise.d-UjV5L1SF.js.map +1 -0
  178. package/dist/assets/lib.es2025.regexp.d-Cbb7_cyW.js +6 -0
  179. package/dist/assets/lib.es2025.regexp.d-Cbb7_cyW.js.map +1 -0
  180. package/dist/assets/lib.es5.d-C0w_nusg.js +6 -0
  181. package/dist/assets/lib.es5.d-C0w_nusg.js.map +1 -0
  182. package/dist/assets/lib.es6.d-BQntavOa.js +6 -0
  183. package/dist/assets/lib.es6.d-BQntavOa.js.map +1 -0
  184. package/dist/assets/lib.esnext.array.d-BK-E6Aii.js +6 -0
  185. package/dist/assets/lib.esnext.array.d-BK-E6Aii.js.map +1 -0
  186. package/dist/assets/lib.esnext.collection.d-Caob5U_3.js +6 -0
  187. package/dist/assets/lib.esnext.collection.d-Caob5U_3.js.map +1 -0
  188. package/dist/assets/lib.esnext.d-9bo74I0B.js +6 -0
  189. package/dist/assets/lib.esnext.d-9bo74I0B.js.map +1 -0
  190. package/dist/assets/lib.esnext.date.d-Bkhf31hB.js +6 -0
  191. package/dist/assets/lib.esnext.date.d-Bkhf31hB.js.map +1 -0
  192. package/dist/assets/lib.esnext.decorators.d-CkUHBEKX.js +6 -0
  193. package/dist/assets/lib.esnext.decorators.d-CkUHBEKX.js.map +1 -0
  194. package/dist/assets/lib.esnext.disposable.d-CdKd172C.js +6 -0
  195. package/dist/assets/lib.esnext.disposable.d-CdKd172C.js.map +1 -0
  196. package/dist/assets/lib.esnext.error.d-hRElv0o-.js +6 -0
  197. package/dist/assets/lib.esnext.error.d-hRElv0o-.js.map +1 -0
  198. package/dist/assets/lib.esnext.full.d-C5FEqlya.js +6 -0
  199. package/dist/assets/lib.esnext.full.d-C5FEqlya.js.map +1 -0
  200. package/dist/assets/lib.esnext.intl.d-5-FhAVp5.js +6 -0
  201. package/dist/assets/lib.esnext.intl.d-5-FhAVp5.js.map +1 -0
  202. package/dist/assets/lib.esnext.sharedmemory.d-NLKdJiUE.js +6 -0
  203. package/dist/assets/lib.esnext.sharedmemory.d-NLKdJiUE.js.map +1 -0
  204. package/dist/assets/lib.esnext.temporal.d-DEDOXuwe.js +6 -0
  205. package/dist/assets/lib.esnext.temporal.d-DEDOXuwe.js.map +1 -0
  206. package/dist/assets/lib.esnext.typedarrays.d-BTYT-3iT.js +6 -0
  207. package/dist/assets/lib.esnext.typedarrays.d-BTYT-3iT.js.map +1 -0
  208. package/dist/assets/lib.scripthost.d-BoWSdGmL.js +6 -0
  209. package/dist/assets/lib.scripthost.d-BoWSdGmL.js.map +1 -0
  210. package/dist/assets/lib.webworker.asynciterable.d-CArLMv6Z.js +6 -0
  211. package/dist/assets/lib.webworker.asynciterable.d-CArLMv6Z.js.map +1 -0
  212. package/dist/assets/lib.webworker.d-BckFvR1K.js +6 -0
  213. package/dist/assets/lib.webworker.d-BckFvR1K.js.map +1 -0
  214. package/dist/assets/lib.webworker.importscripts.d-Dq_4ibTw.js +6 -0
  215. package/dist/assets/lib.webworker.importscripts.d-Dq_4ibTw.js.map +1 -0
  216. package/dist/assets/lib.webworker.iterable.d-BnZb0_R7.js +6 -0
  217. package/dist/assets/lib.webworker.iterable.d-BnZb0_R7.js.map +1 -0
  218. package/dist/assets/typescriptLsp.worker-Dv5GKuEN.js +150440 -0
  219. package/dist/assets/typescriptLsp.worker-Dv5GKuEN.js.map +1 -0
  220. package/dist/index.d.ts +9 -0
  221. package/dist/index.d.ts.map +1 -0
  222. package/dist/index.js +6 -0
  223. package/dist/paths.d.ts +4 -0
  224. package/dist/paths.d.ts.map +1 -0
  225. package/dist/paths.js +34 -0
  226. package/dist/paths.js.map +1 -0
  227. package/dist/plugin.d.ts +29 -0
  228. package/dist/plugin.d.ts.map +1 -0
  229. package/dist/plugin.js +140 -0
  230. package/dist/plugin.js.map +1 -0
  231. package/dist/pluginWithWorker.d.ts +3 -0
  232. package/dist/pluginWithWorker.d.ts.map +1 -0
  233. package/dist/pluginWithWorker.js +13 -0
  234. package/dist/pluginWithWorker.js.map +1 -0
  235. package/dist/server.d.ts +14 -0
  236. package/dist/server.d.ts.map +1 -0
  237. package/dist/server.js +50 -0
  238. package/dist/server.js.map +1 -0
  239. package/dist/tsDiagnostics.d.ts +5 -0
  240. package/dist/tsDiagnostics.d.ts.map +1 -0
  241. package/dist/tsDiagnostics.js +46 -0
  242. package/dist/tsDiagnostics.js.map +1 -0
  243. package/dist/types.d.ts +78 -0
  244. package/dist/types.d.ts.map +1 -0
  245. package/dist/typescriptLsp.worker.d.ts +2 -0
  246. package/dist/typescriptLsp.worker.d.ts.map +1 -0
  247. package/dist/worker/bundledLibraries.d.ts +4 -0
  248. package/dist/worker/bundledLibraries.d.ts.map +1 -0
  249. package/dist/worker/codeActions.d.ts +5 -0
  250. package/dist/worker/codeActions.d.ts.map +1 -0
  251. package/dist/worker/completion.d.ts +11 -0
  252. package/dist/worker/completion.d.ts.map +1 -0
  253. package/dist/worker/context.d.ts +39 -0
  254. package/dist/worker/context.d.ts.map +1 -0
  255. package/dist/worker/customMethods.d.ts +10 -0
  256. package/dist/worker/customMethods.d.ts.map +1 -0
  257. package/dist/worker/customMethods.js +14 -0
  258. package/dist/worker/customMethods.js.map +1 -0
  259. package/dist/worker/diagnostics.d.ts +11 -0
  260. package/dist/worker/diagnostics.d.ts.map +1 -0
  261. package/dist/worker/edits.d.ts +10 -0
  262. package/dist/worker/edits.d.ts.map +1 -0
  263. package/dist/worker/formatting.d.ts +16 -0
  264. package/dist/worker/formatting.d.ts.map +1 -0
  265. package/dist/worker/hover.d.ts +7 -0
  266. package/dist/worker/hover.d.ts.map +1 -0
  267. package/dist/worker/libraries.d.ts +16 -0
  268. package/dist/worker/libraries.d.ts.map +1 -0
  269. package/dist/worker/lineIndex.d.ts +21 -0
  270. package/dist/worker/lineIndex.d.ts.map +1 -0
  271. package/dist/worker/navigation.d.ts +9 -0
  272. package/dist/worker/navigation.d.ts.map +1 -0
  273. package/dist/worker/project.d.ts +26 -0
  274. package/dist/worker/project.d.ts.map +1 -0
  275. package/dist/worker/projectHost.d.ts +29 -0
  276. package/dist/worker/projectHost.d.ts.map +1 -0
  277. package/dist/worker/protocol.d.ts +29 -0
  278. package/dist/worker/protocol.d.ts.map +1 -0
  279. package/dist/worker/rename.d.ts +9 -0
  280. package/dist/worker/rename.d.ts.map +1 -0
  281. package/dist/worker/semanticTokens.d.ts +47 -0
  282. package/dist/worker/semanticTokens.d.ts.map +1 -0
  283. package/dist/worker/session.d.ts +14 -0
  284. package/dist/worker/session.d.ts.map +1 -0
  285. package/dist/worker/signatureHelp.d.ts +10 -0
  286. package/dist/worker/signatureHelp.d.ts.map +1 -0
  287. package/dist/worker/symbols.d.ts +10 -0
  288. package/dist/worker/symbols.d.ts.map +1 -0
  289. package/dist/workerOwner.d.ts +44 -0
  290. package/dist/workerOwner.d.ts.map +1 -0
  291. package/dist/workerOwner.js +143 -0
  292. package/dist/workerOwner.js.map +1 -0
  293. package/dist/workspace.d.ts +20 -0
  294. package/dist/workspace.d.ts.map +1 -0
  295. package/dist/workspace.js +74 -0
  296. package/dist/workspace.js.map +1 -0
  297. package/package.json +59 -0
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2021.string.d-DIlLhmID.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2021.weakref.d.ts?raw
2
+ var lib_es2021_weakref_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2015.symbol.wellknown\" />\n\ninterface WeakRef<T extends WeakKey> {\n readonly [Symbol.toStringTag]: \"WeakRef\";\n\n /**\n * Returns the WeakRef instance's target value, or undefined if the target value has been\n * reclaimed.\n * In es2023 the value can be either a symbol or an object, in previous versions only object is permissible.\n */\n deref(): T | undefined;\n}\n\ninterface WeakRefConstructor {\n readonly prototype: WeakRef<any>;\n\n /**\n * Creates a WeakRef instance for the given target value.\n * In es2023 the value can be either a symbol or an object, in previous versions only object is permissible.\n * @param target The target value for the WeakRef instance.\n */\n new <T extends WeakKey>(target: T): WeakRef<T>;\n}\n\ndeclare var WeakRef: WeakRefConstructor;\n\ninterface FinalizationRegistry<T> {\n readonly [Symbol.toStringTag]: \"FinalizationRegistry\";\n\n /**\n * Registers a value with the registry.\n * In es2023 the value can be either a symbol or an object, in previous versions only object is permissible.\n * @param target The target value to register.\n * @param heldValue The value to pass to the finalizer for this value. This cannot be the\n * target value.\n * @param unregisterToken The token to pass to the unregister method to unregister the target\n * value. If not provided, the target cannot be unregistered.\n */\n register(target: WeakKey, heldValue: T, unregisterToken?: WeakKey): void;\n\n /**\n * Unregisters a value from the registry.\n * In es2023 the value can be either a symbol or an object, in previous versions only object is permissible.\n * @param unregisterToken The token that was used as the unregisterToken argument when calling\n * register to register the target value.\n */\n unregister(unregisterToken: WeakKey): boolean;\n}\n\ninterface FinalizationRegistryConstructor {\n readonly prototype: FinalizationRegistry<any>;\n\n /**\n * Creates a finalization registry with an associated cleanup callback\n * @param cleanupCallback The callback to call after a value in the registry has been reclaimed.\n */\n new <T>(cleanupCallback: (heldValue: T) => void): FinalizationRegistry<T>;\n}\n\ndeclare var FinalizationRegistry: FinalizationRegistryConstructor;\n";
3
+ //#endregion
4
+ export { lib_es2021_weakref_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2021.weakref.d-QzlMigs1.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2021.weakref.d-QzlMigs1.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.array.d.ts?raw
2
+ var lib_es2022_array_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface Array<T> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): T | undefined;\n}\n\ninterface ReadonlyArray<T> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): T | undefined;\n}\n\ninterface Int8Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint8Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint8ClampedArray<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Int16Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint16Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Int32Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint32Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Float32Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Float64Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface BigInt64Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): bigint | undefined;\n}\n\ninterface BigUint64Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): bigint | undefined;\n}\n";
3
+ //#endregion
4
+ export { lib_es2022_array_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.array.d-D5QvdSDD.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.array.d-D5QvdSDD.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.d.ts?raw
2
+ var lib_es2022_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2021\" />\n/// <reference lib=\"es2022.array\" />\n/// <reference lib=\"es2022.error\" />\n/// <reference lib=\"es2022.intl\" />\n/// <reference lib=\"es2022.object\" />\n/// <reference lib=\"es2022.regexp\" />\n/// <reference lib=\"es2022.string\" />\n";
3
+ //#endregion
4
+ export { lib_es2022_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.d-B09f-wCO.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.d-B09f-wCO.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.error.d.ts?raw
2
+ var lib_es2022_error_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2021.promise\" />\n\ninterface ErrorOptions {\n cause?: unknown;\n}\n\ninterface Error {\n cause?: unknown;\n}\n\ninterface ErrorConstructor {\n new (message?: string, options?: ErrorOptions): Error;\n (message?: string, options?: ErrorOptions): Error;\n}\n\ninterface EvalErrorConstructor {\n new (message?: string, options?: ErrorOptions): EvalError;\n (message?: string, options?: ErrorOptions): EvalError;\n}\n\ninterface RangeErrorConstructor {\n new (message?: string, options?: ErrorOptions): RangeError;\n (message?: string, options?: ErrorOptions): RangeError;\n}\n\ninterface ReferenceErrorConstructor {\n new (message?: string, options?: ErrorOptions): ReferenceError;\n (message?: string, options?: ErrorOptions): ReferenceError;\n}\n\ninterface SyntaxErrorConstructor {\n new (message?: string, options?: ErrorOptions): SyntaxError;\n (message?: string, options?: ErrorOptions): SyntaxError;\n}\n\ninterface TypeErrorConstructor {\n new (message?: string, options?: ErrorOptions): TypeError;\n (message?: string, options?: ErrorOptions): TypeError;\n}\n\ninterface URIErrorConstructor {\n new (message?: string, options?: ErrorOptions): URIError;\n (message?: string, options?: ErrorOptions): URIError;\n}\n\ninterface AggregateErrorConstructor {\n new (\n errors: Iterable<any>,\n message?: string,\n options?: ErrorOptions,\n ): AggregateError;\n (\n errors: Iterable<any>,\n message?: string,\n options?: ErrorOptions,\n ): AggregateError;\n}\n";
3
+ //#endregion
4
+ export { lib_es2022_error_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.error.d-ErJH7uZr.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.error.d-ErJH7uZr.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.full.d.ts?raw
2
+ var lib_es2022_full_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2022\" />\n/// <reference lib=\"dom\" />\n/// <reference lib=\"webworker.importscripts\" />\n/// <reference lib=\"scripthost\" />\n/// <reference lib=\"dom.iterable\" />\n/// <reference lib=\"dom.asynciterable\" />\n";
3
+ //#endregion
4
+ export { lib_es2022_full_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.full.d-BwSEmz18.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.full.d-BwSEmz18.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.intl.d.ts?raw
2
+ var lib_es2022_intl_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ndeclare namespace Intl {\n /**\n * An object with some or all properties of the `Intl.Segmenter` constructor `options` parameter.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/Segmenter#parameters)\n */\n interface SegmenterOptions {\n /** The locale matching algorithm to use. For information about this option, see [Intl page](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_negotiation). */\n localeMatcher?: \"best fit\" | \"lookup\" | undefined;\n /** The type of input to be split */\n granularity?: \"grapheme\" | \"word\" | \"sentence\" | undefined;\n }\n\n /**\n * The `Intl.Segmenter` object enables locale-sensitive text segmentation, enabling you to get meaningful items (graphemes, words or sentences) from a string.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter)\n */\n interface Segmenter {\n /**\n * Returns `Segments` object containing the segments of the input string, using the segmenter's locale and granularity.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/segment)\n *\n * @param input - The text to be segmented as a `string`.\n *\n * @returns A new iterable Segments object containing the segments of the input string, using the segmenter's locale and granularity.\n */\n segment(input: string): Segments;\n /**\n * The `resolvedOptions()` method of `Intl.Segmenter` instances returns a new object with properties reflecting the options computed during initialization of this `Segmenter` object.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/resolvedOptions)\n */\n resolvedOptions(): ResolvedSegmenterOptions;\n }\n\n interface ResolvedSegmenterOptions {\n locale: string;\n granularity: \"grapheme\" | \"word\" | \"sentence\";\n }\n\n interface SegmentIterator<T> extends IteratorObject<T, BuiltinIteratorReturn, unknown> {\n [Symbol.iterator](): SegmentIterator<T>;\n }\n\n /**\n * A `Segments` object is an iterable collection of the segments of a text string. It is returned by a call to the `segment()` method of an `Intl.Segmenter` object.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/segment/Segments)\n */\n interface Segments {\n /**\n * Returns an object describing the segment in the original string that includes the code unit at a specified index.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/segment/Segments/containing)\n *\n * @param codeUnitIndex - A number specifying the index of the code unit in the original input string. If the value is omitted, it defaults to `0`.\n */\n containing(codeUnitIndex?: number): SegmentData | undefined;\n\n /** Returns an iterator to iterate over the segments. */\n [Symbol.iterator](): SegmentIterator<SegmentData>;\n }\n\n interface SegmentData {\n /** A string containing the segment extracted from the original input string. */\n segment: string;\n /** The code unit index in the original input string at which the segment begins. */\n index: number;\n /** The complete input string that was segmented. */\n input: string;\n /**\n * A boolean value only if granularity is \"word\"; otherwise, undefined.\n * If granularity is \"word\", then isWordLike is true when the segment is word-like (i.e., consists of letters/numbers/ideographs/etc.); otherwise, false.\n */\n isWordLike?: boolean;\n }\n\n /**\n * The `Intl.Segmenter` object enables locale-sensitive text segmentation, enabling you to get meaningful items (graphemes, words or sentences) from a string.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter)\n */\n const Segmenter: {\n prototype: Segmenter;\n\n /**\n * Creates a new `Intl.Segmenter` object.\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the `locales` argument,\n * see the [`Intl` page](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options - An [object](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/Segmenter#parameters)\n * with some or all options of `SegmenterOptions`.\n *\n * @returns [Intl.Segmenter](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segments) object.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter).\n */\n new (locales?: LocalesArgument, options?: SegmenterOptions): Segmenter;\n\n /**\n * Returns an array containing those of the provided locales that are supported without having to fall back to the runtime's default locale.\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the `locales` argument,\n * see the [`Intl` page](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options An [object](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/supportedLocalesOf#parameters).\n * with some or all possible options.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/supportedLocalesOf)\n */\n supportedLocalesOf(locales: LocalesArgument, options?: Pick<SegmenterOptions, \"localeMatcher\">): UnicodeBCP47LocaleIdentifier[];\n };\n\n /**\n * Returns a sorted array of the supported collation, calendar, currency, numbering system, timezones, and units by the implementation.\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl/supportedValuesOf)\n *\n * @param key A string indicating the category of values to return.\n * @returns A sorted array of the supported values.\n */\n function supportedValuesOf(key: \"calendar\" | \"collation\" | \"currency\" | \"numberingSystem\" | \"timeZone\" | \"unit\"): string[];\n}\n";
3
+ //#endregion
4
+ export { lib_es2022_intl_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.intl.d-BEoK-I_u.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.intl.d-BEoK-I_u.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.object.d.ts?raw
2
+ var lib_es2022_object_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface ObjectConstructor {\n /**\n * Determines whether an object has a property with the specified name.\n * @param o An object.\n * @param v A property name.\n */\n hasOwn(o: object, v: PropertyKey): boolean;\n}\n";
3
+ //#endregion
4
+ export { lib_es2022_object_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.object.d-DsEI5S2q.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.object.d-DsEI5S2q.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.regexp.d.ts?raw
2
+ var lib_es2022_regexp_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface RegExpMatchArray {\n indices?: RegExpIndicesArray;\n}\n\ninterface RegExpExecArray {\n indices?: RegExpIndicesArray;\n}\n\ninterface RegExpIndicesArray extends Array<[number, number] | undefined> {\n groups?: {\n [key: string]: [number, number];\n };\n}\n\ninterface RegExp {\n /**\n * Returns a Boolean value indicating the state of the hasIndices flag (d) used with a regular expression.\n * Default is false. Read-only.\n */\n readonly hasIndices: boolean;\n}\n";
3
+ //#endregion
4
+ export { lib_es2022_regexp_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.regexp.d-CUlcf2UB.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.regexp.d-CUlcf2UB.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2022.string.d.ts?raw
2
+ var lib_es2022_string_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface String {\n /**\n * Returns a new String consisting of the single UTF-16 code unit located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): string | undefined;\n}\n";
3
+ //#endregion
4
+ export { lib_es2022_string_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2022.string.d-ILMy0npm.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2022.string.d-ILMy0npm.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2023.array.d.ts?raw
2
+ var lib_es2023_array_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface Array<T> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends T>(predicate: (value: T, index: number, array: T[]) => value is S, thisArg?: any): S | undefined;\n findLast(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): T | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): number;\n\n /**\n * Returns a copy of an array with its elements reversed.\n */\n toReversed(): T[];\n\n /**\n * Returns a copy of an array with its elements sorted.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending, UTF-16 code unit order.\n * ```ts\n * [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: T, b: T) => number): T[];\n\n /**\n * Copies an array and removes elements and, if necessary, inserts new elements in their place. Returns the copied array.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @param items Elements to insert into the copied array in place of the deleted elements.\n * @returns The copied array.\n */\n toSpliced(start: number, deleteCount: number, ...items: T[]): T[];\n\n /**\n * Copies an array and removes elements while returning the remaining elements.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @returns A copy of the original array with the remaining elements.\n */\n toSpliced(start: number, deleteCount?: number): T[];\n\n /**\n * Copies an array, then overwrites the value at the provided index with the\n * given value. If the index is negative, then it replaces from the end\n * of the array.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to write into the copied array.\n * @returns The copied array with the updated value.\n */\n with(index: number, value: T): T[];\n}\n\ninterface ReadonlyArray<T> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends T>(\n predicate: (value: T, index: number, array: readonly T[]) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: T, index: number, array: readonly T[]) => unknown,\n thisArg?: any,\n ): T | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: T, index: number, array: readonly T[]) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copied array with all of its elements reversed.\n */\n toReversed(): T[];\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending, UTF-16 code unit order.\n * ```ts\n * [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: T, b: T) => number): T[];\n\n /**\n * Copies an array and removes elements while, if necessary, inserting new elements in their place, returning the remaining elements.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @param items Elements to insert into the copied array in place of the deleted elements.\n * @returns A copy of the original array with the remaining elements.\n */\n toSpliced(start: number, deleteCount: number, ...items: T[]): T[];\n\n /**\n * Copies an array and removes elements while returning the remaining elements.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @returns A copy of the original array with the remaining elements.\n */\n toSpliced(start: number, deleteCount?: number): T[];\n\n /**\n * Copies an array, then overwrites the value at the provided index with the\n * given value. If the index is negative, then it replaces from the end\n * of the array\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: T): T[];\n}\n\ninterface Int8Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Int8Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Int8Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Int8Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Int8Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Int8Array<ArrayBuffer>;\n}\n\ninterface Uint8Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint8Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint8Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint8Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint8Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint8Array<ArrayBuffer>;\n}\n\ninterface Uint8ClampedArray<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint8ClampedArray<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint8ClampedArray.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint8ClampedArray(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint8ClampedArray<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint8ClampedArray<ArrayBuffer>;\n}\n\ninterface Int16Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Int16Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Int16Array.from([11, 2, -22, 1]);\n * myNums.toSorted((a, b) => a - b) // Int16Array(4) [-22, 1, 2, 11]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Int16Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Int16Array<ArrayBuffer>;\n}\n\ninterface Uint16Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint16Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint16Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint16Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint16Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint16Array<ArrayBuffer>;\n}\n\ninterface Int32Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: this) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Int32Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Int32Array.from([11, 2, -22, 1]);\n * myNums.toSorted((a, b) => a - b) // Int32Array(4) [-22, 1, 2, 11]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Int32Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Int32Array<ArrayBuffer>;\n}\n\ninterface Uint32Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint32Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint32Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint32Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint32Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint32Array<ArrayBuffer>;\n}\n\ninterface Float32Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Float32Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Float32Array.from([11.25, 2, -22.5, 1]);\n * myNums.toSorted((a, b) => a - b) // Float32Array(4) [-22.5, 1, 2, 11.5]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Float32Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Float32Array<ArrayBuffer>;\n}\n\ninterface Float64Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Float64Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Float64Array.from([11.25, 2, -22.5, 1]);\n * myNums.toSorted((a, b) => a - b) // Float64Array(4) [-22.5, 1, 2, 11.5]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Float64Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Float64Array<ArrayBuffer>;\n}\n\ninterface BigInt64Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends bigint>(\n predicate: (\n value: bigint,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: bigint,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): bigint | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: bigint,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): BigInt64Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = BigInt64Array.from([11n, 2n, -22n, 1n]);\n * myNums.toSorted((a, b) => Number(a - b)) // BigInt64Array(4) [-22n, 1n, 2n, 11n]\n * ```\n */\n toSorted(compareFn?: (a: bigint, b: bigint) => number): BigInt64Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given bigint at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: bigint): BigInt64Array<ArrayBuffer>;\n}\n\ninterface BigUint64Array<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends bigint>(\n predicate: (\n value: bigint,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: bigint,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): bigint | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: bigint,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): BigUint64Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = BigUint64Array.from([11n, 2n, 22n, 1n]);\n * myNums.toSorted((a, b) => Number(a - b)) // BigUint64Array(4) [1n, 2n, 11n, 22n]\n * ```\n */\n toSorted(compareFn?: (a: bigint, b: bigint) => number): BigUint64Array<ArrayBuffer>;\n\n /**\n * Copies the array and inserts the given bigint at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: bigint): BigUint64Array<ArrayBuffer>;\n}\n";
3
+ //#endregion
4
+ export { lib_es2023_array_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2023.array.d-GeAK2at2.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2023.array.d-GeAK2at2.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2023.collection.d.ts?raw
2
+ var lib_es2023_collection_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface WeakKeyTypes {\n symbol: symbol;\n}\n";
3
+ //#endregion
4
+ export { lib_es2023_collection_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2023.collection.d-p3gBlGib.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2023.collection.d-p3gBlGib.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2023.d.ts?raw
2
+ var lib_es2023_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2022\" />\n/// <reference lib=\"es2023.array\" />\n/// <reference lib=\"es2023.collection\" />\n/// <reference lib=\"es2023.intl\" />\n";
3
+ //#endregion
4
+ export { lib_es2023_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2023.d-4j237g35.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2023.d-4j237g35.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2023.full.d.ts?raw
2
+ var lib_es2023_full_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2023\" />\n/// <reference lib=\"dom\" />\n/// <reference lib=\"webworker.importscripts\" />\n/// <reference lib=\"scripthost\" />\n/// <reference lib=\"dom.iterable\" />\n/// <reference lib=\"dom.asynciterable\" />\n";
3
+ //#endregion
4
+ export { lib_es2023_full_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2023.full.d-oRGXreDe.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2023.full.d-oRGXreDe.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2023.intl.d.ts?raw
2
+ var lib_es2023_intl_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ndeclare namespace Intl {\n interface NumberFormatOptionsUseGroupingRegistry {\n min2: never;\n auto: never;\n always: never;\n }\n\n interface NumberFormatOptionsSignDisplayRegistry {\n negative: never;\n }\n\n interface NumberFormatRangePartTypeRegistry extends NumberFormatPartTypeRegistry {\n approximatelySign: never;\n }\n\n type NumberFormatRangePartTypes = keyof NumberFormatRangePartTypeRegistry;\n\n interface NumberFormatOptions {\n roundingPriority?: \"auto\" | \"morePrecision\" | \"lessPrecision\" | undefined;\n roundingIncrement?: 1 | 2 | 5 | 10 | 20 | 25 | 50 | 100 | 200 | 250 | 500 | 1000 | 2000 | 2500 | 5000 | undefined;\n roundingMode?: \"ceil\" | \"floor\" | \"expand\" | \"trunc\" | \"halfCeil\" | \"halfFloor\" | \"halfExpand\" | \"halfTrunc\" | \"halfEven\" | undefined;\n trailingZeroDisplay?: \"auto\" | \"stripIfInteger\" | undefined;\n }\n\n interface ResolvedNumberFormatOptions {\n roundingPriority: \"auto\" | \"morePrecision\" | \"lessPrecision\";\n roundingMode: \"ceil\" | \"floor\" | \"expand\" | \"trunc\" | \"halfCeil\" | \"halfFloor\" | \"halfExpand\" | \"halfTrunc\" | \"halfEven\";\n roundingIncrement: 1 | 2 | 5 | 10 | 20 | 25 | 50 | 100 | 200 | 250 | 500 | 1000 | 2000 | 2500 | 5000;\n trailingZeroDisplay: \"auto\" | \"stripIfInteger\";\n }\n\n interface NumberRangeFormatPart {\n type: NumberFormatRangePartTypes;\n value: string;\n source: \"startRange\" | \"endRange\" | \"shared\";\n }\n\n type StringNumericLiteral = `${number}` | \"Infinity\" | \"-Infinity\" | \"+Infinity\";\n\n interface NumberFormat {\n format(value: number | bigint | StringNumericLiteral): string;\n formatToParts(value: number | bigint | StringNumericLiteral): NumberFormatPart[];\n formatRange(start: number | bigint | StringNumericLiteral, end: number | bigint | StringNumericLiteral): string;\n formatRangeToParts(start: number | bigint | StringNumericLiteral, end: number | bigint | StringNumericLiteral): NumberRangeFormatPart[];\n }\n}\n";
3
+ //#endregion
4
+ export { lib_es2023_intl_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2023.intl.d-CtTPndlG.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2023.intl.d-CtTPndlG.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.arraybuffer.d.ts?raw
2
+ var lib_es2024_arraybuffer_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface ArrayBuffer {\n /**\n * If this ArrayBuffer is resizable, returns the maximum byte length given during construction; returns the byte length if not.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/maxByteLength)\n */\n get maxByteLength(): number;\n\n /**\n * Returns true if this ArrayBuffer can be resized.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/resizable)\n */\n get resizable(): boolean;\n\n /**\n * Resizes the ArrayBuffer to the specified size (in bytes).\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/resize)\n */\n resize(newByteLength?: number): void;\n\n /**\n * Returns a boolean indicating whether or not this buffer has been detached (transferred).\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/detached)\n */\n get detached(): boolean;\n\n /**\n * Creates a new ArrayBuffer with the same byte content as this buffer, then detaches this buffer.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/transfer)\n */\n transfer(newByteLength?: number): ArrayBuffer;\n\n /**\n * Creates a new non-resizable ArrayBuffer with the same byte content as this buffer, then detaches this buffer.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer/transferToFixedLength)\n */\n transferToFixedLength(newByteLength?: number): ArrayBuffer;\n}\n\ninterface ArrayBufferConstructor {\n new (byteLength: number, options?: { maxByteLength?: number; }): ArrayBuffer;\n}\n";
3
+ //#endregion
4
+ export { lib_es2024_arraybuffer_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.arraybuffer.d-DimtN4hG.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.arraybuffer.d-DimtN4hG.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.collection.d.ts?raw
2
+ var lib_es2024_collection_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface MapConstructor {\n /**\n * Groups members of an iterable according to the return value of the passed callback.\n * @param items An iterable.\n * @param keySelector A callback which will be invoked for each item in items.\n */\n groupBy<K, T>(\n items: Iterable<T>,\n keySelector: (item: T, index: number) => K,\n ): Map<K, T[]>;\n}\n";
3
+ //#endregion
4
+ export { lib_es2024_collection_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.collection.d-DuFWux5x.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.collection.d-DuFWux5x.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.d.ts?raw
2
+ var lib_es2024_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2023\" />\n/// <reference lib=\"es2024.arraybuffer\" />\n/// <reference lib=\"es2024.collection\" />\n/// <reference lib=\"es2024.object\" />\n/// <reference lib=\"es2024.promise\" />\n/// <reference lib=\"es2024.regexp\" />\n/// <reference lib=\"es2024.sharedmemory\" />\n/// <reference lib=\"es2024.string\" />\n";
3
+ //#endregion
4
+ export { lib_es2024_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.d-Bc4hm-li.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.d-Bc4hm-li.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.full.d.ts?raw
2
+ var lib_es2024_full_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2024\" />\n/// <reference lib=\"dom\" />\n/// <reference lib=\"webworker.importscripts\" />\n/// <reference lib=\"scripthost\" />\n/// <reference lib=\"dom.iterable\" />\n/// <reference lib=\"dom.asynciterable\" />\n";
3
+ //#endregion
4
+ export { lib_es2024_full_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.full.d-NcbrywaK.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.full.d-NcbrywaK.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.object.d.ts?raw
2
+ var lib_es2024_object_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface ObjectConstructor {\n /**\n * Groups members of an iterable according to the return value of the passed callback.\n * @param items An iterable.\n * @param keySelector A callback which will be invoked for each item in items.\n */\n groupBy<K extends PropertyKey, T>(\n items: Iterable<T>,\n keySelector: (item: T, index: number) => K,\n ): Partial<Record<K, T[]>>;\n}\n";
3
+ //#endregion
4
+ export { lib_es2024_object_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.object.d-Defz7Oqn.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.object.d-Defz7Oqn.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.promise.d.ts?raw
2
+ var lib_es2024_promise_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface PromiseWithResolvers<T> {\n promise: Promise<T>;\n resolve: (value: T | PromiseLike<T>) => void;\n reject: (reason?: any) => void;\n}\n\ninterface PromiseConstructor {\n /**\n * Creates a new Promise and returns it in an object, along with its resolve and reject functions.\n * @returns An object with the properties `promise`, `resolve`, and `reject`.\n *\n * ```ts\n * const { promise, resolve, reject } = Promise.withResolvers<T>();\n * ```\n */\n withResolvers<T>(): PromiseWithResolvers<T>;\n}\n";
3
+ //#endregion
4
+ export { lib_es2024_promise_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.promise.d-DOyC5VIh.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.promise.d-DOyC5VIh.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.regexp.d.ts?raw
2
+ var lib_es2024_regexp_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface RegExp {\n /**\n * Returns a Boolean value indicating the state of the unicodeSets flag (v) used with a regular expression.\n * Default is false. Read-only.\n */\n readonly unicodeSets: boolean;\n}\n";
3
+ //#endregion
4
+ export { lib_es2024_regexp_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.regexp.d-DBmYnpDO.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.regexp.d-DBmYnpDO.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.sharedmemory.d.ts?raw
2
+ var lib_es2024_sharedmemory_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2020.bigint\" />\n\ninterface Atomics {\n /**\n * A non-blocking, asynchronous version of wait which is usable on the main thread.\n * Waits asynchronously on a shared memory location and returns a Promise\n * @param typedArray A shared Int32Array or BigInt64Array.\n * @param index The position in the typedArray to wait on.\n * @param value The expected value to test.\n * @param [timeout] The expected value to test.\n */\n waitAsync(typedArray: Int32Array, index: number, value: number, timeout?: number): { async: false; value: \"not-equal\" | \"timed-out\"; } | { async: true; value: Promise<\"ok\" | \"timed-out\">; };\n\n /**\n * A non-blocking, asynchronous version of wait which is usable on the main thread.\n * Waits asynchronously on a shared memory location and returns a Promise\n * @param typedArray A shared Int32Array or BigInt64Array.\n * @param index The position in the typedArray to wait on.\n * @param value The expected value to test.\n * @param [timeout] The expected value to test.\n */\n waitAsync(typedArray: BigInt64Array, index: number, value: bigint, timeout?: number): { async: false; value: \"not-equal\" | \"timed-out\"; } | { async: true; value: Promise<\"ok\" | \"timed-out\">; };\n}\n\ninterface SharedArrayBuffer {\n /**\n * Returns true if this SharedArrayBuffer can be grown.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer/growable)\n */\n get growable(): boolean;\n\n /**\n * If this SharedArrayBuffer is growable, returns the maximum byte length given during construction; returns the byte length if not.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer/maxByteLength)\n */\n get maxByteLength(): number;\n\n /**\n * Grows the SharedArrayBuffer to the specified size (in bytes).\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/SharedArrayBuffer/grow)\n */\n grow(newByteLength?: number): void;\n}\n\ninterface SharedArrayBufferConstructor {\n new (byteLength: number, options?: { maxByteLength?: number; }): SharedArrayBuffer;\n}\n";
3
+ //#endregion
4
+ export { lib_es2024_sharedmemory_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.sharedmemory.d-CM9RzBcy.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.sharedmemory.d-CM9RzBcy.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2024.string.d.ts?raw
2
+ var lib_es2024_string_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\ninterface String {\n /**\n * Returns true if all leading surrogates and trailing surrogates appear paired and in order.\n */\n isWellFormed(): boolean;\n\n /**\n * Returns a string where all lone or out-of-order surrogates have been replaced by the Unicode replacement character (U+FFFD).\n */\n toWellFormed(): string;\n}\n";
3
+ //#endregion
4
+ export { lib_es2024_string_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2024.string.d-CBDt9d69.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2024.string.d-CBDt9d69.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2025.collection.d.ts?raw
2
+ var lib_es2025_collection_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2024.collection\" />\n\ninterface ReadonlySetLike<T> {\n /**\n * Despite its name, returns an iterator of the values in the set-like.\n */\n keys(): Iterator<T>;\n /**\n * @returns a boolean indicating whether an element with the specified value exists in the set-like or not.\n */\n has(value: T): boolean;\n /**\n * @returns the number of (unique) elements in the set-like.\n */\n readonly size: number;\n}\n\ninterface Set<T> {\n /**\n * @returns a new Set containing all the elements in this Set and also all the elements in the argument.\n */\n union<U>(other: ReadonlySetLike<U>): Set<T | U>;\n /**\n * @returns a new Set containing all the elements which are both in this Set and in the argument.\n */\n intersection<U>(other: ReadonlySetLike<U>): Set<T & U>;\n /**\n * @returns a new Set containing all the elements in this Set which are not also in the argument.\n */\n difference<U>(other: ReadonlySetLike<U>): Set<T>;\n /**\n * @returns a new Set containing all the elements which are in either this Set or in the argument, but not in both.\n */\n symmetricDifference<U>(other: ReadonlySetLike<U>): Set<T | U>;\n /**\n * @returns a boolean indicating whether all the elements in this Set are also in the argument.\n */\n isSubsetOf(other: ReadonlySetLike<unknown>): boolean;\n /**\n * @returns a boolean indicating whether all the elements in the argument are also in this Set.\n */\n isSupersetOf(other: ReadonlySetLike<unknown>): boolean;\n /**\n * @returns a boolean indicating whether this Set has no elements in common with the argument.\n */\n isDisjointFrom(other: ReadonlySetLike<unknown>): boolean;\n}\n\ninterface ReadonlySet<T> {\n /**\n * @returns a new Set containing all the elements in this Set and also all the elements in the argument.\n */\n union<U>(other: ReadonlySetLike<U>): Set<T | U>;\n /**\n * @returns a new Set containing all the elements which are both in this Set and in the argument.\n */\n intersection<U>(other: ReadonlySetLike<U>): Set<T & U>;\n /**\n * @returns a new Set containing all the elements in this Set which are not also in the argument.\n */\n difference<U>(other: ReadonlySetLike<U>): Set<T>;\n /**\n * @returns a new Set containing all the elements which are in either this Set or in the argument, but not in both.\n */\n symmetricDifference<U>(other: ReadonlySetLike<U>): Set<T | U>;\n /**\n * @returns a boolean indicating whether all the elements in this Set are also in the argument.\n */\n isSubsetOf(other: ReadonlySetLike<unknown>): boolean;\n /**\n * @returns a boolean indicating whether all the elements in the argument are also in this Set.\n */\n isSupersetOf(other: ReadonlySetLike<unknown>): boolean;\n /**\n * @returns a boolean indicating whether this Set has no elements in common with the argument.\n */\n isDisjointFrom(other: ReadonlySetLike<unknown>): boolean;\n}\n";
3
+ //#endregion
4
+ export { lib_es2025_collection_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2025.collection.d-CsJViaMe.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2025.collection.d-CsJViaMe.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2025.d.ts?raw
2
+ var lib_es2025_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2024\" />\n/// <reference lib=\"es2025.collection\" />\n/// <reference lib=\"es2025.float16\" />\n/// <reference lib=\"es2025.intl\" />\n/// <reference lib=\"es2025.iterator\" />\n/// <reference lib=\"es2025.promise\" />\n/// <reference lib=\"es2025.regexp\" />\n";
3
+ //#endregion
4
+ export { lib_es2025_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2025.d-De4KdpN7.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2025.d-De4KdpN7.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2025.float16.d.ts?raw
2
+ var lib_es2025_float16_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2015.symbol\" />\n/// <reference lib=\"es2015.iterable\" />\n\n/**\n * A typed array of 16-bit float values. The contents are initialized to 0. If the requested number\n * of bytes could not be allocated an exception is raised.\n */\ninterface Float16Array<TArrayBuffer extends ArrayBufferLike = ArrayBufferLike> {\n /**\n * The size in bytes of each element in the array.\n */\n readonly BYTES_PER_ELEMENT: number;\n\n /**\n * The ArrayBuffer instance referenced by the array.\n */\n readonly buffer: TArrayBuffer;\n\n /**\n * The length in bytes of the array.\n */\n readonly byteLength: number;\n\n /**\n * The offset in bytes of the array.\n */\n readonly byteOffset: number;\n\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n\n /**\n * Returns the this object after copying a section of the array identified by start and end\n * to the same array starting at position target\n * @param target If target is negative, it is treated as length+target where length is the\n * length of the array.\n * @param start If start is negative, it is treated as length+start. If end is negative, it\n * is treated as length+end.\n * @param end If not specified, length of the this object is used as its default value.\n */\n copyWithin(target: number, start: number, end?: number): this;\n\n /**\n * Determines whether all the members of an array satisfy the specified test.\n * @param predicate A function that accepts up to three arguments. The every method calls\n * the predicate function for each element in the array until the predicate returns a value\n * which is coercible to the Boolean value false, or until the end of the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n every(predicate: (value: number, index: number, array: this) => unknown, thisArg?: any): boolean;\n\n /**\n * Changes all array elements from `start` to `end` index to a static `value` and returns the modified array\n * @param value value to fill array section with\n * @param start index to start filling the array at. If start is negative, it is treated as\n * length+start where length is the length of the array.\n * @param end index to stop filling the array at. If end is negative, it is treated as\n * length+end.\n */\n fill(value: number, start?: number, end?: number): this;\n\n /**\n * Returns the elements of an array that meet the condition specified in a callback function.\n * @param predicate A function that accepts up to three arguments. The filter method calls\n * the predicate function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n filter(predicate: (value: number, index: number, array: this) => any, thisArg?: any): Float16Array<ArrayBuffer>;\n\n /**\n * Returns the value of the first element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found, find\n * immediately returns that element value. Otherwise, find returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n find(predicate: (value: number, index: number, obj: this) => boolean, thisArg?: any): number | undefined;\n\n /**\n * Returns the index of the first element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findIndex immediately returns that element index. Otherwise, findIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findIndex(predicate: (value: number, index: number, obj: this) => boolean, thisArg?: any): number;\n\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: this,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Performs the specified action for each element in an array.\n * @param callbackfn A function that accepts up to three arguments. forEach calls the\n * callbackfn function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n forEach(callbackfn: (value: number, index: number, array: this) => void, thisArg?: any): void;\n\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n\n /**\n * Returns the index of the first occurrence of a value in an array.\n * @param searchElement The value to locate in the array.\n * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the\n * search starts at index 0.\n */\n indexOf(searchElement: number, fromIndex?: number): number;\n\n /**\n * Adds all the elements of an array separated by the specified separator string.\n * @param separator A string used to separate one element of an array from the next in the\n * resulting String. If omitted, the array elements are separated with a comma.\n */\n join(separator?: string): string;\n\n /**\n * Returns the index of the last occurrence of a value in an array.\n * @param searchElement The value to locate in the array.\n * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the\n * search starts at index 0.\n */\n lastIndexOf(searchElement: number, fromIndex?: number): number;\n\n /**\n * The length of the array.\n */\n readonly length: number;\n\n /**\n * Calls a defined callback function on each element of an array, and returns an array that\n * contains the results.\n * @param callbackfn A function that accepts up to three arguments. The map method calls the\n * callbackfn function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n map(callbackfn: (value: number, index: number, array: this) => number, thisArg?: any): Float16Array<ArrayBuffer>;\n\n /**\n * Calls the specified callback function for all the elements in an array. The return value of\n * the callback function is the accumulated result, and is provided as an argument in the next\n * call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduce method calls the\n * callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduce(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number): number;\n reduce(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number, initialValue: number): number;\n\n /**\n * Calls the specified callback function for all the elements in an array. The return value of\n * the callback function is the accumulated result, and is provided as an argument in the next\n * call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduce method calls the\n * callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduce<U>(callbackfn: (previousValue: U, currentValue: number, currentIndex: number, array: this) => U, initialValue: U): U;\n\n /**\n * Calls the specified callback function for all the elements in an array, in descending order.\n * The return value of the callback function is the accumulated result, and is provided as an\n * argument in the next call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls\n * the callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an\n * argument instead of an array value.\n */\n reduceRight(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number): number;\n reduceRight(callbackfn: (previousValue: number, currentValue: number, currentIndex: number, array: this) => number, initialValue: number): number;\n\n /**\n * Calls the specified callback function for all the elements in an array, in descending order.\n * The return value of the callback function is the accumulated result, and is provided as an\n * argument in the next call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls\n * the callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduceRight<U>(callbackfn: (previousValue: U, currentValue: number, currentIndex: number, array: this) => U, initialValue: U): U;\n\n /**\n * Reverses the elements in an Array.\n */\n reverse(): this;\n\n /**\n * Sets a value or an array of values.\n * @param array A typed or untyped array of values to set.\n * @param offset The index in the current array at which the values are to be written.\n */\n set(array: ArrayLike<number>, offset?: number): void;\n\n /**\n * Returns a section of an array.\n * @param start The beginning of the specified portion of the array.\n * @param end The end of the specified portion of the array. This is exclusive of the element at the index 'end'.\n */\n slice(start?: number, end?: number): Float16Array<ArrayBuffer>;\n\n /**\n * Determines whether the specified callback function returns true for any element of an array.\n * @param predicate A function that accepts up to three arguments. The some method calls\n * the predicate function for each element in the array until the predicate returns a value\n * which is coercible to the Boolean value true, or until the end of the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n some(predicate: (value: number, index: number, array: this) => unknown, thisArg?: any): boolean;\n\n /**\n * Sorts an array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if first argument is less than second argument, zero if they're equal and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * [11,2,22,1].sort((a, b) => a - b)\n * ```\n */\n sort(compareFn?: (a: number, b: number) => number): this;\n\n /**\n * Gets a new Float16Array view of the ArrayBuffer store for this array, referencing the elements\n * at begin, inclusive, up to end, exclusive.\n * @param begin The index of the beginning of the array.\n * @param end The index of the end of the array.\n */\n subarray(begin?: number, end?: number): Float16Array<TArrayBuffer>;\n\n /**\n * Converts a number to a string by using the current locale.\n */\n toLocaleString(locales?: string | string[], options?: Intl.NumberFormatOptions): string;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Float16Array<ArrayBuffer>;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Float16Array.from([11.25, 2, -22.5, 1]);\n * myNums.toSorted((a, b) => a - b) // Float16Array(4) [-22.5, 1, 2, 11.5]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Float16Array<ArrayBuffer>;\n\n /**\n * Returns a string representation of an array.\n */\n toString(): string;\n\n /** Returns the primitive value of the specified object. */\n valueOf(): this;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Float16Array<ArrayBuffer>;\n\n [index: number]: number;\n\n [Symbol.iterator](): ArrayIterator<number>;\n\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): ArrayIterator<[number, number]>;\n\n /**\n * Returns an list of keys in the array\n */\n keys(): ArrayIterator<number>;\n\n /**\n * Returns an list of values in the array\n */\n values(): ArrayIterator<number>;\n\n readonly [Symbol.toStringTag]: \"Float16Array\";\n}\n\ninterface Float16ArrayConstructor {\n readonly prototype: Float16Array<ArrayBufferLike>;\n new (length?: number): Float16Array<ArrayBuffer>;\n new (array: ArrayLike<number> | Iterable<number>): Float16Array<ArrayBuffer>;\n new <TArrayBuffer extends ArrayBufferLike = ArrayBuffer>(buffer: TArrayBuffer, byteOffset?: number, length?: number): Float16Array<TArrayBuffer>;\n new (buffer: ArrayBuffer, byteOffset?: number, length?: number): Float16Array<ArrayBuffer>;\n new (array: ArrayLike<number> | ArrayBuffer): Float16Array<ArrayBuffer>;\n\n /**\n * The size in bytes of each element in the array.\n */\n readonly BYTES_PER_ELEMENT: number;\n\n /**\n * Returns a new array from a set of elements.\n * @param items A set of elements to include in the new array object.\n */\n of(...items: number[]): Float16Array<ArrayBuffer>;\n\n /**\n * Creates an array from an array-like or iterable object.\n * @param arrayLike An array-like object to convert to an array.\n */\n from(arrayLike: ArrayLike<number>): Float16Array<ArrayBuffer>;\n\n /**\n * Creates an array from an array-like or iterable object.\n * @param arrayLike An array-like object to convert to an array.\n * @param mapfn A mapping function to call on every element of the array.\n * @param thisArg Value of 'this' used to invoke the mapfn.\n */\n from<T>(arrayLike: ArrayLike<T>, mapfn: (v: T, k: number) => number, thisArg?: any): Float16Array<ArrayBuffer>;\n\n /**\n * Creates an array from an array-like or iterable object.\n * @param elements An iterable object to convert to an array.\n */\n from(elements: Iterable<number>): Float16Array<ArrayBuffer>;\n\n /**\n * Creates an array from an array-like or iterable object.\n * @param elements An iterable object to convert to an array.\n * @param mapfn A mapping function to call on every element of the array.\n * @param thisArg Value of 'this' used to invoke the mapfn.\n */\n from<T>(elements: Iterable<T>, mapfn?: (v: T, k: number) => number, thisArg?: any): Float16Array<ArrayBuffer>;\n}\ndeclare var Float16Array: Float16ArrayConstructor;\n\ninterface Math {\n /**\n * Returns the nearest half precision float representation of a number.\n * @param x A numeric expression.\n */\n f16round(x: number): number;\n}\n\ninterface DataView<TArrayBuffer extends ArrayBufferLike> {\n /**\n * Gets the Float16 value at the specified byte offset from the start of the view. There is\n * no alignment constraint; multi-byte values may be fetched from any offset.\n * @param byteOffset The place in the buffer at which the value should be retrieved.\n * @param littleEndian If false or undefined, a big-endian value should be read.\n */\n getFloat16(byteOffset: number, littleEndian?: boolean): number;\n\n /**\n * Stores an Float16 value at the specified byte offset from the start of the view.\n * @param byteOffset The place in the buffer at which the value should be set.\n * @param value The value to set.\n * @param littleEndian If false or undefined, a big-endian value should be written.\n */\n setFloat16(byteOffset: number, value: number, littleEndian?: boolean): void;\n}\n";
3
+ //#endregion
4
+ export { lib_es2025_float16_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2025.float16.d-HHOhRN2_.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2025.float16.d-HHOhRN2_.js","names":[],"sources":[],"mappings":""}
@@ -0,0 +1,6 @@
1
+ //#region ../../node_modules/.bun/typescript@6.0.3/node_modules/typescript/lib/lib.es2025.full.d.ts?raw
2
+ var lib_es2025_full_d_default = "/*! *****************************************************************************\nCopyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABILITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference lib=\"es2025\" />\n/// <reference lib=\"dom\" />\n/// <reference lib=\"webworker.importscripts\" />\n/// <reference lib=\"scripthost\" />\n/// <reference lib=\"dom.iterable\" />\n/// <reference lib=\"dom.asynciterable\" />\n";
3
+ //#endregion
4
+ export { lib_es2025_full_d_default as default };
5
+
6
+ //# sourceMappingURL=lib.es2025.full.d-BYMP75tw.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"lib.es2025.full.d-BYMP75tw.js","names":[],"sources":[],"mappings":""}