@nicia-ai/typegraph 0.32.0 → 0.34.0

package/dist/{chunk-LAZGHOZW.cjs → chunk-6HVOHZHS.cjs}

@@ -1,31 +1,33 @@
 'use strict';
 
-var chunkEEYV6UOE_cjs = require('./chunk-EEYV6UOE.cjs');
-var chunk6RMLO5O4_cjs = require('./chunk-6RMLO5O4.cjs');
-var chunkYQGLVWB2_cjs = require('./chunk-YQGLVWB2.cjs');
-var chunkZFWNO3GE_cjs = require('./chunk-ZFWNO3GE.cjs');
-var chunkKTIEB7VH_cjs = require('./chunk-KTIEB7VH.cjs');
-var chunkRP7YITHX_cjs = require('./chunk-RP7YITHX.cjs');
-var chunk73KASJGO_cjs = require('./chunk-73KASJGO.cjs');
+var chunkACSVZPK7_cjs = require('./chunk-ACSVZPK7.cjs');
+var chunkT6SPUYLX_cjs = require('./chunk-T6SPUYLX.cjs');
+var chunkRRKQAKD6_cjs = require('./chunk-RRKQAKD6.cjs');
+var chunkZY4GXIVN_cjs = require('./chunk-ZY4GXIVN.cjs');
+var chunkHK5SATYM_cjs = require('./chunk-HK5SATYM.cjs');
+var chunkYC6PWTHY_cjs = require('./chunk-YC6PWTHY.cjs');
+var chunkRHZWOJVA_cjs = require('./chunk-RHZWOJVA.cjs');
+var chunkJQGIPGVL_cjs = require('./chunk-JQGIPGVL.cjs');
+var chunkDI74SMXS_cjs = require('./chunk-DI74SMXS.cjs');
 var chunkJIEJCTDS_cjs = require('./chunk-JIEJCTDS.cjs');
 var zod = require('zod');
 
 // src/core/node.ts
 function validateSchemaKeys(schema, name) {
-  chunkKTIEB7VH_cjs.assertSchemaKeysAreFree(
+  chunkHK5SATYM_cjs.assertSchemaKeysAreFree(
     "Node",
     name,
     Object.keys(schema.shape),
-    chunkKTIEB7VH_cjs.RESERVED_NODE_KEYS
+    chunkHK5SATYM_cjs.RESERVED_NODE_KEYS
   );
 }
 function defineNode(name, options) {
   validateSchemaKeys(options.schema, name);
   if (options.annotations !== void 0) {
-    chunkKTIEB7VH_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
+    chunkHK5SATYM_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
   }
   return Object.freeze({
-    [chunkEEYV6UOE_cjs.NODE_TYPE_BRAND]: true,
+    [chunkT6SPUYLX_cjs.NODE_TYPE_BRAND]: true,
     kind: name,
     schema: options.schema,
     description: options.description,
@@ -34,21 +36,21 @@ function defineNode(name, options) {
 }
 var EMPTY_SCHEMA = zod.z.object({});
 function validateSchemaKeys2(schema, name) {
-  chunkKTIEB7VH_cjs.assertSchemaKeysAreFree(
+  chunkHK5SATYM_cjs.assertSchemaKeysAreFree(
     "Edge",
     name,
     Object.keys(schema.shape),
-    chunkKTIEB7VH_cjs.RESERVED_EDGE_KEYS
+    chunkHK5SATYM_cjs.RESERVED_EDGE_KEYS
   );
 }
 function defineEdge(name, options) {
   const schema = options?.schema ?? EMPTY_SCHEMA;
   validateSchemaKeys2(schema, name);
   if (options?.annotations !== void 0) {
-    chunkKTIEB7VH_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
+    chunkHK5SATYM_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
   }
   return Object.freeze({
-    [chunkEEYV6UOE_cjs.EDGE_TYPE_BRAND]: true,
+    [chunkT6SPUYLX_cjs.EDGE_TYPE_BRAND]: true,
     kind: name,
     schema,
     description: options?.description,
@@ -85,7 +87,7 @@ function createMetaEdge(name, properties) {
     }
   });
 }
-var subClassOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_SUB_CLASS_OF, {
+var subClassOfMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_SUB_CLASS_OF, {
   transitive: true,
   inference: "subsumption",
   description: "Type inheritance (Podcast subClassOf Media)"
@@ -97,9 +99,9 @@ function subClassOf(child, parent) {
     to: parent
   };
 }
-var broaderMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_BROADER, {
+var broaderMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_BROADER, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_NARROWER,
+  inverse: chunkHK5SATYM_cjs.META_EDGE_NARROWER,
   inference: "hierarchy",
   description: "Broader concept (ML broader AI)"
 });
@@ -110,9 +112,9 @@ function broader(narrowerConcept, broaderConcept) {
     to: broaderConcept
   };
 }
-var narrowerMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_NARROWER, {
+var narrowerMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_NARROWER, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_BROADER,
+  inverse: chunkHK5SATYM_cjs.META_EDGE_BROADER,
   inference: "hierarchy",
   description: "Narrower concept (AI narrower ML)"
 });
@@ -123,7 +125,7 @@ function narrower(broaderConcept, narrowerConcept) {
     to: narrowerConcept
   };
 }
-var relatedToMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_RELATED_TO, {
+var relatedToMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_RELATED_TO, {
   symmetric: true,
   inference: "association",
   description: "Non-hierarchical association"
@@ -135,7 +137,7 @@ function relatedTo(conceptA, conceptB) {
     to: conceptB
   };
 }
-var equivalentToMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_EQUIVALENT_TO, {
+var equivalentToMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_EQUIVALENT_TO, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -148,7 +150,7 @@ function equivalentTo(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var sameAsMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_SAME_AS, {
+var sameAsMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_SAME_AS, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -161,7 +163,7 @@ function sameAs(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var differentFromMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_DIFFERENT_FROM, {
+var differentFromMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_DIFFERENT_FROM, {
   symmetric: true,
   inference: "constraint",
   description: "Explicitly different individuals"
@@ -173,7 +175,7 @@ function differentFrom(kindA, kindB) {
     to: kindB
   };
 }
-var disjointWithMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_DISJOINT_WITH, {
+var disjointWithMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_DISJOINT_WITH, {
   symmetric: true,
   inference: "constraint",
   description: "Mutually exclusive types"
@@ -185,9 +187,9 @@ function disjointWith(kindA, kindB) {
     to: kindB
   };
 }
-var partOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_PART_OF, {
+var partOfMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_PART_OF, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_HAS_PART,
+  inverse: chunkHK5SATYM_cjs.META_EDGE_HAS_PART,
   inference: "composition",
   description: "X is part of Y"
 });
@@ -198,9 +200,9 @@ function partOf(part, whole) {
     to: whole
   };
 }
-var hasPartMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_HAS_PART, {
+var hasPartMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_HAS_PART, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_PART_OF,
+  inverse: chunkHK5SATYM_cjs.META_EDGE_PART_OF,
   inference: "composition",
   description: "Y has part X"
 });
@@ -211,12 +213,12 @@ function hasPart(whole, part) {
     to: part
   };
 }
-var inverseOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_INVERSE_OF, {
+var inverseOfMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_INVERSE_OF, {
   symmetric: true,
   inference: "none",
   description: "Edge A is inverse of edge B"
 });
-var impliesMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_IMPLIES, {
+var impliesMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_IMPLIES, {
   transitive: true,
   inference: "none",
   description: "Edge A implies edge B exists"
@@ -346,25 +348,11 @@ function diffNodes(before, after) {
 }
 function diffNodeDef(name, before, after) {
   const changes = [];
-  if (!chunkRP7YITHX_cjs.canonicalEqual(before.properties, after.properties)) {
-    const beforeProps = before.properties.properties ?? {};
-    const afterProps = after.properties.properties ?? {};
-    const beforeRequired = new Set(before.properties.required);
-    const afterRequired = new Set(after.properties.required);
-    const addedProps = Object.keys(afterProps).filter(
-      (p) => !(p in beforeProps)
-    );
-    const removedProps = Object.keys(beforeProps).filter(
-      (p) => !(p in afterProps)
-    );
-    const newRequired = [...afterRequired].filter(
-      (p) => !beforeRequired.has(p)
-    );
-    const { severity, details } = computePropertyChangeSeverity(
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.properties, after.properties)) {
+    const { severity, details } = classifyPropertyChanges(
       name,
-      removedProps,
-      addedProps,
-      newRequired
+      before.properties,
+      after.properties
     );
     changes.push({
       type: "modified",
@@ -385,7 +373,7 @@ function diffNodeDef(name, before, after) {
       after
     });
   }
-  if (!chunkRP7YITHX_cjs.canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -407,29 +395,103 @@ function diffNodeDef(name, before, after) {
   }
   return changes;
 }
-function computePropertyChangeSeverity(name, removedProps, addedProps, newRequired) {
-  if (removedProps.length > 0) {
+function propertyTypeSignature(schema) {
+  if (schema.type !== void 0) return JSON.stringify(schema.type);
+  if (schema.const !== void 0) return "const";
+  if (schema.enum !== void 0) return "enum";
+  if (schema.anyOf !== void 0) return "anyOf";
+  if (schema.oneOf !== void 0) return "oneOf";
+  if (schema.allOf !== void 0) return "allOf";
+  return "unknown";
+}
+var NON_CONSTRAINING_KEYWORDS = /* @__PURE__ */ new Set([
+  "description",
+  "title",
+  "default",
+  "$schema"
+]);
+function stripSchemaMetadata(schema) {
+  const stripped = {};
+  for (const [key, value] of Object.entries(schema)) {
+    if (!NON_CONSTRAINING_KEYWORDS.has(key)) stripped[key] = value;
+  }
+  return stripped;
+}
+function isObjectSchema(schema) {
+  return schema.type === "object" || schema.properties !== void 0;
+}
+function isBreakingPropertyChange(before, after) {
+  if (chunkACSVZPK7_cjs.canonicalEqual(stripSchemaMetadata(before), stripSchemaMetadata(after))) {
+    return false;
+  }
+  if (propertyTypeSignature(before) !== propertyTypeSignature(after)) {
+    return true;
+  }
+  if (isObjectSchema(before) && isObjectSchema(after)) {
+    return isBreakingObjectSchemaChange(before, after);
+  }
+  return true;
+}
+function isBreakingObjectSchemaChange(before, after) {
+  const beforeProps = before.properties ?? {};
+  const afterProps = after.properties ?? {};
+  const beforeRequired = new Set(before.required);
+  const afterRequired = new Set(after.required);
+  for (const key of Object.keys(beforeProps)) {
+    if (!(key in afterProps)) return true;
+  }
+  for (const key of afterRequired) {
+    if (!beforeRequired.has(key)) return true;
+  }
+  for (const [key, beforeChild] of Object.entries(beforeProps)) {
+    const afterChild = afterProps[key];
+    if (afterChild === void 0) continue;
+    if (isBreakingPropertyChange(beforeChild, afterChild)) return true;
+  }
+  return false;
+}
+function classifyPropertyChanges(kind, before, after) {
+  const beforeProps = before.properties ?? {};
+  const afterProps = after.properties ?? {};
+  const beforeRequired = new Set(before.required);
+  const afterRequired = new Set(after.required);
+  const removed = Object.keys(beforeProps).filter((p) => !(p in afterProps));
+  const added = Object.keys(afterProps).filter((p) => !(p in beforeProps));
+  const newRequired = [...afterRequired].filter((p) => !beforeRequired.has(p));
+  const breakingProps = [];
+  for (const [property, beforeProperty] of Object.entries(beforeProps)) {
+    const afterProperty = afterProps[property];
+    if (afterProperty === void 0) continue;
+    if (chunkACSVZPK7_cjs.canonicalEqual(beforeProperty, afterProperty)) continue;
+    if (isBreakingPropertyChange(beforeProperty, afterProperty)) {
+      breakingProps.push(property);
+    }
+  }
+  if (removed.length > 0) {
+    return {
+      severity: "breaking",
+      details: `Properties removed from "${kind}": ${removed.join(", ")}`
+    };
+  }
+  if (breakingProps.length > 0) {
     return {
       severity: "breaking",
-      details: `Properties removed from "${name}": ${removedProps.join(", ")}`
+      details: `Property schemas changed incompatibly in "${kind}": ${breakingProps.join(", ")}`
     };
   }
   if (newRequired.length > 0) {
     return {
       severity: "breaking",
-      details: `New required properties in "${name}": ${newRequired.join(", ")}`
+      details: `New required properties in "${kind}": ${newRequired.join(", ")}`
     };
   }
-  if (addedProps.length > 0) {
+  if (added.length > 0) {
     return {
       severity: "safe",
-      details: `Properties added to "${name}": ${addedProps.join(", ")}`
+      details: `Properties added to "${kind}": ${added.join(", ")}`
     };
   }
-  return {
-    severity: "safe",
-    details: `Properties changed in "${name}"`
-  };
+  return { severity: "safe", details: `Properties changed in "${kind}"` };
 }
 function diffEdges(before, after) {
   const changes = [];
@@ -469,7 +531,7 @@ function diffEdges(before, after) {
 }
 function diffEdgeDef(name, before, after) {
   const changes = [];
-  if (!chunkRP7YITHX_cjs.canonicalEqual(before.fromKinds, after.fromKinds)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.fromKinds, after.fromKinds)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -479,7 +541,7 @@ function diffEdgeDef(name, before, after) {
       after
     });
   }
-  if (!chunkRP7YITHX_cjs.canonicalEqual(before.toKinds, after.toKinds)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.toKinds, after.toKinds)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -499,12 +561,17 @@ function diffEdgeDef(name, before, after) {
       after
     });
   }
-  if (!chunkRP7YITHX_cjs.canonicalEqual(before.properties, after.properties)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.properties, after.properties)) {
+    const { severity, details } = classifyPropertyChanges(
+      name,
+      before.properties,
+      after.properties
+    );
     changes.push({
       type: "modified",
       kind: name,
-      severity: "safe",
-      details: `Properties changed for "${name}"`,
+      severity,
+      details,
       before,
       after
     });
@@ -524,7 +591,7 @@ function diffEdgeDef(name, before, after) {
 function annotationsChanged(before, after) {
   if (before === void 0 && after === void 0) return false;
   if (before === void 0 || after === void 0) return true;
-  return !chunkRP7YITHX_cjs.canonicalEqual(before, after);
+  return !chunkACSVZPK7_cjs.canonicalEqual(before, after);
 }
 function diffOntology(before, after) {
   const changes = [];
@@ -623,7 +690,7 @@ function diffIndexes(before, after) {
   for (const [name, beforeIndex] of beforeByName) {
     const afterIndex = afterByName.get(name);
     if (!afterIndex) continue;
-    if (!chunkRP7YITHX_cjs.canonicalEqual(beforeIndex, afterIndex)) {
+    if (!chunkACSVZPK7_cjs.canonicalEqual(beforeIndex, afterIndex)) {
       changes.push({
         type: "modified",
         name,
@@ -653,7 +720,7 @@ function diffExtension(before, after) {
       details: "Graph extension document was removed"
     };
   }
-  if (chunkRP7YITHX_cjs.canonicalEqual(before, after)) return void 0;
+  if (chunkACSVZPK7_cjs.canonicalEqual(before, after)) return void 0;
   return {
     type: "modified",
     severity: "safe",
@@ -805,7 +872,7 @@ var KindRegistry = class {
    * Checks if child is a subclass of parent (directly or transitively).
    */
   isSubClassOf(child, parent) {
-    return chunkKTIEB7VH_cjs.isReachable(this.subClassAncestors, child, parent);
+    return chunkHK5SATYM_cjs.isReachable(this.subClassAncestors, child, parent);
   }
   /**
    * Expands a kind to include all its subclasses.
@@ -832,13 +899,13 @@ var KindRegistry = class {
    * Checks if narrowerConcept is narrower than broaderConcept.
    */
   isNarrowerThan(narrowerConcept, broaderConcept) {
-    return chunkKTIEB7VH_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
+    return chunkHK5SATYM_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
   }
   /**
    * Checks if broaderConcept is broader than narrowerConcept.
    */
   isBroaderThan(broaderConcept, narrowerConcept) {
-    return chunkKTIEB7VH_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
+    return chunkHK5SATYM_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
   }
   /**
    * Expands to include all narrower concepts.
@@ -902,7 +969,7 @@ var KindRegistry = class {
    * Checks if part is part of whole (directly or transitively).
    */
   isPartOf(part, whole) {
-    return chunkKTIEB7VH_cjs.isReachable(this.partOfClosure, part, whole);
+    return chunkHK5SATYM_cjs.isReachable(this.partOfClosure, part, whole);
   }
   /**
    * Gets all wholes that contain this part.
@@ -1013,57 +1080,57 @@ function computeClosuresFromOntology(ontology) {
     const fromName = getKindName(relation.from);
     const toName = getKindName(relation.to);
     switch (relation.metaEdge.name) {
-      case chunkKTIEB7VH_cjs.META_EDGE_SUB_CLASS_OF: {
+      case chunkHK5SATYM_cjs.META_EDGE_SUB_CLASS_OF: {
         subClassRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_BROADER: {
+      case chunkHK5SATYM_cjs.META_EDGE_BROADER: {
         broaderRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_NARROWER: {
+      case chunkHK5SATYM_cjs.META_EDGE_NARROWER: {
         broaderRelations.push([toName, fromName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_EQUIVALENT_TO:
-      case chunkKTIEB7VH_cjs.META_EDGE_SAME_AS: {
+      case chunkHK5SATYM_cjs.META_EDGE_EQUIVALENT_TO:
+      case chunkHK5SATYM_cjs.META_EDGE_SAME_AS: {
         equivalentRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_DISJOINT_WITH: {
+      case chunkHK5SATYM_cjs.META_EDGE_DISJOINT_WITH: {
         disjointRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_PART_OF: {
+      case chunkHK5SATYM_cjs.META_EDGE_PART_OF: {
         partOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_HAS_PART: {
+      case chunkHK5SATYM_cjs.META_EDGE_HAS_PART: {
         partOfRelations.push([toName, fromName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_INVERSE_OF: {
+      case chunkHK5SATYM_cjs.META_EDGE_INVERSE_OF: {
         inverseOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_IMPLIES: {
+      case chunkHK5SATYM_cjs.META_EDGE_IMPLIES: {
         impliesRelations.push([fromName, toName]);
         break;
       }
     }
   }
-  const subClassAncestors = chunkKTIEB7VH_cjs.computeTransitiveClosure(subClassRelations);
-  const subClassDescendants = chunkKTIEB7VH_cjs.invertClosure(subClassAncestors);
-  const broaderClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(broaderRelations);
-  const narrowerClosure = chunkKTIEB7VH_cjs.invertClosure(broaderClosure);
+  const subClassAncestors = chunkHK5SATYM_cjs.computeTransitiveClosure(subClassRelations);
+  const subClassDescendants = chunkHK5SATYM_cjs.invertClosure(subClassAncestors);
+  const broaderClosure = chunkHK5SATYM_cjs.computeTransitiveClosure(broaderRelations);
+  const narrowerClosure = chunkHK5SATYM_cjs.invertClosure(broaderClosure);
   const equivalenceSets = computeEquivalenceSets(equivalentRelations);
   const iriToKind = computeIriMapping(equivalentRelations);
   const disjointPairs = computeDisjointPairs(disjointRelations);
-  const partOfClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(partOfRelations);
-  const hasPartClosure = chunkKTIEB7VH_cjs.invertClosure(partOfClosure);
+  const partOfClosure = chunkHK5SATYM_cjs.computeTransitiveClosure(partOfRelations);
+  const hasPartClosure = chunkHK5SATYM_cjs.invertClosure(partOfClosure);
   const edgeInverses = computeEdgeInverses(inverseOfRelations);
-  const edgeImplicationsClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(impliesRelations);
-  const edgeImplyingClosure = chunkKTIEB7VH_cjs.invertClosure(edgeImplicationsClosure);
+  const edgeImplicationsClosure = chunkHK5SATYM_cjs.computeTransitiveClosure(impliesRelations);
+  const edgeImplyingClosure = chunkHK5SATYM_cjs.invertClosure(edgeImplicationsClosure);
   return {
     subClassAncestors,
     subClassDescendants,
@@ -1167,7 +1234,7 @@ function serializeSchema(graph, version) {
   return {
     graphId: graph.id,
     version,
-    generatedAt: chunkEEYV6UOE_cjs.nowIso(),
+    generatedAt: chunkYC6PWTHY_cjs.nowIso(),
     nodes,
     edges,
     ontology,
@@ -1198,7 +1265,7 @@ function serializeDeprecatedKinds(set) {
 function canonicalExtension(document) {
   if (document === void 0) return void 0;
   if (document.version === void 0) return document;
-  if (document.version !== chunkKTIEB7VH_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
+  if (document.version !== chunkHK5SATYM_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
   const { version: _omit, ...rest } = document;
   return rest;
 }
@@ -1272,7 +1339,7 @@ function serializeEdgeIndexDeclaration(declaration) {
 }
 function serializeNodes(graph) {
   const result = {};
-  for (const kindName of chunkEEYV6UOE_cjs.getNodeKinds(graph)) {
+  for (const kindName of chunkT6SPUYLX_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeNodeDef(registration);
@@ -1340,7 +1407,7 @@ function deserializeWherePredicate(serialized) {
 }
 function serializeEdges(graph) {
   const result = {};
-  for (const kindName of chunkEEYV6UOE_cjs.getEdgeKinds(graph)) {
+  for (const kindName of chunkT6SPUYLX_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeEdgeDef(registration);
@@ -1488,8 +1555,8 @@ async function computeSchemaHash(schema) {
     ...schema.extension === void 0 ? {} : { extension: schema.extension },
     ...schema.deprecatedKinds === void 0 ? {} : { deprecatedKinds: schema.deprecatedKinds }
   };
-  const json = JSON.stringify(hashable, chunkRP7YITHX_cjs.sortedReplacer);
-  return chunk73KASJGO_cjs.sha256Hex(json);
+  const json = JSON.stringify(hashable, chunkACSVZPK7_cjs.sortedReplacer);
+  return chunkZY4GXIVN_cjs.sha256Hex(json);
 }
 var COMPILE_NODE_CACHE = /* @__PURE__ */ new Map();
 var COMPILE_EDGE_SCHEMA_CACHE = /* @__PURE__ */ new WeakMap();
@@ -1537,7 +1604,7 @@ function compileNode(kindName, document) {
   const schema = buildObjectSchema(document.properties);
   const type = defineNode(
     kindName,
-    chunkKTIEB7VH_cjs.compactUndefined({
+    chunkDI74SMXS_cjs.compactUndefined({
       schema,
       description: document.description,
       annotations: document.annotations
@@ -1561,7 +1628,7 @@ function compileEdge(kindName, document, nodeTypeByName) {
     (name) => nodeTypeByName.get(name) ?? name
   );
   return Object.freeze(
-    chunkKTIEB7VH_cjs.compactUndefined({
+    chunkDI74SMXS_cjs.compactUndefined({
       kindName,
       schema,
       description: document.description,
@@ -1605,7 +1672,7 @@ function compileProperty(property) {
 }
 function compileStringProperty(property) {
   if (property.searchable !== void 0) {
-    return applyStringRefinements(chunkYQGLVWB2_cjs.searchable(property.searchable), property);
+    return applyStringRefinements(chunkJQGIPGVL_cjs.searchable(property.searchable), property);
   }
   if (property.format === void 0) {
     return applyStringRefinements(zod.z.string(), property);
@@ -1655,7 +1722,7 @@ function compileEnumProperty(property) {
 }
 function compileArrayProperty(property) {
   if (property.embedding !== void 0) {
-    return chunkZFWNO3GE_cjs.embedding(property.embedding.dimensions);
+    return chunkJQGIPGVL_cjs.embedding(property.embedding.dimensions);
   }
   const inner = compilePropertyForArrayItem(property.items);
   return zod.z.array(inner);
@@ -1695,7 +1762,7 @@ function makeWherePredicate(field, op) {
   };
 }
 var META_EDGE_BY_NAME = Object.fromEntries(
-  chunkKTIEB7VH_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
+  chunkHK5SATYM_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
 );
 function compileOntologyRelation(relation, nodeTypeByName) {
   const metaEdge = META_EDGE_BY_NAME[relation.metaEdge];
@@ -1731,10 +1798,10 @@ function extensionKindNames(document) {
 function mergeGraphExtension(graph, document) {
   const existingDocument = graph.extension ?? Object.freeze({});
   const unionDocument = unionDocuments(existingDocument, document);
-  if (graph.extension !== void 0 && chunkRP7YITHX_cjs.canonicalEqual(unionDocument, existingDocument)) {
+  if (graph.extension !== void 0 && chunkACSVZPK7_cjs.canonicalEqual(unionDocument, existingDocument)) {
     return graph;
   }
-  const validatedUnion = chunkKTIEB7VH_cjs.unwrap(chunkKTIEB7VH_cjs.validateGraphExtension(unionDocument));
+  const validatedUnion = chunkHK5SATYM_cjs.unwrap(chunkHK5SATYM_cjs.validateGraphExtension(unionDocument));
   const compiled = compileGraphExtension(validatedUnion);
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(existingDocument);
   const nodeKinds = /* @__PURE__ */ new Map();
@@ -1786,7 +1853,7 @@ function mergeGraphExtension(graph, document) {
     });
     const type = defineEdge(
       edge.kindName,
-      chunkKTIEB7VH_cjs.compactUndefined({
+      chunkDI74SMXS_cjs.compactUndefined({
         schema: edge.schema,
         description: edge.description,
         annotations: edge.annotations,
@@ -1836,7 +1903,7 @@ function deriveGraphExtensionVectorIndexes(compiledNodes) {
       ...compiled.unique.length === 0 ? {} : { unique: [...compiled.unique] }
     };
   }
-  return chunkEEYV6UOE_cjs.autoDeriveVectorIndexes(registrations).map(
+  return chunkT6SPUYLX_cjs.autoDeriveVectorIndexes(registrations).map(
     (index) => Object.freeze({ ...index, origin: "runtime" })
   );
 }
@@ -1854,7 +1921,7 @@ function mergeIndexesWithGraphExtension(existing, runtimeIndexes, graphId) {
   const runtimeRelational = runtimeIndexes.filter(
     (index) => index.entity !== "vector"
   );
-  const vectorMerged = chunkEEYV6UOE_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
+  const vectorMerged = chunkT6SPUYLX_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
   const merged = [...vectorMerged, ...runtimeRelational];
   assertUniqueIndexNames(merged, graphId);
   return merged;
@@ -1887,7 +1954,7 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
           suggestion: "Declare the kind under `nodes` in this graph extension, or remove the index from `indexes`."
         });
       }
-      const declaration2 = chunk6RMLO5O4_cjs.defineNodeIndex(
+      const declaration2 = chunkRRKQAKD6_cjs.defineNodeIndex(
         node,
         toNodeIndexConfig(document)
       );
@@ -1901,7 +1968,7 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
         suggestion: "Declare the edge under `edges` in this graph extension, or remove the index from `indexes`."
       });
     }
-    const declaration = chunk6RMLO5O4_cjs.defineEdgeIndex(
+    const declaration = chunkRRKQAKD6_cjs.defineEdgeIndex(
       edgeRegistration.type,
       toEdgeIndexConfig(document)
     );
@@ -1922,7 +1989,7 @@ function buildWhereCallback(where) {
   };
 }
 function toNodeIndexConfig(document) {
-  return chunkKTIEB7VH_cjs.compactUndefined({
+  return chunkDI74SMXS_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -1932,7 +1999,7 @@ function toNodeIndexConfig(document) {
   });
 }
 function toEdgeIndexConfig(document) {
-  return chunkKTIEB7VH_cjs.compactUndefined({
+  return chunkDI74SMXS_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -1988,14 +2055,14 @@ function isEmptyExtension(extension) {
 }
 function assertNoCollision(kindName, entity, collides, graphId) {
   if (!collides) return;
-  throw new chunkKTIEB7VH_cjs.KindCollisionError(kindName, entity, graphId);
+  throw new chunkHK5SATYM_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 chunkKTIEB7VH_cjs.GraphExtensionUnresolvedEndpointError(
+      throw new chunkHK5SATYM_cjs.GraphExtensionUnresolvedEndpointError(
         context.edgeKind,
         context.side,
         entry,
@@ -2353,7 +2420,7 @@ function parseSerializedSchema(json) {
       { operation: "select", entity: "schema" }
     );
   }
-  const validated = chunkKTIEB7VH_cjs.freezeDeep(result.data);
+  const validated = chunkDI74SMXS_cjs.freezeDeep(result.data);
   if (PARSE_CACHE.size >= PARSE_CACHE_LIMIT) {
     const oldest = PARSE_CACHE.keys().next().value;
     if (oldest !== void 0) PARSE_CACHE.delete(oldest);
@@ -2365,7 +2432,7 @@ async function loadActiveSchemaWithBootstrap(backend, graphId) {
   try {
     return await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (backend.bootstrapTables && chunkRP7YITHX_cjs.isMissingTableError(error)) {
+    if (backend.bootstrapTables && chunkRHZWOJVA_cjs.isMissingTableError(error)) {
       await backend.bootstrapTables();
       return await backend.getActiveSchema(graphId);
     }
@@ -2513,7 +2580,7 @@ async function readActiveSchemaPure(backend, graphId) {
   try {
     activeRow = await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (chunkRP7YITHX_cjs.isMissingTableError(error)) {
+    if (chunkRHZWOJVA_cjs.isMissingTableError(error)) {
       throw schemaNotInitializedError(graphId, error);
     }
     throw error;
@@ -2718,5 +2785,5 @@ exports.validateEdgeProps = validateEdgeProps;
 exports.validateNodeProps = validateNodeProps;
 exports.validateProps = validateProps;
 exports.wrapZodError = wrapZodError;
-//# sourceMappingURL=chunk-LAZGHOZW.cjs.map
-//# sourceMappingURL=chunk-LAZGHOZW.cjs.map
+//# sourceMappingURL=chunk-6HVOHZHS.cjs.map
+//# sourceMappingURL=chunk-6HVOHZHS.cjs.map