@nicia-ai/typegraph 0.33.0 → 0.34.0

package/dist/provenance/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/provenance/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AA6BA,IAAM,uBAAA,GAA0B,WAAA;AAChC,IAAM,aAAA,GAAgB,IAAA;AAmJtB,SAAS,OAAO,GAAA,EAAgC;AAC9C,EAAA,OAAO,GAAG,GAAA,CAAI,IAAI,GAAG,aAAa,CAAA,EAAG,IAAI,EAAE,CAAA,CAAA;AAC7C;AAEA,SAAS,OAAO,GAAA,EAA2C;AACzD,EAAA,OAAO,MAAA,CAAO,EAAE,IAAA,EAAM,GAAA,CAAI,MAAM,EAAA,EAAI,GAAA,CAAI,IAAI,CAAA;AAC9C;AAEA,SAAS,YAAY,IAAA,EAAuB;AAC1C,EAAA,OAAO,MAAA,CAAO,EAAE,IAAA,EAAM,IAAA,CAAK,WAAW,EAAA,EAAI,IAAA,CAAK,SAAS,CAAA;AAC1D;AAEA,SAAS,UAAU,IAAA,EAAuB;AACxC,EAAA,OAAO,MAAA,CAAO,EAAE,IAAA,EAAM,IAAA,CAAK,SAAS,EAAA,EAAI,IAAA,CAAK,OAAO,CAAA;AACtD;AAEA,SAAS,SAGP,GAAA,EAAsC;AACtC,EAAA,MAAM,cAAA,GAAiB,GAAA,CAAI,OAAA,CAAQ,aAAa,CAAA;AAChD,EAAA,IAAI,mBAAmB,EAAA,EAAI;AACzB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,kCAAA;AAAA,MACA,EAAE,GAAA,EAAI;AAAA,MACN;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,cAAc,CAAA;AACxC,EAAA,MAAM,EAAA,GAAK,GAAA,CAAI,KAAA,CAAM,cAAA,GAAiB,cAAc,MAAM,CAAA;AAC1D,EAAA,OAAO,EAAE,MAAM,EAAA,EAAG;AACpB;AAEA,SAAS,iBAGP,IAAA,EAAmD;AACnD,EAAA,OAAO,CAAC,GAAG,IAAI,EACZ,QAAA,CAAS,CAAC,MAAM,KAAA,KAAU,cAAA,CAAe,IAAA,EAAM,KAAK,CAAC,CAAA,CACrD,GAAA,CAAI,CAAC,GAAA,KAAQ,QAAA,CAAe,GAAG,CAAC,CAAA;AACrC;AAEA,SAAS,eAAe,GAAA,EAAuC;AAC7D,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA;AACnC,EAAA,IAAI,CAAC,aAAA,CAAc,MAAM,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,KAAA,EAAQ,GAAA,CAAI,IAAI,CAAA,CAAA,EAAI,IAAI,EAAE,CAAA,yBAAA,CAAA;AAAA,MAC1B,EAAE,IAAA,EAAM,GAAA,CAAI,IAAA,EAAM,EAAA,EAAI,IAAI,EAAA;AAAG,KAC/B;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,oBAAA,CACP,KACA,cAAA,EACsB;AACtB,EAAA,MAAM,KAAA,GAAQ,eAAe,GAAG,CAAA;AAChC,EAAA,MAAM,KAAA,GAAQ,MAAM,cAAc,CAAA;AAClC,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,WAAA;AAChC,EAAA,IAAI,OAAO,UAAU,SAAA,EAAW;AAC9B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,4BAA4B,cAAc,CAAA,+BAAA,CAAA;AAAA,MAC1C,EAAE,MAAM,GAAA,CAAI,IAAA,EAAM,IAAI,GAAA,CAAI,EAAA,EAAI,OAAO,cAAA,EAAe;AAAA,MACpD;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,OAAO,QAAQ,WAAA,GAAc,WAAA;AAC/B;AAEA,SAAS,eAAA,CACP,OACA,MAAA,EACkB;AAClB,EAAA,MAAM,WAAA,GAAc,qBAAA,CAAsB,MAAA,CAAO,MAAM,CAAA;AACvD,EAAA,MAAM,iBAAA,GAAoB,OAAO,aAAA,CAAc,IAAA;AAC/C,EAAA,MAAM,SAAA,GAAY,CAAC,GAAG,MAAA,CAAO,KAAK,KAAK,CAAA;AACvC,EAAA,MAAM,aAAA,GAAgB,OAAO,SAAA,CAAU,IAAA;AACvC,EAAA,MAAM,WAAA,GAAc,OAAO,OAAA,CAAQ,IAAA;AACnC,EAAA,MAAM,cAAA,GACJ,MAAA,CAAO,MAAA,CAAO,cAAA,IAAkB,uBAAA;AAElC,EAAA,IAAI,WAAA,CAAY,WAAW,CAAA,EAAG;AAC5B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,0DAAA;AAAA,MACA,EAAE,MAAM,QAAA;AAAS,KACnB;AAAA,EACF;AAEA,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wDAAA;AAAA,MACA,EAAE,MAAM,MAAA;AAAO,KACjB;AAAA,EACF;AAEA,EAAA,MAAM,oBAAA,GAAuB,gBAAgB,WAAW,CAAA;AACxD,EAAA,IAAI,oBAAA,CAAqB,SAAS,CAAA,EAAG;AACnC,IAAA,MAAM,IAAI,mBAAmB,yCAAA,EAA2C;AAAA,MACtE;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,kBAAA,GAAqB,gBAAgB,SAAS,CAAA;AACpD,EAAA,IAAI,kBAAA,CAAmB,SAAS,CAAA,EAAG;AACjC,IAAA,MAAM,IAAI,mBAAmB,uCAAA,EAAyC;AAAA,MACpE;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC9B,IAAA,UAAA,CAAW,MAAM,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,MAAM,EAAE,CAAA;AAAA,EAC1D;AACA,EAAA,UAAA,CAAW,MAAM,KAAA,EAAO,iBAAA,EAAmB,eAAA,EAAiB,MAAA,EAAQ,MAAM,EAAE,CAAA;AAC5E,EAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC5B,IAAA,UAAA,CAAW,MAAM,KAAA,EAAO,IAAA,EAAM,MAAA,EAAQ,MAAA,EAAQ,MAAM,EAAE,CAAA;AAAA,EACxD;AACA,EAAA,KAAA,MAAW,IAAA,IAAQ,WAAA;AACjB,IAAA,iBAAA,CAAkB,KAAA,EAAO,MAAM,cAAc,CAAA;AAC/C,EAAA,UAAA,CAAW,MAAM,KAAA,EAAO,aAAA,EAAe,WAAA,EAAa,MAAA,EAAQ,MAAM,EAAE,CAAA;AACpE,EAAA,UAAA,CAAW,MAAM,KAAA,EAAO,WAAA,EAAa,SAAA,EAAW,MAAA,EAAQ,MAAM,EAAE,CAAA;AAEhE,EAAA,IACE,SAAA,CAAU,IAAA;AAAA,IACR,CAAC,IAAA,KAAS,WAAA,CAAY,QAAA,CAAS,IAAI,KAAK,IAAA,KAAS;AAAA,GACnD,EACA;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,6EAAA;AAAA,MACA,EAAE,WAAA,EAAa,iBAAA,EAAmB,SAAA;AAAU,KAC9C;AAAA,EACF;AAEA,EAAA,mBAAA,CAAoB,OAAO,aAAA,EAAe;AAAA,IACxC,IAAA,EAAM,WAAA;AAAA,IACN,SAAA,EAAW,WAAA;AAAA,IACX,OAAA,EAAS,CAAC,iBAAiB;AAAA,GAC5B,CAAA;AACD,EAAA,mBAAA,CAAoB,OAAO,WAAA,EAAa;AAAA,IACtC,IAAA,EAAM,SAAA;AAAA,IACN,SAAA,EAAW,CAAC,iBAAiB,CAAA;AAAA,IAC7B,OAAA,EAAS;AAAA,GACV,CAAA;AAED,EAAA,OAAO;AAAA,IACL,WAAA;AAAA,IACA,cAAA;AAAA,IACA,iBAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,sBACP,MAAA,EACU;AACV,EAAA,IAAI,WAAW,MAAA,EAAQ,OAAO,CAAC,GAAG,OAAO,KAAK,CAAA;AAC9C,EAAA,OAAO,CAAC,OAAO,IAAI,CAAA;AACrB;AAEA,SAAS,gBAAgB,MAAA,EAAqC;AAC5D,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AACnC,EAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,EAAG;AACnB,MAAA,UAAA,CAAW,IAAI,KAAK,CAAA;AACpB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,IAAI,KAAK,CAAA;AAAA,EAChB;AACA,EAAA,OAAO,CAAC,GAAG,UAAU,CAAA,CAAE,QAAA,CAAS,CAAC,IAAA,EAAM,KAAA,KAAU,cAAA,CAAe,IAAA,EAAM,KAAK,CAAC,CAAA;AAC9E;AAEA,SAAS,UAAA,CACP,OAAA,EACA,IAAA,EACA,IAAA,EACA,MACA,OAAA,EACM;AACN,EAAA,IAAI,MAAA,CAAO,MAAA,CAAO,OAAA,EAAS,IAAI,CAAA,EAAG;AAClC,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,CAAA,WAAA,EAAc,IAAI,CAAA,OAAA,EAAU,IAAI,cAAc,IAAI,CAAA,oBAAA,CAAA;AAAA,IAClD,EAAE,IAAA,EAAM,IAAA,EAAM,OAAA;AAAQ,GACxB;AACF;AAEA,SAAS,iBAAA,CACP,KAAA,EACA,UAAA,EACA,cAAA,EACM;AACN,EAAA,MAAM,YAAA,GAAe,KAAA,CAAM,KAAA,CAAM,UAAU,CAAA;AAC3C,EAAA,IAAI,iBAAiB,MAAA,EAAW;AAChC,EAAA,IAAI,OAAO,MAAA,CAAO,YAAA,CAAa,KAAK,MAAA,CAAO,KAAA,EAAO,cAAc,CAAA,EAAG;AACnE,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,CAAA,wBAAA,EAA2B,UAAU,CAAA,sBAAA,EAAyB,cAAc,CAAA,EAAA,CAAA;AAAA,IAC5E,EAAE,YAAY,cAAA,EAAe;AAAA,IAC7B;AAAA,MACE,UAAA,EACE;AAAA;AACJ,GACF;AACF;AAEA,SAAS,mBAAA,CACP,KAAA,EACA,QAAA,EACA,QAAA,EAKM;AACN,EAAA,MAAM,YAAA,GAAe,KAAA,CAAM,KAAA,CAAM,QAAQ,CAAA;AACzC,EAAA,IAAI,iBAAiB,MAAA,EAAW;AAChC,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,IAAA,KAAS,IAAA,CAAK,IAAI,CAAC,CAAA;AACpE,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,YAAA,CAAa,EAAA,CAAG,IAAI,CAAC,IAAA,KAAS,IAAA,CAAK,IAAI,CAAC,CAAA;AAChE,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,SAAA,EAAW;AACrC,IAAA,IAAI,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA,EAAG;AACzB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,cAAc,QAAA,CAAS,IAAI,CAAA,OAAA,EAAU,QAAQ,sBAAsB,IAAI,CAAA,EAAA,CAAA;AAAA,MACvE,EAAE,QAAA,EAAU,IAAA,EAAM,QAAA,CAAS,IAAA,EAAM,cAAc,IAAA;AAAK,KACtD;AAAA,EACF;AACA,EAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,OAAA,EAAS;AACnC,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AACvB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,cAAc,QAAA,CAAS,IAAI,CAAA,OAAA,EAAU,QAAQ,oBAAoB,IAAI,CAAA,EAAA,CAAA;AAAA,MACrE,EAAE,QAAA,EAAU,IAAA,EAAM,QAAA,CAAS,IAAA,EAAM,YAAY,IAAA;AAAK,KACpD;AAAA,EACF;AACF;AAQA,SAAS,SAAA,CACP,KACA,IAAA,EACS;AACT,EAAA,OAAA,CACG,GAAA,CAAI,UAAA,KAAe,MAAA,IAAa,GAAA,CAAI,UAAA,IAAc,UAClD,GAAA,CAAI,QAAA,KAAa,MAAA,IAAa,GAAA,CAAI,QAAA,GAAW,IAAA,CAAA;AAElD;AAWA,eAAe,YAAA,CACb,OAAA,EACA,OAAA,EACA,IAAA,EACA,OAAA,EAC6B;AAC7B,EAAA,IAAI,QAAQ,iBAAA,EAAmB;AAC7B,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,eAAA,CAAgB;AAAA,MACzC,OAAA;AAAA,MACA,IAAA;AAAA,MACA,cAAA,EAAgB,KAAA;AAAA,MAChB,YAAA,EAAc,mBAAA;AAAA,MACd,OAAA,EAAS;AAAA,KACV,CAAA;AACD,IAAA,OAAO,IAAA,CAAK,OAAO,CAAC,GAAA,KAAQ,UAAU,GAAA,EAAK,OAAA,CAAQ,IAAI,CAAC,CAAA;AAAA,EAC1D;AACA,EAAA,OAAO,QAAQ,eAAA,CAAgB;AAAA,IAC7B,OAAA;AAAA,IACA,IAAA;AAAA,IACA,cAAA,EAAgB,IAAA;AAAA,IAChB,YAAA,EAAc,SAAA;AAAA,IACd,MAAM,OAAA,CAAQ,IAAA;AAAA,IACd,OAAA,EAAS;AAAA,GACV,CAAA;AACH;AAEA,eAAe,YAAA,CACb,OAAA,EACA,OAAA,EACA,IAAA,EACA,IAAA,EAC6B;AAC7B,EAAA,OAAO,QAAQ,eAAA,CAAgB;AAAA,IAC7B,OAAA;AAAA,IACA,IAAA;AAAA,IACA,cAAA,EAAgB,IAAA;AAAA,IAChB,YAAA,EAAc,SAAA;AAAA,IACd,IAAA;AAAA,IACA,OAAA,EAAS;AAAA,GACV,CAAA;AACH;AAEA,eAAe,SAAA,CACb,OAAA,EACA,OAAA,EACA,MAAA,EACA,IAAA,EACyB;AACzB,EAAA,MAAM,CAAC,mBAAmB,cAAA,EAAgB,YAAA,EAAc,WAAW,CAAA,GACjE,MAAM,QAAQ,GAAA,CAAI;AAAA,IAChB,YAAA,CAAa,OAAA,EAAS,OAAA,EAAS,MAAA,CAAO,iBAAA,EAAmB;AAAA,MACvD,iBAAA,EAAmB,KAAA;AAAA,MACnB;AAAA,KACD,CAAA;AAAA,IACD,OAAA,CAAQ,GAAA;AAAA,MACN,OAAO,SAAA,CAAU,GAAA;AAAA,QAAI,CAAC,IAAA,KACpB,YAAA,CAAa,OAAA,EAAS,SAAS,IAAA,EAAM;AAAA,UACnC,iBAAA,EAAmB,IAAA;AAAA,UACnB;AAAA,SACD;AAAA;AACH,KACF;AAAA,IACA,YAAA,CAAa,OAAA,EAAS,OAAA,EAAS,MAAA,CAAO,eAAe,IAAI,CAAA;AAAA,IACzD,YAAA,CAAa,OAAA,EAAS,OAAA,EAAS,MAAA,CAAO,aAAa,IAAI;AAAA,GACxD,CAAA;AACH,EAAA,MAAM,QAAA,GAAW,eAAe,IAAA,EAAK;AAErC,EAAA,OAAO;AAAA,IACL,cAAA,EAAgB,UAAU,iBAAiB,CAAA;AAAA,IAC3C,KAAA,EAAO,UAAU,QAAQ,CAAA;AAAA,IACzB,YAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,UAAU,IAAA,EAAwD;AACzE,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAqB;AACvC,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM,KAAA,CAAM,IAAI,MAAA,CAAO,GAAG,GAAG,GAAG,CAAA;AAClD,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,kBAAA,CACP,MAAA,EACA,GAAA,EACA,KAAA,EACM;AACN,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC5B,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,CAAC,KAAK,CAAC,CAAA;AACvB,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA,EAAG;AAC3B,EAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAClB;AAEA,SAAS,iBAAA,CACP,QACA,IAAA,EACc;AACd,EAAA,MAAM,uBAAA,uBAA8B,GAAA,EAAsB;AAC1D,EAAA,MAAM,oBAAA,uBAA2B,GAAA,EAAsB;AACvD,EAAA,MAAM,uBAAA,uBAA8B,GAAA,EAAsB;AAE1D,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,YAAA,EAAc;AACpC,IAAA,IAAI,IAAA,CAAK,OAAA,KAAY,MAAA,CAAO,iBAAA,EAAmB;AAC/C,IAAA,IAAI,CAAC,aAAA,CAAc,MAAA,EAAQ,IAAA,CAAK,SAAS,CAAA,EAAG;AAE5C,IAAA,MAAM,UAAA,GAAa,YAAY,IAAI,CAAA;AACnC,IAAA,MAAM,gBAAA,GAAmB,UAAU,IAAI,CAAA;AACvC,IAAA,kBAAA,CAAmB,uBAAA,EAAyB,kBAAkB,UAAU,CAAA;AACxE,IAAA,kBAAA,CAAmB,uBAAA,EAAyB,YAAY,gBAAgB,CAAA;AAAA,EAC1E;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,WAAA,EAAa;AACnC,IAAA,IAAI,IAAA,CAAK,SAAA,KAAc,MAAA,CAAO,iBAAA,EAAmB;AACjD,IAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,QAAA,CAAS,IAAA,CAAK,OAAO,CAAA,EAAG;AAC9C,IAAA,kBAAA;AAAA,MACE,oBAAA;AAAA,MACA,YAAY,IAAI,CAAA;AAAA,MAChB,UAAU,IAAI;AAAA,KAChB;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,uBAAA;AAAA,IACA,oBAAA;AAAA,IACA;AAAA,GACF;AACF;AAeA,eAAe,gBAAA,CACb,OAAA,EACA,OAAA,EACA,MAAA,EACuB;AAGvB,EAAA,MAAM,OAAO,MAAA,EAAO;AACpB,EAAA,MAAM,QAAQ,MAAM,SAAA,CAAU,OAAA,EAAS,OAAA,EAAS,QAAQ,IAAI,CAAA;AAC5D,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,MAAA,EAAQ,KAAK,CAAA;AACpD,EAAA,MAAM,gBAAA,GAAmB,MAAM,OAAA,CAAQ,GAAA;AAAA,IACrC,OAAO,WAAA,CAAY,GAAA;AAAA,MAAI,CAAC,IAAA,KACtB,YAAA,CAAa,OAAA,EAAS,OAAA,EAAS,MAAM,EAAE,iBAAA,EAAmB,KAAA,EAAO,IAAA,EAAM;AAAA;AACzE,GACF;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,YAAA,EAAc,UAAA,EAAY,gBAAA,CAAiB,MAAK,EAAE;AACpE;AAEA,SAAS,mBAAA,CACP,YACA,cAAA,EACa;AACb,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,EAAA,KAAA,MAAW,OAAO,UAAA,EAAY;AAC5B,IAAA,IAAI,oBAAA,CAAqB,GAAA,EAAK,cAAc,CAAA,KAAM,WAAA,EAAa;AAC7D,MAAA,SAAA,CAAU,GAAA,CAAI,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,IAC3B;AAAA,EACF;AACA,EAAA,OAAO,SAAA;AACT;AAQA,SAAS,sBAAA,CACP,OACA,SAAA,EACiB;AACjB,EAAA,MAAM,EAAE,KAAA,EAAO,YAAA,EAAa,GAAI,KAAA;AAChC,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,EAAA,MAAM,KAAA,GAAQ,IAAI,GAAA,CAAY,SAAS,CAAA;AACvC,EAAA,MAAM,oBAAA,uBAA2B,GAAA,EAAY;AAC7C,EAAA,MAAM,6BAAA,uBAAoC,GAAA,EAAsB;AAEhE,EAAA,IAAI,OAAA,GAAU,IAAA;AACd,EAAA,OAAO,OAAA,EAAS;AACd,IAAA,OAAA,GAAU,KAAA;AACV,IAAA,KAAA,MAAW,CAAC,gBAAgB,CAAA,IAAK,KAAA,CAAM,cAAA,EAAgB;AACrD,MAAA,IAAI,oBAAA,CAAqB,GAAA,CAAI,gBAAgB,CAAA,EAAG;AAChD,MAAA,MAAM,WACJ,YAAA,CAAa,uBAAA,CAAwB,GAAA,CAAI,gBAAgB,KAAK,EAAC;AACjE,MAAA,IAAI,CAAC,oBAAA,CAAqB,QAAA,EAAU,KAAK,CAAA,EAAG;AAE5C,MAAA,oBAAA,CAAqB,IAAI,gBAAgB,CAAA;AACzC,MAAA,MAAM,eACJ,YAAA,CAAa,oBAAA,CAAqB,GAAA,CAAI,gBAAgB,KAAK,EAAC;AAC9D,MAAA,KAAA,MAAW,WAAW,YAAA,EAAc;AAClC,QAAA,IAAI,CAAC,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,QAAA,kBAAA;AAAA,UACE,6BAAA;AAAA,UACA,OAAA;AAAA,UACA;AAAA,SACF;AACA,QAAA,IAAI,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA,EAAG;AAC5B,QAAA,SAAA,CAAU,IAAI,OAAO,CAAA;AACrB,QAAA,KAAA,CAAM,IAAI,OAAO,CAAA;AACjB,QAAA,OAAA,GAAU,IAAA;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,KAAA,MAAW,OAAO,SAAA,EAAW;AAC3B,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAC/B,IAAA,IAAI,QAAQ,MAAA,IAAa,GAAA,CAAI,eAAe,MAAA,EAAW,QAAA,CAAS,IAAI,GAAG,CAAA;AAAA,EACzE;AAEA,EAAA,OAAO;AAAA,IACL,OAAO,KAAA,CAAM,KAAA;AAAA,IACb,iBAAA,EAAmB,SAAA;AAAA,IACnB,gBAAA,EAAkB,QAAA;AAAA,IAClB,6BAAA;AAAA,IACA,iBACE,OAAA,EACqB;AACrB,MAAA,OAAO,uBAAA,CAAwB,OAAA,EAAS,KAAA,EAAO,YAAY,CAAA;AAAA,IAC7D;AAAA,GACF;AACF;AAEA,eAAe,cAAA,CACb,OAAA,EACA,OAAA,EACA,MAAA,EAC0B;AAC1B,EAAA,MAAM,KAAA,GAAQ,MAAM,gBAAA,CAAiB,OAAA,EAAS,SAAS,MAAM,CAAA;AAC7D,EAAA,OAAO,sBAAA;AAAA,IACL,KAAA;AAAA,IACA,mBAAA,CAAoB,KAAA,CAAM,UAAA,EAAY,MAAA,CAAO,cAAc;AAAA,GAC7D;AACF;AAEA,SAAS,aAAA,CAAc,QAA0B,IAAA,EAAuB;AACtE,EAAA,OAAO,MAAA,CAAO,YAAY,QAAA,CAAS,IAAI,KAAK,MAAA,CAAO,SAAA,CAAU,SAAS,IAAI,CAAA;AAC5E;AAEA,SAAS,oBAAA,CACP,UACA,SAAA,EACS;AACT,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,OAAO,GAAG,OAAO,KAAA;AAAA,EACtC;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,uBAAA,CACP,OAAA,EACA,KAAA,EACA,YAAA,EACqB;AACrB,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AAGjC,EAAA,MAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAW,MAAA,CAAO,MAAM,CAAC,CAAA;AACvD,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAY,QAAQ,CAAA;AAErC,EAAA,OAAO,QAAA,CAAS,SAAS,CAAA,EAAG;AAC1B,IAAA,MAAM,OAAA,GAAU,SAAS,KAAA,EAAM;AAC/B,IAAA,IAAI,YAAY,MAAA,EAAW;AAE3B,IAAA,MAAM,iBACJ,YAAA,CAAa,uBAAA,CAAwB,GAAA,CAAI,OAAO,KAAK,EAAC;AACxD,IAAA,KAAA,MAAW,oBAAoB,cAAA,EAAgB;AAC7C,MAAA,MAAM,eACJ,YAAA,CAAa,oBAAA,CAAqB,GAAA,CAAI,gBAAgB,KAAK,EAAC;AAC9D,MAAA,KAAA,MAAW,WAAW,YAAA,EAAc;AAClC,QAAA,IAAI,CAAC,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,OAAO,CAAA,EAAG;AAC/B,QAAA,QAAA,CAAS,IAAI,OAAO,CAAA;AACpB,QAAA,IAAI,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG;AACvB,QAAA,IAAA,CAAK,IAAI,OAAO,CAAA;AAChB,QAAA,QAAA,CAAS,KAAK,OAAO,CAAA;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;AAEA,SAAS,WAAA,CAKP,MAAA,EACA,KAAA,EACA,QAAA,EACkD;AAClD,EAAA,MAAM,cAAA,GAAiB,CAAC,GAAG,MAAA,CAAO,gBAAgB,CAAA;AAClD,EAAA,MAAM,IAAA,GAAO,gBAAA;AAAA,IACX,cAAA,CAAe,OAAO,CAAC,GAAA,KAAQ,CAAC,KAAA,CAAM,iBAAA,CAAkB,GAAA,CAAI,GAAG,CAAC;AAAA,GAClE;AACA,EAAA,MAAM,UAAA,GAAa,gBAAA;AAAA,IACjB,cAAA,CAAe,OAAO,CAAC,GAAA,KAAQ,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAC;AAAA,GACnD;AACA,EAAA,MAAM,WAAA,GAAc,CAAC,GAAG,QAAQ,CAAA,CAC7B,OAAO,CAAC,GAAA,KAAQ,KAAA,CAAM,iBAAA,CAAkB,GAAA,CAAI,GAAG,CAAC,CAAA,CAChD,QAAA,CAAS,CAAC,IAAA,EAAM,KAAA,KAAU,cAAA,CAAe,IAAA,EAAM,KAAK,CAAC,CAAA,CACrD,GAAA,CAAI,CAAC,GAAA,MAAS;AAAA,IACb,IAAA,EAAM,SAAsB,GAAG,CAAA;AAAA,IAC/B,GAAA,EAAK,gBAAA;AAAA,MACH,KAAA,CAAM,6BAAA,CAA8B,GAAA,CAAI,GAAG,KAAK;AAAC;AACnD,GACF,CAAE,CAAA;AACJ,EAAA,OAAO,EAAE,IAAA,EAAM,WAAA,EAAa,UAAA,EAAW;AACzC;AAsBA,eAAe,mBAAA,CACb,QAAA,EACA,QAAA,EACA,WAAA,EACA,aACA,MAAA,EACe;AACf,EAAA,MAAM,OAAY,EAAC;AACnB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,GAAG,CAAA,IAAK,SAAS,KAAA,EAAO;AACvC,IAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,IAAA,IAAI,CAAC,WAAA,CAAY,GAAG,CAAA,EAAG;AACvB,IAAA,IAAI,CAAC,WAAA,CAAY,GAAG,CAAA,EAAG;AACvB,IAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AAAA,EACf;AACA,EAAA,MAAM,OAAA,CAAQ,IAAI,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ,MAAA,CAAO,GAAG,CAAC,CAAC,CAAA;AAClD;AAgBA,eAAe,wBACb,OAAA,EACA,KAAA,EACA,QAAA,EACA,QAAA,EACA,UACA,IAAA,EACe;AACf,EAAA,MAAM,mBAAA;AAAA,IACJ,QAAA;AAAA,IACA,QAAA;AAAA,IACA,CAAC,GAAA,KAAQ,CAAC,QAAA,CAAS,iBAAA,CAAkB,IAAI,GAAG,CAAA;AAAA,IAC5C,aAAA;AAAA,IACA,CAAC,GAAA,KAAQ,iBAAA,CAAkB,SAAS,KAAA,EAAO,QAAA,EAAU,KAAK,IAAI;AAAA,GAChE;AACA,EAAA,MAAM,mBAAA;AAAA,IACJ,QAAA;AAAA,IACA,QAAA;AAAA,IACA,CAAC,GAAA,KAAQ,QAAA,CAAS,iBAAA,CAAkB,IAAI,GAAG,CAAA;AAAA,IAC3C,mBAAA;AAAA,IACA,CAAC,GAAA,KAAQ,kBAAA,CAAmB,SAAS,KAAA,EAAO,QAAA,EAAU,KAAK,IAAI;AAAA,GACjE;AACF;AAEA,SAAS,mBAAA,CACP,OACA,GAAA,EACkB;AAClB,EAAA,MAAM,YAAA,GAAe,KAAA,CAAM,KAAA,CAAM,KAAA,CAAM,IAAI,IAAI,CAAA;AAC/C,EAAA,IAAI,YAAA,KAAiB,QAAW,OAAO,YAAA;AACvC,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,CAAA,sBAAA,EAAyB,IAAI,IAAI,CAAA,mCAAA,CAAA;AAAA,IACjC,EAAE,IAAA,EAAM,GAAA,CAAI,IAAA,EAAM,OAAA,EAAS,MAAM,OAAA;AAAQ,GAC3C;AACF;AAEA,eAAe,iBAAA,CACb,OAAA,EACA,KAAA,EACA,QAAA,EACA,KACA,IAAA,EACe;AACf,EAAA,MAAM,SAAS,QAAA,EAAU,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,IAAI,YAAY;AACrD,IAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,KAAA,EAAO,GAAG,CAAA;AAOnD,IAAA,MAAM,mBAAA;AAAA,MACJ,sBAAA,CAAuB,KAAA,CAAM,OAAA,EAAS,KAAA,CAAM,UAAU,IAAI,CAAA;AAAA,MAC1D;AAAA,QACE,QAAA,EAAU,GAAA;AAAA,QACV,MAAA,EAAQ,aAAa,IAAA,CAAK,MAAA;AAAA,QAC1B,iBAAA,EAAmB,YAAA,CAAa,MAAA,IAAU,EAAC;AAAA,QAC3C,UAAU,YAAA,CAAa;AAAA,OACzB;AAAA,MACA,OAAA;AAAA,MACA,EAAE,uBAAuB,KAAA;AAAM,KACjC;AAAA,EACF,CAAC,CAAA;AACH;AAEA,eAAe,kBAAA,CACb,OAAA,EACA,KAAA,EACA,QAAA,EACA,KACA,IAAA,EACe;AACf,EAAA,MAAM,SAAS,QAAA,EAAU,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,IAAI,YAAY;AACrD,IAAA,MAAM,YAAA,GAAe,mBAAA,CAAoB,KAAA,EAAO,GAAG,CAAA;AAInD,IAAA,MAAM,kBAAA;AAAA,MACJ,sBAAA,CAAuB,KAAA,CAAM,OAAA,EAAS,KAAA,CAAM,UAAU,IAAI,CAAA;AAAA,MAC1D;AAAA,QACE,QAAA,EAAU,GAAA;AAAA,QACV,MAAA,EAAQ,aAAa,IAAA,CAAK,MAAA;AAAA,QAC1B,iBAAA,EAAmB,YAAA,CAAa,MAAA,IAAU;AAAC,OAC7C;AAAA,MACA;AAAA,KACF;AAAA,EACF,CAAC,CAAA;AACH;AAEA,SAAS,4BAAA,CACP,IACA,IAAA,EACuB;AACvB,EAAA,MAAM,UAAA,GAAa,EAAA,CAAG,iBAAA,CAAkB,IAAI,CAAA;AAC5C,EAAA,IAAI,UAAA,KAAe,QAAW,OAAO,UAAA;AACrC,EAAA,MAAM,IAAI,kBAAA;AAAA,IACR,2BAA2B,IAAI,CAAA,uCAAA,CAAA;AAAA,IAC/B,EAAE,IAAA;AAAK,GACT;AACF;AAEA,eAAe,wBAAA,CACb,EAAA,EACA,MAAA,EACA,MAAA,EACA,SAAA,EACe;AACf,EAAA,MAAM,UAAA,GAAa,4BAAA,CAA6B,EAAA,EAAI,MAAA,CAAO,IAAI,CAAA;AAC/D,EAAA,MAAM,UAAA,CAAW,MAAA,CAAO,MAAA,CAAO,EAAA,EAAI,EAAE,CAAC,MAAA,CAAO,cAAc,GAAG,SAAA,EAAW,CAAA;AAC3E;AAEA,eAAe,aAAA,CAMb,KAAA,EACA,MAAA,EACA,OAAA,EACA,SAAA,EAC2D;AAC3D,EAAA,MAAM,aAAA,GAAgB,qBAAqB,OAAO,CAAA;AAClD,EAAA,KAAA,MAAW,UAAU,aAAA,EAAe;AAClC,IAAA,IAAI,MAAA,CAAO,WAAA,CAAY,QAAA,CAAS,MAAA,CAAO,IAAI,CAAA,EAAG;AAC9C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,6CAAA,EAAgD,MAAA,CAAO,WAAA,CAAY,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,MAC7E,EAAE,aAAA,EAAe,MAAA,CAAO,WAAA,EAAa,UAAA,EAAY,OAAO,IAAA;AAAK,KAC/D;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,WAAA,CAAY,OAAO,EAAA,KAAO;AAOrC,IAAA,MAAM,OAAO,MAAM,sBAAA,CAAuB,EAAA,CAAG,OAAA,EAAS,MAAM,OAAO,CAAA;AACnE,IAAA,MAAM,IAAA,GAAO,MAAM,OAAA,CAAQ,GAAA;AAAA,MACzB,aAAA,CAAc,GAAA;AAAA,QAAI,CAAC,MAAA,KACjB,EAAA,CAAG,OAAA,CAAQ,OAAA,CAAQ,MAAM,OAAA,EAAS,MAAA,CAAO,IAAA,EAAM,MAAA,CAAO,EAAE;AAAA;AAC1D,KACF;AACA,IAAA,MAAM,UAAA,GAAa,aAAA,CAAc,GAAA,CAAI,CAAC,QAAQ,KAAA,KAAwB;AACpE,MAAA,MAAM,SAAA,GAAY,KAAK,KAAK,CAAA;AAC5B,MAAA,IAAI,SAAA,KAAc,MAAA,IAAa,SAAA,CAAU,UAAA,KAAe,MAAA,EAAW;AACjE,QAAA,MAAM,IAAI,iBAAA,CAAkB,MAAA,CAAO,IAAA,EAAM,OAAO,EAAE,CAAA;AAAA,MACpD;AACA,MAAA,OAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,SAAA,EAAU;AAAA,IAClC,CAAC,CAAA;AAMD,IAAA,MAAM,eAAe,MAAM,gBAAA;AAAA,MACzB,EAAA,CAAG,OAAA;AAAA,MACH,KAAA,CAAM,OAAA;AAAA,MACN;AAAA,KACF;AACA,IAAA,MAAM,eAAA,GAAkB,mBAAA;AAAA,MACtB,YAAA,CAAa,UAAA;AAAA,MACb,MAAA,CAAO;AAAA,KACT;AACA,IAAA,MAAM,MAAA,GAAS,sBAAA,CAAuB,YAAA,EAAc,eAAe,CAAA;AAEnE,IAAA,MAAM,SAAA,GACJ,YAAY,WAAA,GAAc,WAAA;AAC5B,IAAA,MAAM,cAAA,GAAiB,IAAI,GAAA,CAAI,eAAe,CAAA;AAC9C,IAAA,KAAA,MAAW,EAAE,MAAA,EAAQ,GAAA,EAAI,IAAK,UAAA,EAAY;AACxC,MAAA,MAAM,YAAA,GAAe,oBAAA,CAAqB,GAAA,EAAK,MAAA,CAAO,cAAc,CAAA;AACpE,MAAA,IAAI,iBAAiB,SAAA,EAAW;AAChC,MAAA,MAAM,wBAAA,CAAyB,EAAA,EAAI,MAAA,EAAQ,MAAA,EAAQ,SAAS,CAAA;AAG5D,MAAA,IAAI,cAAc,WAAA,EAAa;AAC7B,QAAA,cAAA,CAAe,GAAA,CAAI,MAAA,CAAO,MAAM,CAAC,CAAA;AAAA,MACnC,CAAA,MAAO;AACL,QAAA,cAAA,CAAe,MAAA,CAAO,MAAA,CAAO,MAAM,CAAC,CAAA;AAAA,MACtC;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,YAAA,EAAc,cAAc,CAAA;AACjE,IAAA,MAAM,QAAA,GAAW,KAAA,CAAM,gBAAA,CAAiB,aAAa,CAAA;AACrD,IAAA,MAAM,uBAAA;AAAA,MACJ,EAAA,CAAG,OAAA;AAAA,MACH,KAAA;AAAA,MACA,EAAA,CAAG,qBAAA;AAAA,MACH,KAAA;AAAA,MACA,QAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,OAAO,WAAA,CAA4C,MAAA,EAAQ,KAAA,EAAO,QAAQ,CAAA;AAAA,EAC5E,CAAC,CAAA;AACH;AAEA,SAAS,qBAGP,UAAA,EAA2E;AAC3E,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAqC;AACvD,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,IAAA,KAAA,CAAM,GAAA,CAAI,MAAA,CAAO,SAAS,CAAA,EAAG,SAAS,CAAA;AAAA,EACxC;AACA,EAAA,OAAO,CAAC,GAAG,KAAA,CAAM,MAAA,EAAQ,CAAA;AAC3B;AAEO,SAAS,0BAAA,CAId,OACA,MAAA,EAMA;AACA,EAAA,MAAM,iBAAkB,KAAA,CACrB,cAAA;AACH,EAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,6EAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAQ;AAAA,MACzB;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,MAAM,UAAA,GAAa,eAAA,CAAgB,KAAA,CAAM,KAAA,EAAO,MAAM,CAAA;AAItD,EAAA,MAAM,UAAA,GAAa,CACjB,OAAA,EACA,SAAA,KAEA,cAKE,KAAA,EAAO,UAAA,EAAY,SAAS,SAAS,CAAA;AAEzC,EAAA,OAAO;AAAA,IACL,SAAS,CAAC,MAAA,KAAW,WAAW,CAAC,MAAM,GAAG,IAAI,CAAA;AAAA,IAC9C,WAAA,EAAa,CAAC,OAAA,KAAY,UAAA,CAAW,SAAS,IAAI,CAAA;AAAA,IAClD,WAAW,CAAC,MAAA,KAAW,WAAW,CAAC,MAAM,GAAG,KAAK,CAAA;AAAA,IACjD,aAAA,EAAe,CAAC,OAAA,KAAY,UAAA,CAAW,SAAS,KAAK,CAAA;AAAA,IAErD,MAAM,OAAA,GAAU;AACd,MAAA,OAAO,KAAA,CAAM,WAAA,CAAY,OAAO,EAAA,KAAO;AAKrC,QAAA,MAAM,sBAAA,CAAuB,EAAA,CAAG,OAAA,EAAS,KAAA,CAAM,OAAO,CAAA;AACtD,QAAA,MAAM,WAAW,MAAM,cAAA;AAAA,UACrB,EAAA,CAAG,OAAA;AAAA,UACH,KAAA,CAAM,OAAA;AAAA,UACN;AAAA,SACF;AACA,QAAA,OAAO,gBAAA;AAAA,UACL,QAAA,CAAS;AAAA,SACX;AAAA,MACF,CAAC,CAAA;AAAA,IACH;AAAA,GACF;AACF","file":"index.js","sourcesContent":["import {\n  type EdgeRow,\n  type GraphReadBackend,\n  isLiveNodeRow,\n  isTombstonedNodeRow,\n  type LiveNodeRow,\n  type NodeRow,\n  type TombstonedNodeRow,\n} from \"../backend/types\";\nimport type { GraphDef } from \"../core/define-graph\";\nimport type { NodeRegistration } from \"../core/types\";\nimport { ConfigurationError, NodeNotFoundError } from \"../errors\";\nimport type {\n  DynamicNodeCollection,\n  HistorySafeTransactionBackend,\n  HistoryStore,\n  HistoryTransactionContext,\n} from \"../store\";\nimport {\n  applyNodeResurrect,\n  applyNodeSoftDelete,\n  createNodeWriteContext,\n} from \"../store/operations/node-write-pipeline\";\nimport { lockRecordedGraphWrite } from \"../store/recorded-capture\";\nimport { type GraphWriteLock } from \"../store/recorded-capture/clock\";\nimport { compareStrings } from \"../utils/compare\";\nimport { nowIso } from \"../utils/date\";\nimport { isPlainObject } from \"../utils/object\";\n\nconst DEFAULT_RETRACTED_FIELD = \"retracted\";\nconst KEY_SEPARATOR = \"\\u0000\";\n\ntype NodeKind<G extends GraphDef> = Extract<keyof G[\"nodes\"], string>;\ntype EdgeKind<G extends GraphDef> = Extract<keyof G[\"edges\"], string>;\n\nexport type ProvenanceNodeRef<\n  G extends GraphDef = GraphDef,\n  K extends NodeKind<G> = NodeKind<G>,\n> = Readonly<{\n  kind: K;\n  id: string;\n}>;\n\nexport type ProvenanceJustificationRef<\n  G extends GraphDef = GraphDef,\n  K extends NodeKind<G> = NodeKind<G>,\n> = ProvenanceNodeRef<G, K>;\nexport type ProvenanceFactRef<\n  G extends GraphDef = GraphDef,\n  K extends NodeKind<G> = NodeKind<G>,\n> = ProvenanceNodeRef<G, K>;\n\ntype ProvenanceSourceConfig<G extends GraphDef = GraphDef> =\n  | Readonly<{\n      kind: NodeKind<G>;\n      retractedField?: string;\n    }>\n  | Readonly<{\n      kinds: readonly NodeKind<G>[];\n      retractedField?: string;\n    }>;\n\nexport type ProvenanceRetractionConfig<G extends GraphDef = GraphDef> =\n  Readonly<{\n    source: ProvenanceSourceConfig<G>;\n    justification: Readonly<{ kind: NodeKind<G> }>;\n    fact: Readonly<{ kinds: readonly NodeKind<G>[] }>;\n    premiseOf: Readonly<{ kind: EdgeKind<G> }>;\n    derives: Readonly<{ kind: EdgeKind<G> }>;\n  }>;\n\n/**\n * Extracts the node kind(s) referenced by a provenance role config, whether\n * declared as a single `{ kind }` or a `{ kinds }` array. Falls back to the\n * full `NodeKind<G>` union when neither shape is present (e.g. a role config\n * that also carries unrelated fields, matched structurally).\n */\ntype KindsFromRef<G extends GraphDef, Ref> =\n  Ref extends Readonly<{ kind: infer K }> ? Extract<K, NodeKind<G>>\n  : Ref extends Readonly<{ kinds: readonly (infer K)[] }> ?\n    Extract<K, NodeKind<G>>\n  : NodeKind<G>;\n\ntype SourceKindsFromConfig<\n  G extends GraphDef,\n  C extends ProvenanceRetractionConfig<G>,\n> = KindsFromRef<G, C[\"source\"]>;\n\ntype FactKindsFromConfig<\n  G extends GraphDef,\n  C extends ProvenanceRetractionConfig<G>,\n> = KindsFromRef<G, C[\"fact\"]>;\n\ntype JustificationKindFromConfig<\n  G extends GraphDef,\n  C extends ProvenanceRetractionConfig<G>,\n> = KindsFromRef<G, C[\"justification\"]>;\n\nexport type SurvivedVia<\n  G extends GraphDef = GraphDef,\n  FactKind extends NodeKind<G> = NodeKind<G>,\n  JustificationKind extends NodeKind<G> = NodeKind<G>,\n> = Readonly<{\n  fact: ProvenanceFactRef<G, FactKind>;\n  via: readonly ProvenanceJustificationRef<G, JustificationKind>[];\n}>;\n\nexport type RetractionReport<\n  G extends GraphDef = GraphDef,\n  FactKind extends NodeKind<G> = NodeKind<G>,\n  JustificationKind extends NodeKind<G> = NodeKind<G>,\n> = Readonly<{\n  died: readonly ProvenanceFactRef<G, FactKind>[];\n  survivedVia: readonly SurvivedVia<G, FactKind, JustificationKind>[];\n  unaffected: readonly ProvenanceFactRef<G, FactKind>[];\n}>;\n\nexport type RetractionCapability<\n  G extends GraphDef = GraphDef,\n  SourceKind extends NodeKind<G> = NodeKind<G>,\n  FactKind extends NodeKind<G> = NodeKind<G>,\n  JustificationKind extends NodeKind<G> = NodeKind<G>,\n> = Readonly<{\n  retract: (\n    source: ProvenanceNodeRef<G, SourceKind>,\n  ) => Promise<RetractionReport<G, FactKind, JustificationKind>>;\n  retractMany: (\n    sources: readonly ProvenanceNodeRef<G, SourceKind>[],\n  ) => Promise<RetractionReport<G, FactKind, JustificationKind>>;\n  unRetract: (\n    source: ProvenanceNodeRef<G, SourceKind>,\n  ) => Promise<RetractionReport<G, FactKind, JustificationKind>>;\n  unRetractMany: (\n    sources: readonly ProvenanceNodeRef<G, SourceKind>[],\n  ) => Promise<RetractionReport<G, FactKind, JustificationKind>>;\n  holding: () => Promise<readonly ProvenanceFactRef<G, FactKind>[]>;\n}>;\n\ntype NormalizedConfig = Readonly<{\n  sourceKinds: readonly string[];\n  retractedField: string;\n  justificationKind: string;\n  factKinds: readonly string[];\n  premiseOfKind: string;\n  derivesKind: string;\n}>;\n\ntype ProvenanceRows = Readonly<{\n  justifications: ReadonlyMap<string, NodeRow>;\n  facts: ReadonlyMap<string, NodeRow>;\n  premiseEdges: readonly EdgeRow[];\n  deriveEdges: readonly EdgeRow[];\n}>;\n\ntype SupportEdges = Readonly<{\n  premisesByJustification: ReadonlyMap<string, readonly string[]>;\n  factsByJustification: ReadonlyMap<string, readonly string[]>;\n  justificationsByPremise: ReadonlyMap<string, readonly string[]>;\n}>;\n\ntype SupportSnapshot = Readonly<{\n  facts: ReadonlyMap<string, NodeRow>;\n  supportedFactKeys: ReadonlySet<string>;\n  believedFactKeys: ReadonlySet<string>;\n  firingJustificationKeysByFact: ReadonlyMap<string, readonly string[]>;\n  affectedFactKeys: (\n    sources: readonly ProvenanceNodeRef[],\n  ) => ReadonlySet<string>;\n}>;\n\ntype SourceRetractedState = \"retracted\" | \"available\";\n\ntype SourceRow<G extends GraphDef> = Readonly<{\n  source: ProvenanceNodeRef<G>;\n  row: NodeRow;\n}>;\n\nfunction refKey(ref: ProvenanceNodeRef): string {\n  return `${ref.kind}${KEY_SEPARATOR}${ref.id}`;\n}\n\nfunction rowKey(row: Pick<NodeRow, \"kind\" | \"id\">): string {\n  return refKey({ kind: row.kind, id: row.id });\n}\n\nfunction edgeFromKey(edge: EdgeRow): string {\n  return refKey({ kind: edge.from_kind, id: edge.from_id });\n}\n\nfunction edgeToKey(edge: EdgeRow): string {\n  return refKey({ kind: edge.to_kind, id: edge.to_id });\n}\n\nfunction keyToRef<\n  G extends GraphDef = GraphDef,\n  K extends NodeKind<G> = NodeKind<G>,\n>(key: string): ProvenanceNodeRef<G, K> {\n  const separatorIndex = key.indexOf(KEY_SEPARATOR);\n  if (separatorIndex === -1) {\n    throw new ConfigurationError(\n      \"Invalid provenance identity key.\",\n      { key },\n      {\n        suggestion:\n          \"Report this TypeGraph provenance bug with the graph roles that produced the key.\",\n      },\n    );\n  }\n  const kind = key.slice(0, separatorIndex);\n  const id = key.slice(separatorIndex + KEY_SEPARATOR.length);\n  return { kind, id } as ProvenanceNodeRef<G, K>;\n}\n\nfunction sortedReferences<\n  G extends GraphDef = GraphDef,\n  K extends NodeKind<G> = NodeKind<G>,\n>(keys: Iterable<string>): ProvenanceNodeRef<G, K>[] {\n  return [...keys]\n    .toSorted((left, right) => compareStrings(left, right))\n    .map((key) => keyToRef<G, K>(key));\n}\n\nfunction parseNodeProps(row: NodeRow): Record<string, unknown> {\n  const parsed = JSON.parse(row.props) as unknown;\n  if (!isPlainObject(parsed)) {\n    throw new ConfigurationError(\n      `Node ${row.kind}/${row.id} props are not an object.`,\n      { kind: row.kind, id: row.id },\n    );\n  }\n  return parsed;\n}\n\nfunction sourceRetractedState(\n  row: NodeRow,\n  retractedField: string,\n): SourceRetractedState {\n  const props = parseNodeProps(row);\n  const value = props[retractedField];\n  if (value === undefined) return \"available\";\n  if (typeof value !== \"boolean\") {\n    throw new ConfigurationError(\n      `Provenance source field \"${retractedField}\" must contain a boolean value.`,\n      { kind: row.kind, id: row.id, field: retractedField },\n      {\n        suggestion:\n          \"Use a source node schema with a boolean retracted flag, for example z.boolean().default(false).\",\n      },\n    );\n  }\n  return value ? \"retracted\" : \"available\";\n}\n\nfunction normalizeConfig<G extends GraphDef>(\n  graph: G,\n  config: ProvenanceRetractionConfig<G>,\n): NormalizedConfig {\n  const sourceKinds = sourceKindsFromConfig(config.source);\n  const justificationKind = config.justification.kind;\n  const factKinds = [...config.fact.kinds];\n  const premiseOfKind = config.premiseOf.kind;\n  const derivesKind = config.derives.kind;\n  const retractedField =\n    config.source.retractedField ?? DEFAULT_RETRACTED_FIELD;\n\n  if (sourceKinds.length === 0) {\n    throw new ConfigurationError(\n      \"Provenance retraction requires at least one source kind.\",\n      { role: \"source\" },\n    );\n  }\n\n  if (factKinds.length === 0) {\n    throw new ConfigurationError(\n      \"Provenance retraction requires at least one fact kind.\",\n      { role: \"fact\" },\n    );\n  }\n\n  const duplicateSourceKinds = duplicateValues(sourceKinds);\n  if (duplicateSourceKinds.length > 0) {\n    throw new ConfigurationError(\"Provenance source kinds must be unique.\", {\n      duplicateSourceKinds,\n    });\n  }\n\n  const duplicateFactKinds = duplicateValues(factKinds);\n  if (duplicateFactKinds.length > 0) {\n    throw new ConfigurationError(\"Provenance fact kinds must be unique.\", {\n      duplicateFactKinds,\n    });\n  }\n\n  for (const kind of sourceKinds) {\n    assertKind(graph.nodes, kind, \"source\", \"node\", graph.id);\n  }\n  assertKind(graph.nodes, justificationKind, \"justification\", \"node\", graph.id);\n  for (const kind of factKinds) {\n    assertKind(graph.nodes, kind, \"fact\", \"node\", graph.id);\n  }\n  for (const kind of sourceKinds)\n    assertSourceField(graph, kind, retractedField);\n  assertKind(graph.edges, premiseOfKind, \"premiseOf\", \"edge\", graph.id);\n  assertKind(graph.edges, derivesKind, \"derives\", \"edge\", graph.id);\n\n  if (\n    factKinds.some(\n      (kind) => sourceKinds.includes(kind) || kind === justificationKind,\n    )\n  ) {\n    throw new ConfigurationError(\n      \"Provenance fact kinds must be distinct from source and justification kinds.\",\n      { sourceKinds, justificationKind, factKinds },\n    );\n  }\n\n  assertEdgeEndpoints(graph, premiseOfKind, {\n    role: \"premiseOf\",\n    fromKinds: sourceKinds,\n    toKinds: [justificationKind],\n  });\n  assertEdgeEndpoints(graph, derivesKind, {\n    role: \"derives\",\n    fromKinds: [justificationKind],\n    toKinds: factKinds,\n  });\n\n  return {\n    sourceKinds,\n    retractedField,\n    justificationKind,\n    factKinds,\n    premiseOfKind,\n    derivesKind,\n  };\n}\n\nfunction sourceKindsFromConfig<G extends GraphDef>(\n  source: ProvenanceSourceConfig<G>,\n): string[] {\n  if (\"kinds\" in source) return [...source.kinds];\n  return [source.kind];\n}\n\nfunction duplicateValues(values: readonly string[]): string[] {\n  const seen = new Set<string>();\n  const duplicates = new Set<string>();\n  for (const value of values) {\n    if (seen.has(value)) {\n      duplicates.add(value);\n      continue;\n    }\n    seen.add(value);\n  }\n  return [...duplicates].toSorted((left, right) => compareStrings(left, right));\n}\n\nfunction assertKind(\n  records: Readonly<Record<string, unknown>>,\n  kind: string,\n  role: string,\n  noun: \"node\" | \"edge\",\n  graphId: string,\n): void {\n  if (Object.hasOwn(records, kind)) return;\n  throw new ConfigurationError(\n    `Provenance ${role} kind \"${kind}\" is not a ${noun} kind in this graph.`,\n    { role, kind, graphId },\n  );\n}\n\nfunction assertSourceField<G extends GraphDef>(\n  graph: G,\n  sourceKind: string,\n  retractedField: string,\n): void {\n  const registration = graph.nodes[sourceKind];\n  if (registration === undefined) return;\n  if (Object.hasOwn(registration.type.schema.shape, retractedField)) return;\n  throw new ConfigurationError(\n    `Provenance source kind \"${sourceKind}\" must include field \"${retractedField}\".`,\n    { sourceKind, retractedField },\n    {\n      suggestion:\n        \"Add a boolean retracted flag to the source node schema or pass source.retractedField.\",\n    },\n  );\n}\n\nfunction assertEdgeEndpoints<G extends GraphDef>(\n  graph: G,\n  edgeKind: string,\n  expected: Readonly<{\n    role: string;\n    fromKinds: readonly string[];\n    toKinds: readonly string[];\n  }>,\n): void {\n  const registration = graph.edges[edgeKind];\n  if (registration === undefined) return;\n  const fromKinds = new Set(registration.from.map((node) => node.kind));\n  const toKinds = new Set(registration.to.map((node) => node.kind));\n  for (const kind of expected.fromKinds) {\n    if (fromKinds.has(kind)) continue;\n    throw new ConfigurationError(\n      `Provenance ${expected.role} edge \"${edgeKind}\" cannot start at \"${kind}\".`,\n      { edgeKind, role: expected.role, expectedFrom: kind },\n    );\n  }\n  for (const kind of expected.toKinds) {\n    if (toKinds.has(kind)) continue;\n    throw new ConfigurationError(\n      `Provenance ${expected.role} edge \"${edgeKind}\" cannot end at \"${kind}\".`,\n      { edgeKind, role: expected.role, expectedTo: kind },\n    );\n  }\n}\n\n/**\n * Whether a row's validity window contains `asOf`. The JS mirror of the SQL\n * `\"current\"`-mode predicate, for role reads that must include tombstoned\n * rows (which `\"current\"` cannot express) yet still respect validity.\n * Canonical fixed-width UTC ISO strings compare correctly as text.\n */\nfunction isValidAt(\n  row: Pick<NodeRow, \"valid_from\" | \"valid_to\">,\n  asOf: string,\n): boolean {\n  return (\n    (row.valid_from === undefined || row.valid_from <= asOf) &&\n    (row.valid_to === undefined || row.valid_to > asOf)\n  );\n}\n\n/**\n * Provenance reads follow the store's currency semantics: a source,\n * justification, or support edge counts only while currently valid (the\n * default `\"current\"` read mode), so a validity-expired source no longer\n * supports anything and `holding()` agrees with the collection API about\n * which facts are currently believed. Fact rows additionally need their\n * tombstones — a reopen candidate is by definition soft-deleted — so they\n * are loaded with tombstones and filtered to the same validity instant.\n */\nasync function findNodeRows(\n  backend: GraphReadBackend,\n  graphId: string,\n  kind: string,\n  options: Readonly<{ includeTombstones: boolean; asOf: string }>,\n): Promise<readonly NodeRow[]> {\n  if (options.includeTombstones) {\n    const rows = await backend.findNodesByKind({\n      graphId,\n      kind,\n      excludeDeleted: false,\n      temporalMode: \"includeTombstones\",\n      orderBy: \"id\",\n    });\n    return rows.filter((row) => isValidAt(row, options.asOf));\n  }\n  return backend.findNodesByKind({\n    graphId,\n    kind,\n    excludeDeleted: true,\n    temporalMode: \"current\",\n    asOf: options.asOf,\n    orderBy: \"id\",\n  });\n}\n\nasync function findEdgeRows(\n  backend: GraphReadBackend,\n  graphId: string,\n  kind: string,\n  asOf: string,\n): Promise<readonly EdgeRow[]> {\n  return backend.findEdgesByKind({\n    graphId,\n    kind,\n    excludeDeleted: true,\n    temporalMode: \"current\",\n    asOf,\n    orderBy: \"id\",\n  });\n}\n\nasync function readRoles(\n  backend: GraphReadBackend,\n  graphId: string,\n  config: NormalizedConfig,\n  asOf: string,\n): Promise<ProvenanceRows> {\n  const [justificationRows, factRowsByKind, premiseEdges, deriveEdges] =\n    await Promise.all([\n      findNodeRows(backend, graphId, config.justificationKind, {\n        includeTombstones: false,\n        asOf,\n      }),\n      Promise.all(\n        config.factKinds.map((kind) =>\n          findNodeRows(backend, graphId, kind, {\n            includeTombstones: true,\n            asOf,\n          }),\n        ),\n      ),\n      findEdgeRows(backend, graphId, config.premiseOfKind, asOf),\n      findEdgeRows(backend, graphId, config.derivesKind, asOf),\n    ]);\n  const factRows = factRowsByKind.flat();\n\n  return {\n    justifications: rowsByKey(justificationRows),\n    facts: rowsByKey(factRows),\n    premiseEdges,\n    deriveEdges,\n  };\n}\n\nfunction rowsByKey(rows: readonly NodeRow[]): ReadonlyMap<string, NodeRow> {\n  const byKey = new Map<string, NodeRow>();\n  for (const row of rows) byKey.set(rowKey(row), row);\n  return byKey;\n}\n\nfunction appendGroupedValue(\n  groups: Map<string, string[]>,\n  key: string,\n  value: string,\n): void {\n  const group = groups.get(key);\n  if (group === undefined) {\n    groups.set(key, [value]);\n    return;\n  }\n  if (group.includes(value)) return;\n  group.push(value);\n}\n\nfunction buildSupportEdges(\n  config: NormalizedConfig,\n  rows: ProvenanceRows,\n): SupportEdges {\n  const premisesByJustification = new Map<string, string[]>();\n  const factsByJustification = new Map<string, string[]>();\n  const justificationsByPremise = new Map<string, string[]>();\n\n  for (const edge of rows.premiseEdges) {\n    if (edge.to_kind !== config.justificationKind) continue;\n    if (!isPremiseKind(config, edge.from_kind)) continue;\n\n    const premiseKey = edgeFromKey(edge);\n    const justificationKey = edgeToKey(edge);\n    appendGroupedValue(premisesByJustification, justificationKey, premiseKey);\n    appendGroupedValue(justificationsByPremise, premiseKey, justificationKey);\n  }\n\n  for (const edge of rows.deriveEdges) {\n    if (edge.from_kind !== config.justificationKind) continue;\n    if (!config.factKinds.includes(edge.to_kind)) continue;\n    appendGroupedValue(\n      factsByJustification,\n      edgeFromKey(edge),\n      edgeToKey(edge),\n    );\n  }\n\n  return {\n    premisesByJustification,\n    factsByJustification,\n    justificationsByPremise,\n  };\n}\n\n/**\n * The whole-graph read a support computation needs: the role rows, the support\n * edges derived from them, and the (non-retracted-visible) source rows. Loaded\n * once per transition so `before` and `after` snapshots share one read instead\n * of scanning the entire provenance graph twice — the graph structure is\n * identical across a transition, only source availability changes.\n */\ntype SupportGraph = Readonly<{\n  roles: ProvenanceRows;\n  supportEdges: SupportEdges;\n  sourceRows: readonly NodeRow[];\n}>;\n\nasync function loadSupportGraph(\n  backend: GraphReadBackend,\n  graphId: string,\n  config: NormalizedConfig,\n): Promise<SupportGraph> {\n  // One read instant for every role read, so the whole snapshot shares a\n  // single \"currently valid\" coordinate.\n  const asOf = nowIso();\n  const roles = await readRoles(backend, graphId, config, asOf);\n  const supportEdges = buildSupportEdges(config, roles);\n  const sourceRowsByKind = await Promise.all(\n    config.sourceKinds.map((kind) =>\n      findNodeRows(backend, graphId, kind, { includeTombstones: false, asOf }),\n    ),\n  );\n  return { roles, supportEdges, sourceRows: sourceRowsByKind.flat() };\n}\n\nfunction availableSourceKeys(\n  sourceRows: readonly NodeRow[],\n  retractedField: string,\n): Set<string> {\n  const available = new Set<string>();\n  for (const row of sourceRows) {\n    if (sourceRetractedState(row, retractedField) === \"available\") {\n      available.add(rowKey(row));\n    }\n  }\n  return available;\n}\n\n/**\n * The pure TMS fixpoint: given the loaded graph and the set of available\n * (non-retracted) source keys, derive which facts are supported and believed.\n * No I/O — the same {@link SupportGraph} feeds both the pre- and post-transition\n * snapshots with different availability sets.\n */\nfunction computeSupportSnapshot(\n  graph: Pick<SupportGraph, \"roles\" | \"supportEdges\">,\n  available: ReadonlySet<string>,\n): SupportSnapshot {\n  const { roles, supportEdges } = graph;\n  const supported = new Set<string>();\n  const inSet = new Set<string>(available);\n  const firingJustifications = new Set<string>();\n  const firingJustificationKeysByFact = new Map<string, string[]>();\n\n  let changed = true;\n  while (changed) {\n    changed = false;\n    for (const [justificationKey] of roles.justifications) {\n      if (firingJustifications.has(justificationKey)) continue;\n      const premises =\n        supportEdges.premisesByJustification.get(justificationKey) ?? [];\n      if (!allPremisesSupported(premises, inSet)) continue;\n\n      firingJustifications.add(justificationKey);\n      const derivedFacts =\n        supportEdges.factsByJustification.get(justificationKey) ?? [];\n      for (const factKey of derivedFacts) {\n        if (!roles.facts.has(factKey)) continue;\n        appendGroupedValue(\n          firingJustificationKeysByFact,\n          factKey,\n          justificationKey,\n        );\n        if (supported.has(factKey)) continue;\n        supported.add(factKey);\n        inSet.add(factKey);\n        changed = true;\n      }\n    }\n  }\n\n  const believed = new Set<string>();\n  for (const key of supported) {\n    const row = roles.facts.get(key);\n    if (row !== undefined && row.deleted_at === undefined) believed.add(key);\n  }\n\n  return {\n    facts: roles.facts,\n    supportedFactKeys: supported,\n    believedFactKeys: believed,\n    firingJustificationKeysByFact,\n    affectedFactKeys(\n      targets: readonly ProvenanceNodeRef[],\n    ): ReadonlySet<string> {\n      return computeAffectedFactKeys(targets, roles, supportEdges);\n    },\n  };\n}\n\nasync function computeSupport(\n  backend: GraphReadBackend,\n  graphId: string,\n  config: NormalizedConfig,\n): Promise<SupportSnapshot> {\n  const graph = await loadSupportGraph(backend, graphId, config);\n  return computeSupportSnapshot(\n    graph,\n    availableSourceKeys(graph.sourceRows, config.retractedField),\n  );\n}\n\nfunction isPremiseKind(config: NormalizedConfig, kind: string): boolean {\n  return config.sourceKinds.includes(kind) || config.factKinds.includes(kind);\n}\n\nfunction allPremisesSupported(\n  premises: readonly string[],\n  supported: ReadonlySet<string>,\n): boolean {\n  for (const premise of premises) {\n    if (!supported.has(premise)) return false;\n  }\n  return true;\n}\n\nfunction computeAffectedFactKeys(\n  sources: readonly ProvenanceNodeRef[],\n  roles: ProvenanceRows,\n  supportEdges: SupportEdges,\n): ReadonlySet<string> {\n  const affected = new Set<string>();\n  // Seed the BFS with every source at once: the union of facts reachable from\n  // any source falls out of one traversal, instead of one BFS per source.\n  const frontier = sources.map((source) => refKey(source));\n  const seen = new Set<string>(frontier);\n\n  while (frontier.length > 0) {\n    const current = frontier.shift();\n    if (current === undefined) continue;\n\n    const justifications =\n      supportEdges.justificationsByPremise.get(current) ?? [];\n    for (const justificationKey of justifications) {\n      const derivedFacts =\n        supportEdges.factsByJustification.get(justificationKey) ?? [];\n      for (const factKey of derivedFacts) {\n        if (!roles.facts.has(factKey)) continue;\n        affected.add(factKey);\n        if (seen.has(factKey)) continue;\n        seen.add(factKey);\n        frontier.push(factKey);\n      }\n    }\n  }\n\n  return affected;\n}\n\nfunction buildReport<\n  G extends GraphDef,\n  FactKind extends NodeKind<G>,\n  JustificationKind extends NodeKind<G>,\n>(\n  before: SupportSnapshot,\n  after: SupportSnapshot,\n  affected: ReadonlySet<string>,\n): RetractionReport<G, FactKind, JustificationKind> {\n  const believedBefore = [...before.believedFactKeys];\n  const died = sortedReferences<G, FactKind>(\n    believedBefore.filter((key) => !after.supportedFactKeys.has(key)),\n  );\n  const unaffected = sortedReferences<G, FactKind>(\n    believedBefore.filter((key) => !affected.has(key)),\n  );\n  const survivedVia = [...affected]\n    .filter((key) => after.supportedFactKeys.has(key))\n    .toSorted((left, right) => compareStrings(left, right))\n    .map((key) => ({\n      fact: keyToRef<G, FactKind>(key),\n      via: sortedReferences<G, JustificationKind>(\n        after.firingJustificationKeysByFact.get(key) ?? [],\n      ),\n    }));\n  return { died, survivedVia, unaffected };\n}\n\n/**\n * Brings fact currency in line with the post-transition support snapshot —\n * but only for the facts the transition could have affected (those reachable\n * from the flipped sources through justification edges). Facts outside that\n * set are never touched: an unsupported live fact elsewhere in the graph\n * (e.g. one whose justification edges have not been linked yet) is not this\n * transition's business, and silently tombstoning it would be invisible data\n * loss the report cannot even mention.\n *\n * Closes run before reopens: a reopen re-checks uniqueness, and the unique\n * key it needs may still be held by a fact this same transition is about to\n * close — closing first makes a legal transition order-independent.\n */\n/**\n * Runs `action` over every fact row in `snapshot` that is both affected by the\n * transition and matches `isTargetKey`/`isTargetRow`, concurrently — the\n * matched rows are independent facts, so there is no ordering dependency\n * within a single pass (only between the close pass and the reopen pass,\n * which the caller sequences).\n */\nasync function forEachAffectedFact<T extends NodeRow>(\n  snapshot: SupportSnapshot,\n  affected: ReadonlySet<string>,\n  isTargetKey: (key: string) => boolean,\n  isTargetRow: (row: NodeRow) => row is T,\n  action: (row: T) => Promise<void>,\n): Promise<void> {\n  const rows: T[] = [];\n  for (const [key, row] of snapshot.facts) {\n    if (!affected.has(key)) continue;\n    if (!isTargetKey(key)) continue;\n    if (!isTargetRow(row)) continue;\n    rows.push(row);\n  }\n  await Promise.all(rows.map((row) => action(row)));\n}\n\n/**\n * The transaction-scoped hook lifecycle fact close/reopen runs through —\n * `HistoryTransactionContext[\"runNodeOperationHooks\"]`. Using the\n * transaction's runner (not the store's) defers each fact's success hook\n * until the transition's COMMIT, so hooks never report a closed or reopened\n * fact that a failed commit then rolls back.\n */\ntype RunNodeOperationHooks = <T>(\n  operation: \"create\" | \"update\" | \"delete\",\n  kind: string,\n  id: string,\n  fn: () => Promise<T>,\n) => Promise<T>;\n\nasync function synchronizeFactCurrency<G extends GraphDef>(\n  backend: HistorySafeTransactionBackend,\n  store: HistoryStore<G>,\n  runHooks: RunNodeOperationHooks,\n  snapshot: SupportSnapshot,\n  affected: ReadonlySet<string>,\n  lock: GraphWriteLock,\n): Promise<void> {\n  await forEachAffectedFact(\n    snapshot,\n    affected,\n    (key) => !snapshot.supportedFactKeys.has(key),\n    isLiveNodeRow,\n    (row) => closeFactCurrency(backend, store, runHooks, row, lock),\n  );\n  await forEachAffectedFact(\n    snapshot,\n    affected,\n    (key) => snapshot.supportedFactKeys.has(key),\n    isTombstonedNodeRow,\n    (row) => reopenFactCurrency(backend, store, runHooks, row, lock),\n  );\n}\n\nfunction getFactRegistration<G extends GraphDef>(\n  store: HistoryStore<G>,\n  row: NodeRow,\n): NodeRegistration {\n  const registration = store.graph.nodes[row.kind];\n  if (registration !== undefined) return registration;\n  throw new ConfigurationError(\n    `Provenance fact kind \"${row.kind}\" is not a node kind in this graph.`,\n    { kind: row.kind, graphId: store.graphId },\n  );\n}\n\nasync function closeFactCurrency<G extends GraphDef>(\n  backend: HistorySafeTransactionBackend,\n  store: HistoryStore<G>,\n  runHooks: RunNodeOperationHooks,\n  row: LiveNodeRow,\n  lock: GraphWriteLock,\n): Promise<void> {\n  await runHooks(\"delete\", row.kind, row.id, async () => {\n    const registration = getFactRegistration(store, row);\n    // The canonical soft-delete steps (tombstone, uniqueness/embedding/\n    // fulltext cleanup) WITHOUT delete-behavior enforcement: closing a\n    // fact's currency is a belief-status change, not a domain delete, so\n    // its connected edges neither block the close (`restrict`) nor get\n    // removed (`cascade` / `disconnect`). Every edge survives untouched,\n    // making a later reopen an exact inverse of this close.\n    await applyNodeSoftDelete(\n      createNodeWriteContext(store.graphId, store.registry, lock),\n      {\n        existing: row,\n        schema: registration.type.schema,\n        uniqueConstraints: registration.unique ?? [],\n        onDelete: registration.onDelete,\n      },\n      backend,\n      { enforceDeleteBehavior: false },\n    );\n  });\n}\n\nasync function reopenFactCurrency<G extends GraphDef>(\n  backend: HistorySafeTransactionBackend,\n  store: HistoryStore<G>,\n  runHooks: RunNodeOperationHooks,\n  row: TombstonedNodeRow,\n  lock: GraphWriteLock,\n): Promise<void> {\n  await runHooks(\"update\", row.kind, row.id, async () => {\n    const registration = getFactRegistration(store, row);\n    // The delete removed this fact's uniqueness entries, so reopen re-checks and\n    // re-inserts them (rather than the diff-based update path) before clearing\n    // the tombstone and re-syncing embeddings/fulltext.\n    await applyNodeResurrect(\n      createNodeWriteContext(store.graphId, store.registry, lock),\n      {\n        existing: row,\n        schema: registration.type.schema,\n        uniqueConstraints: registration.unique ?? [],\n      },\n      backend,\n    );\n  });\n}\n\nfunction getTransactionNodeCollection<G extends GraphDef>(\n  tx: HistoryTransactionContext<G>,\n  kind: string,\n): DynamicNodeCollection {\n  const collection = tx.getNodeCollection(kind);\n  if (collection !== undefined) return collection;\n  throw new ConfigurationError(\n    `Provenance source kind \"${kind}\" is not available on this transaction.`,\n    { kind },\n  );\n}\n\nasync function setSourceRetractionState<G extends GraphDef>(\n  tx: HistoryTransactionContext<G>,\n  config: NormalizedConfig,\n  source: ProvenanceNodeRef,\n  retracted: boolean,\n): Promise<void> {\n  const collection = getTransactionNodeCollection(tx, source.kind);\n  await collection.update(source.id, { [config.retractedField]: retracted });\n}\n\nasync function runTransition<\n  G extends GraphDef,\n  SourceKind extends NodeKind<G>,\n  FactKind extends NodeKind<G>,\n  JustificationKind extends NodeKind<G>,\n>(\n  store: HistoryStore<G>,\n  config: NormalizedConfig,\n  sources: readonly ProvenanceNodeRef<G, SourceKind>[],\n  retracted: boolean,\n): Promise<RetractionReport<G, FactKind, JustificationKind>> {\n  const uniqueSources = uniqueNodeReferences(sources);\n  for (const source of uniqueSources) {\n    if (config.sourceKinds.includes(source.kind)) continue;\n    throw new ConfigurationError(\n      `Provenance retraction source must be one of: ${config.sourceKinds.join(\", \")}.`,\n      { expectedKinds: config.sourceKinds, actualKind: source.kind },\n    );\n  }\n\n  return store.transaction(async (tx) => {\n    // Serialize the whole read-compute-write transition per graph BEFORE the\n    // first read. `store.transaction` itself takes no lock (write operations\n    // acquire it at their own boundaries), but a transition's support\n    // snapshot must not race a concurrent transition or history write, so\n    // the per-graph write lock is acquired explicitly up front. The token is\n    // the evidence the currency-sync pipeline steps require.\n    const lock = await lockRecordedGraphWrite(tx.backend, store.graphId);\n    const rows = await Promise.all(\n      uniqueSources.map((source) =>\n        tx.backend.getNode(store.graphId, source.kind, source.id),\n      ),\n    );\n    const sourceRows = uniqueSources.map((source, index): SourceRow<G> => {\n      const sourceRow = rows[index];\n      if (sourceRow === undefined || sourceRow.deleted_at !== undefined) {\n        throw new NodeNotFoundError(source.kind, source.id);\n      }\n      return { source, row: sourceRow };\n    });\n\n    // Load the provenance graph once. Its structure (justifications, facts,\n    // premise/derive edges) is identical before and after the transition — only\n    // source availability changes — so the pre- and post-flip snapshots share\n    // this read instead of scanning the whole graph twice per retraction.\n    const supportGraph = await loadSupportGraph(\n      tx.backend,\n      store.graphId,\n      config,\n    );\n    const availableBefore = availableSourceKeys(\n      supportGraph.sourceRows,\n      config.retractedField,\n    );\n    const before = computeSupportSnapshot(supportGraph, availableBefore);\n\n    const nextState: SourceRetractedState =\n      retracted ? \"retracted\" : \"available\";\n    const availableAfter = new Set(availableBefore);\n    for (const { source, row } of sourceRows) {\n      const currentState = sourceRetractedState(row, config.retractedField);\n      if (currentState === nextState) continue;\n      await setSourceRetractionState(tx, config, source, retracted);\n      // Mirror the flip in the in-memory availability so `after` matches the\n      // source rows now persisted, without re-reading the whole graph.\n      if (nextState === \"available\") {\n        availableAfter.add(refKey(source));\n      } else {\n        availableAfter.delete(refKey(source));\n      }\n    }\n    const after = computeSupportSnapshot(supportGraph, availableAfter);\n    const affected = after.affectedFactKeys(uniqueSources);\n    await synchronizeFactCurrency(\n      tx.backend,\n      store,\n      tx.runNodeOperationHooks,\n      after,\n      affected,\n      lock,\n    );\n    return buildReport<G, FactKind, JustificationKind>(before, after, affected);\n  });\n}\n\nfunction uniqueNodeReferences<\n  G extends GraphDef,\n  K extends NodeKind<G> = NodeKind<G>,\n>(references: readonly ProvenanceNodeRef<G, K>[]): ProvenanceNodeRef<G, K>[] {\n  const byKey = new Map<string, ProvenanceNodeRef<G, K>>();\n  for (const reference of references) {\n    byKey.set(refKey(reference), reference);\n  }\n  return [...byKey.values()];\n}\n\nexport function createRetractionCapability<\n  G extends GraphDef,\n  const C extends ProvenanceRetractionConfig<G>,\n>(\n  store: HistoryStore<G>,\n  config: C,\n): RetractionCapability<\n  G,\n  SourceKindsFromConfig<G, C>,\n  FactKindsFromConfig<G, C>,\n  JustificationKindFromConfig<G, C>\n> {\n  const historyEnabled = (store as Readonly<{ historyEnabled: boolean }>)\n    .historyEnabled;\n  if (!historyEnabled) {\n    throw new ConfigurationError(\n      \"createRetractionCapability requires a store created with { history: true }.\",\n      { graphId: store.graphId },\n      {\n        suggestion:\n          \"Use createStoreWithSchema(graph, backend, { history: true }) so retraction mutations are captured and queryable with asOfRecorded().\",\n      },\n    );\n  }\n  const normalized = normalizeConfig(store.graph, config);\n\n  // The four retract verbs differ only in one/many source shape and the target\n  // retracted flag; the generics are fixed by the config, so hoist one call.\n  const transition = (\n    sources: readonly ProvenanceNodeRef<G, SourceKindsFromConfig<G, C>>[],\n    retracted: boolean,\n  ) =>\n    runTransition<\n      G,\n      SourceKindsFromConfig<G, C>,\n      FactKindsFromConfig<G, C>,\n      JustificationKindFromConfig<G, C>\n    >(store, normalized, sources, retracted);\n\n  return {\n    retract: (source) => transition([source], true),\n    retractMany: (sources) => transition(sources, true),\n    unRetract: (source) => transition([source], false),\n    unRetractMany: (sources) => transition(sources, false),\n\n    async holding() {\n      return store.transaction(async (tx) => {\n        // Same explicit lock as runTransition: the support computation reads\n        // several relations, and PostgreSQL's READ COMMITTED gives each\n        // statement its own snapshot — without the lock a concurrent\n        // transition could commit between those reads and tear the view.\n        await lockRecordedGraphWrite(tx.backend, store.graphId);\n        const snapshot = await computeSupport(\n          tx.backend,\n          store.graphId,\n          normalized,\n        );\n        return sortedReferences<G, FactKindsFromConfig<G, C>>(\n          snapshot.believedFactKeys,\n        );\n      });\n    },\n  };\n}\n"]}

package/dist/schema/index.cjs

@@ -1,14 +1,18 @@
 'use strict';
 
-var chunkNG5N7R45_cjs = require('../chunk-NG5N7R45.cjs');
-require('../chunk-MBLXCV2Y.cjs');
-require('../chunk-3IR2GEMJ.cjs');
-require('../chunk-EF3Z645U.cjs');
-require('../chunk-ZFWNO3GE.cjs');
-require('../chunk-KTIEB7VH.cjs');
-require('../chunk-OIE2UPVG.cjs');
-require('../chunk-73KASJGO.cjs');
+var chunk6HVOHZHS_cjs = require('../chunk-6HVOHZHS.cjs');
+require('../chunk-ACSVZPK7.cjs');
+require('../chunk-T6SPUYLX.cjs');
+require('../chunk-RRKQAKD6.cjs');
+require('../chunk-ZY4GXIVN.cjs');
+require('../chunk-WL2SG7ZV.cjs');
+require('../chunk-HK5SATYM.cjs');
+require('../chunk-YC6PWTHY.cjs');
+require('../chunk-RHZWOJVA.cjs');
+require('../chunk-NAUA4PW5.cjs');
+require('../chunk-JQGIPGVL.cjs');
 require('../chunk-3E7SNSIA.cjs');
+require('../chunk-DI74SMXS.cjs');
 require('../chunk-JIEJCTDS.cjs');
 require('../chunk-FLRCVI2G.cjs');
 
@@ -50,7 +54,7 @@ function buildRegistryFromClosures(schema) {
   const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);
   const nodeKinds = /* @__PURE__ */ new Map();
   const edgeKinds = /* @__PURE__ */ new Map();
-  return new chunkNG5N7R45_cjs.KindRegistry(nodeKinds, edgeKinds, {
+  return new chunk6HVOHZHS_cjs.KindRegistry(nodeKinds, edgeKinds, {
     subClassAncestors,
     subClassDescendants,
     broaderClosure,
@@ -78,95 +82,95 @@ function simpleRecordToMap(record) {
 
 Object.defineProperty(exports, "applyDeprecatedKinds", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.applyDeprecatedKinds; }
+  get: function () { return chunk6HVOHZHS_cjs.applyDeprecatedKinds; }
 });
 Object.defineProperty(exports, "assertSchemaCurrent", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.assertSchemaCurrent; }
+  get: function () { return chunk6HVOHZHS_cjs.assertSchemaCurrent; }
 });
 Object.defineProperty(exports, "computeSchemaDiff", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.computeSchemaDiff; }
+  get: function () { return chunk6HVOHZHS_cjs.computeSchemaDiff; }
 });
 Object.defineProperty(exports, "computeSchemaHash", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.computeSchemaHash; }
+  get: function () { return chunk6HVOHZHS_cjs.computeSchemaHash; }
 });
 Object.defineProperty(exports, "createValidationError", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.createValidationError; }
+  get: function () { return chunk6HVOHZHS_cjs.createValidationError; }
 });
 Object.defineProperty(exports, "deserializeWherePredicate", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.deserializeWherePredicate; }
+  get: function () { return chunk6HVOHZHS_cjs.deserializeWherePredicate; }
 });
 Object.defineProperty(exports, "ensureSchema", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.ensureSchema; }
+  get: function () { return chunk6HVOHZHS_cjs.ensureSchema; }
 });
 Object.defineProperty(exports, "getActiveSchema", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.getActiveSchema; }
+  get: function () { return chunk6HVOHZHS_cjs.getActiveSchema; }
 });
 Object.defineProperty(exports, "getMigrationActions", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.getMigrationActions; }
+  get: function () { return chunk6HVOHZHS_cjs.getMigrationActions; }
 });
 Object.defineProperty(exports, "getSchemaChanges", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.getSchemaChanges; }
+  get: function () { return chunk6HVOHZHS_cjs.getSchemaChanges; }
 });
 Object.defineProperty(exports, "initializeSchema", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.initializeSchema; }
+  get: function () { return chunk6HVOHZHS_cjs.initializeSchema; }
 });
 Object.defineProperty(exports, "isBackwardsCompatible", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.isBackwardsCompatible; }
+  get: function () { return chunk6HVOHZHS_cjs.isBackwardsCompatible; }
 });
 Object.defineProperty(exports, "isSchemaInitialized", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.isSchemaInitialized; }
+  get: function () { return chunk6HVOHZHS_cjs.isSchemaInitialized; }
 });
 Object.defineProperty(exports, "loadActiveSchemaWithBootstrap", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.loadActiveSchemaWithBootstrap; }
+  get: function () { return chunk6HVOHZHS_cjs.loadActiveSchemaWithBootstrap; }
 });
 Object.defineProperty(exports, "loadAndMergeGraphExtensionDocument", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.loadAndMergeGraphExtensionDocument; }
+  get: function () { return chunk6HVOHZHS_cjs.loadAndMergeGraphExtensionDocument; }
 });
 Object.defineProperty(exports, "migrateSchema", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.migrateSchema; }
+  get: function () { return chunk6HVOHZHS_cjs.migrateSchema; }
 });
 Object.defineProperty(exports, "parseSerializedSchema", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.parseSerializedSchema; }
+  get: function () { return chunk6HVOHZHS_cjs.parseSerializedSchema; }
 });
 Object.defineProperty(exports, "rollbackSchema", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.rollbackSchema; }
+  get: function () { return chunk6HVOHZHS_cjs.rollbackSchema; }
 });
 Object.defineProperty(exports, "serializeSchema", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.serializeSchema; }
+  get: function () { return chunk6HVOHZHS_cjs.serializeSchema; }
 });
 Object.defineProperty(exports, "validateEdgeProps", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.validateEdgeProps; }
+  get: function () { return chunk6HVOHZHS_cjs.validateEdgeProps; }
 });
 Object.defineProperty(exports, "validateNodeProps", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.validateNodeProps; }
+  get: function () { return chunk6HVOHZHS_cjs.validateNodeProps; }
 });
 Object.defineProperty(exports, "validateProps", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.validateProps; }
+  get: function () { return chunk6HVOHZHS_cjs.validateProps; }
 });
 Object.defineProperty(exports, "wrapZodError", {
   enumerable: true,
-  get: function () { return chunkNG5N7R45_cjs.wrapZodError; }
+  get: function () { return chunk6HVOHZHS_cjs.wrapZodError; }
 });
 exports.deserializeSchema = deserializeSchema;
 //# sourceMappingURL=index.cjs.map

package/dist/schema/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/schema/deserializer.ts"],"names":["KindRegistry"],"mappings":";;;;;;;;;;;;;;;AA6EO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,OAAO,IAAIA,8BAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IAC5C,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"index.cjs","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  return new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}
+{"version":3,"sources":["../../src/schema/deserializer.ts"],"names":["KindRegistry"],"mappings":";;;;;;;;;;;;;;;;;;;AA6EO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,OAAO,IAAIA,8BAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IAC5C,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"index.cjs","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  return new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}

package/dist/schema/index.d.cts

@@ -1,7 +1,7 @@
-import { K as KindRegistry, G as GraphDef } from '../manager-BYl_zyZR.cjs';
-export { C as ChangeSeverity, a as ChangeType, D as DeprecatedKindsChange, E as EdgeChange, b as ExtensionChange, I as IndexChange, M as MigrationHookContext, N as NodeChange, O as OntologyChange, S as SchemaDiff, c as SchemaManagerOptions, d as SchemaValidationResult, e as applyDeprecatedKinds, f as assertSchemaCurrent, g as computeSchemaDiff, h as ensureSchema, i as getActiveSchema, j as getMigrationActions, k as getSchemaChanges, l as initializeSchema, m as isBackwardsCompatible, n as isSchemaInitialized, o as loadActiveSchemaWithBootstrap, p as loadAndMergeGraphExtensionDocument, q as migrateSchema, r as parseSerializedSchema, s as rollbackSchema } from '../manager-BYl_zyZR.cjs';
-import { f as SerializedNodeDef, g as SerializedEdgeDef, h as SerializedMetaEdge, i as SerializedOntologyRelation, j as SerializedClosures, k as SerializedSchema, l as SchemaHash } from '../types-C_UnQOQp.cjs';
-export { m as JsonSchema, n as SerializedOntology, o as SerializedUniqueConstraint } from '../types-C_UnQOQp.cjs';
+import { K as KindRegistry, G as GraphDef } from '../manager-ms9cKdc6.cjs';
+export { C as ChangeSeverity, a as ChangeType, D as DeprecatedKindsChange, E as EdgeChange, b as ExtensionChange, I as IndexChange, M as MigrationHookContext, N as NodeChange, O as OntologyChange, S as SchemaDiff, c as SchemaManagerOptions, d as SchemaValidationResult, e as applyDeprecatedKinds, f as assertSchemaCurrent, g as computeSchemaDiff, h as ensureSchema, i as getActiveSchema, j as getMigrationActions, k as getSchemaChanges, l as initializeSchema, m as isBackwardsCompatible, n as isSchemaInitialized, o as loadActiveSchemaWithBootstrap, p as loadAndMergeGraphExtensionDocument, q as migrateSchema, r as parseSerializedSchema, s as rollbackSchema } from '../manager-ms9cKdc6.cjs';
+import { f as SerializedNodeDef, g as SerializedEdgeDef, h as SerializedMetaEdge, i as SerializedOntologyRelation, j as SerializedClosures, k as SerializedSchema, l as SchemaHash } from '../types-DkNnF-7K.cjs';
+export { m as JsonSchema, n as SerializedOntology, o as SerializedUniqueConstraint } from '../types-DkNnF-7K.cjs';
 import { a as NullCheckOp, K as KindEntity } from '../extension-types-YGFJPrzK.cjs';
 import { ZodType, ZodError } from 'zod';
 import { V as ValidationIssue, a as ValidationError } from '../index-SEvUHDA6.cjs';

package/dist/schema/index.d.ts

@@ -1,7 +1,7 @@
-import { K as KindRegistry, G as GraphDef } from '../manager-C0_r0ALf.js';
-export { C as ChangeSeverity, a as ChangeType, D as DeprecatedKindsChange, E as EdgeChange, b as ExtensionChange, I as IndexChange, M as MigrationHookContext, N as NodeChange, O as OntologyChange, S as SchemaDiff, c as SchemaManagerOptions, d as SchemaValidationResult, e as applyDeprecatedKinds, f as assertSchemaCurrent, g as computeSchemaDiff, h as ensureSchema, i as getActiveSchema, j as getMigrationActions, k as getSchemaChanges, l as initializeSchema, m as isBackwardsCompatible, n as isSchemaInitialized, o as loadActiveSchemaWithBootstrap, p as loadAndMergeGraphExtensionDocument, q as migrateSchema, r as parseSerializedSchema, s as rollbackSchema } from '../manager-C0_r0ALf.js';
-import { f as SerializedNodeDef, g as SerializedEdgeDef, h as SerializedMetaEdge, i as SerializedOntologyRelation, j as SerializedClosures, k as SerializedSchema, l as SchemaHash } from '../types-DGylBhWo.js';
-export { m as JsonSchema, n as SerializedOntology, o as SerializedUniqueConstraint } from '../types-DGylBhWo.js';
+import { K as KindRegistry, G as GraphDef } from '../manager-BZUeN_BU.js';
+export { C as ChangeSeverity, a as ChangeType, D as DeprecatedKindsChange, E as EdgeChange, b as ExtensionChange, I as IndexChange, M as MigrationHookContext, N as NodeChange, O as OntologyChange, S as SchemaDiff, c as SchemaManagerOptions, d as SchemaValidationResult, e as applyDeprecatedKinds, f as assertSchemaCurrent, g as computeSchemaDiff, h as ensureSchema, i as getActiveSchema, j as getMigrationActions, k as getSchemaChanges, l as initializeSchema, m as isBackwardsCompatible, n as isSchemaInitialized, o as loadActiveSchemaWithBootstrap, p as loadAndMergeGraphExtensionDocument, q as migrateSchema, r as parseSerializedSchema, s as rollbackSchema } from '../manager-BZUeN_BU.js';
+import { f as SerializedNodeDef, g as SerializedEdgeDef, h as SerializedMetaEdge, i as SerializedOntologyRelation, j as SerializedClosures, k as SerializedSchema, l as SchemaHash } from '../types-D1Sqeyxy.js';
+export { m as JsonSchema, n as SerializedOntology, o as SerializedUniqueConstraint } from '../types-D1Sqeyxy.js';
 import { a as NullCheckOp, K as KindEntity } from '../extension-types-YGFJPrzK.js';
 import { ZodType, ZodError } from 'zod';
 import { V as ValidationIssue, a as ValidationError } from '../index-DGX6D9j1.js';

package/dist/schema/index.js

@@ -1,13 +1,17 @@
-import { KindRegistry } from '../chunk-XVUJY72M.js';
-export { applyDeprecatedKinds, assertSchemaCurrent, computeSchemaDiff, computeSchemaHash, createValidationError, deserializeWherePredicate, ensureSchema, getActiveSchema, getMigrationActions, getSchemaChanges, initializeSchema, isBackwardsCompatible, isSchemaInitialized, loadActiveSchemaWithBootstrap, loadAndMergeGraphExtensionDocument, migrateSchema, parseSerializedSchema, rollbackSchema, serializeSchema, validateEdgeProps, validateNodeProps, validateProps, wrapZodError } from '../chunk-XVUJY72M.js';
-import '../chunk-QBYTJSAY.js';
-import '../chunk-6NRFUHMS.js';
-import '../chunk-IZ4PCL47.js';
-import '../chunk-454I6GDF.js';
-import '../chunk-YCV72E6L.js';
-import '../chunk-GYVBEZAO.js';
-import '../chunk-2YMGNYXY.js';
+import { KindRegistry } from '../chunk-K2TGS3EN.js';
+export { applyDeprecatedKinds, assertSchemaCurrent, computeSchemaDiff, computeSchemaHash, createValidationError, deserializeWherePredicate, ensureSchema, getActiveSchema, getMigrationActions, getSchemaChanges, initializeSchema, isBackwardsCompatible, isSchemaInitialized, loadActiveSchemaWithBootstrap, loadAndMergeGraphExtensionDocument, migrateSchema, parseSerializedSchema, rollbackSchema, serializeSchema, validateEdgeProps, validateNodeProps, validateProps, wrapZodError } from '../chunk-K2TGS3EN.js';
+import '../chunk-UR7W5YQK.js';
+import '../chunk-CHXTTSC6.js';
+import '../chunk-4DIBPQNJ.js';
+import '../chunk-K34OPSJK.js';
+import '../chunk-BVTWD66D.js';
+import '../chunk-ZURTTSCM.js';
+import '../chunk-XXVEULWX.js';
+import '../chunk-2MRAX3UE.js';
+import '../chunk-2EBMPJBO.js';
+import '../chunk-Z5XBMDXU.js';
 import '../chunk-XLUNB2TZ.js';
+import '../chunk-ITE4IXAK.js';
 import '../chunk-TQOYM4LN.js';
 import '../chunk-K5P5OZXS.js';
 

package/dist/schema/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/schema/deserializer.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AA6EO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,OAAO,IAAI,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IAC5C,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"index.js","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  return new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}
+{"version":3,"sources":["../../src/schema/deserializer.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AA6EO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,OAAO,IAAI,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IAC5C,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"index.js","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  return new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}

package/dist/{sqlite-gm44dShb.d.ts → sqlite-CGu5SLsw.d.ts}

@@ -1,5 +1,5 @@
 import * as drizzle_orm_sqlite_core from 'drizzle-orm/sqlite-core';
-import { I as IndexDeclaration } from './types-DGylBhWo.js';
+import { I as IndexDeclaration } from './types-D1Sqeyxy.js';
 
 /**
  * Table name configuration.

package/dist/{sqlite-BfksSb45.d.cts → sqlite-XrDxNaa7.d.cts}

@@ -1,5 +1,5 @@
 import * as drizzle_orm_sqlite_core from 'drizzle-orm/sqlite-core';
-import { I as IndexDeclaration } from './types-C_UnQOQp.cjs';
+import { I as IndexDeclaration } from './types-DkNnF-7K.cjs';
 
 /**
  * Table name configuration.

package/dist/{store-view-FfE5_7eo.d.ts → store-view-BlgnhEYf.d.ts}

@@ -1,7 +1,7 @@
-import { K as KindRegistry, G as GraphDef, w as EdgeKinds, t as NodeKinds, v as AllNodeTypes, c as SchemaManagerOptions, d as SchemaValidationResult } from './manager-C0_r0ALf.js';
+import { K as KindRegistry, G as GraphDef, w as EdgeKinds, t as NodeKinds, v as AllNodeTypes, c as SchemaManagerOptions, d as SchemaValidationResult } from './manager-BZUeN_BU.js';
 import { T as TemporalMode, A as AnyEdgeType, N as NodeType, g as EdgeType, E as EdgeRegistration, e as EdgeId, d as NodeId, b as NodeRegistration, K as KindEntity, m as Cardinality, q as EndpointExistence, f as KindAnnotations, s as UniquenessScope, n as Collation, G as GraphExtension } from './extension-types-YGFJPrzK.js';
 import { z } from 'zod';
-import { b7 as ValueType, b8 as PredicateExpression, b9 as VectorMetricType, ae as FulltextQueryMode, Q as QueryAst, J as JsonPointer, P as FieldRef, ax as ParameterRef, G as GraphBackend, aP as TransactionBackend, ao as JsonPointerInput, aQ as TraversalExpansion, p as SqlDialect, aL as SqlSchema, ba as Traversal, bb as NodePredicate, bc as ProjectedField, aw as OrderSpec, bd as GroupBySpec, ak as HybridFusionOptions, be as RecursiveCyclePolicy, W as TraversalDirection$1, bf as EdgeRow, bg as NodeRow, aa as ExternalRecordedReadSource, X as AdoptedTransaction, L as AggregateExpr, a3 as CompiledSelectSql, F as FulltextStrategy, V as VectorStrategy, bh as VectorSlotMap, bi as RecordedReadBinding, bj as SelectiveField, bk as ComposableQuery, bl as SetOperationType, bm as SetOperation, aJ as SortDirection, bn as VectorMetric, m as JsonSchema, bo as TransactionOptions } from './types-DGylBhWo.js';
+import { b7 as ValueType, b8 as PredicateExpression, b9 as VectorMetricType, ae as FulltextQueryMode, Q as QueryAst, J as JsonPointer, P as FieldRef, ax as ParameterRef, G as GraphBackend, aP as TransactionBackend, ao as JsonPointerInput, aQ as TraversalExpansion, p as SqlDialect, aL as SqlSchema, ba as Traversal, bb as NodePredicate, bc as ProjectedField, aw as OrderSpec, bd as GroupBySpec, ak as HybridFusionOptions, be as RecursiveCyclePolicy, W as TraversalDirection$1, bf as EdgeRow, bg as NodeRow, aa as ExternalRecordedReadSource, X as AdoptedTransaction, L as AggregateExpr, a3 as CompiledSelectSql, F as FulltextStrategy, V as VectorStrategy, bh as VectorSlotMap, bi as RecordedReadBinding, bj as SelectiveField, bk as ComposableQuery, bl as SetOperationType, bm as SetOperation, aJ as SortDirection, bn as VectorMetric, m as JsonSchema, bo as TransactionOptions } from './types-D1Sqeyxy.js';
 import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-CAkIYFV-.js';
 
 /**
@@ -1173,11 +1173,24 @@ type StoreHooks = Readonly<{
     }>) => void;
     /** Called before a CRUD operation starts */
     onOperationStart?: (ctx: OperationHookContext) => void;
-    /** Called after a CRUD operation completes */
+    /**
+     * Called after a CRUD operation completes AND is durably committed. For a
+     * top-level operation that is when its own transaction commits; for an
+     * operation inside `store.transaction`, emission is deferred until the
+     * enclosing transaction commits — if that commit fails, the operation is
+     * reported through `onError` instead. (Inside an adopted transaction —
+     * `withTransaction` / `withRecordedTransaction` — the commit belongs to
+     * the caller and cannot be observed, so this fires when the operation
+     * completes within the still-open transaction.)
+     */
     onOperationEnd?: (ctx: OperationHookContext, result: Readonly<{
         durationMs: number;
     }>) => void;
-    /** Called when an error occurs */
+    /**
+     * Called when an operation fails — including an operation that completed
+     * inside a `store.transaction` whose commit then failed and rolled it
+     * back.
+     */
     onError?: (ctx: HookContext, error: Error) => void;
 }>;
 type BaseStoreOptions = Readonly<{
@@ -1915,6 +1928,21 @@ type TransactionContext<G extends GraphDef> = Readonly<{
      * is the store's plain backend — reads work, but there is no snapshot.
      */
     backend: TransactionBackend;
+    /**
+     * Runtime string-keyed node collection access, mirroring
+     * `Store.getNodeCollection` — for callers (e.g. provenance) that resolve a
+     * kind dynamically rather than through the static `nodes.<Kind>` property.
+     * Returns `undefined` when `kind` is not registered in this graph.
+     */
+    getNodeCollection(kind: string): DynamicNodeCollection | undefined;
+    /**
+     * @internal Runs a graph-owned node mutation through this transaction's
+     * operation-hook lifecycle when the mutation cannot use a public collection
+     * verb directly (provenance fact close/reopen). Routed through the
+     * transaction's hook runner, so a successful operation's `onOperationEnd`
+     * is deferred until the transaction commits.
+     */
+    runNodeOperationHooks<T>(operation: "create" | "update" | "delete", kind: string, id: string, fn: () => Promise<T>): Promise<T>;
 }>;
 /**
  * Replace branded `NodeId` / `EdgeId` with plain `string` in each
@@ -4588,4 +4616,4 @@ declare class RecordedStoreView<G extends GraphDef> extends CoordinatePinnedView
     get edges(): RecordedStoreViewEdgeCollections<G>;
 }
 
-export { type GraphAlgorithms as $, type AliasMap as A, type BaseTraversalOptions as B, type ConstraintNames as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EmbeddingMetric as E, type EdgeFindByEndpointsOptions as F, type EdgeGetOrCreateByEndpointsOptions as G, type EdgeGetOrCreateByEndpointsResult as H, type EdgeIntrospection as I, type EdgeTemporalReads as J, type EdgeWrites as K, type EmbeddingSchema as L, type EmbeddingValue as M, type Node as N, type EmptyAliasMap as O, type EmptyEdgeAliasMap as P, type QueryCoordinateState as Q, type RecursiveAliasMap as R, Store as S, TraversalBuilder as T, type UniqueIntrospection as U, ExecutableAggregateQuery as V, ExecutableQuery as W, type FieldAccessor as X, type FulltextSearchHit as Y, type FulltextSearchOptions as Z, type GetOrCreateAction as _, type EmbeddingIndexType as a, type SelectableEdge as a$, type GraphEdgeCollections as a0, type GraphNodeCollections as a1, type HistorySafeBackend as a2, type HistorySafeTransactionBackend as a3, type HistoryStore as a4, type HistoryStoreOptions as a5, type HistoryTransactionContext as a6, type HookContext as a7, type HybridFulltextOptions as a8, type HybridSearchHit as a9, type PathNode as aA, type Predicate as aB, PreparedQuery as aC, type PropsAccessor as aD, type QueryHookContext as aE, type QueryOptions as aF, type ReachableNode as aG, type ReachableOptions as aH, type RebuildFulltextOptions as aI, type RebuildFulltextResult as aJ, type ReclaimedVectorFieldEntry as aK, type RecordedInstant as aL, type RecordedReadStore as aM, RecordedStoreView as aN, type RecordedStoreViewEdgeCollection as aO, type RecordedStoreViewEdgeCollections as aP, type RecordedStoreViewNodeCollection as aQ, type RecordedStoreViewNodeCollections as aR, type RecursiveTraversalOptions as aS, type ReembedFunction as aT, type ReembedVectorFieldOptions as aU, type ReembedVectorFieldResult as aV, type SchemaIntrospection as aW, type SearchableMetadata as aX, type SearchableOptions as aY, type SearchableSchema as aZ, type SelectContext as a_, type HybridSearchOptions as aa, type HybridVectorOptions as ab, type IfExistsMode as ac, type InitialQueryBuilder as ad, type KindIntrospection as ae, type LiveStoreOptions as af, type MaterializeRemovalsEntry as ag, type MaterializeRemovalsOptions as ah, type MaterializeRemovalsResult as ai, type NeighborsOptions as aj, type NoRecordedCoordinate as ak, type NodeAccessor as al, type NodeAlias as am, type NodeBulkFindByIndexOptions as an, type NodeCollection as ao, type NodeCurrentReads as ap, type NodeGetOrCreateByConstraintOptions as aq, type NodeGetOrCreateByConstraintResult as ar, type NodeIdentifier as as, type NodeRef as at, type NodeTemporalReads as au, type NodeWrites as av, type OntologyIntrospection as aw, type OperationHookContext as ax, type PaginateOptions as ay, type PaginatedResult as az, type EdgeAliasMap as b, type SelectableNode as b0, type ShortestPathOptions as b1, type ShortestPathResult as b2, type StoreHooks as b3, type StoreOptions as b4, type StoreProjection as b5, type StoreRef as b6, StoreSearch as b7, StoreView as b8, type StoreViewCanReachOptions as b9, type VectorSearchHit as bA, type VectorSearchOptions as bB, asRecordedInstant as bC, createQueryBuilder as bD, createStore as bE, createStoreWithSchema as bF, createVerifiedStore as bG, defineSubgraphProject as bH, embedding as bI, exists as bJ, fieldRef as bK, getEmbeddingDimensions as bL, getSearchableMetadata as bM, inSubquery as bN, isEmbeddingSchema as bO, isParameterRef as bP, isSearchableSchema as bQ, notExists as bR, notInSubquery as bS, param as bT, searchable as bU, type StoreViewCoordinate as ba, type StoreViewDegreeOptions as bb, type StoreViewEdgeCollection as bc, type StoreViewEdgeCollections as bd, type StoreViewNeighborsOptions as be, type StoreViewNodeCollection as bf, type StoreViewNodeCollections as bg, type StoreViewReachableOptions as bh, type StoreViewShortestPathOptions as bi, type StoreViewSubgraphOptions as bj, type StreamOptions as bk, type SubgraphEdgeResult as bl, type SubgraphNodeResult as bm, type SubgraphOptions as bn, type SubgraphResult as bo, type SubsetEdge as bp, type SubsetNode as bq, type TemporalAlgorithmOptions as br, type TransactionContext as bs, type TraversalDirection as bt, type TypedEdgeCollection as bu, type TypedRecordedStoreViewEdgeCollection as bv, type TypedStoreViewEdgeCollection as bw, UnionableQuery as bx, type UpdateEdgeInput as by, type UpdateNodeInput as bz, QueryBuilder as c, type EmptyRecursiveAliasMap as d, type AggregateResult as e, type AlgorithmCyclePolicy as f, type AnyEdge as g, type AnyNode as h, type BatchResults as i, type BatchableQuery as j, type CreateEdgeInput as k, type CreateNodeInput as l, type DegreeOptions as m, type DynamicEdgeAccessor as n, type DynamicEdgeCollection as o, type DynamicEdgeType as p, type DynamicFieldBuilder as q, type DynamicNodeAccessor as r, type DynamicNodeCollection as s, type DynamicNodeType as t, type DynamicSelectableEdge as u, type DynamicSelectableNode as v, type Edge as w, type EdgeAccessor as x, type EdgeBatchReads as y, type EdgeCollection as z };
+export { type GetOrCreateAction as $, type AliasMap as A, type BaseTraversalOptions as B, type ConstraintNames as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EmbeddingMetric as E, type EdgeFindByEndpointsOptions as F, type EdgeGetOrCreateByEndpointsOptions as G, type HistoryStore as H, type EdgeGetOrCreateByEndpointsResult as I, type EdgeIntrospection as J, type EdgeTemporalReads as K, type EdgeWrites as L, type EmbeddingSchema as M, type Node as N, type EmbeddingValue as O, type EmptyAliasMap as P, type QueryCoordinateState as Q, type RecursiveAliasMap as R, Store as S, TraversalBuilder as T, type UniqueIntrospection as U, type EmptyEdgeAliasMap as V, ExecutableAggregateQuery as W, ExecutableQuery as X, type FieldAccessor as Y, type FulltextSearchHit as Z, type FulltextSearchOptions as _, type EmbeddingIndexType as a, type SelectableEdge as a$, type GraphAlgorithms as a0, type GraphEdgeCollections as a1, type GraphNodeCollections as a2, type HistorySafeBackend as a3, type HistorySafeTransactionBackend as a4, type HistoryStoreOptions as a5, type HistoryTransactionContext as a6, type HookContext as a7, type HybridFulltextOptions as a8, type HybridSearchHit as a9, type PathNode as aA, type Predicate as aB, PreparedQuery as aC, type PropsAccessor as aD, type QueryHookContext as aE, type QueryOptions as aF, type ReachableNode as aG, type ReachableOptions as aH, type RebuildFulltextOptions as aI, type RebuildFulltextResult as aJ, type ReclaimedVectorFieldEntry as aK, type RecordedInstant as aL, type RecordedReadStore as aM, RecordedStoreView as aN, type RecordedStoreViewEdgeCollection as aO, type RecordedStoreViewEdgeCollections as aP, type RecordedStoreViewNodeCollection as aQ, type RecordedStoreViewNodeCollections as aR, type RecursiveTraversalOptions as aS, type ReembedFunction as aT, type ReembedVectorFieldOptions as aU, type ReembedVectorFieldResult as aV, type SchemaIntrospection as aW, type SearchableMetadata as aX, type SearchableOptions as aY, type SearchableSchema as aZ, type SelectContext as a_, type HybridSearchOptions as aa, type HybridVectorOptions as ab, type IfExistsMode as ac, type InitialQueryBuilder as ad, type KindIntrospection as ae, type LiveStoreOptions as af, type MaterializeRemovalsEntry as ag, type MaterializeRemovalsOptions as ah, type MaterializeRemovalsResult as ai, type NeighborsOptions as aj, type NoRecordedCoordinate as ak, type NodeAccessor as al, type NodeAlias as am, type NodeBulkFindByIndexOptions as an, type NodeCollection as ao, type NodeCurrentReads as ap, type NodeGetOrCreateByConstraintOptions as aq, type NodeGetOrCreateByConstraintResult as ar, type NodeIdentifier as as, type NodeRef as at, type NodeTemporalReads as au, type NodeWrites as av, type OntologyIntrospection as aw, type OperationHookContext as ax, type PaginateOptions as ay, type PaginatedResult as az, type EdgeAliasMap as b, type SelectableNode as b0, type ShortestPathOptions as b1, type ShortestPathResult as b2, type StoreHooks as b3, type StoreOptions as b4, type StoreProjection as b5, type StoreRef as b6, StoreSearch as b7, StoreView as b8, type StoreViewCanReachOptions as b9, type VectorSearchHit as bA, type VectorSearchOptions as bB, asRecordedInstant as bC, createQueryBuilder as bD, createStore as bE, createStoreWithSchema as bF, createVerifiedStore as bG, defineSubgraphProject as bH, embedding as bI, exists as bJ, fieldRef as bK, getEmbeddingDimensions as bL, getSearchableMetadata as bM, inSubquery as bN, isEmbeddingSchema as bO, isParameterRef as bP, isSearchableSchema as bQ, notExists as bR, notInSubquery as bS, param as bT, searchable as bU, type StoreViewCoordinate as ba, type StoreViewDegreeOptions as bb, type StoreViewEdgeCollection as bc, type StoreViewEdgeCollections as bd, type StoreViewNeighborsOptions as be, type StoreViewNodeCollection as bf, type StoreViewNodeCollections as bg, type StoreViewReachableOptions as bh, type StoreViewShortestPathOptions as bi, type StoreViewSubgraphOptions as bj, type StreamOptions as bk, type SubgraphEdgeResult as bl, type SubgraphNodeResult as bm, type SubgraphOptions as bn, type SubgraphResult as bo, type SubsetEdge as bp, type SubsetNode as bq, type TemporalAlgorithmOptions as br, type TransactionContext as bs, type TraversalDirection as bt, type TypedEdgeCollection as bu, type TypedRecordedStoreViewEdgeCollection as bv, type TypedStoreViewEdgeCollection as bw, UnionableQuery as bx, type UpdateEdgeInput as by, type UpdateNodeInput as bz, QueryBuilder as c, type EmptyRecursiveAliasMap as d, type AggregateResult as e, type AlgorithmCyclePolicy as f, type AnyEdge as g, type AnyNode as h, type BatchResults as i, type BatchableQuery as j, type CreateEdgeInput as k, type CreateNodeInput as l, type DegreeOptions as m, type DynamicEdgeAccessor as n, type DynamicEdgeCollection as o, type DynamicEdgeType as p, type DynamicFieldBuilder as q, type DynamicNodeAccessor as r, type DynamicNodeCollection as s, type DynamicNodeType as t, type DynamicSelectableEdge as u, type DynamicSelectableNode as v, type Edge as w, type EdgeAccessor as x, type EdgeBatchReads as y, type EdgeCollection as z };