@nicia-ai/typegraph 0.42.1 → 0.44.0

package/dist/{chunk-V2GZBPY2.cjs → chunk-2VLBGQBY.cjs}

@@ -1,25 +1,25 @@
 'use strict';
 
 var chunkTRF4EBJT_cjs = require('./chunk-TRF4EBJT.cjs');
-var chunkDMZEVJGL_cjs = require('./chunk-DMZEVJGL.cjs');
+var chunkEE7N5XXQ_cjs = require('./chunk-EE7N5XXQ.cjs');
 var chunkACSVZPK7_cjs = require('./chunk-ACSVZPK7.cjs');
-var chunkAO2WPYFZ_cjs = require('./chunk-AO2WPYFZ.cjs');
-var chunkZPCKPLMX_cjs = require('./chunk-ZPCKPLMX.cjs');
-var chunkZBV4LQD2_cjs = require('./chunk-ZBV4LQD2.cjs');
-var chunkI73ATSAH_cjs = require('./chunk-I73ATSAH.cjs');
+var chunkWBUFJ7BS_cjs = require('./chunk-WBUFJ7BS.cjs');
+var chunkQB6VMOJ2_cjs = require('./chunk-QB6VMOJ2.cjs');
+var chunkZTAJL4DT_cjs = require('./chunk-ZTAJL4DT.cjs');
+var chunkA2I2XO52_cjs = require('./chunk-A2I2XO52.cjs');
 var chunkZY4GXIVN_cjs = require('./chunk-ZY4GXIVN.cjs');
 var chunk764JHTLT_cjs = require('./chunk-764JHTLT.cjs');
 var chunkHAHNRASW_cjs = require('./chunk-HAHNRASW.cjs');
-var chunkXDMPDUKL_cjs = require('./chunk-XDMPDUKL.cjs');
+var chunkQYWINYEA_cjs = require('./chunk-QYWINYEA.cjs');
 var chunkSVJ5GEXW_cjs = require('./chunk-SVJ5GEXW.cjs');
 var chunkDI74SMXS_cjs = require('./chunk-DI74SMXS.cjs');
-var chunkKTBTSHU6_cjs = require('./chunk-KTBTSHU6.cjs');
+var chunkC4F7VJ5D_cjs = require('./chunk-C4F7VJ5D.cjs');
 var zod = require('zod');
 
 // src/ontology/core-meta-edges.ts
 function createMetaEdge(name, properties) {
   return Object.freeze({
-    [chunkDMZEVJGL_cjs.META_EDGE_BRAND]: true,
+    [chunkEE7N5XXQ_cjs.META_EDGE_BRAND]: true,
     name,
     properties: {
       transitive: properties.transitive ?? false,
@@ -910,7 +910,7 @@ var KindRegistry = class {
    * Checks if child is a subclass of parent (directly or transitively).
    */
   isSubClassOf(child, parent) {
-    return chunkXDMPDUKL_cjs.isReachable(this.subClassAncestors, child, parent);
+    return chunkQYWINYEA_cjs.isReachable(this.subClassAncestors, child, parent);
   }
   /**
    * Expands a kind to include all its subclasses.
@@ -937,13 +937,13 @@ var KindRegistry = class {
    * Checks if narrowerConcept is narrower than broaderConcept.
    */
   isNarrowerThan(narrowerConcept, broaderConcept) {
-    return chunkXDMPDUKL_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
+    return chunkQYWINYEA_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
   }
   /**
    * Checks if broaderConcept is broader than narrowerConcept.
    */
   isBroaderThan(broaderConcept, narrowerConcept) {
-    return chunkXDMPDUKL_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
+    return chunkQYWINYEA_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
   }
   /**
    * Expands to include all narrower concepts.
@@ -1007,7 +1007,7 @@ var KindRegistry = class {
    * Checks if part is part of whole (directly or transitively).
    */
   isPartOf(part, whole) {
-    return chunkXDMPDUKL_cjs.isReachable(this.partOfClosure, part, whole);
+    return chunkQYWINYEA_cjs.isReachable(this.partOfClosure, part, whole);
   }
   /**
    * Gets all wholes that contain this part.
@@ -1168,18 +1168,18 @@ function computeClosuresFromOntology(ontology) {
       }
     }
   }
-  const subClassAncestors = chunkXDMPDUKL_cjs.computeTransitiveClosure(subClassRelations);
-  const subClassDescendants = chunkXDMPDUKL_cjs.invertClosure(subClassAncestors);
-  const broaderClosure = chunkXDMPDUKL_cjs.computeTransitiveClosure(broaderRelations);
-  const narrowerClosure = chunkXDMPDUKL_cjs.invertClosure(broaderClosure);
+  const subClassAncestors = chunkQYWINYEA_cjs.computeTransitiveClosure(subClassRelations);
+  const subClassDescendants = chunkQYWINYEA_cjs.invertClosure(subClassAncestors);
+  const broaderClosure = chunkQYWINYEA_cjs.computeTransitiveClosure(broaderRelations);
+  const narrowerClosure = chunkQYWINYEA_cjs.invertClosure(broaderClosure);
   const equivalenceSets = computeEquivalenceSets(equivalentRelations);
   const iriToKind = computeIriMapping(equivalentRelations);
   const disjointPairs = computeDisjointPairs(disjointRelations);
-  const partOfClosure = chunkXDMPDUKL_cjs.computeTransitiveClosure(partOfRelations);
-  const hasPartClosure = chunkXDMPDUKL_cjs.invertClosure(partOfClosure);
+  const partOfClosure = chunkQYWINYEA_cjs.computeTransitiveClosure(partOfRelations);
+  const hasPartClosure = chunkQYWINYEA_cjs.invertClosure(partOfClosure);
   const edgeInverses = computeEdgeInverses(inverseOfRelations);
-  const edgeImplicationsClosure = chunkXDMPDUKL_cjs.computeTransitiveClosure(impliesRelations);
-  const edgeImplyingClosure = chunkXDMPDUKL_cjs.invertClosure(edgeImplicationsClosure);
+  const edgeImplicationsClosure = chunkQYWINYEA_cjs.computeTransitiveClosure(impliesRelations);
+  const edgeImplyingClosure = chunkQYWINYEA_cjs.invertClosure(edgeImplicationsClosure);
   return {
     subClassAncestors,
     subClassDescendants,
@@ -1283,7 +1283,7 @@ function serializeSchema(graph, version) {
   return {
     graphId: graph.id,
     version,
-    generatedAt: chunkZBV4LQD2_cjs.nowIso(),
+    generatedAt: chunkZTAJL4DT_cjs.nowIso(),
     nodes,
     edges,
     ontology,
@@ -1314,7 +1314,7 @@ function serializeDeprecatedKinds(set) {
 function canonicalExtension(document) {
   if (document === void 0) return void 0;
   if (document.version === void 0) return document;
-  if (document.version !== chunkXDMPDUKL_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
+  if (document.version !== chunkQYWINYEA_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
   const { version: _omit, ...rest } = document;
   return rest;
 }
@@ -1400,7 +1400,7 @@ function serializeEdgeIndexDeclaration(declaration) {
 }
 function serializeNodes(graph) {
   const result = {};
-  for (const kindName of chunkZPCKPLMX_cjs.getNodeKinds(graph)) {
+  for (const kindName of chunkQB6VMOJ2_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeNodeDef(registration);
@@ -1468,7 +1468,7 @@ function deserializeWherePredicate(serialized) {
 }
 function serializeEdges(graph) {
   const result = {};
-  for (const kindName of chunkZPCKPLMX_cjs.getEdgeKinds(graph)) {
+  for (const kindName of chunkQB6VMOJ2_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeEdgeDef(registration);
@@ -1525,8 +1525,8 @@ function serializeMetaEdge(metaEdge) {
 function serializeOntologyRelation(relation) {
   return {
     metaEdge: relation.metaEdge.name,
-    from: chunkDMZEVJGL_cjs.getTypeName(relation.from),
-    to: chunkDMZEVJGL_cjs.getTypeName(relation.to)
+    from: chunkEE7N5XXQ_cjs.getTypeName(relation.from),
+    to: chunkEE7N5XXQ_cjs.getTypeName(relation.to)
   };
 }
 function serializeClosures(relations) {
@@ -1659,7 +1659,7 @@ function compileNodeCached(kindName, document) {
 }
 function compileNode(kindName, document) {
   const schema = buildObjectSchema(document.properties);
-  const type = chunkDMZEVJGL_cjs.defineNode(
+  const type = chunkEE7N5XXQ_cjs.defineNode(
     kindName,
     chunkDI74SMXS_cjs.compactUndefined({
       schema,
@@ -1837,7 +1837,7 @@ function graphExtensionOntologyKey(entry) {
   return `${entry.metaEdge}|${entry.from}|${entry.to}`;
 }
 function compileTimeOntologyKey(relation) {
-  return `${relation.metaEdge.name}|${chunkDMZEVJGL_cjs.getTypeName(relation.from)}|${chunkDMZEVJGL_cjs.getTypeName(relation.to)}`;
+  return `${relation.metaEdge.name}|${chunkEE7N5XXQ_cjs.getTypeName(relation.from)}|${chunkEE7N5XXQ_cjs.getTypeName(relation.to)}`;
 }
 function buildGraphExtensionOntologyKeySet(document) {
   return new Set(
@@ -1858,7 +1858,7 @@ function mergeGraphExtension(graph, document) {
   if (graph.extension !== void 0 && chunkACSVZPK7_cjs.canonicalEqual(unionDocument, existingDocument)) {
     return graph;
   }
-  const validatedUnion = chunkXDMPDUKL_cjs.unwrap(chunkXDMPDUKL_cjs.validateGraphExtension(unionDocument));
+  const validatedUnion = chunkQYWINYEA_cjs.unwrap(chunkQYWINYEA_cjs.validateGraphExtension(unionDocument));
   const compiled = compileGraphExtension(validatedUnion);
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(existingDocument);
   const nodeKinds = /* @__PURE__ */ new Map();
@@ -1908,7 +1908,7 @@ function mergeGraphExtension(graph, document) {
       edgeKind: edge.kindName,
       side: "to"
     });
-    const type = chunkDMZEVJGL_cjs.defineEdge(
+    const type = chunkEE7N5XXQ_cjs.defineEdge(
       edge.kindName,
       chunkDI74SMXS_cjs.compactUndefined({
         schema: edge.schema,
@@ -1960,7 +1960,7 @@ function deriveGraphExtensionVectorIndexes(compiledNodes) {
       ...compiled.unique.length === 0 ? {} : { unique: [...compiled.unique] }
     };
   }
-  return chunkZPCKPLMX_cjs.autoDeriveVectorIndexes(registrations).map(
+  return chunkQB6VMOJ2_cjs.autoDeriveVectorIndexes(registrations).map(
     (index) => Object.freeze({ ...index, origin: "runtime" })
   );
 }
@@ -1978,7 +1978,7 @@ function mergeIndexesWithGraphExtension(existing, runtimeIndexes, graphId) {
   const runtimeRelational = runtimeIndexes.filter(
     (index) => index.entity !== "vector"
   );
-  const vectorMerged = chunkZPCKPLMX_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
+  const vectorMerged = chunkQB6VMOJ2_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
   const merged = [...vectorMerged, ...runtimeRelational];
   assertUniqueIndexNames(merged, graphId);
   return merged;
@@ -1990,7 +1990,7 @@ function assertUniqueIndexNames(indexes, graphId) {
       seen.add(index.name);
       continue;
     }
-    throw new chunkKTBTSHU6_cjs.ConfigurationError(
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
       `Duplicate index name "${index.name}" after merging graph extension into graph "${graphId}". Index names must be unique within a graph.`,
       { graphId, indexName: index.name, code: "DUPLICATE_INDEX_NAME" },
       {
@@ -2006,12 +2006,12 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     if (document.entity === "node") {
       const node = nodeKinds.get(document.kind);
       if (node === void 0) {
-        throw new chunkKTBTSHU6_cjs.KindNotFoundError(document.kind, "node", {
+        throw new chunkC4F7VJ5D_cjs.KindNotFoundError(document.kind, "node", {
           graphId,
           suggestion: "Declare the kind under `nodes` in this graph extension, or remove the index from `indexes`."
         });
       }
-      const declaration2 = chunkI73ATSAH_cjs.defineNodeIndex(
+      const declaration2 = chunkA2I2XO52_cjs.defineNodeIndex(
         node,
         toNodeIndexConfig(document)
       );
@@ -2020,12 +2020,12 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     }
     const edgeRegistration = mergedEdges[document.kind];
     if (edgeRegistration === void 0) {
-      throw new chunkKTBTSHU6_cjs.KindNotFoundError(document.kind, "edge", {
+      throw new chunkC4F7VJ5D_cjs.KindNotFoundError(document.kind, "edge", {
         graphId,
         suggestion: "Declare the edge under `edges` in this graph extension, or remove the index from `indexes`."
       });
     }
-    const declaration = chunkI73ATSAH_cjs.defineEdgeIndex(
+    const declaration = chunkA2I2XO52_cjs.defineEdgeIndex(
       edgeRegistration.type,
       toEdgeIndexConfig(document)
     );
@@ -2037,7 +2037,7 @@ function buildWhereCallback(where) {
   return (props) => {
     const builder = props[where.field];
     if (builder === void 0) {
-      throw new chunkKTBTSHU6_cjs.ConfigurationError(
+      throw new chunkC4F7VJ5D_cjs.ConfigurationError(
         `Graph-extension index \`where\` references unknown field "${where.field}".`,
         { field: where.field, code: "EXTENSION_INDEX_WHERE_UNKNOWN_FIELD" }
       );
@@ -2112,14 +2112,14 @@ function isEmptyExtension(extension) {
 }
 function assertNoCollision(kindName, entity, collides, graphId) {
   if (!collides) return;
-  throw new chunkXDMPDUKL_cjs.KindCollisionError(kindName, entity, graphId);
+  throw new chunkQYWINYEA_cjs.KindCollisionError(kindName, entity, graphId);
 }
 function resolveEndpoints(entries, nodeKinds, context) {
   return entries.map((entry) => {
     if (typeof entry !== "string") return entry;
     const resolved = nodeKinds.get(entry);
     if (resolved === void 0) {
-      throw new chunkXDMPDUKL_cjs.GraphExtensionUnresolvedEndpointError(
+      throw new chunkQYWINYEA_cjs.GraphExtensionUnresolvedEndpointError(
         context.edgeKind,
         context.side,
         entry,
@@ -2135,6 +2135,183 @@ function resolveOntologyEndpoints(relation, nodeKinds) {
   return { ...relation, from, to };
 }
 
+// src/graph-extension/remove.ts
+function planRemovals(graph, names) {
+  const document = graph.extension;
+  const namesSet = new Set(names);
+  if (namesSet.size === 0) {
+    return { document, removedNodeKinds: [], removedEdgeKinds: [] };
+  }
+  const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(document);
+  const compileTimeNodeNames = new Set(
+    Object.keys(graph.nodes).filter((name) => !runtimeNodeNames.has(name))
+  );
+  const compileTimeEdgeNames = new Set(
+    Object.keys(graph.edges).filter((name) => !runtimeEdgeNames.has(name))
+  );
+  for (const name of namesSet) {
+    if (compileTimeNodeNames.has(name)) {
+      throw new chunkQYWINYEA_cjs.RemoveCompileTimeKindError(name, "node", graph.id);
+    }
+    if (compileTimeEdgeNames.has(name)) {
+      throw new chunkQYWINYEA_cjs.RemoveCompileTimeKindError(name, "edge", graph.id);
+    }
+  }
+  const removedNodeKinds = [...namesSet].filter(
+    (name) => runtimeNodeNames.has(name)
+  );
+  const explicitlyRemovedEdgeKinds = [...namesSet].filter(
+    (name) => runtimeEdgeNames.has(name)
+  );
+  const referentsByKind = buildCompileTimeReferentIndex(
+    graph,
+    runtimeEdgeNames
+  );
+  for (const kindName of removedNodeKinds) {
+    const referents = referentsByKind.get(kindName);
+    if (referents !== void 0 && referents.length > 0) {
+      throw new chunkQYWINYEA_cjs.KindHasReferentsError(kindName, referents, graph.id);
+    }
+  }
+  if (document === void 0) {
+    return {
+      document: void 0,
+      removedNodeKinds: [],
+      removedEdgeKinds: []
+    };
+  }
+  const removedNodeKindsSet = new Set(removedNodeKinds);
+  const explicitlyRemovedEdgeKindsSet = new Set(explicitlyRemovedEdgeKinds);
+  const cascadeEdges = /* @__PURE__ */ new Set();
+  const updatedEdges = {};
+  for (const [edgeName, edgeDocument] of Object.entries(document.edges ?? {})) {
+    if (explicitlyRemovedEdgeKindsSet.has(edgeName)) {
+      cascadeEdges.add(edgeName);
+      continue;
+    }
+    const newFrom = edgeDocument.from.filter(
+      (kind) => !removedNodeKindsSet.has(kind)
+    );
+    const newTo = edgeDocument.to.filter(
+      (kind) => !removedNodeKindsSet.has(kind)
+    );
+    if (newFrom.length === 0 || newTo.length === 0) {
+      cascadeEdges.add(edgeName);
+      continue;
+    }
+    updatedEdges[edgeName] = {
+      ...edgeDocument,
+      from: newFrom,
+      to: newTo
+    };
+  }
+  const updatedNodes = {};
+  for (const [nodeName, nodeDocument] of Object.entries(document.nodes ?? {})) {
+    if (removedNodeKindsSet.has(nodeName)) continue;
+    updatedNodes[nodeName] = nodeDocument;
+  }
+  const survivingOntology = (document.ontology ?? []).filter(
+    (relation) => !removedNodeKindsSet.has(relation.from) && !removedNodeKindsSet.has(relation.to)
+  );
+  const allRemovedKinds = /* @__PURE__ */ new Set([
+    ...removedNodeKindsSet,
+    ...cascadeEdges,
+    ...explicitlyRemovedEdgeKindsSet
+  ]);
+  const survivingIndexes = (document.indexes ?? []).filter(
+    (index) => !allRemovedKinds.has(index.kind)
+  );
+  const newDocument = Object.freeze({
+    ...document.version === void 0 ? {} : { version: document.version },
+    ...Object.keys(updatedNodes).length === 0 ? {} : { nodes: updatedNodes },
+    ...Object.keys(updatedEdges).length === 0 ? {} : { edges: updatedEdges },
+    ...survivingOntology.length === 0 ? {} : { ontology: survivingOntology },
+    ...survivingIndexes.length === 0 ? {} : { indexes: survivingIndexes }
+  });
+  return {
+    document: newDocument,
+    removedNodeKinds,
+    removedEdgeKinds: [
+      ...explicitlyRemovedEdgeKinds,
+      ...[...cascadeEdges].filter(
+        (name) => !explicitlyRemovedEdgeKindsSet.has(name)
+      )
+    ]
+  };
+}
+function stripGraphExtension(graph) {
+  const document = graph.extension;
+  if (document === void 0) return graph;
+  const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(document);
+  const runtimeOntologyKeys = buildGraphExtensionOntologyKeySet(document);
+  const compileNodes = {};
+  for (const [name, registration] of Object.entries(graph.nodes)) {
+    if (runtimeNodeNames.has(name)) continue;
+    compileNodes[name] = registration;
+  }
+  const compileEdges = {};
+  for (const [name, registration] of Object.entries(graph.edges)) {
+    if (runtimeEdgeNames.has(name)) continue;
+    compileEdges[name] = registration;
+  }
+  const compileOntology = graph.ontology.filter(
+    (relation) => !runtimeOntologyKeys.has(compileTimeOntologyKey(relation))
+  );
+  const compileIndexes = (graph.indexes ?? []).filter(
+    (index) => index.origin !== "runtime"
+  );
+  return Object.freeze({
+    ...graph,
+    nodes: compileNodes,
+    edges: compileEdges,
+    ontology: compileOntology,
+    indexes: compileIndexes.length === 0 ? void 0 : compileIndexes,
+    extension: void 0
+  });
+}
+function buildCompileTimeReferentIndex(graph, runtimeEdgeNames) {
+  const index = /* @__PURE__ */ new Map();
+  const append = (kindName, referent) => {
+    const existing = index.get(kindName);
+    if (existing === void 0) index.set(kindName, [referent]);
+    else existing.push(referent);
+  };
+  for (const [edgeName, registration] of Object.entries(graph.edges)) {
+    if (runtimeEdgeNames.has(edgeName)) continue;
+    const reg = registration;
+    const referent = {
+      type: "compile-time-edge",
+      name: edgeName
+    };
+    const seen = /* @__PURE__ */ new Set();
+    for (const endpoint of reg.from ?? []) {
+      if (seen.has(endpoint.kind)) continue;
+      seen.add(endpoint.kind);
+      append(endpoint.kind, referent);
+    }
+    for (const endpoint of reg.to ?? []) {
+      if (seen.has(endpoint.kind)) continue;
+      seen.add(endpoint.kind);
+      append(endpoint.kind, referent);
+    }
+  }
+  const runtimeOntologyKeys = buildGraphExtensionOntologyKeySet(
+    graph.extension
+  );
+  for (const relation of graph.ontology) {
+    if (runtimeOntologyKeys.has(compileTimeOntologyKey(relation))) continue;
+    const fromName = chunkEE7N5XXQ_cjs.getTypeName(relation.from);
+    const toName = chunkEE7N5XXQ_cjs.getTypeName(relation.to);
+    const referent = {
+      type: "compile-time-ontology",
+      name: `${relation.metaEdge.name}(${fromName}, ${toName})`
+    };
+    append(fromName, referent);
+    if (toName !== fromName) append(toName, referent);
+  }
+  return index;
+}
+
 // src/registry/validate-implies.ts
 function validateImpliesEndpointCompatibility(edgeEndpoints, registry) {
   for (const [impliedEdgeKind, impliedEndpoints] of edgeEndpoints) {
@@ -2168,7 +2345,7 @@ function assertEndpointCompatible(side, implyingEdgeKind, implyingKinds, implied
     (kind) => !registry.isAssignableToAny(kind, impliedKinds)
   );
   if (incompatibleKinds.length === 0) return;
-  throw new chunkKTBTSHU6_cjs.ConfigurationError(
+  throw new chunkC4F7VJ5D_cjs.ConfigurationError(
     `implies("${implyingEdgeKind}", "${impliedEdgeKind}") is endpoint-incompatible: ${side} kind(s) [${incompatibleKinds.join(", ")}] declared on "${implyingEdgeKind}" cannot be assigned to any of "${impliedEdgeKind}"'s ${side} kind(s) [${impliedKinds.join(", ")}].`,
     {
       metaEdge: chunkSVJ5GEXW_cjs.META_EDGE_IMPLIES,
@@ -2208,7 +2385,7 @@ function buildEdgeEndpointKinds(edges) {
 }
 function extractNodeTypes(graph) {
   const result = /* @__PURE__ */ new Map();
-  for (const typeName of chunkZPCKPLMX_cjs.getNodeKinds(graph)) {
+  for (const typeName of chunkQB6VMOJ2_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[typeName];
     result.set(typeName, registration.type);
   }
@@ -2216,7 +2393,7 @@ function extractNodeTypes(graph) {
 }
 function extractEdgeTypes(graph) {
   const result = /* @__PURE__ */ new Map();
-  for (const typeName of chunkZPCKPLMX_cjs.getEdgeKinds(graph)) {
+  for (const typeName of chunkQB6VMOJ2_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[typeName];
     result.set(typeName, registration.type);
   }
@@ -2564,7 +2741,7 @@ function parseSerializedSchema(json) {
   try {
     parsed = JSON.parse(json);
   } catch {
-    throw new chunkKTBTSHU6_cjs.DatabaseOperationError(
+    throw new chunkC4F7VJ5D_cjs.DatabaseOperationError(
       "Stored schema document is not valid JSON",
       { operation: "select", entity: "schema" }
     );
@@ -2572,7 +2749,7 @@ function parseSerializedSchema(json) {
   const result = serializedSchemaZod.safeParse(parsed);
   if (!result.success) {
     const issues = result.error.issues.map((issue) => `${issue.path.join(".")}: ${issue.message}`).join("; ");
-    throw new chunkKTBTSHU6_cjs.DatabaseOperationError(
+    throw new chunkC4F7VJ5D_cjs.DatabaseOperationError(
       `Stored schema document is malformed: ${issues}`,
       { operation: "select", entity: "schema" }
     );
@@ -2589,7 +2766,7 @@ async function loadActiveSchemaWithBootstrap(backend, graphId) {
   try {
     return await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (backend.bootstrapTables && chunkAO2WPYFZ_cjs.isMissingTableError(error)) {
+    if (backend.bootstrapTables && chunkWBUFJ7BS_cjs.isMissingTableError(error)) {
       await backend.bootstrapTables();
       return await backend.getActiveSchema(graphId);
     }
@@ -2609,7 +2786,8 @@ async function loadAndMergeGraphExtensionDocument(backend, graph) {
 }
 function mergeStoredGraphExtension(graph, activeRow) {
   const storedSchema = parseSerializedSchema(activeRow.schema_doc);
-  const merged = storedSchema.extension === void 0 ? graph : mergeGraphExtension(graph, storedSchema.extension);
+  const compileTimeGraph = stripGraphExtension(graph);
+  const merged = storedSchema.extension === void 0 ? compileTimeGraph : mergeGraphExtension(compileTimeGraph, storedSchema.extension);
   return {
     graph: applyDeprecatedKinds(merged, storedSchema.deprecatedKinds),
     storedSchema
@@ -2683,8 +2861,11 @@ async function ensureSchema(backend, graph, options) {
   }
   const actions = getMigrationActions(diff);
   if (throwOnBreaking) {
-    throw new chunkKTBTSHU6_cjs.MigrationError(
-      `Schema migration required: ${diff.summary}. ${actions.length} migration action(s) needed. Use getSchemaChanges() to review, then migrateSchema() to apply.`,
+    const removesKind = [...diff.nodes, ...diff.edges].some(
+      (change) => change.type === "removed"
+    );
+    throw new chunkC4F7VJ5D_cjs.MigrationError(
+      `Schema migration required: ${diff.summary}. ${actions.length} migration action(s) needed. Use getSchemaChanges() to review, then migrateSchema() to apply.` + (removesKind ? ` This diff removes a kind: migrateSchema() refuses to drop one that still holds rows, so export or delete those rows first and retry.` : ""),
       {
         graphId: graph.id,
         fromVersion: activeSchema.version,
@@ -2736,7 +2917,7 @@ async function assertVectorContributionsInitialized(backend, graph) {
 function schemaBehindError(graphId, fromVersion, diff) {
   const actions = getMigrationActions(diff);
   const qualifier = isBackwardsCompatible(diff) ? "safe auto-migration" : "breaking change";
-  return new chunkKTBTSHU6_cjs.MigrationError(
+  return new chunkC4F7VJ5D_cjs.MigrationError(
     `Schema verification failed for graph "${graphId}": ${diff.summary} (${qualifier}). ${actions.length} migration action(s) needed. The least-privilege runtime cannot migrate \u2014 run createStoreWithSchema(graph, adminBackend) under a privileged role (after any generated migration SQL, if you manage DDL externally) before attaching with createStore() / createVerifiedStore().`,
     {
       graphId,
@@ -2756,7 +2937,7 @@ async function readActiveSchemaPure(backend, graphId) {
   try {
     activeRow = await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (chunkAO2WPYFZ_cjs.isMissingTableError(error)) {
+    if (chunkWBUFJ7BS_cjs.isMissingTableError(error)) {
       throw schemaNotInitializedError(graphId, error);
     }
     throw error;
@@ -2767,7 +2948,7 @@ async function readActiveSchemaPure(backend, graphId) {
   return activeRow;
 }
 function schemaNotInitializedError(graphId, cause) {
-  return new chunkKTBTSHU6_cjs.ConfigurationError(
+  return new chunkC4F7VJ5D_cjs.ConfigurationError(
     `Cannot verify graph "${graphId}": no schema has been initialized. Run createStoreWithSchema(graph, adminBackend) once under a privileged role (which commits the schema_versions row and materializes contribution markers) before attaching with createStore() / createVerifiedStore(). Generated migration SQL creates the tables but does not initialize the schema row.`,
     { graphId },
     {
@@ -2788,31 +2969,96 @@ async function initializeSchema(backend, graph) {
     schemaDoc: schema
   });
 }
-async function migrateSchema(backend, graph, currentVersion) {
-  const committed = await commitNewSchemaVersion(
+async function migrateSchema(backend, graph, currentVersion, options) {
+  const {
+    graph: target,
+    storedSchema,
+    activeRow
+  } = await loadAndMergeGraphExtensionDocument(backend, graph);
+  if (activeRow !== void 0 && activeRow.version !== currentVersion) {
+    throw new chunkC4F7VJ5D_cjs.StaleVersionError({
+      graphId: graph.id,
+      expected: currentVersion,
+      actual: activeRow.version
+    });
+  }
+  const dropped = storedSchema === void 0 ? [] : [
+    ...droppedKinds(storedSchema.nodes, chunkQB6VMOJ2_cjs.getNodeKinds(target), "node"),
+    ...droppedKinds(storedSchema.edges, chunkQB6VMOJ2_cjs.getEdgeKinds(target), "edge")
+  ];
+  const committed = dropped.length > 0 && options?.discardDroppedKindRows !== true ? await commitDroppedKindsOnlyWhenEmpty(
+    backend,
+    target,
+    currentVersion,
+    dropped
+  ) : await commitNewSchemaVersion(backend, target, currentVersion);
+  return committed.version;
+}
+async function commitDroppedKindsOnlyWhenEmpty(backend, graph, currentVersion, dropped) {
+  const result = await commitNewSchemaVersionIfKindsEmpty(
     backend,
     graph,
-    currentVersion
+    currentVersion,
+    dropped
   );
-  return committed.version;
+  if (result.status === "committed") return result.row;
+  throwPopulatedKindRemovalError(graph.id, currentVersion, result.kinds);
+}
+function throwPopulatedKindRemovalError(graphId, currentVersion, populated) {
+  const named = populated.map((entry) => `${entry.entity} "${entry.kind}" (${String(entry.count)})`).join(", ");
+  throw new chunkC4F7VJ5D_cjs.MigrationError(
+    `Refusing to commit a schema for graph "${graphId}" that drops kinds still holding rows: ${named}. Committing would make those rows unreachable, and the next materializeRemovals() would delete them. Export or delete those rows, then retry. Pass { discardDroppedKindRows: true } if losing them is the intent.`,
+    {
+      graphId,
+      fromVersion: currentVersion,
+      toVersion: currentVersion + 1,
+      reason: "kind-removal",
+      droppedKinds: {
+        nodes: populated.filter((entry) => entry.entity === "node").map((entry) => entry.kind),
+        edges: populated.filter((entry) => entry.entity === "edge").map((entry) => entry.kind)
+      }
+    }
+  );
+}
+function droppedKinds(committed, present, entity) {
+  const kinds = new Set(present);
+  return Object.keys(committed).filter((name) => !kinds.has(name)).toSorted().map((kind) => ({ kind, entity }));
 }
 async function commitNewSchemaVersion(backend, graph, currentVersion) {
+  const params = await buildNewSchemaVersionCommit(graph, currentVersion);
+  return backend.commitSchemaVersion(params);
+}
+async function commitNewSchemaVersionIfKindsEmpty(backend, graph, currentVersion, probes) {
+  const params = await buildNewSchemaVersionCommit(graph, currentVersion);
+  const commitIfKindsEmpty = backend.commitSchemaVersionIfKindsEmpty;
+  if (commitIfKindsEmpty === void 0) {
+    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
+      "This backend cannot atomically fence entity writes while checking schema kind emptiness.",
+      {
+        code: "SCHEMA_KIND_EMPTINESS_FENCE_UNSUPPORTED",
+        graphId: graph.id
+      }
+    );
+  }
+  return commitIfKindsEmpty(params, probes);
+}
+async function buildNewSchemaVersionCommit(graph, currentVersion) {
   buildKindRegistry(graph);
   const newVersion = currentVersion + 1;
   const schema = serializeSchema(graph, newVersion);
   const hash = await computeSchemaHash(schema);
-  return backend.commitSchemaVersion({
+  return {
     graphId: graph.id,
     expected: { kind: "active", version: currentVersion },
     version: newVersion,
     schemaHash: hash,
     schemaDoc: schema
-  });
+  };
 }
 async function rollbackSchema(backend, graphId, targetVersion) {
   const activeRow = await backend.getActiveSchema(graphId);
   if (activeRow === void 0) {
-    throw new chunkKTBTSHU6_cjs.MigrationError(
+    throw new chunkC4F7VJ5D_cjs.MigrationError(
       `Cannot rollback graph "${graphId}": no active schema version exists.`,
       {
         graphId,
@@ -2865,6 +3111,7 @@ exports.buildGraphExtensionOntologyKeySet = buildGraphExtensionOntologyKeySet;
 exports.buildKindRegistry = buildKindRegistry;
 exports.classifySchemaChanges = classifySchemaChanges;
 exports.commitNewSchemaVersion = commitNewSchemaVersion;
+exports.commitNewSchemaVersionIfKindsEmpty = commitNewSchemaVersionIfKindsEmpty;
 exports.compileTimeOntologyKey = compileTimeOntologyKey;
 exports.computeSchemaDiff = computeSchemaDiff;
 exports.computeSchemaHash = computeSchemaHash;
@@ -2893,6 +3140,7 @@ exports.migrateSchema = migrateSchema;
 exports.narrower = narrower;
 exports.parseSerializedSchema = parseSerializedSchema;
 exports.partOf = partOf;
+exports.planRemovals = planRemovals;
 exports.relatedTo = relatedTo;
 exports.requiresMigration = requiresMigration;
 exports.rollbackSchema = rollbackSchema;
@@ -2900,7 +3148,8 @@ exports.sameAs = sameAs;
 exports.serializeIndexDeclaration = serializeIndexDeclaration;
 exports.serializeSchema = serializeSchema;
 exports.serializeSchemaProperties = serializeSchemaProperties;
+exports.stripGraphExtension = stripGraphExtension;
 exports.subClassOf = subClassOf;
 exports.validateImpliesEndpointCompatibility = validateImpliesEndpointCompatibility;
-//# sourceMappingURL=chunk-V2GZBPY2.cjs.map
-//# sourceMappingURL=chunk-V2GZBPY2.cjs.map
+//# sourceMappingURL=chunk-2VLBGQBY.cjs.map
+//# sourceMappingURL=chunk-2VLBGQBY.cjs.map