@nicia-ai/typegraph 0.55.0 → 0.56.0

package/dist/{chunk-KZ6OHFDV.js.map → chunk-F2S5JWCT.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/schema/deserializer.ts","../src/schema/graph-templates.ts"],"names":[],"mappings":";;;;;;AAqFO,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;AAAA;AAAA;AAAA;AAAA,IAMpB,OAAA,EAAS,CAAC,IAAA,KACR,SAAA,CAAU,MAAA,CAAO,KAAA,EAAO,IAAI,CAAA,GAAI,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,MAAA;AAAA,IACvD,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KACR,SAAA,CAAU,MAAA,CAAO,KAAA,EAAO,IAAI,CAAA,GAAI,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,MAAA;AAAA,IACvD,cAAc,MAAM,SAAA;AAAA,IAEpB,WAAA,EAAa,CAAC,IAAA,KACZ,SAAA,CAAU,MAAA,CAAO,QAAA,CAAS,SAAA,EAAW,IAAI,CAAA,GACvC,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA,GAC9B,MAAA;AAAA,IACJ,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,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,0BAAA,CAA2B,MAAM;AAAA,GACxD;AACF;AAYA,SAAS,2BAA2B,MAAA,EAAwC;AAE1E,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAsB;AAC5C,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAyB;AAC/C,EAAA,OAAO,0BAAA,CAA2B;AAAA,IAChC,SAAA;AAAA,IACA,SAAA;AAAA,IACA,QAAA,EAAU,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,GAAA;AAAA,MAClC,CAAC,QAAA,MAAqC;AAAA,QACpC,UAAU,QAAA,CAAS,QAAA;AAAA,QACnB,MAAM,QAAA,CAAS,IAAA;AAAA,QACf,IAAI,QAAA,CAAS;AAAA,OACf;AAAA,KACF;AAAA,IACA,aAAA,EAAe,sBAAA,CAAuB,MAAA,CAAO,KAAK,CAAA;AAAA,IAClD,GAAI,OAAO,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAU,MAAA,CAAO,QAAA;AAAS,GACtE,CAAA;AACH;AASA,SAAS,uBACP,KAAA,EACwC;AACxC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAA+B;AAClD,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC/C,IAAA,MAAM,QAAwC,EAAC;AAC/C,IAAA,IAAI,GAAA,CAAI,wBAAwB,MAAA,EAAW;AACzC,MAAA,KAAA,MAAW,QAAA,IAAY,IAAI,SAAA,EAAW;AACpC,QAAA,KAAA,MAAW,MAAA,IAAU,IAAI,OAAA,EAAS;AAChC,UAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,EAAA,EAAI,QAAQ,CAAA;AAAA,QAC3C;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,KAAA,MAAW,CAAC,UAAA,EAAY,WAAW,CAAA,IAAK,MAAA,CAAO,OAAA;AAAA,QAC7C,GAAA,CAAI;AAAA,OACN,EAAG;AACD,QAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,UAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,UAAA,EAAY,EAAA,EAAI,YAAY,CAAA;AAAA,QACjD;AAAA,MACF;AAAA,IACF;AACA,IAAA,MAAA,CAAO,IAAI,IAAA,EAAM;AAAA,MACf,MAAM,GAAA,CAAI,SAAA;AAAA,MACV,IAAI,GAAA,CAAI,OAAA;AAAA,MACR;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,OAAO,MAAA;AACT;;;ACrKA,eAAsB,qBAAA,CACpB,SACA,MAAA,EAC2B;AAC3B,EAAA,MAAM,WAAW,OAAA,CAAQ,qBAAA;AACzB,EAAA,IAAI,QAAA,KAAa,MAAA,EAAW,MAAM,8BAAA,CAA+B,OAAO,CAAA;AACxE,EAAA,MAAM,QAAQ,uBAAA,IAA0B;AACxC,EAAA,MAAM,EAAE,YAAW,GAAI,MAAA;AACvB,EAAA,IAAI,UAAA,CAAW,OAAA,KAAY,MAAA,IAAa,UAAA,CAAW,SAAS,MAAA,EAAW;AACrE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,iFAAA;AAAA,MACA,EAAE,MAAM,2CAAA;AAA4C,KACtD;AAAA,EACF;AACA,EAAA,IACE,uBAAA,CAAwB,UAAA,CAAW,KAAK,CAAA,CAAE,MAAA,GAAS,KACnD,OAAA,CAAQ,YAAA,CAAa,MAAA,EAAQ,SAAA,KAAc,IAAA,EAC3C;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gIAAA;AAAA,MACA;AAAA,QACE,IAAA,EAAM,mCAAA;AAAA,QACN,OAAA,EAAS,WAAW,KAAA,CAAM;AAAA,OAC5B;AAAA,MACA;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,MAAM,cAAA,GAAiB,eAAA,CAAgB,UAAA,CAAW,KAAA,EAAO,WAAW,OAAO,CAAA;AAC3E,EAAA,MAAM,UAAA,GAAa,MAAM,iBAAA,CAAkB,cAAc,CAAA;AACzD,EAAA,IAAI,UAAA,KAAe,WAAW,IAAA,EAAM;AAClC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,2DAAA;AAAA,MACA,EAAE,MAAM,yCAAA;AAA0C,KACpD;AAAA,EACF;AACA,EAAA,MAAM,QAAA,CAAS;AAAA,IACb,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,UAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACZ,CAAA;AACD,EAAA,OAAO,OAAO,MAAA,CAAO;AAAA,IACnB,IAAI,MAAA,CAAO,UAAA;AAAA,IACX,UAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAOA,eAAsB,wBAAA,CACpB,SACA,MAAA,EAC4C;AAC5C,EAAA,MAAM,cAAc,OAAA,CAAQ,wBAAA;AAC5B,EAAA,IAAI,WAAA,KAAgB,MAAA,EAAW,MAAM,8BAAA,CAA+B,OAAO,CAAA;AAC3E,EAAA,MAAM,QAAQ,uBAAA,IAA0B;AACxC,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,OAAA;AACjD,EAAA,MAAM,cAAA,GAAiB,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,IAAA;AAClD,EAAA,IAAI,aAAA,KAAkB,MAAA,IAAa,cAAA,KAAmB,MAAA,EAAW;AAC/D,IAAA,MAAM,gCAAA,CAAiC,MAAA,CAAO,QAAA,CAAS,EAAE,CAAA;AAAA,EAC3D;AACA,EAAA,MAAM,aAAa,MAAM,iBAAA;AAAA,IACvB,eAAA,CAAgB,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,OAAO,aAAa;AAAA,GACjE;AACA,EAAA,IACE,eAAe,MAAA,CAAO,QAAA,CAAS,cAC/B,cAAA,KAAmB,MAAA,CAAO,SAAS,UAAA,EACnC;AACA,IAAA,MAAM,gCAAA,CAAiC,MAAA,CAAO,QAAA,CAAS,EAAE,CAAA;AAAA,EAC3D;AACA,EAAA,MAAM,WAAA,GAAiB,OAAO,MAAA,CAAO;AAAA,IACnC,GAAG,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,KAAA;AAAA,IAC9B,IAAI,MAAA,CAAO;AAAA,GACZ,CAAA;AACD,EAAA,MAAM,aAAa,MAAM,iBAAA,CAAkB,eAAA,CAAgB,WAAA,EAAa,CAAC,CAAC,CAAA;AAC1E,EAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY;AAAA,IAC/B,UAAA,EAAY,OAAO,QAAA,CAAS,EAAA;AAAA,IAC5B,kBAAA,EAAoB,OAAO,QAAA,CAAS,UAAA;AAAA,IACpC,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,UAAA,EAAY;AAAA,GACb,CAAA;AACD,EAAA,IAAI,MAAA,CAAO,WAAW,SAAA,EAAW;AAC/B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,oDAAA,EAAuD,OAAO,OAAO,CAAA,2EAAA,CAAA;AAAA,MACrE;AAAA,QACE,IAAA,EAAM,sCAAA;AAAA,QACN,SAAS,MAAA,CAAO,OAAA;AAAA,QAChB,UAAA,EAAY,OAAO,QAAA,CAAS;AAAA;AAC9B,KACF;AAAA,EACF;AACA,EAAA,IACE,MAAA,CAAO,GAAA,CAAI,QAAA,KAAa,MAAA,CAAO,OAAA,IAC/B,MAAA,CAAO,GAAA,CAAI,OAAA,KAAY,CAAA,IACvB,MAAA,CAAO,GAAA,CAAI,WAAA,KAAgB,UAAA,EAC3B;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wFAAA;AAAA,MACA,EAAE,IAAA,EAAM,+BAAA,EAAiC,OAAA,EAAS,OAAO,OAAA;AAAQ,KACnE;AAAA,EACF;AACA,EAAA,OAAO,OAAO,MAAA,CAAO;AAAA,IACnB,MAAA,EAAQ,OAAA;AAAA,IACR,UAAA,EAAY,OAAO,MAAA,CAAO;AAAA,MACxB,KAAA,EAAO,WAAA;AAAA,MACP,OAAA,EAAS,OAAO,GAAA,CAAI,OAAA;AAAA,MACpB,IAAA,EAAM,OAAO,GAAA,CAAI;AAAA,KAClB,CAAA;AAAA,IACD,QAAQ,MAAA,CAAO;AAAA,GAChB,CAAA;AACH;AAEA,SAAS,iCACP,UAAA,EACoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,0BAA0B,UAAU,CAAA,gDAAA,CAAA;AAAA,IACpC,EAAE,IAAA,EAAM,gCAAA,EAAkC,UAAA;AAAW,GACvD;AACF;AAGO,SAAS,gBAAA,CACd,SACA,MAAA,EAC4C;AAC5C,EAAA,OAAO,wBAAA,CAAyB,SAAS,MAAM,CAAA;AACjD;AAEA,SAAS,+BACP,OAAA,EACoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,CAAA,IAAA,EAAO,QAAQ,OAAO,CAAA,kDAAA,CAAA;AAAA,IACtB,EAAE,IAAA,EAAM,6BAAA,EAA+B,OAAA,EAAS,QAAQ,OAAA;AAAQ,GAClE;AACF","file":"chunk-KZ6OHFDV.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 { type AnyEdgeType, type NodeType } from \"../core/types\";\nimport { type NamedOntologyRelation } from \"../ontology/validation\";\nimport { buildValidatedKindRegistry } from \"../registry/build-validated\";\nimport type { KindRegistry } from \"../registry/kind-registry\";\nimport { type EdgeEndpointKinds } from \"../registry/validate-implies\";\nimport { hasOwnKey } from \"../utils/object\";\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 durable TypeGraph Identity Profile configuration. */\n  getIdentity: () => SerializedSchema[\"identity\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a validated KindRegistry by recomputing closures from relations */\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    // Own-key reads, for the same reason {@link buildEdgeEndpointKinds} below\n    // uses a `Map`: `schema` is parsed out of a stored JSON document and the\n    // caller supplies the name, so a raw read hands back an `Object.prototype`\n    // member typed as a definition for any name no kind is registered under.\n    getNode: (name) =>\n      hasOwnKey(schema.nodes, name) ? schema.nodes[name] : undefined,\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) =>\n      hasOwnKey(schema.edges, name) ? schema.edges[name] : undefined,\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) =>\n      hasOwnKey(schema.ontology.metaEdges, name) ?\n        schema.ontology.metaEdges[name]\n      : undefined,\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getIdentity: () => schema.identity,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromRelations(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized relations.\n *\n * Persisted closures are a legacy inspection artifact. Relations are validated\n * and closures are recomputed so old schemas gain current hardening rules.\n */\nfunction buildRegistryFromRelations(schema: SerializedSchema): KindRegistry {\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map<string, NodeType>();\n  const edgeKinds = new Map<string, AnyEdgeType>();\n  return buildValidatedKindRegistry({\n    nodeKinds,\n    edgeKinds,\n    ontology: schema.ontology.relations.map(\n      (relation): NamedOntologyRelation => ({\n        metaEdge: relation.metaEdge,\n        from: relation.from,\n        to: relation.to,\n      }),\n    ),\n    edgeEndpoints: buildEdgeEndpointKinds(schema.edges),\n    ...(schema.identity === undefined ? {} : { identity: schema.identity }),\n  });\n}\n\n/**\n * Maps each edge kind's serialized definition to its domain/range kind\n * names, for `validateImpliesEndpointCompatibility`. A `Map` (rather than\n * the plain `schema.edges` object) so a lookup for an edge kind literally\n * named \"toString\" or another `Object.prototype` member can't resolve to\n * an inherited member instead of `undefined`.\n */\nfunction buildEdgeEndpointKinds(\n  edges: Record<string, SerializedEdgeDef>,\n): ReadonlyMap<string, EdgeEndpointKinds> {\n  const result = new Map<string, EdgeEndpointKinds>();\n  for (const [kind, def] of Object.entries(edges)) {\n    const pairs: { from: string; to: string }[] = [];\n    if (def.targetKindsBySource === undefined) {\n      for (const fromKind of def.fromKinds) {\n        for (const toKind of def.toKinds) {\n          pairs.push({ from: fromKind, to: toKind });\n        }\n      }\n    } else {\n      for (const [sourceKind, targetKinds] of Object.entries(\n        def.targetKindsBySource,\n      )) {\n        for (const targetKind of targetKinds) {\n          pairs.push({ from: sourceKind, to: targetKind });\n        }\n      }\n    }\n    result.set(kind, {\n      from: def.fromKinds,\n      to: def.toKinds,\n      pairs,\n    });\n  }\n  return result;\n}\n","import type { GraphBackend, SchemaVersionRow } from \"../backend/types\";\nimport { type GraphDef } from \"../core/define-graph\";\nimport { resolveGraphVectorSlots } from \"../core/embedding\";\nimport { ConfigurationError } from \"../errors\";\nimport { type ReconciledSchema } from \"../store/store\";\nimport { computeSchemaHash, serializeSchema } from \"./serializer\";\n\n/** A locally held handle for a durable server-side graph template. */\nexport type GraphTemplate<G extends GraphDef> = Readonly<{\n  id: string;\n  reconciled: ReconciledSchema<G>;\n  schemaHash: string;\n}>;\n\nexport type InstantiateGraphTemplateResult<G extends GraphDef> = Readonly<{\n  status: \"ready\";\n  reconciled: ReconciledSchema<G>;\n  schema: SchemaVersionRow;\n}>;\n\n/**\n * Registers the fully materialized shape of a verified store as a durable\n * template. The original schema version is retained only as snapshot\n * provenance: every instantiated graph starts at v1 with that final shape.\n */\nexport async function registerGraphTemplate<G extends GraphDef>(\n  backend: GraphBackend,\n  params: Readonly<{ templateId: string; reconciled: ReconciledSchema<G> }>,\n): Promise<GraphTemplate<G>> {\n  const register = backend.registerGraphTemplate;\n  if (register === undefined) throw graphTemplatesUnsupportedError(backend);\n  await backend.assertBaseSchemaCurrent?.();\n  const { reconciled } = params;\n  if (reconciled.version === undefined || reconciled.hash === undefined) {\n    throw new ConfigurationError(\n      \"A graph template requires a reconciled schema from a managed or verified Store.\",\n      { code: \"GRAPH_TEMPLATE_REQUIRES_RECONCILED_SCHEMA\" },\n    );\n  }\n  if (\n    resolveGraphVectorSlots(reconciled.graph).length > 0 &&\n    backend.capabilities.vector?.supported === true\n  ) {\n    throw new ConfigurationError(\n      \"Graph templates do not support embedding fields because vector storage is graph-scoped and cannot be instantiated schema-only.\",\n      {\n        code: \"GRAPH_TEMPLATE_VECTOR_UNSUPPORTED\",\n        graphId: reconciled.graph.id,\n      },\n      {\n        suggestion:\n          \"Provision the graph through createStoreWithSchema until template instantiation can atomically materialize vector contributions.\",\n      },\n    );\n  }\n  const schemaDocument = serializeSchema(reconciled.graph, reconciled.version);\n  const schemaHash = await computeSchemaHash(schemaDocument);\n  if (schemaHash !== reconciled.hash) {\n    throw new ConfigurationError(\n      \"Reconciled schema hash does not match its graph snapshot.\",\n      { code: \"GRAPH_TEMPLATE_RECONCILED_HASH_MISMATCH\" },\n    );\n  }\n  await register({\n    templateId: params.templateId,\n    schemaHash,\n    schemaDoc: schemaDocument,\n  });\n  return Object.freeze({\n    id: params.templateId,\n    reconciled,\n    schemaHash,\n  });\n}\n\n/**\n * Instantiates the template's final graph shape as target schema v1. Only the\n * target hash crosses the wire; the durable source document stays in the\n * backend template registry and is rebound to `graphId` by one SQL statement.\n */\nexport async function instantiateGraphTemplate<G extends GraphDef>(\n  backend: GraphBackend,\n  params: Readonly<{ template: GraphTemplate<G>; graphId: string }>,\n): Promise<InstantiateGraphTemplateResult<G>> {\n  const instantiate = backend.instantiateGraphTemplate;\n  if (instantiate === undefined) throw graphTemplatesUnsupportedError(backend);\n  await backend.assertBaseSchemaCurrent?.();\n  const sourceVersion = params.template.reconciled.version;\n  const reconciledHash = params.template.reconciled.hash;\n  if (sourceVersion === undefined || reconciledHash === undefined) {\n    throw graphTemplateHandleMismatchError(params.template.id);\n  }\n  const sourceHash = await computeSchemaHash(\n    serializeSchema(params.template.reconciled.graph, sourceVersion),\n  );\n  if (\n    sourceHash !== params.template.schemaHash ||\n    reconciledHash !== params.template.schemaHash\n  ) {\n    throw graphTemplateHandleMismatchError(params.template.id);\n  }\n  const targetGraph: G = Object.freeze({\n    ...params.template.reconciled.graph,\n    id: params.graphId,\n  });\n  const targetHash = await computeSchemaHash(serializeSchema(targetGraph, 1));\n  const result = await instantiate({\n    templateId: params.template.id,\n    templateSchemaHash: params.template.schemaHash,\n    graphId: params.graphId,\n    schemaHash: targetHash,\n  });\n  if (result.status === \"refused\") {\n    throw new ConfigurationError(\n      `Graph template instantiation was refused for graph \"${params.graphId}\". The template may be absent, or the graph already has a different schema.`,\n      {\n        code: \"GRAPH_TEMPLATE_INSTANTIATION_REFUSED\",\n        graphId: params.graphId,\n        templateId: params.template.id,\n      },\n    );\n  }\n  if (\n    result.row.graph_id !== params.graphId ||\n    result.row.version !== 1 ||\n    result.row.schema_hash !== targetHash\n  ) {\n    throw new ConfigurationError(\n      \"Graph template backend returned a schema row that does not match the requested target.\",\n      { code: \"GRAPH_TEMPLATE_INVALID_RESULT\", graphId: params.graphId },\n    );\n  }\n  return Object.freeze({\n    status: \"ready\",\n    reconciled: Object.freeze({\n      graph: targetGraph,\n      version: result.row.version,\n      hash: result.row.schema_hash,\n    }),\n    schema: result.row,\n  });\n}\n\nfunction graphTemplateHandleMismatchError(\n  templateId: string,\n): ConfigurationError {\n  return new ConfigurationError(\n    `Graph template handle \"${templateId}\" does not match its reconciled schema snapshot.`,\n    { code: \"GRAPH_TEMPLATE_HANDLE_MISMATCH\", templateId },\n  );\n}\n\n/** Short public name for {@link instantiateGraphTemplate}. */\nexport function instantiateGraph<G extends GraphDef>(\n  backend: GraphBackend,\n  params: Readonly<{ template: GraphTemplate<G>; graphId: string }>,\n): Promise<InstantiateGraphTemplateResult<G>> {\n  return instantiateGraphTemplate(backend, params);\n}\n\nfunction graphTemplatesUnsupportedError(\n  backend: GraphBackend,\n): ConfigurationError {\n  return new ConfigurationError(\n    `The ${backend.dialect} backend does not support durable graph templates.`,\n    { code: \"GRAPH_TEMPLATES_UNSUPPORTED\", dialect: backend.dialect },\n  );\n}\n"]}
+{"version":3,"sources":["../src/schema/deserializer.ts","../src/schema/graph-templates.ts"],"names":[],"mappings":";;;;;;AAqFO,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;AAAA;AAAA;AAAA;AAAA,IAMpB,OAAA,EAAS,CAAC,IAAA,KACR,SAAA,CAAU,MAAA,CAAO,KAAA,EAAO,IAAI,CAAA,GAAI,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,MAAA;AAAA,IACvD,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KACR,SAAA,CAAU,MAAA,CAAO,KAAA,EAAO,IAAI,CAAA,GAAI,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,GAAI,MAAA;AAAA,IACvD,cAAc,MAAM,SAAA;AAAA,IAEpB,WAAA,EAAa,CAAC,IAAA,KACZ,SAAA,CAAU,MAAA,CAAO,QAAA,CAAS,SAAA,EAAW,IAAI,CAAA,GACvC,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,IAAI,CAAA,GAC9B,MAAA;AAAA,IACJ,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,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,0BAAA,CAA2B,MAAM;AAAA,GACxD;AACF;AAYA,SAAS,2BAA2B,MAAA,EAAwC;AAE1E,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAsB;AAC5C,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAyB;AAC/C,EAAA,OAAO,0BAAA,CAA2B;AAAA,IAChC,SAAA;AAAA,IACA,SAAA;AAAA,IACA,QAAA,EAAU,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,GAAA;AAAA,MAClC,CAAC,QAAA,MAAqC;AAAA,QACpC,UAAU,QAAA,CAAS,QAAA;AAAA,QACnB,MAAM,QAAA,CAAS,IAAA;AAAA,QACf,IAAI,QAAA,CAAS;AAAA,OACf;AAAA,KACF;AAAA,IACA,aAAA,EAAe,sBAAA,CAAuB,MAAA,CAAO,KAAK,CAAA;AAAA,IAClD,GAAI,OAAO,QAAA,KAAa,MAAA,GAAY,EAAC,GAAI,EAAE,QAAA,EAAU,MAAA,CAAO,QAAA;AAAS,GACtE,CAAA;AACH;AASA,SAAS,uBACP,KAAA,EACwC;AACxC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAA+B;AAClD,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,GAAG,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC/C,IAAA,MAAM,QAAwC,EAAC;AAC/C,IAAA,IAAI,GAAA,CAAI,wBAAwB,MAAA,EAAW;AACzC,MAAA,KAAA,MAAW,QAAA,IAAY,IAAI,SAAA,EAAW;AACpC,QAAA,KAAA,MAAW,MAAA,IAAU,IAAI,OAAA,EAAS;AAChC,UAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,EAAA,EAAI,QAAQ,CAAA;AAAA,QAC3C;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,KAAA,MAAW,CAAC,UAAA,EAAY,WAAW,CAAA,IAAK,MAAA,CAAO,OAAA;AAAA,QAC7C,GAAA,CAAI;AAAA,OACN,EAAG;AACD,QAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,UAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,UAAA,EAAY,EAAA,EAAI,YAAY,CAAA;AAAA,QACjD;AAAA,MACF;AAAA,IACF;AACA,IAAA,MAAA,CAAO,IAAI,IAAA,EAAM;AAAA,MACf,MAAM,GAAA,CAAI,SAAA;AAAA,MACV,IAAI,GAAA,CAAI,OAAA;AAAA,MACR;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,OAAO,MAAA;AACT;;;ACrKA,eAAsB,qBAAA,CACpB,SACA,MAAA,EAC2B;AAC3B,EAAA,MAAM,WAAW,OAAA,CAAQ,qBAAA;AACzB,EAAA,IAAI,QAAA,KAAa,MAAA,EAAW,MAAM,8BAAA,CAA+B,OAAO,CAAA;AACxE,EAAA,MAAM,QAAQ,uBAAA,IAA0B;AACxC,EAAA,MAAM,EAAE,YAAW,GAAI,MAAA;AACvB,EAAA,IAAI,UAAA,CAAW,OAAA,KAAY,MAAA,IAAa,UAAA,CAAW,SAAS,MAAA,EAAW;AACrE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,iFAAA;AAAA,MACA,EAAE,MAAM,2CAAA;AAA4C,KACtD;AAAA,EACF;AACA,EAAA,IACE,uBAAA,CAAwB,UAAA,CAAW,KAAK,CAAA,CAAE,MAAA,GAAS,KACnD,OAAA,CAAQ,YAAA,CAAa,MAAA,EAAQ,SAAA,KAAc,IAAA,EAC3C;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gIAAA;AAAA,MACA;AAAA,QACE,IAAA,EAAM,mCAAA;AAAA,QACN,OAAA,EAAS,WAAW,KAAA,CAAM;AAAA,OAC5B;AAAA,MACA;AAAA,QACE,UAAA,EACE;AAAA;AACJ,KACF;AAAA,EACF;AACA,EAAA,MAAM,cAAA,GAAiB,eAAA,CAAgB,UAAA,CAAW,KAAA,EAAO,WAAW,OAAO,CAAA;AAC3E,EAAA,MAAM,UAAA,GAAa,MAAM,iBAAA,CAAkB,cAAc,CAAA;AACzD,EAAA,IAAI,UAAA,KAAe,WAAW,IAAA,EAAM;AAClC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,2DAAA;AAAA,MACA,EAAE,MAAM,yCAAA;AAA0C,KACpD;AAAA,EACF;AACA,EAAA,MAAM,QAAA,CAAS;AAAA,IACb,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,UAAA;AAAA,IACA,SAAA,EAAW;AAAA,GACZ,CAAA;AACD,EAAA,OAAO,OAAO,MAAA,CAAO;AAAA,IACnB,IAAI,MAAA,CAAO,UAAA;AAAA,IACX,UAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAOA,eAAsB,wBAAA,CACpB,SACA,MAAA,EAC4C;AAC5C,EAAA,MAAM,cAAc,OAAA,CAAQ,wBAAA;AAC5B,EAAA,IAAI,WAAA,KAAgB,MAAA,EAAW,MAAM,8BAAA,CAA+B,OAAO,CAAA;AAC3E,EAAA,MAAM,QAAQ,uBAAA,IAA0B;AACxC,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,OAAA;AACjD,EAAA,MAAM,cAAA,GAAiB,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,IAAA;AAClD,EAAA,IAAI,aAAA,KAAkB,MAAA,IAAa,cAAA,KAAmB,MAAA,EAAW;AAC/D,IAAA,MAAM,gCAAA,CAAiC,MAAA,CAAO,QAAA,CAAS,EAAE,CAAA;AAAA,EAC3D;AACA,EAAA,MAAM,aAAa,MAAM,iBAAA;AAAA,IACvB,eAAA,CAAgB,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,OAAO,aAAa;AAAA,GACjE;AACA,EAAA,IACE,eAAe,MAAA,CAAO,QAAA,CAAS,cAC/B,cAAA,KAAmB,MAAA,CAAO,SAAS,UAAA,EACnC;AACA,IAAA,MAAM,gCAAA,CAAiC,MAAA,CAAO,QAAA,CAAS,EAAE,CAAA;AAAA,EAC3D;AACA,EAAA,MAAM,WAAA,GAAiB,OAAO,MAAA,CAAO;AAAA,IACnC,GAAG,MAAA,CAAO,QAAA,CAAS,UAAA,CAAW,KAAA;AAAA,IAC9B,IAAI,MAAA,CAAO;AAAA,GACZ,CAAA;AACD,EAAA,MAAM,aAAa,MAAM,iBAAA,CAAkB,eAAA,CAAgB,WAAA,EAAa,CAAC,CAAC,CAAA;AAC1E,EAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY;AAAA,IAC/B,UAAA,EAAY,OAAO,QAAA,CAAS,EAAA;AAAA,IAC5B,kBAAA,EAAoB,OAAO,QAAA,CAAS,UAAA;AAAA,IACpC,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,UAAA,EAAY;AAAA,GACb,CAAA;AACD,EAAA,IAAI,MAAA,CAAO,WAAW,SAAA,EAAW;AAC/B,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,CAAA,oDAAA,EAAuD,OAAO,OAAO,CAAA,2EAAA,CAAA;AAAA,MACrE;AAAA,QACE,IAAA,EAAM,sCAAA;AAAA,QACN,SAAS,MAAA,CAAO,OAAA;AAAA,QAChB,UAAA,EAAY,OAAO,QAAA,CAAS;AAAA;AAC9B,KACF;AAAA,EACF;AACA,EAAA,IACE,MAAA,CAAO,GAAA,CAAI,QAAA,KAAa,MAAA,CAAO,OAAA,IAC/B,MAAA,CAAO,GAAA,CAAI,OAAA,KAAY,CAAA,IACvB,MAAA,CAAO,GAAA,CAAI,WAAA,KAAgB,UAAA,EAC3B;AACA,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wFAAA;AAAA,MACA,EAAE,IAAA,EAAM,+BAAA,EAAiC,OAAA,EAAS,OAAO,OAAA;AAAQ,KACnE;AAAA,EACF;AACA,EAAA,OAAO,OAAO,MAAA,CAAO;AAAA,IACnB,MAAA,EAAQ,OAAA;AAAA,IACR,UAAA,EAAY,OAAO,MAAA,CAAO;AAAA,MACxB,KAAA,EAAO,WAAA;AAAA,MACP,OAAA,EAAS,OAAO,GAAA,CAAI,OAAA;AAAA,MACpB,IAAA,EAAM,OAAO,GAAA,CAAI;AAAA,KAClB,CAAA;AAAA,IACD,QAAQ,MAAA,CAAO;AAAA,GAChB,CAAA;AACH;AAEA,SAAS,iCACP,UAAA,EACoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,0BAA0B,UAAU,CAAA,gDAAA,CAAA;AAAA,IACpC,EAAE,IAAA,EAAM,gCAAA,EAAkC,UAAA;AAAW,GACvD;AACF;AAGO,SAAS,gBAAA,CACd,SACA,MAAA,EAC4C;AAC5C,EAAA,OAAO,wBAAA,CAAyB,SAAS,MAAM,CAAA;AACjD;AAEA,SAAS,+BACP,OAAA,EACoB;AACpB,EAAA,OAAO,IAAI,kBAAA;AAAA,IACT,CAAA,IAAA,EAAO,QAAQ,OAAO,CAAA,kDAAA,CAAA;AAAA,IACtB,EAAE,IAAA,EAAM,6BAAA,EAA+B,OAAA,EAAS,QAAQ,OAAA;AAAQ,GAClE;AACF","file":"chunk-F2S5JWCT.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 { type AnyEdgeType, type NodeType } from \"../core/types\";\nimport { type NamedOntologyRelation } from \"../ontology/validation\";\nimport { buildValidatedKindRegistry } from \"../registry/build-validated\";\nimport type { KindRegistry } from \"../registry/kind-registry\";\nimport { type EdgeEndpointKinds } from \"../registry/validate-implies\";\nimport { hasOwnKey } from \"../utils/object\";\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 durable TypeGraph Identity Profile configuration. */\n  getIdentity: () => SerializedSchema[\"identity\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a validated KindRegistry by recomputing closures from relations */\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    // Own-key reads, for the same reason {@link buildEdgeEndpointKinds} below\n    // uses a `Map`: `schema` is parsed out of a stored JSON document and the\n    // caller supplies the name, so a raw read hands back an `Object.prototype`\n    // member typed as a definition for any name no kind is registered under.\n    getNode: (name) =>\n      hasOwnKey(schema.nodes, name) ? schema.nodes[name] : undefined,\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) =>\n      hasOwnKey(schema.edges, name) ? schema.edges[name] : undefined,\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) =>\n      hasOwnKey(schema.ontology.metaEdges, name) ?\n        schema.ontology.metaEdges[name]\n      : undefined,\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getIdentity: () => schema.identity,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromRelations(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized relations.\n *\n * Persisted closures are a legacy inspection artifact. Relations are validated\n * and closures are recomputed so old schemas gain current hardening rules.\n */\nfunction buildRegistryFromRelations(schema: SerializedSchema): KindRegistry {\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map<string, NodeType>();\n  const edgeKinds = new Map<string, AnyEdgeType>();\n  return buildValidatedKindRegistry({\n    nodeKinds,\n    edgeKinds,\n    ontology: schema.ontology.relations.map(\n      (relation): NamedOntologyRelation => ({\n        metaEdge: relation.metaEdge,\n        from: relation.from,\n        to: relation.to,\n      }),\n    ),\n    edgeEndpoints: buildEdgeEndpointKinds(schema.edges),\n    ...(schema.identity === undefined ? {} : { identity: schema.identity }),\n  });\n}\n\n/**\n * Maps each edge kind's serialized definition to its domain/range kind\n * names, for `validateImpliesEndpointCompatibility`. A `Map` (rather than\n * the plain `schema.edges` object) so a lookup for an edge kind literally\n * named \"toString\" or another `Object.prototype` member can't resolve to\n * an inherited member instead of `undefined`.\n */\nfunction buildEdgeEndpointKinds(\n  edges: Record<string, SerializedEdgeDef>,\n): ReadonlyMap<string, EdgeEndpointKinds> {\n  const result = new Map<string, EdgeEndpointKinds>();\n  for (const [kind, def] of Object.entries(edges)) {\n    const pairs: { from: string; to: string }[] = [];\n    if (def.targetKindsBySource === undefined) {\n      for (const fromKind of def.fromKinds) {\n        for (const toKind of def.toKinds) {\n          pairs.push({ from: fromKind, to: toKind });\n        }\n      }\n    } else {\n      for (const [sourceKind, targetKinds] of Object.entries(\n        def.targetKindsBySource,\n      )) {\n        for (const targetKind of targetKinds) {\n          pairs.push({ from: sourceKind, to: targetKind });\n        }\n      }\n    }\n    result.set(kind, {\n      from: def.fromKinds,\n      to: def.toKinds,\n      pairs,\n    });\n  }\n  return result;\n}\n","import type { GraphBackend, SchemaVersionRow } from \"../backend/types\";\nimport { type GraphDef } from \"../core/define-graph\";\nimport { resolveGraphVectorSlots } from \"../core/embedding\";\nimport { ConfigurationError } from \"../errors\";\nimport { type ReconciledSchema } from \"../store/store\";\nimport { computeSchemaHash, serializeSchema } from \"./serializer\";\n\n/** A locally held handle for a durable server-side graph template. */\nexport type GraphTemplate<G extends GraphDef> = Readonly<{\n  id: string;\n  reconciled: ReconciledSchema<G>;\n  schemaHash: string;\n}>;\n\nexport type InstantiateGraphTemplateResult<G extends GraphDef> = Readonly<{\n  status: \"ready\";\n  reconciled: ReconciledSchema<G>;\n  schema: SchemaVersionRow;\n}>;\n\n/**\n * Registers the fully materialized shape of a verified store as a durable\n * template. The original schema version is retained only as snapshot\n * provenance: every instantiated graph starts at v1 with that final shape.\n */\nexport async function registerGraphTemplate<G extends GraphDef>(\n  backend: GraphBackend,\n  params: Readonly<{ templateId: string; reconciled: ReconciledSchema<G> }>,\n): Promise<GraphTemplate<G>> {\n  const register = backend.registerGraphTemplate;\n  if (register === undefined) throw graphTemplatesUnsupportedError(backend);\n  await backend.assertBaseSchemaCurrent?.();\n  const { reconciled } = params;\n  if (reconciled.version === undefined || reconciled.hash === undefined) {\n    throw new ConfigurationError(\n      \"A graph template requires a reconciled schema from a managed or verified Store.\",\n      { code: \"GRAPH_TEMPLATE_REQUIRES_RECONCILED_SCHEMA\" },\n    );\n  }\n  if (\n    resolveGraphVectorSlots(reconciled.graph).length > 0 &&\n    backend.capabilities.vector?.supported === true\n  ) {\n    throw new ConfigurationError(\n      \"Graph templates do not support embedding fields because vector storage is graph-scoped and cannot be instantiated schema-only.\",\n      {\n        code: \"GRAPH_TEMPLATE_VECTOR_UNSUPPORTED\",\n        graphId: reconciled.graph.id,\n      },\n      {\n        suggestion:\n          \"Provision the graph through createStoreWithSchema until template instantiation can atomically materialize vector contributions.\",\n      },\n    );\n  }\n  const schemaDocument = serializeSchema(reconciled.graph, reconciled.version);\n  const schemaHash = await computeSchemaHash(schemaDocument);\n  if (schemaHash !== reconciled.hash) {\n    throw new ConfigurationError(\n      \"Reconciled schema hash does not match its graph snapshot.\",\n      { code: \"GRAPH_TEMPLATE_RECONCILED_HASH_MISMATCH\" },\n    );\n  }\n  await register({\n    templateId: params.templateId,\n    schemaHash,\n    schemaDoc: schemaDocument,\n  });\n  return Object.freeze({\n    id: params.templateId,\n    reconciled,\n    schemaHash,\n  });\n}\n\n/**\n * Instantiates the template's final graph shape as target schema v1. Only the\n * target hash crosses the wire; the durable source document stays in the\n * backend template registry and is rebound to `graphId` by one SQL statement.\n */\nexport async function instantiateGraphTemplate<G extends GraphDef>(\n  backend: GraphBackend,\n  params: Readonly<{ template: GraphTemplate<G>; graphId: string }>,\n): Promise<InstantiateGraphTemplateResult<G>> {\n  const instantiate = backend.instantiateGraphTemplate;\n  if (instantiate === undefined) throw graphTemplatesUnsupportedError(backend);\n  await backend.assertBaseSchemaCurrent?.();\n  const sourceVersion = params.template.reconciled.version;\n  const reconciledHash = params.template.reconciled.hash;\n  if (sourceVersion === undefined || reconciledHash === undefined) {\n    throw graphTemplateHandleMismatchError(params.template.id);\n  }\n  const sourceHash = await computeSchemaHash(\n    serializeSchema(params.template.reconciled.graph, sourceVersion),\n  );\n  if (\n    sourceHash !== params.template.schemaHash ||\n    reconciledHash !== params.template.schemaHash\n  ) {\n    throw graphTemplateHandleMismatchError(params.template.id);\n  }\n  const targetGraph: G = Object.freeze({\n    ...params.template.reconciled.graph,\n    id: params.graphId,\n  });\n  const targetHash = await computeSchemaHash(serializeSchema(targetGraph, 1));\n  const result = await instantiate({\n    templateId: params.template.id,\n    templateSchemaHash: params.template.schemaHash,\n    graphId: params.graphId,\n    schemaHash: targetHash,\n  });\n  if (result.status === \"refused\") {\n    throw new ConfigurationError(\n      `Graph template instantiation was refused for graph \"${params.graphId}\". The template may be absent, or the graph already has a different schema.`,\n      {\n        code: \"GRAPH_TEMPLATE_INSTANTIATION_REFUSED\",\n        graphId: params.graphId,\n        templateId: params.template.id,\n      },\n    );\n  }\n  if (\n    result.row.graph_id !== params.graphId ||\n    result.row.version !== 1 ||\n    result.row.schema_hash !== targetHash\n  ) {\n    throw new ConfigurationError(\n      \"Graph template backend returned a schema row that does not match the requested target.\",\n      { code: \"GRAPH_TEMPLATE_INVALID_RESULT\", graphId: params.graphId },\n    );\n  }\n  return Object.freeze({\n    status: \"ready\",\n    reconciled: Object.freeze({\n      graph: targetGraph,\n      version: result.row.version,\n      hash: result.row.schema_hash,\n    }),\n    schema: result.row,\n  });\n}\n\nfunction graphTemplateHandleMismatchError(\n  templateId: string,\n): ConfigurationError {\n  return new ConfigurationError(\n    `Graph template handle \"${templateId}\" does not match its reconciled schema snapshot.`,\n    { code: \"GRAPH_TEMPLATE_HANDLE_MISMATCH\", templateId },\n  );\n}\n\n/** Short public name for {@link instantiateGraphTemplate}. */\nexport function instantiateGraph<G extends GraphDef>(\n  backend: GraphBackend,\n  params: Readonly<{ template: GraphTemplate<G>; graphId: string }>,\n): Promise<InstantiateGraphTemplateResult<G>> {\n  return instantiateGraphTemplate(backend, params);\n}\n\nfunction graphTemplatesUnsupportedError(\n  backend: GraphBackend,\n): ConfigurationError {\n  return new ConfigurationError(\n    `The ${backend.dialect} backend does not support durable graph templates.`,\n    { code: \"GRAPH_TEMPLATES_UNSUPPORTED\", dialect: backend.dialect },\n  );\n}\n"]}

package/dist/{chunk-45WPPI64.js → chunk-FMCPKMQI.js}

@@ -1,4 +1,4 @@
-import { supportsAtomicNodeClaims } from './chunk-SLNH62T3.js';
+import { supportsAtomicNodeClaims } from './chunk-KQYUKOGX.js';
 
 // src/backend/capabilities/autocommit-single-statement.ts
 var BUNDLED_ROOT_AUTOCOMMIT_BACKENDS = /* @__PURE__ */ new WeakSet();
@@ -83,5 +83,5 @@ function supportsNodeCreatePlan(target, input) {
 }
 
 export { isBundledRootAutocommitEligible, markBundledRootAutocommitEligible, rephaseAtomicNodeClaimPlan, rephaseNonTransactionalNodeClaimPlan, supportsNodeCreatePlan, supportsNodeInsertProjectionRequirements, supportsNodeInsertProjections };
-//# sourceMappingURL=chunk-45WPPI64.js.map
-//# sourceMappingURL=chunk-45WPPI64.js.map
+//# sourceMappingURL=chunk-FMCPKMQI.js.map
+//# sourceMappingURL=chunk-FMCPKMQI.js.map

package/dist/{chunk-45WPPI64.js.map → chunk-FMCPKMQI.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/backend/capabilities/autocommit-single-statement.ts","../src/backend/capabilities/node-insert-projections.ts"],"names":[],"mappings":";;;AAaA,IAAM,gCAAA,uBAAuC,OAAA,EAAgB;AAGtD,SAAS,kCACd,MAAA,EACG;AACH,EAAA,gCAAA,CAAiC,IAAI,MAAM,CAAA;AAC3C,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,gCACd,MAAA,EACwB;AACxB,EAAA,OAAO,gCAAA,CAAiC,IAAI,MAAM,CAAA;AACpD;;;ACRO,SAAS,wCAAA,CACd,QACA,YAAA,EACS;AACT,EAAA,OAAA,CACG,CAAC,YAAA,CAAa,QAAA,IACb,MAAA,CAAO,gBAAA,EAAkB,yBAAA,KAA8B,MAAA,MACxD,CAAC,YAAA,CAAa,SAAA,IACb,MAAA,CAAO,cAAA,EAAgB,2BAAA,KAAgC,MAAA,CAAA;AAE7D;AAUO,SAAS,6BAAA,CACd,QACA,WAAA,EACS;AACT,EAAA,IAAI,WAAA,CAAY,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AACrC,EAAA,OAAO,yCAAyC,MAAA,EAAQ;AAAA,IACtD,UAAU,WAAA,CAAY,IAAA,CAAK,CAAC,UAAA,KAAe,UAAA,CAAW,SAAS,UAAU,CAAA;AAAA,IACzE,WAAW,WAAA,CAAY,IAAA;AAAA,MACrB,CAAC,UAAA,KAAe,UAAA,CAAW,IAAA,KAAS;AAAA;AACtC,GACD,CAAA;AACH;AAaA,SAAS,yBAAyB,MAAA,EAA6C;AAC7E,EAAA,OACE,EAAE,aAAA,IAAiB,MAAA,CAAA,IACnB,MAAA,CAAO,aAAa,sBAAA,KAA2B,IAAA;AAEnD;AASA,SAAS,sCACP,IAAA,EAIS;AACT,EAAA,OACE,IAAA,CAAK,WAAA,IACL,IAAA,CAAK,IAAA,CAAK,SAAS,UAAA,IACnB,IAAA,CAAK,WAAA,CAAY,MAAA,KAAW,KAC5B,IAAA,CAAK,MAAA,CAAO,MAAA,KAAW,CAAA,IACvB,KAAK,MAAA,CAAO,KAAA;AAAA,IACV,CAAC,UACC,KAAA,CAAM,OAAA,CAAQ,SAAS,YAAA,IACvB,KAAA,CAAM,SAAS,IAAA,CAAK,MAAA,CAAO,QAC3B,KAAA,CAAM,OAAA,CAAQ,UAAU,MAAA,KAAW,CAAA,IACnC,MAAM,OAAA,CAAQ,SAAA,CAAU,CAAC,CAAA,KAAM,KAAA,CAAM;AAAA,GACzC;AAEJ;AAGO,SAAS,qCACd,IAAA,EACmC;AACnC,EAAA,IAAI,CAAC,qCAAA,CAAsC,IAAI,CAAA,EAAG;AAClD,EAAA,OAAO;AAAA,IACL,GAAG,IAAA;AAAA,IACH,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,MAClC,GAAG,KAAA;AAAA,MACH,SAAA,EAAW;AAAA,KACb,CAAE;AAAA,GACJ;AACF;AAUO,SAAS,0BAAA,CACd,MACA,OAAA,EACmC;AACnC,EAAA,IACE,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,UAAA,IACnB,IAAA,CAAK,MAAA,CAAO,MAAA,KAAW,CAAA,IACvB,CAAC,wBAAA,CAAyB,OAAA,EAAS,IAAA,CAAK,MAAM,CAAA,EAC9C;AACA,IAAA;AAAA,EACF;AACA,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,CAAC,KAAA,KAAU;AAC7C,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,IAAA,KAAS,YAAA,EAAc;AACvC,MAAA,OACE,KAAA,CAAM,QAAQ,SAAA,CAAU,MAAA,GAAS,KACjC,KAAA,CAAM,OAAA,CAAQ,UAAU,CAAC,CAAA,KAAM,MAAM,IAAA,IACrC,IAAI,IAAI,KAAA,CAAM,OAAA,CAAQ,SAAS,CAAA,CAAE,IAAA,KAAS,KAAA,CAAM,OAAA,CAAQ,SAAA,CAAU,MAAA;AAAA,IAEtE;AACA,IAAA,OACE,MAAM,GAAA,KAAQ,IAAA,CAAK,OAAO,EAAA,IAC1B,KAAA,CAAM,QAAQ,gBAAA,CAAiB,MAAA,GAAS,KACxC,IAAI,GAAA,CAAI,MAAM,OAAA,CAAQ,gBAAgB,EAAE,IAAA,KACtC,KAAA,CAAM,QAAQ,gBAAA,CAAiB,MAAA;AAAA,EAErC,CAAC,CAAA;AACD,EAAA,IAAI,CAAC,SAAA,EAAW;AAChB,EAAA,OAAO;AAAA,IACL,GAAG,IAAA;AAAA,IACH,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,MAClC,GAAG,KAAA;AAAA,MACH,SAAA,EAAW;AAAA,KACb,CAAE;AAAA,GACJ;AACF;AAGO,SAAS,sBAAA,CACd,QACA,KAAA,EASS;AACT,EAAA,IAAI,KAAA,CAAM,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AAC7B,IAAA,OAAO,6BAAA,CAA8B,MAAA,EAAQ,KAAA,CAAM,WAAW,CAAA;AAAA,EAChE;AAKA,EAAA,MAAM,YAAA,GAEF,KAAA,CAAM,MAAA,KAAW,MAAA,IACjB,KAAA,CAAM,SAAS,MAAA,IACf,KAAA,CAAM,WAAA,KAAgB,MAAA,GAEtB,MAAA,GACA;AAAA,IAEE,QAAQ,KAAA,CAAM,MAAA;AAAA,IACd,aAAa,KAAA,CAAM,WAAA;AAAA,IACnB,MAAM,KAAA,CAAM,IAAA;AAAA,IACZ,QAAQ,KAAA,CAAM,MAAA;AAAA,IACd,aAAa,KAAA,CAAM;AAAA,GACrB;AACJ,EAAA,MAAM,eAAA,GACJ,KAAA,CAAM,2BAAA,KAAgC,IAAA,IACtC,MAAA,CAAO,YAAA,CAAa,sBAAA,KAA2B,IAAA,IAC/C,YAAA,KAAiB,MAAA,IACjB,qCAAA,CAAsC,YAAY,CAAA;AACpD,EAAA,OAAA,CACG,yBAAyB,MAAM,CAAA,IAC7B,iBAAiB,MAAA,IAAU,eAAA,KAC9B,yCAAyC,MAAA,EAAQ;AAAA,IAC/C,QAAA,EAAU,MAAM,WAAA,CAAY,IAAA;AAAA,MAC1B,CAAC,UAAA,KAAe,UAAA,CAAW,IAAA,KAAS;AAAA,KACtC;AAAA,IACA,SAAA,EAAW,MAAM,WAAA,CAAY,IAAA;AAAA,MAC3B,CAAC,UAAA,KAAe,UAAA,CAAW,IAAA,KAAS;AAAA;AACtC,GACD,CAAA;AAEL","file":"chunk-45WPPI64.js","sourcesContent":["/**\n * Origin evidence for the managed single-statement autocommit fast path.\n *\n * This is intentionally narrower than schema-fenced-insert eligibility. The\n * latter follows bundled transaction targets and derived wrappers because its\n * statement still runs inside an explicit transaction. Here, omitting that\n * transaction is the optimization, so only the literal root objects produced\n * by the bundled factories may opt in. In particular, this evidence is never\n * carried through `deriveBackend`, an owned transaction, or adoption of a\n * caller-owned transaction.\n */\nimport type { GraphBackend, TransactionBackend } from \"../types\";\n\nconst BUNDLED_ROOT_AUTOCOMMIT_BACKENDS = new WeakSet<object>();\n\n/** @internal Called only by bundled factories after their root backend exists. */\nexport function markBundledRootAutocommitEligible<T extends object>(\n  target: T,\n): T {\n  BUNDLED_ROOT_AUTOCOMMIT_BACKENDS.add(target);\n  return target;\n}\n\n/** Whether this is the exact root backend a bundled factory created. */\nexport function isBundledRootAutocommitEligible(\n  target: GraphBackend | TransactionBackend,\n): target is GraphBackend {\n  return BUNDLED_ROOT_AUTOCOMMIT_BACKENDS.has(target);\n}\n","import type {\n  BackendIdentity,\n  GraphBackend,\n  ManagedNodeCreatePlan,\n  NodeInsertClaim,\n  NodeInsertProjection,\n} from \"../types\";\nimport {\n  type AtomicNodeClaimSupport,\n  supportsAtomicNodeClaims,\n} from \"./atomic-mutation-program\";\n\nexport type NodeProjectionInsertTarget = BackendIdentity &\n  Pick<GraphBackend, \"commands\">;\n\nexport type NodeInsertProjectionRequirements = Readonly<{\n  fulltext: boolean;\n  embedding: boolean;\n}>;\n\nexport function supportsNodeInsertProjectionRequirements(\n  target: NodeProjectionInsertTarget,\n  requirements: NodeInsertProjectionRequirements,\n): boolean {\n  return (\n    (!requirements.fulltext ||\n      target.fulltextStrategy?.buildSyncFromInsertedNode !== undefined) &&\n    (!requirements.embedding ||\n      target.vectorStrategy?.buildUpsertFromInsertedNode !== undefined)\n  );\n}\n\n/**\n * The single owner of projection-fusion eligibility.\n *\n * A projection plan is all-or-nothing: every requested projection must have\n * an inserted-node builder on the active strategy, and the receiver must\n * expose the atomic executor. Callers use this same predicate before choosing\n * root autocommit and again on the actual transaction callback target.\n */\nexport function supportsNodeInsertProjections(\n  target: NodeProjectionInsertTarget,\n  projections: readonly NodeInsertProjection[],\n): boolean {\n  if (projections.length === 0) return false;\n  return supportsNodeInsertProjectionRequirements(target, {\n    fulltext: projections.some((projection) => projection.kind === \"fulltext\"),\n    embedding: projections.some(\n      (projection) => projection.kind === \"embedding\",\n    ),\n  });\n}\n\n/**\n * Whether the receiver can make uniqueness/disjointness claims authoritative\n * inside the planned node statement.\n *\n * Claims are reported by the statement as a verdict, so the caller must have a\n * transaction boundary around the statement before it can safely defer the\n * application probes. A root backend is deliberately excluded: its\n * command port is also used for projection-only\n * autocommit writes, but a claim refusal must roll back the node and any\n * claims it touched together.\n */\nfunction supportsNodeInsertClaims(target: NodeProjectionInsertTarget): boolean {\n  return (\n    !(\"transaction\" in target) &&\n    target.capabilities.atomicNodeInsertClaims === true\n  );\n}\n\n/**\n * The only claim shape that is safe to execute on a root backend without a\n * rollback boundary. A generated id cannot collide with a different node, so\n * the claim is the sole conflict source; same-kind uniqueness has no legacy\n * axis or cross-kind/disjoint probe to consult. Rephasing it before the node\n * insert makes a conflict prevent the node row from being written at all.\n */\nfunction supportsNonTransactionalNodeClaimPlan(\n  plan: Pick<\n    ManagedNodeCreatePlan,\n    \"idGenerated\" | \"mode\" | \"params\" | \"claims\" | \"projections\"\n  >,\n): boolean {\n  return (\n    plan.idGenerated &&\n    plan.mode.kind === \"ordinary\" &&\n    plan.projections.length === 0 &&\n    plan.claims.length === 1 &&\n    plan.claims.every(\n      (claim) =>\n        claim.verdict.kind === \"uniqueness\" &&\n        claim.axis === plan.params.kind &&\n        claim.verdict.probeAxes.length === 1 &&\n        claim.verdict.probeAxes[0] === claim.axis,\n    )\n  );\n}\n\n/** Rephases the safe root claim shape so a conflict gates the node insert. */\nexport function rephaseNonTransactionalNodeClaimPlan(\n  plan: ManagedNodeCreatePlan,\n): ManagedNodeCreatePlan | undefined {\n  if (!supportsNonTransactionalNodeClaimPlan(plan)) return;\n  return {\n    ...plan,\n    claims: plan.claims.map((claim) => ({\n      ...claim,\n      placement: \"pre-insert\",\n    })),\n  };\n}\n\n/**\n * Normalizes the complete claim envelope accepted by an atomic node program.\n *\n * Unlike the ordinary root insert seam, a closed program can also prove a\n * disjoint claim because it carries the legacy live-node probe and cleanup in\n * the same atomic transport submission. The executor's advertised support is\n * authoritative; an omitted family remains on the portable path.\n */\nexport function rephaseAtomicNodeClaimPlan(\n  plan: ManagedNodeCreatePlan,\n  support: AtomicNodeClaimSupport | undefined,\n): ManagedNodeCreatePlan | undefined {\n  if (\n    plan.mode.kind !== \"ordinary\" ||\n    plan.claims.length === 0 ||\n    !supportsAtomicNodeClaims(support, plan.claims)\n  ) {\n    return;\n  }\n  const supported = plan.claims.every((claim) => {\n    if (claim.verdict.kind === \"uniqueness\") {\n      return (\n        claim.verdict.probeAxes.length > 0 &&\n        claim.verdict.probeAxes[0] === claim.axis &&\n        new Set(claim.verdict.probeAxes).size === claim.verdict.probeAxes.length\n      );\n    }\n    return (\n      claim.key === plan.params.id &&\n      claim.verdict.conflictingKinds.length > 0 &&\n      new Set(claim.verdict.conflictingKinds).size ===\n        claim.verdict.conflictingKinds.length\n    );\n  });\n  if (!supported) return;\n  return {\n    ...plan,\n    claims: plan.claims.map((claim) => ({\n      ...claim,\n      placement: \"pre-insert\",\n    })),\n  };\n}\n\n/** Whether the receiver can lower this complete insert plan atomically. */\nexport function supportsNodeCreatePlan(\n  target: NodeProjectionInsertTarget,\n  input: Readonly<{\n    params?: ManagedNodeCreatePlan[\"params\"];\n    idGenerated?: ManagedNodeCreatePlan[\"idGenerated\"];\n    mode?: ManagedNodeCreatePlan[\"mode\"];\n    claims: readonly NodeInsertClaim[];\n    projections: readonly NodeInsertProjection[];\n    /** Store-side proof that no identity/history/revision side effect exists. */\n    allowNonTransactionalClaims?: boolean | undefined;\n  }>,\n): boolean {\n  if (input.claims.length === 0) {\n    return supportsNodeInsertProjections(target, input.projections);\n  }\n  // A claim refusal is discovered from the data-modifying statement's result,\n  // so the caller-owned transaction is the rollback boundary. Root graph\n  // backends expose `transaction`; transaction-scoped operation backends do\n  // not. Keep this exported predicate aligned with the execution contract.\n  const ordinaryPlan =\n    (\n      input.params === undefined ||\n      input.mode === undefined ||\n      input.idGenerated === undefined\n    ) ?\n      undefined\n    : {\n        entity: \"node\" as const,\n        params: input.params,\n        idGenerated: input.idGenerated,\n        mode: input.mode,\n        claims: input.claims,\n        projections: input.projections,\n      };\n  const rootClaimFusion =\n    input.allowNonTransactionalClaims === true &&\n    target.capabilities.atomicNodeInsertClaims === true &&\n    ordinaryPlan !== undefined &&\n    supportsNonTransactionalNodeClaimPlan(ordinaryPlan);\n  return (\n    (supportsNodeInsertClaims(target) ||\n      (\"transaction\" in target && rootClaimFusion)) &&\n    supportsNodeInsertProjectionRequirements(target, {\n      fulltext: input.projections.some(\n        (projection) => projection.kind === \"fulltext\",\n      ),\n      embedding: input.projections.some(\n        (projection) => projection.kind === \"embedding\",\n      ),\n    })\n  );\n}\n"]}
+{"version":3,"sources":["../src/backend/capabilities/autocommit-single-statement.ts","../src/backend/capabilities/node-insert-projections.ts"],"names":[],"mappings":";;;AAaA,IAAM,gCAAA,uBAAuC,OAAA,EAAgB;AAGtD,SAAS,kCACd,MAAA,EACG;AACH,EAAA,gCAAA,CAAiC,IAAI,MAAM,CAAA;AAC3C,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,gCACd,MAAA,EACwB;AACxB,EAAA,OAAO,gCAAA,CAAiC,IAAI,MAAM,CAAA;AACpD;;;ACRO,SAAS,wCAAA,CACd,QACA,YAAA,EACS;AACT,EAAA,OAAA,CACG,CAAC,YAAA,CAAa,QAAA,IACb,MAAA,CAAO,gBAAA,EAAkB,yBAAA,KAA8B,MAAA,MACxD,CAAC,YAAA,CAAa,SAAA,IACb,MAAA,CAAO,cAAA,EAAgB,2BAAA,KAAgC,MAAA,CAAA;AAE7D;AAUO,SAAS,6BAAA,CACd,QACA,WAAA,EACS;AACT,EAAA,IAAI,WAAA,CAAY,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AACrC,EAAA,OAAO,yCAAyC,MAAA,EAAQ;AAAA,IACtD,UAAU,WAAA,CAAY,IAAA,CAAK,CAAC,UAAA,KAAe,UAAA,CAAW,SAAS,UAAU,CAAA;AAAA,IACzE,WAAW,WAAA,CAAY,IAAA;AAAA,MACrB,CAAC,UAAA,KAAe,UAAA,CAAW,IAAA,KAAS;AAAA;AACtC,GACD,CAAA;AACH;AAaA,SAAS,yBAAyB,MAAA,EAA6C;AAC7E,EAAA,OACE,EAAE,aAAA,IAAiB,MAAA,CAAA,IACnB,MAAA,CAAO,aAAa,sBAAA,KAA2B,IAAA;AAEnD;AASA,SAAS,sCACP,IAAA,EAIS;AACT,EAAA,OACE,IAAA,CAAK,WAAA,IACL,IAAA,CAAK,IAAA,CAAK,SAAS,UAAA,IACnB,IAAA,CAAK,WAAA,CAAY,MAAA,KAAW,KAC5B,IAAA,CAAK,MAAA,CAAO,MAAA,KAAW,CAAA,IACvB,KAAK,MAAA,CAAO,KAAA;AAAA,IACV,CAAC,UACC,KAAA,CAAM,OAAA,CAAQ,SAAS,YAAA,IACvB,KAAA,CAAM,SAAS,IAAA,CAAK,MAAA,CAAO,QAC3B,KAAA,CAAM,OAAA,CAAQ,UAAU,MAAA,KAAW,CAAA,IACnC,MAAM,OAAA,CAAQ,SAAA,CAAU,CAAC,CAAA,KAAM,KAAA,CAAM;AAAA,GACzC;AAEJ;AAGO,SAAS,qCACd,IAAA,EACmC;AACnC,EAAA,IAAI,CAAC,qCAAA,CAAsC,IAAI,CAAA,EAAG;AAClD,EAAA,OAAO;AAAA,IACL,GAAG,IAAA;AAAA,IACH,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,MAClC,GAAG,KAAA;AAAA,MACH,SAAA,EAAW;AAAA,KACb,CAAE;AAAA,GACJ;AACF;AAUO,SAAS,0BAAA,CACd,MACA,OAAA,EACmC;AACnC,EAAA,IACE,IAAA,CAAK,IAAA,CAAK,IAAA,KAAS,UAAA,IACnB,IAAA,CAAK,MAAA,CAAO,MAAA,KAAW,CAAA,IACvB,CAAC,wBAAA,CAAyB,OAAA,EAAS,IAAA,CAAK,MAAM,CAAA,EAC9C;AACA,IAAA;AAAA,EACF;AACA,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,CAAC,KAAA,KAAU;AAC7C,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,IAAA,KAAS,YAAA,EAAc;AACvC,MAAA,OACE,KAAA,CAAM,QAAQ,SAAA,CAAU,MAAA,GAAS,KACjC,KAAA,CAAM,OAAA,CAAQ,UAAU,CAAC,CAAA,KAAM,MAAM,IAAA,IACrC,IAAI,IAAI,KAAA,CAAM,OAAA,CAAQ,SAAS,CAAA,CAAE,IAAA,KAAS,KAAA,CAAM,OAAA,CAAQ,SAAA,CAAU,MAAA;AAAA,IAEtE;AACA,IAAA,OACE,MAAM,GAAA,KAAQ,IAAA,CAAK,OAAO,EAAA,IAC1B,KAAA,CAAM,QAAQ,gBAAA,CAAiB,MAAA,GAAS,KACxC,IAAI,GAAA,CAAI,MAAM,OAAA,CAAQ,gBAAgB,EAAE,IAAA,KACtC,KAAA,CAAM,QAAQ,gBAAA,CAAiB,MAAA;AAAA,EAErC,CAAC,CAAA;AACD,EAAA,IAAI,CAAC,SAAA,EAAW;AAChB,EAAA,OAAO;AAAA,IACL,GAAG,IAAA;AAAA,IACH,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,MAClC,GAAG,KAAA;AAAA,MACH,SAAA,EAAW;AAAA,KACb,CAAE;AAAA,GACJ;AACF;AAGO,SAAS,sBAAA,CACd,QACA,KAAA,EASS;AACT,EAAA,IAAI,KAAA,CAAM,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AAC7B,IAAA,OAAO,6BAAA,CAA8B,MAAA,EAAQ,KAAA,CAAM,WAAW,CAAA;AAAA,EAChE;AAKA,EAAA,MAAM,YAAA,GAEF,KAAA,CAAM,MAAA,KAAW,MAAA,IACjB,KAAA,CAAM,SAAS,MAAA,IACf,KAAA,CAAM,WAAA,KAAgB,MAAA,GAEtB,MAAA,GACA;AAAA,IAEE,QAAQ,KAAA,CAAM,MAAA;AAAA,IACd,aAAa,KAAA,CAAM,WAAA;AAAA,IACnB,MAAM,KAAA,CAAM,IAAA;AAAA,IACZ,QAAQ,KAAA,CAAM,MAAA;AAAA,IACd,aAAa,KAAA,CAAM;AAAA,GACrB;AACJ,EAAA,MAAM,eAAA,GACJ,KAAA,CAAM,2BAAA,KAAgC,IAAA,IACtC,MAAA,CAAO,YAAA,CAAa,sBAAA,KAA2B,IAAA,IAC/C,YAAA,KAAiB,MAAA,IACjB,qCAAA,CAAsC,YAAY,CAAA;AACpD,EAAA,OAAA,CACG,yBAAyB,MAAM,CAAA,IAC7B,iBAAiB,MAAA,IAAU,eAAA,KAC9B,yCAAyC,MAAA,EAAQ;AAAA,IAC/C,QAAA,EAAU,MAAM,WAAA,CAAY,IAAA;AAAA,MAC1B,CAAC,UAAA,KAAe,UAAA,CAAW,IAAA,KAAS;AAAA,KACtC;AAAA,IACA,SAAA,EAAW,MAAM,WAAA,CAAY,IAAA;AAAA,MAC3B,CAAC,UAAA,KAAe,UAAA,CAAW,IAAA,KAAS;AAAA;AACtC,GACD,CAAA;AAEL","file":"chunk-FMCPKMQI.js","sourcesContent":["/**\n * Origin evidence for the managed single-statement autocommit fast path.\n *\n * This is intentionally narrower than schema-fenced-insert eligibility. The\n * latter follows bundled transaction targets and derived wrappers because its\n * statement still runs inside an explicit transaction. Here, omitting that\n * transaction is the optimization, so only the literal root objects produced\n * by the bundled factories may opt in. In particular, this evidence is never\n * carried through `deriveBackend`, an owned transaction, or adoption of a\n * caller-owned transaction.\n */\nimport type { GraphBackend, TransactionBackend } from \"../types\";\n\nconst BUNDLED_ROOT_AUTOCOMMIT_BACKENDS = new WeakSet<object>();\n\n/** @internal Called only by bundled factories after their root backend exists. */\nexport function markBundledRootAutocommitEligible<T extends object>(\n  target: T,\n): T {\n  BUNDLED_ROOT_AUTOCOMMIT_BACKENDS.add(target);\n  return target;\n}\n\n/** Whether this is the exact root backend a bundled factory created. */\nexport function isBundledRootAutocommitEligible(\n  target: GraphBackend | TransactionBackend,\n): target is GraphBackend {\n  return BUNDLED_ROOT_AUTOCOMMIT_BACKENDS.has(target);\n}\n","import type {\n  BackendIdentity,\n  GraphBackend,\n  ManagedNodeCreatePlan,\n  NodeInsertClaim,\n  NodeInsertProjection,\n} from \"../types\";\nimport {\n  type AtomicNodeClaimSupport,\n  supportsAtomicNodeClaims,\n} from \"./atomic-mutation-program\";\n\nexport type NodeProjectionInsertTarget = BackendIdentity &\n  Pick<GraphBackend, \"commands\">;\n\nexport type NodeInsertProjectionRequirements = Readonly<{\n  fulltext: boolean;\n  embedding: boolean;\n}>;\n\nexport function supportsNodeInsertProjectionRequirements(\n  target: NodeProjectionInsertTarget,\n  requirements: NodeInsertProjectionRequirements,\n): boolean {\n  return (\n    (!requirements.fulltext ||\n      target.fulltextStrategy?.buildSyncFromInsertedNode !== undefined) &&\n    (!requirements.embedding ||\n      target.vectorStrategy?.buildUpsertFromInsertedNode !== undefined)\n  );\n}\n\n/**\n * The single owner of projection-fusion eligibility.\n *\n * A projection plan is all-or-nothing: every requested projection must have\n * an inserted-node builder on the active strategy, and the receiver must\n * expose the atomic executor. Callers use this same predicate before choosing\n * root autocommit and again on the actual transaction callback target.\n */\nexport function supportsNodeInsertProjections(\n  target: NodeProjectionInsertTarget,\n  projections: readonly NodeInsertProjection[],\n): boolean {\n  if (projections.length === 0) return false;\n  return supportsNodeInsertProjectionRequirements(target, {\n    fulltext: projections.some((projection) => projection.kind === \"fulltext\"),\n    embedding: projections.some(\n      (projection) => projection.kind === \"embedding\",\n    ),\n  });\n}\n\n/**\n * Whether the receiver can make uniqueness/disjointness claims authoritative\n * inside the planned node statement.\n *\n * Claims are reported by the statement as a verdict, so the caller must have a\n * transaction boundary around the statement before it can safely defer the\n * application probes. A root backend is deliberately excluded: its\n * command port is also used for projection-only\n * autocommit writes, but a claim refusal must roll back the node and any\n * claims it touched together.\n */\nfunction supportsNodeInsertClaims(target: NodeProjectionInsertTarget): boolean {\n  return (\n    !(\"transaction\" in target) &&\n    target.capabilities.atomicNodeInsertClaims === true\n  );\n}\n\n/**\n * The only claim shape that is safe to execute on a root backend without a\n * rollback boundary. A generated id cannot collide with a different node, so\n * the claim is the sole conflict source; same-kind uniqueness has no legacy\n * axis or cross-kind/disjoint probe to consult. Rephasing it before the node\n * insert makes a conflict prevent the node row from being written at all.\n */\nfunction supportsNonTransactionalNodeClaimPlan(\n  plan: Pick<\n    ManagedNodeCreatePlan,\n    \"idGenerated\" | \"mode\" | \"params\" | \"claims\" | \"projections\"\n  >,\n): boolean {\n  return (\n    plan.idGenerated &&\n    plan.mode.kind === \"ordinary\" &&\n    plan.projections.length === 0 &&\n    plan.claims.length === 1 &&\n    plan.claims.every(\n      (claim) =>\n        claim.verdict.kind === \"uniqueness\" &&\n        claim.axis === plan.params.kind &&\n        claim.verdict.probeAxes.length === 1 &&\n        claim.verdict.probeAxes[0] === claim.axis,\n    )\n  );\n}\n\n/** Rephases the safe root claim shape so a conflict gates the node insert. */\nexport function rephaseNonTransactionalNodeClaimPlan(\n  plan: ManagedNodeCreatePlan,\n): ManagedNodeCreatePlan | undefined {\n  if (!supportsNonTransactionalNodeClaimPlan(plan)) return;\n  return {\n    ...plan,\n    claims: plan.claims.map((claim) => ({\n      ...claim,\n      placement: \"pre-insert\",\n    })),\n  };\n}\n\n/**\n * Normalizes the complete claim envelope accepted by an atomic node program.\n *\n * Unlike the ordinary root insert seam, a closed program can also prove a\n * disjoint claim because it carries the legacy live-node probe and cleanup in\n * the same atomic transport submission. The executor's advertised support is\n * authoritative; an omitted family remains on the portable path.\n */\nexport function rephaseAtomicNodeClaimPlan(\n  plan: ManagedNodeCreatePlan,\n  support: AtomicNodeClaimSupport | undefined,\n): ManagedNodeCreatePlan | undefined {\n  if (\n    plan.mode.kind !== \"ordinary\" ||\n    plan.claims.length === 0 ||\n    !supportsAtomicNodeClaims(support, plan.claims)\n  ) {\n    return;\n  }\n  const supported = plan.claims.every((claim) => {\n    if (claim.verdict.kind === \"uniqueness\") {\n      return (\n        claim.verdict.probeAxes.length > 0 &&\n        claim.verdict.probeAxes[0] === claim.axis &&\n        new Set(claim.verdict.probeAxes).size === claim.verdict.probeAxes.length\n      );\n    }\n    return (\n      claim.key === plan.params.id &&\n      claim.verdict.conflictingKinds.length > 0 &&\n      new Set(claim.verdict.conflictingKinds).size ===\n        claim.verdict.conflictingKinds.length\n    );\n  });\n  if (!supported) return;\n  return {\n    ...plan,\n    claims: plan.claims.map((claim) => ({\n      ...claim,\n      placement: \"pre-insert\",\n    })),\n  };\n}\n\n/** Whether the receiver can lower this complete insert plan atomically. */\nexport function supportsNodeCreatePlan(\n  target: NodeProjectionInsertTarget,\n  input: Readonly<{\n    params?: ManagedNodeCreatePlan[\"params\"];\n    idGenerated?: ManagedNodeCreatePlan[\"idGenerated\"];\n    mode?: ManagedNodeCreatePlan[\"mode\"];\n    claims: readonly NodeInsertClaim[];\n    projections: readonly NodeInsertProjection[];\n    /** Store-side proof that no identity/history/revision side effect exists. */\n    allowNonTransactionalClaims?: boolean | undefined;\n  }>,\n): boolean {\n  if (input.claims.length === 0) {\n    return supportsNodeInsertProjections(target, input.projections);\n  }\n  // A claim refusal is discovered from the data-modifying statement's result,\n  // so the caller-owned transaction is the rollback boundary. Root graph\n  // backends expose `transaction`; transaction-scoped operation backends do\n  // not. Keep this exported predicate aligned with the execution contract.\n  const ordinaryPlan =\n    (\n      input.params === undefined ||\n      input.mode === undefined ||\n      input.idGenerated === undefined\n    ) ?\n      undefined\n    : {\n        entity: \"node\" as const,\n        params: input.params,\n        idGenerated: input.idGenerated,\n        mode: input.mode,\n        claims: input.claims,\n        projections: input.projections,\n      };\n  const rootClaimFusion =\n    input.allowNonTransactionalClaims === true &&\n    target.capabilities.atomicNodeInsertClaims === true &&\n    ordinaryPlan !== undefined &&\n    supportsNonTransactionalNodeClaimPlan(ordinaryPlan);\n  return (\n    (supportsNodeInsertClaims(target) ||\n      (\"transaction\" in target && rootClaimFusion)) &&\n    supportsNodeInsertProjectionRequirements(target, {\n      fulltext: input.projections.some(\n        (projection) => projection.kind === \"fulltext\",\n      ),\n      embedding: input.projections.some(\n        (projection) => projection.kind === \"embedding\",\n      ),\n    })\n  );\n}\n"]}

package/dist/{chunk-QM6IQW7B.js → chunk-ILHVYKXJ.js}

@@ -1,12 +1,12 @@
-import { assertNoLegacyTransactionCapability, tables, assertBundledCapabilityDeclarations, contributionRebuildSupported, createPostgresOperationStrategy, createCachedTableExistence, createContributionMaterializer, createBaseSchemaLifecycle, gateFulltextMethods, lockPostgresTrustedImportTables, assertTrustedImportDatabaseEmpty, suspendPostgresSecondaryIndexes, createPostgresTrustedImportSession, restoreSecondaryIndexes, analyzeImportedTables, createCommonOperationBackend, mapVectorWriteError, resolveAtomicNodeProjectionRequirements, vectorSlotFromParams, buildLiveNodeCandidates, mapHybridSearchRow, mapContributionMaterializationRow, POSTGRES_CONTRIBUTION_MAT_TIMESTAMPS, buildContributionInsertValues, buildContributionOnConflictSet, tableExistsFromRow, postgresIdentifierRegclassName, edgeMatchIdentityPairCheckName, edgeMatchIdentityUniqueIndexName, generatePostgresEdgeMatchIdentityUpgradeDDL, generatePgCreateTableSQL, assertAdoptedDialect, commitSchemaVersionIfKindsEmpty, buildKindRemovalInsertValues, POSTGRES_KIND_REMOVAL_TIMESTAMPS, buildKindRemovalOnConflictSet, mapKindRemovalRow, buildMaterializationInsertValues, POSTGRES_INDEX_MAT_TIMESTAMPS, buildMaterializationOnConflictSet, mapMaterializationRow, instantiateGraphTemplateSql, generatePostgresDDL, vectorSlotFromDropIndexParams, vectorSlotFromCreateIndexParams, assertActiveSchemaVersion, FIND_EDGES_ENDPOINT_FIXED_PARAM_COUNT, EMBEDDING_UPSERT_PARAM_COUNT, gateFulltext, createPostgresTables, postgresContributions, getOrCreateLru } from './chunk-WXGMDROJ.js';
+import { assertNoLegacyTransactionCapability, tables, assertBundledCapabilityDeclarations, contributionRebuildSupported, createPostgresOperationStrategy, createCachedTableExistence, createContributionMaterializer, createBaseSchemaLifecycle, gateFulltextMethods, lockPostgresTrustedImportTables, assertTrustedImportDatabaseEmpty, suspendPostgresSecondaryIndexes, createPostgresTrustedImportSession, restoreSecondaryIndexes, analyzeImportedTables, createCommonOperationBackend, mapVectorWriteError, resolveAtomicNodeProjectionRequirements, vectorSlotFromParams, buildLiveNodeCandidates, mapHybridSearchRow, mapContributionMaterializationRow, POSTGRES_CONTRIBUTION_MAT_TIMESTAMPS, buildContributionInsertValues, buildContributionOnConflictSet, tableExistsFromRow, postgresIdentifierRegclassName, edgeMatchIdentityPairCheckName, edgeMatchIdentityUniqueIndexName, generatePostgresEdgeMatchIdentityUpgradeDDL, generatePgCreateTableSQL, assertAdoptedDialect, commitSchemaVersionIfKindsEmpty, buildKindRemovalInsertValues, POSTGRES_KIND_REMOVAL_TIMESTAMPS, buildKindRemovalOnConflictSet, mapKindRemovalRow, buildMaterializationInsertValues, POSTGRES_INDEX_MAT_TIMESTAMPS, buildMaterializationOnConflictSet, mapMaterializationRow, instantiateGraphTemplateSql, generatePostgresDDL, vectorSlotFromDropIndexParams, vectorSlotFromCreateIndexParams, assertActiveSchemaVersion, FIND_EDGES_ENDPOINT_FIXED_PARAM_COUNT, EMBEDDING_UPSERT_PARAM_COUNT, gateFulltext, createPostgresTables, postgresContributions, getOrCreateLru } from './chunk-QDNEXTON.js';
 import { toDrizzleSql, compileQueryWithDialect } from './chunk-KHGHOXY2.js';
 import { pgvectorStrategy, assertPgvectorEfSearch } from './chunk-OAGKRW22.js';
-import { createNodeRowMapper, POSTGRES_ROW_MAPPER_CONFIG, createEdgeRowMapper, createUniqueRowMapper, createSchemaVersionRowMapper, nowIso, coerceNumericScore } from './chunk-HW3IX2RF.js';
-import { markBundledRootAutocommitEligible } from './chunk-45WPPI64.js';
-import { createAtomicSqlProgramExecutor, registerAtomicSqlProgram, registerAtomicMutationPrograms, carryAtomicMutationSessionRegistration } from './chunk-SLNH62T3.js';
+import { createNodeRowMapper, POSTGRES_ROW_MAPPER_CONFIG, createEdgeRowMapper, createUniqueRowMapper, createSchemaVersionRowMapper, nowIso, coerceNumericScore } from './chunk-EWRLWI7W.js';
+import { markBundledRootAutocommitEligible } from './chunk-FMCPKMQI.js';
+import { createAtomicSqlProgramExecutor, registerAtomicSqlProgram, registerAtomicMutationPrograms, carryAtomicMutationSessionRegistration } from './chunk-KQYUKOGX.js';
 import { RECORDED_GRAPH_WRITE_ADVISORY_LOCK_NAMESPACE } from './chunk-JYY2EB5K.js';
 import { isMissingTableError, chunk, isPostgresConcurrentDdlRaceError, isInsufficientResourcesError } from './chunk-U4SGJQKQ.js';
-import { resolveDeclaredBackendResource, POSTGRES_CAPABILITIES, POSTGRES_MAX_BIND_PARAMETERS, normalizeGraphAnalyticsCapabilities, markFirstPartyFactory, deriveBackend, auditBackendResource, markSchemaFencedInsertEligible, resolveWriteFencePlan, scopeAtomicBatchToSession, DATABASE_EXTENSION_NAMES, requireWriteFence, INTERNAL_TEMPORARY_WRITES } from './chunk-YVKPUSHS.js';
+import { resolveDeclaredBackendResource, POSTGRES_CAPABILITIES, POSTGRES_MAX_BIND_PARAMETERS, normalizeGraphAnalyticsCapabilities, markFirstPartyFactory, deriveBackend, auditBackendResource, markSchemaFencedInsertEligible, resolveWriteFencePlan, scopeAtomicBatchToSession, DATABASE_EXTENSION_NAMES, requireWriteFence, INTERNAL_TEMPORARY_WRITES } from './chunk-75KH6Y2W.js';
 import { tsvectorStrategy, assertVectorSearchLimit, buildFulltextCapabilities, buildVectorCapabilities, resolveEfSearchOverride, vectorSearchFrontierTuning } from './chunk-IJCIVEG5.js';
 import { sql, isSqlFragment, shouldForceCustomPlan, annIndexScanTypes } from './chunk-LFM53HMA.js';
 import { ConfigurationError, StaleVersionError, CompilerInvariantError, TransactionClosedError } from './chunk-ADOABE3R.js';
@@ -2267,5 +2267,5 @@ function createTransactionBackend(options) {
 }
 
 export { createPostgresBackend };
-//# sourceMappingURL=chunk-QM6IQW7B.js.map
-//# sourceMappingURL=chunk-QM6IQW7B.js.map
+//# sourceMappingURL=chunk-ILHVYKXJ.js.map
+//# sourceMappingURL=chunk-ILHVYKXJ.js.map