@delali/narsil 0.3.1-next.157 → 0.3.1-next.161

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 (565) hide show
  1. package/dist/adapters/filesystem.mjs +3 -3
  2. package/dist/adapters/gcs.mjs +3 -3
  3. package/dist/adapters/indexeddb.mjs +1 -1
  4. package/dist/adapters/s3.mjs +3 -3
  5. package/dist/browser/{chunk-N23GL72Q.mjs → chunk-4RNSFVWI.mjs} +20777 -19056
  6. package/dist/browser/chunk-MMHIIL5B.mjs +564 -0
  7. package/dist/browser/chunk-MZHQ65VI.mjs +1228 -0
  8. package/dist/browser/chunk-WC2DEXWU.mjs +29 -0
  9. package/dist/browser/{chunk-VLJQW4J6.mjs → core-leaf-TJAGWPZZ.mjs} +4674 -3102
  10. package/dist/{react-native/chunks/durability-config-QXVZEO7T.mjs → browser/durability-config-SGB5ZP5K.mjs} +8 -3
  11. package/dist/browser/embed-RF2MPGAO.mjs +222 -0
  12. package/dist/{react-native/chunks/geo-index-PX3BIHAH.mjs → browser/geo-index-GNHY4PUB.mjs} +190 -93
  13. package/dist/{react-native/chunks/module-TTEVPRCW.mjs → browser/module-362VSIGR.mjs} +1570 -275
  14. package/dist/browser/msgpack-leaf-44XNWSSY.mjs +302 -0
  15. package/dist/browser/optional-reads-XMVPG6HG.mjs +3230 -0
  16. package/dist/browser/optional-writes-WMZX4OEC.mjs +3196 -0
  17. package/dist/browser/phrase-module-22TKMXWI.mjs +616 -0
  18. package/dist/browser/resolve-vector-text-KI65IHMD.mjs +60 -0
  19. package/dist/browser/{restore-hooks-IE3GGYHG.mjs → restore-queue-S4BWOGMU.mjs} +98 -24
  20. package/dist/{react-native/chunks/runtime-R5E3TB3J.mjs → browser/runtime-NU6VOVH2.mjs} +61 -25
  21. package/dist/browser/segment-codec-leaf-A427QJUX.mjs +554 -0
  22. package/dist/browser/segment-merge-leaf-7BZ54JPI.mjs +1636 -0
  23. package/dist/browser/storage-leaf-X6CNRHJS.mjs +18221 -0
  24. package/dist/browser/store-leaf-AEMTAVHX.mjs +2069 -0
  25. package/dist/browser/{chunk-GFAZPSWK.mjs → suggestions-leaf-3Y6MR6OF.mjs} +441 -119
  26. package/dist/browser/worker-copies-WQCPP3TS.mjs +2750 -0
  27. package/dist/{capabilities-D3AoBJoF.d.ts → capabilities-BKDrry0z.d.ts} +2 -2
  28. package/dist/chunk-2JRERUNZ.mjs +217 -0
  29. package/dist/chunk-2RIS76RJ.mjs +212 -0
  30. package/dist/chunk-3B775F3C.mjs +252 -0
  31. package/dist/{chunk-24FNVRKB.mjs → chunk-3D6RZGJH.mjs} +3 -3
  32. package/dist/{chunk-INJYO3BU.mjs → chunk-4CAMH7FO.mjs} +1 -1
  33. package/dist/{chunk-U476IXKQ.mjs → chunk-4PY4JYMY.mjs} +2 -1
  34. package/dist/chunk-6EZW2GQL.mjs +978 -0
  35. package/dist/chunk-75UNINFA.mjs +271 -0
  36. package/dist/chunk-77AUVDQ5.mjs +7 -0
  37. package/dist/{chunk-JTYPJF3T.mjs → chunk-7MWYORQC.mjs} +2 -2
  38. package/dist/{chunk-TGP5M5R7.mjs → chunk-7T4LAYT4.mjs} +1 -1
  39. package/dist/{chunk-XIHUI4KB.mjs → chunk-AB27FWZM.mjs} +8 -3
  40. package/dist/{chunk-FUD5XSZ5.mjs → chunk-BXM7XM4G.mjs} +7 -3
  41. package/dist/{chunk-HJJI72X7.mjs → chunk-C7YQHCSO.mjs} +1 -1
  42. package/dist/{chunk-RVGRFOGN.mjs → chunk-D456ZFPQ.mjs} +2 -1
  43. package/dist/{chunk-KKQC526K.mjs → chunk-E2F6LZR3.mjs} +19 -21
  44. package/dist/{chunk-SMOOSIAW.mjs → chunk-FE3MRIBN.mjs} +104 -13
  45. package/dist/{chunk-KYYABCSW.mjs → chunk-FETZYCH7.mjs} +15 -1
  46. package/dist/{chunk-XXJZMTZT.mjs → chunk-FVZ5DB6Y.mjs} +3 -2
  47. package/dist/{chunk-EYD7K3H6.mjs → chunk-GF4K7IUK.mjs} +317 -120
  48. package/dist/chunk-GXCDWLQI.mjs +193 -0
  49. package/dist/{chunk-IIRIG7H5.mjs → chunk-H64YDF5M.mjs} +3 -3
  50. package/dist/{browser/chunk-VY5KW3HN.mjs → chunk-HOOR4CP5.mjs} +63 -7
  51. package/dist/chunk-IB4BYLE3.mjs +127 -0
  52. package/dist/{chunk-3C7MTCCI.mjs → chunk-IE3Q62QD.mjs} +2 -2
  53. package/dist/chunk-IH3G6SJO.mjs +40 -0
  54. package/dist/chunk-JV74RKCY.mjs +3041 -0
  55. package/dist/{chunk-ZPZ3YGXV.mjs → chunk-K67I3RF4.mjs} +261 -101
  56. package/dist/chunk-KLVMK3R5.mjs +47 -0
  57. package/dist/{chunk-5VV4R6P7.mjs → chunk-LAWIJRMJ.mjs} +4154 -2577
  58. package/dist/chunk-LF4GB4PO.mjs +281 -0
  59. package/dist/chunk-NC4QLCZC.mjs +59 -0
  60. package/dist/chunk-OOO54OVC.mjs +627 -0
  61. package/dist/chunk-OUWZKNO3.mjs +207 -0
  62. package/dist/{chunk-FJKKCV4D.mjs → chunk-P5YLI5ED.mjs} +343 -182
  63. package/dist/{chunk-4ZTHGTVX.mjs → chunk-PTTMGRG5.mjs} +9 -10
  64. package/dist/{react-native/chunks/chunk-DZ7H7D2C.mjs → chunk-Q3ZZH5Z7.mjs} +6 -0
  65. package/dist/{browser/chunk-EKMGCRSR.mjs → chunk-QBVTYY4J.mjs} +2 -9
  66. package/dist/{chunk-W5EB5XKI.mjs → chunk-R4CE4IVU.mjs} +341 -183
  67. package/dist/chunk-S2POFTLN.mjs +10 -0
  68. package/dist/{chunk-KJ3RTZDJ.mjs → chunk-S3BSDBF7.mjs} +10 -3
  69. package/dist/{chunk-4LMSZAK6.mjs → chunk-SHGN3QIF.mjs} +69 -13
  70. package/dist/chunk-SXIRM4MX.mjs +3549 -0
  71. package/dist/{chunk-TBC3XUL2.mjs → chunk-TGPKS2UM.mjs} +47 -1
  72. package/dist/chunk-TINW4BSH.mjs +31301 -0
  73. package/dist/{cold-module-VOJXMNZB.mjs → chunk-TSLV5P2J.mjs} +397 -80
  74. package/dist/{chunk-HHBUCIUY.mjs → chunk-TW543F33.mjs} +3 -3
  75. package/dist/chunk-U6B7DUQW.mjs +788 -0
  76. package/dist/{chunk-OQLD2BSW.mjs → chunk-V3SGPXWQ.mjs} +8 -9
  77. package/dist/chunk-W34VJXY7.mjs +4723 -0
  78. package/dist/chunk-YETKPX5M.mjs +5 -0
  79. package/dist/chunk-ZQ6QY42L.mjs +59 -0
  80. package/dist/{client-kqSMevVi.d.ts → client-CTp8RRiK.d.ts} +4 -4
  81. package/dist/client.d.ts +8 -8
  82. package/dist/client.mjs +66 -18
  83. package/dist/{config-B4v_Htpu.d.ts → config-PCNzWjHL.d.ts} +6 -3
  84. package/dist/{config-CTP01fns.d.ts → config-_WT5grSL.d.ts} +3 -3
  85. package/dist/core-leaf-KXFGP74A.mjs +7 -0
  86. package/dist/digest-leaf-KXBGKYHZ.mjs +1 -0
  87. package/dist/direct-executor-MKTZBR26.mjs +16 -0
  88. package/dist/distribution/coordinator/etcd.d.ts +2 -2
  89. package/dist/distribution/coordinator/etcd.mjs +7 -4
  90. package/dist/distribution/coordinator/in-memory.d.ts +2 -2
  91. package/dist/distribution/coordinator/in-memory.mjs +1 -2
  92. package/dist/distribution/transport/grpc.mjs +7 -2
  93. package/dist/distribution/transport/tcp.mjs +7 -1
  94. package/dist/distribution.d.ts +7 -7
  95. package/dist/distribution.mjs +1199 -1092
  96. package/dist/{browser/durability-config-TIYKW6XX.mjs → durability-config-XV4XR7Y4.mjs} +7 -3
  97. package/dist/embed-4H7RTBVL.mjs +221 -0
  98. package/dist/embeddings/openai.mjs +2 -2
  99. package/dist/{engine-CkPn2PWE.d.ts → engine-DBRVR_d-.d.ts} +1252 -1239
  100. package/dist/{browser/geo-index-OTV7VPIR.mjs → geo-index-2ZMMWWSK.mjs} +190 -93
  101. package/dist/{index-C4AmUnl1.d.ts → index-Ck9w5WHz.d.ts} +1 -1
  102. package/dist/index.browser.mjs +4 -16
  103. package/dist/index.d.ts +1495 -78
  104. package/dist/index.mjs +14 -50
  105. package/dist/index.react-native.mjs +11 -28
  106. package/dist/invalidation/filesystem.mjs +1 -2
  107. package/dist/languages/albanian.mjs +1 -1
  108. package/dist/languages/amharic.mjs +1 -1
  109. package/dist/languages/arabic.mjs +1 -1
  110. package/dist/languages/armenian.mjs +1 -1
  111. package/dist/languages/azerbaijani.mjs +1 -1
  112. package/dist/languages/bambara.mjs +1 -1
  113. package/dist/languages/basque.mjs +1 -1
  114. package/dist/languages/belarusian.mjs +1 -1
  115. package/dist/languages/bengali.mjs +1 -1
  116. package/dist/languages/bosnian.mjs +1 -1
  117. package/dist/languages/breton.mjs +1 -1
  118. package/dist/languages/bulgarian.mjs +1 -1
  119. package/dist/languages/burmese.mjs +1 -1
  120. package/dist/languages/catalan.mjs +1 -1
  121. package/dist/languages/chinese.mjs +1 -1
  122. package/dist/languages/croatian.mjs +1 -1
  123. package/dist/languages/czech.mjs +1 -1
  124. package/dist/languages/dagbani.mjs +1 -1
  125. package/dist/languages/danish.mjs +1 -1
  126. package/dist/languages/dutch.mjs +1 -1
  127. package/dist/languages/english.mjs +1 -1
  128. package/dist/languages/esperanto.mjs +1 -1
  129. package/dist/languages/estonian.mjs +1 -1
  130. package/dist/languages/ewe.mjs +1 -1
  131. package/dist/languages/faroese.mjs +1 -1
  132. package/dist/languages/fijian.mjs +1 -1
  133. package/dist/languages/finnish.mjs +1 -1
  134. package/dist/languages/french.mjs +1 -1
  135. package/dist/languages/ga.mjs +1 -1
  136. package/dist/languages/galician.mjs +1 -1
  137. package/dist/languages/georgian.mjs +1 -1
  138. package/dist/languages/german.mjs +1 -1
  139. package/dist/languages/greek.mjs +1 -1
  140. package/dist/languages/guarani.mjs +1 -1
  141. package/dist/languages/gujarati.mjs +1 -1
  142. package/dist/languages/haitian-creole.mjs +1 -1
  143. package/dist/languages/hausa.mjs +1 -1
  144. package/dist/languages/hawaiian.mjs +1 -1
  145. package/dist/languages/hebrew.mjs +1 -1
  146. package/dist/languages/hindi.mjs +1 -1
  147. package/dist/languages/hungarian.mjs +1 -1
  148. package/dist/languages/icelandic.mjs +1 -1
  149. package/dist/languages/igbo.mjs +1 -1
  150. package/dist/languages/indonesian.mjs +1 -1
  151. package/dist/languages/irish.mjs +1 -1
  152. package/dist/languages/italian.mjs +1 -1
  153. package/dist/languages/japanese.mjs +1 -1
  154. package/dist/languages/kannada.mjs +1 -1
  155. package/dist/languages/kazakh.mjs +1 -1
  156. package/dist/languages/khmer.mjs +1 -1
  157. package/dist/languages/kinyarwanda.mjs +1 -1
  158. package/dist/languages/kirundi.mjs +1 -1
  159. package/dist/languages/korean.mjs +1 -1
  160. package/dist/languages/kurmanji.mjs +1 -1
  161. package/dist/languages/kyrgyz.mjs +1 -1
  162. package/dist/languages/lao.mjs +1 -1
  163. package/dist/languages/latin.mjs +1 -1
  164. package/dist/languages/latvian.mjs +1 -1
  165. package/dist/languages/lingala.mjs +1 -1
  166. package/dist/languages/lithuanian.mjs +1 -1
  167. package/dist/languages/luxembourgish.mjs +1 -1
  168. package/dist/languages/macedonian.mjs +1 -1
  169. package/dist/languages/malagasy.mjs +1 -1
  170. package/dist/languages/malay.mjs +1 -1
  171. package/dist/languages/malayalam.mjs +1 -1
  172. package/dist/languages/maltese.mjs +1 -1
  173. package/dist/languages/maori.mjs +1 -1
  174. package/dist/languages/marathi.mjs +1 -1
  175. package/dist/languages/nepali.mjs +1 -1
  176. package/dist/languages/norwegian.mjs +1 -1
  177. package/dist/languages/oromo.mjs +1 -1
  178. package/dist/languages/persian.mjs +1 -1
  179. package/dist/languages/polish.mjs +1 -1
  180. package/dist/languages/portuguese.mjs +1 -1
  181. package/dist/languages/punjabi.mjs +1 -1
  182. package/dist/languages/romanian.mjs +1 -1
  183. package/dist/languages/russian.mjs +1 -1
  184. package/dist/languages/samoan.mjs +1 -1
  185. package/dist/languages/sanskrit.mjs +1 -1
  186. package/dist/languages/scottish-gaelic.mjs +1 -1
  187. package/dist/languages/serbian.mjs +1 -1
  188. package/dist/languages/shona.mjs +1 -1
  189. package/dist/languages/sinhala.mjs +1 -1
  190. package/dist/languages/slovak.mjs +1 -1
  191. package/dist/languages/slovenian.mjs +1 -1
  192. package/dist/languages/sorani.mjs +1 -1
  193. package/dist/languages/spanish.mjs +1 -1
  194. package/dist/languages/swahili.mjs +1 -1
  195. package/dist/languages/swedish.mjs +1 -1
  196. package/dist/languages/tagalog.mjs +1 -1
  197. package/dist/languages/tamil.mjs +1 -1
  198. package/dist/languages/tatar.mjs +1 -1
  199. package/dist/languages/telugu.mjs +1 -1
  200. package/dist/languages/thai.mjs +1 -1
  201. package/dist/languages/tibetan.mjs +1 -1
  202. package/dist/languages/tigrinya.mjs +1 -1
  203. package/dist/languages/tongan.mjs +1 -1
  204. package/dist/languages/turkish.mjs +1 -1
  205. package/dist/languages/twi.mjs +1 -1
  206. package/dist/languages/ukrainian.mjs +1 -1
  207. package/dist/languages/urdu.mjs +1 -1
  208. package/dist/languages/vietnamese.mjs +1 -1
  209. package/dist/languages/welsh.mjs +1 -1
  210. package/dist/languages/wolof.mjs +1 -1
  211. package/dist/languages/xhosa.mjs +1 -1
  212. package/dist/languages/yoruba.mjs +1 -1
  213. package/dist/languages/zulu.mjs +1 -1
  214. package/dist/{long-query-thread-QDFQSJD6.mjs → long-query-thread-JMGNGF6V.mjs} +74 -58
  215. package/dist/{module-N55W4Q5C.mjs → module-ZJ6ARG6V.mjs} +444 -111
  216. package/dist/msgpack-leaf-5WFRP6JM.mjs +9 -0
  217. package/dist/optional-reads-BR3BOVZW.mjs +3373 -0
  218. package/dist/optional-writes-DDFHYUOH.mjs +218 -0
  219. package/dist/{paged-partition-archive-RLRGOXDX.mjs → paged-partition-archive-G576XGVE.mjs} +29 -69
  220. package/dist/partial-words.browser.mjs +1649 -0
  221. package/dist/partial-words.mjs +15 -14
  222. package/dist/{chunk-CITFCZKF.mjs → pattern.browser.mjs} +153 -186
  223. package/dist/pattern.mjs +6 -8
  224. package/dist/persistence/durability/checkpoint-worker.d.ts +32 -24
  225. package/dist/persistence/durability/checkpoint-worker.mjs +27 -59
  226. package/dist/phrase-module-XK3T44VU.mjs +634 -0
  227. package/dist/query-actions-OMXJEC2J.mjs +118 -0
  228. package/dist/query-suggestions/merge-worker.mjs +18 -54
  229. package/dist/query-suggestions.browser.mjs +26 -227
  230. package/dist/query-suggestions.d.ts +2 -2
  231. package/dist/query-suggestions.mjs +16 -67
  232. package/dist/react-native/chunks/chunk-4EXKQ2IB.mjs +565 -0
  233. package/dist/react-native/chunks/chunk-52QD7CBJ.mjs +52 -0
  234. package/dist/react-native/chunks/chunk-72OKYHZL.mjs +969 -0
  235. package/dist/react-native/chunks/chunk-AQOWRH2C.mjs +802 -0
  236. package/dist/react-native/chunks/{chunk-4COWCEY7.mjs → chunk-FTQ7JNMU.mjs} +341 -180
  237. package/dist/react-native/chunks/chunk-G3CUQ333.mjs +42 -0
  238. package/dist/react-native/chunks/{chunk-EJ33LCHV.mjs → chunk-HRDMIQ63.mjs} +53 -1
  239. package/dist/react-native/chunks/{chunk-4AV5PPH6.mjs → chunk-IY6U6HRA.mjs} +63 -7
  240. package/dist/react-native/chunks/chunk-J2NQW353.mjs +212 -0
  241. package/dist/react-native/chunks/chunk-L4R5ITVG.mjs +29047 -0
  242. package/dist/react-native/chunks/{chunk-OXM66LO6.mjs → chunk-OK3WUA6N.mjs} +2 -10
  243. package/dist/react-native/chunks/{chunk-MVXELMJX.mjs → chunk-PVMEHBQO.mjs} +1 -1
  244. package/dist/{browser/chunk-SRMZXJSL.mjs → react-native/chunks/chunk-TQ26BKBH.mjs} +6 -0
  245. package/dist/{browser/chunk-GPPOG6PT.mjs → react-native/chunks/chunk-VUJCSQG5.mjs} +3 -1
  246. package/dist/react-native/chunks/{chunk-ENLMYKSX.mjs → chunk-XEGKQKLY.mjs} +5385 -3114
  247. package/dist/react-native/chunks/chunk-YOTP2FPE.mjs +232 -0
  248. package/dist/react-native/chunks/chunk-ZIU6TWXG.mjs +127 -0
  249. package/dist/react-native/chunks/core-leaf-5B4JXCVA.mjs +6 -0
  250. package/dist/react-native/chunks/digest-leaf-X6OIFDIU.mjs +1 -0
  251. package/dist/{durability-config-GE4U7MCZ.mjs → react-native/chunks/durability-config-3IOXIPYZ.mjs} +7 -3
  252. package/dist/react-native/chunks/embed-3WQ2CCR5.mjs +221 -0
  253. package/dist/{geo-index-MRH5JMIR.mjs → react-native/chunks/geo-index-QEYKEVPH.mjs} +190 -93
  254. package/dist/react-native/chunks/{chunk-CKNRFDTZ.mjs → gzip.react-native-DLO4WW27.mjs} +2 -1
  255. package/dist/{browser/module-TCT66FWA.mjs → react-native/chunks/module-VUA27HZZ.mjs} +1018 -540
  256. package/dist/react-native/chunks/msgpack-leaf-TR66ZVAX.mjs +7 -0
  257. package/dist/react-native/chunks/optional-reads-WDTLLHUT.mjs +3364 -0
  258. package/dist/react-native/chunks/optional-writes-FZV3QW34.mjs +267 -0
  259. package/dist/react-native/chunks/phrase-module-KCQWVXYZ.mjs +635 -0
  260. package/dist/react-native/chunks/resolve-vector-text-LXRYXF7M.mjs +59 -0
  261. package/dist/react-native/chunks/restore-queue-EI2V2I4S.mjs +179 -0
  262. package/dist/{browser/runtime-OTAGEFQW.mjs → react-native/chunks/runtime-BUCSAK4U.mjs} +61 -25
  263. package/dist/react-native/chunks/segment-codec-leaf-6ULP7H3I.mjs +12 -0
  264. package/dist/react-native/chunks/segment-merge-leaf-F4GQZNK6.mjs +13 -0
  265. package/dist/react-native/chunks/storage-leaf-OAXBU2L6.mjs +18042 -0
  266. package/dist/react-native/chunks/store-leaf-GY2ZZFXB.mjs +14 -0
  267. package/dist/react-native/chunks/{chunk-WW2X2AEI.mjs → suggestions-leaf-SQEZ4IBS.mjs} +332 -118
  268. package/dist/react-native/chunks/worker-copies-EEHSCFJW.mjs +2627 -0
  269. package/dist/react-native/partial-words.mjs +954 -35
  270. package/dist/react-native/pattern.mjs +238 -111
  271. package/dist/react-native/query-suggestions.mjs +33 -239
  272. package/dist/react-native/sync.mjs +95 -52
  273. package/dist/react-native/synonyms.mjs +256 -112
  274. package/dist/react.d.ts +9 -9
  275. package/dist/react.mjs +6 -0
  276. package/dist/{rerank-MQ37IYRV.mjs → rerank-Y6MWBMTT.mjs} +17 -8
  277. package/dist/rerankers/http.mjs +2 -2
  278. package/dist/resolve-vector-text-4PDRTPNQ.mjs +2 -0
  279. package/dist/restore-queue-KPYSRJ4A.mjs +184 -0
  280. package/dist/runtime-4GKUIAKV.mjs +595 -0
  281. package/dist/{schema-Jwt928nJ.d.ts → schema-C_7yRJLt.d.ts} +1 -1
  282. package/dist/segment-codec-leaf-6IFBSBPN.mjs +17 -0
  283. package/dist/segment-merge-leaf-VE3FUSVE.mjs +17 -0
  284. package/dist/server.d.ts +33 -13
  285. package/dist/server.mjs +81 -100
  286. package/dist/{browser/durability-wiring-GVZEE46O.mjs → storage-leaf-HMIIOUYN.mjs} +2334 -931
  287. package/dist/store-leaf-M7T7SUZJ.mjs +19 -0
  288. package/dist/stored-values-BWIMpiT_.d.ts +25 -0
  289. package/dist/suggestions-leaf-Q3Q5D6XV.mjs +53 -0
  290. package/dist/sync/filesystem.d.ts +3 -3
  291. package/dist/sync/filesystem.mjs +27 -11
  292. package/dist/sync/indexeddb.browser.mjs +287 -0
  293. package/dist/sync/indexeddb.d.ts +3 -3
  294. package/dist/sync/indexeddb.mjs +7 -2
  295. package/dist/sync.browser.mjs +88 -72
  296. package/dist/sync.d.ts +4 -4
  297. package/dist/sync.mjs +89 -59
  298. package/dist/{chunk-I5B7RXU7.mjs → synonyms.browser.mjs} +248 -135
  299. package/dist/synonyms.mjs +15 -11
  300. package/dist/{tasks-CoNjxbop.d.ts → tasks-B4tT4vmP.d.ts} +4 -4
  301. package/dist/thread-SNILJXX3.mjs +30 -0
  302. package/dist/{types-DPMjfOr_.d.ts → types-CTg0KaMy.d.ts} +2 -2
  303. package/dist/vector/search-worker.d.ts +7 -1
  304. package/dist/vector/search-worker.mjs +9 -13
  305. package/dist/worker-copies-ZLZS2CUM.mjs +2152 -0
  306. package/dist/workers/entry.mjs +60 -30
  307. package/openapi.json +66 -50
  308. package/package.json +233 -8
  309. package/dist/analysis-change-CKEMM2MC.mjs +0 -55
  310. package/dist/analysis-change-entry-SEDMJ6MW.mjs +0 -1
  311. package/dist/archive-history-E4R73RWD.mjs +0 -29
  312. package/dist/browser/analysis-change-ZKGJFENM.mjs +0 -942
  313. package/dist/browser/analysis-change-entry-5BFUVMHJ.mjs +0 -1
  314. package/dist/browser/archive-history-4IP5XQZY.mjs +0 -29
  315. package/dist/browser/chunk-25MTVDYD.mjs +0 -432
  316. package/dist/browser/chunk-3I27KXQD.mjs +0 -34
  317. package/dist/browser/chunk-3NLMB5CC.mjs +0 -217
  318. package/dist/browser/chunk-4RD3AFSB.mjs +0 -32
  319. package/dist/browser/chunk-5W3MMTLG.mjs +0 -19
  320. package/dist/browser/chunk-5YWB3E2W.mjs +0 -92
  321. package/dist/browser/chunk-7IGKGWSQ.mjs +0 -79
  322. package/dist/browser/chunk-AI5UI46D.mjs +0 -12
  323. package/dist/browser/chunk-ATEBYXP6.mjs +0 -10
  324. package/dist/browser/chunk-BLT4RHCJ.mjs +0 -241
  325. package/dist/browser/chunk-C26SPCGQ.mjs +0 -2636
  326. package/dist/browser/chunk-C4FJ3WDY.mjs +0 -177
  327. package/dist/browser/chunk-CXNTHHA7.mjs +0 -63
  328. package/dist/browser/chunk-DSXIBE6N.mjs +0 -78
  329. package/dist/browser/chunk-DUH6QUVU.mjs +0 -2374
  330. package/dist/browser/chunk-ELV4OZOI.mjs +0 -29
  331. package/dist/browser/chunk-EXQZGUQH.mjs +0 -193
  332. package/dist/browser/chunk-G64Q6OJF.mjs +0 -96
  333. package/dist/browser/chunk-HOZW3PKP.mjs +0 -9
  334. package/dist/browser/chunk-HUCSHDTB.mjs +0 -100
  335. package/dist/browser/chunk-JPTQZWJQ.mjs +0 -10
  336. package/dist/browser/chunk-K3IPRX6D.mjs +0 -2559
  337. package/dist/browser/chunk-ML7THVLJ.mjs +0 -38
  338. package/dist/browser/chunk-MY2XKH22.mjs +0 -40
  339. package/dist/browser/chunk-NLWTBAGB.mjs +0 -111
  340. package/dist/browser/chunk-NXQG7DRA.mjs +0 -318
  341. package/dist/browser/chunk-OEDCEZXJ.mjs +0 -92
  342. package/dist/browser/chunk-OIZS5KIX.mjs +0 -6
  343. package/dist/browser/chunk-RA6LSBCM.mjs +0 -43
  344. package/dist/browser/chunk-TK63WFXK.mjs +0 -90
  345. package/dist/browser/chunk-TY7L6OXO.mjs +0 -69
  346. package/dist/browser/chunk-U3JOQGWX.mjs +0 -19
  347. package/dist/browser/chunk-U4YDIBUT.mjs +0 -653
  348. package/dist/browser/chunk-UATIJ4KU.mjs +0 -21
  349. package/dist/browser/chunk-UKOWD2K5.mjs +0 -315
  350. package/dist/browser/chunk-UTMHUHUV.mjs +0 -150
  351. package/dist/browser/chunk-V43N6TZO.mjs +0 -857
  352. package/dist/browser/chunk-VI7BQR4U.mjs +0 -21
  353. package/dist/browser/chunk-WN464PTL.mjs +0 -375
  354. package/dist/browser/chunk-WXLBZJMT.mjs +0 -25
  355. package/dist/browser/chunk-X7TXYUKO.mjs +0 -86
  356. package/dist/browser/chunk-XAWNZ4G2.mjs +0 -151
  357. package/dist/browser/chunk-Y6IBAUNO.mjs +0 -561
  358. package/dist/browser/chunk-ZI2V4VD7.mjs +0 -21
  359. package/dist/browser/cold-module-YNUUDNOM.mjs +0 -761
  360. package/dist/browser/engine-hooks-HBVS6YM4.mjs +0 -18
  361. package/dist/browser/gzip-5S7ROJFJ.mjs +0 -1
  362. package/dist/browser/import-5ESVMFDJ.mjs +0 -20
  363. package/dist/browser/methods-KTQCSIN4.mjs +0 -30
  364. package/dist/browser/module-NDSQLPMQ.mjs +0 -25
  365. package/dist/browser/operations-OJ3BXS55.mjs +0 -5
  366. package/dist/browser/phrase-module-HAT3TLZN.mjs +0 -328
  367. package/dist/browser/pool-3JLET5RO.mjs +0 -297
  368. package/dist/browser/release-HYXPVJVS.mjs +0 -32
  369. package/dist/browser/restore-queue-LQBBTODR.mjs +0 -55
  370. package/dist/browser/retention-TY3L3BFN.mjs +0 -211
  371. package/dist/browser/snapshot-5FHPPCNZ.mjs +0 -965
  372. package/dist/browser/start-2UZTOBG5.mjs +0 -26
  373. package/dist/browser/sync-state-P5XG6LTQ.mjs +0 -15
  374. package/dist/browser/write-ULXAN5B4.mjs +0 -196
  375. package/dist/chunk-2NE7VCYE.mjs +0 -212
  376. package/dist/chunk-2ROUFMQX.mjs +0 -543
  377. package/dist/chunk-37CD3OKS.mjs +0 -87
  378. package/dist/chunk-3MXV3VHR.mjs +0 -46
  379. package/dist/chunk-3OH67G7R.mjs +0 -214
  380. package/dist/chunk-4B7JIGQD.mjs +0 -106
  381. package/dist/chunk-5YNRKI2C.mjs +0 -81
  382. package/dist/chunk-6HTGOXIK.mjs +0 -875
  383. package/dist/chunk-6OEGXLBX.mjs +0 -57
  384. package/dist/chunk-6RC4K46J.mjs +0 -86
  385. package/dist/chunk-7GFE3PEY.mjs +0 -40
  386. package/dist/chunk-7GXJUJ24.mjs +0 -49
  387. package/dist/chunk-7V5IUP2T.mjs +0 -63
  388. package/dist/chunk-A4L7YTKX.mjs +0 -458
  389. package/dist/chunk-BEZH7VEH.mjs +0 -23
  390. package/dist/chunk-BNL5OPRV.mjs +0 -634
  391. package/dist/chunk-BTPGQC6Z.mjs +0 -27
  392. package/dist/chunk-C7XQYG6U.mjs +0 -50
  393. package/dist/chunk-CQZXZ75V.mjs +0 -562
  394. package/dist/chunk-CWS55TEX.mjs +0 -242
  395. package/dist/chunk-CZQ33DLW.mjs +0 -78
  396. package/dist/chunk-EEBCDP36.mjs +0 -32
  397. package/dist/chunk-FB6463IN.mjs +0 -1499
  398. package/dist/chunk-FCJ553HS.mjs +0 -655
  399. package/dist/chunk-FEZVDOWX.mjs +0 -6996
  400. package/dist/chunk-FOCV4CBZ.mjs +0 -87
  401. package/dist/chunk-FQBFZAWG.mjs +0 -27
  402. package/dist/chunk-G6HRSGOU.mjs +0 -74
  403. package/dist/chunk-GES7U2PM.mjs +0 -68
  404. package/dist/chunk-GH4WQ22V.mjs +0 -34
  405. package/dist/chunk-GPWMUPCA.mjs +0 -1126
  406. package/dist/chunk-GQPTDQCL.mjs +0 -54
  407. package/dist/chunk-HJSN7UYG.mjs +0 -10
  408. package/dist/chunk-I54T6CQP.mjs +0 -117
  409. package/dist/chunk-IPN7S4KX.mjs +0 -130
  410. package/dist/chunk-J4IJTTEX.mjs +0 -226
  411. package/dist/chunk-JSV6OQ4C.mjs +0 -74
  412. package/dist/chunk-K4ZIGL2O.mjs +0 -290
  413. package/dist/chunk-KAKQ74LS.mjs +0 -53
  414. package/dist/chunk-KCQYFO4K.mjs +0 -62
  415. package/dist/chunk-KHKIRS5D.mjs +0 -113
  416. package/dist/chunk-KOKM4PQN.mjs +0 -52
  417. package/dist/chunk-KP7TYHWT.mjs +0 -92
  418. package/dist/chunk-KZ3NX2P7.mjs +0 -21
  419. package/dist/chunk-L5ORED7V.mjs +0 -25
  420. package/dist/chunk-LDNCLRZU.mjs +0 -218
  421. package/dist/chunk-LHKOSI2J.mjs +0 -58
  422. package/dist/chunk-LQG5G2LY.mjs +0 -39
  423. package/dist/chunk-MATMVH65.mjs +0 -9
  424. package/dist/chunk-MP7ABPTD.mjs +0 -189
  425. package/dist/chunk-MW6BR4QP.mjs +0 -316
  426. package/dist/chunk-MWD5VPN7.mjs +0 -21
  427. package/dist/chunk-ODYKO5TO.mjs +0 -101
  428. package/dist/chunk-OG7UGJ6F.mjs +0 -63
  429. package/dist/chunk-ORN5BLL7.mjs +0 -11
  430. package/dist/chunk-OYABFKTW.mjs +0 -1974
  431. package/dist/chunk-P5LANSH6.mjs +0 -121
  432. package/dist/chunk-PELHVTO7.mjs +0 -24
  433. package/dist/chunk-PIH5SJ4N.mjs +0 -7481
  434. package/dist/chunk-PSZI4O24.mjs +0 -253
  435. package/dist/chunk-PV2CG7EJ.mjs +0 -886
  436. package/dist/chunk-PWGYQXML.mjs +0 -470
  437. package/dist/chunk-Q2UL2TPC.mjs +0 -21
  438. package/dist/chunk-QHPYS427.mjs +0 -66
  439. package/dist/chunk-QJVOLKU6.mjs +0 -111
  440. package/dist/chunk-QLDABJZM.mjs +0 -20
  441. package/dist/chunk-QYRNLLLI.mjs +0 -99
  442. package/dist/chunk-RCX4WNLC.mjs +0 -151
  443. package/dist/chunk-RFBLQLLZ.mjs +0 -16
  444. package/dist/chunk-RIHIVFIQ.mjs +0 -240
  445. package/dist/chunk-RLOES5SX.mjs +0 -31
  446. package/dist/chunk-RWURUDSP.mjs +0 -2639
  447. package/dist/chunk-RZWWB2XR.mjs +0 -96
  448. package/dist/chunk-S5LN746F.mjs +0 -10
  449. package/dist/chunk-SOI6LTHM.mjs +0 -216
  450. package/dist/chunk-SQJWAIF4.mjs +0 -12
  451. package/dist/chunk-TDIK6NTV.mjs +0 -10
  452. package/dist/chunk-TQXHPFWT.mjs +0 -177
  453. package/dist/chunk-U55XJEIG.mjs +0 -18
  454. package/dist/chunk-UD5HIS4U.mjs +0 -382
  455. package/dist/chunk-UHICS3JI.mjs +0 -83
  456. package/dist/chunk-UJDJB3NE.mjs +0 -913
  457. package/dist/chunk-VD7J552I.mjs +0 -28
  458. package/dist/chunk-VSLSGASN.mjs +0 -30
  459. package/dist/chunk-VZ2ONHEE.mjs +0 -3715
  460. package/dist/chunk-W7OSSKH5.mjs +0 -1427
  461. package/dist/chunk-WZ7YV54N.mjs +0 -152
  462. package/dist/chunk-X5CV2E2B.mjs +0 -1
  463. package/dist/chunk-Y4WPNHMC.mjs +0 -50
  464. package/dist/chunk-YEKL4JBK.mjs +0 -96
  465. package/dist/chunk-ZXNQEW43.mjs +0 -18
  466. package/dist/chunk-ZYAY26KG.mjs +0 -29
  467. package/dist/direct-executor-V5DRIECI.mjs +0 -34
  468. package/dist/durability-wiring-3TD62MBI.mjs +0 -4072
  469. package/dist/engine-hooks-HA3SBOBR.mjs +0 -54
  470. package/dist/gzip-F4HMIEEQ.mjs +0 -1
  471. package/dist/import-GPKLTSKA.mjs +0 -56
  472. package/dist/methods-7IOINERF.mjs +0 -30
  473. package/dist/module-JYHFTVPS.mjs +0 -63
  474. package/dist/operations-G5EP6JPX.mjs +0 -5
  475. package/dist/phrase-module-XW5MKWP5.mjs +0 -330
  476. package/dist/pool-Y4A46T36.mjs +0 -298
  477. package/dist/react-native/chunks/analysis-change-QUVDNABS.mjs +0 -934
  478. package/dist/react-native/chunks/analysis-change-entry-OC4XASBF.mjs +0 -1
  479. package/dist/react-native/chunks/archive-history-MJKUQLSU.mjs +0 -29
  480. package/dist/react-native/chunks/chunk-2PRHILX3.mjs +0 -529
  481. package/dist/react-native/chunks/chunk-3NQOVO3K.mjs +0 -1
  482. package/dist/react-native/chunks/chunk-3WI35N75.mjs +0 -226
  483. package/dist/react-native/chunks/chunk-4DII3ZSM.mjs +0 -73
  484. package/dist/react-native/chunks/chunk-4J74WHQM.mjs +0 -177
  485. package/dist/react-native/chunks/chunk-4NWR3NGS.mjs +0 -151
  486. package/dist/react-native/chunks/chunk-5CQX3XXV.mjs +0 -17
  487. package/dist/react-native/chunks/chunk-5MSX5FRT.mjs +0 -858
  488. package/dist/react-native/chunks/chunk-6OFDUYVX.mjs +0 -92
  489. package/dist/react-native/chunks/chunk-6VBXNFLE.mjs +0 -9
  490. package/dist/react-native/chunks/chunk-6ZELFCK5.mjs +0 -315
  491. package/dist/react-native/chunks/chunk-AAAETEJK.mjs +0 -27
  492. package/dist/react-native/chunks/chunk-AM7RSBPF.mjs +0 -32
  493. package/dist/react-native/chunks/chunk-BITYFZSZ.mjs +0 -242
  494. package/dist/react-native/chunks/chunk-C5G6TJ7A.mjs +0 -140
  495. package/dist/react-native/chunks/chunk-CHPTFFJM.mjs +0 -43
  496. package/dist/react-native/chunks/chunk-DIYDOIM4.mjs +0 -10
  497. package/dist/react-native/chunks/chunk-DMIFXZ3Q.mjs +0 -432
  498. package/dist/react-native/chunks/chunk-DVDX4SDR.mjs +0 -375
  499. package/dist/react-native/chunks/chunk-DXRSEWA2.mjs +0 -12
  500. package/dist/react-native/chunks/chunk-F753DA54.mjs +0 -23
  501. package/dist/react-native/chunks/chunk-FHPW7P2O.mjs +0 -40
  502. package/dist/react-native/chunks/chunk-FTZHMRD2.mjs +0 -18
  503. package/dist/react-native/chunks/chunk-HJBJBH26.mjs +0 -34
  504. package/dist/react-native/chunks/chunk-IAENKE2D.mjs +0 -21
  505. package/dist/react-native/chunks/chunk-IO2SMUQD.mjs +0 -10
  506. package/dist/react-native/chunks/chunk-IYNT75CE.mjs +0 -111
  507. package/dist/react-native/chunks/chunk-JDOEEMEF.mjs +0 -38
  508. package/dist/react-native/chunks/chunk-JWUCMVRK.mjs +0 -15
  509. package/dist/react-native/chunks/chunk-KSBYEMCB.mjs +0 -100
  510. package/dist/react-native/chunks/chunk-KU646XXT.mjs +0 -164
  511. package/dist/react-native/chunks/chunk-LU3Y3P63.mjs +0 -68
  512. package/dist/react-native/chunks/chunk-LVIKKAA6.mjs +0 -93
  513. package/dist/react-native/chunks/chunk-LZSLNSUN.mjs +0 -193
  514. package/dist/react-native/chunks/chunk-MJDQU5MW.mjs +0 -1225
  515. package/dist/react-native/chunks/chunk-NNE4VDMM.mjs +0 -8
  516. package/dist/react-native/chunks/chunk-NVVRSRX5.mjs +0 -78
  517. package/dist/react-native/chunks/chunk-OCSLSH27.mjs +0 -22723
  518. package/dist/react-native/chunks/chunk-PB2YXVQW.mjs +0 -29
  519. package/dist/react-native/chunks/chunk-PJHAB5ZY.mjs +0 -79
  520. package/dist/react-native/chunks/chunk-PSWKQVVT.mjs +0 -9
  521. package/dist/react-native/chunks/chunk-RDWG33MM.mjs +0 -79
  522. package/dist/react-native/chunks/chunk-SK2PWYDH.mjs +0 -654
  523. package/dist/react-native/chunks/chunk-SUPXRTMD.mjs +0 -96
  524. package/dist/react-native/chunks/chunk-TORU2OHQ.mjs +0 -218
  525. package/dist/react-native/chunks/chunk-U4KSKA4Z.mjs +0 -23
  526. package/dist/react-native/chunks/chunk-UNUFZ2QY.mjs +0 -68
  527. package/dist/react-native/chunks/chunk-WBYQRHDY.mjs +0 -86
  528. package/dist/react-native/chunks/chunk-WVWJNUMN.mjs +0 -2562
  529. package/dist/react-native/chunks/chunk-YH7QY657.mjs +0 -288
  530. package/dist/react-native/chunks/chunk-YZW4CHM6.mjs +0 -562
  531. package/dist/react-native/chunks/chunk-ZNZ6CPAZ.mjs +0 -562
  532. package/dist/react-native/chunks/chunk-ZVQMBF2H.mjs +0 -63
  533. package/dist/react-native/chunks/chunk-ZWAIN4GG.mjs +0 -2636
  534. package/dist/react-native/chunks/chunk-ZZT7CEN7.mjs +0 -92
  535. package/dist/react-native/chunks/cold-module-N6KFNNZA.mjs +0 -773
  536. package/dist/react-native/chunks/durability-wiring-RN64S2TL.mjs +0 -4984
  537. package/dist/react-native/chunks/engine-hooks-CWA5CKCA.mjs +0 -30
  538. package/dist/react-native/chunks/gzip.react-native-HLEPDKZ3.mjs +0 -3
  539. package/dist/react-native/chunks/import-5UAWBRJP.mjs +0 -32
  540. package/dist/react-native/chunks/methods-6W5U4C3H.mjs +0 -30
  541. package/dist/react-native/chunks/module-6RP4ZCBW.mjs +0 -37
  542. package/dist/react-native/chunks/operations-GNRMD6EX.mjs +0 -5
  543. package/dist/react-native/chunks/phrase-module-QK22HSQ2.mjs +0 -329
  544. package/dist/react-native/chunks/pool-JR3NJCAF.mjs +0 -297
  545. package/dist/react-native/chunks/release-2SIHZWDO.mjs +0 -32
  546. package/dist/react-native/chunks/restore-hooks-ENFMDTWC.mjs +0 -127
  547. package/dist/react-native/chunks/restore-queue-4R6AASE5.mjs +0 -55
  548. package/dist/react-native/chunks/retention-5GTFT3GR.mjs +0 -223
  549. package/dist/react-native/chunks/snapshot-5LGPQXFS.mjs +0 -976
  550. package/dist/react-native/chunks/start-ZQJVZ5DN.mjs +0 -38
  551. package/dist/react-native/chunks/sync-state-PASCIHHT.mjs +0 -15
  552. package/dist/react-native/chunks/write-6BRYIIZ7.mjs +0 -208
  553. package/dist/release-SMR4WJD4.mjs +0 -32
  554. package/dist/restore-hooks-HXLIEB4A.mjs +0 -153
  555. package/dist/restore-queue-LZH7LMLR.mjs +0 -55
  556. package/dist/retention-3K7ARGAG.mjs +0 -66
  557. package/dist/runtime-COIUORCN.mjs +0 -177
  558. package/dist/snapshot-O7ICP7NJ.mjs +0 -783
  559. package/dist/start-S4PFP6RS.mjs +0 -66
  560. package/dist/sync-state-ZWHLAFLE.mjs +0 -15
  561. package/dist/thread-YLJ3ZPQ3.mjs +0 -50
  562. package/dist/write-2OBJGLFS.mjs +0 -233
  563. /package/dist/browser/{chunk-M3MQE2X7.mjs → digest-leaf-64IPRPZD.mjs} +0 -0
  564. /package/dist/browser/{chunk-JNOAKDUM.mjs → gzip-JF3S6PPT.mjs} +0 -0
  565. /package/dist/{chunk-ZXNNR73R.mjs → gzip-2UCZW2MM.mjs} +0 -0
@@ -1,1499 +0,0 @@
1
- import { highWord, SMALLEST_NORMAL_HIGH_WORD, MAGNITUDE_MASK, lowWord, INFINITE_HIGH_WORD, withHighWord } from './chunk-7GFE3PEY.mjs';
2
- import { bitsetIsEmpty, createBitSet, bitsetSet, bitsetHas } from './chunk-7V5IUP2T.mjs';
3
- import { isPlainObject, MAX_NESTING_DEPTH } from './chunk-L5ORED7V.mjs';
4
- import { tokenize } from './chunk-A4L7YTKX.mjs';
5
- import { TARGET_BLOCK_ENTRIES, SCORE_BUFFER_INITIAL_TOUCHED_CAPACITY, PRUNING_REJECTION_SLACK, FIELD_RUN_ENTRIES_START } from './chunk-U55XJEIG.mjs';
6
- import { NarsilError, ErrorCodes } from './chunk-MP7ABPTD.mjs';
7
- import { compareCodePoints } from './chunk-TBC3XUL2.mjs';
8
-
9
- // src/core/constants.ts
10
- var POSTING_LIST_COMPACTION_THRESHOLD = 0.3;
11
- var MAX_TERM_FREQUENCY = 65535;
12
- var ARRAY_POSITION_GAP = 100;
13
- var DEFAULT_BM25_K1 = 1.2;
14
- var DEFAULT_BM25_B = 0.75;
15
- var MAX_BM25_K1 = 1e3;
16
- var MAX_BM25_B = 1;
17
- var PENDING_REMOVAL_MERGE_FLOOR = 64;
18
- var PENDING_REMOVAL_MERGE_DIVISOR = 256;
19
-
20
- // src/schema/declared-types.ts
21
- function mayDeclare(schema, typeName, depth) {
22
- if (!isPlainObject(schema) || depth > MAX_NESTING_DEPTH + 1) return false;
23
- for (const type of Object.values(schema)) {
24
- if (typeof type === "string" ? type.includes(typeName) : mayDeclare(type, typeName, depth + 1)) return true;
25
- }
26
- return false;
27
- }
28
- function schemaMayDeclare(schema, typeName) {
29
- return mayDeclare(schema, typeName, 1);
30
- }
31
-
32
- // src/workers/code-loader.ts
33
- function codeLoader(importCode, typeName) {
34
- let loaded2 = null;
35
- let loading2 = null;
36
- function load() {
37
- if (loaded2 !== null) return Promise.resolve(loaded2);
38
- if (loading2 === null) {
39
- loading2 = importCode().then(
40
- (code) => {
41
- loaded2 = code;
42
- return code;
43
- },
44
- (err) => {
45
- loading2 = null;
46
- throw err;
47
- }
48
- );
49
- }
50
- return loading2;
51
- }
52
- return {
53
- loaded: () => loaded2,
54
- require() {
55
- if (loaded2 === null) throw new Error(`The engine reached ${typeName} code before it loaded that code`);
56
- return loaded2;
57
- },
58
- load,
59
- loadFor: (schema) => loaded2 !== null || !schemaMayDeclare(schema, typeName) ? null : load()
60
- };
61
- }
62
-
63
- // src/geo/geo-code.ts
64
- var geoCode = codeLoader(() => import('./geo-index-MRH5JMIR.mjs'), "geopoint");
65
- var loadGeoCode = geoCode.load;
66
- var loadGeoCodeFor = geoCode.loadFor;
67
- function createLoadedGeoIndex() {
68
- return geoCode.require().createGeoIndex(PENDING_REMOVAL_MERGE_FLOOR, PENDING_REMOVAL_MERGE_DIVISOR);
69
- }
70
-
71
- // src/search/quotes.ts
72
- var QUOTE_CHARACTER = /["“”„]/;
73
- function holdsQuoteCharacter(term) {
74
- return QUOTE_CHARACTER.test(term);
75
- }
76
- function holdsQuotedText(term) {
77
- if (!QUOTE_CHARACTER.test(term)) return false;
78
- const parts = term.split(QUOTE_CHARACTER);
79
- for (let index = 1; index < parts.length; index += 2) {
80
- if (parts[index].trim().length > 0) return true;
81
- }
82
- return false;
83
- }
84
-
85
- // src/search/phrase-code.ts
86
- var loaded = null;
87
- var loading = null;
88
- function requireLoadedPhraseCode() {
89
- if (loaded === null) {
90
- throw new NarsilError(ErrorCodes.SEARCH_PHRASE_NOT_READY, "The phrase code has not loaded. Try the query again");
91
- }
92
- return loaded;
93
- }
94
- function loadPhraseCode() {
95
- if (loading === null) {
96
- loading = import('./phrase-module-XW5MKWP5.mjs').then(
97
- (code) => {
98
- loaded = code;
99
- return code;
100
- },
101
- (err) => {
102
- loading = null;
103
- throw new NarsilError(
104
- ErrorCodes.SEARCH_PHRASE_NOT_READY,
105
- "The phrase code failed to load. Remove the quotes, or try again once it can load",
106
- { cause: err instanceof Error ? err.message : String(err) }
107
- );
108
- }
109
- );
110
- }
111
- return loading;
112
- }
113
- function loadPhraseCodeFor(term) {
114
- if (loaded !== null || term === void 0 || !holdsQuoteCharacter(term)) return null;
115
- return loadPhraseCode();
116
- }
117
- function analyseQueryPhrases(term, language, analysis) {
118
- if (!holdsQuoteCharacter(term)) return null;
119
- return requireLoadedPhraseCode().analyseQueryPhrases(
120
- term.split(QUOTE_CHARACTER),
121
- (text) => tokenize(text, language, {
122
- stem: true,
123
- removeStopWords: true,
124
- customTokenizer: analysis.customTokenizer,
125
- stopWordOverride: analysis.stopWords
126
- }).tokens
127
- );
128
- }
129
-
130
- // src/math/log.ts
131
- var EXPONENT_BIAS = 1023;
132
- var EXPONENT_SHIFT = 20;
133
- var SUBNORMAL_SCALE_EXPONENT = 54;
134
- var ROUNDING_OFFSET = 614244;
135
- var HALVING_BIT = 1048576;
136
- var ONE_HIGH_WORD = 1072693248;
137
- var SIGNIFICAND_MASK = 1048575;
138
- var NEAR_ONE_LIMIT = 3;
139
- var LOWER_SPLIT = 398458;
140
- var UPPER_SPLIT = 440401;
141
- var LN2_HI = 0.6931471803691238;
142
- var LN2_LO = 19082149292705877e-26;
143
- var TWO54 = 18014398509481984;
144
- var TWO = 2;
145
- var THIRD = 0.3333333333333333;
146
- var HALF = 0.5;
147
- var LG1 = 0.6666666666666735;
148
- var LG2 = 0.3999999999940942;
149
- var LG3 = 0.2857142874366239;
150
- var LG4 = 0.22222198432149784;
151
- var LG5 = 0.1818357216161805;
152
- var LG6 = 0.15313837699209373;
153
- var LG7 = 0.14798198605116586;
154
- function nearOne(fraction, scale) {
155
- if (fraction === 0) {
156
- if (scale === 0) return 0;
157
- return scale * LN2_HI + scale * LN2_LO;
158
- }
159
- const cubic = fraction * fraction * (HALF - THIRD * fraction);
160
- if (scale === 0) return fraction - cubic;
161
- return scale * LN2_HI - (cubic - scale * LN2_LO - fraction);
162
- }
163
- function series(fraction, scale, significand) {
164
- const ratio = fraction / (TWO + fraction);
165
- const square = ratio * ratio;
166
- const below = significand - LOWER_SPLIT;
167
- const fourth = square * square;
168
- const above = UPPER_SPLIT - significand;
169
- const even = fourth * (LG2 + fourth * (LG4 + fourth * LG6));
170
- const odd = square * (LG1 + fourth * (LG3 + fourth * (LG5 + fourth * LG7)));
171
- const poly = odd + even;
172
- if ((below | above) > 0) {
173
- const halfSquare = HALF * fraction * fraction;
174
- if (scale === 0) return fraction - (halfSquare - ratio * (halfSquare + poly));
175
- return scale * LN2_HI - (halfSquare - (ratio * (halfSquare + poly) + scale * LN2_LO) - fraction);
176
- }
177
- if (scale === 0) return fraction - ratio * (fraction - poly);
178
- return scale * LN2_HI - (ratio * (fraction - poly) - scale * LN2_LO - fraction);
179
- }
180
- function log(value) {
181
- let high = highWord(value);
182
- let scale = 0;
183
- let scaled = value;
184
- if (high < SMALLEST_NORMAL_HIGH_WORD) {
185
- if ((high & MAGNITUDE_MASK | lowWord(value)) === 0) return Number.NEGATIVE_INFINITY;
186
- if (high < 0) return Number.NaN;
187
- scale -= SUBNORMAL_SCALE_EXPONENT;
188
- scaled *= TWO54;
189
- high = highWord(scaled);
190
- }
191
- if (high >= INFINITE_HIGH_WORD) return scaled + scaled;
192
- scale += (high >> EXPONENT_SHIFT) - EXPONENT_BIAS;
193
- const significand = high & SIGNIFICAND_MASK;
194
- const halving = significand + ROUNDING_OFFSET & HALVING_BIT;
195
- scaled = withHighWord(scaled, significand | halving ^ ONE_HIGH_WORD);
196
- scale += halving >> EXPONENT_SHIFT;
197
- const fraction = scaled - 1;
198
- if ((SIGNIFICAND_MASK & 2 + significand) < NEAR_ONE_LIMIT) return nearOne(fraction, scale);
199
- return series(fraction, scale, significand);
200
- }
201
-
202
- // src/core/scorer.ts
203
- function computeIDF(docFrequency, totalDocs) {
204
- if (totalDocs === 0) return 0;
205
- return log((totalDocs - docFrequency + 0.5) / (docFrequency + 0.5) + 1);
206
- }
207
- function pairKeepsBoundSound(k1, b) {
208
- return k1 >= 0 && k1 <= MAX_BM25_K1 && b >= 0 && b <= MAX_BM25_B;
209
- }
210
- function bm25PruningSound(params) {
211
- const k1 = params?.k1 ?? DEFAULT_BM25_K1;
212
- const b = params?.b ?? DEFAULT_BM25_B;
213
- if (!pairKeepsBoundSound(k1, b)) return false;
214
- const fields = params?.fields;
215
- if (fields === void 0) return true;
216
- for (const name of Object.keys(fields)) {
217
- if (!pairKeepsBoundSound(fields[name].k1 ?? k1, fields[name].b ?? b)) return false;
218
- }
219
- return true;
220
- }
221
- function bm25SetsValue(params) {
222
- if (typeof params !== "object" || params === null) return params !== void 0;
223
- if (params.k1 !== void 0 || params.b !== void 0) return true;
224
- const fields = params.fields;
225
- if (fields === void 0) return false;
226
- if (typeof fields !== "object" || fields === null) return true;
227
- for (const name of Object.keys(fields)) {
228
- const pair = fields[name];
229
- if (typeof pair !== "object" || pair === null) return true;
230
- if (pair.k1 !== void 0 || pair.b !== void 0) return true;
231
- }
232
- return false;
233
- }
234
- function ownField(fields, name) {
235
- return fields !== void 0 && Object.hasOwn(fields, name) ? fields[name] : void 0;
236
- }
237
- function mergeBM25Levels(search, index) {
238
- if (search === void 0 || !bm25SetsValue(search)) return index;
239
- const k1 = search.k1 ?? index?.k1;
240
- const b = search.b ?? index?.b;
241
- const merged = {
242
- ...k1 !== void 0 ? { k1 } : {},
243
- ...b !== void 0 ? { b } : {}
244
- };
245
- const names = [...Object.keys(search.fields ?? {}), ...Object.keys(index?.fields ?? {})];
246
- if (names.length === 0) return merged;
247
- const fields = /* @__PURE__ */ Object.create(null);
248
- for (const name of names) {
249
- const fromSearch = ownField(search.fields, name);
250
- const fromIndex = ownField(index?.fields, name);
251
- const fieldK1 = fromSearch?.k1 ?? search.k1 ?? fromIndex?.k1;
252
- const fieldB = fromSearch?.b ?? search.b ?? fromIndex?.b;
253
- fields[name] = {
254
- ...fieldK1 !== void 0 ? { k1: fieldK1 } : {},
255
- ...fieldB !== void 0 ? { b: fieldB } : {}
256
- };
257
- }
258
- merged.fields = fields;
259
- return merged;
260
- }
261
- function computeBM25WithIDF(termFrequency, idf, fieldLength, avgFieldLength, k1, b) {
262
- if (avgFieldLength === 0) return 0;
263
- const numerator = termFrequency * (k1 + 1);
264
- const denominator = termFrequency + k1 * (1 - b + b * fieldLength / avgFieldLength);
265
- if (denominator === 0) return 0;
266
- return idf * (numerator / denominator);
267
- }
268
-
269
- // src/core/partition/field-order.ts
270
- var fieldRun = { entries: new Uint32Array(FIELD_RUN_ENTRIES_START), length: 0 };
271
- var ranksByFieldNames = /* @__PURE__ */ new WeakMap();
272
- var ONLY_FIELD_RANKS = new Uint32Array(1);
273
- function fieldNameRanks(fieldNames) {
274
- if (fieldNames.length < 2) return ONLY_FIELD_RANKS;
275
- const held = ranksByFieldNames.get(fieldNames);
276
- if (held !== void 0 && held.length === fieldNames.length) return held;
277
- const order = Array.from(fieldNames.keys()).sort(
278
- (left, right) => compareCodePoints(fieldNames[left], fieldNames[right])
279
- );
280
- const ranks = new Uint32Array(order.length);
281
- for (let rank = 0; rank < order.length; rank++) ranks[order[rank]] = rank;
282
- ranksByFieldNames.set(fieldNames, ranks);
283
- return ranks;
284
- }
285
- function orderRunByFieldName(docIds, fieldIndices, ranks, start, count) {
286
- let entries = fieldRun.entries;
287
- let end = start;
288
- for (; end < count && docIds[end] === docIds[start]; end++) {
289
- let slot = end - start;
290
- if (slot === entries.length) {
291
- const grown = new Uint32Array(slot * 2);
292
- grown.set(entries);
293
- entries = fieldRun.entries = grown;
294
- }
295
- const rank = ranks[fieldIndices[end]];
296
- while (slot > 0 && ranks[fieldIndices[entries[slot - 1]]] > rank) {
297
- entries[slot] = entries[slot - 1];
298
- slot--;
299
- }
300
- entries[slot] = end;
301
- }
302
- fieldRun.length = end - start;
303
- return entries;
304
- }
305
-
306
- // src/core/partition/field-scoring.ts
307
- var NO_FIELD_VALUES = new Float64Array(0);
308
- function differentPairsOf(searchable, k1s, bs) {
309
- const pairs = [];
310
- for (let fieldIndex = 0; fieldIndex < searchable.length; fieldIndex++) {
311
- if (searchable[fieldIndex] !== 1) continue;
312
- let seen = false;
313
- for (let at = 0; at < pairs.length && !seen; at += 2) {
314
- seen = pairs[at] === k1s[fieldIndex] && pairs[at + 1] === bs[fieldIndex];
315
- }
316
- if (!seen) pairs.push(k1s[fieldIndex], bs[fieldIndex]);
317
- }
318
- return pairs;
319
- }
320
- function loadFieldScoring(state, fields, boost, averageFieldLengths, bm25) {
321
- const fieldNames = state.fieldNameTable.names;
322
- const fieldCount = fieldNames.length;
323
- const k1 = bm25?.k1 ?? DEFAULT_BM25_K1;
324
- const b = bm25?.b ?? DEFAULT_BM25_B;
325
- const perField = bm25?.fields;
326
- const scoring = {
327
- searchable: new Uint8Array(fieldCount),
328
- boosts: new Float64Array(fieldCount),
329
- averageLengths: new Float64Array(fieldCount),
330
- lengthColumns: new Array(fieldCount).fill(null),
331
- k1s: perField === void 0 ? NO_FIELD_VALUES : new Float64Array(fieldCount),
332
- bs: perField === void 0 ? NO_FIELD_VALUES : new Float64Array(fieldCount),
333
- boundPairs: [k1, b],
334
- nameRanks: fieldNameRanks(fieldNames)
335
- };
336
- for (let fieldIndex = 0; fieldIndex < fieldCount; fieldIndex++) {
337
- const fieldName = fieldNames[fieldIndex];
338
- scoring.searchable[fieldIndex] = fields === void 0 || fields.includes(fieldName) ? 1 : 0;
339
- scoring.boosts[fieldIndex] = boost?.[fieldName] ?? 1;
340
- scoring.averageLengths[fieldIndex] = averageFieldLengths[fieldName] ?? 1;
341
- scoring.lengthColumns[fieldIndex] = state.docStore.fieldLengthColumn(fieldName);
342
- if (perField !== void 0) {
343
- const fieldPair = Object.hasOwn(perField, fieldName) ? perField[fieldName] : void 0;
344
- scoring.k1s[fieldIndex] = fieldPair?.k1 ?? k1;
345
- scoring.bs[fieldIndex] = fieldPair?.b ?? b;
346
- }
347
- }
348
- if (perField !== void 0) scoring.boundPairs = differentPairsOf(scoring.searchable, scoring.k1s, scoring.bs);
349
- return scoring;
350
- }
351
- function fieldLengthOf(columns, fieldIndex, internalId, averageLength) {
352
- const column = fieldIndex < columns.length ? columns[fieldIndex] : null;
353
- if (column === null || internalId >= column.length) return averageLength;
354
- const stored = column[internalId];
355
- return stored > 0 ? stored : averageLength;
356
- }
357
- function bestSearchable(searchable, values) {
358
- let best = 0;
359
- for (let index = 0; index < searchable.length; index++) {
360
- if (searchable[index] === 1 && values[index] > best) best = values[index];
361
- }
362
- return best;
363
- }
364
- function blockEntryBound(fields, maxTermFrequency, idf, minFieldLength, maxAverageLength) {
365
- const pairs = fields.boundPairs;
366
- let best = 0;
367
- for (let at = 0; at < pairs.length; at += 2) {
368
- const bound = computeBM25WithIDF(maxTermFrequency, idf, minFieldLength, maxAverageLength, pairs[at], pairs[at + 1]);
369
- if (bound > best) best = bound;
370
- }
371
- return best;
372
- }
373
-
374
- // src/core/partition/posting-columns.ts
375
- function postingColumns(list) {
376
- const deletedDocs = list.deletedDocs;
377
- return {
378
- docIds: list.docIds,
379
- termFrequencies: list.termFrequencies,
380
- fieldNameIndices: list.fieldNameIndices,
381
- deletedDocs,
382
- hasDeleted: deletedDocs.size > 0,
383
- count: list.length
384
- };
385
- }
386
-
387
- // src/core/partition/scoring.ts
388
- var EMPTY_COMPONENTS = Object.freeze({});
389
- function recordComponents(components, internalId, fieldName, token, termFrequency, fieldLength, idf) {
390
- const existing = components.get(internalId);
391
- if (existing) {
392
- existing.termFrequencies[`${fieldName}:${token}`] = termFrequency;
393
- existing.fieldLengths[fieldName] = fieldLength;
394
- existing.idf[token] = idf;
395
- return;
396
- }
397
- components.set(internalId, {
398
- termFrequencies: { [`${fieldName}:${token}`]: termFrequency },
399
- fieldLengths: { [fieldName]: fieldLength },
400
- idf: { [token]: idf }
401
- });
402
- }
403
- function mergeGroupComponents(components, internalId, contribution) {
404
- const existing = components.get(internalId);
405
- if (existing) {
406
- Object.assign(existing.termFrequencies, contribution.termFrequencies);
407
- Object.assign(existing.fieldLengths, contribution.fieldLengths);
408
- existing.idf[contribution.token] = contribution.idf;
409
- return;
410
- }
411
- components.set(internalId, {
412
- termFrequencies: contribution.termFrequencies,
413
- fieldLengths: contribution.fieldLengths,
414
- idf: { [contribution.token]: contribution.idf }
415
- });
416
- }
417
-
418
- // src/core/partition/group-scoring.ts
419
- function partialFieldMarks(fieldNames, partialFields) {
420
- const marks = new Uint8Array(fieldNames.length);
421
- if (partialFields === void 0 || partialFields.length === 0) return marks;
422
- for (let fieldIndex = 0; fieldIndex < fieldNames.length; fieldIndex++) {
423
- if (partialFields.includes(fieldNames[fieldIndex])) marks[fieldIndex] = 1;
424
- }
425
- return marks;
426
- }
427
- function termGroupOf(groups, token) {
428
- if (groups === void 0) return void 0;
429
- for (const group of groups) {
430
- if (group.token === token) return group;
431
- }
432
- return void 0;
433
- }
434
- function typoMatchesFor(index, token, group, exact, tolerance, prefixLength) {
435
- if (group !== void 0) {
436
- if (!group.typoMatches || exact || tolerance === 0) return [];
437
- return index.fuzzyLookup(token, tolerance, prefixLength).filter((match) => match.token !== token && group.synonyms?.has(match.token) !== true).sort(byToken);
438
- }
439
- if (!exact) {
440
- const matches = index.fuzzyLookup(token, tolerance, prefixLength);
441
- return matches.length > 1 ? matches.sort(byToken) : matches;
442
- }
443
- const postingList = index.lookup(token);
444
- return postingList ? [{ token, postingList }] : [];
445
- }
446
- function byToken(left, right) {
447
- return compareCodePoints(left.token, right.token);
448
- }
449
- function resolveGroupMatches(context, group) {
450
- const frequencyOf = (token) => context.globalFrequency(token) ?? context.index.documentFrequency(token);
451
- const lookup = (token) => context.index.lookup(token);
452
- const synonyms = group.synonyms;
453
- let groupDocumentFrequency = synonyms?.documentFrequency(frequencyOf) ?? 0;
454
- const found = [];
455
- for (const member of group.members) {
456
- const documents = frequencyOf(member.token);
457
- if (documents > groupDocumentFrequency) groupDocumentFrequency = documents;
458
- const postingList = synonyms !== void 0 && member.token === group.token ? synonyms.postings(lookup, member.token) : lookup(member.token);
459
- if (postingList === void 0) continue;
460
- found.push({ token: member.token, factor: member.factor, partialFactor: member.partialFactor, postingList });
461
- }
462
- if (found.length === 0) return [];
463
- const idf = computeIDF(groupDocumentFrequency, context.totalDocs);
464
- return found.map((entry) => ({ ...entry, idf }));
465
- }
466
- function groupPostingCount(matches) {
467
- let total = 0;
468
- for (const match of matches) total += match.postingList.length;
469
- return total;
470
- }
471
- function computeGroupContributions(context, matches, collect) {
472
- const { fields, fieldNames, filterBitset, partialMarks } = context;
473
- const scoresAreZero = context.totalDocs === 0;
474
- const onePair = fields.boundPairs.length === 2;
475
- const best = /* @__PURE__ */ new Map();
476
- for (const match of matches) {
477
- const perTerm = /* @__PURE__ */ new Map();
478
- const { docIds, termFrequencies, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(
479
- match.postingList
480
- );
481
- let runStart = 0;
482
- let runEnd = 0;
483
- for (let at = 0; at < count; at++) {
484
- const internalId = docIds[at];
485
- if (hasDeleted && deletedDocs.has(internalId)) continue;
486
- if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
487
- let pi = at;
488
- if (at < runEnd) {
489
- pi = fieldRun.entries[at - runStart];
490
- } else if (at + 2 < count && docIds[at + 2] === internalId) {
491
- pi = orderRunByFieldName(docIds, fieldNameIndices, fields.nameRanks, at, count)[0];
492
- runStart = at;
493
- runEnd = at + fieldRun.length;
494
- }
495
- const fieldIndex = fieldNameIndices[pi];
496
- if (fields.searchable[fieldIndex] === 0) continue;
497
- const factor = partialMarks[fieldIndex] === 1 ? match.partialFactor : match.factor;
498
- if (factor === 0) continue;
499
- const fieldName = fieldNames[fieldIndex];
500
- const termFrequency = termFrequencies[pi];
501
- const fieldBoost = fields.boosts[fieldIndex];
502
- const avgLen = fields.averageLengths[fieldIndex];
503
- const actualFieldLength = fieldLengthOf(fields.lengthColumns, fieldIndex, internalId, avgLen);
504
- const termScore = (scoresAreZero ? 0 : computeBM25WithIDF(
505
- termFrequency,
506
- match.idf,
507
- actualFieldLength,
508
- avgLen,
509
- onePair ? fields.boundPairs[0] : fields.k1s[fieldIndex],
510
- onePair ? fields.boundPairs[1] : fields.bs[fieldIndex]
511
- )) * fieldBoost * factor;
512
- const existing = perTerm.get(internalId);
513
- if (existing) {
514
- existing.score += termScore;
515
- if (collect) {
516
- existing.termFrequencies[`${fieldName}:${match.token}`] = termFrequency;
517
- existing.fieldLengths[fieldName] = actualFieldLength;
518
- }
519
- } else if (collect) {
520
- perTerm.set(internalId, {
521
- score: termScore,
522
- token: match.token,
523
- idf: match.idf,
524
- termFrequencies: { [`${fieldName}:${match.token}`]: termFrequency },
525
- fieldLengths: { [fieldName]: actualFieldLength }
526
- });
527
- } else {
528
- perTerm.set(internalId, {
529
- score: termScore,
530
- token: match.token,
531
- idf: match.idf,
532
- termFrequencies: EMPTY_COMPONENTS,
533
- fieldLengths: EMPTY_COMPONENTS
534
- });
535
- }
536
- }
537
- for (const [internalId, contribution] of perTerm) {
538
- const current = best.get(internalId);
539
- if (!current || contribution.score > current.score) {
540
- best.set(internalId, contribution);
541
- }
542
- }
543
- }
544
- return best;
545
- }
546
-
547
- // src/core/partition/block-bounds.ts
548
- var ABSENT_FIELD_LENGTH_BOUND = 0;
549
- var boundsByList = /* @__PURE__ */ new WeakMap();
550
- function fieldLengthBound(columns, fieldIndex, internalId) {
551
- const column = fieldIndex < columns.length ? columns[fieldIndex] : null;
552
- if (column === null || internalId >= column.length) return ABSENT_FIELD_LENGTH_BOUND;
553
- const stored = column[internalId];
554
- return stored > 0 ? stored : ABSENT_FIELD_LENGTH_BOUND;
555
- }
556
- function entriesCovered(bounds) {
557
- return bounds.blockCount === 0 ? 0 : bounds.entryEnd[bounds.blockCount - 1];
558
- }
559
- function scanPostingBlocks(list, columns, previous, keepBlocks) {
560
- const { docIds, termFrequencies, fieldNameIndices, length } = list;
561
- const startEntry = previous !== null && keepBlocks > 0 ? previous.entryEnd[keepBlocks - 1] : 0;
562
- const capacity = keepBlocks + Math.ceil((length - startEntry) / TARGET_BLOCK_ENTRIES) + 1;
563
- const entryEnd = new Int32Array(capacity);
564
- const maxTermFrequency = new Int32Array(capacity);
565
- const minFieldLength = new Float64Array(capacity);
566
- const maxEntriesPerDocument = new Int32Array(capacity);
567
- const documentCount = new Int32Array(capacity);
568
- if (previous !== null && keepBlocks > 0) {
569
- entryEnd.set(previous.entryEnd.subarray(0, keepBlocks));
570
- maxTermFrequency.set(previous.maxTermFrequency.subarray(0, keepBlocks));
571
- minFieldLength.set(previous.minFieldLength.subarray(0, keepBlocks));
572
- maxEntriesPerDocument.set(previous.maxEntriesPerDocument.subarray(0, keepBlocks));
573
- documentCount.set(previous.documentCount.subarray(0, keepBlocks));
574
- }
575
- const deleted = list.deletedDocs;
576
- const hasDeleted = deleted.size > 0;
577
- let blockIndex = keepBlocks;
578
- let blockStart = startEntry;
579
- let blockMaxTf = 0;
580
- let blockMinLen = Number.POSITIVE_INFINITY;
581
- let blockMaxRun = 0;
582
- let blockDocs = 0;
583
- let entry = startEntry;
584
- while (entry < length) {
585
- const docId = docIds[entry];
586
- const tombstoned = hasDeleted && deleted.has(docId);
587
- let run = 0;
588
- while (entry + run < length && docIds[entry + run] === docId) {
589
- if (!tombstoned) {
590
- const position = entry + run;
591
- const termFrequency = termFrequencies[position];
592
- if (termFrequency > blockMaxTf) blockMaxTf = termFrequency;
593
- const fieldLength = fieldLengthBound(columns, fieldNameIndices[position], docId);
594
- if (fieldLength < blockMinLen) blockMinLen = fieldLength;
595
- }
596
- run++;
597
- }
598
- if (!tombstoned) {
599
- if (run > blockMaxRun) blockMaxRun = run;
600
- blockDocs++;
601
- }
602
- entry += run;
603
- if (entry - blockStart >= TARGET_BLOCK_ENTRIES || entry === length) {
604
- entryEnd[blockIndex] = entry;
605
- maxTermFrequency[blockIndex] = blockMaxTf;
606
- minFieldLength[blockIndex] = blockMinLen === Number.POSITIVE_INFINITY ? ABSENT_FIELD_LENGTH_BOUND : blockMinLen;
607
- maxEntriesPerDocument[blockIndex] = blockMaxRun;
608
- documentCount[blockIndex] = blockDocs;
609
- blockIndex++;
610
- blockStart = entry;
611
- blockMaxTf = 0;
612
- blockMinLen = Number.POSITIVE_INFINITY;
613
- blockMaxRun = 0;
614
- blockDocs = 0;
615
- }
616
- }
617
- return {
618
- structureRevision: list.structureRevision,
619
- blockCount: blockIndex,
620
- entryEnd,
621
- maxTermFrequency,
622
- minFieldLength,
623
- maxEntriesPerDocument,
624
- documentCount
625
- };
626
- }
627
- function blockBoundsFor(list, columns) {
628
- const existing = boundsByList.get(list);
629
- if (existing !== void 0 && existing.structureRevision === list.structureRevision) {
630
- const covered = entriesCovered(existing);
631
- if (covered === list.length) return existing;
632
- if (list.ordered && covered < list.length) {
633
- const extended = scanPostingBlocks(list, columns, existing, Math.max(0, existing.blockCount - 1));
634
- boundsByList.set(list, extended);
635
- return extended;
636
- }
637
- }
638
- const stored = list.storedBlockBounds?.() ?? null;
639
- const built = stored === null ? scanPostingBlocks(list, columns, null, 0) : { ...stored, structureRevision: list.structureRevision };
640
- boundsByList.set(list, built);
641
- return built;
642
- }
643
-
644
- // src/core/partition/top-k-heap.ts
645
- function candidateWorse(a, b) {
646
- if (a.score !== b.score) return a.score < b.score;
647
- return compareCodePoints(a.externalId, b.externalId) > 0;
648
- }
649
- function buildMinHeap(heap) {
650
- for (let index = (heap.length >> 1) - 1; index >= 0; index--) {
651
- siftDown(heap, index);
652
- }
653
- }
654
- function siftDown(heap, start) {
655
- const len = heap.length;
656
- let current = start;
657
- for (; ; ) {
658
- let worst = current;
659
- const left = 2 * current + 1;
660
- const right = 2 * current + 2;
661
- if (left < len && candidateWorse(heap[left], heap[worst])) worst = left;
662
- if (right < len && candidateWorse(heap[right], heap[worst])) worst = right;
663
- if (worst === current) break;
664
- const held = heap[current];
665
- heap[current] = heap[worst];
666
- heap[worst] = held;
667
- current = worst;
668
- }
669
- }
670
- function sortSelection(heap) {
671
- heap.sort((a, b) => b.score - a.score || compareCodePoints(a.externalId, b.externalId));
672
- }
673
-
674
- // src/core/partition/score-buffer.ts
675
- var MAX_GENERATION = 2147483647;
676
- function createScoreBuffer(capacity) {
677
- return {
678
- scores: new Float64Array(capacity),
679
- stamps: new Int32Array(capacity),
680
- touched: new Int32Array(Math.max(1, Math.min(capacity, SCORE_BUFFER_INITIAL_TOUCHED_CAPACITY))),
681
- touchedCount: 0,
682
- generation: 0
683
- };
684
- }
685
- function beginScoring(buffer, capacity) {
686
- if (buffer.scores.length < capacity) {
687
- buffer.scores = new Float64Array(capacity);
688
- buffer.stamps = new Int32Array(capacity);
689
- buffer.generation = 0;
690
- }
691
- if (buffer.generation >= MAX_GENERATION) {
692
- buffer.stamps.fill(0);
693
- buffer.generation = 0;
694
- }
695
- buffer.generation++;
696
- buffer.touchedCount = 0;
697
- }
698
- function appendTouched(buffer, internalId) {
699
- if (buffer.touchedCount === buffer.touched.length) {
700
- const grown = new Int32Array(buffer.touched.length * 2);
701
- grown.set(buffer.touched);
702
- buffer.touched = grown;
703
- }
704
- buffer.touched[buffer.touchedCount] = internalId;
705
- buffer.touchedCount++;
706
- }
707
- function addScore(buffer, internalId, termScore) {
708
- if (buffer.stamps[internalId] === buffer.generation) {
709
- buffer.scores[internalId] += termScore;
710
- return;
711
- }
712
- buffer.stamps[internalId] = buffer.generation;
713
- buffer.scores[internalId] = termScore;
714
- appendTouched(buffer, internalId);
715
- }
716
- function markCounted(buffer, internalId) {
717
- const countedStamp = -buffer.generation;
718
- const stamp = buffer.stamps[internalId];
719
- if (stamp === buffer.generation || stamp === countedStamp) return false;
720
- buffer.stamps[internalId] = countedStamp;
721
- return true;
722
- }
723
- function kthBestScore(buffer, selection, resolver) {
724
- const wanted = selection.length;
725
- const { touched, touchedCount, scores } = buffer;
726
- let size = 0;
727
- for (let index = 0; index < touchedCount; index++) {
728
- const internalId = touched[index];
729
- const score = scores[internalId];
730
- if (size === wanted && score <= selection[0]) continue;
731
- if (!resolver.isLive(internalId)) continue;
732
- let at = 0;
733
- if (size < wanted) {
734
- at = size++;
735
- while (at > 0) {
736
- const parent = at - 1 >> 1;
737
- if (selection[parent] <= score) break;
738
- selection[at] = selection[parent];
739
- at = parent;
740
- }
741
- } else {
742
- for (; ; ) {
743
- const left = 2 * at + 1;
744
- if (left >= size) break;
745
- const right = left + 1;
746
- const child = right < size && selection[right] < selection[left] ? right : left;
747
- if (selection[child] >= score) break;
748
- selection[at] = selection[child];
749
- at = child;
750
- }
751
- }
752
- selection[at] = score;
753
- }
754
- return wanted > 0 && size === wanted ? selection[0] : Number.NEGATIVE_INFINITY;
755
- }
756
- function hasScore(buffer, internalId) {
757
- return buffer.stamps[internalId] === buffer.generation;
758
- }
759
- function topKFromBuffer(buffer, k, resolver, components) {
760
- const wanted = Number.isFinite(k) ? Math.max(0, Math.floor(k)) : 0;
761
- if (wanted <= 0) return [];
762
- const heap = [];
763
- const { touched, touchedCount, scores } = buffer;
764
- let full = false;
765
- let threshold = 0;
766
- for (let index = 0; index < touchedCount; index++) {
767
- const internalId = touched[index];
768
- const score = scores[internalId];
769
- if (full && score < threshold) continue;
770
- const externalId = resolver.toExternal(internalId);
771
- if (externalId === void 0) continue;
772
- const candidate = { internalId, externalId, score };
773
- if (!full) {
774
- heap.push(candidate);
775
- if (heap.length === wanted) {
776
- buildMinHeap(heap);
777
- full = true;
778
- threshold = heap[0].score;
779
- }
780
- continue;
781
- }
782
- if (candidateWorse(heap[0], candidate)) {
783
- heap[0] = candidate;
784
- siftDown(heap, 0);
785
- threshold = heap[0].score;
786
- }
787
- }
788
- sortSelection(heap);
789
- const result = new Array(heap.length);
790
- for (let index = 0; index < heap.length; index++) {
791
- const entry = heap[index];
792
- const record = components?.get(entry.internalId);
793
- result[index] = {
794
- docId: entry.externalId,
795
- score: entry.score,
796
- termFrequencies: record?.termFrequencies ?? EMPTY_COMPONENTS,
797
- fieldLengths: record?.fieldLengths ?? EMPTY_COMPONENTS,
798
- idf: record?.idf ?? EMPTY_COMPONENTS
799
- };
800
- }
801
- return result;
802
- }
803
-
804
- // src/core/partition/multi-term-topk.ts
805
- function prunableMultiTermLists(params, index) {
806
- if (params.queryTokens.length < 2) return null;
807
- if (params.termGroups !== void 0 && params.termGroups.length > 0) return null;
808
- if (params.exact !== true && (params.tolerance ?? 0) !== 0) return null;
809
- if (params.termMatch !== void 0 && params.termMatch !== "any") return null;
810
- if (params.collectComponents !== false) return null;
811
- if (params.collectMatchedSet !== void 0) return null;
812
- if (params.maxResults === void 0) return null;
813
- if (params.filterBitset !== void 0) return null;
814
- if (!bm25PruningSound(params.bm25Params)) return null;
815
- const terms = [];
816
- for (const queryToken of params.queryTokens) {
817
- const list = index.lookup(queryToken.token);
818
- if (list === void 0) continue;
819
- if (!list.ordered) return null;
820
- terms.push({ token: queryToken.token, list });
821
- }
822
- return terms;
823
- }
824
- function boostsKeepScoresNonNegative(fields) {
825
- for (let fieldIndex = 0; fieldIndex < fields.searchable.length; fieldIndex++) {
826
- if (fields.searchable[fieldIndex] !== 1) continue;
827
- const boost = fields.boosts[fieldIndex];
828
- if (!Number.isFinite(boost) || boost < 0) return false;
829
- }
830
- return true;
831
- }
832
- function samePairUpperBound(scan, list, maxBoost, maxAverageLength) {
833
- if (scan.scoresAreZero) return 0;
834
- const bounds = blockBoundsFor(list, scan.fields.lengthColumns);
835
- let best = 0;
836
- for (let block = 0; block < bounds.blockCount; block++) {
837
- const bestEntry = computeBM25WithIDF(
838
- bounds.maxTermFrequency[block],
839
- scan.idf,
840
- bounds.minFieldLength[block],
841
- maxAverageLength,
842
- scan.k1,
843
- scan.b
844
- );
845
- const blockBound = bestEntry * maxBoost * bounds.maxEntriesPerDocument[block];
846
- if (blockBound > best) best = blockBound;
847
- }
848
- return best;
849
- }
850
- function fieldPairUpperBound(scan, list, maxBoost, maxAverageLength) {
851
- if (scan.scoresAreZero) return 0;
852
- const bounds = blockBoundsFor(list, scan.fields.lengthColumns);
853
- let best = 0;
854
- for (let block = 0; block < bounds.blockCount; block++) {
855
- const bestEntry = blockEntryBound(
856
- scan.fields,
857
- bounds.maxTermFrequency[block],
858
- scan.idf,
859
- bounds.minFieldLength[block],
860
- maxAverageLength
861
- );
862
- const blockBound = bestEntry * maxBoost * bounds.maxEntriesPerDocument[block];
863
- if (blockBound > best) best = blockBound;
864
- }
865
- return best;
866
- }
867
- function samePairEntryScore(scan, entry, internalId) {
868
- const { fields, columns } = scan;
869
- const fieldIndex = columns.fieldNameIndices[entry];
870
- const averageLength = fields.averageLengths[fieldIndex];
871
- const fieldLength = fieldLengthOf(fields.lengthColumns, fieldIndex, internalId, averageLength);
872
- const bm25 = scan.scoresAreZero ? 0 : computeBM25WithIDF(columns.termFrequencies[entry], scan.idf, fieldLength, averageLength, scan.k1, scan.b);
873
- return bm25 * fields.boosts[fieldIndex];
874
- }
875
- function fieldPairEntryScore(scan, entry, internalId) {
876
- const { fields, columns } = scan;
877
- const fieldIndex = columns.fieldNameIndices[entry];
878
- const averageLength = fields.averageLengths[fieldIndex];
879
- const fieldLength = fieldLengthOf(fields.lengthColumns, fieldIndex, internalId, averageLength);
880
- const bm25 = scan.scoresAreZero ? 0 : computeBM25WithIDF(
881
- columns.termFrequencies[entry],
882
- scan.idf,
883
- fieldLength,
884
- averageLength,
885
- fields.k1s[fieldIndex],
886
- fields.bs[fieldIndex]
887
- );
888
- return bm25 * fields.boosts[fieldIndex];
889
- }
890
- function samePairScoreEveryDocument(scan, buffer) {
891
- const { docIds, fieldNameIndices, deletedDocs, hasDeleted, count } = scan.columns;
892
- const searchable = scan.fields.searchable;
893
- for (let entry = 0; entry < count; entry++) {
894
- const internalId = docIds[entry];
895
- if (hasDeleted && deletedDocs.has(internalId)) continue;
896
- if (searchable[fieldNameIndices[entry]] !== 1) continue;
897
- addScore(buffer, internalId, samePairEntryScore(scan, entry, internalId));
898
- }
899
- }
900
- function fieldPairScoreEveryDocument(scan, buffer) {
901
- const { docIds, fieldNameIndices, deletedDocs, hasDeleted, count } = scan.columns;
902
- const searchable = scan.fields.searchable;
903
- for (let entry = 0; entry < count; entry++) {
904
- const internalId = docIds[entry];
905
- if (hasDeleted && deletedDocs.has(internalId)) continue;
906
- if (searchable[fieldNameIndices[entry]] !== 1) continue;
907
- addScore(buffer, internalId, fieldPairEntryScore(scan, entry, internalId));
908
- }
909
- }
910
- function samePairScoreKnownDocuments(scan, buffer) {
911
- const { docIds, fieldNameIndices, deletedDocs, hasDeleted, count } = scan.columns;
912
- const searchable = scan.fields.searchable;
913
- let counted = 0;
914
- for (let entry = 0; entry < count; entry++) {
915
- const internalId = docIds[entry];
916
- if (hasDeleted && deletedDocs.has(internalId)) continue;
917
- if (searchable[fieldNameIndices[entry]] !== 1) continue;
918
- if (hasScore(buffer, internalId)) addScore(buffer, internalId, samePairEntryScore(scan, entry, internalId));
919
- else if (markCounted(buffer, internalId)) counted++;
920
- }
921
- return counted;
922
- }
923
- function fieldPairScoreKnownDocuments(scan, buffer) {
924
- const { docIds, fieldNameIndices, deletedDocs, hasDeleted, count } = scan.columns;
925
- const searchable = scan.fields.searchable;
926
- let counted = 0;
927
- for (let entry = 0; entry < count; entry++) {
928
- const internalId = docIds[entry];
929
- if (hasDeleted && deletedDocs.has(internalId)) continue;
930
- if (searchable[fieldNameIndices[entry]] !== 1) continue;
931
- if (hasScore(buffer, internalId)) addScore(buffer, internalId, fieldPairEntryScore(scan, entry, internalId));
932
- else if (markCounted(buffer, internalId)) counted++;
933
- }
934
- return counted;
935
- }
936
- function firstEntryOf(docIds, count, internalId) {
937
- let low = 0;
938
- let high = count;
939
- while (low < high) {
940
- const middle = low + high >>> 1;
941
- if (docIds[middle] < internalId) low = middle + 1;
942
- else high = middle;
943
- }
944
- return low;
945
- }
946
- function fieldOrderedRunScore(scan, start, internalId, total, entryScore) {
947
- const { docIds, fieldNameIndices, count } = scan.columns;
948
- const ordered = orderRunByFieldName(docIds, fieldNameIndices, scan.fields.nameRanks, start, count);
949
- let score = total;
950
- for (let at = 0; at < fieldRun.length; at++) {
951
- const row = ordered[at];
952
- if (scan.fields.searchable[fieldNameIndices[row]] !== 1) continue;
953
- score += entryScore(scan, row, internalId);
954
- }
955
- return score;
956
- }
957
- function samePairQueryOrderScore(scans, internalId) {
958
- let score = 0;
959
- for (const scan of scans) {
960
- const { docIds, deletedDocs, hasDeleted, count } = scan.columns;
961
- if (hasDeleted && deletedDocs.has(internalId)) continue;
962
- const start = firstEntryOf(docIds, count, internalId);
963
- if (start + 1 < count && docIds[start + 1] === internalId) {
964
- score = fieldOrderedRunScore(scan, start, internalId, score, samePairEntryScore);
965
- continue;
966
- }
967
- if (start === count || docIds[start] !== internalId) continue;
968
- if (scan.fields.searchable[scan.columns.fieldNameIndices[start]] !== 1) continue;
969
- score += samePairEntryScore(scan, start, internalId);
970
- }
971
- return score;
972
- }
973
- function fieldPairQueryOrderScore(scans, internalId) {
974
- let score = 0;
975
- for (const scan of scans) {
976
- const { docIds, deletedDocs, hasDeleted, count } = scan.columns;
977
- if (hasDeleted && deletedDocs.has(internalId)) continue;
978
- const start = firstEntryOf(docIds, count, internalId);
979
- if (start + 1 < count && docIds[start + 1] === internalId) {
980
- score = fieldOrderedRunScore(scan, start, internalId, score, fieldPairEntryScore);
981
- continue;
982
- }
983
- if (start === count || docIds[start] !== internalId) continue;
984
- if (scan.fields.searchable[scan.columns.fieldNameIndices[start]] !== 1) continue;
985
- score += fieldPairEntryScore(scan, start, internalId);
986
- }
987
- return score;
988
- }
989
- var SAME_PAIR_SCORER = {
990
- upperBound: samePairUpperBound,
991
- scoreEveryDocument: samePairScoreEveryDocument,
992
- scoreKnownDocumentsAndCountTheRest: samePairScoreKnownDocuments,
993
- queryOrderScore: samePairQueryOrderScore
994
- };
995
- var FIELD_PAIR_SCORER = {
996
- upperBound: fieldPairUpperBound,
997
- scoreEveryDocument: fieldPairScoreEveryDocument,
998
- scoreKnownDocumentsAndCountTheRest: fieldPairScoreKnownDocuments,
999
- queryOrderScore: fieldPairQueryOrderScore
1000
- };
1001
- function pageFromBuffer(scorer, scans, buffer, selection, resolver) {
1002
- const approximateKth = kthBestScore(buffer, selection, resolver);
1003
- const gatherFrom = approximateKth - Math.abs(approximateKth) * PRUNING_REJECTION_SLACK;
1004
- const heap = [];
1005
- let full = false;
1006
- let threshold = 0;
1007
- const { touched, touchedCount, scores } = buffer;
1008
- for (let index = 0; index < touchedCount; index++) {
1009
- const internalId = touched[index];
1010
- if (scores[internalId] < gatherFrom) continue;
1011
- const externalId = resolver.toExternal(internalId);
1012
- if (externalId === void 0) continue;
1013
- const score = scorer.queryOrderScore(scans, internalId);
1014
- if (full && score < threshold) continue;
1015
- const candidate = { internalId, externalId, score };
1016
- if (!full) {
1017
- heap.push(candidate);
1018
- if (heap.length === selection.length) {
1019
- buildMinHeap(heap);
1020
- full = true;
1021
- threshold = heap[0].score;
1022
- }
1023
- } else if (candidateWorse(heap[0], candidate)) {
1024
- heap[0] = candidate;
1025
- siftDown(heap, 0);
1026
- threshold = heap[0].score;
1027
- }
1028
- }
1029
- sortSelection(heap);
1030
- const scored = new Array(heap.length);
1031
- for (let index = 0; index < heap.length; index++) {
1032
- scored[index] = {
1033
- docId: heap[index].externalId,
1034
- score: heap[index].score,
1035
- termFrequencies: EMPTY_COMPONENTS,
1036
- fieldLengths: EMPTY_COMPONENTS,
1037
- idf: EMPTY_COMPONENTS
1038
- };
1039
- }
1040
- return scored;
1041
- }
1042
- function multiTermTopK(request) {
1043
- const { terms, docFrequencies, totalDocs, limit, fields, resolver, buffer } = request;
1044
- if (!boostsKeepScoresNonNegative(fields)) return null;
1045
- const onePair = fields.boundPairs.length === 2;
1046
- const scorer = onePair ? SAME_PAIR_SCORER : FIELD_PAIR_SCORER;
1047
- const k1 = onePair ? fields.boundPairs[0] : 0;
1048
- const b = onePair ? fields.boundPairs[1] : 0;
1049
- const scans = new Array(terms.length);
1050
- for (let term = 0; term < terms.length; term++) {
1051
- const idf = computeIDF(docFrequencies[term], totalDocs);
1052
- if (!(idf >= 0)) return null;
1053
- scans[term] = {
1054
- columns: postingColumns(terms[term].list),
1055
- idf,
1056
- scoresAreZero: totalDocs === 0,
1057
- fields,
1058
- k1,
1059
- b
1060
- };
1061
- }
1062
- const maxBoost = bestSearchable(fields.searchable, fields.boosts);
1063
- const maxAverageLength = bestSearchable(fields.searchable, fields.averageLengths);
1064
- const upperBounds = scans.map((scan, term) => scorer.upperBound(scan, terms[term].list, maxBoost, maxAverageLength));
1065
- const order = scans.map((_, term) => term).sort((left, right) => upperBounds[right] - upperBounds[left]);
1066
- const remainingBound = new Float64Array(order.length + 1);
1067
- for (let position2 = order.length - 1; position2 >= 0; position2--) {
1068
- remainingBound[position2] = remainingBound[position2 + 1] + upperBounds[order[position2]];
1069
- }
1070
- const wanted = Number.isFinite(limit) ? Math.max(0, Math.floor(limit)) : 0;
1071
- const selection = new Float64Array(wanted);
1072
- let position = wanted === 0 ? order.length : 0;
1073
- for (; position < order.length; position++) {
1074
- const remaining = remainingBound[position];
1075
- if (position > 0 && buffer.touchedCount >= wanted && remaining < remainingBound[0] - remaining) {
1076
- const threshold = kthBestScore(buffer, selection, resolver);
1077
- if (remaining < threshold - threshold * PRUNING_REJECTION_SLACK) break;
1078
- }
1079
- scorer.scoreEveryDocument(scans[order[position]], buffer);
1080
- }
1081
- let countedOnly = 0;
1082
- for (let rest = position; rest < order.length; rest++) {
1083
- countedOnly += scorer.scoreKnownDocumentsAndCountTheRest(scans[order[rest]], buffer);
1084
- }
1085
- const totalMatched = buffer.touchedCount + countedOnly;
1086
- if (wanted === 0) return { scored: [], totalMatched };
1087
- return { scored: pageFromBuffer(scorer, scans, buffer, selection, resolver), totalMatched };
1088
- }
1089
-
1090
- // src/core/partition/single-term-topk.ts
1091
- function fieldsCoverEvery(fields, fieldNames) {
1092
- if (fields === void 0) return true;
1093
- for (const name of fieldNames) {
1094
- if (!fields.includes(name)) return false;
1095
- }
1096
- return true;
1097
- }
1098
- function prunableSingleTermList(params, index, fieldNames) {
1099
- if (params.queryTokens.length !== 1) return null;
1100
- if (params.termGroups !== void 0 && params.termGroups.length > 0) return null;
1101
- if (params.exact !== true && (params.tolerance ?? 0) !== 0) return null;
1102
- if (params.termMatch !== void 0 && params.termMatch !== "any") return null;
1103
- if (params.collectComponents !== false) return null;
1104
- if (params.collectMatchedSet !== void 0) return null;
1105
- if (params.maxResults === void 0) return null;
1106
- if (!fieldsCoverEvery(params.fields, fieldNames)) return null;
1107
- if (params.filterBitset !== void 0) return null;
1108
- if (!bm25PruningSound(params.bm25Params)) return null;
1109
- const list = index.lookup(params.queryTokens[0].token);
1110
- if (list === void 0) return null;
1111
- if (!list.ordered) return null;
1112
- return list;
1113
- }
1114
- function singleTermTopK(request) {
1115
- const { list, docFrequency, totalDocs, limit, resolver } = request;
1116
- const {
1117
- searchable: fieldSearchable,
1118
- boosts: fieldBoosts,
1119
- averageLengths: fieldAvgLengths,
1120
- lengthColumns: fieldLengthColumns,
1121
- k1s,
1122
- bs,
1123
- boundPairs,
1124
- nameRanks
1125
- } = request.fields;
1126
- const onePair = boundPairs.length === 2;
1127
- const onlyK1 = boundPairs[0];
1128
- const onlyB = boundPairs[1];
1129
- const wanted = Number.isFinite(limit) ? Math.max(0, Math.floor(limit)) : 0;
1130
- const { docIds, termFrequencies, fieldNameIndices, deletedDocs: deleted, hasDeleted } = postingColumns(list);
1131
- const bounds = blockBoundsFor(list, fieldLengthColumns);
1132
- const maxBoost = bestSearchable(fieldSearchable, fieldBoosts);
1133
- const maxAverageLength = bestSearchable(fieldSearchable, fieldAvgLengths);
1134
- const idf = computeIDF(docFrequency, totalDocs);
1135
- const scoresAreZero = totalDocs === 0;
1136
- const heap = [];
1137
- let full = false;
1138
- let threshold = 0;
1139
- let totalMatched = 0;
1140
- for (let block = 0; block < bounds.blockCount; block++) {
1141
- const start = block === 0 ? 0 : bounds.entryEnd[block - 1];
1142
- const end = bounds.entryEnd[block];
1143
- if (full) {
1144
- let bestEntry = 0;
1145
- if (!scoresAreZero) {
1146
- const blockMaxTf = bounds.maxTermFrequency[block];
1147
- const blockMinLength = bounds.minFieldLength[block];
1148
- bestEntry = onePair ? computeBM25WithIDF(blockMaxTf, idf, blockMinLength, maxAverageLength, onlyK1, onlyB) : blockEntryBound(request.fields, blockMaxTf, idf, blockMinLength, maxAverageLength);
1149
- }
1150
- if (bestEntry * maxBoost * bounds.maxEntriesPerDocument[block] < threshold) {
1151
- totalMatched += bounds.documentCount[block];
1152
- continue;
1153
- }
1154
- }
1155
- let entry = start;
1156
- while (entry < end) {
1157
- const internalId = docIds[entry];
1158
- if (hasDeleted && deleted.has(internalId)) {
1159
- while (entry < end && docIds[entry] === internalId) entry++;
1160
- continue;
1161
- }
1162
- let score = 0;
1163
- let scored2 = false;
1164
- const ordered = entry + 2 < end && docIds[entry + 2] === internalId ? orderRunByFieldName(docIds, fieldNameIndices, nameRanks, entry, end) : null;
1165
- for (let at = 0; entry < end && docIds[entry] === internalId; at++, entry++) {
1166
- const row = ordered === null ? entry : ordered[at];
1167
- const fieldIndex = fieldNameIndices[row];
1168
- if (fieldSearchable[fieldIndex] === 1) {
1169
- const fieldLength = fieldLengthOf(fieldLengthColumns, fieldIndex, internalId, fieldAvgLengths[fieldIndex]);
1170
- score += (scoresAreZero ? 0 : computeBM25WithIDF(
1171
- termFrequencies[row],
1172
- idf,
1173
- fieldLength,
1174
- fieldAvgLengths[fieldIndex],
1175
- onePair ? onlyK1 : k1s[fieldIndex],
1176
- onePair ? onlyB : bs[fieldIndex]
1177
- )) * fieldBoosts[fieldIndex];
1178
- scored2 = true;
1179
- }
1180
- }
1181
- if (!scored2) continue;
1182
- totalMatched++;
1183
- if (wanted === 0) continue;
1184
- if (full && score < threshold) continue;
1185
- const externalId = resolver.toExternal(internalId);
1186
- if (externalId === void 0) continue;
1187
- const candidate = { internalId, externalId, score };
1188
- if (!full) {
1189
- heap.push(candidate);
1190
- if (heap.length === wanted) {
1191
- buildMinHeap(heap);
1192
- full = true;
1193
- threshold = heap[0].score;
1194
- }
1195
- continue;
1196
- }
1197
- if (candidateWorse(heap[0], candidate)) {
1198
- heap[0] = candidate;
1199
- siftDown(heap, 0);
1200
- threshold = heap[0].score;
1201
- }
1202
- }
1203
- }
1204
- sortSelection(heap);
1205
- const scored = new Array(heap.length);
1206
- for (let index = 0; index < heap.length; index++) {
1207
- scored[index] = {
1208
- docId: heap[index].externalId,
1209
- score: heap[index].score,
1210
- termFrequencies: EMPTY_COMPONENTS,
1211
- fieldLengths: EMPTY_COMPONENTS,
1212
- idf: EMPTY_COMPONENTS
1213
- };
1214
- }
1215
- return { scored, totalMatched };
1216
- }
1217
-
1218
- // src/core/partition/search.ts
1219
- var nativeKeywordSearch = null;
1220
- function installNativeKeywordSearch(search) {
1221
- nativeKeywordSearch = search;
1222
- }
1223
- function globalDocFreqFor(docFreqs, term, fallback) {
1224
- return Object.hasOwn(docFreqs, term) ? docFreqs[term] : fallback;
1225
- }
1226
- function searchFulltext(state, params) {
1227
- const {
1228
- queryTokens,
1229
- termGroups,
1230
- partialFields,
1231
- fields,
1232
- boost,
1233
- tolerance = 0,
1234
- prefixLength = 2,
1235
- exact = false,
1236
- bm25Params,
1237
- globalStats,
1238
- maxResults,
1239
- termMatch,
1240
- phrases
1241
- } = params;
1242
- const collectComponents = params.collectComponents !== false;
1243
- if (queryTokens.length === 0 && phrases === void 0) {
1244
- return { scored: [], totalMatched: 0 };
1245
- }
1246
- const totalDocs = globalStats?.totalDocuments ?? state.stats.totalDocuments;
1247
- const avgFieldLengths = globalStats?.averageFieldLengths ?? state.stats.averageFieldLengths;
1248
- const scoresAreZero = totalDocs === 0;
1249
- const useIntersection = termMatch === "all" && queryTokens.length > 1;
1250
- const fieldNames = state.fieldNameTable.names;
1251
- const resolver = state.docStore.resolver();
1252
- const fieldScoring = loadFieldScoring(state, fields, boost, avgFieldLengths, bm25Params);
1253
- const { searchable, boosts, averageLengths, lengthColumns, k1s, bs, boundPairs, nameRanks } = fieldScoring;
1254
- const onePair = boundPairs.length === 2;
1255
- const onlyK1 = boundPairs[0];
1256
- const onlyB = boundPairs[1];
1257
- const phraseMatches = phrases === void 0 ? null : requireLoadedPhraseCode().matchPhrases(
1258
- state.invertedIdx,
1259
- phrases,
1260
- searchable,
1261
- params.filterBitset,
1262
- state.docStore.internalIdCapacity(),
1263
- params.phraseWork,
1264
- true
1265
- );
1266
- if (phraseMatches !== null && bitsetIsEmpty(phraseMatches.matched)) {
1267
- return { scored: [], totalMatched: 0 };
1268
- }
1269
- const inTheCore = nativeKeywordSearch?.(state, params, phraseMatches);
1270
- if (inTheCore) return inTheCore;
1271
- const filterBitset = phraseMatches?.matched ?? params.filterBitset;
1272
- if (state.scoreBuffer === null) state.scoreBuffer = createScoreBuffer(state.docStore.internalIdCapacity());
1273
- const scoreBuffer = state.scoreBuffer;
1274
- beginScoring(scoreBuffer, state.docStore.internalIdCapacity());
1275
- const components = collectComponents ? /* @__PURE__ */ new Map() : null;
1276
- function documentFrequency(token, list) {
1277
- return globalStats ? globalDocFreqFor(globalStats.docFrequencies, token, list.docIdSet.size) : list.docIdSet.size;
1278
- }
1279
- function scorePhraseRows(rows, matched) {
1280
- let idf = 0;
1281
- for (let entry = 0; entry < rows.phrase.tokens.length; entry++) {
1282
- idf += computeIDF(documentFrequency(rows.phrase.tokens[entry], rows.lists[entry]), totalDocs);
1283
- }
1284
- for (let start = 0; start < rows.docIds.length; start += fieldRun.length) {
1285
- const entries = orderRunByFieldName(
1286
- rows.docIds.values,
1287
- rows.fieldIndices.values,
1288
- nameRanks,
1289
- start,
1290
- rows.docIds.length
1291
- );
1292
- for (let at = 0; at < fieldRun.length; at++) scorePhraseRow(rows, matched, entries[at], idf);
1293
- }
1294
- }
1295
- function scorePhraseRow(rows, matched, row, idf) {
1296
- const internalId = rows.docIds.values[row];
1297
- if (!bitsetHas(matched, internalId)) return;
1298
- const fieldIndex = rows.fieldIndices.values[row];
1299
- const frequency = rows.frequencies.values[row];
1300
- const avgLen = averageLengths[fieldIndex];
1301
- const fieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
1302
- const score = scoresAreZero ? 0 : computeBM25WithIDF(
1303
- frequency,
1304
- idf,
1305
- fieldLength,
1306
- avgLen,
1307
- onePair ? onlyK1 : k1s[fieldIndex],
1308
- onePair ? onlyB : bs[fieldIndex]
1309
- );
1310
- addScore(scoreBuffer, internalId, score * boosts[fieldIndex]);
1311
- if (components !== null) {
1312
- recordComponents(components, internalId, fieldNames[fieldIndex], rows.phrase.key, frequency, fieldLength, idf);
1313
- }
1314
- }
1315
- const groupContext = {
1316
- index: state.invertedIdx,
1317
- fields: fieldScoring,
1318
- partialMarks: partialFieldMarks(fieldNames, partialFields),
1319
- fieldNames,
1320
- totalDocs,
1321
- filterBitset,
1322
- globalFrequency(token) {
1323
- if (globalStats === void 0 || !Object.hasOwn(globalStats.docFrequencies, token)) return void 0;
1324
- return globalStats.docFrequencies[token];
1325
- }
1326
- };
1327
- function mergeGroupContribution(internalId, contribution) {
1328
- addScore(scoreBuffer, internalId, contribution.score);
1329
- if (components !== null) mergeGroupComponents(components, internalId, contribution);
1330
- }
1331
- function resolveMatch(token, postingList) {
1332
- const docFreq = documentFrequency(token, postingList);
1333
- return { token, docFreq, idf: computeIDF(docFreq, totalDocs), postingList };
1334
- }
1335
- function scorePostings(match, only) {
1336
- const { docIds, termFrequencies, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(
1337
- match.postingList
1338
- );
1339
- let runStart = 0;
1340
- let runEnd = 0;
1341
- if (only === null && !hasDeleted && filterBitset === void 0 && components === null) {
1342
- for (let at = 0; at < count; at++) {
1343
- const internalId = docIds[at];
1344
- let pi = at;
1345
- if (at < runEnd) {
1346
- pi = fieldRun.entries[at - runStart];
1347
- } else if (at + 1 < count && docIds[at + 1] === internalId) {
1348
- pi = orderRunByFieldName(docIds, fieldNameIndices, nameRanks, at, count)[0];
1349
- runStart = at;
1350
- runEnd = at + fieldRun.length;
1351
- }
1352
- const fieldIndex = fieldNameIndices[pi];
1353
- if (searchable[fieldIndex] === 0) continue;
1354
- const avgLen = averageLengths[fieldIndex];
1355
- const actualFieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
1356
- const termScore = scoresAreZero ? 0 : computeBM25WithIDF(
1357
- termFrequencies[pi],
1358
- match.idf,
1359
- actualFieldLength,
1360
- avgLen,
1361
- onePair ? onlyK1 : k1s[fieldIndex],
1362
- onePair ? onlyB : bs[fieldIndex]
1363
- );
1364
- addScore(scoreBuffer, internalId, termScore * boosts[fieldIndex]);
1365
- }
1366
- return;
1367
- }
1368
- for (let at = 0; at < count; at++) {
1369
- const internalId = docIds[at];
1370
- if (hasDeleted && deletedDocs.has(internalId)) continue;
1371
- if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
1372
- if (only !== null && !bitsetHas(only, internalId)) continue;
1373
- let pi = at;
1374
- if (at < runEnd) {
1375
- pi = fieldRun.entries[at - runStart];
1376
- } else if (at + 1 < count && docIds[at + 1] === internalId) {
1377
- pi = orderRunByFieldName(docIds, fieldNameIndices, nameRanks, at, count)[0];
1378
- runStart = at;
1379
- runEnd = at + fieldRun.length;
1380
- }
1381
- const fieldIndex = fieldNameIndices[pi];
1382
- if (searchable[fieldIndex] === 0) continue;
1383
- const termFrequency = termFrequencies[pi];
1384
- const avgLen = averageLengths[fieldIndex];
1385
- const actualFieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
1386
- const termScore = scoresAreZero ? 0 : computeBM25WithIDF(
1387
- termFrequency,
1388
- match.idf,
1389
- actualFieldLength,
1390
- avgLen,
1391
- onePair ? onlyK1 : k1s[fieldIndex],
1392
- onePair ? onlyB : bs[fieldIndex]
1393
- );
1394
- addScore(scoreBuffer, internalId, termScore * boosts[fieldIndex]);
1395
- if (components !== null) {
1396
- recordComponents(
1397
- components,
1398
- internalId,
1399
- fieldNames[fieldIndex],
1400
- match.token,
1401
- termFrequency,
1402
- actualFieldLength,
1403
- match.idf
1404
- );
1405
- }
1406
- }
1407
- }
1408
- function scoreGroup(group, only) {
1409
- if (group === null) return;
1410
- for (const [internalId, contribution] of computeGroupContributions(groupContext, group, collectComponents)) {
1411
- if (only !== null && !bitsetHas(only, internalId)) continue;
1412
- mergeGroupContribution(internalId, contribution);
1413
- }
1414
- }
1415
- const prunableList = phrases === void 0 ? prunableSingleTermList(params, state.invertedIdx, fieldNames) : null;
1416
- if (prunableList !== null && maxResults !== void 0) {
1417
- return singleTermTopK({
1418
- list: prunableList,
1419
- docFrequency: documentFrequency(queryTokens[0].token, prunableList),
1420
- totalDocs,
1421
- limit: maxResults,
1422
- fields: fieldScoring,
1423
- resolver
1424
- });
1425
- }
1426
- const prunableLists = phrases === void 0 ? prunableMultiTermLists(params, state.invertedIdx) : null;
1427
- if (prunableLists !== null && maxResults !== void 0) {
1428
- const pruned = multiTermTopK({
1429
- terms: prunableLists,
1430
- docFrequencies: prunableLists.map((term) => documentFrequency(term.token, term.list)),
1431
- totalDocs,
1432
- limit: maxResults,
1433
- fields: fieldScoring,
1434
- resolver,
1435
- buffer: scoreBuffer
1436
- });
1437
- if (pruned !== null) return pruned;
1438
- }
1439
- if (useIntersection) {
1440
- const resolved = [];
1441
- for (const qt of queryTokens) {
1442
- const group = termGroupOf(termGroups, qt.token);
1443
- const groupMatches = group === void 0 ? null : resolveGroupMatches(groupContext, group);
1444
- let totalPostings = groupMatches === null ? 0 : groupPostingCount(groupMatches);
1445
- const matches = [];
1446
- for (const m of typoMatchesFor(state.invertedIdx, qt.token, group, exact, tolerance, prefixLength)) {
1447
- totalPostings += m.postingList.length;
1448
- matches.push(resolveMatch(m.token, m.postingList));
1449
- }
1450
- resolved.push({ token: qt.token, matches, totalPostings, group: groupMatches });
1451
- }
1452
- let anchor = resolved[0];
1453
- for (const term of resolved) if (term.totalPostings < anchor.totalPostings) anchor = term;
1454
- for (const match of anchor.matches) scorePostings(match, null);
1455
- scoreGroup(anchor.group, null);
1456
- const anchorDocuments = createBitSet(state.docStore.internalIdCapacity());
1457
- for (let index = 0; index < scoreBuffer.touchedCount; index++) {
1458
- bitsetSet(anchorDocuments, scoreBuffer.touched[index]);
1459
- }
1460
- beginScoring(scoreBuffer, state.docStore.internalIdCapacity());
1461
- components?.clear();
1462
- for (const term of resolved) {
1463
- for (const match of term.matches) scorePostings(match, anchorDocuments);
1464
- scoreGroup(term.group, anchorDocuments);
1465
- }
1466
- } else {
1467
- for (const qt of queryTokens) {
1468
- const group = termGroupOf(termGroups, qt.token);
1469
- for (const m of typoMatchesFor(state.invertedIdx, qt.token, group, exact, tolerance, prefixLength)) {
1470
- scorePostings(resolveMatch(m.token, m.postingList), null);
1471
- }
1472
- if (group !== void 0) scoreGroup(resolveGroupMatches(groupContext, group), null);
1473
- }
1474
- }
1475
- if (phraseMatches !== null) {
1476
- for (const rows of phraseMatches.rows) scorePhraseRows(rows, phraseMatches.matched);
1477
- }
1478
- const totalMatched = scoreBuffer.touchedCount;
1479
- const k = maxResults === void 0 ? totalMatched : Math.max(0, Math.min(maxResults, totalMatched));
1480
- const scored = topKFromBuffer(scoreBuffer, k, resolver, components);
1481
- if (params.collectMatchedSet === void 0) {
1482
- return { scored, totalMatched };
1483
- }
1484
- if (params.collectMatchedSet === "ordinals") {
1485
- const matchedOrdinalBitset = createBitSet(state.docStore.internalIdCapacity());
1486
- for (let index = 0; index < scoreBuffer.touchedCount; index++) {
1487
- bitsetSet(matchedOrdinalBitset, scoreBuffer.touched[index]);
1488
- }
1489
- return { scored, totalMatched, matchedOrdinalBitset };
1490
- }
1491
- const matchedIds = [];
1492
- for (let index = 0; index < scoreBuffer.touchedCount; index++) {
1493
- const externalId = resolver.toExternal(scoreBuffer.touched[index]);
1494
- if (externalId !== void 0) matchedIds.push(externalId);
1495
- }
1496
- return { scored, totalMatched, matchedIds };
1497
- }
1498
-
1499
- export { ARRAY_POSITION_GAP, DEFAULT_BM25_B, DEFAULT_BM25_K1, EMPTY_COMPONENTS, MAX_BM25_B, MAX_BM25_K1, MAX_TERM_FREQUENCY, PENDING_REMOVAL_MERGE_DIVISOR, PENDING_REMOVAL_MERGE_FLOOR, POSTING_LIST_COMPACTION_THRESHOLD, analyseQueryPhrases, bm25SetsValue, codeLoader, computeBM25WithIDF, computeIDF, createLoadedGeoIndex, holdsQuotedText, installNativeKeywordSearch, loadGeoCode, loadGeoCodeFor, loadPhraseCodeFor, mergeBM25Levels, partialFieldMarks, postingColumns, requireLoadedPhraseCode, scanPostingBlocks, searchFulltext, termGroupOf, typoMatchesFor };