@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.
- package/dist/adapters/filesystem.mjs +3 -3
- package/dist/adapters/gcs.mjs +3 -3
- package/dist/adapters/indexeddb.mjs +1 -1
- package/dist/adapters/s3.mjs +3 -3
- package/dist/browser/{chunk-N23GL72Q.mjs → chunk-4RNSFVWI.mjs} +20777 -19056
- package/dist/browser/chunk-MMHIIL5B.mjs +564 -0
- package/dist/browser/chunk-MZHQ65VI.mjs +1228 -0
- package/dist/browser/chunk-WC2DEXWU.mjs +29 -0
- package/dist/browser/{chunk-VLJQW4J6.mjs → core-leaf-TJAGWPZZ.mjs} +4674 -3102
- package/dist/{react-native/chunks/durability-config-QXVZEO7T.mjs → browser/durability-config-SGB5ZP5K.mjs} +8 -3
- package/dist/browser/embed-RF2MPGAO.mjs +222 -0
- package/dist/{react-native/chunks/geo-index-PX3BIHAH.mjs → browser/geo-index-GNHY4PUB.mjs} +190 -93
- package/dist/{react-native/chunks/module-TTEVPRCW.mjs → browser/module-362VSIGR.mjs} +1570 -275
- package/dist/browser/msgpack-leaf-44XNWSSY.mjs +302 -0
- package/dist/browser/optional-reads-XMVPG6HG.mjs +3230 -0
- package/dist/browser/optional-writes-WMZX4OEC.mjs +3196 -0
- package/dist/browser/phrase-module-22TKMXWI.mjs +616 -0
- package/dist/browser/resolve-vector-text-KI65IHMD.mjs +60 -0
- package/dist/browser/{restore-hooks-IE3GGYHG.mjs → restore-queue-S4BWOGMU.mjs} +98 -24
- package/dist/{react-native/chunks/runtime-R5E3TB3J.mjs → browser/runtime-NU6VOVH2.mjs} +61 -25
- package/dist/browser/segment-codec-leaf-A427QJUX.mjs +554 -0
- package/dist/browser/segment-merge-leaf-7BZ54JPI.mjs +1636 -0
- package/dist/browser/storage-leaf-X6CNRHJS.mjs +18221 -0
- package/dist/browser/store-leaf-AEMTAVHX.mjs +2069 -0
- package/dist/browser/{chunk-GFAZPSWK.mjs → suggestions-leaf-3Y6MR6OF.mjs} +441 -119
- package/dist/browser/worker-copies-WQCPP3TS.mjs +2750 -0
- package/dist/{capabilities-D3AoBJoF.d.ts → capabilities-BKDrry0z.d.ts} +2 -2
- package/dist/chunk-2JRERUNZ.mjs +217 -0
- package/dist/chunk-2RIS76RJ.mjs +212 -0
- package/dist/chunk-3B775F3C.mjs +252 -0
- package/dist/{chunk-24FNVRKB.mjs → chunk-3D6RZGJH.mjs} +3 -3
- package/dist/{chunk-INJYO3BU.mjs → chunk-4CAMH7FO.mjs} +1 -1
- package/dist/{chunk-U476IXKQ.mjs → chunk-4PY4JYMY.mjs} +2 -1
- package/dist/chunk-6EZW2GQL.mjs +978 -0
- package/dist/chunk-75UNINFA.mjs +271 -0
- package/dist/chunk-77AUVDQ5.mjs +7 -0
- package/dist/{chunk-JTYPJF3T.mjs → chunk-7MWYORQC.mjs} +2 -2
- package/dist/{chunk-TGP5M5R7.mjs → chunk-7T4LAYT4.mjs} +1 -1
- package/dist/{chunk-XIHUI4KB.mjs → chunk-AB27FWZM.mjs} +8 -3
- package/dist/{chunk-FUD5XSZ5.mjs → chunk-BXM7XM4G.mjs} +7 -3
- package/dist/{chunk-HJJI72X7.mjs → chunk-C7YQHCSO.mjs} +1 -1
- package/dist/{chunk-RVGRFOGN.mjs → chunk-D456ZFPQ.mjs} +2 -1
- package/dist/{chunk-KKQC526K.mjs → chunk-E2F6LZR3.mjs} +19 -21
- package/dist/{chunk-SMOOSIAW.mjs → chunk-FE3MRIBN.mjs} +104 -13
- package/dist/{chunk-KYYABCSW.mjs → chunk-FETZYCH7.mjs} +15 -1
- package/dist/{chunk-XXJZMTZT.mjs → chunk-FVZ5DB6Y.mjs} +3 -2
- package/dist/{chunk-EYD7K3H6.mjs → chunk-GF4K7IUK.mjs} +317 -120
- package/dist/chunk-GXCDWLQI.mjs +193 -0
- package/dist/{chunk-IIRIG7H5.mjs → chunk-H64YDF5M.mjs} +3 -3
- package/dist/{browser/chunk-VY5KW3HN.mjs → chunk-HOOR4CP5.mjs} +63 -7
- package/dist/chunk-IB4BYLE3.mjs +127 -0
- package/dist/{chunk-3C7MTCCI.mjs → chunk-IE3Q62QD.mjs} +2 -2
- package/dist/chunk-IH3G6SJO.mjs +40 -0
- package/dist/chunk-JV74RKCY.mjs +3041 -0
- package/dist/{chunk-ZPZ3YGXV.mjs → chunk-K67I3RF4.mjs} +261 -101
- package/dist/chunk-KLVMK3R5.mjs +47 -0
- package/dist/{chunk-5VV4R6P7.mjs → chunk-LAWIJRMJ.mjs} +4154 -2577
- package/dist/chunk-LF4GB4PO.mjs +281 -0
- package/dist/chunk-NC4QLCZC.mjs +59 -0
- package/dist/chunk-OOO54OVC.mjs +627 -0
- package/dist/chunk-OUWZKNO3.mjs +207 -0
- package/dist/{chunk-FJKKCV4D.mjs → chunk-P5YLI5ED.mjs} +343 -182
- package/dist/{chunk-4ZTHGTVX.mjs → chunk-PTTMGRG5.mjs} +9 -10
- package/dist/{react-native/chunks/chunk-DZ7H7D2C.mjs → chunk-Q3ZZH5Z7.mjs} +6 -0
- package/dist/{browser/chunk-EKMGCRSR.mjs → chunk-QBVTYY4J.mjs} +2 -9
- package/dist/{chunk-W5EB5XKI.mjs → chunk-R4CE4IVU.mjs} +341 -183
- package/dist/chunk-S2POFTLN.mjs +10 -0
- package/dist/{chunk-KJ3RTZDJ.mjs → chunk-S3BSDBF7.mjs} +10 -3
- package/dist/{chunk-4LMSZAK6.mjs → chunk-SHGN3QIF.mjs} +69 -13
- package/dist/chunk-SXIRM4MX.mjs +3549 -0
- package/dist/{chunk-TBC3XUL2.mjs → chunk-TGPKS2UM.mjs} +47 -1
- package/dist/chunk-TINW4BSH.mjs +31301 -0
- package/dist/{cold-module-VOJXMNZB.mjs → chunk-TSLV5P2J.mjs} +397 -80
- package/dist/{chunk-HHBUCIUY.mjs → chunk-TW543F33.mjs} +3 -3
- package/dist/chunk-U6B7DUQW.mjs +788 -0
- package/dist/{chunk-OQLD2BSW.mjs → chunk-V3SGPXWQ.mjs} +8 -9
- package/dist/chunk-W34VJXY7.mjs +4723 -0
- package/dist/chunk-YETKPX5M.mjs +5 -0
- package/dist/chunk-ZQ6QY42L.mjs +59 -0
- package/dist/{client-kqSMevVi.d.ts → client-CTp8RRiK.d.ts} +4 -4
- package/dist/client.d.ts +8 -8
- package/dist/client.mjs +66 -18
- package/dist/{config-B4v_Htpu.d.ts → config-PCNzWjHL.d.ts} +6 -3
- package/dist/{config-CTP01fns.d.ts → config-_WT5grSL.d.ts} +3 -3
- package/dist/core-leaf-KXFGP74A.mjs +7 -0
- package/dist/digest-leaf-KXBGKYHZ.mjs +1 -0
- package/dist/direct-executor-MKTZBR26.mjs +16 -0
- package/dist/distribution/coordinator/etcd.d.ts +2 -2
- package/dist/distribution/coordinator/etcd.mjs +7 -4
- package/dist/distribution/coordinator/in-memory.d.ts +2 -2
- package/dist/distribution/coordinator/in-memory.mjs +1 -2
- package/dist/distribution/transport/grpc.mjs +7 -2
- package/dist/distribution/transport/tcp.mjs +7 -1
- package/dist/distribution.d.ts +7 -7
- package/dist/distribution.mjs +1199 -1092
- package/dist/{browser/durability-config-TIYKW6XX.mjs → durability-config-XV4XR7Y4.mjs} +7 -3
- package/dist/embed-4H7RTBVL.mjs +221 -0
- package/dist/embeddings/openai.mjs +2 -2
- package/dist/{engine-CkPn2PWE.d.ts → engine-DBRVR_d-.d.ts} +1252 -1239
- package/dist/{browser/geo-index-OTV7VPIR.mjs → geo-index-2ZMMWWSK.mjs} +190 -93
- package/dist/{index-C4AmUnl1.d.ts → index-Ck9w5WHz.d.ts} +1 -1
- package/dist/index.browser.mjs +4 -16
- package/dist/index.d.ts +1495 -78
- package/dist/index.mjs +14 -50
- package/dist/index.react-native.mjs +11 -28
- package/dist/invalidation/filesystem.mjs +1 -2
- package/dist/languages/albanian.mjs +1 -1
- package/dist/languages/amharic.mjs +1 -1
- package/dist/languages/arabic.mjs +1 -1
- package/dist/languages/armenian.mjs +1 -1
- package/dist/languages/azerbaijani.mjs +1 -1
- package/dist/languages/bambara.mjs +1 -1
- package/dist/languages/basque.mjs +1 -1
- package/dist/languages/belarusian.mjs +1 -1
- package/dist/languages/bengali.mjs +1 -1
- package/dist/languages/bosnian.mjs +1 -1
- package/dist/languages/breton.mjs +1 -1
- package/dist/languages/bulgarian.mjs +1 -1
- package/dist/languages/burmese.mjs +1 -1
- package/dist/languages/catalan.mjs +1 -1
- package/dist/languages/chinese.mjs +1 -1
- package/dist/languages/croatian.mjs +1 -1
- package/dist/languages/czech.mjs +1 -1
- package/dist/languages/dagbani.mjs +1 -1
- package/dist/languages/danish.mjs +1 -1
- package/dist/languages/dutch.mjs +1 -1
- package/dist/languages/english.mjs +1 -1
- package/dist/languages/esperanto.mjs +1 -1
- package/dist/languages/estonian.mjs +1 -1
- package/dist/languages/ewe.mjs +1 -1
- package/dist/languages/faroese.mjs +1 -1
- package/dist/languages/fijian.mjs +1 -1
- package/dist/languages/finnish.mjs +1 -1
- package/dist/languages/french.mjs +1 -1
- package/dist/languages/ga.mjs +1 -1
- package/dist/languages/galician.mjs +1 -1
- package/dist/languages/georgian.mjs +1 -1
- package/dist/languages/german.mjs +1 -1
- package/dist/languages/greek.mjs +1 -1
- package/dist/languages/guarani.mjs +1 -1
- package/dist/languages/gujarati.mjs +1 -1
- package/dist/languages/haitian-creole.mjs +1 -1
- package/dist/languages/hausa.mjs +1 -1
- package/dist/languages/hawaiian.mjs +1 -1
- package/dist/languages/hebrew.mjs +1 -1
- package/dist/languages/hindi.mjs +1 -1
- package/dist/languages/hungarian.mjs +1 -1
- package/dist/languages/icelandic.mjs +1 -1
- package/dist/languages/igbo.mjs +1 -1
- package/dist/languages/indonesian.mjs +1 -1
- package/dist/languages/irish.mjs +1 -1
- package/dist/languages/italian.mjs +1 -1
- package/dist/languages/japanese.mjs +1 -1
- package/dist/languages/kannada.mjs +1 -1
- package/dist/languages/kazakh.mjs +1 -1
- package/dist/languages/khmer.mjs +1 -1
- package/dist/languages/kinyarwanda.mjs +1 -1
- package/dist/languages/kirundi.mjs +1 -1
- package/dist/languages/korean.mjs +1 -1
- package/dist/languages/kurmanji.mjs +1 -1
- package/dist/languages/kyrgyz.mjs +1 -1
- package/dist/languages/lao.mjs +1 -1
- package/dist/languages/latin.mjs +1 -1
- package/dist/languages/latvian.mjs +1 -1
- package/dist/languages/lingala.mjs +1 -1
- package/dist/languages/lithuanian.mjs +1 -1
- package/dist/languages/luxembourgish.mjs +1 -1
- package/dist/languages/macedonian.mjs +1 -1
- package/dist/languages/malagasy.mjs +1 -1
- package/dist/languages/malay.mjs +1 -1
- package/dist/languages/malayalam.mjs +1 -1
- package/dist/languages/maltese.mjs +1 -1
- package/dist/languages/maori.mjs +1 -1
- package/dist/languages/marathi.mjs +1 -1
- package/dist/languages/nepali.mjs +1 -1
- package/dist/languages/norwegian.mjs +1 -1
- package/dist/languages/oromo.mjs +1 -1
- package/dist/languages/persian.mjs +1 -1
- package/dist/languages/polish.mjs +1 -1
- package/dist/languages/portuguese.mjs +1 -1
- package/dist/languages/punjabi.mjs +1 -1
- package/dist/languages/romanian.mjs +1 -1
- package/dist/languages/russian.mjs +1 -1
- package/dist/languages/samoan.mjs +1 -1
- package/dist/languages/sanskrit.mjs +1 -1
- package/dist/languages/scottish-gaelic.mjs +1 -1
- package/dist/languages/serbian.mjs +1 -1
- package/dist/languages/shona.mjs +1 -1
- package/dist/languages/sinhala.mjs +1 -1
- package/dist/languages/slovak.mjs +1 -1
- package/dist/languages/slovenian.mjs +1 -1
- package/dist/languages/sorani.mjs +1 -1
- package/dist/languages/spanish.mjs +1 -1
- package/dist/languages/swahili.mjs +1 -1
- package/dist/languages/swedish.mjs +1 -1
- package/dist/languages/tagalog.mjs +1 -1
- package/dist/languages/tamil.mjs +1 -1
- package/dist/languages/tatar.mjs +1 -1
- package/dist/languages/telugu.mjs +1 -1
- package/dist/languages/thai.mjs +1 -1
- package/dist/languages/tibetan.mjs +1 -1
- package/dist/languages/tigrinya.mjs +1 -1
- package/dist/languages/tongan.mjs +1 -1
- package/dist/languages/turkish.mjs +1 -1
- package/dist/languages/twi.mjs +1 -1
- package/dist/languages/ukrainian.mjs +1 -1
- package/dist/languages/urdu.mjs +1 -1
- package/dist/languages/vietnamese.mjs +1 -1
- package/dist/languages/welsh.mjs +1 -1
- package/dist/languages/wolof.mjs +1 -1
- package/dist/languages/xhosa.mjs +1 -1
- package/dist/languages/yoruba.mjs +1 -1
- package/dist/languages/zulu.mjs +1 -1
- package/dist/{long-query-thread-QDFQSJD6.mjs → long-query-thread-JMGNGF6V.mjs} +74 -58
- package/dist/{module-N55W4Q5C.mjs → module-ZJ6ARG6V.mjs} +444 -111
- package/dist/msgpack-leaf-5WFRP6JM.mjs +9 -0
- package/dist/optional-reads-BR3BOVZW.mjs +3373 -0
- package/dist/optional-writes-DDFHYUOH.mjs +218 -0
- package/dist/{paged-partition-archive-RLRGOXDX.mjs → paged-partition-archive-G576XGVE.mjs} +29 -69
- package/dist/partial-words.browser.mjs +1649 -0
- package/dist/partial-words.mjs +15 -14
- package/dist/{chunk-CITFCZKF.mjs → pattern.browser.mjs} +153 -186
- package/dist/pattern.mjs +6 -8
- package/dist/persistence/durability/checkpoint-worker.d.ts +32 -24
- package/dist/persistence/durability/checkpoint-worker.mjs +27 -59
- package/dist/phrase-module-XK3T44VU.mjs +634 -0
- package/dist/query-actions-OMXJEC2J.mjs +118 -0
- package/dist/query-suggestions/merge-worker.mjs +18 -54
- package/dist/query-suggestions.browser.mjs +26 -227
- package/dist/query-suggestions.d.ts +2 -2
- package/dist/query-suggestions.mjs +16 -67
- package/dist/react-native/chunks/chunk-4EXKQ2IB.mjs +565 -0
- package/dist/react-native/chunks/chunk-52QD7CBJ.mjs +52 -0
- package/dist/react-native/chunks/chunk-72OKYHZL.mjs +969 -0
- package/dist/react-native/chunks/chunk-AQOWRH2C.mjs +802 -0
- package/dist/react-native/chunks/{chunk-4COWCEY7.mjs → chunk-FTQ7JNMU.mjs} +341 -180
- package/dist/react-native/chunks/chunk-G3CUQ333.mjs +42 -0
- package/dist/react-native/chunks/{chunk-EJ33LCHV.mjs → chunk-HRDMIQ63.mjs} +53 -1
- package/dist/react-native/chunks/{chunk-4AV5PPH6.mjs → chunk-IY6U6HRA.mjs} +63 -7
- package/dist/react-native/chunks/chunk-J2NQW353.mjs +212 -0
- package/dist/react-native/chunks/chunk-L4R5ITVG.mjs +29047 -0
- package/dist/react-native/chunks/{chunk-OXM66LO6.mjs → chunk-OK3WUA6N.mjs} +2 -10
- package/dist/react-native/chunks/{chunk-MVXELMJX.mjs → chunk-PVMEHBQO.mjs} +1 -1
- package/dist/{browser/chunk-SRMZXJSL.mjs → react-native/chunks/chunk-TQ26BKBH.mjs} +6 -0
- package/dist/{browser/chunk-GPPOG6PT.mjs → react-native/chunks/chunk-VUJCSQG5.mjs} +3 -1
- package/dist/react-native/chunks/{chunk-ENLMYKSX.mjs → chunk-XEGKQKLY.mjs} +5385 -3114
- package/dist/react-native/chunks/chunk-YOTP2FPE.mjs +232 -0
- package/dist/react-native/chunks/chunk-ZIU6TWXG.mjs +127 -0
- package/dist/react-native/chunks/core-leaf-5B4JXCVA.mjs +6 -0
- package/dist/react-native/chunks/digest-leaf-X6OIFDIU.mjs +1 -0
- package/dist/{durability-config-GE4U7MCZ.mjs → react-native/chunks/durability-config-3IOXIPYZ.mjs} +7 -3
- package/dist/react-native/chunks/embed-3WQ2CCR5.mjs +221 -0
- package/dist/{geo-index-MRH5JMIR.mjs → react-native/chunks/geo-index-QEYKEVPH.mjs} +190 -93
- package/dist/react-native/chunks/{chunk-CKNRFDTZ.mjs → gzip.react-native-DLO4WW27.mjs} +2 -1
- package/dist/{browser/module-TCT66FWA.mjs → react-native/chunks/module-VUA27HZZ.mjs} +1018 -540
- package/dist/react-native/chunks/msgpack-leaf-TR66ZVAX.mjs +7 -0
- package/dist/react-native/chunks/optional-reads-WDTLLHUT.mjs +3364 -0
- package/dist/react-native/chunks/optional-writes-FZV3QW34.mjs +267 -0
- package/dist/react-native/chunks/phrase-module-KCQWVXYZ.mjs +635 -0
- package/dist/react-native/chunks/resolve-vector-text-LXRYXF7M.mjs +59 -0
- package/dist/react-native/chunks/restore-queue-EI2V2I4S.mjs +179 -0
- package/dist/{browser/runtime-OTAGEFQW.mjs → react-native/chunks/runtime-BUCSAK4U.mjs} +61 -25
- package/dist/react-native/chunks/segment-codec-leaf-6ULP7H3I.mjs +12 -0
- package/dist/react-native/chunks/segment-merge-leaf-F4GQZNK6.mjs +13 -0
- package/dist/react-native/chunks/storage-leaf-OAXBU2L6.mjs +18042 -0
- package/dist/react-native/chunks/store-leaf-GY2ZZFXB.mjs +14 -0
- package/dist/react-native/chunks/{chunk-WW2X2AEI.mjs → suggestions-leaf-SQEZ4IBS.mjs} +332 -118
- package/dist/react-native/chunks/worker-copies-EEHSCFJW.mjs +2627 -0
- package/dist/react-native/partial-words.mjs +954 -35
- package/dist/react-native/pattern.mjs +238 -111
- package/dist/react-native/query-suggestions.mjs +33 -239
- package/dist/react-native/sync.mjs +95 -52
- package/dist/react-native/synonyms.mjs +256 -112
- package/dist/react.d.ts +9 -9
- package/dist/react.mjs +6 -0
- package/dist/{rerank-MQ37IYRV.mjs → rerank-Y6MWBMTT.mjs} +17 -8
- package/dist/rerankers/http.mjs +2 -2
- package/dist/resolve-vector-text-4PDRTPNQ.mjs +2 -0
- package/dist/restore-queue-KPYSRJ4A.mjs +184 -0
- package/dist/runtime-4GKUIAKV.mjs +595 -0
- package/dist/{schema-Jwt928nJ.d.ts → schema-C_7yRJLt.d.ts} +1 -1
- package/dist/segment-codec-leaf-6IFBSBPN.mjs +17 -0
- package/dist/segment-merge-leaf-VE3FUSVE.mjs +17 -0
- package/dist/server.d.ts +33 -13
- package/dist/server.mjs +81 -100
- package/dist/{browser/durability-wiring-GVZEE46O.mjs → storage-leaf-HMIIOUYN.mjs} +2334 -931
- package/dist/store-leaf-M7T7SUZJ.mjs +19 -0
- package/dist/stored-values-BWIMpiT_.d.ts +25 -0
- package/dist/suggestions-leaf-Q3Q5D6XV.mjs +53 -0
- package/dist/sync/filesystem.d.ts +3 -3
- package/dist/sync/filesystem.mjs +27 -11
- package/dist/sync/indexeddb.browser.mjs +287 -0
- package/dist/sync/indexeddb.d.ts +3 -3
- package/dist/sync/indexeddb.mjs +7 -2
- package/dist/sync.browser.mjs +88 -72
- package/dist/sync.d.ts +4 -4
- package/dist/sync.mjs +89 -59
- package/dist/{chunk-I5B7RXU7.mjs → synonyms.browser.mjs} +248 -135
- package/dist/synonyms.mjs +15 -11
- package/dist/{tasks-CoNjxbop.d.ts → tasks-B4tT4vmP.d.ts} +4 -4
- package/dist/thread-SNILJXX3.mjs +30 -0
- package/dist/{types-DPMjfOr_.d.ts → types-CTg0KaMy.d.ts} +2 -2
- package/dist/vector/search-worker.d.ts +7 -1
- package/dist/vector/search-worker.mjs +9 -13
- package/dist/worker-copies-ZLZS2CUM.mjs +2152 -0
- package/dist/workers/entry.mjs +60 -30
- package/openapi.json +66 -50
- package/package.json +233 -8
- package/dist/analysis-change-CKEMM2MC.mjs +0 -55
- package/dist/analysis-change-entry-SEDMJ6MW.mjs +0 -1
- package/dist/archive-history-E4R73RWD.mjs +0 -29
- package/dist/browser/analysis-change-ZKGJFENM.mjs +0 -942
- package/dist/browser/analysis-change-entry-5BFUVMHJ.mjs +0 -1
- package/dist/browser/archive-history-4IP5XQZY.mjs +0 -29
- package/dist/browser/chunk-25MTVDYD.mjs +0 -432
- package/dist/browser/chunk-3I27KXQD.mjs +0 -34
- package/dist/browser/chunk-3NLMB5CC.mjs +0 -217
- package/dist/browser/chunk-4RD3AFSB.mjs +0 -32
- package/dist/browser/chunk-5W3MMTLG.mjs +0 -19
- package/dist/browser/chunk-5YWB3E2W.mjs +0 -92
- package/dist/browser/chunk-7IGKGWSQ.mjs +0 -79
- package/dist/browser/chunk-AI5UI46D.mjs +0 -12
- package/dist/browser/chunk-ATEBYXP6.mjs +0 -10
- package/dist/browser/chunk-BLT4RHCJ.mjs +0 -241
- package/dist/browser/chunk-C26SPCGQ.mjs +0 -2636
- package/dist/browser/chunk-C4FJ3WDY.mjs +0 -177
- package/dist/browser/chunk-CXNTHHA7.mjs +0 -63
- package/dist/browser/chunk-DSXIBE6N.mjs +0 -78
- package/dist/browser/chunk-DUH6QUVU.mjs +0 -2374
- package/dist/browser/chunk-ELV4OZOI.mjs +0 -29
- package/dist/browser/chunk-EXQZGUQH.mjs +0 -193
- package/dist/browser/chunk-G64Q6OJF.mjs +0 -96
- package/dist/browser/chunk-HOZW3PKP.mjs +0 -9
- package/dist/browser/chunk-HUCSHDTB.mjs +0 -100
- package/dist/browser/chunk-JPTQZWJQ.mjs +0 -10
- package/dist/browser/chunk-K3IPRX6D.mjs +0 -2559
- package/dist/browser/chunk-ML7THVLJ.mjs +0 -38
- package/dist/browser/chunk-MY2XKH22.mjs +0 -40
- package/dist/browser/chunk-NLWTBAGB.mjs +0 -111
- package/dist/browser/chunk-NXQG7DRA.mjs +0 -318
- package/dist/browser/chunk-OEDCEZXJ.mjs +0 -92
- package/dist/browser/chunk-OIZS5KIX.mjs +0 -6
- package/dist/browser/chunk-RA6LSBCM.mjs +0 -43
- package/dist/browser/chunk-TK63WFXK.mjs +0 -90
- package/dist/browser/chunk-TY7L6OXO.mjs +0 -69
- package/dist/browser/chunk-U3JOQGWX.mjs +0 -19
- package/dist/browser/chunk-U4YDIBUT.mjs +0 -653
- package/dist/browser/chunk-UATIJ4KU.mjs +0 -21
- package/dist/browser/chunk-UKOWD2K5.mjs +0 -315
- package/dist/browser/chunk-UTMHUHUV.mjs +0 -150
- package/dist/browser/chunk-V43N6TZO.mjs +0 -857
- package/dist/browser/chunk-VI7BQR4U.mjs +0 -21
- package/dist/browser/chunk-WN464PTL.mjs +0 -375
- package/dist/browser/chunk-WXLBZJMT.mjs +0 -25
- package/dist/browser/chunk-X7TXYUKO.mjs +0 -86
- package/dist/browser/chunk-XAWNZ4G2.mjs +0 -151
- package/dist/browser/chunk-Y6IBAUNO.mjs +0 -561
- package/dist/browser/chunk-ZI2V4VD7.mjs +0 -21
- package/dist/browser/cold-module-YNUUDNOM.mjs +0 -761
- package/dist/browser/engine-hooks-HBVS6YM4.mjs +0 -18
- package/dist/browser/gzip-5S7ROJFJ.mjs +0 -1
- package/dist/browser/import-5ESVMFDJ.mjs +0 -20
- package/dist/browser/methods-KTQCSIN4.mjs +0 -30
- package/dist/browser/module-NDSQLPMQ.mjs +0 -25
- package/dist/browser/operations-OJ3BXS55.mjs +0 -5
- package/dist/browser/phrase-module-HAT3TLZN.mjs +0 -328
- package/dist/browser/pool-3JLET5RO.mjs +0 -297
- package/dist/browser/release-HYXPVJVS.mjs +0 -32
- package/dist/browser/restore-queue-LQBBTODR.mjs +0 -55
- package/dist/browser/retention-TY3L3BFN.mjs +0 -211
- package/dist/browser/snapshot-5FHPPCNZ.mjs +0 -965
- package/dist/browser/start-2UZTOBG5.mjs +0 -26
- package/dist/browser/sync-state-P5XG6LTQ.mjs +0 -15
- package/dist/browser/write-ULXAN5B4.mjs +0 -196
- package/dist/chunk-2NE7VCYE.mjs +0 -212
- package/dist/chunk-2ROUFMQX.mjs +0 -543
- package/dist/chunk-37CD3OKS.mjs +0 -87
- package/dist/chunk-3MXV3VHR.mjs +0 -46
- package/dist/chunk-3OH67G7R.mjs +0 -214
- package/dist/chunk-4B7JIGQD.mjs +0 -106
- package/dist/chunk-5YNRKI2C.mjs +0 -81
- package/dist/chunk-6HTGOXIK.mjs +0 -875
- package/dist/chunk-6OEGXLBX.mjs +0 -57
- package/dist/chunk-6RC4K46J.mjs +0 -86
- package/dist/chunk-7GFE3PEY.mjs +0 -40
- package/dist/chunk-7GXJUJ24.mjs +0 -49
- package/dist/chunk-7V5IUP2T.mjs +0 -63
- package/dist/chunk-A4L7YTKX.mjs +0 -458
- package/dist/chunk-BEZH7VEH.mjs +0 -23
- package/dist/chunk-BNL5OPRV.mjs +0 -634
- package/dist/chunk-BTPGQC6Z.mjs +0 -27
- package/dist/chunk-C7XQYG6U.mjs +0 -50
- package/dist/chunk-CQZXZ75V.mjs +0 -562
- package/dist/chunk-CWS55TEX.mjs +0 -242
- package/dist/chunk-CZQ33DLW.mjs +0 -78
- package/dist/chunk-EEBCDP36.mjs +0 -32
- package/dist/chunk-FB6463IN.mjs +0 -1499
- package/dist/chunk-FCJ553HS.mjs +0 -655
- package/dist/chunk-FEZVDOWX.mjs +0 -6996
- package/dist/chunk-FOCV4CBZ.mjs +0 -87
- package/dist/chunk-FQBFZAWG.mjs +0 -27
- package/dist/chunk-G6HRSGOU.mjs +0 -74
- package/dist/chunk-GES7U2PM.mjs +0 -68
- package/dist/chunk-GH4WQ22V.mjs +0 -34
- package/dist/chunk-GPWMUPCA.mjs +0 -1126
- package/dist/chunk-GQPTDQCL.mjs +0 -54
- package/dist/chunk-HJSN7UYG.mjs +0 -10
- package/dist/chunk-I54T6CQP.mjs +0 -117
- package/dist/chunk-IPN7S4KX.mjs +0 -130
- package/dist/chunk-J4IJTTEX.mjs +0 -226
- package/dist/chunk-JSV6OQ4C.mjs +0 -74
- package/dist/chunk-K4ZIGL2O.mjs +0 -290
- package/dist/chunk-KAKQ74LS.mjs +0 -53
- package/dist/chunk-KCQYFO4K.mjs +0 -62
- package/dist/chunk-KHKIRS5D.mjs +0 -113
- package/dist/chunk-KOKM4PQN.mjs +0 -52
- package/dist/chunk-KP7TYHWT.mjs +0 -92
- package/dist/chunk-KZ3NX2P7.mjs +0 -21
- package/dist/chunk-L5ORED7V.mjs +0 -25
- package/dist/chunk-LDNCLRZU.mjs +0 -218
- package/dist/chunk-LHKOSI2J.mjs +0 -58
- package/dist/chunk-LQG5G2LY.mjs +0 -39
- package/dist/chunk-MATMVH65.mjs +0 -9
- package/dist/chunk-MP7ABPTD.mjs +0 -189
- package/dist/chunk-MW6BR4QP.mjs +0 -316
- package/dist/chunk-MWD5VPN7.mjs +0 -21
- package/dist/chunk-ODYKO5TO.mjs +0 -101
- package/dist/chunk-OG7UGJ6F.mjs +0 -63
- package/dist/chunk-ORN5BLL7.mjs +0 -11
- package/dist/chunk-OYABFKTW.mjs +0 -1974
- package/dist/chunk-P5LANSH6.mjs +0 -121
- package/dist/chunk-PELHVTO7.mjs +0 -24
- package/dist/chunk-PIH5SJ4N.mjs +0 -7481
- package/dist/chunk-PSZI4O24.mjs +0 -253
- package/dist/chunk-PV2CG7EJ.mjs +0 -886
- package/dist/chunk-PWGYQXML.mjs +0 -470
- package/dist/chunk-Q2UL2TPC.mjs +0 -21
- package/dist/chunk-QHPYS427.mjs +0 -66
- package/dist/chunk-QJVOLKU6.mjs +0 -111
- package/dist/chunk-QLDABJZM.mjs +0 -20
- package/dist/chunk-QYRNLLLI.mjs +0 -99
- package/dist/chunk-RCX4WNLC.mjs +0 -151
- package/dist/chunk-RFBLQLLZ.mjs +0 -16
- package/dist/chunk-RIHIVFIQ.mjs +0 -240
- package/dist/chunk-RLOES5SX.mjs +0 -31
- package/dist/chunk-RWURUDSP.mjs +0 -2639
- package/dist/chunk-RZWWB2XR.mjs +0 -96
- package/dist/chunk-S5LN746F.mjs +0 -10
- package/dist/chunk-SOI6LTHM.mjs +0 -216
- package/dist/chunk-SQJWAIF4.mjs +0 -12
- package/dist/chunk-TDIK6NTV.mjs +0 -10
- package/dist/chunk-TQXHPFWT.mjs +0 -177
- package/dist/chunk-U55XJEIG.mjs +0 -18
- package/dist/chunk-UD5HIS4U.mjs +0 -382
- package/dist/chunk-UHICS3JI.mjs +0 -83
- package/dist/chunk-UJDJB3NE.mjs +0 -913
- package/dist/chunk-VD7J552I.mjs +0 -28
- package/dist/chunk-VSLSGASN.mjs +0 -30
- package/dist/chunk-VZ2ONHEE.mjs +0 -3715
- package/dist/chunk-W7OSSKH5.mjs +0 -1427
- package/dist/chunk-WZ7YV54N.mjs +0 -152
- package/dist/chunk-X5CV2E2B.mjs +0 -1
- package/dist/chunk-Y4WPNHMC.mjs +0 -50
- package/dist/chunk-YEKL4JBK.mjs +0 -96
- package/dist/chunk-ZXNQEW43.mjs +0 -18
- package/dist/chunk-ZYAY26KG.mjs +0 -29
- package/dist/direct-executor-V5DRIECI.mjs +0 -34
- package/dist/durability-wiring-3TD62MBI.mjs +0 -4072
- package/dist/engine-hooks-HA3SBOBR.mjs +0 -54
- package/dist/gzip-F4HMIEEQ.mjs +0 -1
- package/dist/import-GPKLTSKA.mjs +0 -56
- package/dist/methods-7IOINERF.mjs +0 -30
- package/dist/module-JYHFTVPS.mjs +0 -63
- package/dist/operations-G5EP6JPX.mjs +0 -5
- package/dist/phrase-module-XW5MKWP5.mjs +0 -330
- package/dist/pool-Y4A46T36.mjs +0 -298
- package/dist/react-native/chunks/analysis-change-QUVDNABS.mjs +0 -934
- package/dist/react-native/chunks/analysis-change-entry-OC4XASBF.mjs +0 -1
- package/dist/react-native/chunks/archive-history-MJKUQLSU.mjs +0 -29
- package/dist/react-native/chunks/chunk-2PRHILX3.mjs +0 -529
- package/dist/react-native/chunks/chunk-3NQOVO3K.mjs +0 -1
- package/dist/react-native/chunks/chunk-3WI35N75.mjs +0 -226
- package/dist/react-native/chunks/chunk-4DII3ZSM.mjs +0 -73
- package/dist/react-native/chunks/chunk-4J74WHQM.mjs +0 -177
- package/dist/react-native/chunks/chunk-4NWR3NGS.mjs +0 -151
- package/dist/react-native/chunks/chunk-5CQX3XXV.mjs +0 -17
- package/dist/react-native/chunks/chunk-5MSX5FRT.mjs +0 -858
- package/dist/react-native/chunks/chunk-6OFDUYVX.mjs +0 -92
- package/dist/react-native/chunks/chunk-6VBXNFLE.mjs +0 -9
- package/dist/react-native/chunks/chunk-6ZELFCK5.mjs +0 -315
- package/dist/react-native/chunks/chunk-AAAETEJK.mjs +0 -27
- package/dist/react-native/chunks/chunk-AM7RSBPF.mjs +0 -32
- package/dist/react-native/chunks/chunk-BITYFZSZ.mjs +0 -242
- package/dist/react-native/chunks/chunk-C5G6TJ7A.mjs +0 -140
- package/dist/react-native/chunks/chunk-CHPTFFJM.mjs +0 -43
- package/dist/react-native/chunks/chunk-DIYDOIM4.mjs +0 -10
- package/dist/react-native/chunks/chunk-DMIFXZ3Q.mjs +0 -432
- package/dist/react-native/chunks/chunk-DVDX4SDR.mjs +0 -375
- package/dist/react-native/chunks/chunk-DXRSEWA2.mjs +0 -12
- package/dist/react-native/chunks/chunk-F753DA54.mjs +0 -23
- package/dist/react-native/chunks/chunk-FHPW7P2O.mjs +0 -40
- package/dist/react-native/chunks/chunk-FTZHMRD2.mjs +0 -18
- package/dist/react-native/chunks/chunk-HJBJBH26.mjs +0 -34
- package/dist/react-native/chunks/chunk-IAENKE2D.mjs +0 -21
- package/dist/react-native/chunks/chunk-IO2SMUQD.mjs +0 -10
- package/dist/react-native/chunks/chunk-IYNT75CE.mjs +0 -111
- package/dist/react-native/chunks/chunk-JDOEEMEF.mjs +0 -38
- package/dist/react-native/chunks/chunk-JWUCMVRK.mjs +0 -15
- package/dist/react-native/chunks/chunk-KSBYEMCB.mjs +0 -100
- package/dist/react-native/chunks/chunk-KU646XXT.mjs +0 -164
- package/dist/react-native/chunks/chunk-LU3Y3P63.mjs +0 -68
- package/dist/react-native/chunks/chunk-LVIKKAA6.mjs +0 -93
- package/dist/react-native/chunks/chunk-LZSLNSUN.mjs +0 -193
- package/dist/react-native/chunks/chunk-MJDQU5MW.mjs +0 -1225
- package/dist/react-native/chunks/chunk-NNE4VDMM.mjs +0 -8
- package/dist/react-native/chunks/chunk-NVVRSRX5.mjs +0 -78
- package/dist/react-native/chunks/chunk-OCSLSH27.mjs +0 -22723
- package/dist/react-native/chunks/chunk-PB2YXVQW.mjs +0 -29
- package/dist/react-native/chunks/chunk-PJHAB5ZY.mjs +0 -79
- package/dist/react-native/chunks/chunk-PSWKQVVT.mjs +0 -9
- package/dist/react-native/chunks/chunk-RDWG33MM.mjs +0 -79
- package/dist/react-native/chunks/chunk-SK2PWYDH.mjs +0 -654
- package/dist/react-native/chunks/chunk-SUPXRTMD.mjs +0 -96
- package/dist/react-native/chunks/chunk-TORU2OHQ.mjs +0 -218
- package/dist/react-native/chunks/chunk-U4KSKA4Z.mjs +0 -23
- package/dist/react-native/chunks/chunk-UNUFZ2QY.mjs +0 -68
- package/dist/react-native/chunks/chunk-WBYQRHDY.mjs +0 -86
- package/dist/react-native/chunks/chunk-WVWJNUMN.mjs +0 -2562
- package/dist/react-native/chunks/chunk-YH7QY657.mjs +0 -288
- package/dist/react-native/chunks/chunk-YZW4CHM6.mjs +0 -562
- package/dist/react-native/chunks/chunk-ZNZ6CPAZ.mjs +0 -562
- package/dist/react-native/chunks/chunk-ZVQMBF2H.mjs +0 -63
- package/dist/react-native/chunks/chunk-ZWAIN4GG.mjs +0 -2636
- package/dist/react-native/chunks/chunk-ZZT7CEN7.mjs +0 -92
- package/dist/react-native/chunks/cold-module-N6KFNNZA.mjs +0 -773
- package/dist/react-native/chunks/durability-wiring-RN64S2TL.mjs +0 -4984
- package/dist/react-native/chunks/engine-hooks-CWA5CKCA.mjs +0 -30
- package/dist/react-native/chunks/gzip.react-native-HLEPDKZ3.mjs +0 -3
- package/dist/react-native/chunks/import-5UAWBRJP.mjs +0 -32
- package/dist/react-native/chunks/methods-6W5U4C3H.mjs +0 -30
- package/dist/react-native/chunks/module-6RP4ZCBW.mjs +0 -37
- package/dist/react-native/chunks/operations-GNRMD6EX.mjs +0 -5
- package/dist/react-native/chunks/phrase-module-QK22HSQ2.mjs +0 -329
- package/dist/react-native/chunks/pool-JR3NJCAF.mjs +0 -297
- package/dist/react-native/chunks/release-2SIHZWDO.mjs +0 -32
- package/dist/react-native/chunks/restore-hooks-ENFMDTWC.mjs +0 -127
- package/dist/react-native/chunks/restore-queue-4R6AASE5.mjs +0 -55
- package/dist/react-native/chunks/retention-5GTFT3GR.mjs +0 -223
- package/dist/react-native/chunks/snapshot-5LGPQXFS.mjs +0 -976
- package/dist/react-native/chunks/start-ZQJVZ5DN.mjs +0 -38
- package/dist/react-native/chunks/sync-state-PASCIHHT.mjs +0 -15
- package/dist/react-native/chunks/write-6BRYIIZ7.mjs +0 -208
- package/dist/release-SMR4WJD4.mjs +0 -32
- package/dist/restore-hooks-HXLIEB4A.mjs +0 -153
- package/dist/restore-queue-LZH7LMLR.mjs +0 -55
- package/dist/retention-3K7ARGAG.mjs +0 -66
- package/dist/runtime-COIUORCN.mjs +0 -177
- package/dist/snapshot-O7ICP7NJ.mjs +0 -783
- package/dist/start-S4PFP6RS.mjs +0 -66
- package/dist/sync-state-ZWHLAFLE.mjs +0 -15
- package/dist/thread-YLJ3ZPQ3.mjs +0 -50
- package/dist/write-2OBJGLFS.mjs +0 -233
- /package/dist/browser/{chunk-M3MQE2X7.mjs → digest-leaf-64IPRPZD.mjs} +0 -0
- /package/dist/browser/{chunk-JNOAKDUM.mjs → gzip-JF3S6PPT.mjs} +0 -0
- /package/dist/{chunk-ZXNNR73R.mjs → gzip-2UCZW2MM.mjs} +0 -0
|
@@ -0,0 +1,3041 @@
|
|
|
1
|
+
import { requireLoadedMessagePack, getNestedValue, parsedTypeOf } from './chunk-R4CE4IVU.mjs';
|
|
2
|
+
import { NarsilError, ErrorCodes } from './chunk-Q3ZZH5Z7.mjs';
|
|
3
|
+
import { codePointCount, exceedsCodePoints } from './chunk-TGPKS2UM.mjs';
|
|
4
|
+
|
|
5
|
+
// src/core/bitset.ts
|
|
6
|
+
function createBitSet(capacity2) {
|
|
7
|
+
return new Uint32Array(capacity2 + 31 >>> 5 || 1);
|
|
8
|
+
}
|
|
9
|
+
function bitsetSet(bs, index) {
|
|
10
|
+
const word = index >>> 5;
|
|
11
|
+
if (word < bs.length) {
|
|
12
|
+
bs[word] |= 1 << (index & 31);
|
|
13
|
+
}
|
|
14
|
+
}
|
|
15
|
+
function bitsetClear(bs, index) {
|
|
16
|
+
const word = index >>> 5;
|
|
17
|
+
if (word < bs.length) {
|
|
18
|
+
bs[word] &= ~(1 << (index & 31));
|
|
19
|
+
}
|
|
20
|
+
}
|
|
21
|
+
function bitsetHas(bs, index) {
|
|
22
|
+
const word = index >>> 5;
|
|
23
|
+
if (word >= bs.length) return false;
|
|
24
|
+
return (bs[word] & 1 << (index & 31)) !== 0;
|
|
25
|
+
}
|
|
26
|
+
function bitsetAnd(a, b) {
|
|
27
|
+
const len = Math.min(a.length, b.length);
|
|
28
|
+
const result = new Uint32Array(len);
|
|
29
|
+
for (let i = 0; i < len; i++) {
|
|
30
|
+
result[i] = a[i] & b[i];
|
|
31
|
+
}
|
|
32
|
+
return result;
|
|
33
|
+
}
|
|
34
|
+
function bitsetAndInto(target, other) {
|
|
35
|
+
const shared = Math.min(target.length, other.length);
|
|
36
|
+
for (let i = 0; i < shared; i++) target[i] &= other[i];
|
|
37
|
+
target.fill(0, shared);
|
|
38
|
+
}
|
|
39
|
+
function bitsetOrInto(target, other) {
|
|
40
|
+
const shared = Math.min(target.length, other.length);
|
|
41
|
+
for (let i = 0; i < shared; i++) target[i] |= other[i];
|
|
42
|
+
}
|
|
43
|
+
function bitsetAndNotInto(target, removed) {
|
|
44
|
+
const shared = Math.min(target.length, removed.length);
|
|
45
|
+
for (let i = 0; i < shared; i++) target[i] &= ~removed[i];
|
|
46
|
+
}
|
|
47
|
+
function bitsetNot(bs, capacity2) {
|
|
48
|
+
const result = new Uint32Array(bs.length);
|
|
49
|
+
const fullWords = capacity2 >>> 5;
|
|
50
|
+
for (let i = 0; i < fullWords; i++) {
|
|
51
|
+
result[i] = ~bs[i];
|
|
52
|
+
}
|
|
53
|
+
const remainder = capacity2 & 31;
|
|
54
|
+
if (remainder > 0 && fullWords < bs.length) {
|
|
55
|
+
result[fullWords] = ~bs[fullWords] & (1 << remainder) - 1;
|
|
56
|
+
}
|
|
57
|
+
return result;
|
|
58
|
+
}
|
|
59
|
+
function bitsetIsEmpty(bs) {
|
|
60
|
+
for (let i = 0; i < bs.length; i++) {
|
|
61
|
+
if (bs[i] !== 0) return false;
|
|
62
|
+
}
|
|
63
|
+
return true;
|
|
64
|
+
}
|
|
65
|
+
function* bitsetIterator(bs) {
|
|
66
|
+
for (let i = 0; i < bs.length; i++) {
|
|
67
|
+
let word = bs[i];
|
|
68
|
+
if (word === 0) continue;
|
|
69
|
+
const base = i << 5;
|
|
70
|
+
while (word !== 0) {
|
|
71
|
+
const tz = Math.clz32(word & -word) ^ 31;
|
|
72
|
+
yield base + tz;
|
|
73
|
+
word &= word - 1;
|
|
74
|
+
}
|
|
75
|
+
}
|
|
76
|
+
}
|
|
77
|
+
function bitsetFromSet(set, capacity2) {
|
|
78
|
+
const bs = createBitSet(capacity2);
|
|
79
|
+
for (const id of set) {
|
|
80
|
+
bs[id >>> 5] |= 1 << (id & 31);
|
|
81
|
+
}
|
|
82
|
+
return bs;
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
// src/core/pattern-index/constants.ts
|
|
86
|
+
var DEFAULT_PATTERN_WORK_CAP = 25e6;
|
|
87
|
+
var MAX_PATTERN_TEXT_CODE_POINTS = 1024;
|
|
88
|
+
var MAX_PATTERN_POSITIONS = 2048;
|
|
89
|
+
var MATCHER_STATE_BUDGET_BYTES = 1e6;
|
|
90
|
+
var MATCHER_CODE_POINT_BYTES = 8;
|
|
91
|
+
var MATCHER_SIMULATION_BYTES_PER_POSITION = 16;
|
|
92
|
+
var MATCHER_STATE_OVERHEAD_BYTES = 96;
|
|
93
|
+
var PATTERN_WORK_FLUSH_UNITS = 65536;
|
|
94
|
+
var PATTERN_RUN_CODE_POINTS = 3;
|
|
95
|
+
var MAX_PATTERN_TOLERANCE = 2;
|
|
96
|
+
var TYPO_CLAIM_SLOTS_PER_WORD = 32;
|
|
97
|
+
var PATTERN_TEST_OPERATORS = ["eq", "ne", "in", "nin", "startsWith", "endsWith", "contains"];
|
|
98
|
+
var PATTERN_EXPRESSION_OPERATORS = ["wildcard", "regex"];
|
|
99
|
+
var PATTERN_ELEMENT_OPERATORS = ["matchesAny", "containsAll"];
|
|
100
|
+
|
|
101
|
+
// src/pattern/constants.ts
|
|
102
|
+
var MATCHER_TRANSITION_BYTES = 48;
|
|
103
|
+
var MATCHER_EDGE_SLOT_BYTES = 8;
|
|
104
|
+
var MAX_DENSE_EDGE_CLASSES = 64;
|
|
105
|
+
var MATCHER_KEY_CHARACTER_BYTES = 2;
|
|
106
|
+
var MATCHER_MIN_CODE_POINTS_PER_STATE = 10;
|
|
107
|
+
var SHORTLIST_RUN_LOOKUPS = 16;
|
|
108
|
+
var SHORTLIST_INTERSECT_RATIO = 8;
|
|
109
|
+
var RUN_LIST_INITIAL_CAPACITY = 4;
|
|
110
|
+
var RUN_LIST_COMPACTION_FRACTION = 0.5;
|
|
111
|
+
var RUN_ENTRY_OVERHEAD_BYTES = 140;
|
|
112
|
+
var DOCUMENT_ENTRY_BYTES = 24;
|
|
113
|
+
var SIMULATION_STATE_BYTES = 8;
|
|
114
|
+
var SIMULATION_POSITION_BYTES = 8;
|
|
115
|
+
var KEPT_PROGRAM_BUDGET_FRACTION = 0.5;
|
|
116
|
+
var DIRECT_CLASS_CODE_POINTS = 128;
|
|
117
|
+
|
|
118
|
+
// src/pattern/automaton.ts
|
|
119
|
+
var BEFORE_VALUE_START = 0;
|
|
120
|
+
var AFTER_VALUE_END = 0;
|
|
121
|
+
var WORD_CODE_POINT = 1;
|
|
122
|
+
var OTHER_CODE_POINT = 2;
|
|
123
|
+
var EDGE_KINDS = 3;
|
|
124
|
+
var START_MASK = 7;
|
|
125
|
+
var END_MASK = 73;
|
|
126
|
+
var WORD_EDGE_MASK = 170;
|
|
127
|
+
var ANY_CONTEXT_MASK = 511;
|
|
128
|
+
var CONSUME_STATE = 0;
|
|
129
|
+
var SPLIT_STATE = 1;
|
|
130
|
+
var ASSERT_STATE = 2;
|
|
131
|
+
var MATCH_STATE = 3;
|
|
132
|
+
var ANY_CODE_POINT = -2;
|
|
133
|
+
var TESTED_CODE_POINT = -1;
|
|
134
|
+
var MATCH_REACHED = -1;
|
|
135
|
+
var WORD_KIND_EDGES = [48, 58, 65, 91, 95, 96, 97, 123];
|
|
136
|
+
function searchedClass(starts, isFoldTarget, codePoint) {
|
|
137
|
+
if (isFoldTarget?.(codePoint)) return -1 - codePoint;
|
|
138
|
+
let low = 0;
|
|
139
|
+
let high = starts.length;
|
|
140
|
+
while (low < high) {
|
|
141
|
+
const middle = low + high >>> 1;
|
|
142
|
+
if (starts[middle] <= codePoint) low = middle + 1;
|
|
143
|
+
else high = middle;
|
|
144
|
+
}
|
|
145
|
+
return low;
|
|
146
|
+
}
|
|
147
|
+
function codePointClasses(starts, isFoldTarget) {
|
|
148
|
+
const direct = new Int32Array(DIRECT_CLASS_CODE_POINTS);
|
|
149
|
+
for (let codePoint = 0; codePoint < direct.length; codePoint++) {
|
|
150
|
+
direct[codePoint] = searchedClass(starts, isFoldTarget, codePoint);
|
|
151
|
+
}
|
|
152
|
+
return { starts, isFoldTarget, direct };
|
|
153
|
+
}
|
|
154
|
+
function classOf(program, codePoint) {
|
|
155
|
+
const { classes } = program;
|
|
156
|
+
if (codePoint < classes.direct.length) return classes.direct[codePoint];
|
|
157
|
+
return searchedClass(classes.starts, classes.isFoldTarget, codePoint);
|
|
158
|
+
}
|
|
159
|
+
function isWordCodePoint(codePoint) {
|
|
160
|
+
return codePoint >= 48 && codePoint <= 57 || codePoint >= 65 && codePoint <= 90 || codePoint >= 97 && codePoint <= 122 || codePoint === 95;
|
|
161
|
+
}
|
|
162
|
+
function kindOf(codePoint) {
|
|
163
|
+
return isWordCodePoint(codePoint) ? WORD_CODE_POINT : OTHER_CODE_POINT;
|
|
164
|
+
}
|
|
165
|
+
function contextOf(previous, next) {
|
|
166
|
+
return previous * EDGE_KINDS + next;
|
|
167
|
+
}
|
|
168
|
+
function accepts(program, position, codePoint) {
|
|
169
|
+
const literal = program.literals[position];
|
|
170
|
+
if (literal >= 0) return literal === codePoint;
|
|
171
|
+
if (literal === ANY_CODE_POINT) return true;
|
|
172
|
+
return program.tests[position]?.has(codePoint) ?? false;
|
|
173
|
+
}
|
|
174
|
+
var LAST_STAMP = 4294967295;
|
|
175
|
+
function createClosureScratch(states) {
|
|
176
|
+
return { marks: new Uint32Array(states), stack: new Int32Array(states), stamp: 0 };
|
|
177
|
+
}
|
|
178
|
+
function nextStamp(scratch) {
|
|
179
|
+
if (scratch.stamp === LAST_STAMP) {
|
|
180
|
+
scratch.marks.fill(0);
|
|
181
|
+
scratch.stamp = 0;
|
|
182
|
+
}
|
|
183
|
+
scratch.stamp++;
|
|
184
|
+
return scratch.stamp;
|
|
185
|
+
}
|
|
186
|
+
function closeOver(program, seeds, seedCount, fromStart, context, scratch, out) {
|
|
187
|
+
const { kinds, next, alternative, masks } = program;
|
|
188
|
+
const { marks, stack } = scratch;
|
|
189
|
+
const stamp = nextStamp(scratch);
|
|
190
|
+
let depth = 0;
|
|
191
|
+
for (let at = 0; at < seedCount; at++) {
|
|
192
|
+
const state = next[seeds[at]];
|
|
193
|
+
if (marks[state] === stamp) continue;
|
|
194
|
+
marks[state] = stamp;
|
|
195
|
+
stack[depth++] = state;
|
|
196
|
+
}
|
|
197
|
+
if (fromStart && marks[program.start] !== stamp) {
|
|
198
|
+
marks[program.start] = stamp;
|
|
199
|
+
stack[depth++] = program.start;
|
|
200
|
+
}
|
|
201
|
+
let count = 0;
|
|
202
|
+
while (depth > 0) {
|
|
203
|
+
const state = stack[--depth];
|
|
204
|
+
const kind = kinds[state];
|
|
205
|
+
if (kind === CONSUME_STATE) {
|
|
206
|
+
out[count++] = state;
|
|
207
|
+
continue;
|
|
208
|
+
}
|
|
209
|
+
if (kind === MATCH_STATE) return MATCH_REACHED;
|
|
210
|
+
if (kind === ASSERT_STATE && (masks[state] >>> context & 1) === 0) continue;
|
|
211
|
+
const following = next[state];
|
|
212
|
+
if (marks[following] !== stamp) {
|
|
213
|
+
marks[following] = stamp;
|
|
214
|
+
stack[depth++] = following;
|
|
215
|
+
}
|
|
216
|
+
if (kind !== SPLIT_STATE) continue;
|
|
217
|
+
const other = alternative[state];
|
|
218
|
+
if (marks[other] !== stamp) {
|
|
219
|
+
marks[other] = stamp;
|
|
220
|
+
stack[depth++] = other;
|
|
221
|
+
}
|
|
222
|
+
}
|
|
223
|
+
return count;
|
|
224
|
+
}
|
|
225
|
+
|
|
226
|
+
// src/pattern/position-simulation.ts
|
|
227
|
+
var STEP_CONTINUES = 0;
|
|
228
|
+
var STEP_MATCHED = 1;
|
|
229
|
+
var STEP_DEAD = 2;
|
|
230
|
+
var CONTEXTS = 9;
|
|
231
|
+
function simulationBytes(program) {
|
|
232
|
+
const startClosureBytes = CONTEXTS * Uint32Array.BYTES_PER_ELEMENT;
|
|
233
|
+
return program.states * SIMULATION_STATE_BYTES + program.positions * (SIMULATION_POSITION_BYTES + startClosureBytes);
|
|
234
|
+
}
|
|
235
|
+
var PositionSimulation = class {
|
|
236
|
+
constructor(program) {
|
|
237
|
+
this.program = program;
|
|
238
|
+
this.after = new Uint32Array(program.positions);
|
|
239
|
+
this.candidates = new Uint32Array(program.positions);
|
|
240
|
+
this.scratch = createClosureScratch(program.states);
|
|
241
|
+
}
|
|
242
|
+
steps = 0;
|
|
243
|
+
previousKind = BEFORE_VALUE_START;
|
|
244
|
+
after;
|
|
245
|
+
afterCount = 0;
|
|
246
|
+
candidates;
|
|
247
|
+
scratch;
|
|
248
|
+
starts = new Array(CONTEXTS).fill(null);
|
|
249
|
+
get bytes() {
|
|
250
|
+
return simulationBytes(this.program);
|
|
251
|
+
}
|
|
252
|
+
reset() {
|
|
253
|
+
this.afterCount = 0;
|
|
254
|
+
this.previousKind = BEFORE_VALUE_START;
|
|
255
|
+
}
|
|
256
|
+
load(positions, previousKind) {
|
|
257
|
+
this.after.set(positions);
|
|
258
|
+
this.afterCount = positions.length;
|
|
259
|
+
this.previousKind = previousKind;
|
|
260
|
+
}
|
|
261
|
+
sortedAfter() {
|
|
262
|
+
return this.after.slice(0, this.afterCount).sort();
|
|
263
|
+
}
|
|
264
|
+
step(codePoint) {
|
|
265
|
+
const { program, candidates } = this;
|
|
266
|
+
const following = kindOf(codePoint);
|
|
267
|
+
const reached = this.close(contextOf(this.previousKind, following));
|
|
268
|
+
if (reached === MATCH_REACHED) {
|
|
269
|
+
this.steps = 0;
|
|
270
|
+
return STEP_MATCHED;
|
|
271
|
+
}
|
|
272
|
+
this.steps = reached;
|
|
273
|
+
let kept = 0;
|
|
274
|
+
for (let at = 0; at < reached; at++) {
|
|
275
|
+
const position = candidates[at];
|
|
276
|
+
if (accepts(program, position, codePoint)) this.after[kept++] = position;
|
|
277
|
+
}
|
|
278
|
+
this.afterCount = kept;
|
|
279
|
+
this.previousKind = following;
|
|
280
|
+
return kept === 0 && program.anchoredStart ? STEP_DEAD : STEP_CONTINUES;
|
|
281
|
+
}
|
|
282
|
+
endMatches() {
|
|
283
|
+
return this.close(contextOf(this.previousKind, AFTER_VALUE_END)) === MATCH_REACHED;
|
|
284
|
+
}
|
|
285
|
+
startClosure(context) {
|
|
286
|
+
const known = this.starts[context];
|
|
287
|
+
if (known !== null) return known;
|
|
288
|
+
const reached = closeOver(this.program, this.after, 0, true, context, this.scratch, this.candidates);
|
|
289
|
+
const closure = reached === MATCH_REACHED ? { positions: new Uint32Array(0), matches: true } : { positions: this.candidates.slice(0, reached), matches: false };
|
|
290
|
+
this.starts[context] = closure;
|
|
291
|
+
return closure;
|
|
292
|
+
}
|
|
293
|
+
close(context) {
|
|
294
|
+
const fromStart = this.previousKind === BEFORE_VALUE_START || !this.program.anchoredStart;
|
|
295
|
+
const start = fromStart ? this.startClosure(context) : null;
|
|
296
|
+
if (start?.matches) return MATCH_REACHED;
|
|
297
|
+
const { program, scratch, candidates } = this;
|
|
298
|
+
let count = closeOver(program, this.after, this.afterCount, false, context, scratch, candidates);
|
|
299
|
+
if (count === MATCH_REACHED || start === null) return count;
|
|
300
|
+
const { marks, stamp } = scratch;
|
|
301
|
+
for (const position of start.positions) {
|
|
302
|
+
if (marks[position] === stamp) continue;
|
|
303
|
+
marks[position] = stamp;
|
|
304
|
+
candidates[count++] = position;
|
|
305
|
+
}
|
|
306
|
+
return count;
|
|
307
|
+
}
|
|
308
|
+
};
|
|
309
|
+
|
|
310
|
+
// src/pattern/expression/constants.ts
|
|
311
|
+
var MAX_PATTERN_GROUP_DEPTH = 32;
|
|
312
|
+
var MAX_PATTERN_REPEAT_COUNT = 2048;
|
|
313
|
+
var MAX_NUMBER_RANGE_DIGITS = 15;
|
|
314
|
+
var CODE_POINT_TEST_ENTRY_BYTES = 8;
|
|
315
|
+
var PROGRAM_STATE_BYTES = 11;
|
|
316
|
+
var PROGRAM_POSITION_BYTES = 12;
|
|
317
|
+
|
|
318
|
+
// src/pattern/expression/compile.ts
|
|
319
|
+
var UNSET = -1;
|
|
320
|
+
var ProgramBuilder = class {
|
|
321
|
+
kinds = [];
|
|
322
|
+
next = [];
|
|
323
|
+
alternative = [];
|
|
324
|
+
masks = [];
|
|
325
|
+
literals = [];
|
|
326
|
+
tests = [];
|
|
327
|
+
positions = 0;
|
|
328
|
+
add(kind, next, alternative, mask) {
|
|
329
|
+
this.kinds.push(kind);
|
|
330
|
+
this.next.push(next);
|
|
331
|
+
this.alternative.push(alternative);
|
|
332
|
+
this.masks.push(mask);
|
|
333
|
+
this.literals.push(UNSET);
|
|
334
|
+
this.tests.push(null);
|
|
335
|
+
return this.kinds.length - 1;
|
|
336
|
+
}
|
|
337
|
+
consume(literal, test, next) {
|
|
338
|
+
const state = this.add(CONSUME_STATE, next, UNSET, 0);
|
|
339
|
+
this.literals[state] = literal;
|
|
340
|
+
this.tests[state] = test;
|
|
341
|
+
this.positions++;
|
|
342
|
+
return state;
|
|
343
|
+
}
|
|
344
|
+
split(first, second) {
|
|
345
|
+
return this.add(SPLIT_STATE, first, second, 0);
|
|
346
|
+
}
|
|
347
|
+
compile(plan, next) {
|
|
348
|
+
switch (plan.kind) {
|
|
349
|
+
case "consume":
|
|
350
|
+
return this.consume(plan.literal, plan.test, next);
|
|
351
|
+
case "assert":
|
|
352
|
+
return plan.mask === ANY_CONTEXT_MASK ? next : this.add(ASSERT_STATE, next, UNSET, plan.mask);
|
|
353
|
+
case "sequence": {
|
|
354
|
+
let entry = next;
|
|
355
|
+
for (let at = plan.items.length - 1; at >= 0; at--) entry = this.compile(plan.items[at], entry);
|
|
356
|
+
return entry;
|
|
357
|
+
}
|
|
358
|
+
case "choice": {
|
|
359
|
+
let entry = this.compile(plan.branches[plan.branches.length - 1], next);
|
|
360
|
+
for (let at = plan.branches.length - 2; at >= 0; at--)
|
|
361
|
+
entry = this.split(this.compile(plan.branches[at], next), entry);
|
|
362
|
+
return entry;
|
|
363
|
+
}
|
|
364
|
+
case "repeat":
|
|
365
|
+
return this.compileRepeat(plan.body, plan.min, plan.max, next);
|
|
366
|
+
}
|
|
367
|
+
}
|
|
368
|
+
loop(body, next, entersBody) {
|
|
369
|
+
const loop = this.split(UNSET, next);
|
|
370
|
+
const entry = this.compile(body, loop);
|
|
371
|
+
this.next[loop] = entry;
|
|
372
|
+
return entersBody ? entry : loop;
|
|
373
|
+
}
|
|
374
|
+
compileRepeat(body, min, max, next) {
|
|
375
|
+
let entry;
|
|
376
|
+
let required = min;
|
|
377
|
+
if (max === null) {
|
|
378
|
+
entry = this.loop(body, next, min > 0);
|
|
379
|
+
if (min > 0) required--;
|
|
380
|
+
} else {
|
|
381
|
+
entry = next;
|
|
382
|
+
for (let optional = max - min; optional > 0; optional--) entry = this.split(this.compile(body, entry), next);
|
|
383
|
+
}
|
|
384
|
+
for (; required > 0; required--) entry = this.compile(body, entry);
|
|
385
|
+
return entry;
|
|
386
|
+
}
|
|
387
|
+
};
|
|
388
|
+
function startsOnlyAtStart(program) {
|
|
389
|
+
const scratch = createClosureScratch(program.states);
|
|
390
|
+
const candidates = new Uint32Array(program.positions);
|
|
391
|
+
const seeds = new Uint32Array(0);
|
|
392
|
+
for (const previous of [WORD_CODE_POINT, OTHER_CODE_POINT]) {
|
|
393
|
+
for (const following of [AFTER_VALUE_END, WORD_CODE_POINT, OTHER_CODE_POINT]) {
|
|
394
|
+
const reached = closeOver(program, seeds, 0, true, contextOf(previous, following), scratch, candidates);
|
|
395
|
+
if (reached === MATCH_REACHED || reached > 0) return false;
|
|
396
|
+
}
|
|
397
|
+
}
|
|
398
|
+
return true;
|
|
399
|
+
}
|
|
400
|
+
function collectClassEdges(plan, edges, tests) {
|
|
401
|
+
switch (plan.kind) {
|
|
402
|
+
case "consume":
|
|
403
|
+
if (plan.literal >= 0) {
|
|
404
|
+
edges.add(plan.literal);
|
|
405
|
+
edges.add(plan.literal + 1);
|
|
406
|
+
} else if (plan.test !== null && !tests.has(plan.test)) {
|
|
407
|
+
tests.add(plan.test);
|
|
408
|
+
const { ranges } = plan.test;
|
|
409
|
+
for (let at = 0; at < ranges.length; at += 2) {
|
|
410
|
+
edges.add(ranges[at]);
|
|
411
|
+
edges.add(ranges[at + 1] + 1);
|
|
412
|
+
}
|
|
413
|
+
}
|
|
414
|
+
return;
|
|
415
|
+
case "assert":
|
|
416
|
+
return;
|
|
417
|
+
case "sequence":
|
|
418
|
+
for (const item of plan.items) collectClassEdges(item, edges, tests);
|
|
419
|
+
return;
|
|
420
|
+
case "choice":
|
|
421
|
+
for (const branch of plan.branches) collectClassEdges(branch, edges, tests);
|
|
422
|
+
return;
|
|
423
|
+
case "repeat":
|
|
424
|
+
collectClassEdges(plan.body, edges, tests);
|
|
425
|
+
}
|
|
426
|
+
}
|
|
427
|
+
function planClasses(plan) {
|
|
428
|
+
const edges = new Set(WORD_KIND_EDGES);
|
|
429
|
+
const tests = /* @__PURE__ */ new Set();
|
|
430
|
+
collectClassEdges(plan, edges, tests);
|
|
431
|
+
let isFoldTarget = null;
|
|
432
|
+
for (const test of tests) isFoldTarget ??= test.isFoldTarget;
|
|
433
|
+
return codePointClasses(Uint32Array.from(edges).sort(), isFoldTarget);
|
|
434
|
+
}
|
|
435
|
+
function programBytes(states, positions, tests, classes) {
|
|
436
|
+
const distinct = /* @__PURE__ */ new Set();
|
|
437
|
+
for (const test of tests) if (test !== null) distinct.add(test);
|
|
438
|
+
let bytes = states * PROGRAM_STATE_BYTES + positions * PROGRAM_POSITION_BYTES + classes.starts.byteLength + classes.direct.byteLength;
|
|
439
|
+
for (const test of distinct) bytes += test.bytes;
|
|
440
|
+
return bytes;
|
|
441
|
+
}
|
|
442
|
+
function sizeOf(plan, tests) {
|
|
443
|
+
switch (plan.kind) {
|
|
444
|
+
case "consume":
|
|
445
|
+
if (plan.test !== null) tests.add(plan.test);
|
|
446
|
+
return { states: 1, positions: 1 };
|
|
447
|
+
case "assert":
|
|
448
|
+
return { states: plan.mask === ANY_CONTEXT_MASK ? 0 : 1, positions: 0 };
|
|
449
|
+
case "sequence":
|
|
450
|
+
case "choice": {
|
|
451
|
+
const children = plan.kind === "sequence" ? plan.items : plan.branches;
|
|
452
|
+
const total = { states: plan.kind === "choice" ? children.length - 1 : 0, positions: 0 };
|
|
453
|
+
for (const child of children) {
|
|
454
|
+
const size = sizeOf(child, tests);
|
|
455
|
+
total.states += size.states;
|
|
456
|
+
total.positions += size.positions;
|
|
457
|
+
}
|
|
458
|
+
return total;
|
|
459
|
+
}
|
|
460
|
+
case "repeat": {
|
|
461
|
+
const body = sizeOf(plan.body, tests);
|
|
462
|
+
if (plan.max === null) {
|
|
463
|
+
const copies = Math.max(plan.min, 1);
|
|
464
|
+
return { states: 1 + copies * body.states, positions: copies * body.positions };
|
|
465
|
+
}
|
|
466
|
+
const optional = plan.max - plan.min;
|
|
467
|
+
return { states: optional + plan.max * body.states, positions: plan.max * body.positions };
|
|
468
|
+
}
|
|
469
|
+
}
|
|
470
|
+
}
|
|
471
|
+
function planSize(plan) {
|
|
472
|
+
const tests = /* @__PURE__ */ new Set();
|
|
473
|
+
const size = sizeOf(plan, tests);
|
|
474
|
+
const states = size.states + 1;
|
|
475
|
+
return {
|
|
476
|
+
states,
|
|
477
|
+
positions: size.positions,
|
|
478
|
+
bytes: programBytes(states, size.positions, tests, planClasses(plan))
|
|
479
|
+
};
|
|
480
|
+
}
|
|
481
|
+
function compileProgram(plan) {
|
|
482
|
+
const builder = new ProgramBuilder();
|
|
483
|
+
const match = builder.add(MATCH_STATE, UNSET, UNSET, 0);
|
|
484
|
+
const start = builder.compile(plan, match);
|
|
485
|
+
const count = builder.kinds.length;
|
|
486
|
+
const renumbered = new Int32Array(count);
|
|
487
|
+
let nextPosition = 0;
|
|
488
|
+
let nextOther = builder.positions;
|
|
489
|
+
for (let state = 0; state < count; state++) {
|
|
490
|
+
renumbered[state] = builder.kinds[state] === CONSUME_STATE ? nextPosition++ : nextOther++;
|
|
491
|
+
}
|
|
492
|
+
const kinds = new Uint8Array(count);
|
|
493
|
+
const next = new Int32Array(count);
|
|
494
|
+
const alternative = new Int32Array(count);
|
|
495
|
+
const masks = new Uint16Array(count);
|
|
496
|
+
const literals = new Int32Array(builder.positions);
|
|
497
|
+
const tests = new Array(builder.positions).fill(null);
|
|
498
|
+
for (let state = 0; state < count; state++) {
|
|
499
|
+
const target = renumbered[state];
|
|
500
|
+
kinds[target] = builder.kinds[state];
|
|
501
|
+
next[target] = builder.next[state] === UNSET ? UNSET : renumbered[builder.next[state]];
|
|
502
|
+
alternative[target] = builder.alternative[state] === UNSET ? UNSET : renumbered[builder.alternative[state]];
|
|
503
|
+
masks[target] = builder.masks[state];
|
|
504
|
+
if (target < builder.positions) {
|
|
505
|
+
literals[target] = builder.literals[state];
|
|
506
|
+
tests[target] = builder.tests[state];
|
|
507
|
+
}
|
|
508
|
+
}
|
|
509
|
+
const classes = planClasses(plan);
|
|
510
|
+
const draft = {
|
|
511
|
+
positions: builder.positions,
|
|
512
|
+
states: count,
|
|
513
|
+
kinds,
|
|
514
|
+
next,
|
|
515
|
+
alternative,
|
|
516
|
+
masks,
|
|
517
|
+
literals,
|
|
518
|
+
tests,
|
|
519
|
+
start: renumbered[start],
|
|
520
|
+
anchoredStart: false,
|
|
521
|
+
classes,
|
|
522
|
+
bytes: programBytes(count, builder.positions, tests, classes)
|
|
523
|
+
};
|
|
524
|
+
return { ...draft, anchoredStart: startsOnlyAtStart(draft) };
|
|
525
|
+
}
|
|
526
|
+
|
|
527
|
+
// src/pattern/fold-sources.ts
|
|
528
|
+
var NO_SOURCES = [];
|
|
529
|
+
var sourcesByTable = /* @__PURE__ */ new WeakMap();
|
|
530
|
+
function sourcesByFold(table) {
|
|
531
|
+
const known = sourcesByTable.get(table);
|
|
532
|
+
if (known !== void 0) return known;
|
|
533
|
+
const sources = /* @__PURE__ */ new Map();
|
|
534
|
+
for (const [source, folded] of table) {
|
|
535
|
+
const listed = sources.get(folded);
|
|
536
|
+
if (listed === void 0) sources.set(folded, [source]);
|
|
537
|
+
else listed.push(source);
|
|
538
|
+
}
|
|
539
|
+
sourcesByTable.set(table, sources);
|
|
540
|
+
return sources;
|
|
541
|
+
}
|
|
542
|
+
function singleFoldSourcesOf(host) {
|
|
543
|
+
const sources = sourcesByFold(host.singleFolds());
|
|
544
|
+
return (folded) => sources.get(folded) ?? NO_SOURCES;
|
|
545
|
+
}
|
|
546
|
+
|
|
547
|
+
// src/pattern/expression/code-point-tests.ts
|
|
548
|
+
var CLASS_RANGES = {
|
|
549
|
+
digit: [48, 57],
|
|
550
|
+
word: [48, 57, 65, 90, 95, 95, 97, 122],
|
|
551
|
+
space: [9, 10, 12, 13, 32, 32]
|
|
552
|
+
};
|
|
553
|
+
function mergedRanges(bounds) {
|
|
554
|
+
const pairs = [];
|
|
555
|
+
for (let at = 0; at < bounds.length; at += 2) pairs.push([bounds[at], bounds[at + 1]]);
|
|
556
|
+
pairs.sort((left, right) => left[0] - right[0]);
|
|
557
|
+
const merged = [];
|
|
558
|
+
for (const [low, high] of pairs) {
|
|
559
|
+
const last = merged.length - 1;
|
|
560
|
+
if (merged.length > 0 && low <= merged[last] + 1) merged[last] = Math.max(merged[last], high);
|
|
561
|
+
else merged.push(low, high);
|
|
562
|
+
}
|
|
563
|
+
return Uint32Array.from(merged);
|
|
564
|
+
}
|
|
565
|
+
function inRanges(ranges, codePoint) {
|
|
566
|
+
let low = 0;
|
|
567
|
+
let high = ranges.length / 2;
|
|
568
|
+
while (low < high) {
|
|
569
|
+
const middle = low + high >>> 1;
|
|
570
|
+
if (codePoint < ranges[middle * 2]) high = middle;
|
|
571
|
+
else if (codePoint > ranges[middle * 2 + 1]) low = middle + 1;
|
|
572
|
+
else return true;
|
|
573
|
+
}
|
|
574
|
+
return false;
|
|
575
|
+
}
|
|
576
|
+
function rangeBoundsOf(items) {
|
|
577
|
+
const bounds = [];
|
|
578
|
+
for (const item of items) {
|
|
579
|
+
if (item.kind === "member") bounds.push(item.codePoint, item.codePoint);
|
|
580
|
+
else if (item.kind === "range") bounds.push(item.low, item.high);
|
|
581
|
+
else bounds.push(...CLASS_RANGES[item.name]);
|
|
582
|
+
}
|
|
583
|
+
return bounds;
|
|
584
|
+
}
|
|
585
|
+
function rangeTest(ranges, negated) {
|
|
586
|
+
return {
|
|
587
|
+
bytes: ranges.byteLength + CODE_POINT_TEST_ENTRY_BYTES,
|
|
588
|
+
ranges,
|
|
589
|
+
isFoldTarget: null,
|
|
590
|
+
has: (codePoint) => inRanges(ranges, codePoint) !== negated
|
|
591
|
+
};
|
|
592
|
+
}
|
|
593
|
+
function foldedRangeTest(ranges, negated, host) {
|
|
594
|
+
const singleFoldSources = singleFoldSourcesOf(host);
|
|
595
|
+
const holdsFold = (folded) => {
|
|
596
|
+
if (inRanges(ranges, folded)) return true;
|
|
597
|
+
for (const source of singleFoldSources(folded)) if (inRanges(ranges, source)) return true;
|
|
598
|
+
return false;
|
|
599
|
+
};
|
|
600
|
+
return {
|
|
601
|
+
bytes: ranges.byteLength + CODE_POINT_TEST_ENTRY_BYTES,
|
|
602
|
+
ranges,
|
|
603
|
+
isFoldTarget: (folded) => singleFoldSources(folded).length > 0,
|
|
604
|
+
has: (folded) => holdsFold(folded) !== negated
|
|
605
|
+
};
|
|
606
|
+
}
|
|
607
|
+
function classTest(name) {
|
|
608
|
+
return rangeTest(mergedRanges([...CLASS_RANGES[name]]), false);
|
|
609
|
+
}
|
|
610
|
+
function setTest(items, negated, caseFold, host) {
|
|
611
|
+
const ranges = mergedRanges(rangeBoundsOf(items));
|
|
612
|
+
return caseFold ? foldedRangeTest(ranges, negated, host) : rangeTest(ranges, negated);
|
|
613
|
+
}
|
|
614
|
+
function distinctMultiFolds(items, host) {
|
|
615
|
+
const seen = /* @__PURE__ */ new Set();
|
|
616
|
+
const folds = [];
|
|
617
|
+
for (const item of items) {
|
|
618
|
+
if (item.kind !== "member") continue;
|
|
619
|
+
const fold = [];
|
|
620
|
+
host.appendFoldedCodePoint(item.codePoint, fold);
|
|
621
|
+
if (fold.length < 2) continue;
|
|
622
|
+
const key = String.fromCodePoint(...fold);
|
|
623
|
+
if (seen.has(key)) continue;
|
|
624
|
+
seen.add(key);
|
|
625
|
+
folds.push(fold);
|
|
626
|
+
}
|
|
627
|
+
return folds;
|
|
628
|
+
}
|
|
629
|
+
|
|
630
|
+
// src/pattern/expression/lower.ts
|
|
631
|
+
var EMPTY = { kind: "assert", mask: ANY_CONTEXT_MASK };
|
|
632
|
+
function literalPlan(codePoint) {
|
|
633
|
+
return { kind: "consume", literal: codePoint, test: null };
|
|
634
|
+
}
|
|
635
|
+
function testedPlan(test) {
|
|
636
|
+
return { kind: "consume", literal: TESTED_CODE_POINT, test };
|
|
637
|
+
}
|
|
638
|
+
function sequenceOf(items) {
|
|
639
|
+
const kept = [];
|
|
640
|
+
let mask = ANY_CONTEXT_MASK;
|
|
641
|
+
const flushMask = () => {
|
|
642
|
+
if (mask !== ANY_CONTEXT_MASK) kept.push({ kind: "assert", mask });
|
|
643
|
+
mask = ANY_CONTEXT_MASK;
|
|
644
|
+
};
|
|
645
|
+
const visit = (item) => {
|
|
646
|
+
if (item.kind === "sequence") {
|
|
647
|
+
for (const nested of item.items) visit(nested);
|
|
648
|
+
} else if (item.kind === "assert") {
|
|
649
|
+
mask &= item.mask;
|
|
650
|
+
} else {
|
|
651
|
+
flushMask();
|
|
652
|
+
kept.push(item);
|
|
653
|
+
}
|
|
654
|
+
};
|
|
655
|
+
for (const item of items) visit(item);
|
|
656
|
+
if (kept.length === 0) return { kind: "assert", mask };
|
|
657
|
+
flushMask();
|
|
658
|
+
return kept.length === 1 ? kept[0] : { kind: "sequence", items: kept };
|
|
659
|
+
}
|
|
660
|
+
function choiceOf(branches) {
|
|
661
|
+
const kept = [];
|
|
662
|
+
let mask = 0;
|
|
663
|
+
let empty = false;
|
|
664
|
+
const visit = (branch) => {
|
|
665
|
+
if (branch.kind === "choice") {
|
|
666
|
+
for (const nested of branch.branches) visit(nested);
|
|
667
|
+
} else if (branch.kind === "assert") {
|
|
668
|
+
mask |= branch.mask;
|
|
669
|
+
empty = true;
|
|
670
|
+
} else {
|
|
671
|
+
kept.push(branch);
|
|
672
|
+
}
|
|
673
|
+
};
|
|
674
|
+
for (const branch of branches) visit(branch);
|
|
675
|
+
if (kept.length === 0) return { kind: "assert", mask };
|
|
676
|
+
if (empty) kept.push({ kind: "assert", mask });
|
|
677
|
+
return kept.length === 1 ? kept[0] : { kind: "choice", branches: kept };
|
|
678
|
+
}
|
|
679
|
+
function isLoose(plan) {
|
|
680
|
+
return plan.kind === "repeat" && plan.min <= 1 && (plan.max === null || plan.max === 1);
|
|
681
|
+
}
|
|
682
|
+
function repeatOf(body, min, max) {
|
|
683
|
+
if (max === 0) return EMPTY;
|
|
684
|
+
if (body.kind === "assert") return min === 0 ? EMPTY : body;
|
|
685
|
+
if (min === 1 && max === 1) return body;
|
|
686
|
+
const loose = min <= 1 && (max === null || max === 1);
|
|
687
|
+
if (loose && isLoose(body)) {
|
|
688
|
+
const nullable = min === 0 || body.min === 0;
|
|
689
|
+
const unbounded = max === null || body.max === null;
|
|
690
|
+
return { kind: "repeat", body: body.body, min: nullable ? 0 : 1, max: unbounded ? null : 1 };
|
|
691
|
+
}
|
|
692
|
+
return { kind: "repeat", body, min, max };
|
|
693
|
+
}
|
|
694
|
+
function foldedLiteral(codePoint, host, scratch) {
|
|
695
|
+
scratch.length = 0;
|
|
696
|
+
host.appendFoldedCodePoint(codePoint, scratch);
|
|
697
|
+
return sequenceOf(scratch.map(literalPlan));
|
|
698
|
+
}
|
|
699
|
+
function setPlan(node, caseFold, host) {
|
|
700
|
+
const single = testedPlan(setTest(node.items, node.negated, caseFold, host));
|
|
701
|
+
if (!caseFold || node.negated) return single;
|
|
702
|
+
const sequences = distinctMultiFolds(node.items, host).map((fold) => sequenceOf(fold.map(literalPlan)));
|
|
703
|
+
return sequences.length === 0 ? single : choiceOf([single, ...sequences]);
|
|
704
|
+
}
|
|
705
|
+
function lowerNode(node, caseFold, host, scratch) {
|
|
706
|
+
switch (node.kind) {
|
|
707
|
+
case "literal":
|
|
708
|
+
return caseFold ? foldedLiteral(node.codePoint, host, scratch) : literalPlan(node.codePoint);
|
|
709
|
+
case "any":
|
|
710
|
+
return literalPlan(ANY_CODE_POINT);
|
|
711
|
+
case "class":
|
|
712
|
+
return testedPlan(classTest(node.name));
|
|
713
|
+
case "set":
|
|
714
|
+
return setPlan(node, caseFold, host);
|
|
715
|
+
case "assert":
|
|
716
|
+
return node;
|
|
717
|
+
case "sequence":
|
|
718
|
+
return sequenceOf(node.items.map((item) => lowerNode(item, caseFold, host, scratch)));
|
|
719
|
+
case "choice":
|
|
720
|
+
return choiceOf(node.branches.map((branch) => lowerNode(branch, caseFold, host, scratch)));
|
|
721
|
+
case "repeat":
|
|
722
|
+
return repeatOf(lowerNode(node.body, caseFold, host, scratch), node.min, node.max);
|
|
723
|
+
case "numberRange":
|
|
724
|
+
return lowerNode(node.expansion, caseFold, host, scratch);
|
|
725
|
+
}
|
|
726
|
+
}
|
|
727
|
+
function lowerPattern(node, caseFold, host) {
|
|
728
|
+
return lowerNode(node, caseFold, host, []);
|
|
729
|
+
}
|
|
730
|
+
|
|
731
|
+
// src/pattern/expression/number-range.ts
|
|
732
|
+
function digitAt(text, at) {
|
|
733
|
+
return text.charCodeAt(at) - 48;
|
|
734
|
+
}
|
|
735
|
+
function sameWidth(low, high) {
|
|
736
|
+
const width = low.length;
|
|
737
|
+
if (low === high) return low;
|
|
738
|
+
if (/^0+$/.test(low) && /^9+$/.test(high)) return width === 1 ? "[0-9]" : `[0-9]{${width}}`;
|
|
739
|
+
if (width === 1) return `[${low}-${high}]`;
|
|
740
|
+
if (low[0] === high[0]) return low[0] + sameWidth(low.slice(1), high.slice(1));
|
|
741
|
+
const parts = [low[0] + sameWidth(low.slice(1), "9".repeat(width - 1))];
|
|
742
|
+
const lowLead = digitAt(low, 0);
|
|
743
|
+
const highLead = digitAt(high, 0);
|
|
744
|
+
if (lowLead + 1 <= highLead - 1) parts.push(`[${lowLead + 1}-${highLead - 1}]${"[0-9]".repeat(width - 1)}`);
|
|
745
|
+
parts.push(high[0] + sameWidth("0".repeat(width - 1), high.slice(1)));
|
|
746
|
+
return `(${parts.join("|")})`;
|
|
747
|
+
}
|
|
748
|
+
function numberRange(low, high) {
|
|
749
|
+
if (low.length === high.length) return sameWidth(low, high);
|
|
750
|
+
const highest = Number(high);
|
|
751
|
+
const parts = [];
|
|
752
|
+
let start = Number(low);
|
|
753
|
+
const widest = String(highest).length;
|
|
754
|
+
for (let width = String(start).length; width <= widest; width++) {
|
|
755
|
+
const last = Math.min(highest, 10 ** width - 1);
|
|
756
|
+
parts.push(sameWidth(String(start), String(last)));
|
|
757
|
+
start = 10 ** width;
|
|
758
|
+
}
|
|
759
|
+
return `(${parts.join("|")})`;
|
|
760
|
+
}
|
|
761
|
+
function compareDigits(low, high) {
|
|
762
|
+
return Number(low) - Number(high);
|
|
763
|
+
}
|
|
764
|
+
|
|
765
|
+
// src/pattern/expression/reader.ts
|
|
766
|
+
var TRAILING_ESCAPE = 'ends in a "\\" with no code point after it';
|
|
767
|
+
function toCodePoints(text) {
|
|
768
|
+
const codePoints = [];
|
|
769
|
+
for (let at = 0; at < text.length; at++) {
|
|
770
|
+
const codePoint = text.codePointAt(at) ?? 0;
|
|
771
|
+
if (codePoint > 65535) at++;
|
|
772
|
+
codePoints.push(codePoint);
|
|
773
|
+
}
|
|
774
|
+
return codePoints;
|
|
775
|
+
}
|
|
776
|
+
function quoted(text) {
|
|
777
|
+
return `"${text}"`;
|
|
778
|
+
}
|
|
779
|
+
|
|
780
|
+
// src/pattern/expression/parse-regex.ts
|
|
781
|
+
var BACKSLASH = 92;
|
|
782
|
+
var DOT = 46;
|
|
783
|
+
var BAR = 124;
|
|
784
|
+
var STAR = 42;
|
|
785
|
+
var PLUS = 43;
|
|
786
|
+
var QUESTION = 63;
|
|
787
|
+
var OPEN_BRACE = 123;
|
|
788
|
+
var CLOSE_BRACE = 125;
|
|
789
|
+
var OPEN_PAREN = 40;
|
|
790
|
+
var CLOSE_PAREN = 41;
|
|
791
|
+
var OPEN_BRACKET = 91;
|
|
792
|
+
var CLOSE_BRACKET = 93;
|
|
793
|
+
var CARET = 94;
|
|
794
|
+
var DOLLAR = 36;
|
|
795
|
+
var LESS = 60;
|
|
796
|
+
var GREATER = 62;
|
|
797
|
+
var HYPHEN = 45;
|
|
798
|
+
var COMMA = 44;
|
|
799
|
+
var ZERO = 48;
|
|
800
|
+
var NINE = 57;
|
|
801
|
+
var RESERVED = /* @__PURE__ */ new Set([
|
|
802
|
+
BACKSLASH,
|
|
803
|
+
DOT,
|
|
804
|
+
BAR,
|
|
805
|
+
STAR,
|
|
806
|
+
PLUS,
|
|
807
|
+
QUESTION,
|
|
808
|
+
OPEN_BRACE,
|
|
809
|
+
CLOSE_BRACE,
|
|
810
|
+
OPEN_PAREN,
|
|
811
|
+
CLOSE_PAREN,
|
|
812
|
+
OPEN_BRACKET,
|
|
813
|
+
CLOSE_BRACKET,
|
|
814
|
+
CARET,
|
|
815
|
+
DOLLAR,
|
|
816
|
+
LESS,
|
|
817
|
+
GREATER
|
|
818
|
+
]);
|
|
819
|
+
var NO_COUNT = `holds a "{" that doesn't open a count such as {2}, {2,}, or {2,5}. Write "\\{" to match the brace itself`;
|
|
820
|
+
var RANGE_ENDS_IN_CLASS = "holds a set range whose high end is a class, while both ends of a set range must be code points";
|
|
821
|
+
var SET_NEVER_CLOSES = "opens a set that it never closes";
|
|
822
|
+
var NEGATED_EMPTY_SET = 'holds the set "[^]", which has no member, because a "^" after "[" always negates the set. Write "\\^" to match a caret, "." to match any code point, or "\\]" to match "]" inside a set';
|
|
823
|
+
var CLASS_ESCAPES = /* @__PURE__ */ new Map([
|
|
824
|
+
[100, "digit"],
|
|
825
|
+
[119, "word"],
|
|
826
|
+
[115, "space"]
|
|
827
|
+
]);
|
|
828
|
+
var WORD_EDGE_ESCAPE = 98;
|
|
829
|
+
function isAsciiPunctuation(codePoint) {
|
|
830
|
+
return codePoint >= 33 && codePoint <= 47 || codePoint >= 58 && codePoint <= 64 || codePoint >= 91 && codePoint <= 96 || codePoint >= 123 && codePoint <= 126;
|
|
831
|
+
}
|
|
832
|
+
function isDigit(codePoint) {
|
|
833
|
+
return codePoint !== void 0 && codePoint >= ZERO && codePoint <= NINE;
|
|
834
|
+
}
|
|
835
|
+
function unknownEscape(codePoint) {
|
|
836
|
+
const shown = quoted(`\\${String.fromCodePoint(codePoint)}`);
|
|
837
|
+
if (isDigit(codePoint)) return `holds the back-reference ${shown}, which the grammar leaves out`;
|
|
838
|
+
if (codePoint === 112 || codePoint === 80) {
|
|
839
|
+
return `holds the Unicode property class ${shown}, which the grammar leaves out`;
|
|
840
|
+
}
|
|
841
|
+
return `holds ${shown}. A "\\" can come only before an ASCII punctuation mark, "d", "w", "s", or "b"`;
|
|
842
|
+
}
|
|
843
|
+
function reservedHere(codePoint) {
|
|
844
|
+
const shown = String.fromCodePoint(codePoint);
|
|
845
|
+
if (codePoint === STAR || codePoint === PLUS || codePoint === QUESTION) {
|
|
846
|
+
return `holds the repeat ${quoted(shown)} with nothing before it to repeat`;
|
|
847
|
+
}
|
|
848
|
+
return `holds ${quoted(shown)}, which has a meaning of its own in the grammar. Write ${quoted(`\\${shown}`)} to match the code point itself`;
|
|
849
|
+
}
|
|
850
|
+
var RegexReader = class _RegexReader {
|
|
851
|
+
constructor(codePoints, fail) {
|
|
852
|
+
this.codePoints = codePoints;
|
|
853
|
+
this.fail = fail;
|
|
854
|
+
}
|
|
855
|
+
at = 0;
|
|
856
|
+
depth = 0;
|
|
857
|
+
parse() {
|
|
858
|
+
const pattern = this.parsePattern();
|
|
859
|
+
if (this.at < this.codePoints.length) this.fail("closes a group that it never opened", this.at);
|
|
860
|
+
return pattern;
|
|
861
|
+
}
|
|
862
|
+
peek(offset = 0) {
|
|
863
|
+
return this.codePoints[this.at + offset];
|
|
864
|
+
}
|
|
865
|
+
parsePattern() {
|
|
866
|
+
const branches = [this.parseBranch()];
|
|
867
|
+
while (this.peek() === BAR) {
|
|
868
|
+
this.at++;
|
|
869
|
+
branches.push(this.parseBranch());
|
|
870
|
+
}
|
|
871
|
+
return branches.length === 1 ? branches[0] : { kind: "choice", branches };
|
|
872
|
+
}
|
|
873
|
+
parseBranch() {
|
|
874
|
+
const items = [];
|
|
875
|
+
for (let next = this.peek(); next !== void 0 && next !== BAR && next !== CLOSE_PAREN; next = this.peek()) {
|
|
876
|
+
items.push(this.parsePiece());
|
|
877
|
+
}
|
|
878
|
+
return items.length === 1 ? items[0] : { kind: "sequence", items };
|
|
879
|
+
}
|
|
880
|
+
parsePiece() {
|
|
881
|
+
const atom = this.parseAtom();
|
|
882
|
+
const repeated = this.parseRepeat(atom);
|
|
883
|
+
const next = this.peek();
|
|
884
|
+
if (repeated !== atom && (next === STAR || next === PLUS || next === QUESTION || next === OPEN_BRACE)) {
|
|
885
|
+
this.fail(
|
|
886
|
+
`holds a second repeat ${quoted(String.fromCodePoint(next))} after one atom. The grammar allows one repeat for each atom, so it has no lazy or possessive repeats`,
|
|
887
|
+
this.at
|
|
888
|
+
);
|
|
889
|
+
}
|
|
890
|
+
return repeated;
|
|
891
|
+
}
|
|
892
|
+
parseAtom() {
|
|
893
|
+
const start = this.at;
|
|
894
|
+
const codePoint = this.codePoints[this.at++];
|
|
895
|
+
if (codePoint === BACKSLASH) return this.parseEscape(start);
|
|
896
|
+
if (codePoint === DOT) return { kind: "any" };
|
|
897
|
+
if (codePoint === CARET) return { kind: "assert", mask: START_MASK };
|
|
898
|
+
if (codePoint === DOLLAR) return { kind: "assert", mask: END_MASK };
|
|
899
|
+
if (codePoint === OPEN_BRACKET) return this.parseSet(start);
|
|
900
|
+
if (codePoint === OPEN_PAREN) return this.parseGroup(start);
|
|
901
|
+
if (codePoint === LESS) return this.parseNumberRange(start);
|
|
902
|
+
if (RESERVED.has(codePoint)) this.fail(reservedHere(codePoint), start);
|
|
903
|
+
return { kind: "literal", codePoint };
|
|
904
|
+
}
|
|
905
|
+
parseEscape(start) {
|
|
906
|
+
const escaped = this.codePoints[this.at++];
|
|
907
|
+
if (escaped === void 0) this.fail(TRAILING_ESCAPE, start);
|
|
908
|
+
const name = CLASS_ESCAPES.get(escaped);
|
|
909
|
+
if (name !== void 0) return { kind: "class", name };
|
|
910
|
+
if (escaped === WORD_EDGE_ESCAPE) return { kind: "assert", mask: WORD_EDGE_MASK };
|
|
911
|
+
if (isAsciiPunctuation(escaped)) return { kind: "literal", codePoint: escaped };
|
|
912
|
+
this.fail(unknownEscape(escaped), start);
|
|
913
|
+
}
|
|
914
|
+
parseGroup(start) {
|
|
915
|
+
if (this.peek() === QUESTION) {
|
|
916
|
+
this.fail(
|
|
917
|
+
'holds "(?", which opens a lookaround, an inline flag, or a non-capturing group. The grammar leaves out all three',
|
|
918
|
+
start
|
|
919
|
+
);
|
|
920
|
+
}
|
|
921
|
+
this.depth++;
|
|
922
|
+
if (this.depth > MAX_PATTERN_GROUP_DEPTH) {
|
|
923
|
+
this.fail(`nests its groups more than ${MAX_PATTERN_GROUP_DEPTH} deep`, start);
|
|
924
|
+
}
|
|
925
|
+
const body = this.parsePattern();
|
|
926
|
+
if (this.peek() !== CLOSE_PAREN) this.fail("opens a group that it never closes", start);
|
|
927
|
+
this.at++;
|
|
928
|
+
this.depth--;
|
|
929
|
+
return body;
|
|
930
|
+
}
|
|
931
|
+
parseRepeat(atom) {
|
|
932
|
+
const codePoint = this.peek();
|
|
933
|
+
if (codePoint === STAR || codePoint === PLUS || codePoint === QUESTION) {
|
|
934
|
+
this.at++;
|
|
935
|
+
const min2 = codePoint === PLUS ? 1 : 0;
|
|
936
|
+
return { kind: "repeat", body: atom, min: min2, max: codePoint === QUESTION ? 1 : null };
|
|
937
|
+
}
|
|
938
|
+
if (codePoint !== OPEN_BRACE) return atom;
|
|
939
|
+
const start = this.at++;
|
|
940
|
+
const min = this.readCount(start);
|
|
941
|
+
let max = min;
|
|
942
|
+
if (this.peek() === COMMA) {
|
|
943
|
+
this.at++;
|
|
944
|
+
max = isDigit(this.peek()) ? this.readCount(start) : null;
|
|
945
|
+
}
|
|
946
|
+
if (this.peek() !== CLOSE_BRACE) {
|
|
947
|
+
this.fail(NO_COUNT, start);
|
|
948
|
+
}
|
|
949
|
+
this.at++;
|
|
950
|
+
if (max !== null && min > max) {
|
|
951
|
+
this.fail(`holds the count {${min},${max}}, whose lower count is above its upper count`, start);
|
|
952
|
+
}
|
|
953
|
+
return { kind: "repeat", body: atom, min, max };
|
|
954
|
+
}
|
|
955
|
+
readCount(start) {
|
|
956
|
+
if (!isDigit(this.peek())) {
|
|
957
|
+
this.fail(NO_COUNT, start);
|
|
958
|
+
}
|
|
959
|
+
let count = 0;
|
|
960
|
+
for (let digit = this.peek(); digit !== void 0 && isDigit(digit); digit = this.peek()) {
|
|
961
|
+
count = Math.min(count * 10 + digit - ZERO, MAX_PATTERN_REPEAT_COUNT + 1);
|
|
962
|
+
this.at++;
|
|
963
|
+
}
|
|
964
|
+
if (count > MAX_PATTERN_REPEAT_COUNT) {
|
|
965
|
+
this.fail(`holds a count above the limit of ${MAX_PATTERN_REPEAT_COUNT}`, start);
|
|
966
|
+
}
|
|
967
|
+
return count;
|
|
968
|
+
}
|
|
969
|
+
parseSet(start) {
|
|
970
|
+
const negated = this.peek() === CARET;
|
|
971
|
+
if (negated) this.at++;
|
|
972
|
+
const items = [];
|
|
973
|
+
for (; ; ) {
|
|
974
|
+
const codePoint = this.peek();
|
|
975
|
+
if (codePoint === void 0) this.fail(SET_NEVER_CLOSES, start);
|
|
976
|
+
if (codePoint === CLOSE_BRACKET) break;
|
|
977
|
+
items.push(this.parseSetItem());
|
|
978
|
+
}
|
|
979
|
+
this.at++;
|
|
980
|
+
if (items.length === 0) this.fail(negated ? NEGATED_EMPTY_SET : "holds an empty set", start);
|
|
981
|
+
return { kind: "set", negated, items };
|
|
982
|
+
}
|
|
983
|
+
parseSetItem() {
|
|
984
|
+
const start = this.at;
|
|
985
|
+
const low = this.parseSetMember(true);
|
|
986
|
+
if (typeof low !== "number") return low;
|
|
987
|
+
if (this.peek() !== HYPHEN || this.peek(1) === CLOSE_BRACKET) return { kind: "member", codePoint: low };
|
|
988
|
+
this.at++;
|
|
989
|
+
const high = this.parseSetMember(false);
|
|
990
|
+
if (typeof high !== "number") this.fail(RANGE_ENDS_IN_CLASS, start);
|
|
991
|
+
if (low > high) {
|
|
992
|
+
this.fail(
|
|
993
|
+
`holds the set range ${quoted(`${String.fromCodePoint(low)}-${String.fromCodePoint(high)}`)}, whose low end is above its high end`,
|
|
994
|
+
start
|
|
995
|
+
);
|
|
996
|
+
}
|
|
997
|
+
return { kind: "range", low, high };
|
|
998
|
+
}
|
|
999
|
+
parseSetMember(classAllowed) {
|
|
1000
|
+
const start = this.at;
|
|
1001
|
+
const codePoint = this.codePoints[this.at++];
|
|
1002
|
+
if (codePoint === void 0) this.fail(SET_NEVER_CLOSES, start);
|
|
1003
|
+
if (codePoint === OPEN_BRACKET || codePoint === CLOSE_BRACKET || codePoint === HYPHEN) {
|
|
1004
|
+
const shown = String.fromCodePoint(codePoint);
|
|
1005
|
+
this.fail(
|
|
1006
|
+
`holds ${quoted(shown)} inside a set. Write ${quoted(`\\${shown}`)} to match that code point there`,
|
|
1007
|
+
start
|
|
1008
|
+
);
|
|
1009
|
+
}
|
|
1010
|
+
if (codePoint !== BACKSLASH) return codePoint;
|
|
1011
|
+
const escaped = this.codePoints[this.at++];
|
|
1012
|
+
if (escaped === void 0) this.fail(TRAILING_ESCAPE, start);
|
|
1013
|
+
const name = CLASS_ESCAPES.get(escaped);
|
|
1014
|
+
if (name !== void 0 && classAllowed) return { kind: "class", name };
|
|
1015
|
+
if (isAsciiPunctuation(escaped)) return escaped;
|
|
1016
|
+
if (name !== void 0) this.fail(RANGE_ENDS_IN_CLASS, start);
|
|
1017
|
+
this.fail(unknownEscape(escaped), start);
|
|
1018
|
+
}
|
|
1019
|
+
parseNumberRange(start) {
|
|
1020
|
+
const low = this.readDigits();
|
|
1021
|
+
const hyphen = this.codePoints[this.at++];
|
|
1022
|
+
const high = hyphen === HYPHEN ? this.readDigits() : "";
|
|
1023
|
+
const closing = this.codePoints[this.at++];
|
|
1024
|
+
if (low === "" || high === "" || closing !== GREATER) {
|
|
1025
|
+
this.fail(
|
|
1026
|
+
`holds a "<" that doesn't open a number range such as <1-65535>. Each end of a number range holds from 1 to ${MAX_NUMBER_RANGE_DIGITS} digits. Write "\\<" to match the "<" itself`,
|
|
1027
|
+
start
|
|
1028
|
+
);
|
|
1029
|
+
}
|
|
1030
|
+
if (compareDigits(low, high) > 0) {
|
|
1031
|
+
this.fail(`holds the number range ${quoted(`<${low}-${high}>`)}, whose low end is above its high end`, start);
|
|
1032
|
+
}
|
|
1033
|
+
const expansion = new _RegexReader(toCodePoints(numberRange(low, high)), this.fail).parse();
|
|
1034
|
+
return { kind: "numberRange", expansion };
|
|
1035
|
+
}
|
|
1036
|
+
readDigits() {
|
|
1037
|
+
let digits = "";
|
|
1038
|
+
for (let digit = this.peek(); isDigit(digit) && digit !== void 0; digit = this.peek()) {
|
|
1039
|
+
if (digits.length === MAX_NUMBER_RANGE_DIGITS) return "";
|
|
1040
|
+
digits += String.fromCodePoint(digit);
|
|
1041
|
+
this.at++;
|
|
1042
|
+
}
|
|
1043
|
+
return digits;
|
|
1044
|
+
}
|
|
1045
|
+
};
|
|
1046
|
+
function parseRegex(codePoints, fail) {
|
|
1047
|
+
return new RegexReader(codePoints, fail).parse();
|
|
1048
|
+
}
|
|
1049
|
+
|
|
1050
|
+
// src/pattern/expression/parse-wildcard.ts
|
|
1051
|
+
var BACKSLASH2 = 92;
|
|
1052
|
+
var STAR2 = 42;
|
|
1053
|
+
var QUESTION2 = 63;
|
|
1054
|
+
function parseWildcard(codePoints, fail) {
|
|
1055
|
+
const items = [{ kind: "assert", mask: START_MASK }];
|
|
1056
|
+
for (let at = 0; at < codePoints.length; at++) {
|
|
1057
|
+
const codePoint = codePoints[at];
|
|
1058
|
+
if (codePoint === STAR2) {
|
|
1059
|
+
items.push({ kind: "repeat", body: { kind: "any" }, min: 0, max: null });
|
|
1060
|
+
} else if (codePoint === QUESTION2) {
|
|
1061
|
+
items.push({ kind: "any" });
|
|
1062
|
+
} else if (codePoint === BACKSLASH2) {
|
|
1063
|
+
if (at + 1 === codePoints.length) fail(TRAILING_ESCAPE, at);
|
|
1064
|
+
items.push({ kind: "literal", codePoint: codePoints[++at] });
|
|
1065
|
+
} else {
|
|
1066
|
+
items.push({ kind: "literal", codePoint });
|
|
1067
|
+
}
|
|
1068
|
+
}
|
|
1069
|
+
items.push({ kind: "assert", mask: END_MASK });
|
|
1070
|
+
return { kind: "sequence", items };
|
|
1071
|
+
}
|
|
1072
|
+
|
|
1073
|
+
// src/pattern/expression/positions.ts
|
|
1074
|
+
var SATURATED = MAX_PATTERN_POSITIONS + 1;
|
|
1075
|
+
function saturating(total) {
|
|
1076
|
+
return Math.min(total, SATURATED);
|
|
1077
|
+
}
|
|
1078
|
+
function literalPositions(codePoint, caseFold, host, scratch) {
|
|
1079
|
+
if (!caseFold) return 1;
|
|
1080
|
+
scratch.length = 0;
|
|
1081
|
+
host.appendFoldedCodePoint(codePoint, scratch);
|
|
1082
|
+
return scratch.length;
|
|
1083
|
+
}
|
|
1084
|
+
function positionsOf(node, caseFold, host, scratch) {
|
|
1085
|
+
switch (node.kind) {
|
|
1086
|
+
case "literal":
|
|
1087
|
+
return literalPositions(node.codePoint, caseFold, host, scratch);
|
|
1088
|
+
case "any":
|
|
1089
|
+
case "class":
|
|
1090
|
+
return 1;
|
|
1091
|
+
case "set": {
|
|
1092
|
+
if (!caseFold || node.negated) return 1;
|
|
1093
|
+
let total = 1;
|
|
1094
|
+
for (const fold of distinctMultiFolds(node.items, host)) total = saturating(total + fold.length);
|
|
1095
|
+
return total;
|
|
1096
|
+
}
|
|
1097
|
+
case "assert":
|
|
1098
|
+
return 0;
|
|
1099
|
+
case "sequence":
|
|
1100
|
+
case "choice": {
|
|
1101
|
+
let total = 0;
|
|
1102
|
+
const children = node.kind === "sequence" ? node.items : node.branches;
|
|
1103
|
+
for (const child of children) {
|
|
1104
|
+
total = saturating(total + positionsOf(child, caseFold, host, scratch));
|
|
1105
|
+
if (total === SATURATED) return total;
|
|
1106
|
+
}
|
|
1107
|
+
return total;
|
|
1108
|
+
}
|
|
1109
|
+
case "repeat": {
|
|
1110
|
+
const copies = node.max === null ? Math.max(node.min, 1) : node.max;
|
|
1111
|
+
return saturating(copies * positionsOf(node.body, caseFold, host, scratch));
|
|
1112
|
+
}
|
|
1113
|
+
case "numberRange":
|
|
1114
|
+
return positionsOf(node.expansion, caseFold, host, scratch);
|
|
1115
|
+
}
|
|
1116
|
+
}
|
|
1117
|
+
function patternPositions(node, caseFold, host) {
|
|
1118
|
+
return positionsOf(node, caseFold, host, []);
|
|
1119
|
+
}
|
|
1120
|
+
|
|
1121
|
+
// src/pattern/text.ts
|
|
1122
|
+
var BASIC_PLANE_LAST = 65535;
|
|
1123
|
+
function appendTextCodePoints(text, caseFold, host, out) {
|
|
1124
|
+
for (let at = 0; at < text.length; at++) {
|
|
1125
|
+
const codePoint = text.codePointAt(at) ?? 0;
|
|
1126
|
+
if (codePoint > BASIC_PLANE_LAST) at++;
|
|
1127
|
+
if (caseFold) host.appendFoldedCodePoint(codePoint, out);
|
|
1128
|
+
else out.push(codePoint);
|
|
1129
|
+
}
|
|
1130
|
+
}
|
|
1131
|
+
function foldedCodePointCount(text, host) {
|
|
1132
|
+
const folded = [];
|
|
1133
|
+
appendTextCodePoints(text, true, host, folded);
|
|
1134
|
+
return folded.length;
|
|
1135
|
+
}
|
|
1136
|
+
function runKey(first, second, third) {
|
|
1137
|
+
return String.fromCodePoint(first, second, third);
|
|
1138
|
+
}
|
|
1139
|
+
function runKeyCodePoints(key, out, offset) {
|
|
1140
|
+
let slot = offset;
|
|
1141
|
+
for (let at = 0; at < key.length && slot < offset + PATTERN_RUN_CODE_POINTS; at++) {
|
|
1142
|
+
const codePoint = key.codePointAt(at) ?? 0;
|
|
1143
|
+
out[slot++] = codePoint;
|
|
1144
|
+
if (codePoint > BASIC_PLANE_LAST) at++;
|
|
1145
|
+
}
|
|
1146
|
+
}
|
|
1147
|
+
function compareRuns(left, leftAt, right, rightAt) {
|
|
1148
|
+
for (let offset = 0; offset < PATTERN_RUN_CODE_POINTS; offset++) {
|
|
1149
|
+
const difference = left[leftAt + offset] - right[rightAt + offset];
|
|
1150
|
+
if (difference !== 0) return difference;
|
|
1151
|
+
}
|
|
1152
|
+
return 0;
|
|
1153
|
+
}
|
|
1154
|
+
function collectRunKeys(foldedCodePoints, out) {
|
|
1155
|
+
for (let at = 0; at + PATTERN_RUN_CODE_POINTS <= foldedCodePoints.length; at++) {
|
|
1156
|
+
out.add(runKey(foldedCodePoints[at], foldedCodePoints[at + 1], foldedCodePoints[at + 2]));
|
|
1157
|
+
}
|
|
1158
|
+
}
|
|
1159
|
+
function forEachTextValue(value, visit) {
|
|
1160
|
+
if (typeof value === "string") {
|
|
1161
|
+
visit(value);
|
|
1162
|
+
return;
|
|
1163
|
+
}
|
|
1164
|
+
if (!Array.isArray(value)) return;
|
|
1165
|
+
for (const element of value) {
|
|
1166
|
+
if (typeof element === "string") visit(element);
|
|
1167
|
+
}
|
|
1168
|
+
}
|
|
1169
|
+
function holdsTextValue(value) {
|
|
1170
|
+
return typeof value === "string" || Array.isArray(value);
|
|
1171
|
+
}
|
|
1172
|
+
|
|
1173
|
+
// src/pattern/expression/required-runs.ts
|
|
1174
|
+
var NO_RUNS = new Uint32Array(0);
|
|
1175
|
+
var FactorCollector = class {
|
|
1176
|
+
constructor(host) {
|
|
1177
|
+
this.host = host;
|
|
1178
|
+
}
|
|
1179
|
+
factors = [];
|
|
1180
|
+
current = [];
|
|
1181
|
+
flush() {
|
|
1182
|
+
if (this.current.length >= PATTERN_RUN_CODE_POINTS) this.factors.push(this.current);
|
|
1183
|
+
this.current = [];
|
|
1184
|
+
}
|
|
1185
|
+
visit(node) {
|
|
1186
|
+
switch (node.kind) {
|
|
1187
|
+
case "literal":
|
|
1188
|
+
this.host.appendFoldedCodePoint(node.codePoint, this.current);
|
|
1189
|
+
return;
|
|
1190
|
+
case "assert":
|
|
1191
|
+
return;
|
|
1192
|
+
case "sequence":
|
|
1193
|
+
for (const item of node.items) this.visit(item);
|
|
1194
|
+
return;
|
|
1195
|
+
case "repeat":
|
|
1196
|
+
if (node.min === 1 && node.max === 1) {
|
|
1197
|
+
this.visit(node.body);
|
|
1198
|
+
return;
|
|
1199
|
+
}
|
|
1200
|
+
this.flush();
|
|
1201
|
+
if (node.min >= 1) {
|
|
1202
|
+
this.visit(node.body);
|
|
1203
|
+
this.flush();
|
|
1204
|
+
}
|
|
1205
|
+
return;
|
|
1206
|
+
default:
|
|
1207
|
+
this.flush();
|
|
1208
|
+
}
|
|
1209
|
+
}
|
|
1210
|
+
};
|
|
1211
|
+
function spreadRuns(factors) {
|
|
1212
|
+
let total = 0;
|
|
1213
|
+
for (const factor of factors) total += Math.max(0, factor.length - PATTERN_RUN_CODE_POINTS + 1);
|
|
1214
|
+
if (total === 0) return NO_RUNS;
|
|
1215
|
+
const picks = Math.min(total, SHORTLIST_RUN_LOOKUPS);
|
|
1216
|
+
const seen = /* @__PURE__ */ new Set();
|
|
1217
|
+
const runs = [];
|
|
1218
|
+
let factorAt = 0;
|
|
1219
|
+
let factorStart = 0;
|
|
1220
|
+
for (let pick = 0; pick < picks; pick++) {
|
|
1221
|
+
const target = picks === 1 ? 0 : Math.round(pick * (total - 1) / (picks - 1));
|
|
1222
|
+
let factorRuns = Math.max(0, factors[factorAt].length - PATTERN_RUN_CODE_POINTS + 1);
|
|
1223
|
+
while (target >= factorStart + factorRuns) {
|
|
1224
|
+
factorStart += factorRuns;
|
|
1225
|
+
factorAt++;
|
|
1226
|
+
factorRuns = Math.max(0, factors[factorAt].length - PATTERN_RUN_CODE_POINTS + 1);
|
|
1227
|
+
}
|
|
1228
|
+
const factor = factors[factorAt];
|
|
1229
|
+
const at = target - factorStart;
|
|
1230
|
+
const key = runKey(factor[at], factor[at + 1], factor[at + 2]);
|
|
1231
|
+
if (seen.has(key)) continue;
|
|
1232
|
+
seen.add(key);
|
|
1233
|
+
runs.push(factor[at], factor[at + 1], factor[at + 2]);
|
|
1234
|
+
}
|
|
1235
|
+
return Uint32Array.from(runs);
|
|
1236
|
+
}
|
|
1237
|
+
function branchRuns(node, host) {
|
|
1238
|
+
const collector = new FactorCollector(host);
|
|
1239
|
+
collector.visit(node);
|
|
1240
|
+
collector.flush();
|
|
1241
|
+
return spreadRuns(collector.factors);
|
|
1242
|
+
}
|
|
1243
|
+
function requiredRuns(node, host) {
|
|
1244
|
+
if (node.kind !== "choice") return { kind: "all", runs: branchRuns(node, host) };
|
|
1245
|
+
const branches = node.branches.map((branch) => branchRuns(branch, host));
|
|
1246
|
+
if (branches.some((runs) => runs.length === 0)) return { kind: "all", runs: NO_RUNS };
|
|
1247
|
+
return { kind: "any", branches };
|
|
1248
|
+
}
|
|
1249
|
+
|
|
1250
|
+
// src/pattern/expression/index.ts
|
|
1251
|
+
function describe(label) {
|
|
1252
|
+
return label.fieldPath === null ? `the "${label.operator}" pattern` : `the "${label.operator}" pattern on pattern field "${label.fieldPath}"`;
|
|
1253
|
+
}
|
|
1254
|
+
function failureFor(label) {
|
|
1255
|
+
return (reason, at) => {
|
|
1256
|
+
throw new NarsilError(
|
|
1257
|
+
ErrorCodes.SEARCH_INVALID_FILTER,
|
|
1258
|
+
`The engine refuses ${describe(label)} at code point ${at + 1}. The pattern ${reason}`,
|
|
1259
|
+
{ fieldPath: label.fieldPath, operator: label.operator, codePoint: at + 1 }
|
|
1260
|
+
);
|
|
1261
|
+
};
|
|
1262
|
+
}
|
|
1263
|
+
function parsedWithinLimits(label, text, caseFold, host) {
|
|
1264
|
+
const codePoints = toCodePoints(text);
|
|
1265
|
+
const fail = failureFor(label);
|
|
1266
|
+
const node = label.operator === "regex" ? parseRegex(codePoints, fail) : parseWildcard(codePoints, fail);
|
|
1267
|
+
const positions = patternPositions(node, caseFold, host);
|
|
1268
|
+
if (positions > MAX_PATTERN_POSITIONS) {
|
|
1269
|
+
throw new NarsilError(
|
|
1270
|
+
ErrorCodes.SEARCH_INVALID_FILTER,
|
|
1271
|
+
`The engine refuses ${describe(label)} before it builds a matcher, because the pattern holds more than ${MAX_PATTERN_POSITIONS} positions${caseFold ? " once the engine folds its case" : ""}. A literal code point, a class, and a set each count as one position. A count such as {5} multiplies the positions of what it repeats. A number range counts the positions of the pattern that it stands for`,
|
|
1272
|
+
{ fieldPath: label.fieldPath, operator: label.operator, limit: MAX_PATTERN_POSITIONS }
|
|
1273
|
+
);
|
|
1274
|
+
}
|
|
1275
|
+
return node;
|
|
1276
|
+
}
|
|
1277
|
+
function checkExpression(operator, text, caseFold, fieldPath, host) {
|
|
1278
|
+
parsedWithinLimits({ operator, fieldPath }, text, caseFold, host);
|
|
1279
|
+
}
|
|
1280
|
+
function prepareExpression(operator, text, caseFold, host) {
|
|
1281
|
+
const node = parsedWithinLimits({ operator, fieldPath: null }, text, caseFold, host);
|
|
1282
|
+
return { plan: lowerPattern(node, caseFold, host), runs: requiredRuns(node, host) };
|
|
1283
|
+
}
|
|
1284
|
+
function buildProgram(prepared) {
|
|
1285
|
+
return compileProgram(prepared.plan);
|
|
1286
|
+
}
|
|
1287
|
+
function footprintOf(bytes, states, positions) {
|
|
1288
|
+
return bytes + simulationBytes({ states, positions }) + MATCHER_STATE_OVERHEAD_BYTES + positions * Uint32Array.BYTES_PER_ELEMENT;
|
|
1289
|
+
}
|
|
1290
|
+
function expressionFootprint(operator, text, caseFold, host) {
|
|
1291
|
+
const { bytes, states, positions } = planSize(prepareExpression(operator, text, caseFold, host).plan);
|
|
1292
|
+
return footprintOf(bytes, states, positions);
|
|
1293
|
+
}
|
|
1294
|
+
|
|
1295
|
+
// src/pattern/lazy-dfa.ts
|
|
1296
|
+
var UNCACHED_GENERATION = -1;
|
|
1297
|
+
var DECIDED_GENERATION = -2;
|
|
1298
|
+
function decidedState() {
|
|
1299
|
+
return {
|
|
1300
|
+
positions: new Uint32Array(0),
|
|
1301
|
+
previousKind: BEFORE_VALUE_START,
|
|
1302
|
+
generation: DECIDED_GENERATION,
|
|
1303
|
+
denseEdges: null,
|
|
1304
|
+
sparseEdges: null,
|
|
1305
|
+
endMatch: null
|
|
1306
|
+
};
|
|
1307
|
+
}
|
|
1308
|
+
function clearEdges(state) {
|
|
1309
|
+
state.denseEdges = null;
|
|
1310
|
+
state.sparseEdges = null;
|
|
1311
|
+
}
|
|
1312
|
+
var MATCHED = decidedState();
|
|
1313
|
+
var DEAD = decidedState();
|
|
1314
|
+
function stateKey(positions, previousKind) {
|
|
1315
|
+
return `${previousKind}:${positions.join(",")}`;
|
|
1316
|
+
}
|
|
1317
|
+
function stateBytes(positions, key) {
|
|
1318
|
+
return MATCHER_STATE_OVERHEAD_BYTES + positions.byteLength + key.length * MATCHER_KEY_CHARACTER_BYTES;
|
|
1319
|
+
}
|
|
1320
|
+
var LazyDfa = class {
|
|
1321
|
+
constructor(program, stateLimitBytes) {
|
|
1322
|
+
this.program = program;
|
|
1323
|
+
this.directClasses = program.classes.direct;
|
|
1324
|
+
const classCount = program.classes.starts.length + 1;
|
|
1325
|
+
this.denseClasses = classCount <= MAX_DENSE_EDGE_CLASSES ? classCount : 0;
|
|
1326
|
+
this.simulation = new PositionSimulation(program);
|
|
1327
|
+
this.cacheLimitBytes = stateLimitBytes - program.bytes - this.simulation.bytes;
|
|
1328
|
+
this.start = this.intern(new Uint32Array(0), BEFORE_VALUE_START);
|
|
1329
|
+
this.state = this.start;
|
|
1330
|
+
if (this.wantsSimulation()) this.simulate(this.start);
|
|
1331
|
+
}
|
|
1332
|
+
states = /* @__PURE__ */ new Map();
|
|
1333
|
+
generation = 0;
|
|
1334
|
+
cachedBytes = 0;
|
|
1335
|
+
codePointsSinceReset = 0;
|
|
1336
|
+
start;
|
|
1337
|
+
state;
|
|
1338
|
+
simulating = false;
|
|
1339
|
+
decided = null;
|
|
1340
|
+
simulation;
|
|
1341
|
+
cacheLimitBytes;
|
|
1342
|
+
directClasses;
|
|
1343
|
+
denseClasses;
|
|
1344
|
+
get heldBytes() {
|
|
1345
|
+
return this.program.bytes + this.simulation.bytes + this.cachedBytes;
|
|
1346
|
+
}
|
|
1347
|
+
begin() {
|
|
1348
|
+
this.decided = null;
|
|
1349
|
+
this.simulating = false;
|
|
1350
|
+
this.state = this.start;
|
|
1351
|
+
if (this.wantsSimulation()) this.simulate(this.start);
|
|
1352
|
+
return true;
|
|
1353
|
+
}
|
|
1354
|
+
feed(codePoint, tally) {
|
|
1355
|
+
if (this.simulating) {
|
|
1356
|
+
const outcome = this.simulation.step(codePoint);
|
|
1357
|
+
tally.add(this.simulation.steps);
|
|
1358
|
+
if (outcome === STEP_MATCHED) return this.decide(true);
|
|
1359
|
+
if (outcome === STEP_DEAD) return this.decide(false);
|
|
1360
|
+
return true;
|
|
1361
|
+
}
|
|
1362
|
+
this.codePointsSinceReset++;
|
|
1363
|
+
const direct = this.directClasses;
|
|
1364
|
+
const codePointClass = codePoint < direct.length ? direct[codePoint] : classOf(this.program, codePoint);
|
|
1365
|
+
const edge = this.edge(this.state, codePoint, codePointClass);
|
|
1366
|
+
tally.add(edge.steps);
|
|
1367
|
+
if (edge.target === MATCHED) return this.decide(true);
|
|
1368
|
+
if (edge.target === DEAD) return this.decide(false);
|
|
1369
|
+
this.state = edge.target;
|
|
1370
|
+
if (this.wantsSimulation()) this.simulate(this.state);
|
|
1371
|
+
return true;
|
|
1372
|
+
}
|
|
1373
|
+
matched() {
|
|
1374
|
+
if (this.decided !== null) return this.decided;
|
|
1375
|
+
if (this.simulating) return this.simulation.endMatches();
|
|
1376
|
+
const { state } = this;
|
|
1377
|
+
if (state.endMatch === null) {
|
|
1378
|
+
this.simulation.load(state.positions, state.previousKind);
|
|
1379
|
+
state.endMatch = this.simulation.endMatches();
|
|
1380
|
+
}
|
|
1381
|
+
return state.endMatch;
|
|
1382
|
+
}
|
|
1383
|
+
decide(outcome) {
|
|
1384
|
+
this.decided = outcome;
|
|
1385
|
+
return false;
|
|
1386
|
+
}
|
|
1387
|
+
wantsSimulation() {
|
|
1388
|
+
return !this.simulating && this.state.generation === UNCACHED_GENERATION;
|
|
1389
|
+
}
|
|
1390
|
+
simulate(from) {
|
|
1391
|
+
this.restartCache();
|
|
1392
|
+
this.state = this.start;
|
|
1393
|
+
this.simulation.load(from.positions, from.previousKind);
|
|
1394
|
+
this.simulating = true;
|
|
1395
|
+
}
|
|
1396
|
+
restartCache() {
|
|
1397
|
+
this.dropCache();
|
|
1398
|
+
this.codePointsSinceReset = 0;
|
|
1399
|
+
this.generation++;
|
|
1400
|
+
this.start = this.intern(this.start.positions, this.start.previousKind);
|
|
1401
|
+
}
|
|
1402
|
+
dropCache() {
|
|
1403
|
+
for (const state of this.states.values()) clearEdges(state);
|
|
1404
|
+
clearEdges(this.start);
|
|
1405
|
+
clearEdges(this.state);
|
|
1406
|
+
this.states = /* @__PURE__ */ new Map();
|
|
1407
|
+
this.cachedBytes = 0;
|
|
1408
|
+
}
|
|
1409
|
+
edge(state, codePoint, codePointClass) {
|
|
1410
|
+
const current2 = state.generation === this.generation;
|
|
1411
|
+
const dense = codePointClass >= 0 && codePointClass < this.denseClasses;
|
|
1412
|
+
if (current2) {
|
|
1413
|
+
const cached = dense ? state.denseEdges?.[codePointClass] : state.sparseEdges?.get(codePointClass);
|
|
1414
|
+
if (cached !== void 0) return cached;
|
|
1415
|
+
}
|
|
1416
|
+
const { simulation } = this;
|
|
1417
|
+
simulation.load(state.positions, state.previousKind);
|
|
1418
|
+
const outcome = simulation.step(codePoint);
|
|
1419
|
+
const steps = simulation.steps;
|
|
1420
|
+
let target = MATCHED;
|
|
1421
|
+
if (outcome === STEP_DEAD) target = DEAD;
|
|
1422
|
+
else if (outcome !== STEP_MATCHED) target = this.intern(simulation.sortedAfter(), simulation.previousKind);
|
|
1423
|
+
const edge = { target, steps };
|
|
1424
|
+
const targetCached = target.generation === DECIDED_GENERATION || target.generation === this.generation;
|
|
1425
|
+
if (!current2 || state.generation !== this.generation || !targetCached) return edge;
|
|
1426
|
+
if (!this.reserve(MATCHER_TRANSITION_BYTES) || state.generation !== this.generation) return edge;
|
|
1427
|
+
if (!dense) {
|
|
1428
|
+
state.sparseEdges ??= /* @__PURE__ */ new Map();
|
|
1429
|
+
state.sparseEdges.set(codePointClass, edge);
|
|
1430
|
+
return edge;
|
|
1431
|
+
}
|
|
1432
|
+
if (state.denseEdges === null) {
|
|
1433
|
+
const slotBytes = this.denseClasses * MATCHER_EDGE_SLOT_BYTES;
|
|
1434
|
+
if (!this.reserve(slotBytes) || state.generation !== this.generation) return edge;
|
|
1435
|
+
state.denseEdges = new Array(this.denseClasses).fill(void 0);
|
|
1436
|
+
}
|
|
1437
|
+
state.denseEdges[codePointClass] = edge;
|
|
1438
|
+
return edge;
|
|
1439
|
+
}
|
|
1440
|
+
intern(positions, previousKind) {
|
|
1441
|
+
const key = stateKey(positions, previousKind);
|
|
1442
|
+
const existing = this.states.get(key);
|
|
1443
|
+
if (existing !== void 0) return existing;
|
|
1444
|
+
const fresh = (generation) => ({
|
|
1445
|
+
positions,
|
|
1446
|
+
previousKind,
|
|
1447
|
+
generation,
|
|
1448
|
+
denseEdges: null,
|
|
1449
|
+
sparseEdges: null,
|
|
1450
|
+
endMatch: null
|
|
1451
|
+
});
|
|
1452
|
+
if (!this.reserve(stateBytes(positions, key))) return fresh(UNCACHED_GENERATION);
|
|
1453
|
+
const state = fresh(this.generation);
|
|
1454
|
+
this.states.set(key, state);
|
|
1455
|
+
return state;
|
|
1456
|
+
}
|
|
1457
|
+
reserve(bytes) {
|
|
1458
|
+
if (this.cachedBytes + bytes <= this.cacheLimitBytes) {
|
|
1459
|
+
this.cachedBytes += bytes;
|
|
1460
|
+
return true;
|
|
1461
|
+
}
|
|
1462
|
+
if (this.states.size === 0 || this.codePointsSinceReset < MATCHER_MIN_CODE_POINTS_PER_STATE * this.states.size) {
|
|
1463
|
+
return false;
|
|
1464
|
+
}
|
|
1465
|
+
this.restartCache();
|
|
1466
|
+
if (this.start.generation === UNCACHED_GENERATION) return false;
|
|
1467
|
+
return this.reserve(bytes);
|
|
1468
|
+
}
|
|
1469
|
+
};
|
|
1470
|
+
|
|
1471
|
+
// src/pattern/expression-cache.ts
|
|
1472
|
+
var SearchExpressions = class {
|
|
1473
|
+
constructor(budgetBytes) {
|
|
1474
|
+
this.budgetBytes = budgetBytes;
|
|
1475
|
+
}
|
|
1476
|
+
entries = /* @__PURE__ */ new Map();
|
|
1477
|
+
keptProgramBytes = 0;
|
|
1478
|
+
current = null;
|
|
1479
|
+
expression(operator, text, caseFold, host) {
|
|
1480
|
+
const key = `${operator}\0${caseFold ? 1 : 0}\0${text}`;
|
|
1481
|
+
let entry = this.entries.get(key);
|
|
1482
|
+
if (entry === void 0) {
|
|
1483
|
+
entry = { key, prepared: prepareExpression(operator, text, caseFold, host), program: null };
|
|
1484
|
+
this.entries.set(key, entry);
|
|
1485
|
+
}
|
|
1486
|
+
return entry;
|
|
1487
|
+
}
|
|
1488
|
+
matcher(entry) {
|
|
1489
|
+
if (this.current?.key === entry.key) return this.current.dfa;
|
|
1490
|
+
this.current = null;
|
|
1491
|
+
const program = entry.program ?? this.programOf(entry);
|
|
1492
|
+
const othersBytes = this.keptProgramBytes - (entry.program === null ? 0 : program.bytes);
|
|
1493
|
+
const dfa = new LazyDfa(program, this.budgetBytes - othersBytes);
|
|
1494
|
+
this.current = { key: entry.key, dfa };
|
|
1495
|
+
return dfa;
|
|
1496
|
+
}
|
|
1497
|
+
programOf(entry) {
|
|
1498
|
+
const program = buildProgram(entry.prepared);
|
|
1499
|
+
if (this.keptProgramBytes + program.bytes <= this.budgetBytes * KEPT_PROGRAM_BUDGET_FRACTION) {
|
|
1500
|
+
entry.program = program;
|
|
1501
|
+
this.keptProgramBytes += program.bytes;
|
|
1502
|
+
}
|
|
1503
|
+
return program;
|
|
1504
|
+
}
|
|
1505
|
+
};
|
|
1506
|
+
var expressionsBySearch = /* @__PURE__ */ new WeakMap();
|
|
1507
|
+
function searchExpressions(meter) {
|
|
1508
|
+
let expressions = expressionsBySearch.get(meter);
|
|
1509
|
+
if (expressions === void 0) {
|
|
1510
|
+
expressions = new SearchExpressions(meter.matcherStateBytes);
|
|
1511
|
+
expressionsBySearch.set(meter, expressions);
|
|
1512
|
+
}
|
|
1513
|
+
return expressions;
|
|
1514
|
+
}
|
|
1515
|
+
|
|
1516
|
+
// src/core/partition/growable-uint32.ts
|
|
1517
|
+
var GrowableUint32 = class {
|
|
1518
|
+
values;
|
|
1519
|
+
length = 0;
|
|
1520
|
+
constructor(capacity2) {
|
|
1521
|
+
this.values = new Uint32Array(capacity2);
|
|
1522
|
+
}
|
|
1523
|
+
growTo(needed, kept) {
|
|
1524
|
+
let capacity2 = this.values.length * 2;
|
|
1525
|
+
while (capacity2 < needed) capacity2 *= 2;
|
|
1526
|
+
const next = new Uint32Array(capacity2);
|
|
1527
|
+
next.set(this.values.subarray(0, kept));
|
|
1528
|
+
this.values = next;
|
|
1529
|
+
}
|
|
1530
|
+
reserve(extra) {
|
|
1531
|
+
const needed = this.length + extra;
|
|
1532
|
+
if (needed > this.values.length) this.growTo(needed, this.length);
|
|
1533
|
+
}
|
|
1534
|
+
push(value) {
|
|
1535
|
+
if (this.length === this.values.length) this.growTo(this.length + 1, this.length);
|
|
1536
|
+
this.values[this.length++] = value;
|
|
1537
|
+
}
|
|
1538
|
+
ensureIndex(index) {
|
|
1539
|
+
if (index >= this.values.length) this.growTo(index + 1, this.values.length);
|
|
1540
|
+
}
|
|
1541
|
+
clear() {
|
|
1542
|
+
this.length = 0;
|
|
1543
|
+
}
|
|
1544
|
+
};
|
|
1545
|
+
|
|
1546
|
+
// src/pattern/runs-arrays.ts
|
|
1547
|
+
var EMPTY_POSTINGS = new Uint32Array(0);
|
|
1548
|
+
function remapAscending(source, remap, out) {
|
|
1549
|
+
const start = out.length;
|
|
1550
|
+
let ordered = true;
|
|
1551
|
+
for (const ordinal of source) {
|
|
1552
|
+
const mapped = remap === null ? ordinal : ordinal < remap.length ? remap[ordinal] : -1;
|
|
1553
|
+
if (mapped < 0) continue;
|
|
1554
|
+
if (out.length > start && out.values[out.length - 1] > mapped) ordered = false;
|
|
1555
|
+
out.push(mapped);
|
|
1556
|
+
}
|
|
1557
|
+
if (!ordered) out.values.subarray(start, out.length).sort();
|
|
1558
|
+
}
|
|
1559
|
+
function sortedRunOrder(codePoints, count) {
|
|
1560
|
+
const order = new Array(count);
|
|
1561
|
+
for (let run = 0; run < count; run++) order[run] = run;
|
|
1562
|
+
order.sort(
|
|
1563
|
+
(left, right) => compareRuns(codePoints, left * PATTERN_RUN_CODE_POINTS, codePoints, right * PATTERN_RUN_CODE_POINTS)
|
|
1564
|
+
);
|
|
1565
|
+
return order;
|
|
1566
|
+
}
|
|
1567
|
+
function buildArrays(fieldPath, documents, source, order, remap) {
|
|
1568
|
+
const docIds = new GrowableUint32(Math.max(1, documents.length));
|
|
1569
|
+
remapAscending(documents, remap, docIds);
|
|
1570
|
+
const runs = new GrowableUint32(Math.max(1, source.count * PATTERN_RUN_CODE_POINTS));
|
|
1571
|
+
const offsets = new GrowableUint32(source.count + 1);
|
|
1572
|
+
const postings = new GrowableUint32(Math.max(1, source.count));
|
|
1573
|
+
offsets.push(0);
|
|
1574
|
+
for (let position = 0; position < source.count; position++) {
|
|
1575
|
+
const run = order === null ? position : order[position];
|
|
1576
|
+
const before = postings.length;
|
|
1577
|
+
remapAscending(source.postingsAt(run), remap, postings);
|
|
1578
|
+
if (postings.length === before) continue;
|
|
1579
|
+
const at = run * PATTERN_RUN_CODE_POINTS;
|
|
1580
|
+
runs.push(source.codePoints[at]);
|
|
1581
|
+
runs.push(source.codePoints[at + 1]);
|
|
1582
|
+
runs.push(source.codePoints[at + 2]);
|
|
1583
|
+
offsets.push(postings.length);
|
|
1584
|
+
}
|
|
1585
|
+
return trimmedArrays(fieldPath, docIds, runs, offsets, postings);
|
|
1586
|
+
}
|
|
1587
|
+
function trimmedArrays(fieldPath, docIds, runs, offsets, postings) {
|
|
1588
|
+
return {
|
|
1589
|
+
fieldPath,
|
|
1590
|
+
docIds: docIds.values.slice(0, docIds.length),
|
|
1591
|
+
runs: runs.values.slice(0, runs.length),
|
|
1592
|
+
offsets: offsets.values.slice(0, offsets.length),
|
|
1593
|
+
postings: postings.values.slice(0, postings.length)
|
|
1594
|
+
};
|
|
1595
|
+
}
|
|
1596
|
+
function findRun(runs, first, second, third) {
|
|
1597
|
+
let low = 0;
|
|
1598
|
+
let high = runs.length / PATTERN_RUN_CODE_POINTS;
|
|
1599
|
+
while (low < high) {
|
|
1600
|
+
const middle = low + high >>> 1;
|
|
1601
|
+
const at = middle * PATTERN_RUN_CODE_POINTS;
|
|
1602
|
+
const difference = runs[at] - first || runs[at + 1] - second || runs[at + 2] - third;
|
|
1603
|
+
if (difference === 0) return middle;
|
|
1604
|
+
if (difference < 0) low = middle + 1;
|
|
1605
|
+
else high = middle;
|
|
1606
|
+
}
|
|
1607
|
+
return -1;
|
|
1608
|
+
}
|
|
1609
|
+
|
|
1610
|
+
// src/pattern/frozen-index.ts
|
|
1611
|
+
function readPatternArrays(arrays) {
|
|
1612
|
+
const source = {
|
|
1613
|
+
count: arrays.offsets.length - 1,
|
|
1614
|
+
codePoints: arrays.runs,
|
|
1615
|
+
postingsAt: (run) => arrays.postings.subarray(arrays.offsets[run], arrays.offsets[run + 1])
|
|
1616
|
+
};
|
|
1617
|
+
return {
|
|
1618
|
+
regions: () => arrays,
|
|
1619
|
+
documents: () => arrays.docIds,
|
|
1620
|
+
postings(first, second, third) {
|
|
1621
|
+
const run = findRun(arrays.runs, first, second, third);
|
|
1622
|
+
return run < 0 ? EMPTY_POSTINGS : source.postingsAt(run);
|
|
1623
|
+
},
|
|
1624
|
+
toArrays(fieldPath, remap) {
|
|
1625
|
+
return buildArrays(fieldPath, arrays.docIds, source, null, remap);
|
|
1626
|
+
},
|
|
1627
|
+
bytes() {
|
|
1628
|
+
return arrays.docIds.byteLength + arrays.runs.byteLength + arrays.offsets.byteLength + arrays.postings.byteLength;
|
|
1629
|
+
}
|
|
1630
|
+
};
|
|
1631
|
+
}
|
|
1632
|
+
|
|
1633
|
+
// src/pattern/literal-matcher.ts
|
|
1634
|
+
function bordersOf(codePoints) {
|
|
1635
|
+
const length = codePoints.length;
|
|
1636
|
+
const borders = new Uint32Array(length + 1);
|
|
1637
|
+
let border = 0;
|
|
1638
|
+
for (let at = 1; at < length; at++) {
|
|
1639
|
+
while (border > 0 && codePoints[at] !== codePoints[border]) border = borders[border];
|
|
1640
|
+
if (codePoints[at] === codePoints[border]) border++;
|
|
1641
|
+
borders[at + 1] = border;
|
|
1642
|
+
}
|
|
1643
|
+
return borders;
|
|
1644
|
+
}
|
|
1645
|
+
function reachablePositionsOf(borders, length) {
|
|
1646
|
+
const reachable = new Uint32Array(length + 1);
|
|
1647
|
+
for (let prefix = 1; prefix <= length; prefix++) {
|
|
1648
|
+
reachable[prefix] = (prefix < length ? 1 : 0) + reachable[borders[prefix]];
|
|
1649
|
+
}
|
|
1650
|
+
return reachable;
|
|
1651
|
+
}
|
|
1652
|
+
var LiteralMatcher = class {
|
|
1653
|
+
constructor(codePoints, anchoredStart, anchoredEnd) {
|
|
1654
|
+
this.codePoints = codePoints;
|
|
1655
|
+
this.anchoredStart = anchoredStart;
|
|
1656
|
+
this.anchoredEnd = anchoredEnd;
|
|
1657
|
+
this.borders = bordersOf(codePoints);
|
|
1658
|
+
this.reachable = reachablePositionsOf(this.borders, codePoints.length);
|
|
1659
|
+
}
|
|
1660
|
+
borders;
|
|
1661
|
+
reachable;
|
|
1662
|
+
prefix = 0;
|
|
1663
|
+
alive = true;
|
|
1664
|
+
accepting = false;
|
|
1665
|
+
decided = null;
|
|
1666
|
+
begin() {
|
|
1667
|
+
this.decided = null;
|
|
1668
|
+
this.prefix = 0;
|
|
1669
|
+
this.alive = this.codePoints.length > 0;
|
|
1670
|
+
this.accepting = this.codePoints.length === 0;
|
|
1671
|
+
if (!this.anchoredEnd && this.accepting) return this.decide(true);
|
|
1672
|
+
return true;
|
|
1673
|
+
}
|
|
1674
|
+
feed(codePoint, tally) {
|
|
1675
|
+
const steps = this.steps();
|
|
1676
|
+
if (steps === 0) return this.decide(!this.anchoredStart && this.codePoints.length === 0);
|
|
1677
|
+
tally.add(steps);
|
|
1678
|
+
if (this.anchoredStart) this.advanceAnchored(codePoint);
|
|
1679
|
+
else this.advance(codePoint);
|
|
1680
|
+
if (!this.anchoredEnd && this.accepting) return this.decide(true);
|
|
1681
|
+
return true;
|
|
1682
|
+
}
|
|
1683
|
+
matched() {
|
|
1684
|
+
return this.decided ?? (this.anchoredEnd && this.accepting);
|
|
1685
|
+
}
|
|
1686
|
+
steps() {
|
|
1687
|
+
const length = this.codePoints.length;
|
|
1688
|
+
if (length === 0) return 0;
|
|
1689
|
+
if (this.anchoredStart) return this.alive && this.prefix < length ? 1 : 0;
|
|
1690
|
+
return 1 + this.reachable[this.prefix];
|
|
1691
|
+
}
|
|
1692
|
+
advanceAnchored(codePoint) {
|
|
1693
|
+
if (this.codePoints[this.prefix] === codePoint) {
|
|
1694
|
+
this.prefix++;
|
|
1695
|
+
this.accepting = this.prefix === this.codePoints.length;
|
|
1696
|
+
return;
|
|
1697
|
+
}
|
|
1698
|
+
this.alive = false;
|
|
1699
|
+
this.accepting = false;
|
|
1700
|
+
}
|
|
1701
|
+
advance(codePoint) {
|
|
1702
|
+
const { codePoints, borders } = this;
|
|
1703
|
+
let prefix = this.prefix === codePoints.length ? borders[this.prefix] : this.prefix;
|
|
1704
|
+
while (prefix > 0 && codePoints[prefix] !== codePoint) prefix = borders[prefix];
|
|
1705
|
+
if (codePoints[prefix] === codePoint) prefix++;
|
|
1706
|
+
this.prefix = prefix;
|
|
1707
|
+
this.accepting = prefix === codePoints.length;
|
|
1708
|
+
}
|
|
1709
|
+
decide(outcome) {
|
|
1710
|
+
this.decided = outcome;
|
|
1711
|
+
return false;
|
|
1712
|
+
}
|
|
1713
|
+
};
|
|
1714
|
+
|
|
1715
|
+
// src/pattern/shortlist.ts
|
|
1716
|
+
function intersect(candidates, list, tally) {
|
|
1717
|
+
const kept = new Uint32Array(Math.min(candidates.length, list.length));
|
|
1718
|
+
let keptCount = 0;
|
|
1719
|
+
let read = 0;
|
|
1720
|
+
for (const candidate of candidates) {
|
|
1721
|
+
while (read < list.length && list[read] < candidate) read++;
|
|
1722
|
+
if (read === list.length) break;
|
|
1723
|
+
if (list[read] === candidate) kept[keptCount++] = candidate;
|
|
1724
|
+
}
|
|
1725
|
+
tally.add(Math.min(list.length, read + 1));
|
|
1726
|
+
return kept.subarray(0, keptCount);
|
|
1727
|
+
}
|
|
1728
|
+
function shortlistAll(index, runs, tally) {
|
|
1729
|
+
const lists = [];
|
|
1730
|
+
for (let at = 0; at < runs.length; at += PATTERN_RUN_CODE_POINTS) {
|
|
1731
|
+
tally.add(1);
|
|
1732
|
+
lists.push(index.postings(runs[at], runs[at + 1], runs[at + 2]));
|
|
1733
|
+
}
|
|
1734
|
+
lists.sort((left, right) => left.length - right.length);
|
|
1735
|
+
let candidates = lists[0];
|
|
1736
|
+
tally.add(candidates.length);
|
|
1737
|
+
for (let at = 1; at < lists.length && candidates.length > 0; at++) {
|
|
1738
|
+
if (lists[at].length > candidates.length * SHORTLIST_INTERSECT_RATIO) break;
|
|
1739
|
+
candidates = intersect(candidates, lists[at], tally);
|
|
1740
|
+
}
|
|
1741
|
+
return candidates;
|
|
1742
|
+
}
|
|
1743
|
+
function union(left, right) {
|
|
1744
|
+
if (left.length === 0) return right;
|
|
1745
|
+
if (right.length === 0) return left;
|
|
1746
|
+
const merged = new Uint32Array(left.length + right.length);
|
|
1747
|
+
let count = 0;
|
|
1748
|
+
let fromLeft = 0;
|
|
1749
|
+
let fromRight = 0;
|
|
1750
|
+
while (fromLeft < left.length && fromRight < right.length) {
|
|
1751
|
+
const smaller = Math.min(left[fromLeft], right[fromRight]);
|
|
1752
|
+
if (left[fromLeft] === smaller) fromLeft++;
|
|
1753
|
+
if (right[fromRight] === smaller) fromRight++;
|
|
1754
|
+
merged[count++] = smaller;
|
|
1755
|
+
}
|
|
1756
|
+
while (fromLeft < left.length) merged[count++] = left[fromLeft++];
|
|
1757
|
+
while (fromRight < right.length) merged[count++] = right[fromRight++];
|
|
1758
|
+
return merged.subarray(0, count);
|
|
1759
|
+
}
|
|
1760
|
+
function shortlist(index, query, tally) {
|
|
1761
|
+
if (query.kind === "all") return query.runs.length === 0 ? null : shortlistAll(index, query.runs, tally);
|
|
1762
|
+
let candidates = new Uint32Array(0);
|
|
1763
|
+
for (const runs of query.branches) candidates = union(candidates, shortlistAll(index, runs, tally));
|
|
1764
|
+
return candidates;
|
|
1765
|
+
}
|
|
1766
|
+
|
|
1767
|
+
// src/pattern/stored-text.ts
|
|
1768
|
+
function someStoredText(values, ordinal, matches) {
|
|
1769
|
+
if (ordinal >= values.shapes.length) return false;
|
|
1770
|
+
const shape = values.shapes[ordinal];
|
|
1771
|
+
if (shape !== 1 && shape !== 2) return false;
|
|
1772
|
+
const first = values.starts[ordinal];
|
|
1773
|
+
const end = values.starts[ordinal + 1];
|
|
1774
|
+
if (first > end || end > values.kinds.length || shape === 1 && end !== first + 1) return false;
|
|
1775
|
+
for (let at = first; at < end; at++) {
|
|
1776
|
+
if (values.kinds[at] !== 4) continue;
|
|
1777
|
+
const start = values.textStart[at];
|
|
1778
|
+
const length = values.textLength[at];
|
|
1779
|
+
if (start > values.units.length || length > values.units.length - start) continue;
|
|
1780
|
+
if (matches(values.units, start, length)) return true;
|
|
1781
|
+
}
|
|
1782
|
+
return false;
|
|
1783
|
+
}
|
|
1784
|
+
|
|
1785
|
+
// src/core/fuzzy.ts
|
|
1786
|
+
var FIRST_SURROGATE = 55296;
|
|
1787
|
+
var LAST_SURROGATE = 57343;
|
|
1788
|
+
var LAST_BASIC_PLANE_CODE_POINT = 65535;
|
|
1789
|
+
function hasSurrogate(text) {
|
|
1790
|
+
for (let index = 0; index < text.length; index++) {
|
|
1791
|
+
const unit = text.charCodeAt(index);
|
|
1792
|
+
if (unit >= FIRST_SURROGATE && unit <= LAST_SURROGATE) return true;
|
|
1793
|
+
}
|
|
1794
|
+
return false;
|
|
1795
|
+
}
|
|
1796
|
+
function fuzzyPrefixOf(queryTerm, prefixLength) {
|
|
1797
|
+
let end = 0;
|
|
1798
|
+
for (let counted = 0; counted < prefixLength && end < queryTerm.length; counted++) {
|
|
1799
|
+
const codePoint = queryTerm.codePointAt(end);
|
|
1800
|
+
end += codePoint !== void 0 && codePoint > LAST_BASIC_PLANE_CODE_POINT ? 2 : 1;
|
|
1801
|
+
}
|
|
1802
|
+
return queryTerm.slice(0, end);
|
|
1803
|
+
}
|
|
1804
|
+
function fuzzyTermMatches(queryTerm, indexTerm, tolerance, prefixLength) {
|
|
1805
|
+
if (queryTerm === indexTerm) return true;
|
|
1806
|
+
if (tolerance <= 0) return false;
|
|
1807
|
+
if (!indexTerm.startsWith(fuzzyPrefixOf(queryTerm, prefixLength))) return false;
|
|
1808
|
+
return boundedLevenshtein(queryTerm, indexTerm, tolerance).withinTolerance;
|
|
1809
|
+
}
|
|
1810
|
+
function boundedLevenshtein(a, b, tolerance) {
|
|
1811
|
+
if (tolerance < 0) return { distance: -1, withinTolerance: false, cells: 0 };
|
|
1812
|
+
if (a === b) return { distance: 0, withinTolerance: true, cells: 0 };
|
|
1813
|
+
return tabulatedLevenshtein(a, b, tolerance);
|
|
1814
|
+
}
|
|
1815
|
+
function tabulatedLevenshtein(a, b, tolerance) {
|
|
1816
|
+
if (tolerance < 0) return { distance: -1, withinTolerance: false, cells: 0 };
|
|
1817
|
+
if (hasSurrogate(a) || hasSurrogate(b)) return bandedDistance(Array.from(a), Array.from(b), tolerance);
|
|
1818
|
+
return bandedDistance(a, b, tolerance);
|
|
1819
|
+
}
|
|
1820
|
+
function bandedDistance(a, b, tolerance) {
|
|
1821
|
+
const m = a.length;
|
|
1822
|
+
const n = b.length;
|
|
1823
|
+
const beyond = tolerance + 1;
|
|
1824
|
+
if (Math.abs(m - n) > tolerance) return { distance: beyond, withinTolerance: false, cells: 0 };
|
|
1825
|
+
let previous = new Uint32Array(n + 1).fill(beyond);
|
|
1826
|
+
let current2 = new Uint32Array(n + 1).fill(beyond);
|
|
1827
|
+
const firstRowEnd = Math.min(n, tolerance);
|
|
1828
|
+
for (let j = 0; j <= firstRowEnd; j++) previous[j] = j;
|
|
1829
|
+
let cells = 0;
|
|
1830
|
+
for (let i = 1; i <= m; i++) {
|
|
1831
|
+
const low = Math.max(1, i - tolerance);
|
|
1832
|
+
const high = Math.min(n, i + tolerance);
|
|
1833
|
+
current2[low - 1] = low === 1 ? i : beyond;
|
|
1834
|
+
let rowMin = current2[low - 1];
|
|
1835
|
+
const character = a[i - 1];
|
|
1836
|
+
if (high >= low) cells += high - low + 1;
|
|
1837
|
+
for (let j = low; j <= high; j++) {
|
|
1838
|
+
const substitution = previous[j - 1] + (character === b[j - 1] ? 0 : 1);
|
|
1839
|
+
const cell = Math.min(previous[j] + 1, current2[j - 1] + 1, substitution, beyond);
|
|
1840
|
+
current2[j] = cell;
|
|
1841
|
+
if (cell < rowMin) rowMin = cell;
|
|
1842
|
+
}
|
|
1843
|
+
if (rowMin > tolerance) return { distance: beyond, withinTolerance: false, cells };
|
|
1844
|
+
const finished = previous;
|
|
1845
|
+
previous = current2;
|
|
1846
|
+
current2 = finished;
|
|
1847
|
+
}
|
|
1848
|
+
const distance = previous[n];
|
|
1849
|
+
return { distance, withinTolerance: distance <= tolerance, cells };
|
|
1850
|
+
}
|
|
1851
|
+
|
|
1852
|
+
// src/core/stored-values/text.ts
|
|
1853
|
+
function storedText(units, start, length) {
|
|
1854
|
+
const end = start + length;
|
|
1855
|
+
let text = "";
|
|
1856
|
+
for (let at = start; at < end; at++) text += String.fromCharCode(units[at]);
|
|
1857
|
+
return text;
|
|
1858
|
+
}
|
|
1859
|
+
|
|
1860
|
+
// src/pattern/typo-claims.ts
|
|
1861
|
+
var slotsBySearch = /* @__PURE__ */ new WeakMap();
|
|
1862
|
+
var localClaims = /* @__PURE__ */ new WeakMap();
|
|
1863
|
+
function typoTestKey(caseFold, tolerance, text) {
|
|
1864
|
+
return `${caseFold}|${tolerance}|${text}`;
|
|
1865
|
+
}
|
|
1866
|
+
function collectSlots(expression, slots) {
|
|
1867
|
+
for (const filter of Object.values(expression.fields ?? {})) {
|
|
1868
|
+
const { eq, tolerance, caseFold } = filter;
|
|
1869
|
+
if (typeof eq !== "string" || tolerance === void 0) continue;
|
|
1870
|
+
const key = typoTestKey(caseFold === true, tolerance, eq);
|
|
1871
|
+
if (!slots.has(key)) slots.set(key, slots.size);
|
|
1872
|
+
}
|
|
1873
|
+
for (const child of expression.and ?? []) collectSlots(child, slots);
|
|
1874
|
+
for (const child of expression.or ?? []) collectSlots(child, slots);
|
|
1875
|
+
if (expression.not !== void 0) collectSlots(expression.not, slots);
|
|
1876
|
+
}
|
|
1877
|
+
function slotsOf(meter) {
|
|
1878
|
+
let slots = slotsBySearch.get(meter);
|
|
1879
|
+
if (slots === void 0) {
|
|
1880
|
+
const collected = /* @__PURE__ */ new Map();
|
|
1881
|
+
if (meter.filters !== void 0) collectSlots(meter.filters, collected);
|
|
1882
|
+
slots = collected;
|
|
1883
|
+
slotsBySearch.set(meter, slots);
|
|
1884
|
+
}
|
|
1885
|
+
return slots;
|
|
1886
|
+
}
|
|
1887
|
+
function claimsTypoPreparation(request) {
|
|
1888
|
+
const { meter, caseFold, tolerance, text } = request;
|
|
1889
|
+
let known = localClaims.get(meter);
|
|
1890
|
+
if (known === void 0) {
|
|
1891
|
+
known = /* @__PURE__ */ new Set();
|
|
1892
|
+
localClaims.set(meter, known);
|
|
1893
|
+
}
|
|
1894
|
+
const key = typoTestKey(caseFold, tolerance, text);
|
|
1895
|
+
if (known.has(key)) return false;
|
|
1896
|
+
known.add(key);
|
|
1897
|
+
if (meter.preparedTypoTests === null) return true;
|
|
1898
|
+
const claimed = new Int32Array(meter.preparedTypoTests);
|
|
1899
|
+
const slot = slotsOf(meter).get(key);
|
|
1900
|
+
if (slot === void 0 || slot >= claimed.length * TYPO_CLAIM_SLOTS_PER_WORD) return true;
|
|
1901
|
+
const bit = 1 << slot % TYPO_CLAIM_SLOTS_PER_WORD;
|
|
1902
|
+
return (Atomics.or(claimed, Math.floor(slot / TYPO_CLAIM_SLOTS_PER_WORD), bit) & bit) === 0;
|
|
1903
|
+
}
|
|
1904
|
+
|
|
1905
|
+
// src/pattern/typo-text.ts
|
|
1906
|
+
function foldTypoText(text, host, tally) {
|
|
1907
|
+
const folded = [];
|
|
1908
|
+
let codePoints = 0;
|
|
1909
|
+
let longestFold = 0;
|
|
1910
|
+
for (let at = 0; at < text.length; at++) {
|
|
1911
|
+
tally?.add(1);
|
|
1912
|
+
const codePoint = text.codePointAt(at) ?? 0;
|
|
1913
|
+
if (codePoint > BASIC_PLANE_LAST) at++;
|
|
1914
|
+
const before = folded.length;
|
|
1915
|
+
host.appendFoldedCodePoint(codePoint, folded);
|
|
1916
|
+
codePoints++;
|
|
1917
|
+
longestFold = Math.max(longestFold, folded.length - before);
|
|
1918
|
+
}
|
|
1919
|
+
return { codePoints, folded, longestFold };
|
|
1920
|
+
}
|
|
1921
|
+
function holdsRun(runs, first, second, third) {
|
|
1922
|
+
for (let at = 0; at < runs.length; at += PATTERN_RUN_CODE_POINTS) {
|
|
1923
|
+
if (runs[at] === first && runs[at + 1] === second && runs[at + 2] === third) return true;
|
|
1924
|
+
}
|
|
1925
|
+
return false;
|
|
1926
|
+
}
|
|
1927
|
+
function keepDistinctRun(runs, folded, at, tally) {
|
|
1928
|
+
tally?.add(1);
|
|
1929
|
+
const first = folded[at];
|
|
1930
|
+
const second = folded[at + 1];
|
|
1931
|
+
const third = folded[at + 2];
|
|
1932
|
+
if (!holdsRun(runs, first, second, third)) runs.push(first, second, third);
|
|
1933
|
+
}
|
|
1934
|
+
function distinctTypoRuns(text, limit, tally) {
|
|
1935
|
+
const { folded } = text;
|
|
1936
|
+
const positions = folded.length - PATTERN_RUN_CODE_POINTS + 1;
|
|
1937
|
+
const wanted = limit * PATTERN_RUN_CODE_POINTS;
|
|
1938
|
+
const runs = [];
|
|
1939
|
+
if (positions > limit && limit > 1) {
|
|
1940
|
+
for (let pick = 0; pick < limit; pick++) {
|
|
1941
|
+
keepDistinctRun(runs, folded, Math.round(pick * (positions - 1) / (limit - 1)), tally);
|
|
1942
|
+
}
|
|
1943
|
+
}
|
|
1944
|
+
for (let at = 0; at < positions && runs.length < wanted; at++) keepDistinctRun(runs, folded, at, tally);
|
|
1945
|
+
return runs;
|
|
1946
|
+
}
|
|
1947
|
+
function typoRunLimit(longestFold) {
|
|
1948
|
+
return Math.max(typoRunsNeeded(MAX_PATTERN_TOLERANCE, longestFold), SHORTLIST_RUN_LOOKUPS);
|
|
1949
|
+
}
|
|
1950
|
+
function typoRunsNeeded(tolerance, longestFold) {
|
|
1951
|
+
return tolerance * (2 + longestFold) + 1;
|
|
1952
|
+
}
|
|
1953
|
+
function distinctTypoRunCount(text, limit) {
|
|
1954
|
+
return distinctTypoRuns(text, limit).length / PATTERN_RUN_CODE_POINTS;
|
|
1955
|
+
}
|
|
1956
|
+
function resolvedTypoTolerance(tolerance, longestFold, distinctRuns) {
|
|
1957
|
+
if (tolerance !== "auto") return tolerance;
|
|
1958
|
+
for (let candidate = MAX_PATTERN_TOLERANCE; candidate > 0; candidate--) {
|
|
1959
|
+
if (distinctRuns >= typoRunsNeeded(candidate, longestFold)) return candidate;
|
|
1960
|
+
}
|
|
1961
|
+
return 0;
|
|
1962
|
+
}
|
|
1963
|
+
|
|
1964
|
+
// src/pattern/typo.ts
|
|
1965
|
+
var TypoComparison = class {
|
|
1966
|
+
constructor(rawText, prepared, caseFold, tolerance, host, tally) {
|
|
1967
|
+
this.caseFold = caseFold;
|
|
1968
|
+
this.tolerance = tolerance;
|
|
1969
|
+
this.host = host;
|
|
1970
|
+
if (caseFold) tally?.add(prepared.folded.length);
|
|
1971
|
+
this.text = caseFold ? String.fromCodePoint(...prepared.folded) : rawText;
|
|
1972
|
+
const length = caseFold ? prepared.folded.length : prepared.codePoints;
|
|
1973
|
+
this.shortest = length - tolerance;
|
|
1974
|
+
this.longest = length + tolerance;
|
|
1975
|
+
}
|
|
1976
|
+
text;
|
|
1977
|
+
shortest;
|
|
1978
|
+
longest;
|
|
1979
|
+
folded = [];
|
|
1980
|
+
within(value, tally) {
|
|
1981
|
+
const compared = this.comparedForm(value);
|
|
1982
|
+
if (compared === null) return false;
|
|
1983
|
+
const { withinTolerance, cells } = tabulatedLevenshtein(this.text, compared, this.tolerance);
|
|
1984
|
+
tally.add(cells);
|
|
1985
|
+
return withinTolerance;
|
|
1986
|
+
}
|
|
1987
|
+
comparedForm(value) {
|
|
1988
|
+
const folded = this.folded;
|
|
1989
|
+
folded.length = 0;
|
|
1990
|
+
let counted = 0;
|
|
1991
|
+
for (let at = 0; at < value.length && counted <= this.longest; at++) {
|
|
1992
|
+
const codePoint = value.codePointAt(at) ?? 0;
|
|
1993
|
+
if (codePoint > BASIC_PLANE_LAST) at++;
|
|
1994
|
+
if (this.caseFold) {
|
|
1995
|
+
this.host.appendFoldedCodePoint(codePoint, folded);
|
|
1996
|
+
counted = folded.length;
|
|
1997
|
+
} else {
|
|
1998
|
+
counted++;
|
|
1999
|
+
}
|
|
2000
|
+
}
|
|
2001
|
+
if (counted > this.longest || counted < this.shortest) return null;
|
|
2002
|
+
return this.caseFold ? String.fromCodePoint(...folded) : value;
|
|
2003
|
+
}
|
|
2004
|
+
};
|
|
2005
|
+
var typoTestsBySearch = /* @__PURE__ */ new WeakMap();
|
|
2006
|
+
function preparedTypoTest(request, tally) {
|
|
2007
|
+
const text = foldTypoText(request.text, request.host, tally);
|
|
2008
|
+
const distinctRuns = distinctTypoRuns(text, typoRunLimit(text.longestFold), tally);
|
|
2009
|
+
const tolerance = resolvedTypoTolerance(
|
|
2010
|
+
request.tolerance,
|
|
2011
|
+
text.longestFold,
|
|
2012
|
+
distinctRuns.length / PATTERN_RUN_CODE_POINTS
|
|
2013
|
+
);
|
|
2014
|
+
if (tolerance === 0) return null;
|
|
2015
|
+
const needed = typoRunsNeeded(tolerance, text.longestFold);
|
|
2016
|
+
return {
|
|
2017
|
+
needed,
|
|
2018
|
+
runs: Uint32Array.from(distinctRuns),
|
|
2019
|
+
comparison: new TypoComparison(request.text, text, request.caseFold, tolerance, request.host, tally)
|
|
2020
|
+
};
|
|
2021
|
+
}
|
|
2022
|
+
function testsWithSettings(request) {
|
|
2023
|
+
let testsBySettings = typoTestsBySearch.get(request.meter);
|
|
2024
|
+
if (testsBySettings === void 0) {
|
|
2025
|
+
testsBySettings = /* @__PURE__ */ new Map();
|
|
2026
|
+
typoTestsBySearch.set(request.meter, testsBySettings);
|
|
2027
|
+
}
|
|
2028
|
+
const settings = `${request.caseFold}|${request.tolerance}`;
|
|
2029
|
+
let tests = testsBySettings.get(settings);
|
|
2030
|
+
if (tests === void 0) {
|
|
2031
|
+
tests = /* @__PURE__ */ new Map();
|
|
2032
|
+
testsBySettings.set(settings, tests);
|
|
2033
|
+
}
|
|
2034
|
+
return tests;
|
|
2035
|
+
}
|
|
2036
|
+
function typoTestFor(request, tally) {
|
|
2037
|
+
const tests = testsWithSettings(request);
|
|
2038
|
+
const known = tests.get(request.text);
|
|
2039
|
+
if (known !== void 0) return known;
|
|
2040
|
+
const test = preparedTypoTest(request, claimsTypoPreparation(request) ? tally : void 0);
|
|
2041
|
+
tests.set(request.text, test);
|
|
2042
|
+
return test;
|
|
2043
|
+
}
|
|
2044
|
+
function rarestLists(index, test, tally) {
|
|
2045
|
+
const { runs, needed } = test;
|
|
2046
|
+
if (runs.length < needed * PATTERN_RUN_CODE_POINTS) return [index.documents()];
|
|
2047
|
+
const lists = [];
|
|
2048
|
+
for (let at = 0; at < runs.length; at += PATTERN_RUN_CODE_POINTS) {
|
|
2049
|
+
tally.add(1);
|
|
2050
|
+
lists.push(index.postings(runs[at], runs[at + 1], runs[at + 2]));
|
|
2051
|
+
}
|
|
2052
|
+
lists.sort((left, right) => left.length - right.length);
|
|
2053
|
+
return lists.slice(0, needed);
|
|
2054
|
+
}
|
|
2055
|
+
function matchWithinTolerance(request, test, tally) {
|
|
2056
|
+
const { index, matches } = request;
|
|
2057
|
+
const checked = new Uint32Array(matches.length);
|
|
2058
|
+
const testValue = (units, start, length) => {
|
|
2059
|
+
return test.comparison.within(storedText(units, start, length), tally);
|
|
2060
|
+
};
|
|
2061
|
+
for (const list of rarestLists(index, test, tally)) {
|
|
2062
|
+
tally.add(list.length);
|
|
2063
|
+
for (const ordinal of list) {
|
|
2064
|
+
if (ordinal >>> 5 >= matches.length || bitsetHas(checked, ordinal)) continue;
|
|
2065
|
+
bitsetSet(checked, ordinal);
|
|
2066
|
+
if (bitsetHas(matches, ordinal)) continue;
|
|
2067
|
+
if (someStoredText(request.values, ordinal, testValue)) bitsetSet(matches, ordinal);
|
|
2068
|
+
}
|
|
2069
|
+
}
|
|
2070
|
+
}
|
|
2071
|
+
|
|
2072
|
+
// src/pattern/work-tally.ts
|
|
2073
|
+
var WorkTally = class {
|
|
2074
|
+
constructor(meter) {
|
|
2075
|
+
this.meter = meter;
|
|
2076
|
+
this.headroom = meter.remaining();
|
|
2077
|
+
}
|
|
2078
|
+
pending = 0;
|
|
2079
|
+
headroom;
|
|
2080
|
+
add(units) {
|
|
2081
|
+
this.pending += units;
|
|
2082
|
+
if (this.pending >= this.meter.flushUnits || this.pending > this.headroom) this.flush();
|
|
2083
|
+
}
|
|
2084
|
+
flush() {
|
|
2085
|
+
if (this.pending === 0) return;
|
|
2086
|
+
const units = this.pending;
|
|
2087
|
+
this.pending = 0;
|
|
2088
|
+
this.meter.add(units);
|
|
2089
|
+
this.headroom = this.meter.remaining();
|
|
2090
|
+
}
|
|
2091
|
+
};
|
|
2092
|
+
|
|
2093
|
+
// src/pattern/evaluate.ts
|
|
2094
|
+
var ANCHORED_START = /* @__PURE__ */ new Set(["eq", "startsWith"]);
|
|
2095
|
+
var ANCHORED_END = /* @__PURE__ */ new Set(["eq", "endsWith"]);
|
|
2096
|
+
var shortlistRunsBySearch = /* @__PURE__ */ new WeakMap();
|
|
2097
|
+
function literalRuns(text, host, meter) {
|
|
2098
|
+
let runsByText = shortlistRunsBySearch.get(meter);
|
|
2099
|
+
if (runsByText === void 0) {
|
|
2100
|
+
runsByText = /* @__PURE__ */ new Map();
|
|
2101
|
+
shortlistRunsBySearch.set(meter, runsByText);
|
|
2102
|
+
}
|
|
2103
|
+
const known = runsByText.get(text);
|
|
2104
|
+
if (known !== void 0) return known;
|
|
2105
|
+
const folded = [];
|
|
2106
|
+
appendTextCodePoints(text, true, host, folded);
|
|
2107
|
+
const runs = { kind: "all", runs: spreadRuns([folded]) };
|
|
2108
|
+
runsByText.set(text, runs);
|
|
2109
|
+
return runs;
|
|
2110
|
+
}
|
|
2111
|
+
function literalTest(request) {
|
|
2112
|
+
const { operator, text, caseFold, host, meter } = request;
|
|
2113
|
+
return {
|
|
2114
|
+
runs: literalRuns(text, host, meter),
|
|
2115
|
+
matcher: () => {
|
|
2116
|
+
const testCodePoints = [];
|
|
2117
|
+
appendTextCodePoints(text, caseFold, host, testCodePoints);
|
|
2118
|
+
return new LiteralMatcher(
|
|
2119
|
+
Uint32Array.from(testCodePoints),
|
|
2120
|
+
ANCHORED_START.has(operator),
|
|
2121
|
+
ANCHORED_END.has(operator)
|
|
2122
|
+
);
|
|
2123
|
+
}
|
|
2124
|
+
};
|
|
2125
|
+
}
|
|
2126
|
+
function expressionTest(request, operator) {
|
|
2127
|
+
const { text, caseFold, host, meter } = request;
|
|
2128
|
+
const expressions = searchExpressions(meter);
|
|
2129
|
+
const entry = expressions.expression(operator, text, caseFold, host);
|
|
2130
|
+
return { runs: entry.prepared.runs, matcher: () => expressions.matcher(entry) };
|
|
2131
|
+
}
|
|
2132
|
+
function matchesText(matcher, units, start, length, caseFold, host, folded, tally) {
|
|
2133
|
+
if (!matcher.begin()) return matcher.matched();
|
|
2134
|
+
const end = start + length;
|
|
2135
|
+
for (let at = start; at < end; at++) {
|
|
2136
|
+
let codePoint = units[at];
|
|
2137
|
+
if (codePoint >= 55296 && codePoint <= 56319 && at + 1 < end) {
|
|
2138
|
+
const low = units[at + 1];
|
|
2139
|
+
if (low >= 56320 && low <= 57343) {
|
|
2140
|
+
codePoint = 65536 + (codePoint - 55296 << 10) + low - 56320;
|
|
2141
|
+
at++;
|
|
2142
|
+
}
|
|
2143
|
+
}
|
|
2144
|
+
if (!caseFold) {
|
|
2145
|
+
if (!matcher.feed(codePoint, tally)) return matcher.matched();
|
|
2146
|
+
continue;
|
|
2147
|
+
}
|
|
2148
|
+
folded.length = 0;
|
|
2149
|
+
host.appendFoldedCodePoint(codePoint, folded);
|
|
2150
|
+
for (const foldedCodePoint of folded) {
|
|
2151
|
+
if (!matcher.feed(foldedCodePoint, tally)) return matcher.matched();
|
|
2152
|
+
}
|
|
2153
|
+
}
|
|
2154
|
+
return matcher.matched();
|
|
2155
|
+
}
|
|
2156
|
+
function answeredByTypoTest(request, tally) {
|
|
2157
|
+
if (request.operator !== "eq" || request.tolerance === 0) return false;
|
|
2158
|
+
const test = typoTestFor(request, tally);
|
|
2159
|
+
if (test === null) return false;
|
|
2160
|
+
matchWithinTolerance(request, test, tally);
|
|
2161
|
+
return true;
|
|
2162
|
+
}
|
|
2163
|
+
function matchPattern(request) {
|
|
2164
|
+
request = { ...request, index: readPatternArrays(request.index.regions()) };
|
|
2165
|
+
const { operator, caseFold, index, matches, host } = request;
|
|
2166
|
+
request.meter.clock?.check();
|
|
2167
|
+
const tally = new WorkTally(request.meter);
|
|
2168
|
+
if (answeredByTypoTest(request, tally)) {
|
|
2169
|
+
tally.flush();
|
|
2170
|
+
return;
|
|
2171
|
+
}
|
|
2172
|
+
const test = operator === "wildcard" || operator === "regex" ? expressionTest(request, operator) : literalTest(request);
|
|
2173
|
+
const shortlisted = shortlist(index, test.runs, tally);
|
|
2174
|
+
const scanning = shortlisted === null;
|
|
2175
|
+
const candidates = shortlisted ?? index.documents();
|
|
2176
|
+
const folded = [];
|
|
2177
|
+
let matcher = null;
|
|
2178
|
+
const testValue = (units, start, length) => {
|
|
2179
|
+
return matcher !== null && matchesText(matcher, units, start, length, caseFold, host, folded, tally);
|
|
2180
|
+
};
|
|
2181
|
+
for (const ordinal of candidates) {
|
|
2182
|
+
if (ordinal >>> 5 >= matches.length || bitsetHas(matches, ordinal)) continue;
|
|
2183
|
+
if (scanning) tally.add(1);
|
|
2184
|
+
matcher ??= test.matcher();
|
|
2185
|
+
if (someStoredText(request.values, ordinal, testValue)) bitsetSet(matches, ordinal);
|
|
2186
|
+
}
|
|
2187
|
+
tally.flush();
|
|
2188
|
+
}
|
|
2189
|
+
|
|
2190
|
+
// src/core/stored-values/build.ts
|
|
2191
|
+
var ORDINAL_LIMIT = 4294967295;
|
|
2192
|
+
var TEXT_UNIT_LIMIT = 1073741824;
|
|
2193
|
+
function checkedCount(count) {
|
|
2194
|
+
if (count > ORDINAL_LIMIT) {
|
|
2195
|
+
throw new NarsilError(ErrorCodes.CONFIG_INVALID, "The stored field exceeds the native value layout");
|
|
2196
|
+
}
|
|
2197
|
+
return count;
|
|
2198
|
+
}
|
|
2199
|
+
function valueKind(value) {
|
|
2200
|
+
if (value === null || value === void 0) return 0;
|
|
2201
|
+
if (value === false) return 1;
|
|
2202
|
+
if (value === true) return 2;
|
|
2203
|
+
if (typeof value === "number") return 3;
|
|
2204
|
+
if (typeof value === "string") return 4;
|
|
2205
|
+
return 5;
|
|
2206
|
+
}
|
|
2207
|
+
function buildStoredValues(values) {
|
|
2208
|
+
checkedCount(values.length);
|
|
2209
|
+
const shapes = new Uint8Array(values.length);
|
|
2210
|
+
const starts = new Uint32Array(values.length + 1);
|
|
2211
|
+
const elements = [];
|
|
2212
|
+
for (let ordinal = 0; ordinal < values.length; ordinal++) {
|
|
2213
|
+
const value = values[ordinal];
|
|
2214
|
+
starts[ordinal] = elements.length;
|
|
2215
|
+
if (value === void 0) continue;
|
|
2216
|
+
if (Array.isArray(value)) {
|
|
2217
|
+
shapes[ordinal] = 2;
|
|
2218
|
+
checkedCount(elements.length + value.length);
|
|
2219
|
+
for (let at = 0; at < value.length; at++) elements.push(value[at]);
|
|
2220
|
+
} else {
|
|
2221
|
+
shapes[ordinal] = 1;
|
|
2222
|
+
checkedCount(elements.length + 1);
|
|
2223
|
+
elements.push(value);
|
|
2224
|
+
}
|
|
2225
|
+
}
|
|
2226
|
+
starts[values.length] = elements.length;
|
|
2227
|
+
const kinds = new Uint8Array(elements.length);
|
|
2228
|
+
const numbers = new Float64Array(elements.length);
|
|
2229
|
+
const textStart = new Uint32Array(elements.length);
|
|
2230
|
+
const textLength = new Uint32Array(elements.length);
|
|
2231
|
+
const encoded = /* @__PURE__ */ new Map();
|
|
2232
|
+
let unitCount = 0;
|
|
2233
|
+
let byteCount = 0;
|
|
2234
|
+
for (let at = 0; at < elements.length; at++) {
|
|
2235
|
+
const value = elements[at];
|
|
2236
|
+
kinds[at] = valueKind(value);
|
|
2237
|
+
if (typeof value === "number") numbers[at] = value;
|
|
2238
|
+
else if (typeof value === "string") {
|
|
2239
|
+
if (value.length > TEXT_UNIT_LIMIT) {
|
|
2240
|
+
throw new NarsilError(ErrorCodes.CONFIG_INVALID, "The stored string exceeds the native text layout");
|
|
2241
|
+
}
|
|
2242
|
+
textStart[at] = unitCount;
|
|
2243
|
+
textLength[at] = value.length;
|
|
2244
|
+
unitCount = checkedCount(unitCount + value.length);
|
|
2245
|
+
} else if (kinds[at] === 5) {
|
|
2246
|
+
const bytes2 = requireLoadedMessagePack().encodeDocument(value);
|
|
2247
|
+
textStart[at] = byteCount;
|
|
2248
|
+
textLength[at] = bytes2.length;
|
|
2249
|
+
byteCount = checkedCount(byteCount + bytes2.length);
|
|
2250
|
+
encoded.set(at, bytes2);
|
|
2251
|
+
}
|
|
2252
|
+
}
|
|
2253
|
+
const units = new Uint16Array(unitCount);
|
|
2254
|
+
const bytes = new Uint8Array(byteCount);
|
|
2255
|
+
for (let at = 0; at < elements.length; at++) {
|
|
2256
|
+
const value = elements[at];
|
|
2257
|
+
if (typeof value === "string") {
|
|
2258
|
+
for (let unit = 0; unit < value.length; unit++) units[textStart[at] + unit] = value.charCodeAt(unit);
|
|
2259
|
+
} else {
|
|
2260
|
+
const stored = encoded.get(at);
|
|
2261
|
+
if (stored !== void 0) bytes.set(stored, textStart[at]);
|
|
2262
|
+
}
|
|
2263
|
+
}
|
|
2264
|
+
return { shapes, starts, kinds, numbers, textStart, textLength, units, bytes };
|
|
2265
|
+
}
|
|
2266
|
+
|
|
2267
|
+
// src/core/stored-values/constants.ts
|
|
2268
|
+
var VALUES_INITIAL_CAPACITY = 64;
|
|
2269
|
+
var PAYLOAD_INITIAL_CAPACITY = 128;
|
|
2270
|
+
|
|
2271
|
+
// src/core/stored-values/storage.ts
|
|
2272
|
+
function checkedSize(size, maximum = 4294967295) {
|
|
2273
|
+
if (!Number.isInteger(size) || size < 0 || size > maximum)
|
|
2274
|
+
throw new NarsilError(ErrorCodes.CONFIG_INVALID, "The stored field exceeds the native value layout");
|
|
2275
|
+
return size;
|
|
2276
|
+
}
|
|
2277
|
+
function capacity(current2, needed, minimum, maximum = 4294967295) {
|
|
2278
|
+
checkedSize(needed, maximum);
|
|
2279
|
+
return Math.max(needed, Math.min(maximum, current2 * 2), minimum);
|
|
2280
|
+
}
|
|
2281
|
+
function grow(region, needed, create, minimum, maximum = 4294967295) {
|
|
2282
|
+
if (needed <= region.length) return region;
|
|
2283
|
+
const next = create(capacity(region.length, needed, minimum, maximum));
|
|
2284
|
+
next.set(region);
|
|
2285
|
+
return next;
|
|
2286
|
+
}
|
|
2287
|
+
function reserveStoredValues(held, ordinals, elements, units, bytes) {
|
|
2288
|
+
checkedSize(ordinals);
|
|
2289
|
+
checkedSize(elements);
|
|
2290
|
+
return {
|
|
2291
|
+
shapes: grow(held.shapes, ordinals, (length) => new Uint8Array(length), VALUES_INITIAL_CAPACITY),
|
|
2292
|
+
starts: grow(held.starts, ordinals + 1, (length) => new Uint32Array(length), VALUES_INITIAL_CAPACITY, 4294967296),
|
|
2293
|
+
kinds: grow(held.kinds, elements, (length) => new Uint8Array(length), VALUES_INITIAL_CAPACITY),
|
|
2294
|
+
numbers: grow(held.numbers, elements, (length) => new Float64Array(length), VALUES_INITIAL_CAPACITY),
|
|
2295
|
+
textStart: grow(held.textStart, elements, (length) => new Uint32Array(length), VALUES_INITIAL_CAPACITY),
|
|
2296
|
+
textLength: grow(held.textLength, elements, (length) => new Uint32Array(length), VALUES_INITIAL_CAPACITY),
|
|
2297
|
+
units: grow(held.units, units, (length) => new Uint16Array(length), PAYLOAD_INITIAL_CAPACITY),
|
|
2298
|
+
bytes: grow(held.bytes, bytes, (length) => new Uint8Array(length), PAYLOAD_INITIAL_CAPACITY)
|
|
2299
|
+
};
|
|
2300
|
+
}
|
|
2301
|
+
function compactStoredPayload(held, elements, unitCount, byteCount, extraUnits, extraBytes) {
|
|
2302
|
+
const units = new Uint16Array(capacity(0, unitCount + extraUnits, PAYLOAD_INITIAL_CAPACITY));
|
|
2303
|
+
const bytes = new Uint8Array(capacity(0, byteCount + extraBytes, PAYLOAD_INITIAL_CAPACITY));
|
|
2304
|
+
const textStart = held.textStart.slice();
|
|
2305
|
+
let unit = 0;
|
|
2306
|
+
let byte = 0;
|
|
2307
|
+
for (let at = 0; at < elements; at++) {
|
|
2308
|
+
const start = held.textStart[at];
|
|
2309
|
+
const end = start + held.textLength[at];
|
|
2310
|
+
if (held.kinds[at] === 4) {
|
|
2311
|
+
units.set(held.units.subarray(start, end), unit);
|
|
2312
|
+
textStart[at] = unit;
|
|
2313
|
+
unit += end - start;
|
|
2314
|
+
} else if (held.kinds[at] === 5) {
|
|
2315
|
+
bytes.set(held.bytes.subarray(start, end), byte);
|
|
2316
|
+
textStart[at] = byte;
|
|
2317
|
+
byte += end - start;
|
|
2318
|
+
}
|
|
2319
|
+
}
|
|
2320
|
+
return { ...held, units, bytes, textStart };
|
|
2321
|
+
}
|
|
2322
|
+
|
|
2323
|
+
// src/core/stored-values/column.ts
|
|
2324
|
+
var StoredValueColumn = class {
|
|
2325
|
+
held;
|
|
2326
|
+
ordinals;
|
|
2327
|
+
elements;
|
|
2328
|
+
usedUnits;
|
|
2329
|
+
usedBytes;
|
|
2330
|
+
liveUnits;
|
|
2331
|
+
liveBytes;
|
|
2332
|
+
view = null;
|
|
2333
|
+
constructor(values) {
|
|
2334
|
+
this.held = "shapes" in values ? values : buildStoredValues(values);
|
|
2335
|
+
this.ordinals = this.held.shapes.length;
|
|
2336
|
+
this.elements = this.held.kinds.length;
|
|
2337
|
+
this.usedUnits = this.liveUnits = this.held.units.length;
|
|
2338
|
+
this.usedBytes = this.liveBytes = this.held.bytes.length;
|
|
2339
|
+
}
|
|
2340
|
+
prepare(changes) {
|
|
2341
|
+
const prepared = changes.map((change) => ({ ordinal: change.ordinal, values: buildStoredValues([change.value]) }));
|
|
2342
|
+
let ordinals = this.ordinals;
|
|
2343
|
+
let elements = this.elements;
|
|
2344
|
+
let capacity2 = elements;
|
|
2345
|
+
let units = 0;
|
|
2346
|
+
let bytes = 0;
|
|
2347
|
+
for (const change of prepared) {
|
|
2348
|
+
checkedSize(change.ordinal);
|
|
2349
|
+
ordinals = Math.max(ordinals, change.ordinal + 1);
|
|
2350
|
+
const previous = change.ordinal < this.ordinals ? this.held.starts[change.ordinal + 1] - this.held.starts[change.ordinal] : 0;
|
|
2351
|
+
elements += change.values.kinds.length - previous;
|
|
2352
|
+
capacity2 = Math.max(capacity2, checkedSize(elements));
|
|
2353
|
+
units += change.values.units.length;
|
|
2354
|
+
bytes += change.values.bytes.length;
|
|
2355
|
+
}
|
|
2356
|
+
let held = this.held;
|
|
2357
|
+
let usedUnits = this.usedUnits;
|
|
2358
|
+
let usedBytes = this.usedBytes;
|
|
2359
|
+
if (usedUnits > PAYLOAD_INITIAL_CAPACITY && usedUnits - this.liveUnits > this.liveUnits || usedBytes > PAYLOAD_INITIAL_CAPACITY && usedBytes - this.liveBytes > this.liveBytes) {
|
|
2360
|
+
held = compactStoredPayload(held, this.elements, this.liveUnits, this.liveBytes, units, bytes);
|
|
2361
|
+
usedUnits = this.liveUnits;
|
|
2362
|
+
usedBytes = this.liveBytes;
|
|
2363
|
+
}
|
|
2364
|
+
held = reserveStoredValues(held, ordinals, capacity2, usedUnits + units, usedBytes + bytes);
|
|
2365
|
+
return () => {
|
|
2366
|
+
this.view = null;
|
|
2367
|
+
this.held = held;
|
|
2368
|
+
this.usedUnits = usedUnits;
|
|
2369
|
+
this.usedBytes = usedBytes;
|
|
2370
|
+
for (const change of prepared) this.replace(change.ordinal, change.values);
|
|
2371
|
+
};
|
|
2372
|
+
}
|
|
2373
|
+
replace(ordinal, values) {
|
|
2374
|
+
const held = this.held;
|
|
2375
|
+
if (ordinal >= this.ordinals) {
|
|
2376
|
+
held.starts.fill(this.elements, this.ordinals, ordinal + 2);
|
|
2377
|
+
this.ordinals = ordinal + 1;
|
|
2378
|
+
}
|
|
2379
|
+
const start = held.starts[ordinal];
|
|
2380
|
+
const end = held.starts[ordinal + 1];
|
|
2381
|
+
for (let at = start; at < end; at++) {
|
|
2382
|
+
if (held.kinds[at] === 4) this.liveUnits -= held.textLength[at];
|
|
2383
|
+
else if (held.kinds[at] === 5) this.liveBytes -= held.textLength[at];
|
|
2384
|
+
}
|
|
2385
|
+
const delta = values.kinds.length - (end - start);
|
|
2386
|
+
if (delta !== 0) {
|
|
2387
|
+
held.kinds.copyWithin(end + delta, end, this.elements);
|
|
2388
|
+
held.numbers.copyWithin(end + delta, end, this.elements);
|
|
2389
|
+
held.textStart.copyWithin(end + delta, end, this.elements);
|
|
2390
|
+
held.textLength.copyWithin(end + delta, end, this.elements);
|
|
2391
|
+
for (let at = ordinal + 1; at <= this.ordinals; at++) held.starts[at] += delta;
|
|
2392
|
+
this.elements += delta;
|
|
2393
|
+
}
|
|
2394
|
+
held.shapes[ordinal] = values.shapes[0];
|
|
2395
|
+
held.kinds.set(values.kinds, start);
|
|
2396
|
+
held.numbers.set(values.numbers, start);
|
|
2397
|
+
held.textLength.set(values.textLength, start);
|
|
2398
|
+
for (let at = 0; at < values.kinds.length; at++) {
|
|
2399
|
+
const base = values.kinds[at] === 4 ? this.usedUnits : values.kinds[at] === 5 ? this.usedBytes : 0;
|
|
2400
|
+
held.textStart[start + at] = values.textStart[at] + base;
|
|
2401
|
+
}
|
|
2402
|
+
held.units.set(values.units, this.usedUnits);
|
|
2403
|
+
held.bytes.set(values.bytes, this.usedBytes);
|
|
2404
|
+
this.usedUnits += values.units.length;
|
|
2405
|
+
this.liveUnits += values.units.length;
|
|
2406
|
+
this.usedBytes += values.bytes.length;
|
|
2407
|
+
this.liveBytes += values.bytes.length;
|
|
2408
|
+
}
|
|
2409
|
+
regions() {
|
|
2410
|
+
if (this.view !== null) return this.view;
|
|
2411
|
+
const held = this.held;
|
|
2412
|
+
this.view = {
|
|
2413
|
+
shapes: held.shapes.subarray(0, this.ordinals),
|
|
2414
|
+
starts: held.starts.subarray(0, this.ordinals + 1),
|
|
2415
|
+
kinds: held.kinds.subarray(0, this.elements),
|
|
2416
|
+
numbers: held.numbers.subarray(0, this.elements),
|
|
2417
|
+
textStart: held.textStart.subarray(0, this.elements),
|
|
2418
|
+
textLength: held.textLength.subarray(0, this.elements),
|
|
2419
|
+
units: held.units.subarray(0, this.usedUnits),
|
|
2420
|
+
bytes: held.bytes.subarray(0, this.usedBytes)
|
|
2421
|
+
};
|
|
2422
|
+
return this.view;
|
|
2423
|
+
}
|
|
2424
|
+
bytes() {
|
|
2425
|
+
return Object.values(this.held).reduce((sum, region) => sum + region.byteLength, 0);
|
|
2426
|
+
}
|
|
2427
|
+
};
|
|
2428
|
+
|
|
2429
|
+
// src/core/stored-values/columns.ts
|
|
2430
|
+
var columns = /* @__PURE__ */ new WeakMap();
|
|
2431
|
+
function discardStoredValues(store) {
|
|
2432
|
+
columns.delete(store);
|
|
2433
|
+
}
|
|
2434
|
+
function current(store) {
|
|
2435
|
+
const held = columns.get(store);
|
|
2436
|
+
if (held === void 0 || held.generation === store.numberingGeneration()) return held;
|
|
2437
|
+
columns.delete(store);
|
|
2438
|
+
return void 0;
|
|
2439
|
+
}
|
|
2440
|
+
function unchanged() {
|
|
2441
|
+
}
|
|
2442
|
+
function cachedStoredFields(store) {
|
|
2443
|
+
const held = current(store);
|
|
2444
|
+
return held === void 0 ? [] : Array.from(held.fields, ([field, column]) => ({ field, values: column.regions() }));
|
|
2445
|
+
}
|
|
2446
|
+
function installStoredFields(store, fields) {
|
|
2447
|
+
if (fields.length === 0) return;
|
|
2448
|
+
columns.set(store, {
|
|
2449
|
+
generation: store.numberingGeneration(),
|
|
2450
|
+
fields: new Map(fields.map(({ field, values }) => [field, new StoredValueColumn(values)]))
|
|
2451
|
+
});
|
|
2452
|
+
}
|
|
2453
|
+
function storedValuesOf(store, field) {
|
|
2454
|
+
let held = current(store);
|
|
2455
|
+
if (held === void 0) {
|
|
2456
|
+
held = { generation: store.numberingGeneration(), fields: /* @__PURE__ */ new Map() };
|
|
2457
|
+
columns.set(store, held);
|
|
2458
|
+
}
|
|
2459
|
+
let column = held.fields.get(field);
|
|
2460
|
+
if (column === void 0) {
|
|
2461
|
+
const values = new Array(store.internalIdCapacity());
|
|
2462
|
+
const read = store.fieldReader(field);
|
|
2463
|
+
for (const ordinal of store.allInternalIds()) values[ordinal] = read(ordinal);
|
|
2464
|
+
column = new StoredValueColumn(values);
|
|
2465
|
+
held.fields.set(field, column);
|
|
2466
|
+
}
|
|
2467
|
+
return column.regions();
|
|
2468
|
+
}
|
|
2469
|
+
function prepareStoredValues(store, removed, written, document) {
|
|
2470
|
+
const held = current(store);
|
|
2471
|
+
if (held === void 0) return unchanged;
|
|
2472
|
+
const changes = [];
|
|
2473
|
+
for (const [field, column] of held.fields) {
|
|
2474
|
+
const values = [];
|
|
2475
|
+
if (removed !== void 0 && removed !== written) values.push({ ordinal: removed, value: void 0 });
|
|
2476
|
+
if (written !== void 0)
|
|
2477
|
+
values.push({ ordinal: written, value: document === void 0 ? void 0 : getNestedValue(document, field) });
|
|
2478
|
+
changes.push(column.prepare(values));
|
|
2479
|
+
}
|
|
2480
|
+
return () => {
|
|
2481
|
+
for (const apply of changes) apply();
|
|
2482
|
+
};
|
|
2483
|
+
}
|
|
2484
|
+
function storedValueBytes(store) {
|
|
2485
|
+
const held = current(store);
|
|
2486
|
+
let bytes = 0;
|
|
2487
|
+
if (held !== void 0) for (const field of held.fields.values()) bytes += field.bytes();
|
|
2488
|
+
return bytes;
|
|
2489
|
+
}
|
|
2490
|
+
|
|
2491
|
+
// src/core/pattern-index/tolerance.ts
|
|
2492
|
+
function isPatternTolerance(value) {
|
|
2493
|
+
if (value === "auto") return true;
|
|
2494
|
+
return typeof value === "number" && Number.isInteger(value) && value >= 0 && value <= MAX_PATTERN_TOLERANCE;
|
|
2495
|
+
}
|
|
2496
|
+
|
|
2497
|
+
// src/pattern/filter-tests.ts
|
|
2498
|
+
function excluding(context, fieldPath, excluded) {
|
|
2499
|
+
const universe = bitsetAnd(context.presentBitset(fieldPath), context.allDocIdsBitset);
|
|
2500
|
+
return bitsetAnd(universe, bitsetNot(excluded, context.capacity));
|
|
2501
|
+
}
|
|
2502
|
+
function textsOf(operand) {
|
|
2503
|
+
const texts = /* @__PURE__ */ new Set();
|
|
2504
|
+
if (!Array.isArray(operand)) return texts;
|
|
2505
|
+
for (const text of operand) if (typeof text === "string") texts.add(text);
|
|
2506
|
+
return texts;
|
|
2507
|
+
}
|
|
2508
|
+
function evaluatePatternTests(fieldPath, filter, context, bitsets) {
|
|
2509
|
+
const caseFold = filter.caseFold === true;
|
|
2510
|
+
const matching = (operator, texts, tolerance = 0) => {
|
|
2511
|
+
const into = createBitSet(context.capacity);
|
|
2512
|
+
for (const text of texts) context.matchPattern(fieldPath, operator, text, caseFold, tolerance, into);
|
|
2513
|
+
return into;
|
|
2514
|
+
};
|
|
2515
|
+
const eqTolerance = isPatternTolerance(filter.tolerance) ? filter.tolerance : 0;
|
|
2516
|
+
if (typeof filter.eq === "string") bitsets.push(matching("eq", [filter.eq], eqTolerance));
|
|
2517
|
+
if (typeof filter.ne === "string") bitsets.push(excluding(context, fieldPath, matching("eq", [filter.ne])));
|
|
2518
|
+
if (filter.in !== void 0) bitsets.push(matching("eq", textsOf(filter.in)));
|
|
2519
|
+
if (filter.nin !== void 0) bitsets.push(excluding(context, fieldPath, matching("eq", textsOf(filter.nin))));
|
|
2520
|
+
if (typeof filter.startsWith === "string") bitsets.push(matching("startsWith", [filter.startsWith]));
|
|
2521
|
+
if (typeof filter.endsWith === "string") bitsets.push(matching("endsWith", [filter.endsWith]));
|
|
2522
|
+
if (typeof filter.contains === "string") bitsets.push(matching("contains", [filter.contains]));
|
|
2523
|
+
if (typeof filter.wildcard === "string") bitsets.push(matching("wildcard", [filter.wildcard]));
|
|
2524
|
+
if (typeof filter.regex === "string") bitsets.push(matching("regex", [filter.regex]));
|
|
2525
|
+
}
|
|
2526
|
+
|
|
2527
|
+
// src/pattern/footprint.ts
|
|
2528
|
+
var POSITIONS_PER_WORD = 32;
|
|
2529
|
+
function positionWords(positions) {
|
|
2530
|
+
return Math.max(1, Math.ceil(positions / POSITIONS_PER_WORD));
|
|
2531
|
+
}
|
|
2532
|
+
function smallestMatcherBytes(positions) {
|
|
2533
|
+
return 2 * positionWords(positions) * Uint32Array.BYTES_PER_ELEMENT + positions * MATCHER_CODE_POINT_BYTES + positions * MATCHER_SIMULATION_BYTES_PER_POSITION + MATCHER_STATE_OVERHEAD_BYTES + positions * Uint32Array.BYTES_PER_ELEMENT;
|
|
2534
|
+
}
|
|
2535
|
+
function isRecord(value) {
|
|
2536
|
+
return value !== null && typeof value === "object" && !Array.isArray(value);
|
|
2537
|
+
}
|
|
2538
|
+
function literalFootprint(text, caseFold, host) {
|
|
2539
|
+
if (typeof text !== "string") return null;
|
|
2540
|
+
return smallestMatcherBytes(caseFold ? foldedCodePointCount(text, host) : codePointCount(text));
|
|
2541
|
+
}
|
|
2542
|
+
function larger(left, right) {
|
|
2543
|
+
if (left === null) return right;
|
|
2544
|
+
if (right === null) return left;
|
|
2545
|
+
return Math.max(left, right);
|
|
2546
|
+
}
|
|
2547
|
+
function largestTestOf(filter, host) {
|
|
2548
|
+
const caseFold = filter.caseFold === true;
|
|
2549
|
+
let largest = null;
|
|
2550
|
+
for (const operator of PATTERN_TEST_OPERATORS) {
|
|
2551
|
+
const operand = filter[operator];
|
|
2552
|
+
if (operand === void 0) continue;
|
|
2553
|
+
const texts = Array.isArray(operand) ? operand : [operand];
|
|
2554
|
+
for (const text of texts) largest = larger(largest, literalFootprint(text, caseFold, host));
|
|
2555
|
+
}
|
|
2556
|
+
for (const operator of PATTERN_EXPRESSION_OPERATORS) {
|
|
2557
|
+
const pattern = filter[operator];
|
|
2558
|
+
if (typeof pattern !== "string") continue;
|
|
2559
|
+
largest = larger(largest, expressionFootprint(operator, pattern, caseFold, host));
|
|
2560
|
+
}
|
|
2561
|
+
return largest;
|
|
2562
|
+
}
|
|
2563
|
+
function largestPatternFootprintIn(expression, patternFields, host) {
|
|
2564
|
+
let largest = null;
|
|
2565
|
+
if (isRecord(expression.fields)) {
|
|
2566
|
+
for (const [fieldPath, filter] of Object.entries(expression.fields)) {
|
|
2567
|
+
if (patternFields.has(fieldPath) && isRecord(filter)) largest = larger(largest, largestTestOf(filter, host));
|
|
2568
|
+
}
|
|
2569
|
+
}
|
|
2570
|
+
const nested = [...expression.and ?? [], ...expression.or ?? []];
|
|
2571
|
+
if (expression.not !== void 0) nested.push(expression.not);
|
|
2572
|
+
for (const child of nested) largest = larger(largest, largestPatternFootprintIn(child, patternFields, host));
|
|
2573
|
+
return largest;
|
|
2574
|
+
}
|
|
2575
|
+
|
|
2576
|
+
// src/pattern/growing-index.ts
|
|
2577
|
+
function createRunList() {
|
|
2578
|
+
return { ids: new Uint32Array(RUN_LIST_INITIAL_CAPACITY), length: 0, removed: null, ordered: true };
|
|
2579
|
+
}
|
|
2580
|
+
function compactRemoved(list) {
|
|
2581
|
+
const removed = list.removed;
|
|
2582
|
+
if (removed === null) return;
|
|
2583
|
+
let kept = 0;
|
|
2584
|
+
for (let at = 0; at < list.length; at++) {
|
|
2585
|
+
const ordinal = list.ids[at];
|
|
2586
|
+
if (removed.has(ordinal)) continue;
|
|
2587
|
+
list.ids[kept++] = ordinal;
|
|
2588
|
+
}
|
|
2589
|
+
list.length = kept;
|
|
2590
|
+
list.removed = null;
|
|
2591
|
+
}
|
|
2592
|
+
function compactAndSort(list) {
|
|
2593
|
+
compactRemoved(list);
|
|
2594
|
+
if (!list.ordered) {
|
|
2595
|
+
list.ids.subarray(0, list.length).sort();
|
|
2596
|
+
list.ordered = true;
|
|
2597
|
+
}
|
|
2598
|
+
}
|
|
2599
|
+
function createGrowingPatternIndex(host) {
|
|
2600
|
+
const runs = /* @__PURE__ */ new Map();
|
|
2601
|
+
const documents = /* @__PURE__ */ new Set();
|
|
2602
|
+
let documentsCache = null;
|
|
2603
|
+
let regionsCache = null;
|
|
2604
|
+
let listBytes = 0;
|
|
2605
|
+
const folded = [];
|
|
2606
|
+
function runKeysOf(value) {
|
|
2607
|
+
const keys = /* @__PURE__ */ new Set();
|
|
2608
|
+
forEachTextValue(value, (text) => {
|
|
2609
|
+
folded.length = 0;
|
|
2610
|
+
appendTextCodePoints(text, true, host, folded);
|
|
2611
|
+
collectRunKeys(folded, keys);
|
|
2612
|
+
});
|
|
2613
|
+
return keys;
|
|
2614
|
+
}
|
|
2615
|
+
function grow2(list) {
|
|
2616
|
+
const next = new Uint32Array(list.ids.length * 2);
|
|
2617
|
+
next.set(list.ids.subarray(0, list.length));
|
|
2618
|
+
listBytes += next.byteLength - list.ids.byteLength;
|
|
2619
|
+
list.ids = next;
|
|
2620
|
+
}
|
|
2621
|
+
function listFor(key) {
|
|
2622
|
+
let list = runs.get(key);
|
|
2623
|
+
if (list === void 0) {
|
|
2624
|
+
list = createRunList();
|
|
2625
|
+
listBytes += list.ids.byteLength;
|
|
2626
|
+
runs.set(key, list);
|
|
2627
|
+
}
|
|
2628
|
+
return list;
|
|
2629
|
+
}
|
|
2630
|
+
function append(list, ordinal) {
|
|
2631
|
+
if (list.removed?.delete(ordinal)) return;
|
|
2632
|
+
if (list.length === list.ids.length) grow2(list);
|
|
2633
|
+
if (list.length > 0 && list.ids[list.length - 1] > ordinal) list.ordered = false;
|
|
2634
|
+
list.ids[list.length++] = ordinal;
|
|
2635
|
+
}
|
|
2636
|
+
function dropIfEmpty(key, list) {
|
|
2637
|
+
if (list.length > 0) return;
|
|
2638
|
+
listBytes -= list.ids.byteLength;
|
|
2639
|
+
runs.delete(key);
|
|
2640
|
+
}
|
|
2641
|
+
function markRemoved(key, list, ordinal) {
|
|
2642
|
+
if (list.removed === null) list.removed = /* @__PURE__ */ new Set();
|
|
2643
|
+
list.removed.add(ordinal);
|
|
2644
|
+
if (list.removed.size < list.length * RUN_LIST_COMPACTION_FRACTION) return;
|
|
2645
|
+
compactRemoved(list);
|
|
2646
|
+
dropIfEmpty(key, list);
|
|
2647
|
+
}
|
|
2648
|
+
function settledPostings(key) {
|
|
2649
|
+
const list = runs.get(key);
|
|
2650
|
+
if (list === void 0) return EMPTY_POSTINGS;
|
|
2651
|
+
compactAndSort(list);
|
|
2652
|
+
if (list.length === 0) {
|
|
2653
|
+
dropIfEmpty(key, list);
|
|
2654
|
+
return EMPTY_POSTINGS;
|
|
2655
|
+
}
|
|
2656
|
+
return list.ids.subarray(0, list.length);
|
|
2657
|
+
}
|
|
2658
|
+
function sortedDocuments() {
|
|
2659
|
+
if (documentsCache === null) {
|
|
2660
|
+
documentsCache = Uint32Array.from(documents).sort();
|
|
2661
|
+
}
|
|
2662
|
+
return documentsCache;
|
|
2663
|
+
}
|
|
2664
|
+
function runSource() {
|
|
2665
|
+
const keys = [];
|
|
2666
|
+
const lists = [];
|
|
2667
|
+
for (const key of [...runs.keys()]) {
|
|
2668
|
+
const postings = settledPostings(key);
|
|
2669
|
+
if (postings.length === 0) continue;
|
|
2670
|
+
keys.push(key);
|
|
2671
|
+
lists.push(postings);
|
|
2672
|
+
}
|
|
2673
|
+
const codePoints = new Uint32Array(keys.length * PATTERN_RUN_CODE_POINTS);
|
|
2674
|
+
for (let run = 0; run < keys.length; run++) {
|
|
2675
|
+
runKeyCodePoints(keys[run], codePoints, run * PATTERN_RUN_CODE_POINTS);
|
|
2676
|
+
}
|
|
2677
|
+
return { count: keys.length, codePoints, postingsAt: (run) => lists[run] };
|
|
2678
|
+
}
|
|
2679
|
+
return {
|
|
2680
|
+
regions() {
|
|
2681
|
+
if (regionsCache === null) {
|
|
2682
|
+
const source = runSource();
|
|
2683
|
+
regionsCache = buildArrays("", sortedDocuments(), source, sortedRunOrder(source.codePoints, source.count), null);
|
|
2684
|
+
}
|
|
2685
|
+
return regionsCache;
|
|
2686
|
+
},
|
|
2687
|
+
add(ordinal, value) {
|
|
2688
|
+
if (!holdsTextValue(value)) return;
|
|
2689
|
+
regionsCache = null;
|
|
2690
|
+
documents.add(ordinal);
|
|
2691
|
+
documentsCache = null;
|
|
2692
|
+
for (const key of runKeysOf(value)) append(listFor(key), ordinal);
|
|
2693
|
+
},
|
|
2694
|
+
remove(ordinal, value) {
|
|
2695
|
+
if (!holdsTextValue(value)) return;
|
|
2696
|
+
regionsCache = null;
|
|
2697
|
+
if (documents.delete(ordinal)) documentsCache = null;
|
|
2698
|
+
for (const key of runKeysOf(value)) {
|
|
2699
|
+
const list = runs.get(key);
|
|
2700
|
+
if (list !== void 0) markRemoved(key, list, ordinal);
|
|
2701
|
+
}
|
|
2702
|
+
},
|
|
2703
|
+
addArrays(arrays, mapOrdinal) {
|
|
2704
|
+
regionsCache = null;
|
|
2705
|
+
for (const ordinal of arrays.docIds) {
|
|
2706
|
+
const mapped = mapOrdinal(ordinal);
|
|
2707
|
+
if (mapped < 0) continue;
|
|
2708
|
+
documents.add(mapped);
|
|
2709
|
+
documentsCache = null;
|
|
2710
|
+
}
|
|
2711
|
+
const runCount = arrays.offsets.length - 1;
|
|
2712
|
+
for (let run = 0; run < runCount; run++) {
|
|
2713
|
+
const at = run * PATTERN_RUN_CODE_POINTS;
|
|
2714
|
+
const key = runKey(arrays.runs[at], arrays.runs[at + 1], arrays.runs[at + 2]);
|
|
2715
|
+
const list = listFor(key);
|
|
2716
|
+
for (let posting = arrays.offsets[run]; posting < arrays.offsets[run + 1]; posting++) {
|
|
2717
|
+
const mapped = mapOrdinal(arrays.postings[posting]);
|
|
2718
|
+
if (mapped >= 0) append(list, mapped);
|
|
2719
|
+
}
|
|
2720
|
+
dropIfEmpty(key, list);
|
|
2721
|
+
}
|
|
2722
|
+
},
|
|
2723
|
+
clear() {
|
|
2724
|
+
runs.clear();
|
|
2725
|
+
documents.clear();
|
|
2726
|
+
documentsCache = null;
|
|
2727
|
+
listBytes = 0;
|
|
2728
|
+
regionsCache = null;
|
|
2729
|
+
},
|
|
2730
|
+
documents: sortedDocuments,
|
|
2731
|
+
postings(first, second, third) {
|
|
2732
|
+
return settledPostings(runKey(first, second, third));
|
|
2733
|
+
},
|
|
2734
|
+
toArrays(fieldPath, remap) {
|
|
2735
|
+
const source = runSource();
|
|
2736
|
+
return buildArrays(fieldPath, sortedDocuments(), source, sortedRunOrder(source.codePoints, source.count), remap);
|
|
2737
|
+
},
|
|
2738
|
+
bytes() {
|
|
2739
|
+
return listBytes + runs.size * RUN_ENTRY_OVERHEAD_BYTES + documents.size * DOCUMENT_ENTRY_BYTES + (documentsCache?.byteLength ?? 0) + (regionsCache === null ? 0 : regionsCache.docIds.byteLength + regionsCache.runs.byteLength + regionsCache.offsets.byteLength + regionsCache.postings.byteLength);
|
|
2740
|
+
}
|
|
2741
|
+
};
|
|
2742
|
+
}
|
|
2743
|
+
|
|
2744
|
+
// src/pattern/merge.ts
|
|
2745
|
+
function sortTailIfUnordered(values, start) {
|
|
2746
|
+
for (let at = start + 1; at < values.length; at++) {
|
|
2747
|
+
if (values.values[at - 1] > values.values[at]) {
|
|
2748
|
+
values.values.subarray(start, values.length).sort();
|
|
2749
|
+
return;
|
|
2750
|
+
}
|
|
2751
|
+
}
|
|
2752
|
+
}
|
|
2753
|
+
function smallestRun(inputs, cursors) {
|
|
2754
|
+
let smallest = -1;
|
|
2755
|
+
for (let input = 0; input < inputs.length; input++) {
|
|
2756
|
+
const runCount = inputs[input].arrays.offsets.length - 1;
|
|
2757
|
+
if (cursors[input] >= runCount) continue;
|
|
2758
|
+
if (smallest < 0) {
|
|
2759
|
+
smallest = input;
|
|
2760
|
+
continue;
|
|
2761
|
+
}
|
|
2762
|
+
const order = compareRuns(
|
|
2763
|
+
inputs[input].arrays.runs,
|
|
2764
|
+
cursors[input] * PATTERN_RUN_CODE_POINTS,
|
|
2765
|
+
inputs[smallest].arrays.runs,
|
|
2766
|
+
cursors[smallest] * PATTERN_RUN_CODE_POINTS
|
|
2767
|
+
);
|
|
2768
|
+
if (order < 0) smallest = input;
|
|
2769
|
+
}
|
|
2770
|
+
return smallest;
|
|
2771
|
+
}
|
|
2772
|
+
function mergePatternArrays(fieldPath, inputs) {
|
|
2773
|
+
const docIds = new GrowableUint32(1);
|
|
2774
|
+
for (const input of inputs) remapAscending(input.arrays.docIds, input.remap, docIds);
|
|
2775
|
+
sortTailIfUnordered(docIds, 0);
|
|
2776
|
+
const runs = new GrowableUint32(PATTERN_RUN_CODE_POINTS);
|
|
2777
|
+
const offsets = new GrowableUint32(1);
|
|
2778
|
+
const postings = new GrowableUint32(1);
|
|
2779
|
+
offsets.push(0);
|
|
2780
|
+
const cursors = inputs.map(() => 0);
|
|
2781
|
+
for (let smallest = smallestRun(inputs, cursors); smallest >= 0; smallest = smallestRun(inputs, cursors)) {
|
|
2782
|
+
const source = inputs[smallest].arrays.runs;
|
|
2783
|
+
const at = cursors[smallest] * PATTERN_RUN_CODE_POINTS;
|
|
2784
|
+
const first = source[at];
|
|
2785
|
+
const second = source[at + 1];
|
|
2786
|
+
const third = source[at + 2];
|
|
2787
|
+
const before = postings.length;
|
|
2788
|
+
for (let input = 0; input < inputs.length; input++) {
|
|
2789
|
+
const { arrays, remap } = inputs[input];
|
|
2790
|
+
const run = cursors[input];
|
|
2791
|
+
if (run >= arrays.offsets.length - 1) continue;
|
|
2792
|
+
const runAt = run * PATTERN_RUN_CODE_POINTS;
|
|
2793
|
+
if (arrays.runs[runAt] !== first || arrays.runs[runAt + 1] !== second || arrays.runs[runAt + 2] !== third) {
|
|
2794
|
+
continue;
|
|
2795
|
+
}
|
|
2796
|
+
remapAscending(arrays.postings.subarray(arrays.offsets[run], arrays.offsets[run + 1]), remap, postings);
|
|
2797
|
+
cursors[input] = run + 1;
|
|
2798
|
+
}
|
|
2799
|
+
if (postings.length === before) continue;
|
|
2800
|
+
sortTailIfUnordered(postings, before);
|
|
2801
|
+
runs.push(first);
|
|
2802
|
+
runs.push(second);
|
|
2803
|
+
runs.push(third);
|
|
2804
|
+
offsets.push(postings.length);
|
|
2805
|
+
}
|
|
2806
|
+
return trimmedArrays(fieldPath, docIds, runs, offsets, postings);
|
|
2807
|
+
}
|
|
2808
|
+
|
|
2809
|
+
// src/filters/constants.ts
|
|
2810
|
+
var MAX_FILTER_DEPTH = 30;
|
|
2811
|
+
var MAX_FILTER_TESTS = 1024;
|
|
2812
|
+
var FILTER_OPERAND_COPY_DEPTH = 3;
|
|
2813
|
+
var MAX_FILTER_ARRAY_SIZE = 65536;
|
|
2814
|
+
var GEO_UNIT_METRES = { km: 1e3, mi: 1609.344, m: 1 };
|
|
2815
|
+
|
|
2816
|
+
// src/filters/operands/checks.ts
|
|
2817
|
+
function operandKindOf(type) {
|
|
2818
|
+
if (type === void 0) return void 0;
|
|
2819
|
+
if (type === "number" || type === "number[]") return "number";
|
|
2820
|
+
if (type === "boolean" || type === "boolean[]") return "boolean";
|
|
2821
|
+
if (type === "geopoint") return "geopoint";
|
|
2822
|
+
if (type.startsWith("vector[")) return "vector";
|
|
2823
|
+
return "text";
|
|
2824
|
+
}
|
|
2825
|
+
function isFiniteNumber(value) {
|
|
2826
|
+
return typeof value === "number" && Number.isFinite(value);
|
|
2827
|
+
}
|
|
2828
|
+
function kindOfValue(value) {
|
|
2829
|
+
if (isFiniteNumber(value)) return "number";
|
|
2830
|
+
if (typeof value === "boolean") return "boolean";
|
|
2831
|
+
if (typeof value === "string") return "text";
|
|
2832
|
+
return void 0;
|
|
2833
|
+
}
|
|
2834
|
+
function isObjectRecord(value) {
|
|
2835
|
+
return value !== null && typeof value === "object" && !Array.isArray(value);
|
|
2836
|
+
}
|
|
2837
|
+
function invalid(message, fieldPath, operator) {
|
|
2838
|
+
throw new NarsilError(ErrorCodes.SEARCH_INVALID_FILTER, message, { fieldPath, operator });
|
|
2839
|
+
}
|
|
2840
|
+
function requireFieldKind(fieldPath, operator, type, accepted) {
|
|
2841
|
+
const kind = operandKindOf(type);
|
|
2842
|
+
if (kind === void 0 || accepted.includes(kind)) return;
|
|
2843
|
+
invalid(
|
|
2844
|
+
`The engine applies "${operator}" to ${accepted.join(" or ")} fields alone, and the schema declares field "${fieldPath}" as "${type}"`,
|
|
2845
|
+
fieldPath,
|
|
2846
|
+
operator
|
|
2847
|
+
);
|
|
2848
|
+
}
|
|
2849
|
+
function requireTextRangeField(fieldPath, operator, type) {
|
|
2850
|
+
const parsed = parsedTypeOf(type);
|
|
2851
|
+
if (parsed?.sortable && (parsed.base === "string" || parsed.base === "verbatim")) return;
|
|
2852
|
+
const declared = type === void 0 ? `the schema has no field "${fieldPath}"` : `field "${fieldPath}" has type "${type}"`;
|
|
2853
|
+
invalid(
|
|
2854
|
+
`The engine applies "${operator}" with a text bound to a "string" or "verbatim" field whose type includes "sortable", but ${declared}`,
|
|
2855
|
+
fieldPath,
|
|
2856
|
+
operator
|
|
2857
|
+
);
|
|
2858
|
+
}
|
|
2859
|
+
function requireListLength(fieldPath, operator, values) {
|
|
2860
|
+
if (values.length <= MAX_FILTER_ARRAY_SIZE) return;
|
|
2861
|
+
invalid(
|
|
2862
|
+
`"${operator}" on field "${fieldPath}" holds ${values.length} values, while a filter list holds at most ${MAX_FILTER_ARRAY_SIZE}`,
|
|
2863
|
+
fieldPath,
|
|
2864
|
+
operator
|
|
2865
|
+
);
|
|
2866
|
+
}
|
|
2867
|
+
|
|
2868
|
+
// src/pattern/operands.ts
|
|
2869
|
+
function requireTextLength(fieldPath, operator, text) {
|
|
2870
|
+
if (!exceedsCodePoints(text, MAX_PATTERN_TEXT_CODE_POINTS)) return;
|
|
2871
|
+
invalid(
|
|
2872
|
+
`The text of "${operator}" on pattern field "${fieldPath}" holds more than ${MAX_PATTERN_TEXT_CODE_POINTS} code points`,
|
|
2873
|
+
fieldPath,
|
|
2874
|
+
operator
|
|
2875
|
+
);
|
|
2876
|
+
}
|
|
2877
|
+
function requirePatternText(fieldPath, operator, text, caseFold, host) {
|
|
2878
|
+
requireTextLength(fieldPath, operator, text);
|
|
2879
|
+
if (caseFold && foldedCodePointCount(text, host) > MAX_PATTERN_POSITIONS) {
|
|
2880
|
+
invalid(
|
|
2881
|
+
`The text of "${operator}" on pattern field "${fieldPath}" has a case fold of more than ${MAX_PATTERN_POSITIONS} code points, while a pattern holds at most ${MAX_PATTERN_POSITIONS} positions`,
|
|
2882
|
+
fieldPath,
|
|
2883
|
+
operator
|
|
2884
|
+
);
|
|
2885
|
+
}
|
|
2886
|
+
}
|
|
2887
|
+
function requireExpressions(fieldPath, filter, host) {
|
|
2888
|
+
for (const operator of PATTERN_EXPRESSION_OPERATORS) {
|
|
2889
|
+
const pattern = filter[operator];
|
|
2890
|
+
if (typeof pattern !== "string") continue;
|
|
2891
|
+
requireTextLength(fieldPath, operator, pattern);
|
|
2892
|
+
checkExpression(operator, pattern, filter.caseFold === true, fieldPath, host);
|
|
2893
|
+
}
|
|
2894
|
+
}
|
|
2895
|
+
function requireTolerance(fieldPath, filter, host) {
|
|
2896
|
+
const { tolerance, eq } = filter;
|
|
2897
|
+
if (tolerance === void 0) return;
|
|
2898
|
+
if (!isPatternTolerance(tolerance)) {
|
|
2899
|
+
invalid(`"tolerance" on field "${fieldPath}" must be 0, 1, 2, or "auto"`, fieldPath, "tolerance");
|
|
2900
|
+
}
|
|
2901
|
+
if (typeof eq !== "string") {
|
|
2902
|
+
invalid(
|
|
2903
|
+
`"tolerance" applies only to an "eq" test, while the filter on field "${fieldPath}" sets no "eq" with text`,
|
|
2904
|
+
fieldPath,
|
|
2905
|
+
"tolerance"
|
|
2906
|
+
);
|
|
2907
|
+
}
|
|
2908
|
+
if (tolerance === 0 || tolerance === "auto") return;
|
|
2909
|
+
const text = foldTypoText(eq, host);
|
|
2910
|
+
const requiredRuns2 = typoRunsNeeded(tolerance, text.longestFold);
|
|
2911
|
+
const distinctRuns = distinctTypoRunCount(text, requiredRuns2);
|
|
2912
|
+
if (distinctRuns >= requiredRuns2) return;
|
|
2913
|
+
throw new NarsilError(
|
|
2914
|
+
ErrorCodes.SEARCH_INVALID_FILTER,
|
|
2915
|
+
`A tolerance of ${tolerance} on "eq" of pattern field "${fieldPath}" needs ${requiredRuns2} distinct runs of three code points in the case fold of the text, while the text holds ${distinctRuns}. Lengthen the text, lower the tolerance, or set it to "auto"`,
|
|
2916
|
+
{ fieldPath, operator: "tolerance", requiredRuns: requiredRuns2, distinctRuns }
|
|
2917
|
+
);
|
|
2918
|
+
}
|
|
2919
|
+
function checkPatternOperands(fieldPath, filter, host) {
|
|
2920
|
+
requireExpressions(fieldPath, filter, host);
|
|
2921
|
+
const caseFold = filter.caseFold === true;
|
|
2922
|
+
for (const operator of PATTERN_TEST_OPERATORS) {
|
|
2923
|
+
const operand = filter[operator];
|
|
2924
|
+
if (typeof operand === "string") requirePatternText(fieldPath, operator, operand, caseFold, host);
|
|
2925
|
+
if (!Array.isArray(operand)) continue;
|
|
2926
|
+
for (const text of operand) {
|
|
2927
|
+
if (typeof text === "string") requirePatternText(fieldPath, operator, text, caseFold, host);
|
|
2928
|
+
}
|
|
2929
|
+
}
|
|
2930
|
+
for (const operator of PATTERN_ELEMENT_OPERATORS) {
|
|
2931
|
+
const operand = filter[operator];
|
|
2932
|
+
if (!Array.isArray(operand)) continue;
|
|
2933
|
+
for (const text of operand) {
|
|
2934
|
+
if (typeof text === "string") requirePatternText(fieldPath, operator, text, false, host);
|
|
2935
|
+
}
|
|
2936
|
+
}
|
|
2937
|
+
requireTolerance(fieldPath, filter, host);
|
|
2938
|
+
}
|
|
2939
|
+
|
|
2940
|
+
// src/pattern/snapshot.ts
|
|
2941
|
+
function loadFailed(fieldPath, problem) {
|
|
2942
|
+
return new NarsilError(
|
|
2943
|
+
ErrorCodes.PERSISTENCE_LOAD_FAILED,
|
|
2944
|
+
`The pattern index of field "${fieldPath}" in this partition is corrupt: ${problem}`,
|
|
2945
|
+
{ field: fieldPath }
|
|
2946
|
+
);
|
|
2947
|
+
}
|
|
2948
|
+
function serializePatternIndex(fieldPath, index, toExternal) {
|
|
2949
|
+
const arrays = index.toArrays(fieldPath, null);
|
|
2950
|
+
const positionOf = /* @__PURE__ */ new Map();
|
|
2951
|
+
const docIds = [];
|
|
2952
|
+
for (const ordinal of arrays.docIds) {
|
|
2953
|
+
const externalId = toExternal(ordinal);
|
|
2954
|
+
if (externalId === void 0) continue;
|
|
2955
|
+
positionOf.set(ordinal, docIds.length);
|
|
2956
|
+
docIds.push(externalId);
|
|
2957
|
+
}
|
|
2958
|
+
const runs = /* @__PURE__ */ Object.create(null);
|
|
2959
|
+
for (let run = 0; run + 1 < arrays.offsets.length; run++) {
|
|
2960
|
+
const positions = [];
|
|
2961
|
+
for (let at = arrays.offsets[run]; at < arrays.offsets[run + 1]; at++) {
|
|
2962
|
+
const position = positionOf.get(arrays.postings[at]);
|
|
2963
|
+
if (position !== void 0) positions.push(position);
|
|
2964
|
+
}
|
|
2965
|
+
if (positions.length === 0) continue;
|
|
2966
|
+
const base = run * PATTERN_RUN_CODE_POINTS;
|
|
2967
|
+
runs[String.fromCodePoint(arrays.runs[base], arrays.runs[base + 1], arrays.runs[base + 2])] = positions;
|
|
2968
|
+
}
|
|
2969
|
+
return { docIds, runs };
|
|
2970
|
+
}
|
|
2971
|
+
function appendRunCodePoints(fieldPath, key, out) {
|
|
2972
|
+
const start = out.length;
|
|
2973
|
+
for (const character of key) out.push(character.codePointAt(0) ?? 0);
|
|
2974
|
+
const count = out.length - start;
|
|
2975
|
+
if (count !== PATTERN_RUN_CODE_POINTS) {
|
|
2976
|
+
throw loadFailed(
|
|
2977
|
+
fieldPath,
|
|
2978
|
+
`the key "${key}" holds ${count} code points, while each key must hold ${PATTERN_RUN_CODE_POINTS}`
|
|
2979
|
+
);
|
|
2980
|
+
}
|
|
2981
|
+
}
|
|
2982
|
+
function requirePositions(fieldPath, key, list, documentCount) {
|
|
2983
|
+
if (!Array.isArray(list)) throw loadFailed(fieldPath, `the run "${key}" must map to a list of positions`);
|
|
2984
|
+
let previous = -1;
|
|
2985
|
+
for (const position of list) {
|
|
2986
|
+
if (!Number.isInteger(position) || position < 0 || position >= documentCount) {
|
|
2987
|
+
throw loadFailed(fieldPath, `the run "${key}" names position ${String(position)} outside its document list`);
|
|
2988
|
+
}
|
|
2989
|
+
if (position <= previous) {
|
|
2990
|
+
throw loadFailed(fieldPath, `the positions of the run "${key}" are out of ascending order`);
|
|
2991
|
+
}
|
|
2992
|
+
previous = position;
|
|
2993
|
+
}
|
|
2994
|
+
return list;
|
|
2995
|
+
}
|
|
2996
|
+
function requireDistinctDocuments(fieldPath, docIds) {
|
|
2997
|
+
const seen = /* @__PURE__ */ new Set();
|
|
2998
|
+
for (const docId of docIds) {
|
|
2999
|
+
if (seen.has(docId)) throw loadFailed(fieldPath, `the document list names "${docId}" twice`);
|
|
3000
|
+
seen.add(docId);
|
|
3001
|
+
}
|
|
3002
|
+
}
|
|
3003
|
+
function decodePatternIndex(fieldPath, entry) {
|
|
3004
|
+
requireDistinctDocuments(fieldPath, entry.docIds);
|
|
3005
|
+
const runs = [];
|
|
3006
|
+
const offsets = [0];
|
|
3007
|
+
const postings = [];
|
|
3008
|
+
for (const [key, list] of Object.entries(entry.runs)) {
|
|
3009
|
+
appendRunCodePoints(fieldPath, key, runs);
|
|
3010
|
+
for (const position of requirePositions(fieldPath, key, list, entry.docIds.length)) postings.push(position);
|
|
3011
|
+
offsets.push(postings.length);
|
|
3012
|
+
}
|
|
3013
|
+
const positions = new Uint32Array(entry.docIds.length);
|
|
3014
|
+
for (let position = 0; position < positions.length; position++) positions[position] = position;
|
|
3015
|
+
return {
|
|
3016
|
+
fieldPath,
|
|
3017
|
+
docIds: positions,
|
|
3018
|
+
runs: Uint32Array.from(runs),
|
|
3019
|
+
offsets: Uint32Array.from(offsets),
|
|
3020
|
+
postings: Uint32Array.from(postings)
|
|
3021
|
+
};
|
|
3022
|
+
}
|
|
3023
|
+
|
|
3024
|
+
// src/pattern/module.ts
|
|
3025
|
+
var patternSearchModule = {
|
|
3026
|
+
name: "pattern",
|
|
3027
|
+
storedValues: storedValuesOf,
|
|
3028
|
+
createIndex: createGrowingPatternIndex,
|
|
3029
|
+
readArrays: readPatternArrays,
|
|
3030
|
+
mergeArrays: mergePatternArrays,
|
|
3031
|
+
matchInto: matchPattern,
|
|
3032
|
+
checkExpression,
|
|
3033
|
+
expressionFootprint,
|
|
3034
|
+
largestFootprint: largestPatternFootprintIn,
|
|
3035
|
+
checkOperands: checkPatternOperands,
|
|
3036
|
+
evaluateTests: evaluatePatternTests,
|
|
3037
|
+
serializeIndex: serializePatternIndex,
|
|
3038
|
+
decodeIndex: decodePatternIndex
|
|
3039
|
+
};
|
|
3040
|
+
|
|
3041
|
+
export { DEFAULT_PATTERN_WORK_CAP, FILTER_OPERAND_COPY_DEPTH, GEO_UNIT_METRES, GrowableUint32, MATCHER_STATE_BUDGET_BYTES, MAX_FILTER_ARRAY_SIZE, MAX_FILTER_DEPTH, MAX_FILTER_TESTS, PATTERN_ELEMENT_OPERATORS, PATTERN_EXPRESSION_OPERATORS, PATTERN_TEST_OPERATORS, PATTERN_WORK_FLUSH_UNITS, TYPO_CLAIM_SLOTS_PER_WORD, bitsetAndInto, bitsetAndNotInto, bitsetClear, bitsetFromSet, bitsetHas, bitsetIsEmpty, bitsetIterator, bitsetOrInto, bitsetSet, boundedLevenshtein, buildStoredValues, cachedStoredFields, checkedSize, claimsTypoPreparation, createBitSet, discardStoredValues, fuzzyPrefixOf, fuzzyTermMatches, installStoredFields, invalid, isFiniteNumber, isObjectRecord, isPatternTolerance, kindOfValue, matchPattern, patternSearchModule, prepareStoredValues, requireFieldKind, requireListLength, requireTextRangeField, storedText, storedValueBytes, storedValuesOf };
|