@nicia-ai/typegraph 0.48.0 → 0.50.0
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/backend/drizzle/indexes.cjs +9 -9
- package/dist/backend/drizzle/indexes.d.cts +1 -1
- package/dist/backend/drizzle/indexes.d.ts +1 -1
- package/dist/backend/drizzle/indexes.js +5 -5
- package/dist/backend/index.cjs +56 -52
- package/dist/backend/index.d.cts +3 -3
- package/dist/backend/index.d.ts +3 -3
- package/dist/backend/index.js +11 -11
- package/dist/backend/postgres/index.cjs +34 -28
- package/dist/backend/postgres/index.d.cts +7 -7
- package/dist/backend/postgres/index.d.ts +7 -7
- package/dist/backend/postgres/index.js +17 -15
- package/dist/backend/postgres/pglite-store.cjs +36 -35
- package/dist/backend/postgres/pglite-store.cjs.map +1 -1
- package/dist/backend/postgres/pglite-store.d.cts +8 -8
- package/dist/backend/postgres/pglite-store.d.ts +8 -8
- package/dist/backend/postgres/pglite-store.js +32 -31
- package/dist/backend/postgres/pglite-store.js.map +1 -1
- package/dist/backend/postgres/pglite.cjs +19 -17
- package/dist/backend/postgres/pglite.d.cts +3 -3
- package/dist/backend/postgres/pglite.d.ts +3 -3
- package/dist/backend/postgres/pglite.js +18 -16
- package/dist/backend/sqlite/index.cjs +31 -25
- package/dist/backend/sqlite/index.d.cts +7 -7
- package/dist/backend/sqlite/index.d.ts +7 -7
- package/dist/backend/sqlite/index.js +15 -13
- package/dist/backend/sqlite/libsql.cjs +22 -20
- package/dist/backend/sqlite/libsql.cjs.map +1 -1
- package/dist/backend/sqlite/libsql.d.cts +3 -3
- package/dist/backend/sqlite/libsql.d.ts +3 -3
- package/dist/backend/sqlite/libsql.js +17 -15
- package/dist/backend/sqlite/libsql.js.map +1 -1
- package/dist/backend/sqlite/local-store.cjs +37 -36
- package/dist/backend/sqlite/local-store.cjs.map +1 -1
- package/dist/backend/sqlite/local-store.d.cts +8 -8
- package/dist/backend/sqlite/local-store.d.ts +8 -8
- package/dist/backend/sqlite/local-store.js +33 -32
- package/dist/backend/sqlite/local-store.js.map +1 -1
- package/dist/backend/sqlite/local.cjs +20 -18
- package/dist/backend/sqlite/local.d.cts +3 -3
- package/dist/backend/sqlite/local.d.ts +3 -3
- package/dist/backend/sqlite/local.js +18 -16
- package/dist/{chunk-AX6JGVTZ.js → chunk-2CYI5HRH.js} +276 -206
- package/dist/chunk-2CYI5HRH.js.map +1 -0
- package/dist/{chunk-KF6K7TGH.js → chunk-2GIV5X4P.js} +702 -422
- package/dist/chunk-2GIV5X4P.js.map +1 -0
- package/dist/{chunk-2TYSSBU5.js → chunk-2Q45FAIE.js} +15 -15
- package/dist/{chunk-2TYSSBU5.js.map → chunk-2Q45FAIE.js.map} +1 -1
- package/dist/{chunk-WODMN3Q2.cjs → chunk-45YZXI6X.cjs} +27 -27
- package/dist/{chunk-WODMN3Q2.cjs.map → chunk-45YZXI6X.cjs.map} +1 -1
- package/dist/{chunk-3DMMGT6S.js → chunk-46UGOVRW.js} +3 -3
- package/dist/{chunk-3DMMGT6S.js.map → chunk-46UGOVRW.js.map} +1 -1
- package/dist/{chunk-GLHXM7C4.js → chunk-5LKOVCPP.js} +60 -23
- package/dist/chunk-5LKOVCPP.js.map +1 -0
- package/dist/{chunk-JFRT7S3B.cjs → chunk-5OWHU7Z7.cjs} +261 -459
- package/dist/chunk-5OWHU7Z7.cjs.map +1 -0
- package/dist/{chunk-7SQSZN2J.js → chunk-5PP4KRPV.js} +5 -5
- package/dist/{chunk-7SQSZN2J.js.map → chunk-5PP4KRPV.js.map} +1 -1
- package/dist/chunk-6KQEICJ6.cjs +12 -0
- package/dist/{chunk-MKJ4KXL5.cjs.map → chunk-6KQEICJ6.cjs.map} +1 -1
- package/dist/{chunk-6SWPJEYN.js → chunk-6LEOAIIB.js} +40 -6
- package/dist/chunk-6LEOAIIB.js.map +1 -0
- package/dist/{chunk-DZAICA5J.js → chunk-6NKSE5AU.js} +4 -4
- package/dist/{chunk-DZAICA5J.js.map → chunk-6NKSE5AU.js.map} +1 -1
- package/dist/{chunk-OVI7IXYX.js → chunk-6S3PTHL4.js} +3 -3
- package/dist/{chunk-OVI7IXYX.js.map → chunk-6S3PTHL4.js.map} +1 -1
- package/dist/{chunk-3FPR224C.cjs → chunk-7CCMCMJO.cjs} +102 -102
- package/dist/{chunk-3FPR224C.cjs.map → chunk-7CCMCMJO.cjs.map} +1 -1
- package/dist/{chunk-SHFBB23Q.js → chunk-7OWE7WD6.js} +6 -4
- package/dist/chunk-7OWE7WD6.js.map +1 -0
- package/dist/chunk-7PRMDZIA.cjs +182 -0
- package/dist/chunk-7PRMDZIA.cjs.map +1 -0
- package/dist/{chunk-CHAOFCHV.js → chunk-AH2A74OZ.js} +3 -3
- package/dist/{chunk-CHAOFCHV.js.map → chunk-AH2A74OZ.js.map} +1 -1
- package/dist/{chunk-OORXGFL5.cjs → chunk-BYBDM423.cjs} +48 -48
- package/dist/{chunk-OORXGFL5.cjs.map → chunk-BYBDM423.cjs.map} +1 -1
- package/dist/{chunk-JB6T4GLL.cjs → chunk-C76WFIVZ.cjs} +808 -519
- package/dist/chunk-C76WFIVZ.cjs.map +1 -0
- package/dist/{chunk-OTUPEF2W.cjs → chunk-CS6JTQQ2.cjs} +328 -257
- package/dist/chunk-CS6JTQQ2.cjs.map +1 -0
- package/dist/{chunk-AOSSQDVO.cjs → chunk-CSNOYIB4.cjs} +13 -13
- package/dist/{chunk-AOSSQDVO.cjs.map → chunk-CSNOYIB4.cjs.map} +1 -1
- package/dist/{chunk-HEV35TGT.js → chunk-DI6VC62F.js} +13 -4
- package/dist/chunk-DI6VC62F.js.map +1 -0
- package/dist/{chunk-2QGYQBS2.cjs → chunk-DWUDZ66O.cjs} +10 -10
- package/dist/{chunk-2QGYQBS2.cjs.map → chunk-DWUDZ66O.cjs.map} +1 -1
- package/dist/{chunk-ZDKTPBGV.js → chunk-EDLKIQRI.js} +4 -4
- package/dist/{chunk-ZDKTPBGV.js.map → chunk-EDLKIQRI.js.map} +1 -1
- package/dist/chunk-EH3JZJUM.cjs +567 -0
- package/dist/chunk-EH3JZJUM.cjs.map +1 -0
- package/dist/{chunk-S5TERQVW.js → chunk-FX5ZW6PN.js} +196 -33
- package/dist/chunk-FX5ZW6PN.js.map +1 -0
- package/dist/{chunk-XVWOYKIK.js → chunk-FZHF5UWR.js} +3 -3
- package/dist/{chunk-XVWOYKIK.js.map → chunk-FZHF5UWR.js.map} +1 -1
- package/dist/{chunk-BFUOME67.cjs → chunk-G2TLHH6T.cjs} +20 -11
- package/dist/chunk-G2TLHH6T.cjs.map +1 -0
- package/dist/{chunk-5PRKMB24.cjs → chunk-GHZPZNFC.cjs} +12 -4
- package/dist/chunk-GHZPZNFC.cjs.map +1 -0
- package/dist/{chunk-ZFMCDJGB.js → chunk-GVYVGGPJ.js} +11 -199
- package/dist/chunk-GVYVGGPJ.js.map +1 -0
- package/dist/{chunk-SDBBMD4N.js → chunk-H3XP6BAV.js} +3 -3
- package/dist/{chunk-SDBBMD4N.js.map → chunk-H3XP6BAV.js.map} +1 -1
- package/dist/{chunk-ROR5ZR6A.cjs → chunk-HSEZ7X6Y.cjs} +45 -45
- package/dist/{chunk-ROR5ZR6A.cjs.map → chunk-HSEZ7X6Y.cjs.map} +1 -1
- package/dist/{chunk-LRQKXRXO.cjs → chunk-HY5BNOUN.cjs} +4 -4
- package/dist/{chunk-LRQKXRXO.cjs.map → chunk-HY5BNOUN.cjs.map} +1 -1
- package/dist/chunk-HZUB5CON.js +27 -0
- package/dist/chunk-HZUB5CON.js.map +1 -0
- package/dist/{chunk-MYKHJI2J.js → chunk-I5C6OTKR.js} +3 -3
- package/dist/{chunk-MYKHJI2J.js.map → chunk-I5C6OTKR.js.map} +1 -1
- package/dist/{chunk-3U5ABFDW.cjs → chunk-IHK5KA2Q.cjs} +31 -28
- package/dist/chunk-IHK5KA2Q.cjs.map +1 -0
- package/dist/{chunk-26YKDNUD.cjs → chunk-IPRP6TDL.cjs} +12 -10
- package/dist/chunk-IPRP6TDL.cjs.map +1 -0
- package/dist/{chunk-UGHG7PGX.js → chunk-IRPYOHRC.js} +26 -4
- package/dist/chunk-IRPYOHRC.js.map +1 -0
- package/dist/{chunk-7XUYFFR4.cjs → chunk-ISKCIQF2.cjs} +20 -20
- package/dist/{chunk-7XUYFFR4.cjs.map → chunk-ISKCIQF2.cjs.map} +1 -1
- package/dist/{chunk-OD4SSY2U.js → chunk-JG5XIJDY.js} +57 -31
- package/dist/chunk-JG5XIJDY.js.map +1 -0
- package/dist/{chunk-2HIYYMWY.cjs → chunk-K2XYLVVB.cjs} +134 -133
- package/dist/chunk-K2XYLVVB.cjs.map +1 -0
- package/dist/{chunk-5K2BKEBD.js → chunk-K46SDNQD.js} +10 -4
- package/dist/chunk-K46SDNQD.js.map +1 -0
- package/dist/{chunk-TZEGUG6D.cjs → chunk-K6VKTBST.cjs} +4 -4
- package/dist/{chunk-TZEGUG6D.cjs.map → chunk-K6VKTBST.cjs.map} +1 -1
- package/dist/chunk-KWNWG4RC.cjs +12 -0
- package/dist/{chunk-CICO5GXD.cjs.map → chunk-KWNWG4RC.cjs.map} +1 -1
- package/dist/{chunk-FQPEMEWX.cjs → chunk-LLVOQOWE.cjs} +80 -32
- package/dist/chunk-LLVOQOWE.cjs.map +1 -0
- package/dist/{chunk-TQHGE7UC.cjs → chunk-M5MSP3BI.cjs} +18 -10
- package/dist/chunk-M5MSP3BI.cjs.map +1 -0
- package/dist/{chunk-ACGSAMD3.js → chunk-MJPZNEJZ.js} +274 -292
- package/dist/chunk-MJPZNEJZ.js.map +1 -0
- package/dist/{chunk-TUNPBZY3.cjs → chunk-MM3JHVKZ.cjs} +4 -4
- package/dist/{chunk-TUNPBZY3.cjs.map → chunk-MM3JHVKZ.cjs.map} +1 -1
- package/dist/{chunk-BRRP76WO.js → chunk-MX7EKQPM.js} +457 -299
- package/dist/chunk-MX7EKQPM.js.map +1 -0
- package/dist/{chunk-2SYZXD54.js → chunk-MZ34E2GN.js} +13 -12
- package/dist/chunk-MZ34E2GN.js.map +1 -0
- package/dist/{chunk-EDN4Y4ZG.cjs → chunk-OJHD3LXJ.cjs} +9 -9
- package/dist/{chunk-EDN4Y4ZG.cjs.map → chunk-OJHD3LXJ.cjs.map} +1 -1
- package/dist/{chunk-DO7SAMEK.cjs → chunk-ON47CBE4.cjs} +47 -47
- package/dist/{chunk-DO7SAMEK.cjs.map → chunk-ON47CBE4.cjs.map} +1 -1
- package/dist/{chunk-6LN7FIVU.js → chunk-PALYTHGM.js} +11 -4
- package/dist/chunk-PALYTHGM.js.map +1 -0
- package/dist/{chunk-YVF2EM7B.js → chunk-R7MRFE5P.js} +3 -3
- package/dist/{chunk-YVF2EM7B.js.map → chunk-R7MRFE5P.js.map} +1 -1
- package/dist/{chunk-EZEEWCFJ.cjs → chunk-RDP6ZRSM.cjs} +435 -265
- package/dist/chunk-RDP6ZRSM.cjs.map +1 -0
- package/dist/{chunk-GYEG3ZLZ.cjs → chunk-RJMHU2MG.cjs} +121 -18
- package/dist/chunk-RJMHU2MG.cjs.map +1 -0
- package/dist/chunk-RWUWTJQY.cjs +30 -0
- package/dist/chunk-RWUWTJQY.cjs.map +1 -0
- package/dist/{chunk-CT3ZKTOF.js → chunk-S33YQEL7.js} +7 -7
- package/dist/{chunk-CT3ZKTOF.js.map → chunk-S33YQEL7.js.map} +1 -1
- package/dist/chunk-S3SDEQMC.js +532 -0
- package/dist/chunk-S3SDEQMC.js.map +1 -0
- package/dist/{chunk-OI2GQ25X.cjs → chunk-SHC7BCG5.cjs} +7 -7
- package/dist/{chunk-OI2GQ25X.cjs.map → chunk-SHC7BCG5.cjs.map} +1 -1
- package/dist/{chunk-L3LQNR34.cjs → chunk-TEC24ZDA.cjs} +161 -161
- package/dist/{chunk-L3LQNR34.cjs.map → chunk-TEC24ZDA.cjs.map} +1 -1
- package/dist/{chunk-HDL2ARHX.cjs → chunk-TP4NJTI3.cjs} +63 -27
- package/dist/chunk-TP4NJTI3.cjs.map +1 -0
- package/dist/{chunk-UMGZDVOA.cjs → chunk-TTCOPKUL.cjs} +124 -124
- package/dist/{chunk-UMGZDVOA.cjs.map → chunk-TTCOPKUL.cjs.map} +1 -1
- package/dist/chunk-TUVD4DFR.cjs +1207 -0
- package/dist/chunk-TUVD4DFR.cjs.map +1 -0
- package/dist/{chunk-PFBRJBUL.cjs → chunk-TYGGUWMS.cjs} +178 -152
- package/dist/chunk-TYGGUWMS.cjs.map +1 -0
- package/dist/{chunk-4WMMBDS5.js → chunk-U3Z7XKAG.js} +7 -7
- package/dist/{chunk-4WMMBDS5.js.map → chunk-U3Z7XKAG.js.map} +1 -1
- package/dist/{chunk-NACVVDWB.js → chunk-U5EL6JUV.js} +10 -10
- package/dist/{chunk-NACVVDWB.js.map → chunk-U5EL6JUV.js.map} +1 -1
- package/dist/{chunk-OMZ37BM2.js → chunk-V76FGHY3.js} +5 -5
- package/dist/{chunk-OMZ37BM2.js.map → chunk-V76FGHY3.js.map} +1 -1
- package/dist/{chunk-6NGW27EO.cjs → chunk-VLBTRXA2.cjs} +10 -10
- package/dist/{chunk-6NGW27EO.cjs.map → chunk-VLBTRXA2.cjs.map} +1 -1
- package/dist/chunk-VTJVMP4I.js +1182 -0
- package/dist/chunk-VTJVMP4I.js.map +1 -0
- package/dist/{chunk-QTD6HX4O.js → chunk-W5SOCUBL.js} +5 -5
- package/dist/{chunk-QTD6HX4O.js.map → chunk-W5SOCUBL.js.map} +1 -1
- package/dist/{chunk-SR725PWF.cjs → chunk-WCLMKNQE.cjs} +1750 -1592
- package/dist/chunk-WCLMKNQE.cjs.map +1 -0
- package/dist/{chunk-TKZXMWQF.cjs → chunk-WK23PGTP.cjs} +13 -13
- package/dist/{chunk-TKZXMWQF.cjs.map → chunk-WK23PGTP.cjs.map} +1 -1
- package/dist/{chunk-KKBDXCLQ.js → chunk-WQBAQZHR.js} +4 -4
- package/dist/{chunk-KKBDXCLQ.js.map → chunk-WQBAQZHR.js.map} +1 -1
- package/dist/{chunk-MRDBBHIZ.cjs → chunk-X4GDXBOP.cjs} +2 -2
- package/dist/chunk-X4GDXBOP.cjs.map +1 -0
- package/dist/{chunk-WCCATHMB.cjs → chunk-XMY2SXOH.cjs} +438 -456
- package/dist/chunk-XMY2SXOH.cjs.map +1 -0
- package/dist/{chunk-D5R42W5D.js → chunk-XZW2CTNO.js} +115 -12
- package/dist/chunk-XZW2CTNO.js.map +1 -0
- package/dist/{chunk-NVY5CJFP.js → chunk-Y55DLLEG.js} +9 -6
- package/dist/chunk-Y55DLLEG.js.map +1 -0
- package/dist/chunk-YA36ABIL.js +174 -0
- package/dist/chunk-YA36ABIL.js.map +1 -0
- package/dist/{chunk-ZLONH2UD.js → chunk-YDEJQWOL.js} +2 -2
- package/dist/chunk-YDEJQWOL.js.map +1 -0
- package/dist/{chunk-JONXFAPO.js → chunk-ZAQUKCUC.js} +5 -5
- package/dist/{chunk-JONXFAPO.js.map → chunk-ZAQUKCUC.js.map} +1 -1
- package/dist/{chunk-SIT26LAZ.cjs → chunk-ZBFZGLZE.cjs} +29 -5
- package/dist/chunk-ZBFZGLZE.cjs.map +1 -0
- package/dist/{chunk-P6YLZTRE.js → chunk-ZRJTM7MT.js} +3 -3
- package/dist/{chunk-P6YLZTRE.js.map → chunk-ZRJTM7MT.js.map} +1 -1
- package/dist/core/index.cjs +29 -28
- package/dist/core/index.d.cts +4 -4
- package/dist/core/index.d.ts +4 -4
- package/dist/core/index.js +9 -8
- package/dist/{ddl-D_oW-EVO.d.ts → ddl-B49O7dB_.d.ts} +3 -3
- package/dist/{ddl-BL1NZLMY.d.cts → ddl-DcZG660s.d.cts} +3 -3
- package/dist/graph-extension/index.cjs +21 -20
- package/dist/graph-extension/index.d.cts +4 -4
- package/dist/graph-extension/index.d.ts +4 -4
- package/dist/graph-extension/index.js +5 -4
- package/dist/graph-merge/index.cjs +327 -302
- package/dist/graph-merge/index.cjs.map +1 -1
- package/dist/graph-merge/index.d.cts +14 -11
- package/dist/graph-merge/index.d.ts +14 -11
- package/dist/graph-merge/index.js +52 -27
- package/dist/graph-merge/index.js.map +1 -1
- package/dist/{index-D7d1u2gr.d.ts → index-B0PrmE3K.d.cts} +16 -2
- package/dist/{index-COs_z6nV.d.cts → index-CwcXsL5R.d.ts} +16 -2
- package/dist/index.cjs +223 -222
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.cts +12 -12
- package/dist/index.d.ts +12 -12
- package/dist/index.js +37 -36
- package/dist/index.js.map +1 -1
- package/dist/indexes/index.cjs +13 -13
- package/dist/indexes/index.d.cts +4 -4
- package/dist/indexes/index.d.ts +4 -4
- package/dist/indexes/index.js +6 -6
- package/dist/ingestion-import-target-CI8OWIkM.d.ts +17 -0
- package/dist/ingestion-import-target-DCpfM1PX.d.cts +17 -0
- package/dist/interchange/index.cjs +55 -54
- package/dist/interchange/index.cjs.map +1 -1
- package/dist/interchange/index.d.cts +26 -12
- package/dist/interchange/index.d.ts +26 -12
- package/dist/interchange/index.js +19 -18
- package/dist/interchange/index.js.map +1 -1
- package/dist/{manager-D9eRT_ns.d.ts → manager-Cfg1ENj1.d.ts} +30 -2
- package/dist/{manager-CYaff3n3.d.cts → manager-D348fa6W.d.cts} +30 -2
- package/dist/{materialize-indexes-DJ3ykH59.d.ts → materialize-indexes-C9GG3O3C.d.ts} +1 -1
- package/dist/{materialize-indexes-DTtAnvfY.d.cts → materialize-indexes-CrSiW_lT.d.cts} +1 -1
- package/dist/{postgres-DMj39MEu.d.cts → postgres-CH1kkM5J.d.cts} +279 -2
- package/dist/{postgres-CcL4bAHS.d.ts → postgres-UStOycLI.d.ts} +279 -2
- package/dist/profiler/index.d.cts +9 -9
- package/dist/profiler/index.d.ts +9 -9
- package/dist/provenance/index.cjs +46 -44
- package/dist/provenance/index.cjs.map +1 -1
- package/dist/provenance/index.d.cts +7 -7
- package/dist/provenance/index.d.ts +7 -7
- package/dist/provenance/index.js +12 -10
- package/dist/provenance/index.js.map +1 -1
- package/dist/{repair-validity-windows-DlUSqwCg.d.ts → repair-validity-windows-BtOEe2pS.d.ts} +2 -2
- package/dist/{repair-validity-windows-BFNZvd_H.d.cts → repair-validity-windows-aWX7VNvv.d.cts} +2 -2
- package/dist/schema/index.cjs +46 -46
- package/dist/schema/index.d.cts +6 -6
- package/dist/schema/index.d.ts +6 -6
- package/dist/schema/index.js +19 -19
- package/dist/{searchable-DHJMh_nj.d.cts → searchable-C8-RrL3l.d.cts} +1 -1
- package/dist/{searchable-bpE1bBfc.d.ts → searchable-z4BiFfHI.d.ts} +1 -1
- package/dist/{sqlite-D7Oz0SQh.d.ts → sqlite-Cyx9j9o6.d.cts} +309 -2
- package/dist/{sqlite-YppHrNFb.d.cts → sqlite-axLw5Lo5.d.ts} +309 -2
- package/dist/{store-JUVvtmR4.d.cts → store-CTfQ9taw.d.ts} +110 -13
- package/dist/{store-UzrGvZOo.d.ts → store-DR9J7JVB.d.cts} +110 -13
- package/dist/{temporal-5GqpYCk2.d.cts → temporal-B4Ky4wzh.d.cts} +1 -1
- package/dist/{temporal-CbnLzTmM.d.ts → temporal-CBOrERz5.d.ts} +1 -1
- package/dist/{types-CXAhpW-c.d.cts → types-BE921wRl.d.cts} +1 -1
- package/dist/{types-Bx74kaTt.d.ts → types-BScHXVM7.d.ts} +1 -1
- package/dist/{types-BqFZTQmV.d.cts → types-CWg4dTjj.d.cts} +257 -6
- package/dist/{types-BqFZTQmV.d.ts → types-CWg4dTjj.d.ts} +257 -6
- package/dist/{where-O-k2wgYm.d.ts → where-BWXUPV3C.d.ts} +1 -1
- package/dist/{where-DI_Fqz-X.d.cts → where-CNtx1aLc.d.cts} +1 -1
- package/package.json +4 -4
- package/dist/chunk-26YKDNUD.cjs.map +0 -1
- package/dist/chunk-2HIYYMWY.cjs.map +0 -1
- package/dist/chunk-2SYZXD54.js.map +0 -1
- package/dist/chunk-3KOY4FH3.cjs +0 -934
- package/dist/chunk-3KOY4FH3.cjs.map +0 -1
- package/dist/chunk-3U5ABFDW.cjs.map +0 -1
- package/dist/chunk-5K2BKEBD.js.map +0 -1
- package/dist/chunk-5PRKMB24.cjs.map +0 -1
- package/dist/chunk-6LN7FIVU.js.map +0 -1
- package/dist/chunk-6SWPJEYN.js.map +0 -1
- package/dist/chunk-ACGSAMD3.js.map +0 -1
- package/dist/chunk-AX6JGVTZ.js.map +0 -1
- package/dist/chunk-BFUOME67.cjs.map +0 -1
- package/dist/chunk-BRRP76WO.js.map +0 -1
- package/dist/chunk-CICO5GXD.cjs +0 -12
- package/dist/chunk-D5R42W5D.js.map +0 -1
- package/dist/chunk-EZEEWCFJ.cjs.map +0 -1
- package/dist/chunk-FA2AFWLP.cjs +0 -167
- package/dist/chunk-FA2AFWLP.cjs.map +0 -1
- package/dist/chunk-FQPEMEWX.cjs.map +0 -1
- package/dist/chunk-GLHXM7C4.js.map +0 -1
- package/dist/chunk-GYEG3ZLZ.cjs.map +0 -1
- package/dist/chunk-HDL2ARHX.cjs.map +0 -1
- package/dist/chunk-HEV35TGT.js.map +0 -1
- package/dist/chunk-I4GAZH5Z.js +0 -913
- package/dist/chunk-I4GAZH5Z.js.map +0 -1
- package/dist/chunk-JB6T4GLL.cjs.map +0 -1
- package/dist/chunk-JBQQ7THH.js +0 -20
- package/dist/chunk-JBQQ7THH.js.map +0 -1
- package/dist/chunk-JFRT7S3B.cjs.map +0 -1
- package/dist/chunk-KF6K7TGH.js.map +0 -1
- package/dist/chunk-MKJ4KXL5.cjs +0 -12
- package/dist/chunk-MRDBBHIZ.cjs.map +0 -1
- package/dist/chunk-NVY5CJFP.js.map +0 -1
- package/dist/chunk-OD4SSY2U.js.map +0 -1
- package/dist/chunk-OTUPEF2W.cjs.map +0 -1
- package/dist/chunk-PFBRJBUL.cjs.map +0 -1
- package/dist/chunk-PWLJ77UV.cjs +0 -23
- package/dist/chunk-PWLJ77UV.cjs.map +0 -1
- package/dist/chunk-S5TERQVW.js.map +0 -1
- package/dist/chunk-SHFBB23Q.js.map +0 -1
- package/dist/chunk-SIT26LAZ.cjs.map +0 -1
- package/dist/chunk-SR725PWF.cjs.map +0 -1
- package/dist/chunk-TQHGE7UC.cjs.map +0 -1
- package/dist/chunk-UGHG7PGX.js.map +0 -1
- package/dist/chunk-WCCATHMB.cjs.map +0 -1
- package/dist/chunk-YIURNGXI.js +0 -155
- package/dist/chunk-YIURNGXI.js.map +0 -1
- package/dist/chunk-ZFMCDJGB.js.map +0 -1
- package/dist/chunk-ZLONH2UD.js.map +0 -1
|
@@ -1,9 +1,9 @@
|
|
|
1
1
|
import { z } from 'zod';
|
|
2
|
-
import {
|
|
3
|
-
import { R as RecordedInstant, d as ReadCoordinate } from './temporal-
|
|
4
|
-
import { S as SearchableMetadata, c as EmbeddingValue } from './searchable-
|
|
5
|
-
import { K as KindRegistry, S as SchemaManagerOptions, b as SchemaValidationResult } from './manager-
|
|
6
|
-
import { S as SchemaDiff, j as MaterializeIndexesOptions, M as MaterializeIndexesResult, k as MaterializeSystemIndexesOptions } from './materialize-indexes-
|
|
2
|
+
import { cK as ValueType, er as PredicateExpression, aQ as FulltextQueryMode, es as VectorMetricType, dl as QueryAst, bp as JsonPointer, dy as FieldRef, e4 as ParameterRef, dt as NodeType, du as AnyEdgeType, dD as EdgeType, e9 as TraversalExpansion, aV as GraphBackend, ce as SqlDialect, dv as SqlSchema, et as Traversal, eu as NodePredicate, ev as ProjectedField, e3 as OrderSpec, ew as AggregateOrderSpec, cq as TemporalMode, ex as GroupBySpec, dR as HybridFusionOptions, dT as JsonPointerInput, ey as RecursiveCyclePolicy, dk as GraphDef, dB as TraversalDirection$1, dL as EdgeRegistration, d$ as NodeId, cs as TransactionBackend, dx as AggregateExpr, e8 as SortDirection, r as CompiledSelectSql, aT as FulltextStrategy, cX as VectorStrategy, ez as VectorSlotMap, eA as RecordedReadBinding, eB as SelectiveField, eC as ComposableQuery, eD as SetOperationType, eE as SetOperation, a_ as GraphIdentityConfig, e0 as NodeKinds, bC as NodeRow, bt as KindEntity, dN as ExternalRecordedReadSource, dI as EdgeId, ai as EdgeRow, eF as BackendValidityEndMutation, e2 as NodeRegistration, dJ as EdgeKinds, cu as TransactionReadBackend, dF as AllNodeTypes, bs as KindAnnotations, bq as JsonSchema, cz as UniquenessScope, m as Collation, C as Cardinality, aj as EndpointExistence, aY as GraphExtension, e as BackendIdentity, aW as GraphEntityReadBackend, c0 as SchemaReadBackend, bJ as QueryExecutionBackend, cd as SqlCompilationBackend, bK as RawQueryExecutionBackend, cR as VectorMetric, d as BackendCapabilities, y as ContributionDiagnostic, O as ContributionRepairResult, J as ContributionProbeResult, M as ContributionRebuildScope, L as ContributionRebuildResult, ct as TransactionOptions, b as AdapterBackend } from './types-CWg4dTjj.js';
|
|
3
|
+
import { R as RecordedInstant, d as ReadCoordinate } from './temporal-CBOrERz5.js';
|
|
4
|
+
import { S as SearchableMetadata, c as EmbeddingValue } from './searchable-z4BiFfHI.js';
|
|
5
|
+
import { K as KindRegistry, S as SchemaManagerOptions, b as SchemaValidationResult } from './manager-Cfg1ENj1.js';
|
|
6
|
+
import { S as SchemaDiff, j as MaterializeIndexesOptions, M as MaterializeIndexesResult, k as MaterializeSystemIndexesOptions } from './materialize-indexes-C9GG3O3C.js';
|
|
7
7
|
|
|
8
8
|
type FieldTypeInfo = Readonly<{
|
|
9
9
|
valueType: ValueType;
|
|
@@ -3361,6 +3361,14 @@ type IdentityFacade<G extends GraphDef> = IdentityReadFacade<G> & Readonly<{
|
|
|
3361
3361
|
retractDifferentAssertion: (a: IdentityNodeRefInput<G>, b: IdentityNodeRefInput<G>) => Promise<IdentityAssertion<G> | undefined>;
|
|
3362
3362
|
bulkRetractAssertions: (ids: readonly IdentityAssertionId[]) => Promise<readonly IdentityAssertion<G>[]>;
|
|
3363
3363
|
}>;
|
|
3364
|
+
/**
|
|
3365
|
+
* The assertion-only write surface of the TypeGraph Identity Profile.
|
|
3366
|
+
*
|
|
3367
|
+
* This deliberately excludes reads and retractions so constrained staging
|
|
3368
|
+
* handles can accept incoming identity claims without exposing the broader
|
|
3369
|
+
* operational identity surface.
|
|
3370
|
+
*/
|
|
3371
|
+
type IdentityAssertionWriteFacade<G extends GraphDef> = Pick<IdentityFacade<G>, "assertSame" | "assertDifferent" | "bulkAssertSame" | "bulkAssertDifferent">;
|
|
3364
3372
|
/**
|
|
3365
3373
|
* Per-transaction identity write counts carried by a transaction receipt.
|
|
3366
3374
|
* `total` is the sum of the three preceding counters.
|
|
@@ -3810,6 +3818,88 @@ type InternalGraphAlgorithms<G extends GraphDef> = Readonly<{
|
|
|
3810
3818
|
personalizedPageRank: (options: InternalPersonalizedPageRankOptions<G>) => Promise<readonly PageRankScore[]>;
|
|
3811
3819
|
}>;
|
|
3812
3820
|
|
|
3821
|
+
/**
|
|
3822
|
+
* Claim axis vocabulary.
|
|
3823
|
+
*
|
|
3824
|
+
* A declared constraint is a CLAIM on an AXIS: the value bound to a claim row's
|
|
3825
|
+
* `node_kind` column, which is what the relation's primary key fences on. The
|
|
3826
|
+
* axis is not always a kind — it is whatever set of kinds the constraint spans —
|
|
3827
|
+
* and deciding it is this module's only job, so no write path spells its own.
|
|
3828
|
+
*
|
|
3829
|
+
* The other half of a claim row is its OWNER, `(concrete_kind, node_id)`. Ids
|
|
3830
|
+
* are unique only per kind, so an id alone cannot answer "is this row mine?":
|
|
3831
|
+
* `Employee "X"` and `Contractor "X"` are two rows under the nodes primary key
|
|
3832
|
+
* and would read as one owner. The predicate lives here once, in the two
|
|
3833
|
+
* renderings the code needs (TypeScript and SQL), so a claim's accept/refuse
|
|
3834
|
+
* verdict cannot differ between the layer that probes it and the layer that
|
|
3835
|
+
* writes it.
|
|
3836
|
+
*/
|
|
3837
|
+
|
|
3838
|
+
/** The relation a claim row lives in. */
|
|
3839
|
+
type ClaimRelation = "uniques" | "edgeClaims";
|
|
3840
|
+
/** A claim row named in full — the row a statement is about to lock. */
|
|
3841
|
+
type ClaimTarget = Readonly<{
|
|
3842
|
+
relation: ClaimRelation;
|
|
3843
|
+
graphId: string;
|
|
3844
|
+
axis: string;
|
|
3845
|
+
/**
|
|
3846
|
+
* `uniques.constraint_name`. The edge claim relation keys on
|
|
3847
|
+
* `(graph_id, axis, key)` and has no such column, so its targets omit it and
|
|
3848
|
+
* sort as the empty string. Absent means "this relation does not key on a
|
|
3849
|
+
* constraint name", never "not known yet".
|
|
3850
|
+
*/
|
|
3851
|
+
constraintName?: string;
|
|
3852
|
+
key: string;
|
|
3853
|
+
}>;
|
|
3854
|
+
/**
|
|
3855
|
+
* WHO holds a claim. A node, not an id: ids are unique only per kind, so
|
|
3856
|
+
* `(concrete_kind, node_id)` is the smallest thing that identifies a claimant.
|
|
3857
|
+
*/
|
|
3858
|
+
type ClaimOwner = Readonly<{
|
|
3859
|
+
concreteKind: string;
|
|
3860
|
+
nodeId: string;
|
|
3861
|
+
}>;
|
|
3862
|
+
|
|
3863
|
+
/**
|
|
3864
|
+
* The read-only fence diagnostic: which claim axes are ALREADY contended.
|
|
3865
|
+
*
|
|
3866
|
+
* A claim relation refuses a second claimant from the first post-upgrade write
|
|
3867
|
+
* onward, but it repairs nothing that is already there. A database that carried
|
|
3868
|
+
* two live siblings sharing a scoped key, or two live `cardinality: "one"` edges
|
|
3869
|
+
* from one source, keeps carrying them — the next write that touches such an
|
|
3870
|
+
* axis is refused with the ordinary typed error naming the incumbent, and until
|
|
3871
|
+
* then nothing says so out loud. This module is what says so.
|
|
3872
|
+
*
|
|
3873
|
+
* It reports; it never repairs. Choosing which of two live claimants keeps the
|
|
3874
|
+
* axis is a data-loss decision that belongs to the operator, not to a
|
|
3875
|
+
* diagnostic.
|
|
3876
|
+
*
|
|
3877
|
+
* Every axis and key it names is built by the SAME function the fence writes
|
|
3878
|
+
* with — {@link uniquenessClaimTarget}, {@link disjointnessClaimAxis},
|
|
3879
|
+
* {@link edgeCardinalityClaimTarget} — so a report row names the row a writer
|
|
3880
|
+
* would actually contend for. A second spelling here would produce a report
|
|
3881
|
+
* about axes the fence does not use.
|
|
3882
|
+
*/
|
|
3883
|
+
|
|
3884
|
+
/**
|
|
3885
|
+
* One claim axis more than one live claimant holds.
|
|
3886
|
+
*
|
|
3887
|
+
* Discriminated on the family because the two claim relations record their
|
|
3888
|
+
* holders differently: a `uniques` axis is held by an OWNER PAIR (ids are
|
|
3889
|
+
* unique only per kind), an edge-claim axis by an edge id. `target` is the
|
|
3890
|
+
* claim row itself, so a reader can go straight to the row a writer contends
|
|
3891
|
+
* for rather than reconstructing it from the family's own vocabulary.
|
|
3892
|
+
*/
|
|
3893
|
+
type ConstraintFenceViolation = Readonly<{
|
|
3894
|
+
family: "nodeUniqueness" | "nodeDisjointness";
|
|
3895
|
+
target: ClaimTarget;
|
|
3896
|
+
owners: readonly ClaimOwner[];
|
|
3897
|
+
}> | Readonly<{
|
|
3898
|
+
family: "edgeCardinality";
|
|
3899
|
+
target: ClaimTarget;
|
|
3900
|
+
edgeIds: readonly string[];
|
|
3901
|
+
}>;
|
|
3902
|
+
|
|
3813
3903
|
/**
|
|
3814
3904
|
* Members that are safe to expose through a history-enabled adapter Store.
|
|
3815
3905
|
*
|
|
@@ -3818,9 +3908,9 @@ type InternalGraphAlgorithms<G extends GraphDef> = Readonly<{
|
|
|
3818
3908
|
* transactions stay internal because each can mutate live rows without a
|
|
3819
3909
|
* corresponding capture flush.
|
|
3820
3910
|
*/
|
|
3821
|
-
declare const HISTORY_STORE_BACKEND_KEYS: readonly ["assertRuntimeContributionsInitialized", "assertVectorSlotInitialized", "assertVectorSlotsInitialized", "bootstrapTables", "capabilities", "checkUnique", "checkUniqueBatch", "claimIndexMaterialization", "close", "commitSchemaVersion", "commitSchemaVersionIfKindsEmpty", "lockSchemaVersionForWrite", "compileSql", "countEdgesByKind", "countEdgesFrom", "countNodesByKind", "createVectorIndex", "deleteEdge", "deleteEdgesBatch", "deleteEmbedding", "deleteEmbeddingBatch", "deleteFulltext", "deleteFulltextBatch", "deleteNode", "deleteUnique", "hardDeleteUniquesByNodeIds", "deleteVectorSlotContribution", "dialect", "dropVectorIndex", "edgeExistsBetween", "ensureContributionMaterializationsTable", "ensureFulltextTable", "ensureIndexMaterializationsTable", "ensureKindRemovalsTable", "ensureReconciliationMarkersTable", "ensureRevisionOriginsTable", "ensureRuntimeContributions", "ensureVectorSlotContribution", "ensureVectorSlotContributions", "execute", "executeTemporaryStatement", "findEdgesByKind", "findEdgesByEndpointSet", "findEdgesByHeterogeneousEndpointSet", "findEdgesConnectedTo", "findNodesByKind", "fulltextSearch", "fulltextStrategy", "getActiveSchema", "getAllKindRemovals", "getContributionMaterialization", "getEdge", "getEdges", "getIndexMaterialization", "getIndexMaterializations", "getNode", "getNodes", "getPendingKindRemovals", "getReconciliationMarker", "getSchemaVersion", "hardDeleteEdge", "hardDeleteEdgesBatch", "hardDeleteNode", "hardDeleteUniquesByNodeIds", "hybridSearch", "insertEdge", "insertEdgeNoReturn", "insertEdgesBatch", "insertEdgesBatchReturning", "insertNode", "insertNodeNoReturn", "insertNodesBatch", "insertNodesBatchReturning", "insertUnique", "insertUniqueBatch", "probeContributions", "recordContributionMaterialization", "recordIndexMaterialization", "recordKindRemoval", "refreshStatistics", "releaseIndexMaterializationClaim", "setActiveVersion", "setReconciliationMarker", "tableNames", "updateEdge", "updateNode", "updateNodeSet", "upsertEmbedding", "upsertEmbeddingBatch", "upsertFulltext", "upsertFulltextBatch", "vectorSearch", "vectorStrategy", "verifyContributions"];
|
|
3911
|
+
declare const HISTORY_STORE_BACKEND_KEYS: readonly ["assertRuntimeContributionsInitialized", "assertVectorSlotInitialized", "assertVectorSlotsInitialized", "bootstrapTables", "capabilities", "checkUnique", "checkUniqueBatch", "claimEdgeCardinality", "claimEdgeCardinalityBatch", "claimIndexMaterialization", "close", "commitSchemaVersion", "commitSchemaVersionIfKindsEmpty", "lockSchemaVersionForWrite", "compileSql", "countEdgesByKind", "countEdgesFrom", "countNodesByKind", "createVectorIndex", "deleteEdge", "deleteEdgesBatch", "deleteEmbedding", "deleteEmbeddingBatch", "deleteFulltext", "deleteFulltextBatch", "deleteNode", "deleteUnique", "hardDeleteUniquesByNodeIds", "deleteVectorSlotContribution", "dialect", "dropVectorIndex", "edgeExistsBetween", "ensureContributionMaterializationsTable", "ensureExtension", "ensureFulltextTable", "ensureIndexMaterializationsTable", "ensureKindRemovalsTable", "ensureReconciliationMarkersTable", "ensureRevisionOriginsTable", "ensureRuntimeContributions", "ensureTrigramExtension", "ensureVectorSlotContribution", "ensureVectorSlotContributions", "execute", "executeTemporaryStatement", "findEdgesByKind", "findEdgesByEndpointSet", "findEdgesByHeterogeneousEndpointSet", "findEdgesConnectedTo", "findNodesByKind", "fulltextSearch", "fulltextStrategy", "getActiveSchema", "getAllKindRemovals", "getContributionMaterialization", "getEdge", "getEdges", "getIndexMaterialization", "getIndexMaterializations", "getNode", "getNodes", "getPendingKindRemovals", "getReconciliationMarker", "getSchemaVersion", "hardDeleteEdge", "hardDeleteEdgesBatch", "hardDeleteNode", "hardDeleteUniquesByConcreteKind", "hardDeleteUniquesByNodeIds", "hybridSearch", "insertEdge", "insertEdgeNoReturn", "insertEdgesBatch", "insertEdgesBatchReturning", "insertNode", "insertNodeNoReturn", "insertNodesBatch", "insertNodesBatchReturning", "insertUnique", "insertUniqueBatch", "probeContributions", "purgeEdgeClaims", "readConstraintFenceViolations", "recordContributionMaterialization", "recordIndexMaterialization", "recordKindRemoval", "refreshStatistics", "releaseIndexMaterializationClaim", "setActiveVersion", "setReconciliationMarker", "tableNames", "updateEdge", "updateNode", "updateNodeSet", "upsertEmbedding", "upsertEmbeddingBatch", "upsertFulltext", "upsertFulltextBatch", "vectorSearch", "vectorStrategy", "verifyContributions"];
|
|
3822
3912
|
type HistoryStoreBackendMember = (typeof HISTORY_STORE_BACKEND_KEYS)[number];
|
|
3823
|
-
type UnsafeHistoryStoreBackendMember = "clearGraph" | "commitSchemaVersionWithPreflight" | "executeDdl" | "executeRaw" | "executeStatement" | "ensureIdentityTables" | "
|
|
3913
|
+
type UnsafeHistoryStoreBackendMember = "clearGraph" | "commitSchemaVersionWithPreflight" | "executeDdl" | "executeRaw" | "executeStatement" | "ensureIdentityTables" | "identityTableDdl" | "rebuildContribution" | "repairContributions" | "schemaWriteTransaction" | "transaction" | "trustedImport";
|
|
3824
3914
|
type UnclassifiedHistoryStoreBackendMember = Exclude<keyof GraphBackend, HistoryStoreBackendMember | UnsafeHistoryStoreBackendMember>;
|
|
3825
3915
|
type HistoryStoreBackend = UnclassifiedHistoryStoreBackendMember extends never ? Readonly<Pick<GraphBackend, HistoryStoreBackendMember>> : never;
|
|
3826
3916
|
|
|
@@ -4185,8 +4275,14 @@ type StoreRuntime<G extends GraphDef> = Readonly<{
|
|
|
4185
4275
|
validateIdentity: () => Promise<void>;
|
|
4186
4276
|
/**
|
|
4187
4277
|
* Validates one final resolved node write set, then clears the affected
|
|
4188
|
-
*
|
|
4189
|
-
*
|
|
4278
|
+
* nodes' claim rows so its upserts may take their approved keys in any order,
|
|
4279
|
+
* and re-takes the complete claim set once the writes have landed. The caller
|
|
4280
|
+
* must supply a transaction-bound backend.
|
|
4281
|
+
*
|
|
4282
|
+
* The clear is by OWNER, so it takes every claim the affected nodes hold —
|
|
4283
|
+
* uniqueness and `disjointWith` alike — and the rebuild therefore goes through
|
|
4284
|
+
* the same claim writer an ordinary create uses rather than a uniqueness-only
|
|
4285
|
+
* insert. See `store/claims/resolved-node-claims.ts`.
|
|
4190
4286
|
*/
|
|
4191
4287
|
applyResolvedNodeUniqueness: <Output>(target: TransactionBackend, writes: Readonly<{
|
|
4192
4288
|
upserts: readonly Readonly<{
|
|
@@ -4318,12 +4414,12 @@ type StoreRuntime<G extends GraphDef> = Readonly<{
|
|
|
4318
4414
|
nextAfter?: string;
|
|
4319
4415
|
done: boolean;
|
|
4320
4416
|
}>>;
|
|
4321
|
-
lockIdentityImportTarget: (target: GraphBackend
|
|
4322
|
-
foldImportedIdentityNodes: (target:
|
|
4417
|
+
lockIdentityImportTarget: (target: Readonly<BackendIdentity & GraphEntityReadBackend & SchemaReadBackend & QueryExecutionBackend & SqlCompilationBackend & RawQueryExecutionBackend & Pick<GraphBackend, "executeStatement">>) => Promise<void>;
|
|
4418
|
+
foldImportedIdentityNodes: (target: Readonly<BackendIdentity & GraphEntityReadBackend & SchemaReadBackend & QueryExecutionBackend & SqlCompilationBackend & RawQueryExecutionBackend & Pick<GraphBackend, "executeStatement">>, references: readonly Readonly<{
|
|
4323
4419
|
kind: string;
|
|
4324
4420
|
id: string;
|
|
4325
4421
|
}>[]) => Promise<void>;
|
|
4326
|
-
importIdentityAssertionsAtTarget: (target:
|
|
4422
|
+
importIdentityAssertionsAtTarget: (target: Readonly<BackendIdentity & GraphEntityReadBackend & SchemaReadBackend & QueryExecutionBackend & SqlCompilationBackend & RawQueryExecutionBackend & Pick<GraphBackend, "executeStatement">>, assertions: readonly Readonly<{
|
|
4327
4423
|
id: string;
|
|
4328
4424
|
relation: "same" | "different";
|
|
4329
4425
|
a: Readonly<{
|
|
@@ -5062,6 +5158,7 @@ type StoreCore<G extends GraphDef> = Readonly<{
|
|
|
5062
5158
|
materializeSystemIndexes: (options?: MaterializeSystemIndexesOptions) => Promise<MaterializeIndexesResult>;
|
|
5063
5159
|
reembedVectorField: (kind: string, fieldPath: string, options?: ReembedVectorFieldOptions) => Promise<ReembedVectorFieldResult>;
|
|
5064
5160
|
verifyContributions: () => Promise<readonly ContributionDiagnostic[]>;
|
|
5161
|
+
verifyConstraintFences: () => Promise<readonly ConstraintFenceViolation[]>;
|
|
5065
5162
|
repairContributions: () => Promise<ContributionRepairResult>;
|
|
5066
5163
|
probeContributions: () => Promise<ContributionProbeResult>;
|
|
5067
5164
|
rebuildContribution: (scope: ContributionRebuildScope, options?: RebuildContributionOptions) => Promise<ContributionRebuildResult>;
|
|
@@ -5363,4 +5460,4 @@ declare function createVerifiedAdapterStore<G extends GraphDef, TNativeTransacti
|
|
|
5363
5460
|
SchemaValidationResult
|
|
5364
5461
|
]>;
|
|
5365
5462
|
|
|
5366
|
-
export { type
|
|
5463
|
+
export { type DynamicNode as $, type AliasMap as A, type BaseStoreOptions as B, type BatchableQuery as C, type BulkEdgeSourceGroup as D, type EdgeAliasMap as E, type BulkFindEdgesFromParams as F, type BulkFindEdgesFromResult as G, type HistoryStoreOptions as H, type IdentityAssertion as I, type BulkOperationHookContext as J, type ClaimOwner as K, type LiveStoreOptions as L, type ClaimTarget as M, type ConstraintFenceViolation as N, type ConstraintNames as O, type CreateEdgeInput as P, type QueryCoordinateState as Q, type RecordedReadStoreOptions as R, type StoreOptions as S, TraversalBuilder as T, type UnboundLiveStoreOptions as U, type CreateNodeInput as V, type DegreeOptions as W, type DynamicEdgeAccessor as X, type DynamicEdgeCollection as Y, type DynamicEdgeType as Z, type DynamicFieldBuilder as _, type Store as a, type NodeIdentifier as a$, type DynamicNodeAccessor as a0, type DynamicNodeCollection as a1, type DynamicNodeKind as a2, type DynamicNodeReference as a3, type DynamicNodeType as a4, type DynamicSelectableEdge as a5, type DynamicSelectableNode as a6, type Edge as a7, type EdgeAccessor as a8, type EdgeBatchReads as a9, type HybridSearchOptions as aA, type HybridVectorOptions as aB, type IdentityAssertionWriteFacade as aC, type IdentityNodeReference as aD, type IdentityTraversalOption as aE, type IdentityValidityWindow as aF, type IfExistsMode as aG, type InitialQueryBuilder as aH, type KindIntrospection as aI, type LabelPropagationMembership as aJ, type LabelPropagationOptions as aK, type MaterializeRemovalsEntry as aL, type MaterializeRemovalsOptions as aM, type MaterializeRemovalsResult as aN, type MeasurableAdapterHistoryTransactionContext as aO, type MeasurableAdapterTransactionContext as aP, type MeasurableTransactionContext as aQ, type NeighborsOptions as aR, type NoRecordedCoordinate as aS, type Node as aT, type NodeAccessor as aU, type NodeAlias as aV, type NodeBulkFindByIndexOptions as aW, type NodeCollection as aX, type NodeCurrentReads as aY, type NodeGetOrCreateByConstraintOptions as aZ, type NodeGetOrCreateByConstraintResult as a_, type EdgeBulkFindEndpointOptions as aa, type EdgeBulkFindOptions as ab, type EdgeCollection as ac, type EdgeFindByEndpointsOptions as ad, type EdgeGetOrCreateByEndpointsOptions as ae, type EdgeGetOrCreateByEndpointsResult as af, type EdgeIntrospection as ag, type EdgeTemporalReads as ah, type EdgeWrites as ai, type EmptyAliasMap as aj, type EmptyEdgeAliasMap as ak, ExecutableAggregateQuery as al, ExecutableQuery as am, type FieldAccessor as an, type FulltextSearchHit as ao, type FulltextSearchOptions as ap, type GetOrCreateAction as aq, type GraphAlgorithms as ar, type GraphEdgeCollections as as, type GraphEdgeForKinds as at, type GraphNodeCollections as au, type GraphNodeReference as av, type HistoryStoreBackend as aw, type HookContext as ax, type HybridFulltextOptions as ay, type HybridSearchHit as az, type HistoryStore as b, type StoreViewSubgraphOptions as b$, type NodeRef as b0, type NodeTemporalReads as b1, type NodeWrites as b2, type OntologyIntrospection as b3, type OperationHookContext as b4, type PageRankOptions as b5, type PageRankScore as b6, type PaginateOptions as b7, type PaginatedResult as b8, type PathNode as b9, type ScopedMeasure as bA, type SearchScopeOptions as bB, type SelectContext as bC, type SelectableEdge as bD, type SelectableNode as bE, type ShortestPathOptions as bF, type ShortestPathResult as bG, type SqlAvailability as bH, type StoreHooks as bI, type StoreProjection as bJ, type StoreRef as bK, StoreSearch as bL, StoreView as bM, type StoreViewCanReachOptions as bN, type StoreViewCoordinate as bO, type StoreViewDegreeOptions as bP, type StoreViewEdgeCollection as bQ, type StoreViewEdgeCollections as bR, type StoreViewGraphAlgorithms as bS, type StoreViewLabelPropagationOptions as bT, type StoreViewNeighborsOptions as bU, type StoreViewNodeCollection as bV, type StoreViewNodeCollections as bW, type StoreViewPageRankOptions as bX, type StoreViewPersonalizedPageRankOptions as bY, type StoreViewReachableOptions as bZ, type StoreViewShortestPathOptions as b_, type PersonalizedPageRankOptions as ba, type PersonalizedPageRankSeed as bb, type Predicate as bc, PreparedQuery as bd, type PropsAccessor as be, type QueryHookContext as bf, type QueryOptions as bg, type ReachableNode as bh, type ReachableOptions as bi, type RebuildContributionOptions as bj, type RebuildFulltextOptions as bk, type RebuildFulltextResult as bl, type ReclaimedVectorFieldEntry as bm, type ReconciledSchema as bn, type RecordedScanOptions as bo, type RecordedScanPage as bp, RecordedStoreView as bq, type RecordedStoreViewEdgeCollection as br, type RecordedStoreViewEdgeCollections as bs, type RecordedStoreViewNodeCollection as bt, type RecordedStoreViewNodeCollections as bu, type RecursiveTraversalOptions as bv, type ReembedFunction as bw, type ReembedVectorFieldOptions as bx, type ReembedVectorFieldResult as by, type SchemaIntrospection as bz, type RecordedReadStore as c, type StoreViewWeaklyConnectedComponentsOptions as c0, type StoreViewWeightedShortestPathOptions as c1, type StreamOptions as c2, type SubgraphEdgeResult as c3, type SubgraphNodeResult as c4, type SubgraphOptions as c5, type SubgraphResult as c6, type SubsetEdge as c7, type SubsetNode as c8, type TemporalAlgorithmOptions as c9, defineSubgraphProject as cA, exists as cB, fieldRef as cC, inSubquery as cD, isParameterRef as cE, notExists as cF, notInSubquery as cG, param as cH, type TransactionContext as ca, type TransactionOutcome as cb, type TransactionReceipt as cc, type TraversalDirection as cd, type TypedEdgeCollection as ce, type TypedRecordedStoreViewEdgeCollection as cf, type TypedStoreViewEdgeCollection as cg, UnionableQuery as ch, type UniqueIntrospection as ci, type UpdateEdgeInput as cj, type UpdateNodeInput as ck, type ValidityEndMutation as cl, type VectorSearchHit as cm, type VectorSearchOptions as cn, type WeaklyConnectedComponentMembership as co, type WeaklyConnectedComponentsOptions as cp, type WeightedShortestPathOptions as cq, type WeightedShortestPathResult as cr, asIdentityAssertionId as cs, createAdapterStore as ct, createAdapterStoreWithSchema as cu, createQueryBuilder as cv, createStore as cw, createStoreWithSchema as cx, createVerifiedAdapterStore as cy, createVerifiedStore as cz, type IdentityAssertionId as d, type IdentityAssertionResult as e, type IdentityFacade as f, type IdentityNode as g, type IdentityNodeRefInput as h, type IdentityPair as i, type IdentityReadFacade as j, type IdentityRelation as k, type IdentityWriteSummary as l, type RecursiveAliasMap as m, QueryBuilder as n, type EmptyRecursiveAliasMap as o, type AdapterHistoryStore as p, type AdapterHistoryTransactionContext as q, type AdapterRecordedReadStore as r, type AdapterStore as s, type AdapterTransactionContext as t, type AggregateResult as u, type AlgorithmCyclePolicy as v, type AnyEdge as w, type AnyNode as x, type BaseTraversalOptions as y, type BatchResults as z };
|
|
@@ -1,9 +1,9 @@
|
|
|
1
1
|
import { z } from 'zod';
|
|
2
|
-
import {
|
|
3
|
-
import { R as RecordedInstant, d as ReadCoordinate } from './temporal-
|
|
4
|
-
import { S as SearchableMetadata, c as EmbeddingValue } from './searchable-
|
|
5
|
-
import { K as KindRegistry, S as SchemaManagerOptions, b as SchemaValidationResult } from './manager-
|
|
6
|
-
import { S as SchemaDiff, j as MaterializeIndexesOptions, M as MaterializeIndexesResult, k as MaterializeSystemIndexesOptions } from './materialize-indexes-
|
|
2
|
+
import { cK as ValueType, er as PredicateExpression, aQ as FulltextQueryMode, es as VectorMetricType, dl as QueryAst, bp as JsonPointer, dy as FieldRef, e4 as ParameterRef, dt as NodeType, du as AnyEdgeType, dD as EdgeType, e9 as TraversalExpansion, aV as GraphBackend, ce as SqlDialect, dv as SqlSchema, et as Traversal, eu as NodePredicate, ev as ProjectedField, e3 as OrderSpec, ew as AggregateOrderSpec, cq as TemporalMode, ex as GroupBySpec, dR as HybridFusionOptions, dT as JsonPointerInput, ey as RecursiveCyclePolicy, dk as GraphDef, dB as TraversalDirection$1, dL as EdgeRegistration, d$ as NodeId, cs as TransactionBackend, dx as AggregateExpr, e8 as SortDirection, r as CompiledSelectSql, aT as FulltextStrategy, cX as VectorStrategy, ez as VectorSlotMap, eA as RecordedReadBinding, eB as SelectiveField, eC as ComposableQuery, eD as SetOperationType, eE as SetOperation, a_ as GraphIdentityConfig, e0 as NodeKinds, bC as NodeRow, bt as KindEntity, dN as ExternalRecordedReadSource, dI as EdgeId, ai as EdgeRow, eF as BackendValidityEndMutation, e2 as NodeRegistration, dJ as EdgeKinds, cu as TransactionReadBackend, dF as AllNodeTypes, bs as KindAnnotations, bq as JsonSchema, cz as UniquenessScope, m as Collation, C as Cardinality, aj as EndpointExistence, aY as GraphExtension, e as BackendIdentity, aW as GraphEntityReadBackend, c0 as SchemaReadBackend, bJ as QueryExecutionBackend, cd as SqlCompilationBackend, bK as RawQueryExecutionBackend, cR as VectorMetric, d as BackendCapabilities, y as ContributionDiagnostic, O as ContributionRepairResult, J as ContributionProbeResult, M as ContributionRebuildScope, L as ContributionRebuildResult, ct as TransactionOptions, b as AdapterBackend } from './types-CWg4dTjj.cjs';
|
|
3
|
+
import { R as RecordedInstant, d as ReadCoordinate } from './temporal-B4Ky4wzh.cjs';
|
|
4
|
+
import { S as SearchableMetadata, c as EmbeddingValue } from './searchable-C8-RrL3l.cjs';
|
|
5
|
+
import { K as KindRegistry, S as SchemaManagerOptions, b as SchemaValidationResult } from './manager-D348fa6W.cjs';
|
|
6
|
+
import { S as SchemaDiff, j as MaterializeIndexesOptions, M as MaterializeIndexesResult, k as MaterializeSystemIndexesOptions } from './materialize-indexes-CrSiW_lT.cjs';
|
|
7
7
|
|
|
8
8
|
type FieldTypeInfo = Readonly<{
|
|
9
9
|
valueType: ValueType;
|
|
@@ -3361,6 +3361,14 @@ type IdentityFacade<G extends GraphDef> = IdentityReadFacade<G> & Readonly<{
|
|
|
3361
3361
|
retractDifferentAssertion: (a: IdentityNodeRefInput<G>, b: IdentityNodeRefInput<G>) => Promise<IdentityAssertion<G> | undefined>;
|
|
3362
3362
|
bulkRetractAssertions: (ids: readonly IdentityAssertionId[]) => Promise<readonly IdentityAssertion<G>[]>;
|
|
3363
3363
|
}>;
|
|
3364
|
+
/**
|
|
3365
|
+
* The assertion-only write surface of the TypeGraph Identity Profile.
|
|
3366
|
+
*
|
|
3367
|
+
* This deliberately excludes reads and retractions so constrained staging
|
|
3368
|
+
* handles can accept incoming identity claims without exposing the broader
|
|
3369
|
+
* operational identity surface.
|
|
3370
|
+
*/
|
|
3371
|
+
type IdentityAssertionWriteFacade<G extends GraphDef> = Pick<IdentityFacade<G>, "assertSame" | "assertDifferent" | "bulkAssertSame" | "bulkAssertDifferent">;
|
|
3364
3372
|
/**
|
|
3365
3373
|
* Per-transaction identity write counts carried by a transaction receipt.
|
|
3366
3374
|
* `total` is the sum of the three preceding counters.
|
|
@@ -3810,6 +3818,88 @@ type InternalGraphAlgorithms<G extends GraphDef> = Readonly<{
|
|
|
3810
3818
|
personalizedPageRank: (options: InternalPersonalizedPageRankOptions<G>) => Promise<readonly PageRankScore[]>;
|
|
3811
3819
|
}>;
|
|
3812
3820
|
|
|
3821
|
+
/**
|
|
3822
|
+
* Claim axis vocabulary.
|
|
3823
|
+
*
|
|
3824
|
+
* A declared constraint is a CLAIM on an AXIS: the value bound to a claim row's
|
|
3825
|
+
* `node_kind` column, which is what the relation's primary key fences on. The
|
|
3826
|
+
* axis is not always a kind — it is whatever set of kinds the constraint spans —
|
|
3827
|
+
* and deciding it is this module's only job, so no write path spells its own.
|
|
3828
|
+
*
|
|
3829
|
+
* The other half of a claim row is its OWNER, `(concrete_kind, node_id)`. Ids
|
|
3830
|
+
* are unique only per kind, so an id alone cannot answer "is this row mine?":
|
|
3831
|
+
* `Employee "X"` and `Contractor "X"` are two rows under the nodes primary key
|
|
3832
|
+
* and would read as one owner. The predicate lives here once, in the two
|
|
3833
|
+
* renderings the code needs (TypeScript and SQL), so a claim's accept/refuse
|
|
3834
|
+
* verdict cannot differ between the layer that probes it and the layer that
|
|
3835
|
+
* writes it.
|
|
3836
|
+
*/
|
|
3837
|
+
|
|
3838
|
+
/** The relation a claim row lives in. */
|
|
3839
|
+
type ClaimRelation = "uniques" | "edgeClaims";
|
|
3840
|
+
/** A claim row named in full — the row a statement is about to lock. */
|
|
3841
|
+
type ClaimTarget = Readonly<{
|
|
3842
|
+
relation: ClaimRelation;
|
|
3843
|
+
graphId: string;
|
|
3844
|
+
axis: string;
|
|
3845
|
+
/**
|
|
3846
|
+
* `uniques.constraint_name`. The edge claim relation keys on
|
|
3847
|
+
* `(graph_id, axis, key)` and has no such column, so its targets omit it and
|
|
3848
|
+
* sort as the empty string. Absent means "this relation does not key on a
|
|
3849
|
+
* constraint name", never "not known yet".
|
|
3850
|
+
*/
|
|
3851
|
+
constraintName?: string;
|
|
3852
|
+
key: string;
|
|
3853
|
+
}>;
|
|
3854
|
+
/**
|
|
3855
|
+
* WHO holds a claim. A node, not an id: ids are unique only per kind, so
|
|
3856
|
+
* `(concrete_kind, node_id)` is the smallest thing that identifies a claimant.
|
|
3857
|
+
*/
|
|
3858
|
+
type ClaimOwner = Readonly<{
|
|
3859
|
+
concreteKind: string;
|
|
3860
|
+
nodeId: string;
|
|
3861
|
+
}>;
|
|
3862
|
+
|
|
3863
|
+
/**
|
|
3864
|
+
* The read-only fence diagnostic: which claim axes are ALREADY contended.
|
|
3865
|
+
*
|
|
3866
|
+
* A claim relation refuses a second claimant from the first post-upgrade write
|
|
3867
|
+
* onward, but it repairs nothing that is already there. A database that carried
|
|
3868
|
+
* two live siblings sharing a scoped key, or two live `cardinality: "one"` edges
|
|
3869
|
+
* from one source, keeps carrying them — the next write that touches such an
|
|
3870
|
+
* axis is refused with the ordinary typed error naming the incumbent, and until
|
|
3871
|
+
* then nothing says so out loud. This module is what says so.
|
|
3872
|
+
*
|
|
3873
|
+
* It reports; it never repairs. Choosing which of two live claimants keeps the
|
|
3874
|
+
* axis is a data-loss decision that belongs to the operator, not to a
|
|
3875
|
+
* diagnostic.
|
|
3876
|
+
*
|
|
3877
|
+
* Every axis and key it names is built by the SAME function the fence writes
|
|
3878
|
+
* with — {@link uniquenessClaimTarget}, {@link disjointnessClaimAxis},
|
|
3879
|
+
* {@link edgeCardinalityClaimTarget} — so a report row names the row a writer
|
|
3880
|
+
* would actually contend for. A second spelling here would produce a report
|
|
3881
|
+
* about axes the fence does not use.
|
|
3882
|
+
*/
|
|
3883
|
+
|
|
3884
|
+
/**
|
|
3885
|
+
* One claim axis more than one live claimant holds.
|
|
3886
|
+
*
|
|
3887
|
+
* Discriminated on the family because the two claim relations record their
|
|
3888
|
+
* holders differently: a `uniques` axis is held by an OWNER PAIR (ids are
|
|
3889
|
+
* unique only per kind), an edge-claim axis by an edge id. `target` is the
|
|
3890
|
+
* claim row itself, so a reader can go straight to the row a writer contends
|
|
3891
|
+
* for rather than reconstructing it from the family's own vocabulary.
|
|
3892
|
+
*/
|
|
3893
|
+
type ConstraintFenceViolation = Readonly<{
|
|
3894
|
+
family: "nodeUniqueness" | "nodeDisjointness";
|
|
3895
|
+
target: ClaimTarget;
|
|
3896
|
+
owners: readonly ClaimOwner[];
|
|
3897
|
+
}> | Readonly<{
|
|
3898
|
+
family: "edgeCardinality";
|
|
3899
|
+
target: ClaimTarget;
|
|
3900
|
+
edgeIds: readonly string[];
|
|
3901
|
+
}>;
|
|
3902
|
+
|
|
3813
3903
|
/**
|
|
3814
3904
|
* Members that are safe to expose through a history-enabled adapter Store.
|
|
3815
3905
|
*
|
|
@@ -3818,9 +3908,9 @@ type InternalGraphAlgorithms<G extends GraphDef> = Readonly<{
|
|
|
3818
3908
|
* transactions stay internal because each can mutate live rows without a
|
|
3819
3909
|
* corresponding capture flush.
|
|
3820
3910
|
*/
|
|
3821
|
-
declare const HISTORY_STORE_BACKEND_KEYS: readonly ["assertRuntimeContributionsInitialized", "assertVectorSlotInitialized", "assertVectorSlotsInitialized", "bootstrapTables", "capabilities", "checkUnique", "checkUniqueBatch", "claimIndexMaterialization", "close", "commitSchemaVersion", "commitSchemaVersionIfKindsEmpty", "lockSchemaVersionForWrite", "compileSql", "countEdgesByKind", "countEdgesFrom", "countNodesByKind", "createVectorIndex", "deleteEdge", "deleteEdgesBatch", "deleteEmbedding", "deleteEmbeddingBatch", "deleteFulltext", "deleteFulltextBatch", "deleteNode", "deleteUnique", "hardDeleteUniquesByNodeIds", "deleteVectorSlotContribution", "dialect", "dropVectorIndex", "edgeExistsBetween", "ensureContributionMaterializationsTable", "ensureFulltextTable", "ensureIndexMaterializationsTable", "ensureKindRemovalsTable", "ensureReconciliationMarkersTable", "ensureRevisionOriginsTable", "ensureRuntimeContributions", "ensureVectorSlotContribution", "ensureVectorSlotContributions", "execute", "executeTemporaryStatement", "findEdgesByKind", "findEdgesByEndpointSet", "findEdgesByHeterogeneousEndpointSet", "findEdgesConnectedTo", "findNodesByKind", "fulltextSearch", "fulltextStrategy", "getActiveSchema", "getAllKindRemovals", "getContributionMaterialization", "getEdge", "getEdges", "getIndexMaterialization", "getIndexMaterializations", "getNode", "getNodes", "getPendingKindRemovals", "getReconciliationMarker", "getSchemaVersion", "hardDeleteEdge", "hardDeleteEdgesBatch", "hardDeleteNode", "hardDeleteUniquesByNodeIds", "hybridSearch", "insertEdge", "insertEdgeNoReturn", "insertEdgesBatch", "insertEdgesBatchReturning", "insertNode", "insertNodeNoReturn", "insertNodesBatch", "insertNodesBatchReturning", "insertUnique", "insertUniqueBatch", "probeContributions", "recordContributionMaterialization", "recordIndexMaterialization", "recordKindRemoval", "refreshStatistics", "releaseIndexMaterializationClaim", "setActiveVersion", "setReconciliationMarker", "tableNames", "updateEdge", "updateNode", "updateNodeSet", "upsertEmbedding", "upsertEmbeddingBatch", "upsertFulltext", "upsertFulltextBatch", "vectorSearch", "vectorStrategy", "verifyContributions"];
|
|
3911
|
+
declare const HISTORY_STORE_BACKEND_KEYS: readonly ["assertRuntimeContributionsInitialized", "assertVectorSlotInitialized", "assertVectorSlotsInitialized", "bootstrapTables", "capabilities", "checkUnique", "checkUniqueBatch", "claimEdgeCardinality", "claimEdgeCardinalityBatch", "claimIndexMaterialization", "close", "commitSchemaVersion", "commitSchemaVersionIfKindsEmpty", "lockSchemaVersionForWrite", "compileSql", "countEdgesByKind", "countEdgesFrom", "countNodesByKind", "createVectorIndex", "deleteEdge", "deleteEdgesBatch", "deleteEmbedding", "deleteEmbeddingBatch", "deleteFulltext", "deleteFulltextBatch", "deleteNode", "deleteUnique", "hardDeleteUniquesByNodeIds", "deleteVectorSlotContribution", "dialect", "dropVectorIndex", "edgeExistsBetween", "ensureContributionMaterializationsTable", "ensureExtension", "ensureFulltextTable", "ensureIndexMaterializationsTable", "ensureKindRemovalsTable", "ensureReconciliationMarkersTable", "ensureRevisionOriginsTable", "ensureRuntimeContributions", "ensureTrigramExtension", "ensureVectorSlotContribution", "ensureVectorSlotContributions", "execute", "executeTemporaryStatement", "findEdgesByKind", "findEdgesByEndpointSet", "findEdgesByHeterogeneousEndpointSet", "findEdgesConnectedTo", "findNodesByKind", "fulltextSearch", "fulltextStrategy", "getActiveSchema", "getAllKindRemovals", "getContributionMaterialization", "getEdge", "getEdges", "getIndexMaterialization", "getIndexMaterializations", "getNode", "getNodes", "getPendingKindRemovals", "getReconciliationMarker", "getSchemaVersion", "hardDeleteEdge", "hardDeleteEdgesBatch", "hardDeleteNode", "hardDeleteUniquesByConcreteKind", "hardDeleteUniquesByNodeIds", "hybridSearch", "insertEdge", "insertEdgeNoReturn", "insertEdgesBatch", "insertEdgesBatchReturning", "insertNode", "insertNodeNoReturn", "insertNodesBatch", "insertNodesBatchReturning", "insertUnique", "insertUniqueBatch", "probeContributions", "purgeEdgeClaims", "readConstraintFenceViolations", "recordContributionMaterialization", "recordIndexMaterialization", "recordKindRemoval", "refreshStatistics", "releaseIndexMaterializationClaim", "setActiveVersion", "setReconciliationMarker", "tableNames", "updateEdge", "updateNode", "updateNodeSet", "upsertEmbedding", "upsertEmbeddingBatch", "upsertFulltext", "upsertFulltextBatch", "vectorSearch", "vectorStrategy", "verifyContributions"];
|
|
3822
3912
|
type HistoryStoreBackendMember = (typeof HISTORY_STORE_BACKEND_KEYS)[number];
|
|
3823
|
-
type UnsafeHistoryStoreBackendMember = "clearGraph" | "commitSchemaVersionWithPreflight" | "executeDdl" | "executeRaw" | "executeStatement" | "ensureIdentityTables" | "
|
|
3913
|
+
type UnsafeHistoryStoreBackendMember = "clearGraph" | "commitSchemaVersionWithPreflight" | "executeDdl" | "executeRaw" | "executeStatement" | "ensureIdentityTables" | "identityTableDdl" | "rebuildContribution" | "repairContributions" | "schemaWriteTransaction" | "transaction" | "trustedImport";
|
|
3824
3914
|
type UnclassifiedHistoryStoreBackendMember = Exclude<keyof GraphBackend, HistoryStoreBackendMember | UnsafeHistoryStoreBackendMember>;
|
|
3825
3915
|
type HistoryStoreBackend = UnclassifiedHistoryStoreBackendMember extends never ? Readonly<Pick<GraphBackend, HistoryStoreBackendMember>> : never;
|
|
3826
3916
|
|
|
@@ -4185,8 +4275,14 @@ type StoreRuntime<G extends GraphDef> = Readonly<{
|
|
|
4185
4275
|
validateIdentity: () => Promise<void>;
|
|
4186
4276
|
/**
|
|
4187
4277
|
* Validates one final resolved node write set, then clears the affected
|
|
4188
|
-
*
|
|
4189
|
-
*
|
|
4278
|
+
* nodes' claim rows so its upserts may take their approved keys in any order,
|
|
4279
|
+
* and re-takes the complete claim set once the writes have landed. The caller
|
|
4280
|
+
* must supply a transaction-bound backend.
|
|
4281
|
+
*
|
|
4282
|
+
* The clear is by OWNER, so it takes every claim the affected nodes hold —
|
|
4283
|
+
* uniqueness and `disjointWith` alike — and the rebuild therefore goes through
|
|
4284
|
+
* the same claim writer an ordinary create uses rather than a uniqueness-only
|
|
4285
|
+
* insert. See `store/claims/resolved-node-claims.ts`.
|
|
4190
4286
|
*/
|
|
4191
4287
|
applyResolvedNodeUniqueness: <Output>(target: TransactionBackend, writes: Readonly<{
|
|
4192
4288
|
upserts: readonly Readonly<{
|
|
@@ -4318,12 +4414,12 @@ type StoreRuntime<G extends GraphDef> = Readonly<{
|
|
|
4318
4414
|
nextAfter?: string;
|
|
4319
4415
|
done: boolean;
|
|
4320
4416
|
}>>;
|
|
4321
|
-
lockIdentityImportTarget: (target: GraphBackend
|
|
4322
|
-
foldImportedIdentityNodes: (target:
|
|
4417
|
+
lockIdentityImportTarget: (target: Readonly<BackendIdentity & GraphEntityReadBackend & SchemaReadBackend & QueryExecutionBackend & SqlCompilationBackend & RawQueryExecutionBackend & Pick<GraphBackend, "executeStatement">>) => Promise<void>;
|
|
4418
|
+
foldImportedIdentityNodes: (target: Readonly<BackendIdentity & GraphEntityReadBackend & SchemaReadBackend & QueryExecutionBackend & SqlCompilationBackend & RawQueryExecutionBackend & Pick<GraphBackend, "executeStatement">>, references: readonly Readonly<{
|
|
4323
4419
|
kind: string;
|
|
4324
4420
|
id: string;
|
|
4325
4421
|
}>[]) => Promise<void>;
|
|
4326
|
-
importIdentityAssertionsAtTarget: (target:
|
|
4422
|
+
importIdentityAssertionsAtTarget: (target: Readonly<BackendIdentity & GraphEntityReadBackend & SchemaReadBackend & QueryExecutionBackend & SqlCompilationBackend & RawQueryExecutionBackend & Pick<GraphBackend, "executeStatement">>, assertions: readonly Readonly<{
|
|
4327
4423
|
id: string;
|
|
4328
4424
|
relation: "same" | "different";
|
|
4329
4425
|
a: Readonly<{
|
|
@@ -5062,6 +5158,7 @@ type StoreCore<G extends GraphDef> = Readonly<{
|
|
|
5062
5158
|
materializeSystemIndexes: (options?: MaterializeSystemIndexesOptions) => Promise<MaterializeIndexesResult>;
|
|
5063
5159
|
reembedVectorField: (kind: string, fieldPath: string, options?: ReembedVectorFieldOptions) => Promise<ReembedVectorFieldResult>;
|
|
5064
5160
|
verifyContributions: () => Promise<readonly ContributionDiagnostic[]>;
|
|
5161
|
+
verifyConstraintFences: () => Promise<readonly ConstraintFenceViolation[]>;
|
|
5065
5162
|
repairContributions: () => Promise<ContributionRepairResult>;
|
|
5066
5163
|
probeContributions: () => Promise<ContributionProbeResult>;
|
|
5067
5164
|
rebuildContribution: (scope: ContributionRebuildScope, options?: RebuildContributionOptions) => Promise<ContributionRebuildResult>;
|
|
@@ -5363,4 +5460,4 @@ declare function createVerifiedAdapterStore<G extends GraphDef, TNativeTransacti
|
|
|
5363
5460
|
SchemaValidationResult
|
|
5364
5461
|
]>;
|
|
5365
5462
|
|
|
5366
|
-
export { type
|
|
5463
|
+
export { type DynamicNode as $, type AliasMap as A, type BaseStoreOptions as B, type BatchableQuery as C, type BulkEdgeSourceGroup as D, type EdgeAliasMap as E, type BulkFindEdgesFromParams as F, type BulkFindEdgesFromResult as G, type HistoryStoreOptions as H, type IdentityAssertion as I, type BulkOperationHookContext as J, type ClaimOwner as K, type LiveStoreOptions as L, type ClaimTarget as M, type ConstraintFenceViolation as N, type ConstraintNames as O, type CreateEdgeInput as P, type QueryCoordinateState as Q, type RecordedReadStoreOptions as R, type StoreOptions as S, TraversalBuilder as T, type UnboundLiveStoreOptions as U, type CreateNodeInput as V, type DegreeOptions as W, type DynamicEdgeAccessor as X, type DynamicEdgeCollection as Y, type DynamicEdgeType as Z, type DynamicFieldBuilder as _, type Store as a, type NodeIdentifier as a$, type DynamicNodeAccessor as a0, type DynamicNodeCollection as a1, type DynamicNodeKind as a2, type DynamicNodeReference as a3, type DynamicNodeType as a4, type DynamicSelectableEdge as a5, type DynamicSelectableNode as a6, type Edge as a7, type EdgeAccessor as a8, type EdgeBatchReads as a9, type HybridSearchOptions as aA, type HybridVectorOptions as aB, type IdentityAssertionWriteFacade as aC, type IdentityNodeReference as aD, type IdentityTraversalOption as aE, type IdentityValidityWindow as aF, type IfExistsMode as aG, type InitialQueryBuilder as aH, type KindIntrospection as aI, type LabelPropagationMembership as aJ, type LabelPropagationOptions as aK, type MaterializeRemovalsEntry as aL, type MaterializeRemovalsOptions as aM, type MaterializeRemovalsResult as aN, type MeasurableAdapterHistoryTransactionContext as aO, type MeasurableAdapterTransactionContext as aP, type MeasurableTransactionContext as aQ, type NeighborsOptions as aR, type NoRecordedCoordinate as aS, type Node as aT, type NodeAccessor as aU, type NodeAlias as aV, type NodeBulkFindByIndexOptions as aW, type NodeCollection as aX, type NodeCurrentReads as aY, type NodeGetOrCreateByConstraintOptions as aZ, type NodeGetOrCreateByConstraintResult as a_, type EdgeBulkFindEndpointOptions as aa, type EdgeBulkFindOptions as ab, type EdgeCollection as ac, type EdgeFindByEndpointsOptions as ad, type EdgeGetOrCreateByEndpointsOptions as ae, type EdgeGetOrCreateByEndpointsResult as af, type EdgeIntrospection as ag, type EdgeTemporalReads as ah, type EdgeWrites as ai, type EmptyAliasMap as aj, type EmptyEdgeAliasMap as ak, ExecutableAggregateQuery as al, ExecutableQuery as am, type FieldAccessor as an, type FulltextSearchHit as ao, type FulltextSearchOptions as ap, type GetOrCreateAction as aq, type GraphAlgorithms as ar, type GraphEdgeCollections as as, type GraphEdgeForKinds as at, type GraphNodeCollections as au, type GraphNodeReference as av, type HistoryStoreBackend as aw, type HookContext as ax, type HybridFulltextOptions as ay, type HybridSearchHit as az, type HistoryStore as b, type StoreViewSubgraphOptions as b$, type NodeRef as b0, type NodeTemporalReads as b1, type NodeWrites as b2, type OntologyIntrospection as b3, type OperationHookContext as b4, type PageRankOptions as b5, type PageRankScore as b6, type PaginateOptions as b7, type PaginatedResult as b8, type PathNode as b9, type ScopedMeasure as bA, type SearchScopeOptions as bB, type SelectContext as bC, type SelectableEdge as bD, type SelectableNode as bE, type ShortestPathOptions as bF, type ShortestPathResult as bG, type SqlAvailability as bH, type StoreHooks as bI, type StoreProjection as bJ, type StoreRef as bK, StoreSearch as bL, StoreView as bM, type StoreViewCanReachOptions as bN, type StoreViewCoordinate as bO, type StoreViewDegreeOptions as bP, type StoreViewEdgeCollection as bQ, type StoreViewEdgeCollections as bR, type StoreViewGraphAlgorithms as bS, type StoreViewLabelPropagationOptions as bT, type StoreViewNeighborsOptions as bU, type StoreViewNodeCollection as bV, type StoreViewNodeCollections as bW, type StoreViewPageRankOptions as bX, type StoreViewPersonalizedPageRankOptions as bY, type StoreViewReachableOptions as bZ, type StoreViewShortestPathOptions as b_, type PersonalizedPageRankOptions as ba, type PersonalizedPageRankSeed as bb, type Predicate as bc, PreparedQuery as bd, type PropsAccessor as be, type QueryHookContext as bf, type QueryOptions as bg, type ReachableNode as bh, type ReachableOptions as bi, type RebuildContributionOptions as bj, type RebuildFulltextOptions as bk, type RebuildFulltextResult as bl, type ReclaimedVectorFieldEntry as bm, type ReconciledSchema as bn, type RecordedScanOptions as bo, type RecordedScanPage as bp, RecordedStoreView as bq, type RecordedStoreViewEdgeCollection as br, type RecordedStoreViewEdgeCollections as bs, type RecordedStoreViewNodeCollection as bt, type RecordedStoreViewNodeCollections as bu, type RecursiveTraversalOptions as bv, type ReembedFunction as bw, type ReembedVectorFieldOptions as bx, type ReembedVectorFieldResult as by, type SchemaIntrospection as bz, type RecordedReadStore as c, type StoreViewWeaklyConnectedComponentsOptions as c0, type StoreViewWeightedShortestPathOptions as c1, type StreamOptions as c2, type SubgraphEdgeResult as c3, type SubgraphNodeResult as c4, type SubgraphOptions as c5, type SubgraphResult as c6, type SubsetEdge as c7, type SubsetNode as c8, type TemporalAlgorithmOptions as c9, defineSubgraphProject as cA, exists as cB, fieldRef as cC, inSubquery as cD, isParameterRef as cE, notExists as cF, notInSubquery as cG, param as cH, type TransactionContext as ca, type TransactionOutcome as cb, type TransactionReceipt as cc, type TraversalDirection as cd, type TypedEdgeCollection as ce, type TypedRecordedStoreViewEdgeCollection as cf, type TypedStoreViewEdgeCollection as cg, UnionableQuery as ch, type UniqueIntrospection as ci, type UpdateEdgeInput as cj, type UpdateNodeInput as ck, type ValidityEndMutation as cl, type VectorSearchHit as cm, type VectorSearchOptions as cn, type WeaklyConnectedComponentMembership as co, type WeaklyConnectedComponentsOptions as cp, type WeightedShortestPathOptions as cq, type WeightedShortestPathResult as cr, asIdentityAssertionId as cs, createAdapterStore as ct, createAdapterStoreWithSchema as cu, createQueryBuilder as cv, createStore as cw, createStoreWithSchema as cx, createVerifiedAdapterStore as cy, createVerifiedStore as cz, type IdentityAssertionId as d, type IdentityAssertionResult as e, type IdentityFacade as f, type IdentityNode as g, type IdentityNodeRefInput as h, type IdentityPair as i, type IdentityReadFacade as j, type IdentityRelation as k, type IdentityWriteSummary as l, type RecursiveAliasMap as m, QueryBuilder as n, type EmptyRecursiveAliasMap as o, type AdapterHistoryStore as p, type AdapterHistoryTransactionContext as q, type AdapterRecordedReadStore as r, type AdapterStore as s, type AdapterTransactionContext as t, type AggregateResult as u, type AlgorithmCyclePolicy as v, type AnyEdge as w, type AnyNode as x, type BaseTraversalOptions as y, type BatchResults as z };
|