@delali/narsil 0.3.1-next.144 → 0.3.1-next.146
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.d.ts +1 -1
- package/dist/adapters/filesystem.mjs +101 -13
- package/dist/adapters/gcs.d.ts +49 -0
- package/dist/adapters/gcs.mjs +213 -0
- package/dist/adapters/indexeddb.d.ts +1 -1
- package/dist/adapters/indexeddb.mjs +2 -7
- package/dist/adapters/memory.d.ts +1 -1
- package/dist/adapters/memory.mjs +5 -0
- package/dist/adapters/s3.d.ts +53 -0
- package/dist/adapters/s3.mjs +263 -0
- package/dist/{adapters-BQFQ4PRz.d.ts → adapters-pljAqmrC.d.ts} +33 -0
- package/dist/analysis-change-ZCJNYBJM.mjs +39 -0
- package/dist/{browser/analysis-change-entry-7HR4LWL3.mjs → analysis-change-entry-YN3ELL6C.mjs} +1 -1
- package/dist/browser/{analysis-change-JPV775LR.mjs → analysis-change-M65AZQQG.mjs} +8 -5
- package/dist/{analysis-change-entry-TZTG4AZB.mjs → browser/analysis-change-entry-H3YIOLXZ.mjs} +1 -1
- package/dist/browser/{chunk-VFYMPCOV.mjs → chunk-2JABMB4S.mjs} +10 -6
- package/dist/{chunk-46NZOPHS.mjs → browser/chunk-4DYLCICG.mjs} +2 -2
- package/dist/browser/{chunk-MZI3TEOW.mjs → chunk-4RD3AFSB.mjs} +1 -1
- package/dist/browser/{chunk-WCFCHIBB.mjs → chunk-5V74FFZE.mjs} +2 -2
- package/dist/{chunk-NN33CZRE.mjs → browser/chunk-6OWX3OP2.mjs} +2 -2
- package/dist/browser/chunk-BRWY3JCN.mjs +678 -0
- package/dist/browser/{chunk-5DB2VDGI.mjs → chunk-BVX2MEHA.mjs} +306 -607
- package/dist/browser/{chunk-KTOK275N.mjs → chunk-D6UFGBF5.mjs} +15 -45
- package/dist/browser/{chunk-D33A5VMU.mjs → chunk-IAXZAVYL.mjs} +25 -66
- package/dist/browser/chunk-JNOAKDUM.mjs +31 -0
- package/dist/browser/{chunk-LVY2LI35.mjs → chunk-KAEVGLYN.mjs} +2 -2
- package/dist/browser/{chunk-3ZBJYAS4.mjs → chunk-LURXVCHG.mjs} +1 -1
- package/dist/browser/chunk-MPK76GVS.mjs +63 -0
- package/dist/browser/{chunk-ZEV26AQ6.mjs → chunk-NVEJJP4R.mjs} +1 -1
- package/dist/browser/{chunk-HKX2G6WH.mjs → chunk-ODQP7P3H.mjs} +455 -66
- package/dist/browser/{chunk-35B42UFM.mjs → chunk-PIS7ZAP7.mjs} +12 -25
- package/dist/browser/{chunk-TCLEOZ4P.mjs → chunk-QMNZFFD3.mjs} +4 -3
- package/dist/browser/{chunk-R4WUDZQV.mjs → chunk-SRL47USS.mjs} +2 -2
- package/dist/browser/chunk-TY7L6OXO.mjs +69 -0
- package/dist/browser/{chunk-MVM33ZUL.mjs → chunk-W643QV3L.mjs} +6 -5
- package/dist/browser/chunk-WXLBZJMT.mjs +25 -0
- package/dist/browser/{chunk-MWUK3DA5.mjs → chunk-XILIT5MT.mjs} +8 -8
- package/dist/browser/{cold-module-MJMKNUYJ.mjs → cold-module-A5S6JFDN.mjs} +20 -20
- package/dist/browser/{durability-wiring-SNOWIT6Z.mjs → durability-wiring-W5AVV3RF.mjs} +120 -80
- package/dist/browser/gzip-5S7ROJFJ.mjs +1 -0
- package/dist/browser/import-PTT63AGK.mjs +12 -0
- package/dist/browser/{module-BUFNZMEU.mjs → module-CEKA7MQH.mjs} +13 -10
- package/dist/browser/module-X5PGOE47.mjs +4288 -0
- package/dist/browser/{phrase-module-HGVBO24W.mjs → phrase-module-CNKMUY4U.mjs} +2 -1
- package/dist/browser/pool-DTYSPBMQ.mjs +296 -0
- package/dist/{restore-queue-FEYAC4SB.mjs → browser/restore-queue-DD4LWZK7.mjs} +2 -2
- package/dist/browser/{runtime-VEUH674B.mjs → runtime-D2ULZGCN.mjs} +3 -2
- package/dist/browser/{snapshot-QXBKHJAG.mjs → snapshot-DQ6A4PQP.mjs} +20 -15
- package/dist/browser/{write-WHFBDWQS.mjs → write-MAGRAIEH.mjs} +14 -11
- package/dist/{capabilities-BCdUwK_L.d.ts → capabilities-BT-HLDC8.d.ts} +3 -3
- package/dist/{chunk-O4LJQI4G.mjs → chunk-2HJWQPR6.mjs} +126 -4
- package/dist/{chunk-Z4HFMYNX.mjs → chunk-3BVGJ4JR.mjs} +36 -13
- package/dist/{chunk-ZPWS2SKJ.mjs → chunk-3HV7M5OJ.mjs} +272 -112
- package/dist/{chunk-UIKN2OTQ.mjs → chunk-3MXV3VHR.mjs} +2 -23
- package/dist/{browser/chunk-CCOAOO73.mjs → chunk-3SBJVQLL.mjs} +2 -2
- package/dist/chunk-3TVDTACC.mjs +104 -0
- package/dist/{chunk-YH5OIL7B.mjs → chunk-5QMHMELB.mjs} +6 -1
- package/dist/{chunk-SBMAWTRG.mjs → chunk-5WB2A3XU.mjs} +84 -15
- package/dist/{chunk-NPNK57CA.mjs → chunk-65WCV5JO.mjs} +1 -1
- package/dist/chunk-6BWLDLS3.mjs +58 -0
- package/dist/{chunk-UUZCQQG2.mjs → chunk-6C5EX2QR.mjs} +3 -3
- package/dist/{chunk-VEFN6X6Q.mjs → chunk-6F6USYII.mjs} +120 -13
- package/dist/{chunk-AST3SHFA.mjs → chunk-7HKWO4BJ.mjs} +7 -7
- package/dist/{chunk-W2COJ5AH.mjs → chunk-7N223GWV.mjs} +2 -2
- package/dist/{chunk-GWOS5DYC.mjs → chunk-ADBS5XRI.mjs} +11 -13
- package/dist/{chunk-TNBIK2LQ.mjs → chunk-AWNHDBKV.mjs} +430 -75
- package/dist/{chunk-ZMBFWQXN.mjs → chunk-B2FTZNNF.mjs} +2 -2
- package/dist/chunk-B7XIOAMK.mjs +100 -0
- package/dist/{chunk-W55X2BYN.mjs → chunk-BEZH7VEH.mjs} +1 -1
- package/dist/{chunk-QSK35UC2.mjs → chunk-BTPGQC6Z.mjs} +3 -11
- package/dist/{chunk-LA4WNDHL.mjs → chunk-CYYSZPVV.mjs} +12 -14
- package/dist/{chunk-SRJBFG2T.mjs → chunk-DOY6EG76.mjs} +6 -7
- package/dist/{chunk-6SNBQESJ.mjs → chunk-F22IOCR2.mjs} +10 -6
- package/dist/{chunk-J6YVB2XM.mjs → chunk-IJPK5PGM.mjs} +1 -1
- package/dist/{chunk-L76W3IZJ.mjs → chunk-IRWP524D.mjs} +1 -1
- package/dist/{chunk-XS2VM7UE.mjs → chunk-IZT3G24Q.mjs} +2 -2
- package/dist/{chunk-NOT5QOHU.mjs → chunk-J7M73VY7.mjs} +1 -1
- package/dist/chunk-K5HSUPYS.mjs +11 -0
- package/dist/chunk-KAKQ74LS.mjs +53 -0
- package/dist/{chunk-ZSWHPKGM.mjs → chunk-KYVRZAYP.mjs} +69 -2
- package/dist/{chunk-NRUXBYPH.mjs → chunk-KZ5GQE4Z.mjs} +5 -5
- package/dist/{browser/chunk-XNWPP5NS.mjs → chunk-KZQIVGW7.mjs} +2 -2
- package/dist/{chunk-KZL72VTC.mjs → chunk-L7TIAYPX.mjs} +11 -10
- package/dist/{chunk-DD2673TX.mjs → chunk-LDGGR7YT.mjs} +4 -81
- package/dist/{chunk-XZ3SRNDJ.mjs → chunk-LJ4ENXOD.mjs} +77 -16
- package/dist/chunk-LQG5G2LY.mjs +39 -0
- package/dist/{chunk-HNHCNTVG.mjs → chunk-MDF6PDIA.mjs} +11 -0
- package/dist/{chunk-74XB2SXI.mjs → chunk-NVTFQFUL.mjs} +16 -2
- package/dist/{chunk-BOJZGUS6.mjs → chunk-NYSONUB7.mjs} +1 -1
- package/dist/{chunk-WJGO5PGV.mjs → chunk-O4KUNDVF.mjs} +31 -17
- package/dist/{chunk-PWIWSUCX.mjs → chunk-POUYICOU.mjs} +1 -1
- package/dist/{chunk-EBIHRL7B.mjs → chunk-Q2UL2TPC.mjs} +1 -1
- package/dist/{chunk-NJJCPFXN.mjs → chunk-QEYF2SQ6.mjs} +2 -2
- package/dist/{chunk-7AUASRE7.mjs → chunk-QN5WVV5K.mjs} +7 -7
- package/dist/{chunk-RIIUZJQ3.mjs → chunk-QYRNLLLI.mjs} +1 -1
- package/dist/chunk-SOUZMPME.mjs +1635 -0
- package/dist/{chunk-C3YDYX6C.mjs → chunk-T4CJDBBE.mjs} +1 -1
- package/dist/{chunk-YLNSJQLX.mjs → chunk-TTCKT2RT.mjs} +5 -5
- package/dist/{chunk-KEIYVZUX.mjs → chunk-U2726TL5.mjs} +5 -5
- package/dist/{chunk-RKAVHNRW.mjs → chunk-U46IZNCW.mjs} +10 -5
- package/dist/{chunk-BRUUBXCB.mjs → chunk-U6NE6RCV.mjs} +10 -38
- package/dist/{chunk-VJEGOELZ.mjs → chunk-VP6XRMWR.mjs} +4 -4
- package/dist/{chunk-IO5F7ZBE.mjs → chunk-VQDZVWN3.mjs} +874 -413
- package/dist/{chunk-IWVEG5CX.mjs → chunk-XIHUI4KB.mjs} +2 -2
- package/dist/{chunk-YHUTF6EA.mjs → chunk-XKPNKR3V.mjs} +17 -47
- package/dist/{chunk-HJJWY6PT.mjs → chunk-YGQOPB2Z.mjs} +1 -1
- package/dist/chunk-YKEHQUSZ.mjs +248 -0
- package/dist/{chunk-GLZHNSGB.mjs → chunk-ZAYWOHVG.mjs} +1 -1
- package/dist/{chunk-ICW45TTU.mjs → chunk-ZEKDO7YX.mjs} +2 -2
- package/dist/chunk-ZXNNR73R.mjs +31 -0
- package/dist/{chunk-VJS4JFBQ.mjs → chunk-ZXX5GZEX.mjs} +3 -1
- package/dist/{chunk-RHKRTYGO.mjs → chunk-ZYKUD5NX.mjs} +9 -7
- package/dist/{client-B12YFALP.d.ts → client-Cn3gNxUU.d.ts} +62 -5
- package/dist/client.d.ts +8 -8
- package/dist/client.mjs +46 -0
- package/dist/{cold-module-4X7WJCFM.mjs → cold-module-2WWGBFJC.mjs} +43 -49
- package/dist/{config-CIG5yDyg.d.ts → config-CfhH1IWQ.d.ts} +150 -3
- package/dist/{config-BhZxIeb1.d.ts → config-aIsy7mcL.d.ts} +63 -3
- package/dist/direct-executor-QLVHMELJ.mjs +24 -0
- package/dist/distribution/coordinator/etcd.d.ts +3 -3
- package/dist/distribution/coordinator/etcd.mjs +1 -1
- package/dist/distribution/coordinator/in-memory.d.ts +3 -3
- package/dist/distribution/transport/grpc.mjs +4 -4
- package/dist/distribution/transport/in-memory.mjs +2 -2
- package/dist/distribution/transport/tcp.mjs +3 -3
- package/dist/distribution.d.ts +8 -8
- package/dist/distribution.mjs +16116 -14537
- package/dist/{durability-wiring-324D2DDD.mjs → durability-wiring-GNWQSZI3.mjs} +142 -109
- package/dist/embeddings/openai.d.ts +1 -1
- package/dist/embeddings/openai.mjs +2 -2
- package/dist/{engine-CtzbHOmG.d.ts → engine-CJRUHXgf.d.ts} +3 -3
- package/dist/gzip-F4HMIEEQ.mjs +1 -0
- package/dist/import-DX55PN4G.mjs +41 -0
- package/dist/{index-DsEurhSl.d.ts → index-MsF7e5hL.d.ts} +2 -2
- package/dist/index.browser.mjs +7 -4
- package/dist/index.d.ts +542 -8
- package/dist/index.mjs +29 -32
- package/dist/index.react-native.mjs +19 -0
- package/dist/invalidation/broadcast-channel.d.ts +1 -1
- package/dist/invalidation/filesystem.d.ts +1 -1
- package/dist/invalidation/filesystem.mjs +1 -1
- package/dist/invalidation/noop.d.ts +1 -1
- package/dist/{long-query-thread-4SW7RWDE.mjs → long-query-thread-SCUE62TO.mjs} +23 -25
- package/dist/{module-DXSJ5LT2.mjs → module-HW6IXUM6.mjs} +603 -112
- package/dist/module-V5K4ZP23.mjs +45 -0
- package/dist/{paged-partition-archive-HFP45PLU.mjs → paged-partition-archive-FDIIWZNR.mjs} +42 -41
- package/dist/partial-words.mjs +7 -9
- package/dist/pattern.mjs +4 -6
- package/dist/persistence/durability/checkpoint-worker.d.ts +2 -2
- package/dist/persistence/durability/checkpoint-worker.mjs +36 -39
- package/dist/{phrase-module-5QHBD2VJ.mjs → phrase-module-OUQIRUQU.mjs} +1 -1
- package/dist/pool-UPV5PVPY.mjs +298 -0
- package/dist/react-native/chunks/analysis-change-HGW3L6NY.mjs +893 -0
- package/dist/react-native/chunks/analysis-change-entry-BNRU6STO.mjs +1 -0
- package/dist/react-native/chunks/chunk-2J2727V4.mjs +495 -0
- package/dist/react-native/chunks/chunk-3CTWSQRW.mjs +1251 -0
- package/dist/react-native/chunks/chunk-5FV4ZEVA.mjs +2619 -0
- package/dist/react-native/chunks/chunk-7VWQLEFV.mjs +642 -0
- package/dist/react-native/chunks/chunk-AAAETEJK.mjs +27 -0
- package/dist/react-native/chunks/chunk-AM7RSBPF.mjs +32 -0
- package/dist/react-native/chunks/chunk-B6OD63Z3.mjs +997 -0
- package/dist/react-native/chunks/chunk-BRNAVOKP.mjs +177 -0
- package/dist/react-native/chunks/chunk-DKJTZ625.mjs +207 -0
- package/dist/react-native/chunks/chunk-FKGG4UOF.mjs +177 -0
- package/dist/{browser/chunk-6RHTAVZX.mjs → react-native/chunks/chunk-GV5KFQ6M.mjs} +38 -15
- package/dist/react-native/chunks/chunk-HURV3ASY.mjs +4416 -0
- package/dist/react-native/chunks/chunk-IO2SMUQD.mjs +10 -0
- package/dist/react-native/chunks/chunk-JV6VQY2S.mjs +17 -0
- package/dist/react-native/chunks/chunk-KUJOBRKS.mjs +217 -0
- package/dist/react-native/chunks/chunk-KWRW5U65.mjs +226 -0
- package/dist/react-native/chunks/chunk-L4M7QJNP.mjs +110 -0
- package/dist/react-native/chunks/chunk-LQ6Q4L5B.mjs +360 -0
- package/dist/react-native/chunks/chunk-LQAKO5QV.mjs +523 -0
- package/dist/react-native/chunks/chunk-LRGWK367.mjs +11 -0
- package/dist/react-native/chunks/chunk-LVIKKAA6.mjs +93 -0
- package/dist/react-native/chunks/chunk-NFGBOI46.mjs +14 -0
- package/dist/react-native/chunks/chunk-NNE4VDMM.mjs +8 -0
- package/dist/react-native/chunks/chunk-PPEPTUVV.mjs +56 -0
- package/dist/react-native/chunks/chunk-PSWKQVVT.mjs +9 -0
- package/dist/{chunk-KGOXHLLZ.mjs → react-native/chunks/chunk-PU55IOG4.mjs} +228 -11
- package/dist/react-native/chunks/chunk-QC4ZRBSX.mjs +270 -0
- package/dist/react-native/chunks/chunk-R4EEMYM6.mjs +21 -0
- package/dist/react-native/chunks/chunk-R4OPUZQ5.mjs +86 -0
- package/dist/react-native/chunks/chunk-SLGIAD6B.mjs +2634 -0
- package/dist/react-native/chunks/chunk-TJMSKBEM.mjs +25 -0
- package/dist/react-native/chunks/chunk-TLYD7IJ2.mjs +23 -0
- package/dist/react-native/chunks/chunk-UFNCLEQM.mjs +73 -0
- package/dist/react-native/chunks/chunk-YH7W556M.mjs +179 -0
- package/dist/react-native/chunks/chunk-YJSMEKRE.mjs +22385 -0
- package/dist/react-native/chunks/chunk-ZCKNBPQ4.mjs +79 -0
- package/dist/react-native/chunks/cold-module-TSFWLYWC.mjs +755 -0
- package/dist/react-native/chunks/durability-wiring-PZR6KOQK.mjs +4509 -0
- package/dist/react-native/chunks/gzip.react-native-7JWCLVOB.mjs +3 -0
- package/dist/react-native/chunks/import-VTODLPLO.mjs +22 -0
- package/dist/{browser/module-BVP4TKZU.mjs → react-native/chunks/module-JBBH6PZH.mjs} +671 -146
- package/dist/react-native/chunks/module-VEK2KCKU.mjs +25 -0
- package/dist/react-native/chunks/phrase-module-76UAPPSG.mjs +329 -0
- package/dist/react-native/chunks/pool-CD4ANYUI.mjs +296 -0
- package/dist/react-native/chunks/release-D7ZTIANM.mjs +33 -0
- package/dist/react-native/chunks/replace-IMZUVUOE.mjs +57 -0
- package/dist/{browser/restore-queue-ONYNYUDE.mjs → react-native/chunks/restore-queue-OI5EH7R3.mjs} +2 -2
- package/dist/react-native/chunks/runtime-3MCDLJAF.mjs +559 -0
- package/dist/react-native/chunks/snapshot-AUZMEV36.mjs +1205 -0
- package/dist/react-native/chunks/write-DDC2QBRJ.mjs +197 -0
- package/dist/{chunk-DQNKVOJ2.mjs → react-native/partial-words.mjs} +13 -228
- package/dist/react-native/pattern.mjs +2442 -0
- package/dist/react-native/synonyms.mjs +460 -0
- package/dist/react.d.ts +11 -11
- package/dist/react.mjs +11 -0
- package/dist/{rerank-KTLC3E6N.mjs → rerank-3W54N6P2.mjs} +4 -4
- package/dist/rerankers/http.d.ts +1 -1
- package/dist/rerankers/http.mjs +2 -2
- package/dist/restore-queue-BQWWNNQI.mjs +41 -0
- package/dist/{runtime-DYV75DCB.mjs → runtime-L2DZYY6N.mjs} +5 -5
- package/dist/{schema-B-Runv0n.d.ts → schema-D33CyXCy.d.ts} +1 -1
- package/dist/server.d.ts +24 -12
- package/dist/server.mjs +159 -38
- package/dist/{snapshot-CGM65VCD.mjs → snapshot-EHXTOTW5.mjs} +47 -50
- package/dist/synonyms.mjs +3 -4
- package/dist/{tasks-CjRJRGTb.d.ts → tasks-C4ElXr4P.d.ts} +59 -7
- package/dist/thread-I7DVHHW7.mjs +31 -0
- package/dist/vector/search-worker.d.ts +2 -2
- package/dist/vector/search-worker.mjs +8 -7
- package/dist/workers/entry.mjs +9 -9
- package/dist/{write-2DZPEQL2.mjs → write-SDJXXQ2G.mjs} +36 -39
- package/openapi.json +349 -2
- package/package.json +108 -8
- package/dist/analysis-change-HQUT2Z3I.mjs +0 -43
- package/dist/browser/import-TLB2A5LJ.mjs +0 -9
- package/dist/chunk-5WYVUPGD.mjs +0 -427
- package/dist/chunk-AV4IJKD2.mjs +0 -35
- package/dist/chunk-GES7U2PM.mjs +0 -68
- package/dist/chunk-N37VMC62.mjs +0 -18
- package/dist/chunk-WNBRW4Q2.mjs +0 -128
- package/dist/chunk-WQBCBKY3.mjs +0 -8
- package/dist/chunk-ZATRDAYU.mjs +0 -160
- package/dist/direct-executor-7XOQ7VQP.mjs +0 -28
- package/dist/import-OOBUW3RR.mjs +0 -44
- package/dist/module-IYPLWHGC.mjs +0 -48
- package/dist/thread-KGNAIKPD.mjs +0 -33
- /package/dist/{chunk-22YPZVMG.mjs → chunk-ZXNQEW43.mjs} +0 -0
|
@@ -1,20 +1,69 @@
|
|
|
1
|
-
import { osqCodeBytes, osqStagedQueryBytes, osqRecordBytes, unpackLevels, readTrailer, stageQueryLevels, writeRecord } from './chunk-
|
|
2
|
-
import { markSimdUnavailable,
|
|
3
|
-
import {
|
|
1
|
+
import { osqCodeBytes, osqStagedQueryBytes, osqRecordBytes, unpackLevels, readTrailer, stageQueryLevels, writeRecord } from './chunk-KAEVGLYN.mjs';
|
|
2
|
+
import { markSimdUnavailable, adoptSharedTurns, OSQ_STEPS, DEFAULT_EF_SEARCH, OSQ_GRID, COMPACTION_TOMBSTONE_RATIO, COMPACTION_ABSOLUTE_THRESHOLD, OSQ_QUERY_BITS, PLACEMENT_ROOM_REQUESTS, MAX_LAYER_CAP, INITIAL_LIST_CAPACITY, OSQ_REFINE_ROUNDS, OSQ_REFINE_TOLERANCE, OSQ_PLACEMENT_QUERY_BITS, compareCodePoints, INITIAL_UPPER_SLOTS, CONNECT_RESTARTS_BEFORE_ONE_PASS, OSQ_LAMBDA, threadSlotGone, FARTHEST_REJECTED_LINKS_KEPT, CONNECT_STEPS_BETWEEN_CLOCK_CHECKS, NEAREST_LINK_FALLBACK_HOSTS } from './chunk-IAXZAVYL.mjs';
|
|
3
|
+
import { NATIVE_THREAD_SEARCH_SLOTS, VECTOR_SCRATCH_SLOTS, MAX_DOC_ID_TABLE_BYTES, MAX_VECTOR_ORDINALS, MAX_WASM_PAGES, WASM_PAGE_BYTES, UNPLACED_FLAG_CHUNK_ORDINALS, VECTOR_STORE_INITIAL_CAPACITY, VECTOR_BLOCK_INITIAL_SLOTS, LOCK_SPIN_ITERATIONS, LOCK_WAIT_SLICE_MS, GRAPH_LOCK_WAIT_SLICE_MS, GRAPH_LOCK_WAIT_DEADLINE_MS } from './chunk-TY7L6OXO.mjs';
|
|
4
|
+
import { NarsilError, ErrorCodes } from './chunk-PIS7ZAP7.mjs';
|
|
5
|
+
|
|
6
|
+
// src/vector/shared-buffers/memory-limits.ts
|
|
7
|
+
var VECTOR_MEMORY_LIMITS = {
|
|
8
|
+
maxOrdinals: MAX_VECTOR_ORDINALS,
|
|
9
|
+
maxDocIdTableBytes: MAX_DOC_ID_TABLE_BYTES,
|
|
10
|
+
blockBytes: MAX_WASM_PAGES * WASM_PAGE_BYTES
|
|
11
|
+
};
|
|
12
|
+
function reserveVectorRegion(_bytes) {
|
|
13
|
+
return null;
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
// src/vector/shared-buffers/region.ts
|
|
17
|
+
function reserve(maxBytes) {
|
|
18
|
+
try {
|
|
19
|
+
return reserveVectorRegion(maxBytes);
|
|
20
|
+
} catch (err) {
|
|
21
|
+
if (err instanceof NarsilError) throw err;
|
|
22
|
+
throw new NarsilError(
|
|
23
|
+
ErrorCodes.PARTITION_CAPACITY_EXCEEDED,
|
|
24
|
+
`The device could not reserve ${maxBytes} bytes of address space for a vector structure. Remove vector fields or indexes that the app no longer needs.`,
|
|
25
|
+
{ bytes: maxBytes, cause: err instanceof Error ? err.message : String(err) }
|
|
26
|
+
);
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
function createRegionBuffer(initialBytes, maxBytes) {
|
|
30
|
+
const reserved = reserve(maxBytes);
|
|
31
|
+
if (reserved === null) return null;
|
|
32
|
+
const reservedBytes = reserved.byteLength;
|
|
33
|
+
let logicalBytes = Math.min(initialBytes, reservedBytes);
|
|
34
|
+
Object.defineProperties(reserved, {
|
|
35
|
+
byteLength: { get: () => logicalBytes },
|
|
36
|
+
maxByteLength: { value: reservedBytes },
|
|
37
|
+
resizable: { value: true },
|
|
38
|
+
resize: {
|
|
39
|
+
value(target) {
|
|
40
|
+
if (!Number.isInteger(target) || target < 0 || target > reservedBytes) {
|
|
41
|
+
throw new RangeError(`A vector region can hold between 0 and ${reservedBytes} bytes, not ${target}`);
|
|
42
|
+
}
|
|
43
|
+
if (target < logicalBytes) new Uint8Array(reserved, target, logicalBytes - target).fill(0);
|
|
44
|
+
logicalBytes = target;
|
|
45
|
+
}
|
|
46
|
+
}
|
|
47
|
+
});
|
|
48
|
+
return reserved;
|
|
49
|
+
}
|
|
4
50
|
|
|
5
51
|
// src/vector/shared-buffers/growable.ts
|
|
6
52
|
function sharedMemoryAvailable() {
|
|
7
53
|
return typeof SharedArrayBuffer === "function";
|
|
8
54
|
}
|
|
55
|
+
var resizableBuffersAvailable = typeof ArrayBuffer.prototype.resize === "function";
|
|
9
56
|
function createGrowableBuffer(initialBytes, maxBytes) {
|
|
10
57
|
const initial = Math.min(initialBytes, maxBytes);
|
|
11
58
|
if (sharedMemoryAvailable()) {
|
|
12
59
|
return new SharedArrayBuffer(initial, { maxByteLength: maxBytes });
|
|
13
60
|
}
|
|
14
|
-
|
|
61
|
+
const region = resizableBuffersAvailable ? null : createRegionBuffer(initial, maxBytes);
|
|
62
|
+
return region ?? new ArrayBuffer(initial, { maxByteLength: maxBytes });
|
|
15
63
|
}
|
|
16
64
|
function createFixedBuffer(bytes) {
|
|
17
|
-
|
|
65
|
+
if (sharedMemoryAvailable()) return new SharedArrayBuffer(bytes);
|
|
66
|
+
return new ArrayBuffer(bytes);
|
|
18
67
|
}
|
|
19
68
|
function nextGrowthTarget(have, needed, max) {
|
|
20
69
|
return Math.min(max, Math.max(needed, have * 2));
|
|
@@ -88,7 +137,7 @@ var HELD_ENTRY = 5;
|
|
|
88
137
|
var HELD_WORDS_PER_THREAD = 32;
|
|
89
138
|
var METRIC_CODES = ["cosine", "dotProduct", "euclidean"];
|
|
90
139
|
function perOrdinal(bytesPerOrdinal, initialOrdinals) {
|
|
91
|
-
return createGrowableBuffer(initialOrdinals * bytesPerOrdinal,
|
|
140
|
+
return createGrowableBuffer(initialOrdinals * bytesPerOrdinal, VECTOR_MEMORY_LIMITS.maxOrdinals * bytesPerOrdinal);
|
|
92
141
|
}
|
|
93
142
|
function createSharedGraphHandles(shape) {
|
|
94
143
|
const header = new Int32Array(createFixedBuffer(GRAPH_HEADER_WORDS * 4), 0, GRAPH_HEADER_WORDS);
|
|
@@ -640,6 +689,39 @@ function replaceNeighbors(adj, ord, layer, neighbors, count) {
|
|
|
640
689
|
for (let i = 0; i < limit; i++) if (!holds(held, held.length, neighbors[i])) noteLinked(adj, neighbors[i]);
|
|
641
690
|
writeNeighbors(adj, ord, 0, neighbors, count);
|
|
642
691
|
}
|
|
692
|
+
var REFUSAL_COLLECTION_MIN_INTERVAL_MS = 1e3;
|
|
693
|
+
var REFUSAL_COLLECTION_TIME_MULTIPLE = 10;
|
|
694
|
+
var UI_THREAD_TURN_BUDGET_MS = 20;
|
|
695
|
+
var UI_THREAD_HOP_BEFORE_TURN_WITHIN_MS = 20;
|
|
696
|
+
var UI_THREAD_BACKGROUND_SLICE_DURING_WRITES_MS = 5;
|
|
697
|
+
|
|
698
|
+
// src/runtime/shared-turns.browser.ts
|
|
699
|
+
var turnStartedAt = performance.now();
|
|
700
|
+
var turnsAreBudgeted = true;
|
|
701
|
+
var backgroundTurnIsSpent = () => performance.now() - turnStartedAt >= UI_THREAD_TURN_BUDGET_MS;
|
|
702
|
+
var yieldBackgroundTurn = () => new Promise((resolve) => {
|
|
703
|
+
const { port1, port2 } = new MessageChannel();
|
|
704
|
+
port1.onmessage = () => {
|
|
705
|
+
port1.close();
|
|
706
|
+
turnStartedAt = performance.now();
|
|
707
|
+
resolve();
|
|
708
|
+
};
|
|
709
|
+
port2.postMessage(null);
|
|
710
|
+
});
|
|
711
|
+
var holdWrites = (read) => read();
|
|
712
|
+
var holdWritesAndBackgroundWork = (read) => read();
|
|
713
|
+
function adoptBackgroundScheduler(scheduler) {
|
|
714
|
+
adoptSharedTurns(scheduler);
|
|
715
|
+
backgroundTurnIsSpent = scheduler.backgroundTurnIsSpent;
|
|
716
|
+
yieldBackgroundTurn = scheduler.yieldBackgroundTurn;
|
|
717
|
+
holdWrites = scheduler.holdWrites;
|
|
718
|
+
holdWritesAndBackgroundWork = scheduler.holdWritesAndBackgroundWork;
|
|
719
|
+
}
|
|
720
|
+
|
|
721
|
+
// src/vector/native/loader.browser.ts
|
|
722
|
+
function loadNativeCore() {
|
|
723
|
+
return null;
|
|
724
|
+
}
|
|
643
725
|
|
|
644
726
|
// src/vector/native/backend.ts
|
|
645
727
|
var nativeSearchCoreEnabled = true;
|
|
@@ -1051,7 +1133,7 @@ function computeCodeBlockLayout(dimension, bits) {
|
|
|
1051
1133
|
scratchStride,
|
|
1052
1134
|
slotsOffset,
|
|
1053
1135
|
slotStride,
|
|
1054
|
-
capacity: Math.floor((BLOCK_MAX_BYTES - slotsOffset) / slotStride)
|
|
1136
|
+
capacity: Math.floor((Math.min(VECTOR_MEMORY_LIMITS.blockBytes, BLOCK_MAX_BYTES) - slotsOffset) / slotStride)
|
|
1055
1137
|
};
|
|
1056
1138
|
}
|
|
1057
1139
|
|
|
@@ -1091,15 +1173,15 @@ function unplacedChunkCount(ordinals) {
|
|
|
1091
1173
|
function perOrdinal2(bytesPerOrdinal) {
|
|
1092
1174
|
return createGrowableBuffer(
|
|
1093
1175
|
VECTOR_STORE_INITIAL_CAPACITY * bytesPerOrdinal,
|
|
1094
|
-
(
|
|
1176
|
+
(VECTOR_MEMORY_LIMITS.maxOrdinals + 1) * bytesPerOrdinal
|
|
1095
1177
|
);
|
|
1096
1178
|
}
|
|
1097
1179
|
function inMemoryTable() {
|
|
1098
1180
|
const buffer = perOrdinal2(4);
|
|
1099
|
-
new Int32Array(buffer).fill(IN_MEMORY);
|
|
1181
|
+
new Int32Array(buffer, 0, buffer.byteLength / 4).fill(IN_MEMORY);
|
|
1100
1182
|
return buffer;
|
|
1101
1183
|
}
|
|
1102
|
-
function createSharedVectorStoreHandles(dimension, codeBits, blockBytes2 =
|
|
1184
|
+
function createSharedVectorStoreHandles(dimension, codeBits, blockBytes2 = VECTOR_MEMORY_LIMITS.blockBytes) {
|
|
1103
1185
|
return {
|
|
1104
1186
|
dimension,
|
|
1105
1187
|
codeBits,
|
|
@@ -1113,10 +1195,10 @@ function createSharedVectorStoreHandles(dimension, codeBits, blockBytes2 = BLOCK
|
|
|
1113
1195
|
magnitudes: perOrdinal2(8),
|
|
1114
1196
|
present: perOrdinal2(1),
|
|
1115
1197
|
unplaced: perOrdinal2(1),
|
|
1116
|
-
unplacedChunks: createGrowableBuffer(4, unplacedChunkCount(
|
|
1198
|
+
unplacedChunks: createGrowableBuffer(4, unplacedChunkCount(VECTOR_MEMORY_LIMITS.maxOrdinals) * 4),
|
|
1117
1199
|
removed: perOrdinal2(1),
|
|
1118
1200
|
partitions: perOrdinal2(4),
|
|
1119
|
-
docIdBytes: createGrowableBuffer(VECTOR_STORE_INITIAL_CAPACITY * 16,
|
|
1201
|
+
docIdBytes: createGrowableBuffer(VECTOR_STORE_INITIAL_CAPACITY * 16, VECTOR_MEMORY_LIMITS.maxDocIdTableBytes),
|
|
1120
1202
|
docIdOffsets: perOrdinal2(4),
|
|
1121
1203
|
codePresent: perOrdinal2(1),
|
|
1122
1204
|
diskFile: inMemoryTable(),
|
|
@@ -1147,6 +1229,7 @@ function sharedVectorStoreBytes(handles) {
|
|
|
1147
1229
|
// src/vector/native/types.ts
|
|
1148
1230
|
var NATIVE_OK = 0;
|
|
1149
1231
|
var NATIVE_NEEDS_ROOM = 3;
|
|
1232
|
+
var NATIVE_GRAPH_NOT_HELD_ALONE = 4;
|
|
1150
1233
|
|
|
1151
1234
|
// src/vector/native/store.ts
|
|
1152
1235
|
var METRIC_CODES2 = { cosine: 0, dotProduct: 1, euclidean: 2 };
|
|
@@ -1236,6 +1319,9 @@ function nativeQuantise(handles, metric, ordinals) {
|
|
|
1236
1319
|
(store) => store.core.quantise(store.handle, nativeMetricCode(metric), ordinals, ordinals.length)
|
|
1237
1320
|
);
|
|
1238
1321
|
}
|
|
1322
|
+
|
|
1323
|
+
// src/vector/native/field.ts
|
|
1324
|
+
var WAKE_COUNT_WORDS = 1;
|
|
1239
1325
|
var WAKE_ENTRY_LOCK = -1;
|
|
1240
1326
|
var attachedGraphs = /* @__PURE__ */ new WeakMap();
|
|
1241
1327
|
var workspaceOwner = null;
|
|
@@ -1255,11 +1341,14 @@ function nativeFieldFor(state) {
|
|
|
1255
1341
|
return null;
|
|
1256
1342
|
}
|
|
1257
1343
|
function wakeSleepingThreads(state, field) {
|
|
1258
|
-
|
|
1259
|
-
|
|
1260
|
-
|
|
1344
|
+
wakeListedThreads(state, field.wakes);
|
|
1345
|
+
}
|
|
1346
|
+
function wakeListedThreads(state, wakes) {
|
|
1347
|
+
const count = Math.min(wakes[0] ?? 0, wakes.length - WAKE_COUNT_WORDS);
|
|
1348
|
+
if (count <= 0) return;
|
|
1349
|
+
wakes[0] = 0;
|
|
1261
1350
|
for (let i = 1; i <= count; i++) {
|
|
1262
|
-
const ordinal =
|
|
1351
|
+
const ordinal = wakes[i];
|
|
1263
1352
|
if (ordinal === WAKE_ENTRY_LOCK) {
|
|
1264
1353
|
Atomics.notify(state.header, GRAPH_ENTRY_LOCK);
|
|
1265
1354
|
continue;
|
|
@@ -1269,8 +1358,45 @@ function wakeSleepingThreads(state, field) {
|
|
|
1269
1358
|
}
|
|
1270
1359
|
}
|
|
1271
1360
|
|
|
1361
|
+
// src/vector/native/thread-slots.ts
|
|
1362
|
+
var freeSlots = Array.from({ length: NATIVE_THREAD_SEARCH_SLOTS }, (_, i) => VECTOR_SCRATCH_SLOTS - 1 - i);
|
|
1363
|
+
var waitingForSlot = [];
|
|
1364
|
+
function hasNativeThreads(core) {
|
|
1365
|
+
return core.searchAsync !== void 0 && core.scoreAsync !== void 0;
|
|
1366
|
+
}
|
|
1367
|
+
function threadedNativeCore() {
|
|
1368
|
+
if (!nativeSearchCoreIsEnabled()) return null;
|
|
1369
|
+
const core = loadNativeCore();
|
|
1370
|
+
return core !== null && hasNativeThreads(core) ? core : null;
|
|
1371
|
+
}
|
|
1372
|
+
function claimSlot() {
|
|
1373
|
+
const slot = freeSlots.pop();
|
|
1374
|
+
if (slot !== void 0) return Promise.resolve(slot);
|
|
1375
|
+
return new Promise((resolve) => waitingForSlot.push(resolve));
|
|
1376
|
+
}
|
|
1377
|
+
function claimNativeThreadSlotNow() {
|
|
1378
|
+
return freeSlots.pop() ?? null;
|
|
1379
|
+
}
|
|
1380
|
+
function returnSlot(slot) {
|
|
1381
|
+
const next = waitingForSlot.shift();
|
|
1382
|
+
if (next !== void 0) {
|
|
1383
|
+
next(slot);
|
|
1384
|
+
return;
|
|
1385
|
+
}
|
|
1386
|
+
freeSlots.push(slot);
|
|
1387
|
+
}
|
|
1388
|
+
async function withNativeThreadSlot(work) {
|
|
1389
|
+
const slot = await claimSlot();
|
|
1390
|
+
try {
|
|
1391
|
+
return await work(slot);
|
|
1392
|
+
} finally {
|
|
1393
|
+
returnSlot(slot);
|
|
1394
|
+
}
|
|
1395
|
+
}
|
|
1396
|
+
|
|
1272
1397
|
// src/vector/native/writes.ts
|
|
1273
1398
|
var CALL_RAISED = -1;
|
|
1399
|
+
var NO_NEARBY_NODES = new Int32Array(0);
|
|
1274
1400
|
function writeToTheGraph(state, field, write) {
|
|
1275
1401
|
let status;
|
|
1276
1402
|
try {
|
|
@@ -1319,6 +1445,53 @@ function nativeConnect(state, field, metric, nearby) {
|
|
|
1319
1445
|
);
|
|
1320
1446
|
return writeToTheGraph(state, field, connect) === NATIVE_OK;
|
|
1321
1447
|
}
|
|
1448
|
+
function connectsOffThread(core) {
|
|
1449
|
+
return core.connectUnreachedAsync !== void 0;
|
|
1450
|
+
}
|
|
1451
|
+
function nativeConnectsOffThread(field) {
|
|
1452
|
+
return connectsOffThread(field.core);
|
|
1453
|
+
}
|
|
1454
|
+
async function nativeConnectOffThread(state, field, metric) {
|
|
1455
|
+
const core = field.core;
|
|
1456
|
+
if (!connectsOffThread(core)) return "failed";
|
|
1457
|
+
const slot = claimNativeThreadSlotNow();
|
|
1458
|
+
if (slot === null) return "graphBusy";
|
|
1459
|
+
let outcome;
|
|
1460
|
+
try {
|
|
1461
|
+
outcome = await core.connectUnreachedAsync(
|
|
1462
|
+
field.graph,
|
|
1463
|
+
field.store.handle,
|
|
1464
|
+
nativeMetricCode(metric),
|
|
1465
|
+
NO_NEARBY_NODES,
|
|
1466
|
+
slot
|
|
1467
|
+
);
|
|
1468
|
+
} catch {
|
|
1469
|
+
return "failed";
|
|
1470
|
+
} finally {
|
|
1471
|
+
returnSlot(slot);
|
|
1472
|
+
}
|
|
1473
|
+
wakeListedThreads(state, outcome.wakes);
|
|
1474
|
+
Atomics.notify(state.header, GRAPH_LOCK);
|
|
1475
|
+
if (outcome.status === NATIVE_OK) return "connected";
|
|
1476
|
+
return outcome.status === NATIVE_GRAPH_NOT_HELD_ALONE ? "graphBusy" : "failed";
|
|
1477
|
+
}
|
|
1478
|
+
|
|
1479
|
+
// src/vector/hnsw/connect-steps.ts
|
|
1480
|
+
function newPace() {
|
|
1481
|
+
return { steps: 0 };
|
|
1482
|
+
}
|
|
1483
|
+
function stepTaken(pace) {
|
|
1484
|
+
pace.steps += 1;
|
|
1485
|
+
if (pace.steps < CONNECT_STEPS_BETWEEN_CLOCK_CHECKS) return false;
|
|
1486
|
+
pace.steps = 0;
|
|
1487
|
+
return true;
|
|
1488
|
+
}
|
|
1489
|
+
function drain(steps) {
|
|
1490
|
+
for (; ; ) {
|
|
1491
|
+
const next = steps.next();
|
|
1492
|
+
if (next.done === true) return next.value;
|
|
1493
|
+
}
|
|
1494
|
+
}
|
|
1322
1495
|
|
|
1323
1496
|
// src/vector/similarity.ts
|
|
1324
1497
|
function magnitude(v) {
|
|
@@ -1375,6 +1548,14 @@ function mixedUint32(value) {
|
|
|
1375
1548
|
function unitDrawOf(value) {
|
|
1376
1549
|
return (mixedUint32(value) + HALF_A_STEP) / TWO_TO_THE_32;
|
|
1377
1550
|
}
|
|
1551
|
+
function shuffleStep(items, i, stream) {
|
|
1552
|
+
const next = mixedUint32(stream);
|
|
1553
|
+
const j = Math.floor(next / TWO_TO_THE_32 * (i + 1));
|
|
1554
|
+
const held = items[i];
|
|
1555
|
+
items[i] = items[j];
|
|
1556
|
+
items[j] = held;
|
|
1557
|
+
return next;
|
|
1558
|
+
}
|
|
1378
1559
|
function shuffleInPlace(items) {
|
|
1379
1560
|
let stream = items.length;
|
|
1380
1561
|
for (let i = items.length - 1; i > 0; i--) {
|
|
@@ -1737,7 +1918,10 @@ function writeKeepingLastLinks(state, ord, sorted, kept, held) {
|
|
|
1737
1918
|
// src/vector/hnsw/nearest-links.ts
|
|
1738
1919
|
var NOT_YET_FOUND = -2;
|
|
1739
1920
|
function nearer(a, b) {
|
|
1740
|
-
return a.distance
|
|
1921
|
+
return nearerPair(a.distance, a.ord, b.distance, b.ord);
|
|
1922
|
+
}
|
|
1923
|
+
function nearerPair(aDistance, aOrd, bDistance, bOrd) {
|
|
1924
|
+
return aDistance < bDistance || aDistance === bDistance && aOrd < bOrd;
|
|
1741
1925
|
}
|
|
1742
1926
|
function listOf(state, ord) {
|
|
1743
1927
|
const adjacency = state.adjacency;
|
|
@@ -1748,13 +1932,20 @@ function listOf(state, ord) {
|
|
|
1748
1932
|
function nearestInList(pass, ord) {
|
|
1749
1933
|
const known = pass.nearest[ord];
|
|
1750
1934
|
if (known !== NOT_YET_FOUND) return known;
|
|
1751
|
-
let
|
|
1752
|
-
|
|
1935
|
+
let nearest = -1;
|
|
1936
|
+
let nearestDistance = Number.POSITIVE_INFINITY;
|
|
1937
|
+
const level0 = pass.state.adjacency.level0;
|
|
1938
|
+
const base = layerBase(pass.state.adjacency, ord, 0);
|
|
1939
|
+
const end = base === ABSENT ? base : base + 1 + level0[base];
|
|
1940
|
+
for (let at = base + 1; base !== ABSENT && at < end; at++) {
|
|
1941
|
+
const neighbour = level0[at];
|
|
1753
1942
|
if (neighbour === ord || !isLive(pass.state, neighbour)) continue;
|
|
1754
|
-
const
|
|
1755
|
-
if (
|
|
1943
|
+
const distance = pass.distance(ord, neighbour);
|
|
1944
|
+
if (nearest === -1 || nearerPair(distance, neighbour, nearestDistance, nearest)) {
|
|
1945
|
+
nearest = neighbour;
|
|
1946
|
+
nearestDistance = distance;
|
|
1947
|
+
}
|
|
1756
1948
|
}
|
|
1757
|
-
const nearest = best === null ? -1 : best.ord;
|
|
1758
1949
|
pass.nearest[ord] = nearest;
|
|
1759
1950
|
return nearest;
|
|
1760
1951
|
}
|
|
@@ -1769,15 +1960,17 @@ function fallbackHostsFor(pass, ord, nearest) {
|
|
|
1769
1960
|
}
|
|
1770
1961
|
function replaceableSlot(pass, host, list) {
|
|
1771
1962
|
let farthest = -1;
|
|
1772
|
-
let
|
|
1963
|
+
let farthestOrd = -1;
|
|
1964
|
+
let farthestDistance = Number.NEGATIVE_INFINITY;
|
|
1773
1965
|
for (let i = 0; i < list.length; i++) {
|
|
1774
1966
|
const neighbour = list[i];
|
|
1775
1967
|
if (incomingCount(pass.state.adjacency, neighbour) < 2) continue;
|
|
1776
1968
|
if (isLive(pass.state, neighbour) && nearestInList(pass, neighbour) === host) continue;
|
|
1777
|
-
const
|
|
1778
|
-
if (
|
|
1969
|
+
const distance = pass.distance(host, neighbour);
|
|
1970
|
+
if (farthest === -1 || nearerPair(farthestDistance, farthestOrd, distance, neighbour)) {
|
|
1779
1971
|
farthest = i;
|
|
1780
|
-
|
|
1972
|
+
farthestOrd = neighbour;
|
|
1973
|
+
farthestDistance = distance;
|
|
1781
1974
|
}
|
|
1782
1975
|
}
|
|
1783
1976
|
return farthest;
|
|
@@ -1805,6 +1998,9 @@ function linkFrom(pass, host, ord) {
|
|
|
1805
1998
|
return true;
|
|
1806
1999
|
}
|
|
1807
2000
|
function linkFromNearest(state) {
|
|
2001
|
+
drain(linkFromNearestSteps(state, newPace()));
|
|
2002
|
+
}
|
|
2003
|
+
function* linkFromNearestSteps(state, pace) {
|
|
1808
2004
|
const adjacency = state.adjacency;
|
|
1809
2005
|
const slots = adjacencySlots(adjacency);
|
|
1810
2006
|
if (slots > 0) reachNode(adjacency, slots - 1);
|
|
@@ -1814,6 +2010,7 @@ function linkFromNearest(state) {
|
|
|
1814
2010
|
nearest: new Int32Array(slots).fill(NOT_YET_FOUND)
|
|
1815
2011
|
};
|
|
1816
2012
|
for (let ord = 0; ord < slots; ord++) {
|
|
2013
|
+
if (stepTaken(pace)) yield;
|
|
1817
2014
|
if (Atomics.load(adjacency.nearestLinkDue, ord) !== 1) continue;
|
|
1818
2015
|
Atomics.store(adjacency.nearestLinkDue, ord, 0);
|
|
1819
2016
|
if (!isLive(state, ord)) continue;
|
|
@@ -1825,16 +2022,18 @@ function linkFromNearest(state) {
|
|
|
1825
2022
|
|
|
1826
2023
|
// src/vector/hnsw/connect-unreached.ts
|
|
1827
2024
|
var NOT_REACHED_THROUGH_A_NODE = -1;
|
|
2025
|
+
var NO_NEARBY_NODES2 = new Int32Array(0);
|
|
1828
2026
|
function reach(walk, node, through) {
|
|
1829
2027
|
walk.reached[node] = 1;
|
|
1830
2028
|
walk.firstReachedThrough[node] = through;
|
|
1831
2029
|
walk.queue[walk.tail++] = node;
|
|
1832
2030
|
}
|
|
1833
|
-
function walkFrom(state, walk, start, through) {
|
|
2031
|
+
function* walkFrom(state, walk, start, through, pace) {
|
|
1834
2032
|
const adjacency = state.adjacency;
|
|
1835
2033
|
if (walk.reached[start] === 1) return;
|
|
1836
2034
|
reach(walk, start, through);
|
|
1837
2035
|
while (walk.head < walk.tail) {
|
|
2036
|
+
if (stepTaken(pace)) yield;
|
|
1838
2037
|
const ord = walk.queue[walk.head++];
|
|
1839
2038
|
const base = layerBase(adjacency, ord, 0);
|
|
1840
2039
|
if (base === ABSENT) continue;
|
|
@@ -1869,7 +2068,7 @@ function listOf2(state, ord) {
|
|
|
1869
2068
|
if (base === ABSENT) return new Int32Array(0);
|
|
1870
2069
|
return adjacency.level0.slice(base + 1, base + 1 + adjacency.level0[base]);
|
|
1871
2070
|
}
|
|
1872
|
-
function nearestHost(state, walk, orphan, nearby, test) {
|
|
2071
|
+
function* nearestHost(state, walk, orphan, nearby, test, pace) {
|
|
1873
2072
|
const distance = nodeDistanceFunction(state, state.buildMetric);
|
|
1874
2073
|
let best = -1;
|
|
1875
2074
|
let bestDistance = Number.POSITIVE_INFINITY;
|
|
@@ -1881,11 +2080,17 @@ function nearestHost(state, walk, orphan, nearby, test) {
|
|
|
1881
2080
|
bestDistance = away;
|
|
1882
2081
|
}
|
|
1883
2082
|
};
|
|
1884
|
-
for (const host of nearby.list)
|
|
2083
|
+
for (const host of nearby.list) {
|
|
2084
|
+
if (stepTaken(pace)) yield;
|
|
2085
|
+
consider(host);
|
|
2086
|
+
}
|
|
1885
2087
|
for (const host of listOf2(state, orphan))
|
|
1886
2088
|
if (host >= 0 && host < walk.reached.length && nearby.holds[host] !== 1) consider(host);
|
|
1887
2089
|
if (best !== -1) return best;
|
|
1888
|
-
for (let host = 0; host < walk.reached.length; host++)
|
|
2090
|
+
for (let host = 0; host < walk.reached.length; host++) {
|
|
2091
|
+
if (stepTaken(pace)) yield;
|
|
2092
|
+
consider(host);
|
|
2093
|
+
}
|
|
1889
2094
|
return best;
|
|
1890
2095
|
}
|
|
1891
2096
|
function takeOutFarthestLinkOutsideTheWalk(state, walk, host) {
|
|
@@ -1920,7 +2125,7 @@ function appendTo(state, host, orphan) {
|
|
|
1920
2125
|
adjacency.level0[base] = count + 1;
|
|
1921
2126
|
noteLinked(adjacency, orphan);
|
|
1922
2127
|
}
|
|
1923
|
-
function
|
|
2128
|
+
function* connectUnreachedSteps(state, nearby, pace) {
|
|
1924
2129
|
const slots = adjacencySlots(state.adjacency);
|
|
1925
2130
|
const entry = entryPointOf(state);
|
|
1926
2131
|
if (entry < 0 || entry >= slots || !nodeExists(state, entry)) return;
|
|
@@ -1931,7 +2136,7 @@ function connectUnreached(state, nearby) {
|
|
|
1931
2136
|
head: 0,
|
|
1932
2137
|
tail: 0
|
|
1933
2138
|
};
|
|
1934
|
-
walkFrom(state, walk, entry, NOT_REACHED_THROUGH_A_NODE);
|
|
2139
|
+
yield* walkFrom(state, walk, entry, NOT_REACHED_THROUGH_A_NODE, pace);
|
|
1935
2140
|
const held = { list: [], holds: new Uint8Array(slots) };
|
|
1936
2141
|
for (let i = 0; i < nearby.length; i++) {
|
|
1937
2142
|
const ord = nearby[i];
|
|
@@ -1940,17 +2145,26 @@ function connectUnreached(state, nearby) {
|
|
|
1940
2145
|
held.list.push(ord);
|
|
1941
2146
|
}
|
|
1942
2147
|
for (let orphan = 0; orphan < slots; orphan++) {
|
|
2148
|
+
if (stepTaken(pace)) yield;
|
|
1943
2149
|
if (walk.reached[orphan] === 1 || !isLive(state, orphan)) continue;
|
|
1944
|
-
let host = nearestHost(state, walk, orphan, held, hasRoom);
|
|
2150
|
+
let host = yield* nearestHost(state, walk, orphan, held, hasRoom, pace);
|
|
1945
2151
|
if (host === -1) {
|
|
1946
|
-
host = nearestHost(state, walk, orphan, held, holdsLinkOutsideTheWalk);
|
|
2152
|
+
host = yield* nearestHost(state, walk, orphan, held, holdsLinkOutsideTheWalk, pace);
|
|
1947
2153
|
if (host === -1) continue;
|
|
1948
2154
|
takeOutFarthestLinkOutsideTheWalk(state, walk, host);
|
|
1949
2155
|
}
|
|
1950
2156
|
appendTo(state, host, orphan);
|
|
1951
|
-
walkFrom(state, walk, orphan, host);
|
|
2157
|
+
yield* walkFrom(state, walk, orphan, host, pace);
|
|
1952
2158
|
}
|
|
1953
2159
|
}
|
|
2160
|
+
function connectUnreached(state, nearby) {
|
|
2161
|
+
drain(connectUnreachedSteps(state, nearby, newPace()));
|
|
2162
|
+
}
|
|
2163
|
+
function* connectInJsSteps(state) {
|
|
2164
|
+
const pace = newPace();
|
|
2165
|
+
yield* linkFromNearestSteps(state, pace);
|
|
2166
|
+
yield* connectUnreachedSteps(state, NO_NEARBY_NODES2, pace);
|
|
2167
|
+
}
|
|
1954
2168
|
function holdsUnlinkedNode(state) {
|
|
1955
2169
|
const slots = adjacencySlots(state.adjacency);
|
|
1956
2170
|
const entry = entryPointOf(state);
|
|
@@ -1997,7 +2211,7 @@ function leaveIncomingUncounted(state) {
|
|
|
1997
2211
|
Atomics.store(state.header, GRAPH_UNLINKED_NODES, 0);
|
|
1998
2212
|
Atomics.store(state.header, GRAPH_INCOMING_UNCOUNTED, 1);
|
|
1999
2213
|
}
|
|
2000
|
-
function countIncomingBeforeWriting(state, holdsGraphLock) {
|
|
2214
|
+
function countIncomingBeforeWriting(state, holdsGraphLock, connectsAfterwards = false) {
|
|
2001
2215
|
if (Atomics.load(state.header, GRAPH_INCOMING_UNCOUNTED) === 0) return;
|
|
2002
2216
|
if (!holdsGraphLock) lockGraphExclusive(state.locks);
|
|
2003
2217
|
try {
|
|
@@ -2007,14 +2221,80 @@ function countIncomingBeforeWriting(state, holdsGraphLock) {
|
|
|
2007
2221
|
if (slots > 0) reachNode(adjacency, slots - 1);
|
|
2008
2222
|
adjacency.incoming.fill(0);
|
|
2009
2223
|
countEveryLink(adjacency, slots);
|
|
2010
|
-
|
|
2011
|
-
|
|
2224
|
+
const unlinked = holdsUnlinkedNode(state);
|
|
2225
|
+
if (unlinked && !connectsAfterwards) connectThroughEitherCore(state, new Int32Array(0));
|
|
2226
|
+
Atomics.store(state.header, GRAPH_UNLINKED_NODES, unlinked && connectsAfterwards ? 1 : 0);
|
|
2012
2227
|
Atomics.store(state.header, GRAPH_INCOMING_UNCOUNTED, 0);
|
|
2013
2228
|
} finally {
|
|
2014
2229
|
if (!holdsGraphLock) unlockGraphExclusive(state.locks);
|
|
2015
2230
|
}
|
|
2016
2231
|
}
|
|
2017
2232
|
|
|
2233
|
+
// src/vector/hnsw/connect-in-turns.ts
|
|
2234
|
+
function connectHoldingTheGraph(state) {
|
|
2235
|
+
lockGraphExclusive(state.locks);
|
|
2236
|
+
try {
|
|
2237
|
+
connectAfterBuild(state);
|
|
2238
|
+
} finally {
|
|
2239
|
+
unlockGraphExclusive(state.locks);
|
|
2240
|
+
}
|
|
2241
|
+
}
|
|
2242
|
+
function sliceFinished(state, steps) {
|
|
2243
|
+
lockGraphExclusive(state.locks);
|
|
2244
|
+
try {
|
|
2245
|
+
for (; ; ) {
|
|
2246
|
+
if (steps.next().done === true) {
|
|
2247
|
+
Atomics.store(state.header, GRAPH_UNLINKED_NODES, 0);
|
|
2248
|
+
return true;
|
|
2249
|
+
}
|
|
2250
|
+
if (backgroundTurnIsSpent()) return false;
|
|
2251
|
+
}
|
|
2252
|
+
} finally {
|
|
2253
|
+
unlockGraphExclusive(state.locks);
|
|
2254
|
+
}
|
|
2255
|
+
}
|
|
2256
|
+
async function connectedWithoutLinkWrites(state) {
|
|
2257
|
+
const writesBefore = state.linkWrites;
|
|
2258
|
+
const steps = connectInJsSteps(state);
|
|
2259
|
+
while (!sliceFinished(state, steps)) {
|
|
2260
|
+
await yieldBackgroundTurn();
|
|
2261
|
+
if (state.linkWrites !== writesBefore) return false;
|
|
2262
|
+
}
|
|
2263
|
+
return state.linkWrites === writesBefore;
|
|
2264
|
+
}
|
|
2265
|
+
async function connectUntilWritesDrain(state) {
|
|
2266
|
+
let connected = false;
|
|
2267
|
+
while (!connected) connected = await connectedWithoutLinkWrites(state);
|
|
2268
|
+
}
|
|
2269
|
+
async function connectInSlices(state) {
|
|
2270
|
+
for (let restarts = 0; restarts < CONNECT_RESTARTS_BEFORE_ONE_PASS; restarts++) {
|
|
2271
|
+
if (await connectedWithoutLinkWrites(state)) return;
|
|
2272
|
+
}
|
|
2273
|
+
await holdWrites(() => connectUntilWritesDrain(state));
|
|
2274
|
+
}
|
|
2275
|
+
async function connectThroughTheCoreThread(state, first) {
|
|
2276
|
+
const startedAt = performance.now();
|
|
2277
|
+
let field = first;
|
|
2278
|
+
while (field !== null) {
|
|
2279
|
+
const outcome = await nativeConnectOffThread(state, field, state.buildMetric);
|
|
2280
|
+
if (outcome === "connected") return true;
|
|
2281
|
+
if (outcome === "failed" || performance.now() - startedAt >= GRAPH_LOCK_WAIT_DEADLINE_MS) return false;
|
|
2282
|
+
await yieldBackgroundTurn();
|
|
2283
|
+
field = nativeFieldFor();
|
|
2284
|
+
}
|
|
2285
|
+
return false;
|
|
2286
|
+
}
|
|
2287
|
+
function connectOffThread(state) {
|
|
2288
|
+
const field = nativeFieldFor();
|
|
2289
|
+
if (field === null || !nativeConnectsOffThread(field)) return null;
|
|
2290
|
+
return connectThroughTheCoreThread(state, field);
|
|
2291
|
+
}
|
|
2292
|
+
function connectOnThisThread(state, inSlices) {
|
|
2293
|
+
if (inSlices || nativeFieldFor() === null) return connectInSlices(state);
|
|
2294
|
+
connectHoldingTheGraph(state);
|
|
2295
|
+
return Promise.resolve();
|
|
2296
|
+
}
|
|
2297
|
+
|
|
2018
2298
|
// src/vector/ordinal-filter.ts
|
|
2019
2299
|
function createOrdinalFilter(slots) {
|
|
2020
2300
|
return { bits: new Uint8Array(slots + 7 >>> 3), count: 0 };
|
|
@@ -2326,14 +2606,15 @@ function placeThroughTheCore(state, ord, holdsGraphLock) {
|
|
|
2326
2606
|
}
|
|
2327
2607
|
return false;
|
|
2328
2608
|
}
|
|
2329
|
-
function insertNode(state, ord, holdsGraphLock = false) {
|
|
2609
|
+
function insertNode(state, ord, holdsGraphLock = false, connectsAfterwards = false) {
|
|
2330
2610
|
if (!state.store.holdsOrdinal(ord)) return false;
|
|
2331
2611
|
ensureCapacity(state, ord + 1);
|
|
2332
2612
|
if (nodeExists(state, ord)) return false;
|
|
2333
|
-
countIncomingBeforeWriting(state, holdsGraphLock);
|
|
2613
|
+
countIncomingBeforeWriting(state, holdsGraphLock, connectsAfterwards);
|
|
2334
2614
|
writeRecordBeforePlacement(state, ord);
|
|
2615
|
+
state.linkWrites += 1;
|
|
2335
2616
|
if (placeThroughTheCore(state, ord, holdsGraphLock)) {
|
|
2336
|
-
connectAfterPlacement(state, holdsGraphLock);
|
|
2617
|
+
if (!connectsAfterwards) connectAfterPlacement(state, holdsGraphLock);
|
|
2337
2618
|
return true;
|
|
2338
2619
|
}
|
|
2339
2620
|
if (nodeExists(state, ord)) return false;
|
|
@@ -2347,7 +2628,7 @@ function insertNode(state, ord, holdsGraphLock = false) {
|
|
|
2347
2628
|
} finally {
|
|
2348
2629
|
if (!holdsGraphLock) unlockGraphShared(state.locks);
|
|
2349
2630
|
}
|
|
2350
|
-
connectAfterPlacement(state, holdsGraphLock);
|
|
2631
|
+
if (!connectsAfterwards) connectAfterPlacement(state, holdsGraphLock);
|
|
2351
2632
|
return true;
|
|
2352
2633
|
}
|
|
2353
2634
|
function removeNodeEager(state, ord, excludeOrds) {
|
|
@@ -2416,7 +2697,10 @@ function removeNodeEager(state, ord, excludeOrds) {
|
|
|
2416
2697
|
function markTombstone(state, ord) {
|
|
2417
2698
|
if (!nodeExists(state, ord) || !reachTombstone(state, ord)) return;
|
|
2418
2699
|
const field = nativeFieldFor();
|
|
2419
|
-
if (field !== null && nativeRemove(state, field, ord))
|
|
2700
|
+
if (field !== null && nativeRemove(state, field, ord)) {
|
|
2701
|
+
state.linkWrites += 1;
|
|
2702
|
+
return;
|
|
2703
|
+
}
|
|
2420
2704
|
if (Atomics.compareExchange(state.tombstones, ord, 0, 1) === 0) {
|
|
2421
2705
|
Atomics.add(state.header, GRAPH_TOMBSTONE_COUNT, 1);
|
|
2422
2706
|
}
|
|
@@ -2868,16 +3152,32 @@ function defaultEfSearch(dimension, k) {
|
|
|
2868
3152
|
}
|
|
2869
3153
|
|
|
2870
3154
|
// src/vector/hnsw/search.ts
|
|
2871
|
-
function
|
|
3155
|
+
function searchDepths(state, k, options) {
|
|
2872
3156
|
const calibrated = activeQuantizer(state);
|
|
2873
3157
|
const quantizer = calibrated === void 0 || calibrated.size === 0 ? void 0 : calibrated;
|
|
2874
|
-
const useQuantized = quantizer !== void 0;
|
|
2875
3158
|
const window = options.rescoreWindow ?? k;
|
|
2876
3159
|
let depth = window;
|
|
2877
3160
|
if (quantizer !== void 0) {
|
|
2878
3161
|
depth = options.oversample === void 0 ? defaultRescoreDepth(quantizer.bits, state.dimension, window) : Math.ceil(window * options.oversample);
|
|
2879
3162
|
}
|
|
2880
3163
|
const ef = Math.max(options.efSearch ?? defaultEfSearch(state.dimension, window), depth);
|
|
3164
|
+
return { ef, depth, useQuantized: quantizer !== void 0 };
|
|
3165
|
+
}
|
|
3166
|
+
function requireQueryDimension(state, query) {
|
|
3167
|
+
if (query.length !== state.dimension) {
|
|
3168
|
+
throw new NarsilError(
|
|
3169
|
+
ErrorCodes.VECTOR_DIMENSION_MISMATCH,
|
|
3170
|
+
`Vector dimension mismatch: expected ${state.dimension}, got ${query.length}`,
|
|
3171
|
+
{ expected: state.dimension, received: query.length }
|
|
3172
|
+
);
|
|
3173
|
+
}
|
|
3174
|
+
}
|
|
3175
|
+
function graphIsEmpty(state) {
|
|
3176
|
+
return entryPointOf(state) === -1 || nodeCountOf(state) - tombstoneCountOf(state) === 0;
|
|
3177
|
+
}
|
|
3178
|
+
function traverse(state, query, k, searchMetric, options) {
|
|
3179
|
+
const { ef, depth, useQuantized } = searchDepths(state, k, options);
|
|
3180
|
+
const quantizer = useQuantized ? activeQuantizer(state) : void 0;
|
|
2881
3181
|
const filter = options.filter;
|
|
2882
3182
|
const workspace = state.workspace;
|
|
2883
3183
|
const candidates = workspace.traversal;
|
|
@@ -2952,17 +3252,8 @@ function bestResolvedHits(hits, k, docIdOf) {
|
|
|
2952
3252
|
return taken.sort(bestFirst).slice(0, k);
|
|
2953
3253
|
}
|
|
2954
3254
|
function collectHits(state, query, k, searchMetric, minSimilarity, options) {
|
|
2955
|
-
|
|
2956
|
-
|
|
2957
|
-
ErrorCodes.VECTOR_DIMENSION_MISMATCH,
|
|
2958
|
-
`Vector dimension mismatch: expected ${state.dimension}, got ${query.length}`,
|
|
2959
|
-
{ expected: state.dimension, received: query.length }
|
|
2960
|
-
);
|
|
2961
|
-
}
|
|
2962
|
-
const liveSize = nodeCountOf(state) - tombstoneCountOf(state);
|
|
2963
|
-
if (entryPointOf(state) === -1 || liveSize === 0) {
|
|
2964
|
-
return [];
|
|
2965
|
-
}
|
|
3255
|
+
requireQueryDimension(state, query);
|
|
3256
|
+
if (graphIsEmpty(state)) return [];
|
|
2966
3257
|
const traversal = traverse(state, query, k, searchMetric, options);
|
|
2967
3258
|
const { candidates } = traversal;
|
|
2968
3259
|
const filter = options.filter;
|
|
@@ -3041,6 +3332,91 @@ function searchOrdinals(state, docIdOf, query, k, searchMetric, minSimilarity, o
|
|
|
3041
3332
|
return bestResolvedHits(hits, k, docIdOf);
|
|
3042
3333
|
}
|
|
3043
3334
|
|
|
3335
|
+
// src/vector/hnsw/search-off-thread.ts
|
|
3336
|
+
function chosenOrdinals(candidates, depth, filter) {
|
|
3337
|
+
const nearest = Math.min(candidates.size, depth);
|
|
3338
|
+
const ordinals = new Int32Array(nearest);
|
|
3339
|
+
let kept = 0;
|
|
3340
|
+
for (let i = 0; i < candidates.size && kept < nearest; i++) {
|
|
3341
|
+
const ord = candidates.ords[i];
|
|
3342
|
+
if (filter && !ordinalFilterHas(filter, ord)) continue;
|
|
3343
|
+
ordinals[kept++] = ord;
|
|
3344
|
+
}
|
|
3345
|
+
return ordinals.subarray(0, kept);
|
|
3346
|
+
}
|
|
3347
|
+
function onFullPrecision(rescore) {
|
|
3348
|
+
const { state, candidates, query, depth, metric, minSimilarity, filter } = rescore;
|
|
3349
|
+
const arena = state.store.prepareQueryArena(query);
|
|
3350
|
+
const qMag = arena ? arena.magnitude : magnitude(query);
|
|
3351
|
+
return rescoreWithFullPrecision(state, candidates, query, qMag, arena, depth, metric, minSimilarity, filter);
|
|
3352
|
+
}
|
|
3353
|
+
async function rescoredOffThread(rescore) {
|
|
3354
|
+
const { core, field, candidates, query, depth, metric, minSimilarity, filter, slot } = rescore;
|
|
3355
|
+
const ordinals = chosenOrdinals(candidates, depth, filter);
|
|
3356
|
+
if (ordinals.length === 0) return [];
|
|
3357
|
+
let scored;
|
|
3358
|
+
try {
|
|
3359
|
+
scored = await core.scoreAsync(field.store.handle, query, nativeMetricCode(metric), ordinals, ordinals.length, slot);
|
|
3360
|
+
} catch {
|
|
3361
|
+
return onFullPrecision(rescore);
|
|
3362
|
+
}
|
|
3363
|
+
if (scored.status !== NATIVE_OK) return onFullPrecision(rescore);
|
|
3364
|
+
const hits = [];
|
|
3365
|
+
for (let i = 0; i < ordinals.length; i++) {
|
|
3366
|
+
const distance = scored.distances[i];
|
|
3367
|
+
if (distance === Number.POSITIVE_INFINITY) continue;
|
|
3368
|
+
const score = toScore(distance, metric);
|
|
3369
|
+
if (score < minSimilarity) continue;
|
|
3370
|
+
hits.push({ ord: ordinals[i], score });
|
|
3371
|
+
}
|
|
3372
|
+
return hits;
|
|
3373
|
+
}
|
|
3374
|
+
async function searchOffThread(state, docIdOf, query, k, metric, minSimilarity, options) {
|
|
3375
|
+
requireQueryDimension(state, query);
|
|
3376
|
+
if (graphIsEmpty(state)) return [];
|
|
3377
|
+
const core = threadedNativeCore();
|
|
3378
|
+
const field = nativeFieldFor();
|
|
3379
|
+
if (core === null || field === null) return null;
|
|
3380
|
+
const { ef, depth, useQuantized } = searchDepths(state, k, options);
|
|
3381
|
+
const filter = options.filter;
|
|
3382
|
+
return withNativeThreadSlot(async (slot) => {
|
|
3383
|
+
let found;
|
|
3384
|
+
try {
|
|
3385
|
+
found = await core.searchAsync(
|
|
3386
|
+
field.graph,
|
|
3387
|
+
field.store.handle,
|
|
3388
|
+
query,
|
|
3389
|
+
nativeMetricCode(metric),
|
|
3390
|
+
ef,
|
|
3391
|
+
slot,
|
|
3392
|
+
filter === void 0 ? null : filter.bits
|
|
3393
|
+
);
|
|
3394
|
+
} catch {
|
|
3395
|
+
return null;
|
|
3396
|
+
}
|
|
3397
|
+
if (found.count < 0) return null;
|
|
3398
|
+
const candidates = { ords: found.ordinals, distances: found.distances, size: found.count };
|
|
3399
|
+
if (!useQuantized) return bestResolvedHits(estimatedHits(candidates, 0, metric, minSimilarity, filter), k, docIdOf);
|
|
3400
|
+
const rescored = await rescoredOffThread({
|
|
3401
|
+
state,
|
|
3402
|
+
core,
|
|
3403
|
+
field,
|
|
3404
|
+
candidates,
|
|
3405
|
+
query,
|
|
3406
|
+
depth,
|
|
3407
|
+
metric,
|
|
3408
|
+
minSimilarity,
|
|
3409
|
+
filter,
|
|
3410
|
+
slot
|
|
3411
|
+
});
|
|
3412
|
+
if (options.rescoreWindow === void 0 || minSimilarity !== Number.NEGATIVE_INFINITY) {
|
|
3413
|
+
return bestResolvedHits(rescored, k, docIdOf);
|
|
3414
|
+
}
|
|
3415
|
+
const rest = endOfRescored(candidates, depth, filter);
|
|
3416
|
+
return bestResolvedHits(rescored.concat(estimatedHits(candidates, rest, metric, minSimilarity, filter)), k, docIdOf);
|
|
3417
|
+
});
|
|
3418
|
+
}
|
|
3419
|
+
|
|
3044
3420
|
// src/vector/hnsw/snapshot.ts
|
|
3045
3421
|
function exportSnapshot(state) {
|
|
3046
3422
|
const adj = state.adjacency;
|
|
@@ -3107,7 +3483,8 @@ function openGraphState(handles, dimension, store, quantizer, threadSlot) {
|
|
|
3107
3483
|
Mmax0: shape.mMax0,
|
|
3108
3484
|
efCons: shape.efConstruction,
|
|
3109
3485
|
buildMetric: shape.metric,
|
|
3110
|
-
mL: 1 / Math.log(shape.m)
|
|
3486
|
+
mL: 1 / Math.log(shape.m),
|
|
3487
|
+
linkWrites: 0
|
|
3111
3488
|
};
|
|
3112
3489
|
}
|
|
3113
3490
|
|
|
@@ -3130,6 +3507,12 @@ function createHNSWIndex(dimension, store, config, quantizer, handles) {
|
|
|
3130
3507
|
unlockGraphExclusive(state.locks);
|
|
3131
3508
|
}
|
|
3132
3509
|
}
|
|
3510
|
+
function relinking(operation) {
|
|
3511
|
+
return exclusively(() => {
|
|
3512
|
+
state.linkWrites += 1;
|
|
3513
|
+
return operation();
|
|
3514
|
+
});
|
|
3515
|
+
}
|
|
3133
3516
|
function insertNode2(docId) {
|
|
3134
3517
|
const ord = store.getOrdinal(docId);
|
|
3135
3518
|
if (ord === void 0) {
|
|
@@ -3201,8 +3584,11 @@ function createHNSWIndex(dimension, store, config, quantizer, handles) {
|
|
|
3201
3584
|
get handles() {
|
|
3202
3585
|
return shared;
|
|
3203
3586
|
},
|
|
3587
|
+
get holdsUnlinkedNode() {
|
|
3588
|
+
return Atomics.load(state.header, GRAPH_UNLINKED_NODES) !== 0;
|
|
3589
|
+
},
|
|
3204
3590
|
insertNode: insertNode2,
|
|
3205
|
-
insertOrdinal: (ordinal) => insertNode(state, ordinal),
|
|
3591
|
+
insertOrdinal: (ordinal, connectsAfterwards = false) => insertNode(state, ordinal, false, connectsAfterwards),
|
|
3206
3592
|
markTombstone: (docId) => {
|
|
3207
3593
|
const ord = store.getOrdinal(docId);
|
|
3208
3594
|
if (ord !== void 0) markTombstone(state, ord);
|
|
@@ -3219,19 +3605,22 @@ function createHNSWIndex(dimension, store, config, quantizer, handles) {
|
|
|
3219
3605
|
return ord !== void 0 && isTombstoned(state, ord);
|
|
3220
3606
|
},
|
|
3221
3607
|
search: (query, k, searchMetric, minSimilarity, options) => search(state, docIdOf, query, k, searchMetric, minSimilarity, options),
|
|
3222
|
-
|
|
3608
|
+
searchOffThread: (query, k, searchMetric, minSimilarity, options) => searchOffThread(state, docIdOf, query, k, searchMetric, minSimilarity, options),
|
|
3609
|
+
clear: () => relinking(() => resetGraph(state)),
|
|
3223
3610
|
retire: () => Atomics.store(shared.header, GRAPH_RETIRED, 1),
|
|
3224
3611
|
entries: entriesIterator,
|
|
3225
3612
|
compactionNeeded,
|
|
3226
|
-
compactTombstones: () =>
|
|
3227
|
-
connectUnreached: () =>
|
|
3228
|
-
|
|
3613
|
+
compactTombstones: () => relinking(() => compactTombstones(state)),
|
|
3614
|
+
connectUnreached: () => relinking(() => connectAfterBuild(state)),
|
|
3615
|
+
connectOffThread: () => connectOffThread(state),
|
|
3616
|
+
connectOnThisThread: (inSlices) => connectOnThisThread(state, inSlices),
|
|
3617
|
+
rebuild: () => relinking(() => rebuild(state)),
|
|
3229
3618
|
exclusively,
|
|
3230
|
-
deserialize: (data) =>
|
|
3619
|
+
deserialize: (data) => relinking(() => deserializeGraph(state, store, data)),
|
|
3231
3620
|
serializeNumbered: (numberOfOrdinal, ordinalOfNumber, partSize) => serializeNumberedGraphParts(state, numberOfOrdinal, ordinalOfNumber, partSize),
|
|
3232
|
-
deserializeNumbered: (graph, ordinalOfNumber) =>
|
|
3621
|
+
deserializeNumbered: (graph, ordinalOfNumber) => relinking(() => deserializeNumberedGraph(state, graph, ordinalOfNumber)),
|
|
3233
3622
|
exportSnapshot: () => exportSnapshot(state),
|
|
3234
|
-
restoreSnapshot: (snapshot) =>
|
|
3623
|
+
restoreSnapshot: (snapshot) => relinking(() => restoreSnapshot(state, snapshot))
|
|
3235
3624
|
};
|
|
3236
3625
|
}
|
|
3237
3626
|
|
|
@@ -3885,4 +4274,4 @@ function createOsqQuantizer(dimension, bits, metric, store) {
|
|
|
3885
4274
|
};
|
|
3886
4275
|
}
|
|
3887
4276
|
|
|
3888
|
-
export {
|
|
4277
|
+
export { GRAPH_RETIRED, IN_MEMORY, NATIVE_OK, NOTHING_STAGED, QUERY_STAGED, REFUSAL_COLLECTION_MIN_INTERVAL_MS, REFUSAL_COLLECTION_TIME_MULTIPLE, STORE_BLOCK_COUNT, STORE_CALIBRATION_GENERATION, STORE_CODE_BLOCK_COUNT, STORE_DOC_ID_BYTES, STORE_LIVE_COUNT, STORE_ORDINAL_LAYOUT_GENERATION, STORE_RELEASED_VECTORS_TO_DISK, STORE_REMOVED_COUNT, STORE_SLOTS, STORE_UNPLACED_COUNT, UI_THREAD_BACKGROUND_SLICE_DURING_WRITES_MS, UI_THREAD_HOP_BEFORE_TURN_WITHIN_MS, UI_THREAD_TURN_BUDGET_MS, VECTOR_MEMORY_LIMITS, addToOrdinalFilter, adoptBackgroundScheduler, arenaFloat32Distance, backgroundTurnIsSpent, blocksGrowthBytes, centroidOfCentroidSums, computeCodeBlockLayout, cosineSimilarityWithMagnitudes, countOfCentroidSums, createCentroidSums, createHNSWIndex, createOrdinalFilter, createOsqQuantizer, createOsqScratch, createSharedVectorStoreHandles, createVectorBlock, defaultEfSearch, defaultRescoreDepth, detachNativeStore, dotProduct, ensureBlockSlots, euclideanDistance, fixedView, graphWithoutNodes, growBufferTo, grownByteLength, holdWritesAndBackgroundWork, insertNode, magnitude, meanOfCentroidSums, nativeMetricCode, nativeScoresOf, nativeStoreFor, nativeStoreScratchBytes, nodeCountOf, noteFallback, openGraphState, openSharedQuantizer, openVectorBlock, ordinalFilterHas, ordinalFilterValues, osqBitsOf, osqDistance, osqEstimate, osqQuantize, releaseLocksHeldBy, removeFromOrdinalFilter, requireWholeNeighbourLists, resetStoreHeader, scalarQueryProducts, searchOrdinals, sharedMemoryAvailable, sharedVectorStoreBytes, shuffleInPlace, shuffleStep, slotByteOffset, squaredLengthsOfCentroidSums, threadedNativeCore, toDistance, toScore, tombstoneCountOf, topLayerInParts, turnsAreBudgeted, unplacedChunkCount, withNativeThreadSlot, yieldBackgroundTurn };
|