@nicia-ai/typegraph 0.59.0 → 0.60.0

package/dist/{chunk-3GX5HTPP.js → chunk-ILVXUOQY.js}

@@ -1,4 +1,4 @@
-import { buildValidatedKindRegistry, serializeSchema, computeSchemaHash } from './chunk-E6PU35DE.js';
+import { buildValidatedKindRegistry, serializeSchema, computeSchemaHash } from './chunk-W6K6NSRT.js';
 import { resolveGraphVectorSlots } from './chunk-PC2UBAUB.js';
 import { ConfigurationError } from './chunk-Q5QOGVDF.js';
 import { hasOwnKey } from './chunk-QD2JFTSL.js';
@@ -187,5 +187,5 @@ function graphTemplatesUnsupportedError(backend) {
 }
 
 export { deserializeSchema, instantiateGraph, instantiateGraphTemplate, registerGraphTemplate };
-//# sourceMappingURL=chunk-3GX5HTPP.js.map
-//# sourceMappingURL=chunk-3GX5HTPP.js.map
+//# sourceMappingURL=chunk-ILVXUOQY.js.map
+//# sourceMappingURL=chunk-ILVXUOQY.js.map

package/dist/{chunk-3GX5HTPP.js.map → chunk-ILVXUOQY.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-3GX5HTPP.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-ILVXUOQY.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-XGYUUUHY.cjs → chunk-KGQVK2II.cjs}

@@ -1,10 +1,10 @@
 'use strict';
 
-var chunk26CL47SW_cjs = require('./chunk-26CL47SW.cjs');
-var chunkBPYZUJX5_cjs = require('./chunk-BPYZUJX5.cjs');
+var chunkPTFO3JI5_cjs = require('./chunk-PTFO3JI5.cjs');
+var chunkMTJAT6UO_cjs = require('./chunk-MTJAT6UO.cjs');
 var chunkGD7IWK36_cjs = require('./chunk-GD7IWK36.cjs');
-var chunkUOHFBYYH_cjs = require('./chunk-UOHFBYYH.cjs');
-var chunkIV5W7LKW_cjs = require('./chunk-IV5W7LKW.cjs');
+var chunkQ6ZVQWH7_cjs = require('./chunk-Q6ZVQWH7.cjs');
+var chunkA22XPVBQ_cjs = require('./chunk-A22XPVBQ.cjs');
 var chunkOGK7F2J3_cjs = require('./chunk-OGK7F2J3.cjs');
 var chunkEOLNL35G_cjs = require('./chunk-EOLNL35G.cjs');
 var chunk6ODVH5SA_cjs = require('./chunk-6ODVH5SA.cjs');
@@ -251,7 +251,7 @@ function resolveIngestionImportTarget(target) {
   const registeredStore = INGESTION_IMPORT_TARGETS.get(target);
   if (registeredStore !== void 0) return registeredStore;
   try {
-    chunkIV5W7LKW_cjs.storeBackend(target);
+    chunkA22XPVBQ_cjs.storeBackend(target);
     return target;
   } catch (error) {
     throw new chunkG7W67PZO_cjs.ConfigurationError(
@@ -286,7 +286,7 @@ async function importGraph(target, data, rawOptions) {
 }
 async function withImportStreamLease(store, run) {
   const lease = chunkEOLNL35G_cjs.acquireSerializedStreamLease(
-    chunkIV5W7LKW_cjs.storeBackend(store),
+    chunkA22XPVBQ_cjs.storeBackend(store),
     "import-stream"
   );
   if (!lease.acquired) {
@@ -366,19 +366,19 @@ async function importGraphData(store, data, options) {
   validateIdentitySection(data.identity);
   const graph = store.graph;
   const graphId = store.graphId;
-  const backend = chunkIV5W7LKW_cjs.storeBackend(store);
-  const runtime = chunkIV5W7LKW_cjs.storeRuntime(store);
+  const backend = chunkA22XPVBQ_cjs.storeBackend(store);
+  const runtime = chunkA22XPVBQ_cjs.storeRuntime(store);
   const registry = store.registry;
   const batchPointRead = chunkOGK7F2J3_cjs.batchPointReadVerdict(backend);
   const uniqueSidecarBatch = chunkOGK7F2J3_cjs.uniqueSidecarBatchVerdict(backend);
   const statementExecution = chunkOGK7F2J3_cjs.statementExecutionVerdict(backend);
-  const owedClaimReason = chunk26CL47SW_cjs.graphOwesClaims(graph, registry);
-  const claimRefusal = owedClaimReason === void 0 ? void 0 : chunkIV5W7LKW_cjs.constraintFenceRefusal({ graphId }, backend, owedClaimReason);
+  const owedClaimReason = chunkPTFO3JI5_cjs.graphOwesClaims(graph, registry);
+  const claimRefusal = owedClaimReason === void 0 ? void 0 : chunkA22XPVBQ_cjs.constraintFenceRefusal({ graphId }, backend, owedClaimReason);
   if (claimRefusal !== void 0) throw claimRefusal;
   const nodeSchemas = buildNodeSchemaMap(graph);
   const edgeSchemas = buildEdgeSchemaMap(graph);
   for (const [kind, entry] of edgeSchemas) {
-    chunkUOHFBYYH_cjs.assertEdgeMatchIdentityBackendSupport(
+    chunkQ6ZVQWH7_cjs.assertEdgeMatchIdentityBackendSupport(
       entry.registration.matchIdentity,
       backend.capabilities,
       kind
@@ -396,7 +396,7 @@ async function importGraphData(store, data, options) {
     uniqueSidecarBatch,
     statementExecution
   };
-  const { result, errors } = await chunk26CL47SW_cjs.runWritePlan(
+  const { result, errors } = await chunkPTFO3JI5_cjs.runWritePlan(
     {
       graphId,
       registry,
@@ -413,7 +413,7 @@ async function importGraphData(store, data, options) {
       // whether node/edge-operations write to TypeGraph's own recorded
       // relations — engine-native `history: true` never does, even though
       // the public getter now answers `true` for it too.
-      historyEnabled: chunkIV5W7LKW_cjs.storeCaptureEnabled(store),
+      historyEnabled: chunkA22XPVBQ_cjs.storeCaptureEnabled(store),
       revisionTrackingEnabled: store.revisionTrackingEnabled,
       revisionSchema: store.revisionSchema,
       // HOW this caller takes position 3. `lockIdentityImportTarget` is
@@ -424,7 +424,7 @@ async function importGraphData(store, data, options) {
     },
     // An import writes node rows AND edge rows in one frame, so it declares the
     // mixed family explicitly instead of receiving either narrower session.
-    chunk26CL47SW_cjs.mixedWritePlan(void 0, true),
+    chunkPTFO3JI5_cjs.mixedWritePlan(void 0, true),
     backend,
     (session, target, overlaidSession, _lock, transactionMode) => runImportWritePlanAttempt(
       attemptInputs,
@@ -445,7 +445,7 @@ async function importGraphStream(target, chunks, rawOptions) {
   const store = resolveIngestionImportTarget(target);
   const options = ImportOptionsSchema.parse(rawOptions);
   const sourceBackend = exportStreamBackend(chunks);
-  const targetBackend = chunkIV5W7LKW_cjs.storeBackend(store);
+  const targetBackend = chunkA22XPVBQ_cjs.storeBackend(store);
   const contention = sourceBackend === void 0 ? void 0 : chunkEOLNL35G_cjs.snapshotExportContention(sourceBackend, targetBackend);
   if (contention !== void 0) {
     throw serializedStreamRefusal({
@@ -702,7 +702,7 @@ function asIdentityImportError(assertions, graphId, error) {
 }
 function taggedAssertion(assertions, error) {
   if (typeof error !== "object" || error === null) return void 0;
-  const id = error[chunkUOHFBYYH_cjs.IDENTITY_IMPORT_FAILED_ASSERTION];
+  const id = error[chunkQ6ZVQWH7_cjs.IDENTITY_IMPORT_FAILED_ASSERTION];
   if (typeof id !== "string") return void 0;
   return assertions.find((candidate) => candidate.id === id);
 }
@@ -733,7 +733,7 @@ function identityImportProgress(error) {
   if (typeof error !== "object" || error === null) {
     return { created: 0, skipped: 0 };
   }
-  const progress = error[chunkUOHFBYYH_cjs.IDENTITY_IMPORT_PROGRESS];
+  const progress = error[chunkQ6ZVQWH7_cjs.IDENTITY_IMPORT_PROGRESS];
   if (typeof progress !== "object" || progress === null || !("created" in progress) || typeof progress.created !== "number" || !("skipped" in progress) || typeof progress.skipped !== "number") {
     return { created: 0, skipped: 0 };
   }
@@ -935,8 +935,8 @@ async function processNodeSlice(frame, graphId, registry, batch, schemas, option
     registerAppliedNodeUpdate,
     seedNodeRow,
     seedUniqueRow
-  } = chunk26CL47SW_cjs.createNodeBatchValidationSeams(graphId, registry, frame.target);
-  await chunk26CL47SW_cjs.primeBatchValidationCaches(
+  } = chunkPTFO3JI5_cjs.createNodeBatchValidationSeams(graphId, registry, frame.target);
+  await chunkPTFO3JI5_cjs.primeBatchValidationCaches(
     {
       graphId,
       registry,
@@ -1012,14 +1012,14 @@ async function processNodeSlice(frame, graphId, registry, batch, schemas, option
       continue;
     }
     const constraintResult = await catchDeclaredConstraintRefusal(async () => {
-      await chunkBPYZUJX5_cjs.checkUniquenessConstraints(
+      await chunkMTJAT6UO_cjs.checkUniquenessConstraints(
         { graphId, registry, backend: validationBackend },
         node.kind,
         node.id,
         props,
         uniqueConstraints
       );
-      await chunk26CL47SW_cjs.checkDisjointnessConstraint(
+      await chunkPTFO3JI5_cjs.checkDisjointnessConstraint(
         { graphId, registry, backend: validationBackend },
         node.kind,
         node.id
@@ -1076,7 +1076,7 @@ function importNodeCreateWork(graphId, registry, node, registration, props) {
   return {
     params: buildImportInsertParams(graphId, node, props),
     claim,
-    claimPlan: chunkBPYZUJX5_cjs.planNodeCreateClaims({ graphId, registry }, claim),
+    claimPlan: chunkMTJAT6UO_cjs.planNodeCreateClaims({ graphId, registry }, claim),
     sideEffects: {
       kind: node.kind,
       id: node.id,
@@ -1140,7 +1140,7 @@ async function catchEdgeCreateRefusalWithSavepoint(frame, fn) {
     }
   }
   const statementExecution = frame.statementExecution;
-  const result = await chunkIV5W7LKW_cjs.runRecordedTransactionSavepoint(target, statementExecution, frame.allocateEdgeSavepoint(), async () => {
+  const result = await chunkA22XPVBQ_cjs.runRecordedTransactionSavepoint(target, statementExecution, frame.allocateEdgeSavepoint(), async () => {
     const guarded = await catchEdgeCreateRefusal(fn);
     return guarded.ok ? { action: "release", value: guarded } : { action: "rollback", value: guarded, cause: guarded.cause };
   });
@@ -1221,7 +1221,7 @@ async function updateImportedEdge(session, edge, props, windowFence) {
   }
 }
 function importedEdgeIdentityUpdateError(registration, edge, existing, props) {
-  return chunk26CL47SW_cjs.edgeMatchIdentityUpdateRefusal({
+  return chunkPTFO3JI5_cjs.edgeMatchIdentityUpdateRefusal({
     identity: registration.matchIdentity,
     kind: edge.kind,
     id: edge.id,
@@ -1339,14 +1339,14 @@ async function processNode(frame, graphId, registry, node, schemas, options) {
     }
   }
   const constraintResult = await catchDeclaredConstraintRefusal(async () => {
-    await chunkBPYZUJX5_cjs.checkUniquenessConstraints(
+    await chunkMTJAT6UO_cjs.checkUniquenessConstraints(
       { graphId, registry, backend: frame.target },
       node.kind,
       node.id,
       propsResult.data,
       uniqueConstraints
     );
-    await chunk26CL47SW_cjs.checkDisjointnessConstraint(
+    await chunkPTFO3JI5_cjs.checkDisjointnessConstraint(
       { graphId, registry, backend: frame.target },
       node.kind,
       node.id
@@ -1413,7 +1413,7 @@ function recordEdgeOutcome(edge, outcome, result, errors) {
 }
 function prepareEdgeImportCreate(graphId, candidate, registration) {
   const { edge, props } = candidate;
-  const matchIdentity = chunk26CL47SW_cjs.resolveEdgeMatchIdentityStorage(
+  const matchIdentity = chunkPTFO3JI5_cjs.resolveEdgeMatchIdentityStorage(
     registration.matchIdentity,
     {
       fromKind: edge.from.kind,
@@ -1547,7 +1547,7 @@ async function processEdgeSlice(frame, graphId, registry, batch, edgeSchemas, no
   const {
     backend: cardinalityValidationBackend,
     registerPendingEdgeForCardinality
-  } = chunk26CL47SW_cjs.createEdgeBatchValidationBackend(frame.target);
+  } = chunkPTFO3JI5_cjs.createEdgeBatchValidationBackend(frame.target);
   const candidates = [];
   const deferred = [];
   const seenIds = /* @__PURE__ */ new Set();
@@ -1765,7 +1765,7 @@ async function processEdgeSlice(frame, graphId, registry, batch, edgeSchemas, no
     const { candidate, params, cardinality } = prepared;
     const { edge } = candidate;
     const cardinalityResult = await catchDeclaredConstraintRefusal(
-      () => chunk26CL47SW_cjs.checkCardinalityConstraint(
+      () => chunkPTFO3JI5_cjs.checkCardinalityConstraint(
         { graphId, registry, backend: cardinalityValidationBackend },
         edge.kind,
         cardinality,
@@ -1833,7 +1833,7 @@ async function processEdgeSlice(frame, graphId, registry, batch, edgeSchemas, no
       const rows = await chunkBXHAPCQG_cjs.requireDefined(frame.session.createEdgesDurable)(
         acceptedWork
       );
-      const outcomes = chunk26CL47SW_cjs.classifyDurableEdgeBatchOutcomes(
+      const outcomes = chunkPTFO3JI5_cjs.classifyDurableEdgeBatchOutcomes(
         accepted.map((prepared) => prepared.params),
         rows
       );
@@ -2030,7 +2030,7 @@ async function processEdge(frame, graphId, registry, edge, edgeSchemas, nodeSche
   }
   const { cardinality, params } = preparation.value;
   const cardinalityResult = await catchDeclaredConstraintRefusal(
-    () => chunk26CL47SW_cjs.checkCardinalityConstraint(
+    () => chunkPTFO3JI5_cjs.checkCardinalityConstraint(
       { graphId, registry, backend: frame.target },
       edge.kind,
       cardinality,
@@ -2162,7 +2162,7 @@ async function exportGraph(store, options) {
   };
 }
 function exportGraphStream(store, options) {
-  const backend = chunkIV5W7LKW_cjs.storeBackend(store);
+  const backend = chunkA22XPVBQ_cjs.storeBackend(store);
   return markExportStreamBackend(
     exportGraphStreamFromBackend(store, backend, options),
     backend
@@ -2366,7 +2366,7 @@ async function produceExportChunks(store, backend, options, emit) {
   if (store.graph.identity === void 0) return;
   let after;
   for (; ; ) {
-    const page = await chunkIV5W7LKW_cjs.storeRuntime(store).readIdentityAssertionPageAtTarget(
+    const page = await chunkA22XPVBQ_cjs.storeRuntime(store).readIdentityAssertionPageAtTarget(
       backend,
       options.identityMode,
       {
@@ -2593,15 +2593,15 @@ async function* exportEdgeChunks(backend, graphId, kind, options) {
 
 // src/interchange/trusted-import.ts
 function rejectUnsupportedStoreFeatures(store) {
-  const backend = chunkIV5W7LKW_cjs.storeBackend(store);
+  const backend = chunkA22XPVBQ_cjs.storeBackend(store);
   for (const [kind, registration] of Object.entries(store.graph.edges)) {
-    chunkUOHFBYYH_cjs.assertEdgeMatchIdentityBackendSupport(
+    chunkQ6ZVQWH7_cjs.assertEdgeMatchIdentityBackendSupport(
       registration.matchIdentity,
       backend.capabilities,
       kind
     );
   }
-  if (chunkIV5W7LKW_cjs.storeCaptureEnabled(store)) {
+  if (chunkA22XPVBQ_cjs.storeCaptureEnabled(store)) {
     throw new chunkG7W67PZO_cjs.TrustedImportError(
       "Trusted import does not support recorded-time history capture.",
       "history_unsupported",
@@ -2692,7 +2692,7 @@ function nodeParams(graphId, node) {
   };
 }
 function edgeParams(graphId, edge, registration) {
-  const matchIdentity = chunk26CL47SW_cjs.resolveEdgeMatchIdentityStorage(
+  const matchIdentity = chunkPTFO3JI5_cjs.resolveEdgeMatchIdentityStorage(
     registration.matchIdentity,
     {
       fromKind: edge.from.kind,
@@ -2854,7 +2854,7 @@ async function consumeTrustedChunks(store, session, chunks) {
 }
 async function trustedImportGraphStream(store, chunks) {
   rejectUnsupportedStoreFeatures(store);
-  const backend = chunkIV5W7LKW_cjs.storeBackend(store);
+  const backend = chunkA22XPVBQ_cjs.storeBackend(store);
   const trustedImport = backend.trustedImport;
   if (trustedImport === void 0) {
     throw new chunkG7W67PZO_cjs.TrustedImportError(
@@ -2931,5 +2931,5 @@ exports.importGraphStream = importGraphStream;
 exports.registerIngestionImportTarget = registerIngestionImportTarget;
 exports.trustedImportGraph = trustedImportGraph;
 exports.trustedImportGraphStream = trustedImportGraphStream;
-//# sourceMappingURL=chunk-XGYUUUHY.cjs.map
-//# sourceMappingURL=chunk-XGYUUUHY.cjs.map
+//# sourceMappingURL=chunk-KGQVK2II.cjs.map
+//# sourceMappingURL=chunk-KGQVK2II.cjs.map