@nicia-ai/typegraph 0.45.0 → 0.46.1

package/dist/interchange/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/interchange/trusted-import.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAS,+BACP,KAAA,EACM;AACN,EAAA,IAAI,MAAM,cAAA,EAAgB;AACxB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gEAAA;AAAA,MACA,qBAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA;AAAQ,KAC3B;AAAA,EACF;AACA,EAAA,IAAI,MAAM,uBAAA,EAAyB;AACjC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,oDAAA;AAAA,MACA,+BAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA;AAAQ,KAC3B;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,OAAO,MAAA,CAAO,KAAA,CAAM,MAAM,KAAK,CAAA,CAChD,OAAO,CAAC,YAAA,KAAA,CAAkB,aAAa,MAAA,EAAQ,MAAA,IAAU,KAAK,CAAC,CAAA,CAC/D,IAAI,CAAC,YAAA,KAAiB,YAAA,CAAa,IAAA,CAAK,IAAI,CAAA;AAC/C,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,4DAAA;AAAA,MACA,wBAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAS,WAAW,WAAA;AAAY,KACnD;AAAA,EACF;AAEA,EAAA,MAAM,kBAAkB,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,KAAK,CAAA,CACpD,MAAA;AAAA,IACC,CAAC,YAAA,KACC,mBAAA,CAAoB,aAAa,IAAA,CAAK,MAAM,EAAE,MAAA,GAAS;AAAA,IAE1D,GAAA,CAAI,CAAC,YAAA,KAAiB,YAAA,CAAa,KAAK,IAAI,CAAA;AAC/C,EAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,qDAAA;AAAA,MACA,sBAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAS,WAAW,eAAA;AAAgB,KACvD;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,uBAAA,CAAwB,KAAA,CAAM,KAAK,CAAA;AACvD,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,mDAAA;AAAA,MACA,oBAAA;AAAA,MACA;AAAA,QACE,SAAS,KAAA,CAAM,OAAA;AAAA,QACf,MAAA,EAAQ,WAAA,CAAY,GAAA,CAAI,CAAC,IAAA,KAAS,CAAA,EAAG,IAAA,CAAK,QAAQ,CAAA,CAAA,EAAI,IAAA,CAAK,SAAS,CAAA,CAAE;AAAA;AACxE,KACF;AAAA,EACF;AACF;AAEA,SAAS,cAAc,OAAA,EAAqC;AAC1D,EAAA,OAAO,IAAI,kBAAA,CAAmB,OAAA,EAAS,gBAAgB,CAAA;AACzD;AAEA,SAAS,UAAA,CAAW,SAAiB,IAAA,EAAyC;AAC5E,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,IAAI,IAAA,CAAK,EAAA;AAAA,IACT,OAAO,IAAA,CAAK,UAAA;AAAA,IACZ,GAAI,KAAK,SAAA,KAAc,MAAA,GAAY,EAAC,GAAI,EAAE,SAAA,EAAW,IAAA,CAAK,SAAA,EAAU;AAAA,IACpE,GAAI,KAAK,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA;AAAQ,GAChE;AACF;AAEA,SAAS,UAAA,CAAW,SAAiB,IAAA,EAAyC;AAC5E,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,IAAI,IAAA,CAAK,EAAA;AAAA,IACT,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,QAAA,EAAU,KAAK,IAAA,CAAK,IAAA;AAAA,IACpB,MAAA,EAAQ,KAAK,IAAA,CAAK,EAAA;AAAA,IAClB,MAAA,EAAQ,KAAK,EAAA,CAAG,IAAA;AAAA,IAChB,IAAA,EAAM,KAAK,EAAA,CAAG,EAAA;AAAA,IACd,OAAO,IAAA,CAAK,UAAA;AAAA,IACZ,GAAI,KAAK,SAAA,KAAc,MAAA,GAAY,EAAC,GAAI,EAAE,SAAA,EAAW,IAAA,CAAK,SAAA,EAAU;AAAA,IACpE,GAAI,KAAK,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA;AAAQ,GAChE;AACF;AAEA,eAAe,oBAAA,CACb,KAAA,EACA,OAAA,EACA,MAAA,EAE8B;AAC9B,EAAA,MAAM,YAAY,IAAI,GAAA;AAAA,IACpB,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,KAAK,CAAA,CAAE,GAAA;AAAA,MAC/B,CAAC,YAAA,KAAiB,YAAA,CAAa,IAAA,CAAK;AAAA;AACtC,GACF;AACA,EAAA,MAAM,YAAY,IAAI,GAAA;AAAA,IACpB,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,KAAK,CAAA,CAAE,GAAA;AAAA,MAC/B,CAAC,YAAA,KAAiB,YAAA,CAAa,IAAA,CAAK;AAAA;AACtC,GACF;AACA,EAAA,IAAI,cAAA,GAAiB,KAAA;AACrB,EAAA,IAAI,aAAA,GAAgB,KAAA;AACpB,EAAA,IAAI,SAAA,GAAY,CAAA;AAChB,EAAA,IAAI,SAAA,GAAY,CAAA;AAEhB,EAAA,WAAA,MAAiB,SAAS,MAAA,EAAQ;AAChC,IAAA,QAAQ,MAAM,IAAA;AAAM,MAClB,KAAK,QAAA,EAAU;AACb,QAAA,IAAI,cAAA,EAAgB;AAClB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,cAAA,GAAiB,IAAA;AACjB,QAAA;AAAA,MACF;AAAA,MACA,KAAK,OAAA,EAAS;AACZ,QAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,IAAI,aAAA,EAAe;AACjB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,IAAA;AAAA,UAC9B,CAAC,IAAA,KAAS,CAAC,SAAA,CAAU,GAAA,CAAI,KAAK,IAAI;AAAA,SACpC,EAAG,IAAA;AACH,QAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,UAAA,MAAM,aAAA;AAAA,YACJ,wCAAwC,WAAW,CAAA;AAAA,WACrD;AAAA,QACF;AACA,QAAA,MAAM,OAAA,CAAQ,WAAA;AAAA,UACZ,KAAA,CAAM,MAAM,GAAA,CAAI,CAAC,SAAS,UAAA,CAAW,KAAA,CAAM,OAAA,EAAS,IAAI,CAAC;AAAA,SAC3D;AACA,QAAA,SAAA,IAAa,MAAM,KAAA,CAAM,MAAA;AACzB,QAAA;AAAA,MACF;AAAA,MACA,KAAK,OAAA,EAAS;AACZ,QAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,aAAA,GAAgB,IAAA;AAChB,QAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,IAAA;AAAA,UAC9B,CAAC,SACC,CAAC,SAAA,CAAU,IAAI,IAAA,CAAK,IAAI,KACxB,CAAC,SAAA,CAAU,IAAI,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA,IAC7B,CAAC,UAAU,GAAA,CAAI,IAAA,CAAK,GAAG,IAAI;AAAA,SAC/B;AACA,QAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,UAAA,MAAM,aAAA;AAAA,YACJ,CAAA,iDAAA,EAAoD,YAAY,IAAI,CAAA;AAAA,WACtE;AAAA,QACF;AACA,QAAA,MAAM,OAAA,CAAQ,WAAA;AAAA,UACZ,KAAA,CAAM,MAAM,GAAA,CAAI,CAAC,SAAS,UAAA,CAAW,KAAA,CAAM,OAAA,EAAS,IAAI,CAAC;AAAA,SAC3D;AACA,QAAA,SAAA,IAAa,MAAM,KAAA,CAAM,MAAA;AACzB,QAAA;AAAA,MACF;AAAA;AACF,EACF;AAEA,EAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,IAAA,MAAM,aAAA;AAAA,MACJ;AAAA,KACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,KAAA,EAAO,SAAA,EAAU;AAC9C;AAUA,eAAsB,wBAAA,CACpB,OACA,MAAA,EAE8B;AAC9B,EAAA,8BAAA,CAA+B,KAAK,CAAA;AACpC,EAAA,MAAM,OAAA,GAAU,aAAa,KAAK,CAAA;AAClC,EAAA,MAAM,gBAAgB,OAAA,CAAQ,aAAA;AAC9B,EAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,IAAA,EAAO,QAAQ,OAAO,CAAA,yCAAA,CAAA;AAAA,MACtB,qBAAA;AAAA,MACA,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA;AAAQ,KAC7B;AAAA,EACF;AACA,EAAA,MAAM,aAAA,GAAgB,KAAA,CAAM,UAAA,EAAW,CAAE,aAAA;AACzC,EAAA,MAAM,OAAA,GACJ,aAAA,KAAkB,MAAA,GAAY,MAAA,GAC5B;AAAA,IACE,WAAA,EAAa;AAAA,MACX,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,eAAA,EAAiB;AAAA;AACnB,GACF;AAEJ,EAAA,OAAO,aAAA;AAAA,IACL,CAAC,OAAA,KAAY,oBAAA,CAAqB,KAAA,EAAO,SAAS,MAAM,CAAA;AAAA,IACxD;AAAA,GACF;AACF;AAEA,UAAU,gBAAgB,IAAA,EAAkD;AAC1E,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAO,GAAG,QAAO,GAAI,IAAA;AACpC,EAAA,MAAM,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAO;AAC/B,EAAA,MAAM,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAM;AAC7B,EAAA,MAAM,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAM;AAC/B;AAGO,SAAS,kBAAA,CACd,OACA,IAAA,EAC8B;AAC9B,EAAA,OAAO,wBAAA,CAAyB,KAAA,EAAO,eAAA,CAAgB,IAAI,CAAC,CAAA;AAC9D","file":"index.js","sourcesContent":["import type {\n  InsertEdgeParams,\n  InsertNodeParams,\n  TrustedImportOptions,\n  TrustedImportSession,\n} from \"../backend/types\";\nimport type { GraphDef } from \"../core/define-graph\";\nimport { resolveGraphVectorSlots } from \"../core/embedding\";\nimport { getSearchableFields } from \"../core/searchable\";\nimport { TrustedImportError } from \"../errors\";\nimport { storeBackend } from \"../store/runtime-port\";\nimport type { Store } from \"../store/store\";\nimport type {\n  GraphData,\n  GraphInterchangeChunk,\n  InterchangeEdge,\n  InterchangeNode,\n} from \"./types\";\n\n/** Counts committed by a trusted initial import. */\nexport type TrustedImportResult = Readonly<{\n  nodes: number;\n  edges: number;\n}>;\n\nfunction rejectUnsupportedStoreFeatures<G extends GraphDef>(\n  store: Store<G>,\n): void {\n  if (store.historyEnabled) {\n    throw new TrustedImportError(\n      \"Trusted import does not support recorded-time history capture.\",\n      \"history_unsupported\",\n      { graphId: store.graphId },\n    );\n  }\n  if (store.revisionTrackingEnabled) {\n    throw new TrustedImportError(\n      \"Trusted import does not support revision tracking.\",\n      \"revision_tracking_unsupported\",\n      { graphId: store.graphId },\n    );\n  }\n\n  const uniqueKinds = Object.values(store.graph.nodes)\n    .filter((registration) => (registration.unique?.length ?? 0) > 0)\n    .map((registration) => registration.type.kind);\n  if (uniqueKinds.length > 0) {\n    throw new TrustedImportError(\n      \"Trusted import does not maintain node uniqueness sidecars.\",\n      \"uniqueness_unsupported\",\n      { graphId: store.graphId, nodeKinds: uniqueKinds },\n    );\n  }\n\n  const searchableKinds = Object.values(store.graph.nodes)\n    .filter(\n      (registration) =>\n        getSearchableFields(registration.type.schema).length > 0,\n    )\n    .map((registration) => registration.type.kind);\n  if (searchableKinds.length > 0) {\n    throw new TrustedImportError(\n      \"Trusted import does not maintain fulltext sidecars.\",\n      \"fulltext_unsupported\",\n      { graphId: store.graphId, nodeKinds: searchableKinds },\n    );\n  }\n\n  const vectorSlots = resolveGraphVectorSlots(store.graph);\n  if (vectorSlots.length > 0) {\n    throw new TrustedImportError(\n      \"Trusted import does not maintain vector sidecars.\",\n      \"vector_unsupported\",\n      {\n        graphId: store.graphId,\n        fields: vectorSlots.map((slot) => `${slot.nodeKind}.${slot.fieldPath}`),\n      },\n    );\n  }\n}\n\nfunction invalidStream(message: string): TrustedImportError {\n  return new TrustedImportError(message, \"invalid_stream\");\n}\n\nfunction nodeParams(graphId: string, node: InterchangeNode): InsertNodeParams {\n  return {\n    graphId,\n    kind: node.kind,\n    id: node.id,\n    props: node.properties,\n    ...(node.validFrom === undefined ? {} : { validFrom: node.validFrom }),\n    ...(node.validTo === undefined ? {} : { validTo: node.validTo }),\n  };\n}\n\nfunction edgeParams(graphId: string, edge: InterchangeEdge): InsertEdgeParams {\n  return {\n    graphId,\n    id: edge.id,\n    kind: edge.kind,\n    fromKind: edge.from.kind,\n    fromId: edge.from.id,\n    toKind: edge.to.kind,\n    toId: edge.to.id,\n    props: edge.properties,\n    ...(edge.validFrom === undefined ? {} : { validFrom: edge.validFrom }),\n    ...(edge.validTo === undefined ? {} : { validTo: edge.validTo }),\n  };\n}\n\nasync function consumeTrustedChunks<G extends GraphDef>(\n  store: Store<G>,\n  session: TrustedImportSession,\n  chunks:\n    AsyncIterable<GraphInterchangeChunk> | Iterable<GraphInterchangeChunk>,\n): Promise<TrustedImportResult> {\n  const nodeKinds = new Set(\n    Object.values(store.graph.nodes).map(\n      (registration) => registration.type.kind,\n    ),\n  );\n  const edgeKinds = new Set(\n    Object.values(store.graph.edges).map(\n      (registration) => registration.type.kind,\n    ),\n  );\n  let receivedHeader = false;\n  let receivedEdges = false;\n  let nodeCount = 0;\n  let edgeCount = 0;\n\n  for await (const chunk of chunks) {\n    switch (chunk.type) {\n      case \"header\": {\n        if (receivedHeader) {\n          throw invalidStream(\n            \"Trusted graph interchange stream emitted more than one header.\",\n          );\n        }\n        receivedHeader = true;\n        break;\n      }\n      case \"nodes\": {\n        if (!receivedHeader) {\n          throw invalidStream(\n            \"Trusted graph interchange stream must start with a header.\",\n          );\n        }\n        if (receivedEdges) {\n          throw invalidStream(\n            \"Trusted graph interchange stream cannot emit nodes after edges.\",\n          );\n        }\n        const unknownKind = chunk.nodes.find(\n          (node) => !nodeKinds.has(node.kind),\n        )?.kind;\n        if (unknownKind !== undefined) {\n          throw invalidStream(\n            `Unknown node kind in trusted import: ${unknownKind}`,\n          );\n        }\n        await session.insertNodes(\n          chunk.nodes.map((node) => nodeParams(store.graphId, node)),\n        );\n        nodeCount += chunk.nodes.length;\n        break;\n      }\n      case \"edges\": {\n        if (!receivedHeader) {\n          throw invalidStream(\n            \"Trusted graph interchange stream must start with a header.\",\n          );\n        }\n        receivedEdges = true;\n        const invalidEdge = chunk.edges.find(\n          (edge) =>\n            !edgeKinds.has(edge.kind) ||\n            !nodeKinds.has(edge.from.kind) ||\n            !nodeKinds.has(edge.to.kind),\n        );\n        if (invalidEdge !== undefined) {\n          throw invalidStream(\n            `Unknown edge or endpoint kind in trusted import: ${invalidEdge.kind}`,\n          );\n        }\n        await session.insertEdges(\n          chunk.edges.map((edge) => edgeParams(store.graphId, edge)),\n        );\n        edgeCount += chunk.edges.length;\n        break;\n      }\n    }\n  }\n\n  if (!receivedHeader) {\n    throw invalidStream(\n      \"Trusted graph interchange stream ended before emitting a header.\",\n    );\n  }\n  return { nodes: nodeCount, edges: edgeCount };\n}\n\n/**\n * Atomically imports a header-first stream into a fresh, dedicated database.\n *\n * This is an intentionally trusted path. It checks stream ordering and kind\n * names, but it does not validate properties, references, cardinality, or\n * conflicts. The caller must guarantee those invariants. Use\n * {@link importGraphStream} for untrusted data.\n */\nexport async function trustedImportGraphStream<G extends GraphDef>(\n  store: Store<G>,\n  chunks:\n    AsyncIterable<GraphInterchangeChunk> | Iterable<GraphInterchangeChunk>,\n): Promise<TrustedImportResult> {\n  rejectUnsupportedStoreFeatures(store);\n  const backend = storeBackend(store);\n  const trustedImport = backend.trustedImport;\n  if (trustedImport === undefined) {\n    throw new TrustedImportError(\n      `The ${backend.dialect} backend does not support trusted import.`,\n      \"backend_unsupported\",\n      { dialect: backend.dialect },\n    );\n  }\n  const schemaVersion = store.introspect().schemaVersion;\n  const options: TrustedImportOptions | undefined =\n    schemaVersion === undefined ? undefined : (\n      {\n        schemaWrite: {\n          graphId: store.graphId,\n          expectedVersion: schemaVersion,\n        },\n      }\n    );\n  return trustedImport(\n    (session) => consumeTrustedChunks(store, session, chunks),\n    options,\n  );\n}\n\nfunction* graphDataChunks(data: GraphData): Iterable<GraphInterchangeChunk> {\n  const { nodes, edges, ...header } = data;\n  yield { type: \"header\", header };\n  yield { type: \"nodes\", nodes };\n  yield { type: \"edges\", edges };\n}\n\n/** In-memory convenience wrapper around {@link trustedImportGraphStream}. */\nexport function trustedImportGraph<G extends GraphDef>(\n  store: Store<G>,\n  data: GraphData,\n): Promise<TrustedImportResult> {\n  return trustedImportGraphStream(store, graphDataChunks(data));\n}\n"]}
+{"version":3,"sources":["../../src/interchange/trusted-import.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA6BA,SAAS,+BACP,KAAA,EACM;AACN,EAAA,IAAI,MAAM,cAAA,EAAgB;AACxB,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gEAAA;AAAA,MACA,qBAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA;AAAQ,KAC3B;AAAA,EACF;AACA,EAAA,IAAI,MAAM,uBAAA,EAAyB;AACjC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,oDAAA;AAAA,MACA,+BAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA;AAAQ,KAC3B;AAAA,EACF;AACA,EAAA,IAAI,KAAA,CAAM,KAAA,CAAM,QAAA,KAAa,MAAA,EAAW;AACtC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,8EAAA;AAAA,MACA,sBAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA;AAAQ,KAC3B;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,OAAO,MAAA,CAAO,KAAA,CAAM,MAAM,KAAK,CAAA,CAChD,OAAO,CAAC,YAAA,KAAA,CAAkB,aAAa,MAAA,EAAQ,MAAA,IAAU,KAAK,CAAC,CAAA,CAC/D,IAAI,CAAC,YAAA,KAAiB,YAAA,CAAa,IAAA,CAAK,IAAI,CAAA;AAC/C,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,4DAAA;AAAA,MACA,wBAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAS,WAAW,WAAA;AAAY,KACnD;AAAA,EACF;AAEA,EAAA,MAAM,kBAAkB,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,KAAK,CAAA,CACpD,MAAA;AAAA,IACC,CAAC,YAAA,KACC,mBAAA,CAAoB,aAAa,IAAA,CAAK,MAAM,EAAE,MAAA,GAAS;AAAA,IAE1D,GAAA,CAAI,CAAC,YAAA,KAAiB,YAAA,CAAa,KAAK,IAAI,CAAA;AAC/C,EAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,qDAAA;AAAA,MACA,sBAAA;AAAA,MACA,EAAE,OAAA,EAAS,KAAA,CAAM,OAAA,EAAS,WAAW,eAAA;AAAgB,KACvD;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,uBAAA,CAAwB,KAAA,CAAM,KAAK,CAAA;AACvD,EAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC1B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,mDAAA;AAAA,MACA,oBAAA;AAAA,MACA;AAAA,QACE,SAAS,KAAA,CAAM,OAAA;AAAA,QACf,MAAA,EAAQ,WAAA,CAAY,GAAA,CAAI,CAAC,IAAA,KAAS,CAAA,EAAG,IAAA,CAAK,QAAQ,CAAA,CAAA,EAAI,IAAA,CAAK,SAAS,CAAA,CAAE;AAAA;AACxE,KACF;AAAA,EACF;AACF;AAEA,SAAS,cAAc,OAAA,EAAqC;AAC1D,EAAA,OAAO,IAAI,kBAAA,CAAmB,OAAA,EAAS,gBAAgB,CAAA;AACzD;AAoCA,SAAS,qBACP,MAAA,EACgC;AAChC,EAAA,MAAM,EAAE,SAAA,EAAW,OAAA,EAAQ,GAAI,MAAA;AAC/B,EAAA,IAAI,OAAO,SAAA,KAAc,QAAA,IAAY,CAAC,kBAAA,CAAmB,SAAS,CAAA,EAAG;AACnE,IAAA,OAAO,EAAE,KAAA,EAAO,WAAA,EAAa,KAAA,EAAO,SAAA,EAAU;AAAA,EAChD;AACA,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,IAAY,CAAC,kBAAA,CAAmB,OAAO,CAAA,EAAG;AAC/D,IAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,KAAA,EAAO,OAAA,EAAQ;AAAA,EAC5C;AACA,EAAA,OAAO,MAAA;AACT;AAOA,SAAS,uBACP,QAAA,EACiE;AACjE,EAAA,KAAA,MAAW,UAAU,QAAA,EAAU;AAC7B,IAAA,MAAM,YAAA,GAAe,qBAAqB,MAAM,CAAA;AAChD,IAAA,IAAI,iBAAiB,MAAA,EAAW,OAAO,EAAE,MAAA,EAAQ,GAAG,YAAA,EAAa;AAAA,EACnE;AACA,EAAA,OAAO,MAAA;AACT;AAGA,SAAS,yBAAA,CACP,OAAA,EACA,KAAA,EACA,KAAA,EACQ;AACR,EAAA,OACE,CAAA,cAAA,EAAiB,KAAK,CAAA,oBAAA,EAAuB,OAAO,YAAY,KAAK,CAAA,8MAAA,CAAA;AAKzE;AAeA,SAAS,kBAAkB,MAAA,EAAuC;AAChE,EAAA,OAAO,wBAAA;AAAA,IACL,OAAO,SAAA,IAAa,MAAA;AAAA,IACpB,MAAA,CAAO;AAAA,GACT;AACF;AAEA,SAAS,UAAA,CAAW,SAAiB,IAAA,EAAyC;AAC5E,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,IAAI,IAAA,CAAK,EAAA;AAAA,IACT,OAAO,IAAA,CAAK,UAAA;AAAA,IACZ,GAAI,KAAK,SAAA,KAAc,MAAA,GAAY,EAAC,GAAI,EAAE,SAAA,EAAW,IAAA,CAAK,SAAA,EAAU;AAAA,IACpE,GAAI,KAAK,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA;AAAQ,GAChE;AACF;AAEA,SAAS,UAAA,CAAW,SAAiB,IAAA,EAAyC;AAC5E,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,IAAI,IAAA,CAAK,EAAA;AAAA,IACT,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,QAAA,EAAU,KAAK,IAAA,CAAK,IAAA;AAAA,IACpB,MAAA,EAAQ,KAAK,IAAA,CAAK,EAAA;AAAA,IAClB,MAAA,EAAQ,KAAK,EAAA,CAAG,IAAA;AAAA,IAChB,IAAA,EAAM,KAAK,EAAA,CAAG,EAAA;AAAA,IACd,OAAO,IAAA,CAAK,UAAA;AAAA,IACZ,GAAI,KAAK,SAAA,KAAc,MAAA,GAAY,EAAC,GAAI,EAAE,SAAA,EAAW,IAAA,CAAK,SAAA,EAAU;AAAA,IACpE,GAAI,KAAK,OAAA,KAAY,MAAA,GAAY,EAAC,GAAI,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA;AAAQ,GAChE;AACF;AAEA,eAAe,oBAAA,CACb,KAAA,EACA,OAAA,EACA,MAAA,EAE8B;AAC9B,EAAA,MAAM,YAAY,IAAI,GAAA;AAAA,IACpB,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,KAAK,CAAA,CAAE,GAAA;AAAA,MAC/B,CAAC,YAAA,KAAiB,YAAA,CAAa,IAAA,CAAK;AAAA;AACtC,GACF;AACA,EAAA,MAAM,YAAY,IAAI,GAAA;AAAA,IACpB,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,KAAK,CAAA,CAAE,GAAA;AAAA,MAC/B,CAAC,YAAA,KAAiB,YAAA,CAAa,IAAA,CAAK;AAAA;AACtC,GACF;AACA,EAAA,IAAI,cAAA,GAAiB,KAAA;AACrB,EAAA,IAAI,aAAA,GAAgB,KAAA;AACpB,EAAA,IAAI,SAAA,GAAY,CAAA;AAChB,EAAA,IAAI,SAAA,GAAY,CAAA;AAEhB,EAAA,WAAA,MAAiB,SAAS,MAAA,EAAQ;AAChC,IAAA,QAAQ,MAAM,IAAA;AAAM,MAClB,KAAK,QAAA,EAAU;AACb,QAAA,IAAI,cAAA,EAAgB;AAClB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,IAAI,KAAA,CAAM,MAAA,CAAO,QAAA,KAAa,MAAA,EAAW;AACvC,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WAEF;AAAA,QACF;AACA,QAAA,cAAA,GAAiB,IAAA;AACjB,QAAA;AAAA,MACF;AAAA,MACA,KAAK,OAAA,EAAS;AACZ,QAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,IAAI,aAAA,EAAe;AACjB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,IAAA;AAAA,UAC9B,CAAC,IAAA,KAAS,CAAC,SAAA,CAAU,GAAA,CAAI,KAAK,IAAI;AAAA,SACpC,EAAG,IAAA;AACH,QAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,UAAA,MAAM,aAAA;AAAA,YACJ,wCAAwC,WAAW,CAAA;AAAA,WACrD;AAAA,QACF;AACA,QAAA,MAAM,gBAAA,GAAmB,sBAAA,CAAuB,KAAA,CAAM,KAAK,CAAA;AAC3D,QAAA,IAAI,qBAAqB,MAAA,EAAW;AAClC,UAAA,MAAM,EAAE,MAAA,EAAQ,KAAA,EAAO,KAAA,EAAM,GAAI,gBAAA;AACjC,UAAA,MAAM,aAAA;AAAA,YACJ,yBAAA;AAAA,cACE,CAAA,EAAG,MAAA,CAAO,IAAI,CAAA,EAAA,EAAK,OAAO,EAAE,CAAA,CAAA,CAAA;AAAA,cAC5B,KAAA;AAAA,cACA;AAAA;AACF,WACF;AAAA,QACF;AACA,QAAA,MAAM,YAAA,GAAe,MAAM,KAAA,CAAM,IAAA;AAAA,UAAK,CAAC,IAAA,KACrC,iBAAA,CAAkB,IAAI;AAAA,SACxB;AACA,QAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,UAAA,MAAM,aAAA;AAAA,YACJ,CAAA,4CAAA,EAA+C,YAAA,CAAa,IAAI,CAAA,EAAA,EAAK,aAAa,EAAE,CAAA,WAAA,EAC9E,MAAA,CAAO,YAAA,CAAa,OAAO,CAAC,CAAA,yBAAA,EAA4B,MAAA,CAAO,YAAA,CAAa,SAAS,CAAC,CAAA,EAAA;AAAA,WAC9F;AAAA,QACF;AACA,QAAA,MAAM,OAAA,CAAQ,WAAA;AAAA,UACZ,KAAA,CAAM,MAAM,GAAA,CAAI,CAAC,SAAS,UAAA,CAAW,KAAA,CAAM,OAAA,EAAS,IAAI,CAAC;AAAA,SAC3D;AACA,QAAA,SAAA,IAAa,MAAM,KAAA,CAAM,MAAA;AACzB,QAAA;AAAA,MACF;AAAA,MACA,KAAK,OAAA,EAAS;AACZ,QAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,UAAA,MAAM,aAAA;AAAA,YACJ;AAAA,WACF;AAAA,QACF;AACA,QAAA,aAAA,GAAgB,IAAA;AAChB,QAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,IAAA;AAAA,UAC9B,CAAC,SACC,CAAC,SAAA,CAAU,IAAI,IAAA,CAAK,IAAI,KACxB,CAAC,SAAA,CAAU,IAAI,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA,IAC7B,CAAC,UAAU,GAAA,CAAI,IAAA,CAAK,GAAG,IAAI;AAAA,SAC/B;AACA,QAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,UAAA,MAAM,aAAA;AAAA,YACJ,CAAA,iDAAA,EAAoD,YAAY,IAAI,CAAA;AAAA,WACtE;AAAA,QACF;AACA,QAAA,MAAM,gBAAA,GAAmB,sBAAA,CAAuB,KAAA,CAAM,KAAK,CAAA;AAC3D,QAAA,IAAI,qBAAqB,MAAA,EAAW;AAClC,UAAA,MAAM,EAAE,MAAA,EAAQ,KAAA,EAAO,KAAA,EAAM,GAAI,gBAAA;AACjC,UAAA,MAAM,aAAA;AAAA,YACJ,yBAAA;AAAA,cACE,CAAA,EAAG,MAAA,CAAO,IAAI,CAAA,OAAA,EAAU,OAAO,EAAE,CAAA,CAAA,CAAA;AAAA,cACjC,KAAA;AAAA,cACA;AAAA;AACF,WACF;AAAA,QACF;AACA,QAAA,MAAM,YAAA,GAAe,MAAM,KAAA,CAAM,IAAA;AAAA,UAAK,CAAC,IAAA,KACrC,iBAAA,CAAkB,IAAI;AAAA,SACxB;AACA,QAAA,IAAI,iBAAiB,MAAA,EAAW;AAC9B,UAAA,MAAM,aAAA;AAAA,YACJ,CAAA,4CAAA,EAA+C,YAAA,CAAa,IAAI,CAAA,OAAA,EAAU,aAAa,EAAE,CAAA,WAAA,EACnF,MAAA,CAAO,YAAA,CAAa,OAAO,CAAC,CAAA,yBAAA,EAA4B,MAAA,CAAO,YAAA,CAAa,SAAS,CAAC,CAAA,EAAA;AAAA,WAC9F;AAAA,QACF;AACA,QAAA,MAAM,OAAA,CAAQ,WAAA;AAAA,UACZ,KAAA,CAAM,MAAM,GAAA,CAAI,CAAC,SAAS,UAAA,CAAW,KAAA,CAAM,OAAA,EAAS,IAAI,CAAC;AAAA,SAC3D;AACA,QAAA,SAAA,IAAa,MAAM,KAAA,CAAM,MAAA;AACzB,QAAA;AAAA,MACF;AAAA,MACA,KAAK,UAAA,EAAY;AAKf,QAAA,MAAM,aAAA;AAAA,UACJ;AAAA,SAEF;AAAA,MACF;AAAA;AACF,EACF;AAEA,EAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,IAAA,MAAM,aAAA;AAAA,MACJ;AAAA,KACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,KAAA,EAAO,SAAA,EAAU;AAC9C;AAqBA,eAAsB,wBAAA,CACpB,OACA,MAAA,EAE8B;AAC9B,EAAA,8BAAA,CAA+B,KAAK,CAAA;AACpC,EAAA,MAAM,OAAA,GAAU,aAAa,KAAK,CAAA;AAClC,EAAA,MAAM,gBAAgB,OAAA,CAAQ,aAAA;AAC9B,EAAA,IAAI,kBAAkB,MAAA,EAAW;AAC/B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,IAAA,EAAO,QAAQ,OAAO,CAAA,yCAAA,CAAA;AAAA,MACtB,qBAAA;AAAA,MACA,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA;AAAQ,KAC7B;AAAA,EACF;AAKA,EAAA,MAAM,gBACJ,MAAA,CAAO,aAAA,IAAiB,MAAA,GAAS,mBAAA,CAAoB,MAAM,CAAA,GAAI,MAAA;AACjE,EAAA,MAAM,aACJ,aAAA,KAAkB,MAAA,GAAY,MAAA,GAC5B,wBAAA,CAAyB,eAAe,OAAO,CAAA;AAEnD,EAAA,IAAI,eAAe,MAAA,EAAW;AAC5B,IAAA,MAAM,uBAAA,CAAwB;AAAA,MAC5B,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,SAAA,EAAW,eAAA;AAAA,MACX,MAAA,EAAQ,iBAAA;AAAA,MACR,QAAA,EAAU;AAAA,KACX,CAAA;AAAA,EACH;AACA,EAAA,MAAM,aAAA,GAAgB,KAAA,CAAM,UAAA,EAAW,CAAE,aAAA;AACzC,EAAA,MAAM,OAAA,GACJ,aAAA,KAAkB,MAAA,GAAY,MAAA,GAC5B;AAAA,IACE,WAAA,EAAa;AAAA,MACX,SAAS,KAAA,CAAM,OAAA;AAAA,MACf,eAAA,EAAiB;AAAA;AACnB,GACF;AAEJ,EAAA,OAAO,qBAAA;AAAA,IAAsB,KAAA;AAAA,IAAO,MAClC,aAAA;AAAA,MACE,CAAC,OAAA,KAAY,oBAAA,CAAqB,KAAA,EAAO,SAAS,MAAM,CAAA;AAAA,MACxD;AAAA;AACF,GACF;AACF;AAEA,UAAU,gBAAgB,IAAA,EAAkD;AAC1E,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAO,QAAA,EAAU,GAAG,QAAO,GAAI,IAAA;AAC9C,EAAA,MAAM;AAAA,IACJ,IAAA,EAAM,QAAA;AAAA,IACN,MAAA,EACE,QAAA,KAAa,MAAA,GAAY,MAAA,GACvB;AAAA,MACE,GAAG,MAAA;AAAA,MACH,UAAU,EAAE,OAAA,EAAS,SAAS,OAAA,EAAS,IAAA,EAAM,SAAS,IAAA;AAAK;AAC7D,GAEN;AACA,EAAA,MAAM,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAM;AAC7B,EAAA,MAAM,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAM;AAC7B,EAAA,IAAI,aAAa,MAAA,EAAW;AAC1B,IAAA,MAAM,EAAE,IAAA,EAAM,UAAA,EAAY,UAAA,EAAY,SAAS,UAAA,EAAW;AAAA,EAC5D;AACF;AAGO,SAAS,kBAAA,CACd,OACA,IAAA,EAC8B;AAC9B,EAAA,OAAO,wBAAA,CAAyB,KAAA,EAAO,eAAA,CAAgB,IAAI,CAAC,CAAA;AAC9D","file":"index.js","sourcesContent":["import { snapshotExportContention } from \"../backend/transaction-resource\";\nimport type {\n  InsertEdgeParams,\n  InsertNodeParams,\n  TrustedImportOptions,\n  TrustedImportSession,\n} from \"../backend/types\";\nimport type { GraphDef } from \"../core/define-graph\";\nimport { resolveGraphVectorSlots } from \"../core/embedding\";\nimport { getSearchableFields } from \"../core/searchable\";\nimport { TrustedImportError } from \"../errors\";\nimport { storeBackend } from \"../store/runtime-port\";\nimport type { Store } from \"../store/store\";\nimport { isCanonicalIsoDate, isInvertedValidityWindow } from \"../utils/date\";\nimport { serializedStreamRefusal, withImportStreamLease } from \"./import\";\nimport { exportStreamBackend } from \"./stream-source\";\nimport type {\n  GraphData,\n  GraphInterchangeChunk,\n  InterchangeEdge,\n  InterchangeNode,\n} from \"./types\";\n\n/** Counts committed by a trusted initial import. */\nexport type TrustedImportResult = Readonly<{\n  nodes: number;\n  edges: number;\n}>;\n\nfunction rejectUnsupportedStoreFeatures<G extends GraphDef>(\n  store: Store<G>,\n): void {\n  if (store.historyEnabled) {\n    throw new TrustedImportError(\n      \"Trusted import does not support recorded-time history capture.\",\n      \"history_unsupported\",\n      { graphId: store.graphId },\n    );\n  }\n  if (store.revisionTrackingEnabled) {\n    throw new TrustedImportError(\n      \"Trusted import does not support revision tracking.\",\n      \"revision_tracking_unsupported\",\n      { graphId: store.graphId },\n    );\n  }\n  if (store.graph.identity !== undefined) {\n    throw new TrustedImportError(\n      \"Trusted import does not maintain Operational Identity assertions or closure.\",\n      \"identity_unsupported\",\n      { graphId: store.graphId },\n    );\n  }\n\n  const uniqueKinds = Object.values(store.graph.nodes)\n    .filter((registration) => (registration.unique?.length ?? 0) > 0)\n    .map((registration) => registration.type.kind);\n  if (uniqueKinds.length > 0) {\n    throw new TrustedImportError(\n      \"Trusted import does not maintain node uniqueness sidecars.\",\n      \"uniqueness_unsupported\",\n      { graphId: store.graphId, nodeKinds: uniqueKinds },\n    );\n  }\n\n  const searchableKinds = Object.values(store.graph.nodes)\n    .filter(\n      (registration) =>\n        getSearchableFields(registration.type.schema).length > 0,\n    )\n    .map((registration) => registration.type.kind);\n  if (searchableKinds.length > 0) {\n    throw new TrustedImportError(\n      \"Trusted import does not maintain fulltext sidecars.\",\n      \"fulltext_unsupported\",\n      { graphId: store.graphId, nodeKinds: searchableKinds },\n    );\n  }\n\n  const vectorSlots = resolveGraphVectorSlots(store.graph);\n  if (vectorSlots.length > 0) {\n    throw new TrustedImportError(\n      \"Trusted import does not maintain vector sidecars.\",\n      \"vector_unsupported\",\n      {\n        graphId: store.graphId,\n        fields: vectorSlots.map((slot) => `${slot.nodeKind}.${slot.fieldPath}`),\n      },\n    );\n  }\n}\n\nfunction invalidStream(message: string): TrustedImportError {\n  return new TrustedImportError(message, \"invalid_stream\");\n}\n\n/** The stated validity window of a streamed node or edge. */\ntype StatedValidityWindow = Readonly<{\n  validFrom?: string | null | undefined;\n  validTo?: string | undefined;\n}>;\n\ntype ValidityWindowField = \"validFrom\" | \"validTo\";\n\n/** A stated window field that is not canonical, with the offending value. */\ntype NonCanonicalWindow = Readonly<{\n  field: ValidityWindowField;\n  value: string;\n}>;\n\n/**\n * The first window field of `entity` stating a timestamp that is not canonical\n * fixed-width UTC ISO 8601 — with the offending value — or `undefined` when\n * every stated one is canonical.\n *\n * A trusted stream is never re-parsed, so this is the only place its timestamps\n * are held to the format the rest of the system assumes. It is deliberately\n * format-ONLY — the same {@link isCanonicalIsoDate} decision the untrusted\n * path's schema and the store's own write validation make, and nothing more —\n * because a non-canonical instant is not merely ugly: every temporal filter\n * compares these values AS TEXT against an `asOf` coordinate, so a variable-width\n * one (`...:00.1Z`, an offset, date-only) mis-sorts and silently includes or\n * excludes the wrong rows once stored, and it would mis-decide the negative-width\n * check below on the way in. Two field tests per row costs about a microsecond\n * against the ~4µs an in-memory SQLite row already costs — the price of the\n * stream's ordering claims meaning anything.\n *\n * An absent field states nothing, and a `null` validFrom is a confirmed\n * open-left window (see {@link nodeParams}) — neither is a timestamp to check.\n */\nfunction nonCanonicalWindowOf(\n  entity: StatedValidityWindow,\n): NonCanonicalWindow | undefined {\n  const { validFrom, validTo } = entity;\n  if (typeof validFrom === \"string\" && !isCanonicalIsoDate(validFrom)) {\n    return { field: \"validFrom\", value: validFrom };\n  }\n  if (typeof validTo === \"string\" && !isCanonicalIsoDate(validTo)) {\n    return { field: \"validTo\", value: validTo };\n  }\n  return undefined;\n}\n\n/**\n * The first entity in `entities` stating a non-canonical window timestamp, with\n * the offending field and value. Allocates only on the failing path, so a clean\n * chunk pays one predicate per stated timestamp and nothing else.\n */\nfunction findNonCanonicalWindow<Entity extends StatedValidityWindow>(\n  entities: readonly Entity[],\n): (NonCanonicalWindow & Readonly<{ entity: Entity }>) | undefined {\n  for (const entity of entities) {\n    const nonCanonical = nonCanonicalWindowOf(entity);\n    if (nonCanonical !== undefined) return { entity, ...nonCanonical };\n  }\n  return undefined;\n}\n\n/** The refusal message for a non-canonical window timestamp on `subject`. */\nfunction nonCanonicalWindowMessage(\n  subject: string,\n  field: ValidityWindowField,\n  value: string,\n): string {\n  return (\n    `Non-canonical ${field} in trusted import: ${subject} states \"${value}\". ` +\n    `Expected canonical fixed-width UTC ISO 8601 (YYYY-MM-DDTHH:mm:ss.sssZ), ` +\n    `which is what makes a stored timestamp sort chronologically against an asOf ` +\n    `coordinate. Convert with new Date(value).toISOString().`\n  );\n}\n\n/**\n * An entity whose stated window has negative width. Trusted import writes\n * straight to SQL and skips schema validation for throughput, but a row that\n * stopped being true before it started is a stream SHAPE fault rather than a\n * policy check: it is unobservable at every `asOf` coordinate, and no later\n * write repairs it. `null` validFrom is a confirmed open-left window, so there\n * is no lower bound to invert against; zero width is legal (see\n * {@link isInvertedValidityWindow}).\n *\n * Only ever reached for a chunk whose timestamps {@link findNonCanonicalWindow}\n * has already accepted, which is what makes the lexicographic compare inside a\n * chronological one.\n */\nfunction hasInvertedWindow(entity: StatedValidityWindow): boolean {\n  return isInvertedValidityWindow(\n    entity.validFrom ?? undefined,\n    entity.validTo,\n  );\n}\n\nfunction nodeParams(graphId: string, node: InterchangeNode): InsertNodeParams {\n  return {\n    graphId,\n    kind: node.kind,\n    id: node.id,\n    props: node.properties,\n    ...(node.validFrom === undefined ? {} : { validFrom: node.validFrom }),\n    ...(node.validTo === undefined ? {} : { validTo: node.validTo }),\n  };\n}\n\nfunction edgeParams(graphId: string, edge: InterchangeEdge): InsertEdgeParams {\n  return {\n    graphId,\n    id: edge.id,\n    kind: edge.kind,\n    fromKind: edge.from.kind,\n    fromId: edge.from.id,\n    toKind: edge.to.kind,\n    toId: edge.to.id,\n    props: edge.properties,\n    ...(edge.validFrom === undefined ? {} : { validFrom: edge.validFrom }),\n    ...(edge.validTo === undefined ? {} : { validTo: edge.validTo }),\n  };\n}\n\nasync function consumeTrustedChunks<G extends GraphDef>(\n  store: Store<G>,\n  session: TrustedImportSession,\n  chunks:\n    AsyncIterable<GraphInterchangeChunk> | Iterable<GraphInterchangeChunk>,\n): Promise<TrustedImportResult> {\n  const nodeKinds = new Set(\n    Object.values(store.graph.nodes).map(\n      (registration) => registration.type.kind,\n    ),\n  );\n  const edgeKinds = new Set(\n    Object.values(store.graph.edges).map(\n      (registration) => registration.type.kind,\n    ),\n  );\n  let receivedHeader = false;\n  let receivedEdges = false;\n  let nodeCount = 0;\n  let edgeCount = 0;\n\n  for await (const chunk of chunks) {\n    switch (chunk.type) {\n      case \"header\": {\n        if (receivedHeader) {\n          throw invalidStream(\n            \"Trusted graph interchange stream emitted more than one header.\",\n          );\n        }\n        if (chunk.header.identity !== undefined) {\n          throw invalidStream(\n            \"Trusted graph interchange import does not support identity data. \" +\n              \"Use importGraphStream() for an identity export.\",\n          );\n        }\n        receivedHeader = true;\n        break;\n      }\n      case \"nodes\": {\n        if (!receivedHeader) {\n          throw invalidStream(\n            \"Trusted graph interchange stream must start with a header.\",\n          );\n        }\n        if (receivedEdges) {\n          throw invalidStream(\n            \"Trusted graph interchange stream cannot emit nodes after edges.\",\n          );\n        }\n        const unknownKind = chunk.nodes.find(\n          (node) => !nodeKinds.has(node.kind),\n        )?.kind;\n        if (unknownKind !== undefined) {\n          throw invalidStream(\n            `Unknown node kind in trusted import: ${unknownKind}`,\n          );\n        }\n        const nonCanonicalNode = findNonCanonicalWindow(chunk.nodes);\n        if (nonCanonicalNode !== undefined) {\n          const { entity, field, value } = nonCanonicalNode;\n          throw invalidStream(\n            nonCanonicalWindowMessage(\n              `${entity.kind} \"${entity.id}\"`,\n              field,\n              value,\n            ),\n          );\n        }\n        const invertedNode = chunk.nodes.find((node) =>\n          hasInvertedWindow(node),\n        );\n        if (invertedNode !== undefined) {\n          throw invalidStream(\n            `Inverted validity window in trusted import: ${invertedNode.kind} \"${invertedNode.id}\" ends at ` +\n              `\"${String(invertedNode.validTo)}\", before its validFrom \"${String(invertedNode.validFrom)}\".`,\n          );\n        }\n        await session.insertNodes(\n          chunk.nodes.map((node) => nodeParams(store.graphId, node)),\n        );\n        nodeCount += chunk.nodes.length;\n        break;\n      }\n      case \"edges\": {\n        if (!receivedHeader) {\n          throw invalidStream(\n            \"Trusted graph interchange stream must start with a header.\",\n          );\n        }\n        receivedEdges = true;\n        const invalidEdge = chunk.edges.find(\n          (edge) =>\n            !edgeKinds.has(edge.kind) ||\n            !nodeKinds.has(edge.from.kind) ||\n            !nodeKinds.has(edge.to.kind),\n        );\n        if (invalidEdge !== undefined) {\n          throw invalidStream(\n            `Unknown edge or endpoint kind in trusted import: ${invalidEdge.kind}`,\n          );\n        }\n        const nonCanonicalEdge = findNonCanonicalWindow(chunk.edges);\n        if (nonCanonicalEdge !== undefined) {\n          const { entity, field, value } = nonCanonicalEdge;\n          throw invalidStream(\n            nonCanonicalWindowMessage(\n              `${entity.kind} edge \"${entity.id}\"`,\n              field,\n              value,\n            ),\n          );\n        }\n        const invertedEdge = chunk.edges.find((edge) =>\n          hasInvertedWindow(edge),\n        );\n        if (invertedEdge !== undefined) {\n          throw invalidStream(\n            `Inverted validity window in trusted import: ${invertedEdge.kind} edge \"${invertedEdge.id}\" ends at ` +\n              `\"${String(invertedEdge.validTo)}\", before its validFrom \"${String(invertedEdge.validFrom)}\".`,\n          );\n        }\n        await session.insertEdges(\n          chunk.edges.map((edge) => edgeParams(store.graphId, edge)),\n        );\n        edgeCount += chunk.edges.length;\n        break;\n      }\n      case \"identity\": {\n        // The trusted session writes only the node and edge relations, so it\n        // has no way to persist assertions or materialize the derived closure.\n        // Refuse rather than drop identity truth from an identity-enabled\n        // export: `importGraph` / `importGraphStream` carry it correctly.\n        throw invalidStream(\n          \"Trusted graph interchange import does not support identity assertions. \" +\n            \"Use importGraphStream() for an export that carries identity truth.\",\n        );\n      }\n    }\n  }\n\n  if (!receivedHeader) {\n    throw invalidStream(\n      \"Trusted graph interchange stream ended before emitting a header.\",\n    );\n  }\n  return { nodes: nodeCount, edges: edgeCount };\n}\n\n/**\n * Atomically imports a header-first stream into a fresh, dedicated database.\n *\n * This is an intentionally trusted path. It checks stream ordering and kind\n * names, but it does not validate properties, references, cardinality, or\n * conflicts. The caller must guarantee those invariants. Use\n * {@link importGraphStream} for untrusted data.\n *\n * Trusted of the DATA, not of the connection: this holds ONE write transaction\n * open for the entire stream, which makes it a long-lived import holder exactly\n * like {@link importGraphStream}, and it is guarded the same way — the source\n * stream's own backend is checked against the target before the first chunk, and\n * the target connection's exclusive stream lease is held for the whole import.\n * `trustedImportGraphStream(target, exportGraphStream(source))` over one\n * serialized connection is therefore refused with the shared typed\n * {@link ConfigurationError} (codes and `details.heldBy` / `details.requested`\n * as documented on `importGraphStream`) rather than reaching the driver as a\n * nested BEGIN.\n */\nexport async function trustedImportGraphStream<G extends GraphDef>(\n  store: Store<G>,\n  chunks:\n    AsyncIterable<GraphInterchangeChunk> | Iterable<GraphInterchangeChunk>,\n): Promise<TrustedImportResult> {\n  rejectUnsupportedStoreFeatures(store);\n  const backend = storeBackend(store);\n  const trustedImport = backend.trustedImport;\n  if (trustedImport === undefined) {\n    throw new TrustedImportError(\n      `The ${backend.dialect} backend does not support trusted import.`,\n      \"backend_unsupported\",\n      { dialect: backend.dialect },\n    );\n  }\n  // The same pre-flight `importGraphStream` runs, through the same owner of\n  // \"would this export hold the connection that write needs\": a synchronous\n  // iterable was materialized by its producer and holds nothing, so only an\n  // async stream can name a source backend.\n  const sourceBackend =\n    Symbol.asyncIterator in chunks ? exportStreamBackend(chunks) : undefined;\n  const contention =\n    sourceBackend === undefined ? undefined : (\n      snapshotExportContention(sourceBackend, backend)\n    );\n  if (contention !== undefined) {\n    throw serializedStreamRefusal({\n      graphId: store.graphId,\n      requested: \"import-stream\",\n      heldBy: \"export-snapshot\",\n      detector: contention,\n    });\n  }\n  const schemaVersion = store.introspect().schemaVersion;\n  const options: TrustedImportOptions | undefined =\n    schemaVersion === undefined ? undefined : (\n      {\n        schemaWrite: {\n          graphId: store.graphId,\n          expectedVersion: schemaVersion,\n        },\n      }\n    );\n  return withImportStreamLease(store, () =>\n    trustedImport(\n      (session) => consumeTrustedChunks(store, session, chunks),\n      options,\n    ),\n  );\n}\n\nfunction* graphDataChunks(data: GraphData): Iterable<GraphInterchangeChunk> {\n  const { nodes, edges, identity, ...header } = data;\n  yield {\n    type: \"header\",\n    header:\n      identity === undefined ? header : (\n        {\n          ...header,\n          identity: { profile: identity.profile, mode: identity.mode },\n        }\n      ),\n  };\n  yield { type: \"nodes\", nodes };\n  yield { type: \"edges\", edges };\n  if (identity !== undefined) {\n    yield { type: \"identity\", assertions: identity.assertions };\n  }\n}\n\n/** In-memory convenience wrapper around {@link trustedImportGraphStream}. */\nexport function trustedImportGraph<G extends GraphDef>(\n  store: Store<G>,\n  data: GraphData,\n): Promise<TrustedImportResult> {\n  return trustedImportGraphStream(store, graphDataChunks(data));\n}\n"]}

package/dist/{manager-YoLEfcc1.d.ts → manager-CfZAimti.d.ts}

@@ -1,6 +1,5 @@
-import { d as NodeType, e as AnyEdgeType, y as SchemaVersionRow, z as GraphBackend, H as SerializedSchema } from './types-Ch9a0Dx6.js';
-import { G as GraphDef } from './define-graph-BGrJahvp.js';
-import { S as SchemaDiff } from './materialize-indexes-Bhhyb1B3.js';
+import { u as NodeType, v as AnyEdgeType, G as GraphIdentityConfig, w as SqlSchema, x as SchemaVersionRow, y as GraphBackend, z as SerializedSchema, d as GraphDef } from './types-HkveCCx0.js';
+import { S as SchemaDiff } from './materialize-indexes-BMJP6Tms.js';
 
 /**
  * KindRegistry holds precomputed closures for ontological reasoning.
@@ -10,12 +9,19 @@ import { S as SchemaDiff } from './materialize-indexes-Bhhyb1B3.js';
 declare class KindRegistry {
     readonly nodeKinds: ReadonlyMap<string, NodeType>;
     readonly edgeKinds: ReadonlyMap<string, AnyEdgeType>;
+    /**
+     * Durable graph identity capability; supplies the identity defaults for
+     * every query builder built from this registry (compile-only and
+     * store-bound).
+     */
+    readonly identity: GraphIdentityConfig | undefined;
     readonly subClassAncestors: ReadonlyMap<string, ReadonlySet<string>>;
     readonly subClassDescendants: ReadonlyMap<string, ReadonlySet<string>>;
     readonly broaderClosure: ReadonlyMap<string, ReadonlySet<string>>;
     readonly narrowerClosure: ReadonlyMap<string, ReadonlySet<string>>;
     readonly equivalenceSets: ReadonlyMap<string, ReadonlySet<string>>;
     readonly iriToKind: ReadonlyMap<string, string>;
+    readonly relatedKinds: ReadonlyMap<string, ReadonlySet<string>>;
     readonly disjointPairs: ReadonlySet<string>;
     readonly partOfClosure: ReadonlyMap<string, ReadonlySet<string>>;
     readonly hasPartClosure: ReadonlyMap<string, ReadonlySet<string>>;
@@ -29,13 +35,14 @@ declare class KindRegistry {
         narrowerClosure: ReadonlyMap<string, ReadonlySet<string>>;
         equivalenceSets: ReadonlyMap<string, ReadonlySet<string>>;
         iriToKind: ReadonlyMap<string, string>;
+        relatedKinds: ReadonlyMap<string, ReadonlySet<string>>;
         disjointPairs: ReadonlySet<string>;
         partOfClosure: ReadonlyMap<string, ReadonlySet<string>>;
         hasPartClosure: ReadonlyMap<string, ReadonlySet<string>>;
         edgeInverses: ReadonlyMap<string, string>;
         edgeImplicationsClosure: ReadonlyMap<string, ReadonlySet<string>>;
         edgeImplyingClosure: ReadonlyMap<string, ReadonlySet<string>>;
-    });
+    }, identity?: GraphIdentityConfig);
     /**
      * Checks if child is a subclass of parent (directly or transitively).
      */
@@ -81,6 +88,8 @@ declare class KindRegistry {
      * Resolves an external IRI to an internal kind name.
      */
     resolveIri(iri: string): string | undefined;
+    /** Gets directly associated kinds declared through symmetric `relatedTo`. */
+    getRelatedKinds(kind: string): readonly string[];
     /**
      * Checks if two kinds are disjoint.
      */
@@ -281,6 +290,13 @@ type SchemaManagerOptions = Readonly<{
     onBeforeMigrate?: (context: MigrationHookContext) => void | Promise<void>;
     /** Called after a safe auto-migration is applied. For observability only. */
     onAfterMigrate?: (context: MigrationHookContext) => void | Promise<void>;
+    /**
+     * The effective `SqlSchema` (custom table names) the graph's Store reads.
+     * Identity schema commits derive their mandatory closure preflight from it;
+     * the preflight itself is never accepted from callers, so it cannot be
+     * substituted or suppressed.
+     */
+    schema?: SqlSchema;
 }>;
 /**
  * Ensures the schema is initialized and up-to-date.
@@ -341,7 +357,16 @@ declare function assertSchemaCurrent<G extends GraphDef>(backend: GraphBackend,
  * @param graph - The graph definition
  * @returns The created schema version row
  */
-declare function initializeSchema<G extends GraphDef>(backend: GraphBackend, graph: G): Promise<SchemaVersionRow>;
+declare function initializeSchema<G extends GraphDef>(backend: GraphBackend, graph: G, options?: Readonly<{
+    /**
+     * The effective `SqlSchema` (custom table names) the graph's Store will
+     * read. The identity enablement preflight is always derived internally —
+     * it is deliberately not a parameter, so no caller can commit version 1
+     * of an identity-enabled graph without the fold scan, contradiction
+     * validation, and closure build.
+     */
+    schema?: SqlSchema;
+}>): Promise<SchemaVersionRow>;
 type MigrateSchemaOptions = Readonly<{
     /**
      * Commit even when a dropped kind still holds rows.
@@ -363,6 +388,12 @@ type MigrateSchemaOptions = Readonly<{
      * @defaultValue false
      */
     discardDroppedKindRows?: boolean;
+    /**
+     * The effective `SqlSchema` (custom table names) the graph's Store reads.
+     * The identity closure preflight an identity-enabled migration commits is
+     * derived from it and cannot be substituted by callers.
+     */
+    schema?: SqlSchema;
 }>;
 /**
  * Migrates the schema to match the current graph definition.

package/dist/{manager-KS7CGQQT.d.cts → manager-HGk6E_HW.d.cts}

@@ -1,6 +1,5 @@
-import { d as NodeType, e as AnyEdgeType, y as SchemaVersionRow, z as GraphBackend, H as SerializedSchema } from './types-Ch9a0Dx6.cjs';
-import { G as GraphDef } from './define-graph-alREY2wj.cjs';
-import { S as SchemaDiff } from './materialize-indexes-OHRWypW6.cjs';
+import { u as NodeType, v as AnyEdgeType, G as GraphIdentityConfig, w as SqlSchema, x as SchemaVersionRow, y as GraphBackend, z as SerializedSchema, d as GraphDef } from './types-HkveCCx0.cjs';
+import { S as SchemaDiff } from './materialize-indexes-6A7dWGtb.cjs';
 
 /**
  * KindRegistry holds precomputed closures for ontological reasoning.
@@ -10,12 +9,19 @@ import { S as SchemaDiff } from './materialize-indexes-OHRWypW6.cjs';
 declare class KindRegistry {
     readonly nodeKinds: ReadonlyMap<string, NodeType>;
     readonly edgeKinds: ReadonlyMap<string, AnyEdgeType>;
+    /**
+     * Durable graph identity capability; supplies the identity defaults for
+     * every query builder built from this registry (compile-only and
+     * store-bound).
+     */
+    readonly identity: GraphIdentityConfig | undefined;
     readonly subClassAncestors: ReadonlyMap<string, ReadonlySet<string>>;
     readonly subClassDescendants: ReadonlyMap<string, ReadonlySet<string>>;
     readonly broaderClosure: ReadonlyMap<string, ReadonlySet<string>>;
     readonly narrowerClosure: ReadonlyMap<string, ReadonlySet<string>>;
     readonly equivalenceSets: ReadonlyMap<string, ReadonlySet<string>>;
     readonly iriToKind: ReadonlyMap<string, string>;
+    readonly relatedKinds: ReadonlyMap<string, ReadonlySet<string>>;
     readonly disjointPairs: ReadonlySet<string>;
     readonly partOfClosure: ReadonlyMap<string, ReadonlySet<string>>;
     readonly hasPartClosure: ReadonlyMap<string, ReadonlySet<string>>;
@@ -29,13 +35,14 @@ declare class KindRegistry {
         narrowerClosure: ReadonlyMap<string, ReadonlySet<string>>;
         equivalenceSets: ReadonlyMap<string, ReadonlySet<string>>;
         iriToKind: ReadonlyMap<string, string>;
+        relatedKinds: ReadonlyMap<string, ReadonlySet<string>>;
         disjointPairs: ReadonlySet<string>;
         partOfClosure: ReadonlyMap<string, ReadonlySet<string>>;
         hasPartClosure: ReadonlyMap<string, ReadonlySet<string>>;
         edgeInverses: ReadonlyMap<string, string>;
         edgeImplicationsClosure: ReadonlyMap<string, ReadonlySet<string>>;
         edgeImplyingClosure: ReadonlyMap<string, ReadonlySet<string>>;
-    });
+    }, identity?: GraphIdentityConfig);
     /**
      * Checks if child is a subclass of parent (directly or transitively).
      */
@@ -81,6 +88,8 @@ declare class KindRegistry {
      * Resolves an external IRI to an internal kind name.
      */
     resolveIri(iri: string): string | undefined;
+    /** Gets directly associated kinds declared through symmetric `relatedTo`. */
+    getRelatedKinds(kind: string): readonly string[];
     /**
      * Checks if two kinds are disjoint.
      */
@@ -281,6 +290,13 @@ type SchemaManagerOptions = Readonly<{
     onBeforeMigrate?: (context: MigrationHookContext) => void | Promise<void>;
     /** Called after a safe auto-migration is applied. For observability only. */
     onAfterMigrate?: (context: MigrationHookContext) => void | Promise<void>;
+    /**
+     * The effective `SqlSchema` (custom table names) the graph's Store reads.
+     * Identity schema commits derive their mandatory closure preflight from it;
+     * the preflight itself is never accepted from callers, so it cannot be
+     * substituted or suppressed.
+     */
+    schema?: SqlSchema;
 }>;
 /**
  * Ensures the schema is initialized and up-to-date.
@@ -341,7 +357,16 @@ declare function assertSchemaCurrent<G extends GraphDef>(backend: GraphBackend,
  * @param graph - The graph definition
  * @returns The created schema version row
  */
-declare function initializeSchema<G extends GraphDef>(backend: GraphBackend, graph: G): Promise<SchemaVersionRow>;
+declare function initializeSchema<G extends GraphDef>(backend: GraphBackend, graph: G, options?: Readonly<{
+    /**
+     * The effective `SqlSchema` (custom table names) the graph's Store will
+     * read. The identity enablement preflight is always derived internally —
+     * it is deliberately not a parameter, so no caller can commit version 1
+     * of an identity-enabled graph without the fold scan, contradiction
+     * validation, and closure build.
+     */
+    schema?: SqlSchema;
+}>): Promise<SchemaVersionRow>;
 type MigrateSchemaOptions = Readonly<{
     /**
      * Commit even when a dropped kind still holds rows.
@@ -363,6 +388,12 @@ type MigrateSchemaOptions = Readonly<{
      * @defaultValue false
      */
     discardDroppedKindRows?: boolean;
+    /**
+     * The effective `SqlSchema` (custom table names) the graph's Store reads.
+     * The identity closure preflight an identity-enabled migration commits is
+     * derived from it and cannot be substituted by callers.
+     */
+    schema?: SqlSchema;
 }>;
 /**
  * Migrates the schema to match the current graph definition.

package/dist/{materialize-indexes-Bhhyb1B3.d.ts → materialize-indexes-6A7dWGtb.d.cts}

@@ -1,4 +1,4 @@
-import { L as SerializedNodeDef, M as SerializedEdgeDef, P as IndexEntity, I as IndexDeclaration, H as SerializedSchema } from './types-Ch9a0Dx6.js';
+import { D as SerializedNodeDef, H as SerializedEdgeDef, L as IndexEntity, I as IndexDeclaration, z as SerializedSchema } from './types-HkveCCx0.cjs';
 
 /**
  * Schema migration utilities.
@@ -47,6 +47,12 @@ type OntologyChange = Readonly<{
     severity: ChangeSeverity;
     details: string;
 }>;
+/** A durable graph-level Operational Identity capability change. */
+type IdentityChange = Readonly<{
+    type: ChangeType;
+    severity: ChangeSeverity;
+    details: string;
+}>;
 /**
  * A change to an index declaration.
  *
@@ -109,6 +115,8 @@ type SchemaDiff = Readonly<{
     edges: readonly EdgeChange[];
     /** Changes to ontology */
     ontology: readonly OntologyChange[];
+    /** Change to the graph-level identity capability, if any. */
+    identity?: IdentityChange;
     /** Changes to index declarations */
     indexes: readonly IndexChange[];
     /**
@@ -255,4 +263,4 @@ type MaterializeSystemIndexesOptions = Readonly<{
     refreshStatistics?: boolean;
 }>;
 
-export { type ChangeSeverity as C, type DeprecatedKindsChange as D, type EdgeChange as E, type IndexChange as I, type MaterializeIndexesResult as M, type NodeChange as N, type OntologyChange as O, type SchemaDiff as S, type ChangeType as a, type ExtensionChange as b, type SchemaChangeClassification as c, classifySchemaChanges as d, computeSchemaDiff as e, type MaterializeIndexesEntry as f, getMigrationActions as g, type MaterializeIndexesOptions as h, isBackwardsCompatible as i, type MaterializeSystemIndexesOptions as j };
+export { type ChangeSeverity as C, type DeprecatedKindsChange as D, type EdgeChange as E, type IdentityChange as I, type MaterializeIndexesResult as M, type NodeChange as N, type OntologyChange as O, type SchemaDiff as S, type ChangeType as a, type ExtensionChange as b, type IndexChange as c, type SchemaChangeClassification as d, classifySchemaChanges as e, computeSchemaDiff as f, getMigrationActions as g, type MaterializeIndexesEntry as h, isBackwardsCompatible as i, type MaterializeIndexesOptions as j, type MaterializeSystemIndexesOptions as k };

package/dist/{materialize-indexes-OHRWypW6.d.cts → materialize-indexes-BMJP6Tms.d.ts}

@@ -1,4 +1,4 @@
-import { L as SerializedNodeDef, M as SerializedEdgeDef, P as IndexEntity, I as IndexDeclaration, H as SerializedSchema } from './types-Ch9a0Dx6.cjs';
+import { D as SerializedNodeDef, H as SerializedEdgeDef, L as IndexEntity, I as IndexDeclaration, z as SerializedSchema } from './types-HkveCCx0.js';
 
 /**
  * Schema migration utilities.
@@ -47,6 +47,12 @@ type OntologyChange = Readonly<{
     severity: ChangeSeverity;
     details: string;
 }>;
+/** A durable graph-level Operational Identity capability change. */
+type IdentityChange = Readonly<{
+    type: ChangeType;
+    severity: ChangeSeverity;
+    details: string;
+}>;
 /**
  * A change to an index declaration.
  *
@@ -109,6 +115,8 @@ type SchemaDiff = Readonly<{
     edges: readonly EdgeChange[];
     /** Changes to ontology */
     ontology: readonly OntologyChange[];
+    /** Change to the graph-level identity capability, if any. */
+    identity?: IdentityChange;
     /** Changes to index declarations */
     indexes: readonly IndexChange[];
     /**
@@ -255,4 +263,4 @@ type MaterializeSystemIndexesOptions = Readonly<{
     refreshStatistics?: boolean;
 }>;
 
-export { type ChangeSeverity as C, type DeprecatedKindsChange as D, type EdgeChange as E, type IndexChange as I, type MaterializeIndexesResult as M, type NodeChange as N, type OntologyChange as O, type SchemaDiff as S, type ChangeType as a, type ExtensionChange as b, type SchemaChangeClassification as c, classifySchemaChanges as d, computeSchemaDiff as e, type MaterializeIndexesEntry as f, getMigrationActions as g, type MaterializeIndexesOptions as h, isBackwardsCompatible as i, type MaterializeSystemIndexesOptions as j };
+export { type ChangeSeverity as C, type DeprecatedKindsChange as D, type EdgeChange as E, type IdentityChange as I, type MaterializeIndexesResult as M, type NodeChange as N, type OntologyChange as O, type SchemaDiff as S, type ChangeType as a, type ExtensionChange as b, type IndexChange as c, type SchemaChangeClassification as d, classifySchemaChanges as e, computeSchemaDiff as f, getMigrationActions as g, type MaterializeIndexesEntry as h, isBackwardsCompatible as i, type MaterializeIndexesOptions as j, type MaterializeSystemIndexesOptions as k };