@delali/narsil 0.3.1-next.145 → 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.mjs +2 -2
- package/dist/adapters/gcs.mjs +2 -2
- package/dist/adapters/indexeddb.mjs +1 -1
- package/dist/adapters/s3.mjs +2 -2
- package/dist/analysis-change-ZCJNYBJM.mjs +39 -0
- package/dist/{analysis-change-entry-V4SQQSXQ.mjs → analysis-change-entry-YN3ELL6C.mjs} +1 -1
- package/dist/browser/{analysis-change-QTCQ5ETU.mjs → analysis-change-M65AZQQG.mjs} +8 -5
- package/dist/browser/{analysis-change-entry-KYEQSP3I.mjs → analysis-change-entry-H3YIOLXZ.mjs} +1 -1
- package/dist/browser/{chunk-GP4QLUQM.mjs → chunk-2JABMB4S.mjs} +10 -6
- package/dist/browser/{chunk-5WYWLTM5.mjs → chunk-4DYLCICG.mjs} +2 -2
- package/dist/browser/{chunk-75PMIFQA.mjs → chunk-4RD3AFSB.mjs} +1 -1
- package/dist/browser/{chunk-XWMEGKDC.mjs → chunk-5V74FFZE.mjs} +2 -2
- package/dist/browser/{chunk-PMBSBSCN.mjs → chunk-6OWX3OP2.mjs} +2 -2
- package/dist/browser/chunk-BRWY3JCN.mjs +678 -0
- package/dist/browser/{chunk-ZALEKEUH.mjs → chunk-BVX2MEHA.mjs} +306 -607
- package/dist/browser/{chunk-FXPMF65P.mjs → chunk-D6UFGBF5.mjs} +15 -45
- package/dist/browser/{chunk-QNDWMPV2.mjs → chunk-IAXZAVYL.mjs} +25 -66
- package/dist/browser/chunk-JNOAKDUM.mjs +31 -0
- package/dist/browser/{chunk-BTMRV5MY.mjs → chunk-KAEVGLYN.mjs} +2 -2
- package/dist/browser/{chunk-FHO5N7FD.mjs → chunk-LURXVCHG.mjs} +1 -1
- package/dist/browser/chunk-MPK76GVS.mjs +63 -0
- package/dist/browser/{chunk-6OFS7RUN.mjs → chunk-NVEJJP4R.mjs} +1 -1
- package/dist/browser/{chunk-U77XQJOY.mjs → chunk-ODQP7P3H.mjs} +455 -66
- package/dist/browser/{chunk-IFGTRRPU.mjs → chunk-PIS7ZAP7.mjs} +3 -25
- package/dist/browser/{chunk-XIHLIMFX.mjs → chunk-QMNZFFD3.mjs} +4 -3
- package/dist/browser/{chunk-AOKLYVTT.mjs → chunk-SRL47USS.mjs} +2 -2
- package/dist/browser/chunk-TY7L6OXO.mjs +69 -0
- package/dist/browser/{chunk-LGJ6XMH5.mjs → chunk-W643QV3L.mjs} +6 -5
- package/dist/browser/chunk-WXLBZJMT.mjs +25 -0
- package/dist/browser/{chunk-ZKVDQ5ZH.mjs → chunk-XILIT5MT.mjs} +8 -8
- package/dist/browser/{cold-module-Y2IJAP7S.mjs → cold-module-A5S6JFDN.mjs} +20 -20
- package/dist/browser/{durability-wiring-MLXZ5QQF.mjs → durability-wiring-W5AVV3RF.mjs} +53 -30
- package/dist/browser/gzip-5S7ROJFJ.mjs +1 -0
- package/dist/browser/import-PTT63AGK.mjs +12 -0
- package/dist/browser/{module-5LMDGXQH.mjs → module-CEKA7MQH.mjs} +13 -10
- package/dist/browser/module-X5PGOE47.mjs +4288 -0
- package/dist/browser/{phrase-module-KXNRTWCS.mjs → phrase-module-CNKMUY4U.mjs} +2 -1
- package/dist/browser/pool-DTYSPBMQ.mjs +296 -0
- package/dist/{restore-queue-UAVGBSJG.mjs → browser/restore-queue-DD4LWZK7.mjs} +2 -2
- package/dist/browser/{runtime-ZNEGK33G.mjs → runtime-D2ULZGCN.mjs} +3 -2
- package/dist/browser/{snapshot-2EGS2FYU.mjs → snapshot-DQ6A4PQP.mjs} +18 -14
- package/dist/browser/{write-WMZA6NSF.mjs → write-MAGRAIEH.mjs} +14 -11
- package/dist/{capabilities-CNnzGtqP.d.ts → capabilities-BT-HLDC8.d.ts} +2 -2
- package/dist/{chunk-FRJ5RGX7.mjs → chunk-2HJWQPR6.mjs} +2 -2
- package/dist/{chunk-DKMZ7JFW.mjs → chunk-3BVGJ4JR.mjs} +10 -4
- package/dist/{chunk-QYMAYU7M.mjs → chunk-3HV7M5OJ.mjs} +155 -149
- package/dist/chunk-3MXV3VHR.mjs +46 -0
- package/dist/{chunk-6FOJKNUR.mjs → chunk-3SBJVQLL.mjs} +2 -2
- package/dist/{chunk-PRID7CA6.mjs → chunk-3TVDTACC.mjs} +1 -1
- package/dist/{chunk-RTVAWNUL.mjs → chunk-5WB2A3XU.mjs} +9 -6
- package/dist/{chunk-LWFK3TC2.mjs → chunk-65WCV5JO.mjs} +1 -1
- package/dist/{chunk-G6Q5DEF5.mjs → chunk-6BWLDLS3.mjs} +3 -46
- package/dist/{chunk-W6M4RRAT.mjs → chunk-6C5EX2QR.mjs} +3 -3
- package/dist/{chunk-HOC5JP2H.mjs → chunk-6F6USYII.mjs} +119 -11
- package/dist/{chunk-7523VCM4.mjs → chunk-7HKWO4BJ.mjs} +7 -7
- package/dist/{chunk-ONDEEBTA.mjs → chunk-7N223GWV.mjs} +2 -2
- package/dist/{chunk-UGQULMSU.mjs → chunk-ADBS5XRI.mjs} +10 -10
- package/dist/{chunk-MJTEU2XK.mjs → chunk-AWNHDBKV.mjs} +429 -73
- package/dist/{chunk-2E2ZFOPT.mjs → chunk-B2FTZNNF.mjs} +2 -2
- package/dist/{chunk-NWTEJ2T7.mjs → chunk-B7XIOAMK.mjs} +3 -3
- package/dist/{chunk-W55X2BYN.mjs → chunk-BEZH7VEH.mjs} +1 -1
- package/dist/chunk-BTPGQC6Z.mjs +27 -0
- package/dist/{chunk-KG5N7LE6.mjs → chunk-CYYSZPVV.mjs} +11 -11
- package/dist/{chunk-HTMUGEFU.mjs → chunk-DOY6EG76.mjs} +6 -6
- package/dist/{chunk-UHVTEVF5.mjs → chunk-F22IOCR2.mjs} +10 -6
- package/dist/{chunk-FTQLF5JI.mjs → chunk-IRWP524D.mjs} +1 -1
- package/dist/{chunk-XLAI4OIO.mjs → chunk-IZT3G24Q.mjs} +2 -2
- package/dist/{chunk-SE7MKJVK.mjs → chunk-J7M73VY7.mjs} +1 -1
- package/dist/chunk-KAKQ74LS.mjs +53 -0
- package/dist/{chunk-GVPYMSLO.mjs → chunk-KYVRZAYP.mjs} +1 -1
- package/dist/{chunk-F442VZUL.mjs → chunk-KZ5GQE4Z.mjs} +5 -5
- package/dist/{chunk-WDEWU46C.mjs → chunk-KZQIVGW7.mjs} +2 -2
- package/dist/{chunk-7AJAW6NN.mjs → chunk-L7TIAYPX.mjs} +8 -8
- package/dist/{chunk-GRFXSEFF.mjs → chunk-LDGGR7YT.mjs} +4 -81
- package/dist/{chunk-WMIV7PJ7.mjs → chunk-LJ4ENXOD.mjs} +15 -14
- package/dist/chunk-LQG5G2LY.mjs +39 -0
- package/dist/{chunk-IQHZMCLX.mjs → chunk-MDF6PDIA.mjs} +2 -0
- package/dist/{chunk-QXH2CS4V.mjs → chunk-NVTFQFUL.mjs} +7 -26
- package/dist/{chunk-5K2JHKM3.mjs → chunk-NYSONUB7.mjs} +1 -1
- package/dist/{chunk-OH7SX5MY.mjs → chunk-O4KUNDVF.mjs} +12 -10
- package/dist/{chunk-EBIHRL7B.mjs → chunk-Q2UL2TPC.mjs} +1 -1
- package/dist/{chunk-RNUP6WZ6.mjs → chunk-QEYF2SQ6.mjs} +2 -2
- package/dist/{chunk-RVBUQITB.mjs → chunk-QN5WVV5K.mjs} +7 -7
- package/dist/{chunk-RIIUZJQ3.mjs → chunk-QYRNLLLI.mjs} +1 -1
- package/dist/{chunk-BTARFTEN.mjs → chunk-SOUZMPME.mjs} +4 -4
- package/dist/{chunk-ISUOSACK.mjs → chunk-T4CJDBBE.mjs} +1 -1
- package/dist/{chunk-DHEJAGVW.mjs → chunk-TTCKT2RT.mjs} +5 -5
- package/dist/{chunk-QU2XF7VI.mjs → chunk-U2726TL5.mjs} +5 -4
- package/dist/{chunk-LYKUJNAV.mjs → chunk-U46IZNCW.mjs} +2 -2
- package/dist/{chunk-SNB4DYL3.mjs → chunk-U6NE6RCV.mjs} +4 -4
- package/dist/{chunk-SA52N7G3.mjs → chunk-VP6XRMWR.mjs} +4 -4
- package/dist/{chunk-YUCGFPMS.mjs → chunk-VQDZVWN3.mjs} +449 -405
- package/dist/{chunk-IWVEG5CX.mjs → chunk-XIHUI4KB.mjs} +2 -2
- package/dist/{chunk-IV2XTSS2.mjs → chunk-XKPNKR3V.mjs} +16 -46
- package/dist/{chunk-UQS5PAS5.mjs → chunk-YGQOPB2Z.mjs} +1 -1
- package/dist/{chunk-SVO6NV4D.mjs → chunk-YKEHQUSZ.mjs} +4 -4
- package/dist/{chunk-6Z22L5RN.mjs → chunk-ZAYWOHVG.mjs} +1 -1
- package/dist/{chunk-QLDLQW36.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-X5SBWARI.mjs → chunk-ZYKUD5NX.mjs} +9 -7
- package/dist/{client-DoYPHcUn.d.ts → client-Cn3gNxUU.d.ts} +3 -3
- package/dist/client.d.ts +5 -5
- package/dist/client.mjs +2 -0
- package/dist/{cold-module-NUD332YD.mjs → cold-module-2WWGBFJC.mjs} +36 -33
- package/dist/{config-CuUfls_H.d.ts → config-CfhH1IWQ.d.ts} +1 -1
- package/dist/{config-Dzs46im6.d.ts → config-aIsy7mcL.d.ts} +52 -1
- package/dist/direct-executor-QLVHMELJ.mjs +24 -0
- package/dist/distribution/coordinator/etcd.mjs +1 -1
- package/dist/distribution/transport/grpc.mjs +1 -1
- package/dist/distribution.d.ts +4 -4
- package/dist/distribution.mjs +150 -255
- package/dist/{durability-wiring-K7RDXWL6.mjs → durability-wiring-GNWQSZI3.mjs} +67 -42
- package/dist/embeddings/openai.mjs +2 -2
- package/dist/{engine-C0ifUEcm.d.ts → engine-CJRUHXgf.d.ts} +1 -1
- package/dist/gzip-F4HMIEEQ.mjs +1 -0
- package/dist/import-DX55PN4G.mjs +41 -0
- package/dist/index.browser.mjs +7 -4
- package/dist/index.d.ts +539 -5
- package/dist/index.mjs +22 -16
- package/dist/index.react-native.mjs +19 -0
- package/dist/{long-query-thread-FKVHRCHF.mjs → long-query-thread-SCUE62TO.mjs} +20 -17
- package/dist/{module-GJUKW5VU.mjs → module-HW6IXUM6.mjs} +601 -108
- package/dist/{module-TMFIWOD2.mjs → module-V5K4ZP23.mjs} +29 -23
- package/dist/{paged-partition-archive-WNUEMYWM.mjs → paged-partition-archive-FDIIWZNR.mjs} +31 -25
- package/dist/partial-words.mjs +5 -5
- package/dist/pattern.mjs +3 -3
- package/dist/persistence/durability/checkpoint-worker.mjs +28 -22
- package/dist/{phrase-module-OMY3QQV7.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-K7UFXEJS.mjs → react-native/chunks/chunk-GV5KFQ6M.mjs} +12 -6
- 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/react-native/chunks/chunk-PU55IOG4.mjs +910 -0
- 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-Q6VFGLMG.mjs → react-native/chunks/module-JBBH6PZH.mjs} +609 -144
- 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-SOAHKZSQ.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/react-native/partial-words.mjs +733 -0
- package/dist/react-native/pattern.mjs +2442 -0
- package/dist/react-native/synonyms.mjs +460 -0
- package/dist/react.d.ts +7 -7
- package/dist/react.mjs +2 -0
- package/dist/{rerank-ZZ5CHKLW.mjs → rerank-3W54N6P2.mjs} +4 -4
- package/dist/rerankers/http.mjs +2 -2
- package/dist/restore-queue-BQWWNNQI.mjs +41 -0
- package/dist/{runtime-RAOCKSYA.mjs → runtime-L2DZYY6N.mjs} +5 -5
- package/dist/server.d.ts +8 -8
- package/dist/server.mjs +32 -28
- package/dist/{snapshot-DB5ZVCDN.mjs → snapshot-EHXTOTW5.mjs} +39 -33
- package/dist/synonyms.mjs +3 -3
- package/dist/{tasks-ChWp0wrF.d.ts → tasks-C4ElXr4P.d.ts} +2 -2
- package/dist/thread-I7DVHHW7.mjs +31 -0
- package/dist/vector/search-worker.mjs +7 -5
- package/dist/workers/entry.mjs +9 -9
- package/dist/{write-KZVTLGCI.mjs → write-SDJXXQ2G.mjs} +29 -23
- package/package.json +88 -7
- package/dist/analysis-change-D5APH4Z3.mjs +0 -34
- package/dist/browser/import-FTMLTPGQ.mjs +0 -9
- package/dist/direct-executor-FDQYQEJQ.mjs +0 -22
- package/dist/import-6KXFY6XI.mjs +0 -35
- package/dist/thread-OV6T555H.mjs +0 -28
- /package/dist/{chunk-22YPZVMG.mjs → chunk-ZXNQEW43.mjs} +0 -0
|
@@ -1,25 +1,78 @@
|
|
|
1
1
|
import { osqCodeBytes, osqStagedQueryBytes, osqRecordBytes, unpackLevels, readTrailer, stageQueryLevels, writeRecord } from './chunk-37CD3OKS.mjs';
|
|
2
|
-
import { stopUsingTheNativeSearchCore,
|
|
2
|
+
import { stopUsingTheNativeSearchCore, nativeSearchCoreIsEnabled, noteFallback } from './chunk-DJHHF2L5.mjs';
|
|
3
3
|
import { markSimdUnavailable } from './chunk-KOKM4PQN.mjs';
|
|
4
|
-
import {
|
|
4
|
+
import { OSQ_STEPS, loadNativeCore, OSQ_GRID, OSQ_QUERY_BITS, NATIVE_OK, OSQ_REFINE_ROUNDS, OSQ_REFINE_TOLERANCE, OSQ_PLACEMENT_QUERY_BITS, NATIVE_NEEDS_ROOM, OSQ_LAMBDA, NATIVE_GRAPH_NOT_HELD_ALONE } from './chunk-NVTFQFUL.mjs';
|
|
5
|
+
import { turnsAreBudgeted, holdWrites, yieldBackgroundTurn, backgroundTurnIsSpent } from './chunk-LQG5G2LY.mjs';
|
|
6
|
+
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, NATIVE_ATTACH_RETRY_MS, LOCK_SPIN_ITERATIONS, LOCK_WAIT_SLICE_MS, GRAPH_LOCK_WAIT_SLICE_MS, GRAPH_LOCK_WAIT_DEADLINE_MS } from './chunk-BTPGQC6Z.mjs';
|
|
5
7
|
import { threadSlotGone } from './chunk-RFBLQLLZ.mjs';
|
|
6
|
-
import { DEFAULT_EF_SEARCH, COMPACTION_TOMBSTONE_RATIO, COMPACTION_ABSOLUTE_THRESHOLD, PLACEMENT_ROOM_REQUESTS, MAX_LAYER_CAP, INITIAL_LIST_CAPACITY, INITIAL_UPPER_SLOTS,
|
|
7
|
-
import { NarsilError, ErrorCodes } from './chunk-
|
|
8
|
+
import { DEFAULT_EF_SEARCH, COMPACTION_TOMBSTONE_RATIO, COMPACTION_ABSOLUTE_THRESHOLD, PLACEMENT_ROOM_REQUESTS, MAX_LAYER_CAP, INITIAL_LIST_CAPACITY, INITIAL_UPPER_SLOTS, CONNECT_RESTARTS_BEFORE_ONE_PASS, FARTHEST_REJECTED_LINKS_KEPT, CONNECT_STEPS_BETWEEN_CLOCK_CHECKS, NEAREST_LINK_FALLBACK_HOSTS } from './chunk-ZXX5GZEX.mjs';
|
|
9
|
+
import { NarsilError, ErrorCodes } from './chunk-MDF6PDIA.mjs';
|
|
8
10
|
import { compareCodePoints } from './chunk-YTJCGKM4.mjs';
|
|
9
11
|
|
|
12
|
+
// src/vector/shared-buffers/memory-limits.ts
|
|
13
|
+
var VECTOR_MEMORY_LIMITS = {
|
|
14
|
+
maxOrdinals: MAX_VECTOR_ORDINALS,
|
|
15
|
+
maxDocIdTableBytes: MAX_DOC_ID_TABLE_BYTES,
|
|
16
|
+
blockBytes: MAX_WASM_PAGES * WASM_PAGE_BYTES
|
|
17
|
+
};
|
|
18
|
+
function reserveVectorRegion(_bytes) {
|
|
19
|
+
return null;
|
|
20
|
+
}
|
|
21
|
+
function hostOwnsMemory(_buffer) {
|
|
22
|
+
return false;
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
// src/vector/shared-buffers/region.ts
|
|
26
|
+
function reserve(maxBytes) {
|
|
27
|
+
try {
|
|
28
|
+
return reserveVectorRegion(maxBytes);
|
|
29
|
+
} catch (err) {
|
|
30
|
+
if (err instanceof NarsilError) throw err;
|
|
31
|
+
throw new NarsilError(
|
|
32
|
+
ErrorCodes.PARTITION_CAPACITY_EXCEEDED,
|
|
33
|
+
`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.`,
|
|
34
|
+
{ bytes: maxBytes, cause: err instanceof Error ? err.message : String(err) }
|
|
35
|
+
);
|
|
36
|
+
}
|
|
37
|
+
}
|
|
38
|
+
function createRegionBuffer(initialBytes, maxBytes) {
|
|
39
|
+
const reserved = reserve(maxBytes);
|
|
40
|
+
if (reserved === null) return null;
|
|
41
|
+
const reservedBytes = reserved.byteLength;
|
|
42
|
+
let logicalBytes = Math.min(initialBytes, reservedBytes);
|
|
43
|
+
Object.defineProperties(reserved, {
|
|
44
|
+
byteLength: { get: () => logicalBytes },
|
|
45
|
+
maxByteLength: { value: reservedBytes },
|
|
46
|
+
resizable: { value: true },
|
|
47
|
+
resize: {
|
|
48
|
+
value(target) {
|
|
49
|
+
if (!Number.isInteger(target) || target < 0 || target > reservedBytes) {
|
|
50
|
+
throw new RangeError(`A vector region can hold between 0 and ${reservedBytes} bytes, not ${target}`);
|
|
51
|
+
}
|
|
52
|
+
if (target < logicalBytes) new Uint8Array(reserved, target, logicalBytes - target).fill(0);
|
|
53
|
+
logicalBytes = target;
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
});
|
|
57
|
+
return reserved;
|
|
58
|
+
}
|
|
59
|
+
|
|
10
60
|
// src/vector/shared-buffers/growable.ts
|
|
11
61
|
function sharedMemoryAvailable() {
|
|
12
62
|
return typeof SharedArrayBuffer === "function";
|
|
13
63
|
}
|
|
64
|
+
var resizableBuffersAvailable = typeof ArrayBuffer.prototype.resize === "function";
|
|
14
65
|
function createGrowableBuffer(initialBytes, maxBytes) {
|
|
15
66
|
const initial = Math.min(initialBytes, maxBytes);
|
|
16
67
|
if (sharedMemoryAvailable()) {
|
|
17
68
|
return new SharedArrayBuffer(initial, { maxByteLength: maxBytes });
|
|
18
69
|
}
|
|
19
|
-
|
|
70
|
+
const region = resizableBuffersAvailable ? null : createRegionBuffer(initial, maxBytes);
|
|
71
|
+
return region ?? new ArrayBuffer(initial, { maxByteLength: maxBytes });
|
|
20
72
|
}
|
|
21
73
|
function createFixedBuffer(bytes) {
|
|
22
|
-
|
|
74
|
+
if (sharedMemoryAvailable()) return new SharedArrayBuffer(bytes);
|
|
75
|
+
return new ArrayBuffer(bytes);
|
|
23
76
|
}
|
|
24
77
|
function nextGrowthTarget(have, needed, max) {
|
|
25
78
|
return Math.min(max, Math.max(needed, have * 2));
|
|
@@ -93,7 +146,7 @@ var HELD_ENTRY = 5;
|
|
|
93
146
|
var HELD_WORDS_PER_THREAD = 32;
|
|
94
147
|
var METRIC_CODES = ["cosine", "dotProduct", "euclidean"];
|
|
95
148
|
function perOrdinal(bytesPerOrdinal, initialOrdinals) {
|
|
96
|
-
return createGrowableBuffer(initialOrdinals * bytesPerOrdinal,
|
|
149
|
+
return createGrowableBuffer(initialOrdinals * bytesPerOrdinal, VECTOR_MEMORY_LIMITS.maxOrdinals * bytesPerOrdinal);
|
|
97
150
|
}
|
|
98
151
|
function createSharedGraphHandles(shape) {
|
|
99
152
|
const header = new Int32Array(createFixedBuffer(GRAPH_HEADER_WORDS * 4), 0, GRAPH_HEADER_WORDS);
|
|
@@ -1040,7 +1093,7 @@ function computeCodeBlockLayout(dimension, bits) {
|
|
|
1040
1093
|
scratchStride,
|
|
1041
1094
|
slotsOffset,
|
|
1042
1095
|
slotStride,
|
|
1043
|
-
capacity: Math.floor((BLOCK_MAX_BYTES - slotsOffset) / slotStride)
|
|
1096
|
+
capacity: Math.floor((Math.min(VECTOR_MEMORY_LIMITS.blockBytes, BLOCK_MAX_BYTES) - slotsOffset) / slotStride)
|
|
1044
1097
|
};
|
|
1045
1098
|
}
|
|
1046
1099
|
|
|
@@ -1080,15 +1133,15 @@ function unplacedChunkCount(ordinals) {
|
|
|
1080
1133
|
function perOrdinal2(bytesPerOrdinal) {
|
|
1081
1134
|
return createGrowableBuffer(
|
|
1082
1135
|
VECTOR_STORE_INITIAL_CAPACITY * bytesPerOrdinal,
|
|
1083
|
-
(
|
|
1136
|
+
(VECTOR_MEMORY_LIMITS.maxOrdinals + 1) * bytesPerOrdinal
|
|
1084
1137
|
);
|
|
1085
1138
|
}
|
|
1086
1139
|
function inMemoryTable() {
|
|
1087
1140
|
const buffer = perOrdinal2(4);
|
|
1088
|
-
new Int32Array(buffer).fill(IN_MEMORY);
|
|
1141
|
+
new Int32Array(buffer, 0, buffer.byteLength / 4).fill(IN_MEMORY);
|
|
1089
1142
|
return buffer;
|
|
1090
1143
|
}
|
|
1091
|
-
function createSharedVectorStoreHandles(dimension, codeBits, blockBytes2 =
|
|
1144
|
+
function createSharedVectorStoreHandles(dimension, codeBits, blockBytes2 = VECTOR_MEMORY_LIMITS.blockBytes) {
|
|
1092
1145
|
return {
|
|
1093
1146
|
dimension,
|
|
1094
1147
|
codeBits,
|
|
@@ -1102,10 +1155,10 @@ function createSharedVectorStoreHandles(dimension, codeBits, blockBytes2 = BLOCK
|
|
|
1102
1155
|
magnitudes: perOrdinal2(8),
|
|
1103
1156
|
present: perOrdinal2(1),
|
|
1104
1157
|
unplaced: perOrdinal2(1),
|
|
1105
|
-
unplacedChunks: createGrowableBuffer(4, unplacedChunkCount(
|
|
1158
|
+
unplacedChunks: createGrowableBuffer(4, unplacedChunkCount(VECTOR_MEMORY_LIMITS.maxOrdinals) * 4),
|
|
1106
1159
|
removed: perOrdinal2(1),
|
|
1107
1160
|
partitions: perOrdinal2(4),
|
|
1108
|
-
docIdBytes: createGrowableBuffer(VECTOR_STORE_INITIAL_CAPACITY * 16,
|
|
1161
|
+
docIdBytes: createGrowableBuffer(VECTOR_STORE_INITIAL_CAPACITY * 16, VECTOR_MEMORY_LIMITS.maxDocIdTableBytes),
|
|
1109
1162
|
docIdOffsets: perOrdinal2(4),
|
|
1110
1163
|
codePresent: perOrdinal2(1),
|
|
1111
1164
|
diskFile: inMemoryTable(),
|
|
@@ -1133,10 +1186,6 @@ function sharedVectorStoreBytes(handles) {
|
|
|
1133
1186
|
return bytes;
|
|
1134
1187
|
}
|
|
1135
1188
|
|
|
1136
|
-
// src/vector/native/types.ts
|
|
1137
|
-
var NATIVE_OK = 0;
|
|
1138
|
-
var NATIVE_NEEDS_ROOM = 3;
|
|
1139
|
-
|
|
1140
1189
|
// src/vector/native/store.ts
|
|
1141
1190
|
var METRIC_CODES2 = { cosine: 0, dotProduct: 1, euclidean: 2 };
|
|
1142
1191
|
var attachedStores = /* @__PURE__ */ new WeakMap();
|
|
@@ -1144,13 +1193,15 @@ function nativeMetricCode(metric) {
|
|
|
1144
1193
|
return METRIC_CODES2[metric];
|
|
1145
1194
|
}
|
|
1146
1195
|
function isSharedMemory(buffer) {
|
|
1147
|
-
|
|
1196
|
+
if (typeof SharedArrayBuffer === "function" && buffer instanceof SharedArrayBuffer) return true;
|
|
1197
|
+
return hostOwnsMemory();
|
|
1148
1198
|
}
|
|
1149
1199
|
function blockBytes(block) {
|
|
1150
1200
|
const storage = block.storage;
|
|
1151
1201
|
if (storage.kind === "shared-memory") return new Uint8Array(storage.memory.buffer, block.layout.slotsOffset);
|
|
1152
1202
|
if (storage.kind === "bytes" && isSharedMemory(storage.buffer)) {
|
|
1153
|
-
|
|
1203
|
+
const offset = block.layout.slotsOffset;
|
|
1204
|
+
return new Uint8Array(storage.buffer, offset, Math.max(0, storage.buffer.byteLength - offset));
|
|
1154
1205
|
}
|
|
1155
1206
|
return null;
|
|
1156
1207
|
}
|
|
@@ -1389,11 +1440,14 @@ function nativeFieldFor(state) {
|
|
|
1389
1440
|
return attached.field;
|
|
1390
1441
|
}
|
|
1391
1442
|
function wakeSleepingThreads(state, field) {
|
|
1392
|
-
|
|
1393
|
-
|
|
1394
|
-
|
|
1443
|
+
wakeListedThreads(state, field.wakes);
|
|
1444
|
+
}
|
|
1445
|
+
function wakeListedThreads(state, wakes) {
|
|
1446
|
+
const count = Math.min(wakes[0] ?? 0, wakes.length - WAKE_COUNT_WORDS);
|
|
1447
|
+
if (count <= 0) return;
|
|
1448
|
+
wakes[0] = 0;
|
|
1395
1449
|
for (let i = 1; i <= count; i++) {
|
|
1396
|
-
const ordinal =
|
|
1450
|
+
const ordinal = wakes[i];
|
|
1397
1451
|
if (ordinal === WAKE_ENTRY_LOCK) {
|
|
1398
1452
|
Atomics.notify(state.header, GRAPH_ENTRY_LOCK);
|
|
1399
1453
|
continue;
|
|
@@ -1403,8 +1457,45 @@ function wakeSleepingThreads(state, field) {
|
|
|
1403
1457
|
}
|
|
1404
1458
|
}
|
|
1405
1459
|
|
|
1460
|
+
// src/vector/native/thread-slots.ts
|
|
1461
|
+
var freeSlots = Array.from({ length: NATIVE_THREAD_SEARCH_SLOTS }, (_, i) => VECTOR_SCRATCH_SLOTS - 1 - i);
|
|
1462
|
+
var waitingForSlot = [];
|
|
1463
|
+
function hasNativeThreads(core) {
|
|
1464
|
+
return core.searchAsync !== void 0 && core.scoreAsync !== void 0;
|
|
1465
|
+
}
|
|
1466
|
+
function threadedNativeCore() {
|
|
1467
|
+
if (!nativeSearchCoreIsEnabled()) return null;
|
|
1468
|
+
const core = loadNativeCore();
|
|
1469
|
+
return core !== null && hasNativeThreads(core) ? core : null;
|
|
1470
|
+
}
|
|
1471
|
+
function claimSlot() {
|
|
1472
|
+
const slot = freeSlots.pop();
|
|
1473
|
+
if (slot !== void 0) return Promise.resolve(slot);
|
|
1474
|
+
return new Promise((resolve) => waitingForSlot.push(resolve));
|
|
1475
|
+
}
|
|
1476
|
+
function claimNativeThreadSlotNow() {
|
|
1477
|
+
return freeSlots.pop() ?? null;
|
|
1478
|
+
}
|
|
1479
|
+
function returnSlot(slot) {
|
|
1480
|
+
const next = waitingForSlot.shift();
|
|
1481
|
+
if (next !== void 0) {
|
|
1482
|
+
next(slot);
|
|
1483
|
+
return;
|
|
1484
|
+
}
|
|
1485
|
+
freeSlots.push(slot);
|
|
1486
|
+
}
|
|
1487
|
+
async function withNativeThreadSlot(work) {
|
|
1488
|
+
const slot = await claimSlot();
|
|
1489
|
+
try {
|
|
1490
|
+
return await work(slot);
|
|
1491
|
+
} finally {
|
|
1492
|
+
returnSlot(slot);
|
|
1493
|
+
}
|
|
1494
|
+
}
|
|
1495
|
+
|
|
1406
1496
|
// src/vector/native/writes.ts
|
|
1407
1497
|
var CALL_RAISED = -1;
|
|
1498
|
+
var NO_NEARBY_NODES = new Int32Array(0);
|
|
1408
1499
|
function writeToTheGraph(state, field, write) {
|
|
1409
1500
|
let status;
|
|
1410
1501
|
try {
|
|
@@ -1453,6 +1544,53 @@ function nativeConnect(state, field, metric, nearby) {
|
|
|
1453
1544
|
);
|
|
1454
1545
|
return writeToTheGraph(state, field, connect) === NATIVE_OK;
|
|
1455
1546
|
}
|
|
1547
|
+
function connectsOffThread(core) {
|
|
1548
|
+
return core.connectUnreachedAsync !== void 0;
|
|
1549
|
+
}
|
|
1550
|
+
function nativeConnectsOffThread(field) {
|
|
1551
|
+
return connectsOffThread(field.core);
|
|
1552
|
+
}
|
|
1553
|
+
async function nativeConnectOffThread(state, field, metric) {
|
|
1554
|
+
const core = field.core;
|
|
1555
|
+
if (!connectsOffThread(core)) return "failed";
|
|
1556
|
+
const slot = claimNativeThreadSlotNow();
|
|
1557
|
+
if (slot === null) return "graphBusy";
|
|
1558
|
+
let outcome;
|
|
1559
|
+
try {
|
|
1560
|
+
outcome = await core.connectUnreachedAsync(
|
|
1561
|
+
field.graph,
|
|
1562
|
+
field.store.handle,
|
|
1563
|
+
nativeMetricCode(metric),
|
|
1564
|
+
NO_NEARBY_NODES,
|
|
1565
|
+
slot
|
|
1566
|
+
);
|
|
1567
|
+
} catch {
|
|
1568
|
+
return "failed";
|
|
1569
|
+
} finally {
|
|
1570
|
+
returnSlot(slot);
|
|
1571
|
+
}
|
|
1572
|
+
wakeListedThreads(state, outcome.wakes);
|
|
1573
|
+
Atomics.notify(state.header, GRAPH_LOCK);
|
|
1574
|
+
if (outcome.status === NATIVE_OK) return "connected";
|
|
1575
|
+
return outcome.status === NATIVE_GRAPH_NOT_HELD_ALONE ? "graphBusy" : "failed";
|
|
1576
|
+
}
|
|
1577
|
+
|
|
1578
|
+
// src/vector/hnsw/connect-steps.ts
|
|
1579
|
+
function newPace() {
|
|
1580
|
+
return { steps: 0 };
|
|
1581
|
+
}
|
|
1582
|
+
function stepTaken(pace) {
|
|
1583
|
+
pace.steps += 1;
|
|
1584
|
+
if (pace.steps < CONNECT_STEPS_BETWEEN_CLOCK_CHECKS) return false;
|
|
1585
|
+
pace.steps = 0;
|
|
1586
|
+
return true;
|
|
1587
|
+
}
|
|
1588
|
+
function drain(steps) {
|
|
1589
|
+
for (; ; ) {
|
|
1590
|
+
const next = steps.next();
|
|
1591
|
+
if (next.done === true) return next.value;
|
|
1592
|
+
}
|
|
1593
|
+
}
|
|
1456
1594
|
|
|
1457
1595
|
// src/vector/similarity.ts
|
|
1458
1596
|
function magnitude(v) {
|
|
@@ -1509,6 +1647,14 @@ function mixedUint32(value) {
|
|
|
1509
1647
|
function unitDrawOf(value) {
|
|
1510
1648
|
return (mixedUint32(value) + HALF_A_STEP) / TWO_TO_THE_32;
|
|
1511
1649
|
}
|
|
1650
|
+
function shuffleStep(items, i, stream) {
|
|
1651
|
+
const next = mixedUint32(stream);
|
|
1652
|
+
const j = Math.floor(next / TWO_TO_THE_32 * (i + 1));
|
|
1653
|
+
const held = items[i];
|
|
1654
|
+
items[i] = items[j];
|
|
1655
|
+
items[j] = held;
|
|
1656
|
+
return next;
|
|
1657
|
+
}
|
|
1512
1658
|
function shuffleInPlace(items) {
|
|
1513
1659
|
let stream = items.length;
|
|
1514
1660
|
for (let i = items.length - 1; i > 0; i--) {
|
|
@@ -1871,7 +2017,10 @@ function writeKeepingLastLinks(state, ord, sorted, kept, held) {
|
|
|
1871
2017
|
// src/vector/hnsw/nearest-links.ts
|
|
1872
2018
|
var NOT_YET_FOUND = -2;
|
|
1873
2019
|
function nearer(a, b) {
|
|
1874
|
-
return a.distance
|
|
2020
|
+
return nearerPair(a.distance, a.ord, b.distance, b.ord);
|
|
2021
|
+
}
|
|
2022
|
+
function nearerPair(aDistance, aOrd, bDistance, bOrd) {
|
|
2023
|
+
return aDistance < bDistance || aDistance === bDistance && aOrd < bOrd;
|
|
1875
2024
|
}
|
|
1876
2025
|
function listOf(state, ord) {
|
|
1877
2026
|
const adjacency = state.adjacency;
|
|
@@ -1882,13 +2031,20 @@ function listOf(state, ord) {
|
|
|
1882
2031
|
function nearestInList(pass, ord) {
|
|
1883
2032
|
const known = pass.nearest[ord];
|
|
1884
2033
|
if (known !== NOT_YET_FOUND) return known;
|
|
1885
|
-
let
|
|
1886
|
-
|
|
2034
|
+
let nearest = -1;
|
|
2035
|
+
let nearestDistance = Number.POSITIVE_INFINITY;
|
|
2036
|
+
const level0 = pass.state.adjacency.level0;
|
|
2037
|
+
const base = layerBase(pass.state.adjacency, ord, 0);
|
|
2038
|
+
const end = base === ABSENT ? base : base + 1 + level0[base];
|
|
2039
|
+
for (let at = base + 1; base !== ABSENT && at < end; at++) {
|
|
2040
|
+
const neighbour = level0[at];
|
|
1887
2041
|
if (neighbour === ord || !isLive(pass.state, neighbour)) continue;
|
|
1888
|
-
const
|
|
1889
|
-
if (
|
|
2042
|
+
const distance = pass.distance(ord, neighbour);
|
|
2043
|
+
if (nearest === -1 || nearerPair(distance, neighbour, nearestDistance, nearest)) {
|
|
2044
|
+
nearest = neighbour;
|
|
2045
|
+
nearestDistance = distance;
|
|
2046
|
+
}
|
|
1890
2047
|
}
|
|
1891
|
-
const nearest = best === null ? -1 : best.ord;
|
|
1892
2048
|
pass.nearest[ord] = nearest;
|
|
1893
2049
|
return nearest;
|
|
1894
2050
|
}
|
|
@@ -1903,15 +2059,17 @@ function fallbackHostsFor(pass, ord, nearest) {
|
|
|
1903
2059
|
}
|
|
1904
2060
|
function replaceableSlot(pass, host, list) {
|
|
1905
2061
|
let farthest = -1;
|
|
1906
|
-
let
|
|
2062
|
+
let farthestOrd = -1;
|
|
2063
|
+
let farthestDistance = Number.NEGATIVE_INFINITY;
|
|
1907
2064
|
for (let i = 0; i < list.length; i++) {
|
|
1908
2065
|
const neighbour = list[i];
|
|
1909
2066
|
if (incomingCount(pass.state.adjacency, neighbour) < 2) continue;
|
|
1910
2067
|
if (isLive(pass.state, neighbour) && nearestInList(pass, neighbour) === host) continue;
|
|
1911
|
-
const
|
|
1912
|
-
if (
|
|
2068
|
+
const distance = pass.distance(host, neighbour);
|
|
2069
|
+
if (farthest === -1 || nearerPair(farthestDistance, farthestOrd, distance, neighbour)) {
|
|
1913
2070
|
farthest = i;
|
|
1914
|
-
|
|
2071
|
+
farthestOrd = neighbour;
|
|
2072
|
+
farthestDistance = distance;
|
|
1915
2073
|
}
|
|
1916
2074
|
}
|
|
1917
2075
|
return farthest;
|
|
@@ -1939,6 +2097,9 @@ function linkFrom(pass, host, ord) {
|
|
|
1939
2097
|
return true;
|
|
1940
2098
|
}
|
|
1941
2099
|
function linkFromNearest(state) {
|
|
2100
|
+
drain(linkFromNearestSteps(state, newPace()));
|
|
2101
|
+
}
|
|
2102
|
+
function* linkFromNearestSteps(state, pace) {
|
|
1942
2103
|
const adjacency = state.adjacency;
|
|
1943
2104
|
const slots = adjacencySlots(adjacency);
|
|
1944
2105
|
if (slots > 0) reachNode(adjacency, slots - 1);
|
|
@@ -1948,6 +2109,7 @@ function linkFromNearest(state) {
|
|
|
1948
2109
|
nearest: new Int32Array(slots).fill(NOT_YET_FOUND)
|
|
1949
2110
|
};
|
|
1950
2111
|
for (let ord = 0; ord < slots; ord++) {
|
|
2112
|
+
if (stepTaken(pace)) yield;
|
|
1951
2113
|
if (Atomics.load(adjacency.nearestLinkDue, ord) !== 1) continue;
|
|
1952
2114
|
Atomics.store(adjacency.nearestLinkDue, ord, 0);
|
|
1953
2115
|
if (!isLive(state, ord)) continue;
|
|
@@ -1959,16 +2121,18 @@ function linkFromNearest(state) {
|
|
|
1959
2121
|
|
|
1960
2122
|
// src/vector/hnsw/connect-unreached.ts
|
|
1961
2123
|
var NOT_REACHED_THROUGH_A_NODE = -1;
|
|
2124
|
+
var NO_NEARBY_NODES2 = new Int32Array(0);
|
|
1962
2125
|
function reach(walk, node, through) {
|
|
1963
2126
|
walk.reached[node] = 1;
|
|
1964
2127
|
walk.firstReachedThrough[node] = through;
|
|
1965
2128
|
walk.queue[walk.tail++] = node;
|
|
1966
2129
|
}
|
|
1967
|
-
function walkFrom(state, walk, start, through) {
|
|
2130
|
+
function* walkFrom(state, walk, start, through, pace) {
|
|
1968
2131
|
const adjacency = state.adjacency;
|
|
1969
2132
|
if (walk.reached[start] === 1) return;
|
|
1970
2133
|
reach(walk, start, through);
|
|
1971
2134
|
while (walk.head < walk.tail) {
|
|
2135
|
+
if (stepTaken(pace)) yield;
|
|
1972
2136
|
const ord = walk.queue[walk.head++];
|
|
1973
2137
|
const base = layerBase(adjacency, ord, 0);
|
|
1974
2138
|
if (base === ABSENT) continue;
|
|
@@ -2003,7 +2167,7 @@ function listOf2(state, ord) {
|
|
|
2003
2167
|
if (base === ABSENT) return new Int32Array(0);
|
|
2004
2168
|
return adjacency.level0.slice(base + 1, base + 1 + adjacency.level0[base]);
|
|
2005
2169
|
}
|
|
2006
|
-
function nearestHost(state, walk, orphan, nearby, test) {
|
|
2170
|
+
function* nearestHost(state, walk, orphan, nearby, test, pace) {
|
|
2007
2171
|
const distance = nodeDistanceFunction(state, state.buildMetric);
|
|
2008
2172
|
let best = -1;
|
|
2009
2173
|
let bestDistance = Number.POSITIVE_INFINITY;
|
|
@@ -2015,11 +2179,17 @@ function nearestHost(state, walk, orphan, nearby, test) {
|
|
|
2015
2179
|
bestDistance = away;
|
|
2016
2180
|
}
|
|
2017
2181
|
};
|
|
2018
|
-
for (const host of nearby.list)
|
|
2182
|
+
for (const host of nearby.list) {
|
|
2183
|
+
if (stepTaken(pace)) yield;
|
|
2184
|
+
consider(host);
|
|
2185
|
+
}
|
|
2019
2186
|
for (const host of listOf2(state, orphan))
|
|
2020
2187
|
if (host >= 0 && host < walk.reached.length && nearby.holds[host] !== 1) consider(host);
|
|
2021
2188
|
if (best !== -1) return best;
|
|
2022
|
-
for (let host = 0; host < walk.reached.length; host++)
|
|
2189
|
+
for (let host = 0; host < walk.reached.length; host++) {
|
|
2190
|
+
if (stepTaken(pace)) yield;
|
|
2191
|
+
consider(host);
|
|
2192
|
+
}
|
|
2023
2193
|
return best;
|
|
2024
2194
|
}
|
|
2025
2195
|
function takeOutFarthestLinkOutsideTheWalk(state, walk, host) {
|
|
@@ -2054,7 +2224,7 @@ function appendTo(state, host, orphan) {
|
|
|
2054
2224
|
adjacency.level0[base] = count + 1;
|
|
2055
2225
|
noteLinked(adjacency, orphan);
|
|
2056
2226
|
}
|
|
2057
|
-
function
|
|
2227
|
+
function* connectUnreachedSteps(state, nearby, pace) {
|
|
2058
2228
|
const slots = adjacencySlots(state.adjacency);
|
|
2059
2229
|
const entry = entryPointOf(state);
|
|
2060
2230
|
if (entry < 0 || entry >= slots || !nodeExists(state, entry)) return;
|
|
@@ -2065,7 +2235,7 @@ function connectUnreached(state, nearby) {
|
|
|
2065
2235
|
head: 0,
|
|
2066
2236
|
tail: 0
|
|
2067
2237
|
};
|
|
2068
|
-
walkFrom(state, walk, entry, NOT_REACHED_THROUGH_A_NODE);
|
|
2238
|
+
yield* walkFrom(state, walk, entry, NOT_REACHED_THROUGH_A_NODE, pace);
|
|
2069
2239
|
const held = { list: [], holds: new Uint8Array(slots) };
|
|
2070
2240
|
for (let i = 0; i < nearby.length; i++) {
|
|
2071
2241
|
const ord = nearby[i];
|
|
@@ -2074,17 +2244,27 @@ function connectUnreached(state, nearby) {
|
|
|
2074
2244
|
held.list.push(ord);
|
|
2075
2245
|
}
|
|
2076
2246
|
for (let orphan = 0; orphan < slots; orphan++) {
|
|
2247
|
+
if (stepTaken(pace)) yield;
|
|
2077
2248
|
if (walk.reached[orphan] === 1 || !isLive(state, orphan)) continue;
|
|
2078
|
-
let host = nearestHost(state, walk, orphan, held, hasRoom);
|
|
2249
|
+
let host = yield* nearestHost(state, walk, orphan, held, hasRoom, pace);
|
|
2079
2250
|
if (host === -1) {
|
|
2080
|
-
host = nearestHost(state, walk, orphan, held, holdsLinkOutsideTheWalk);
|
|
2251
|
+
host = yield* nearestHost(state, walk, orphan, held, holdsLinkOutsideTheWalk, pace);
|
|
2081
2252
|
if (host === -1) continue;
|
|
2082
2253
|
takeOutFarthestLinkOutsideTheWalk(state, walk, host);
|
|
2083
2254
|
}
|
|
2084
2255
|
appendTo(state, host, orphan);
|
|
2085
|
-
walkFrom(state, walk, orphan, host);
|
|
2256
|
+
yield* walkFrom(state, walk, orphan, host, pace);
|
|
2086
2257
|
}
|
|
2087
2258
|
}
|
|
2259
|
+
function connectUnreached(state, nearby) {
|
|
2260
|
+
drain(connectUnreachedSteps(state, nearby, newPace()));
|
|
2261
|
+
}
|
|
2262
|
+
function* connectInJsSteps(state) {
|
|
2263
|
+
noteFallback("connect");
|
|
2264
|
+
const pace = newPace();
|
|
2265
|
+
yield* linkFromNearestSteps(state, pace);
|
|
2266
|
+
yield* connectUnreachedSteps(state, NO_NEARBY_NODES2, pace);
|
|
2267
|
+
}
|
|
2088
2268
|
function holdsUnlinkedNode(state) {
|
|
2089
2269
|
const slots = adjacencySlots(state.adjacency);
|
|
2090
2270
|
const entry = entryPointOf(state);
|
|
@@ -2132,7 +2312,7 @@ function leaveIncomingUncounted(state) {
|
|
|
2132
2312
|
Atomics.store(state.header, GRAPH_UNLINKED_NODES, 0);
|
|
2133
2313
|
Atomics.store(state.header, GRAPH_INCOMING_UNCOUNTED, 1);
|
|
2134
2314
|
}
|
|
2135
|
-
function countIncomingBeforeWriting(state, holdsGraphLock) {
|
|
2315
|
+
function countIncomingBeforeWriting(state, holdsGraphLock, connectsAfterwards = false) {
|
|
2136
2316
|
if (Atomics.load(state.header, GRAPH_INCOMING_UNCOUNTED) === 0) return;
|
|
2137
2317
|
if (!holdsGraphLock) lockGraphExclusive(state.locks);
|
|
2138
2318
|
try {
|
|
@@ -2142,14 +2322,81 @@ function countIncomingBeforeWriting(state, holdsGraphLock) {
|
|
|
2142
2322
|
if (slots > 0) reachNode(adjacency, slots - 1);
|
|
2143
2323
|
adjacency.incoming.fill(0);
|
|
2144
2324
|
countEveryLink(adjacency, slots);
|
|
2145
|
-
|
|
2146
|
-
|
|
2325
|
+
const unlinked = holdsUnlinkedNode(state);
|
|
2326
|
+
if (unlinked && !connectsAfterwards) connectThroughEitherCore(state, new Int32Array(0));
|
|
2327
|
+
Atomics.store(state.header, GRAPH_UNLINKED_NODES, unlinked && connectsAfterwards ? 1 : 0);
|
|
2147
2328
|
Atomics.store(state.header, GRAPH_INCOMING_UNCOUNTED, 0);
|
|
2148
2329
|
} finally {
|
|
2149
2330
|
if (!holdsGraphLock) unlockGraphExclusive(state.locks);
|
|
2150
2331
|
}
|
|
2151
2332
|
}
|
|
2152
2333
|
|
|
2334
|
+
// src/vector/hnsw/connect-in-turns.ts
|
|
2335
|
+
function connectHoldingTheGraph(state) {
|
|
2336
|
+
lockGraphExclusive(state.locks);
|
|
2337
|
+
try {
|
|
2338
|
+
connectAfterBuild(state);
|
|
2339
|
+
} finally {
|
|
2340
|
+
unlockGraphExclusive(state.locks);
|
|
2341
|
+
}
|
|
2342
|
+
}
|
|
2343
|
+
function sliceFinished(state, steps) {
|
|
2344
|
+
lockGraphExclusive(state.locks);
|
|
2345
|
+
try {
|
|
2346
|
+
for (; ; ) {
|
|
2347
|
+
if (steps.next().done === true) {
|
|
2348
|
+
Atomics.store(state.header, GRAPH_UNLINKED_NODES, 0);
|
|
2349
|
+
return true;
|
|
2350
|
+
}
|
|
2351
|
+
if (backgroundTurnIsSpent()) return false;
|
|
2352
|
+
}
|
|
2353
|
+
} finally {
|
|
2354
|
+
unlockGraphExclusive(state.locks);
|
|
2355
|
+
}
|
|
2356
|
+
}
|
|
2357
|
+
async function connectedWithoutLinkWrites(state) {
|
|
2358
|
+
const writesBefore = state.linkWrites;
|
|
2359
|
+
const steps = connectInJsSteps(state);
|
|
2360
|
+
while (!sliceFinished(state, steps)) {
|
|
2361
|
+
await yieldBackgroundTurn();
|
|
2362
|
+
if (state.linkWrites !== writesBefore) return false;
|
|
2363
|
+
}
|
|
2364
|
+
return state.linkWrites === writesBefore;
|
|
2365
|
+
}
|
|
2366
|
+
async function connectUntilWritesDrain(state) {
|
|
2367
|
+
let connected = false;
|
|
2368
|
+
while (!connected) connected = await connectedWithoutLinkWrites(state);
|
|
2369
|
+
}
|
|
2370
|
+
async function connectInSlices(state) {
|
|
2371
|
+
for (let restarts = 0; restarts < CONNECT_RESTARTS_BEFORE_ONE_PASS; restarts++) {
|
|
2372
|
+
if (await connectedWithoutLinkWrites(state)) return;
|
|
2373
|
+
}
|
|
2374
|
+
if (turnsAreBudgeted) await holdWrites(() => connectUntilWritesDrain(state));
|
|
2375
|
+
else connectHoldingTheGraph(state);
|
|
2376
|
+
}
|
|
2377
|
+
async function connectThroughTheCoreThread(state, first) {
|
|
2378
|
+
const startedAt = performance.now();
|
|
2379
|
+
let field = first;
|
|
2380
|
+
while (field !== null) {
|
|
2381
|
+
const outcome = await nativeConnectOffThread(state, field, state.buildMetric);
|
|
2382
|
+
if (outcome === "connected") return true;
|
|
2383
|
+
if (outcome === "failed" || performance.now() - startedAt >= GRAPH_LOCK_WAIT_DEADLINE_MS) return false;
|
|
2384
|
+
await yieldBackgroundTurn();
|
|
2385
|
+
field = nativeFieldFor(state);
|
|
2386
|
+
}
|
|
2387
|
+
return false;
|
|
2388
|
+
}
|
|
2389
|
+
function connectOffThread(state) {
|
|
2390
|
+
const field = nativeFieldFor(state);
|
|
2391
|
+
if (field === null || !nativeConnectsOffThread(field)) return null;
|
|
2392
|
+
return connectThroughTheCoreThread(state, field);
|
|
2393
|
+
}
|
|
2394
|
+
function connectOnThisThread(state, inSlices) {
|
|
2395
|
+
if (inSlices || nativeFieldFor(state) === null) return connectInSlices(state);
|
|
2396
|
+
connectHoldingTheGraph(state);
|
|
2397
|
+
return Promise.resolve();
|
|
2398
|
+
}
|
|
2399
|
+
|
|
2153
2400
|
// src/vector/ordinal-filter.ts
|
|
2154
2401
|
function createOrdinalFilter(slots) {
|
|
2155
2402
|
return { bits: new Uint8Array(slots + 7 >>> 3), count: 0 };
|
|
@@ -2461,14 +2708,15 @@ function placeThroughTheCore(state, ord, holdsGraphLock) {
|
|
|
2461
2708
|
}
|
|
2462
2709
|
return false;
|
|
2463
2710
|
}
|
|
2464
|
-
function insertNode(state, ord, holdsGraphLock = false) {
|
|
2711
|
+
function insertNode(state, ord, holdsGraphLock = false, connectsAfterwards = false) {
|
|
2465
2712
|
if (!state.store.holdsOrdinal(ord)) return false;
|
|
2466
2713
|
ensureCapacity(state, ord + 1);
|
|
2467
2714
|
if (nodeExists(state, ord)) return false;
|
|
2468
|
-
countIncomingBeforeWriting(state, holdsGraphLock);
|
|
2715
|
+
countIncomingBeforeWriting(state, holdsGraphLock, connectsAfterwards);
|
|
2469
2716
|
writeRecordBeforePlacement(state, ord);
|
|
2717
|
+
state.linkWrites += 1;
|
|
2470
2718
|
if (placeThroughTheCore(state, ord, holdsGraphLock)) {
|
|
2471
|
-
connectAfterPlacement(state, holdsGraphLock);
|
|
2719
|
+
if (!connectsAfterwards) connectAfterPlacement(state, holdsGraphLock);
|
|
2472
2720
|
return true;
|
|
2473
2721
|
}
|
|
2474
2722
|
if (nodeExists(state, ord)) return false;
|
|
@@ -2483,7 +2731,7 @@ function insertNode(state, ord, holdsGraphLock = false) {
|
|
|
2483
2731
|
} finally {
|
|
2484
2732
|
if (!holdsGraphLock) unlockGraphShared(state.locks);
|
|
2485
2733
|
}
|
|
2486
|
-
connectAfterPlacement(state, holdsGraphLock);
|
|
2734
|
+
if (!connectsAfterwards) connectAfterPlacement(state, holdsGraphLock);
|
|
2487
2735
|
return true;
|
|
2488
2736
|
}
|
|
2489
2737
|
function removeNodeEager(state, ord, excludeOrds) {
|
|
@@ -2552,7 +2800,10 @@ function removeNodeEager(state, ord, excludeOrds) {
|
|
|
2552
2800
|
function markTombstone(state, ord) {
|
|
2553
2801
|
if (!nodeExists(state, ord) || !reachTombstone(state, ord)) return;
|
|
2554
2802
|
const field = nativeFieldFor(state);
|
|
2555
|
-
if (field !== null && nativeRemove(state, field, ord))
|
|
2803
|
+
if (field !== null && nativeRemove(state, field, ord)) {
|
|
2804
|
+
state.linkWrites += 1;
|
|
2805
|
+
return;
|
|
2806
|
+
}
|
|
2556
2807
|
noteFallback("remove");
|
|
2557
2808
|
if (Atomics.compareExchange(state.tombstones, ord, 0, 1) === 0) {
|
|
2558
2809
|
Atomics.add(state.header, GRAPH_TOMBSTONE_COUNT, 1);
|
|
@@ -3006,16 +3257,32 @@ function defaultEfSearch(dimension, k) {
|
|
|
3006
3257
|
}
|
|
3007
3258
|
|
|
3008
3259
|
// src/vector/hnsw/search.ts
|
|
3009
|
-
function
|
|
3260
|
+
function searchDepths(state, k, options) {
|
|
3010
3261
|
const calibrated = activeQuantizer(state);
|
|
3011
3262
|
const quantizer = calibrated === void 0 || calibrated.size === 0 ? void 0 : calibrated;
|
|
3012
|
-
const useQuantized = quantizer !== void 0;
|
|
3013
3263
|
const window = options.rescoreWindow ?? k;
|
|
3014
3264
|
let depth = window;
|
|
3015
3265
|
if (quantizer !== void 0) {
|
|
3016
3266
|
depth = options.oversample === void 0 ? defaultRescoreDepth(quantizer.bits, state.dimension, window) : Math.ceil(window * options.oversample);
|
|
3017
3267
|
}
|
|
3018
3268
|
const ef = Math.max(options.efSearch ?? defaultEfSearch(state.dimension, window), depth);
|
|
3269
|
+
return { ef, depth, useQuantized: quantizer !== void 0 };
|
|
3270
|
+
}
|
|
3271
|
+
function requireQueryDimension(state, query) {
|
|
3272
|
+
if (query.length !== state.dimension) {
|
|
3273
|
+
throw new NarsilError(
|
|
3274
|
+
ErrorCodes.VECTOR_DIMENSION_MISMATCH,
|
|
3275
|
+
`Vector dimension mismatch: expected ${state.dimension}, got ${query.length}`,
|
|
3276
|
+
{ expected: state.dimension, received: query.length }
|
|
3277
|
+
);
|
|
3278
|
+
}
|
|
3279
|
+
}
|
|
3280
|
+
function graphIsEmpty(state) {
|
|
3281
|
+
return entryPointOf(state) === -1 || nodeCountOf(state) - tombstoneCountOf(state) === 0;
|
|
3282
|
+
}
|
|
3283
|
+
function traverse(state, query, k, searchMetric, options) {
|
|
3284
|
+
const { ef, depth, useQuantized } = searchDepths(state, k, options);
|
|
3285
|
+
const quantizer = useQuantized ? activeQuantizer(state) : void 0;
|
|
3019
3286
|
const filter = options.filter;
|
|
3020
3287
|
const workspace = state.workspace;
|
|
3021
3288
|
const candidates = workspace.traversal;
|
|
@@ -3091,17 +3358,8 @@ function bestResolvedHits(hits, k, docIdOf) {
|
|
|
3091
3358
|
return taken.sort(bestFirst).slice(0, k);
|
|
3092
3359
|
}
|
|
3093
3360
|
function collectHits(state, query, k, searchMetric, minSimilarity, options) {
|
|
3094
|
-
|
|
3095
|
-
|
|
3096
|
-
ErrorCodes.VECTOR_DIMENSION_MISMATCH,
|
|
3097
|
-
`Vector dimension mismatch: expected ${state.dimension}, got ${query.length}`,
|
|
3098
|
-
{ expected: state.dimension, received: query.length }
|
|
3099
|
-
);
|
|
3100
|
-
}
|
|
3101
|
-
const liveSize = nodeCountOf(state) - tombstoneCountOf(state);
|
|
3102
|
-
if (entryPointOf(state) === -1 || liveSize === 0) {
|
|
3103
|
-
return [];
|
|
3104
|
-
}
|
|
3361
|
+
requireQueryDimension(state, query);
|
|
3362
|
+
if (graphIsEmpty(state)) return [];
|
|
3105
3363
|
const traversal = traverse(state, query, k, searchMetric, options);
|
|
3106
3364
|
const { candidates } = traversal;
|
|
3107
3365
|
const filter = options.filter;
|
|
@@ -3181,6 +3439,91 @@ function searchOrdinals(state, docIdOf, query, k, searchMetric, minSimilarity, o
|
|
|
3181
3439
|
return bestResolvedHits(hits, k, docIdOf);
|
|
3182
3440
|
}
|
|
3183
3441
|
|
|
3442
|
+
// src/vector/hnsw/search-off-thread.ts
|
|
3443
|
+
function chosenOrdinals(candidates, depth, filter) {
|
|
3444
|
+
const nearest = Math.min(candidates.size, depth);
|
|
3445
|
+
const ordinals = new Int32Array(nearest);
|
|
3446
|
+
let kept = 0;
|
|
3447
|
+
for (let i = 0; i < candidates.size && kept < nearest; i++) {
|
|
3448
|
+
const ord = candidates.ords[i];
|
|
3449
|
+
if (filter && !ordinalFilterHas(filter, ord)) continue;
|
|
3450
|
+
ordinals[kept++] = ord;
|
|
3451
|
+
}
|
|
3452
|
+
return ordinals.subarray(0, kept);
|
|
3453
|
+
}
|
|
3454
|
+
function onFullPrecision(rescore) {
|
|
3455
|
+
const { state, candidates, query, depth, metric, minSimilarity, filter } = rescore;
|
|
3456
|
+
const arena = state.store.prepareQueryArena(query);
|
|
3457
|
+
const qMag = arena ? arena.magnitude : magnitude(query);
|
|
3458
|
+
return rescoreWithFullPrecision(state, candidates, query, qMag, arena, depth, metric, minSimilarity, filter);
|
|
3459
|
+
}
|
|
3460
|
+
async function rescoredOffThread(rescore) {
|
|
3461
|
+
const { core, field, candidates, query, depth, metric, minSimilarity, filter, slot } = rescore;
|
|
3462
|
+
const ordinals = chosenOrdinals(candidates, depth, filter);
|
|
3463
|
+
if (ordinals.length === 0) return [];
|
|
3464
|
+
let scored;
|
|
3465
|
+
try {
|
|
3466
|
+
scored = await core.scoreAsync(field.store.handle, query, nativeMetricCode(metric), ordinals, ordinals.length, slot);
|
|
3467
|
+
} catch {
|
|
3468
|
+
return onFullPrecision(rescore);
|
|
3469
|
+
}
|
|
3470
|
+
if (scored.status !== NATIVE_OK) return onFullPrecision(rescore);
|
|
3471
|
+
const hits = [];
|
|
3472
|
+
for (let i = 0; i < ordinals.length; i++) {
|
|
3473
|
+
const distance = scored.distances[i];
|
|
3474
|
+
if (distance === Number.POSITIVE_INFINITY) continue;
|
|
3475
|
+
const score = toScore(distance, metric);
|
|
3476
|
+
if (score < minSimilarity) continue;
|
|
3477
|
+
hits.push({ ord: ordinals[i], score });
|
|
3478
|
+
}
|
|
3479
|
+
return hits;
|
|
3480
|
+
}
|
|
3481
|
+
async function searchOffThread(state, docIdOf, query, k, metric, minSimilarity, options) {
|
|
3482
|
+
requireQueryDimension(state, query);
|
|
3483
|
+
if (graphIsEmpty(state)) return [];
|
|
3484
|
+
const core = threadedNativeCore();
|
|
3485
|
+
const field = nativeFieldFor(state);
|
|
3486
|
+
if (core === null || field === null) return null;
|
|
3487
|
+
const { ef, depth, useQuantized } = searchDepths(state, k, options);
|
|
3488
|
+
const filter = options.filter;
|
|
3489
|
+
return withNativeThreadSlot(async (slot) => {
|
|
3490
|
+
let found;
|
|
3491
|
+
try {
|
|
3492
|
+
found = await core.searchAsync(
|
|
3493
|
+
field.graph,
|
|
3494
|
+
field.store.handle,
|
|
3495
|
+
query,
|
|
3496
|
+
nativeMetricCode(metric),
|
|
3497
|
+
ef,
|
|
3498
|
+
slot,
|
|
3499
|
+
filter === void 0 ? null : filter.bits
|
|
3500
|
+
);
|
|
3501
|
+
} catch {
|
|
3502
|
+
return null;
|
|
3503
|
+
}
|
|
3504
|
+
if (found.count < 0) return null;
|
|
3505
|
+
const candidates = { ords: found.ordinals, distances: found.distances, size: found.count };
|
|
3506
|
+
if (!useQuantized) return bestResolvedHits(estimatedHits(candidates, 0, metric, minSimilarity, filter), k, docIdOf);
|
|
3507
|
+
const rescored = await rescoredOffThread({
|
|
3508
|
+
state,
|
|
3509
|
+
core,
|
|
3510
|
+
field,
|
|
3511
|
+
candidates,
|
|
3512
|
+
query,
|
|
3513
|
+
depth,
|
|
3514
|
+
metric,
|
|
3515
|
+
minSimilarity,
|
|
3516
|
+
filter,
|
|
3517
|
+
slot
|
|
3518
|
+
});
|
|
3519
|
+
if (options.rescoreWindow === void 0 || minSimilarity !== Number.NEGATIVE_INFINITY) {
|
|
3520
|
+
return bestResolvedHits(rescored, k, docIdOf);
|
|
3521
|
+
}
|
|
3522
|
+
const rest = endOfRescored(candidates, depth, filter);
|
|
3523
|
+
return bestResolvedHits(rescored.concat(estimatedHits(candidates, rest, metric, minSimilarity, filter)), k, docIdOf);
|
|
3524
|
+
});
|
|
3525
|
+
}
|
|
3526
|
+
|
|
3184
3527
|
// src/vector/hnsw/snapshot.ts
|
|
3185
3528
|
function exportSnapshot(state) {
|
|
3186
3529
|
const adj = state.adjacency;
|
|
@@ -3247,7 +3590,8 @@ function openGraphState(handles, dimension, store, quantizer, threadSlot) {
|
|
|
3247
3590
|
Mmax0: shape.mMax0,
|
|
3248
3591
|
efCons: shape.efConstruction,
|
|
3249
3592
|
buildMetric: shape.metric,
|
|
3250
|
-
mL: 1 / Math.log(shape.m)
|
|
3593
|
+
mL: 1 / Math.log(shape.m),
|
|
3594
|
+
linkWrites: 0
|
|
3251
3595
|
};
|
|
3252
3596
|
}
|
|
3253
3597
|
|
|
@@ -3270,6 +3614,12 @@ function createHNSWIndex(dimension, store, config, quantizer, handles) {
|
|
|
3270
3614
|
unlockGraphExclusive(state.locks);
|
|
3271
3615
|
}
|
|
3272
3616
|
}
|
|
3617
|
+
function relinking(operation) {
|
|
3618
|
+
return exclusively(() => {
|
|
3619
|
+
state.linkWrites += 1;
|
|
3620
|
+
return operation();
|
|
3621
|
+
});
|
|
3622
|
+
}
|
|
3273
3623
|
function insertNode2(docId) {
|
|
3274
3624
|
const ord = store.getOrdinal(docId);
|
|
3275
3625
|
if (ord === void 0) {
|
|
@@ -3341,8 +3691,11 @@ function createHNSWIndex(dimension, store, config, quantizer, handles) {
|
|
|
3341
3691
|
get handles() {
|
|
3342
3692
|
return shared;
|
|
3343
3693
|
},
|
|
3694
|
+
get holdsUnlinkedNode() {
|
|
3695
|
+
return Atomics.load(state.header, GRAPH_UNLINKED_NODES) !== 0;
|
|
3696
|
+
},
|
|
3344
3697
|
insertNode: insertNode2,
|
|
3345
|
-
insertOrdinal: (ordinal) => insertNode(state, ordinal),
|
|
3698
|
+
insertOrdinal: (ordinal, connectsAfterwards = false) => insertNode(state, ordinal, false, connectsAfterwards),
|
|
3346
3699
|
markTombstone: (docId) => {
|
|
3347
3700
|
const ord = store.getOrdinal(docId);
|
|
3348
3701
|
if (ord !== void 0) markTombstone(state, ord);
|
|
@@ -3359,19 +3712,22 @@ function createHNSWIndex(dimension, store, config, quantizer, handles) {
|
|
|
3359
3712
|
return ord !== void 0 && isTombstoned(state, ord);
|
|
3360
3713
|
},
|
|
3361
3714
|
search: (query, k, searchMetric, minSimilarity, options) => search(state, docIdOf, query, k, searchMetric, minSimilarity, options),
|
|
3362
|
-
|
|
3715
|
+
searchOffThread: (query, k, searchMetric, minSimilarity, options) => searchOffThread(state, docIdOf, query, k, searchMetric, minSimilarity, options),
|
|
3716
|
+
clear: () => relinking(() => resetGraph(state)),
|
|
3363
3717
|
retire: () => Atomics.store(shared.header, GRAPH_RETIRED, 1),
|
|
3364
3718
|
entries: entriesIterator,
|
|
3365
3719
|
compactionNeeded,
|
|
3366
|
-
compactTombstones: () =>
|
|
3367
|
-
connectUnreached: () =>
|
|
3368
|
-
|
|
3720
|
+
compactTombstones: () => relinking(() => compactTombstones(state)),
|
|
3721
|
+
connectUnreached: () => relinking(() => connectAfterBuild(state)),
|
|
3722
|
+
connectOffThread: () => connectOffThread(state),
|
|
3723
|
+
connectOnThisThread: (inSlices) => connectOnThisThread(state, inSlices),
|
|
3724
|
+
rebuild: () => relinking(() => rebuild(state)),
|
|
3369
3725
|
exclusively,
|
|
3370
|
-
deserialize: (data) =>
|
|
3726
|
+
deserialize: (data) => relinking(() => deserializeGraph(state, store, data)),
|
|
3371
3727
|
serializeNumbered: (numberOfOrdinal, ordinalOfNumber, partSize) => serializeNumberedGraphParts(state, numberOfOrdinal, ordinalOfNumber, partSize),
|
|
3372
|
-
deserializeNumbered: (graph, ordinalOfNumber) =>
|
|
3728
|
+
deserializeNumbered: (graph, ordinalOfNumber) => relinking(() => deserializeNumberedGraph(state, graph, ordinalOfNumber)),
|
|
3373
3729
|
exportSnapshot: () => exportSnapshot(state),
|
|
3374
|
-
restoreSnapshot: (snapshot) =>
|
|
3730
|
+
restoreSnapshot: (snapshot) => relinking(() => restoreSnapshot(state, snapshot))
|
|
3375
3731
|
};
|
|
3376
3732
|
}
|
|
3377
3733
|
|
|
@@ -4027,4 +4383,4 @@ function createOsqQuantizer(dimension, bits, metric, store) {
|
|
|
4027
4383
|
};
|
|
4028
4384
|
}
|
|
4029
4385
|
|
|
4030
|
-
export {
|
|
4386
|
+
export { GRAPH_RETIRED, IN_MEMORY, NOTHING_STAGED, QUERY_STAGED, 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, VECTOR_MEMORY_LIMITS, addToOrdinalFilter, arenaFloat32Distance, blocksGrowthBytes, centroidOfCentroidSums, computeCodeBlockLayout, cosineSimilarityWithMagnitudes, countOfCentroidSums, createCentroidSums, createHNSWIndex, createOrdinalFilter, createOsqQuantizer, createOsqScratch, createSharedVectorStoreHandles, createVectorBlock, defaultEfSearch, defaultRescoreDepth, detachNativeStore, dotProduct, ensureBlockSlots, euclideanDistance, fixedView, graphWithoutNodes, growBufferTo, grownByteLength, insertNode, magnitude, meanOfCentroidSums, nativeMetricCode, nativeScoresOf, nativeStoreFor, nativeStoreScratchBytes, nodeCountOf, 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, unplacedChunkCount, withNativeThreadSlot };
|