@nicia-ai/typegraph 0.48.0 → 0.50.0

package/dist/{chunk-GYEG3ZLZ.cjs → chunk-RJMHU2MG.cjs}

@@ -1,8 +1,9 @@
 'use strict';
 
 var chunkXUO3KQFO_cjs = require('./chunk-XUO3KQFO.cjs');
-var chunk6NGW27EO_cjs = require('./chunk-6NGW27EO.cjs');
-var chunkMRDBBHIZ_cjs = require('./chunk-MRDBBHIZ.cjs');
+var chunkVLBTRXA2_cjs = require('./chunk-VLBTRXA2.cjs');
+var chunkRWUWTJQY_cjs = require('./chunk-RWUWTJQY.cjs');
+var chunkX4GDXBOP_cjs = require('./chunk-X4GDXBOP.cjs');
 var chunkA7J2YDDI_cjs = require('./chunk-A7J2YDDI.cjs');
 var chunkN66HCGCY_cjs = require('./chunk-N66HCGCY.cjs');
 
@@ -87,7 +88,7 @@ var GRAPH_EXTENSION_ISSUE_CODES = [
   "EMPTY_INDEX_FIELDS",
   "UNKNOWN_PROPERTY_KEY"
 ];
-var GraphExtensionError = class extends chunkMRDBBHIZ_cjs.TypeGraphError {
+var GraphExtensionError = class extends chunkX4GDXBOP_cjs.TypeGraphError {
   constructor(spec) {
     super(spec.message, spec.code, {
       details: spec.details,
@@ -299,6 +300,73 @@ function isExternalIri(value) {
 }
 
 // src/registry/kind-registry.ts
+var DISJOINT_PAIR_SEPARATOR = "|";
+var ENCODED_DISJOINT_PAIR_PREFIX = "pair";
+function encodeLengthPrefixed(value) {
+  return `${value.length}:${value}`;
+}
+function disjointPairLabel(leftKind, rightKind) {
+  const [first, second] = leftKind < rightKind ? [leftKind, rightKind] : [rightKind, leftKind];
+  if (!first.includes(DISJOINT_PAIR_SEPARATOR) && !second.includes(DISJOINT_PAIR_SEPARATOR)) {
+    return `${first}${DISJOINT_PAIR_SEPARATOR}${second}`;
+  }
+  return `${ENCODED_DISJOINT_PAIR_PREFIX}${encodeLengthPrefixed(first)}${encodeLengthPrefixed(second)}`;
+}
+function readLengthPrefixed(label, offset) {
+  const lengthSeparator = label.indexOf(":", offset);
+  const lengthText = label.slice(offset, lengthSeparator);
+  if (lengthSeparator === -1 || !/^\d+$/u.test(lengthText)) {
+    throw new Error(`Invalid disjoint-pair label ${JSON.stringify(label)}.`);
+  }
+  const start = lengthSeparator + 1;
+  const end = start + Number(lengthText);
+  if (end > label.length) {
+    throw new Error(`Invalid disjoint-pair label ${JSON.stringify(label)}.`);
+  }
+  return { value: label.slice(start, end), nextOffset: end };
+}
+function disjointPairMembers(label) {
+  if (!label.startsWith(ENCODED_DISJOINT_PAIR_PREFIX)) {
+    const [first2, second2] = label.split(DISJOINT_PAIR_SEPARATOR);
+    return [chunkN66HCGCY_cjs.requireDefined(first2), chunkN66HCGCY_cjs.requireDefined(second2)];
+  }
+  const first = readLengthPrefixed(label, ENCODED_DISJOINT_PAIR_PREFIX.length);
+  const second = readLengthPrefixed(label, first.nextOffset);
+  if (second.nextOffset !== label.length) {
+    throw new Error(`Invalid disjoint-pair label ${JSON.stringify(label)}.`);
+  }
+  return [first.value, second.value];
+}
+function computeSubClassComponents(nodeKinds, ancestors, descendants) {
+  const components = /* @__PURE__ */ new Map();
+  const knownKinds = /* @__PURE__ */ new Set([
+    ...nodeKinds.keys(),
+    ...ancestors.keys(),
+    ...descendants.keys()
+  ]);
+  for (const kind of knownKinds) {
+    if (components.has(kind)) continue;
+    const members = /* @__PURE__ */ new Set([kind]);
+    const pending = [kind];
+    while (pending.length > 0) {
+      const current = chunkN66HCGCY_cjs.requireDefined(pending.pop());
+      const neighbors = [
+        ...ancestors.get(current) ?? [],
+        ...descendants.get(current) ?? []
+      ];
+      for (const neighbor of neighbors) {
+        if (members.has(neighbor)) continue;
+        members.add(neighbor);
+        pending.push(neighbor);
+      }
+    }
+    const component = Object.freeze(
+      [...members].toSorted((left, right) => chunkRWUWTJQY_cjs.compareStrings(left, right))
+    );
+    for (const member of members) components.set(member, component);
+  }
+  return components;
+}
 var KindRegistry = class {
   // === Node & Edge Kinds ===
   nodeKinds;
@@ -313,6 +381,7 @@ var KindRegistry = class {
   // Transitive closure for inheritance
   subClassAncestors;
   subClassDescendants;
+  #subClassComponents;
   // === Hierarchy (broader/narrower) ===
   // Transitive closure for concept hierarchy (separate from subClassOf!)
   broaderClosure;
@@ -323,7 +392,7 @@ var KindRegistry = class {
   relatedKinds;
   // === Constraints ===
   disjointPairs;
-  // Normalized pairs: "Organization|Person"
+  // Injectively encoded unordered pairs
   // === Composition ===
   partOfClosure;
   hasPartClosure;
@@ -337,6 +406,11 @@ var KindRegistry = class {
     this.identity = identity;
     this.subClassAncestors = closures.subClassAncestors;
     this.subClassDescendants = closures.subClassDescendants;
+    this.#subClassComponents = computeSubClassComponents(
+      nodeKinds,
+      closures.subClassAncestors,
+      closures.subClassDescendants
+    );
     this.broaderClosure = closures.broaderClosure;
     this.narrowerClosure = closures.narrowerClosure;
     this.equivalenceSets = closures.equivalenceSets;
@@ -376,6 +450,13 @@ var KindRegistry = class {
   getDescendants(kind) {
     return this.subClassDescendants.get(kind) ?? /* @__PURE__ */ new Set();
   }
+  /**
+   * Returns the precomputed undirected `subClassOf` component containing kind,
+   * in code-point order. Every member of one component returns the same array.
+   */
+  getSubClassComponent(kind) {
+    return this.#subClassComponents.get(kind) ?? [kind];
+  }
   // === Hierarchy Methods ===
   /**
    * Checks if narrowerConcept is narrower than broaderConcept.
@@ -430,12 +511,37 @@ var KindRegistry = class {
     return related === void 0 ? [] : [...related];
   }
   // === Constraint Methods ===
+  /**
+   * THE canonical label of an unordered pair of kinds — the form
+   * {@link disjointPairs} stores, and the form a disjointness CLAIM AXIS is
+   * folded from.
+   *
+   * Exposed on the registry because the claim axis needs it: a fence keyed on
+   * a second spelling of this normalization would put the two kinds of one
+   * disjoint pair on two rows that can never collide, which is exactly the
+   * failure the fence exists to prevent. One expression, called by the
+   * membership test, by the pair computation, and by the axis.
+   */
+  disjointPairLabel(a, b) {
+    return disjointPairLabel(a, b);
+  }
   /**
    * Checks if two kinds are disjoint.
    */
   areDisjoint(a, b) {
-    const normalizedPair = a < b ? `${a}|${b}` : `${b}|${a}`;
-    return this.disjointPairs.has(normalizedPair);
+    return this.disjointPairs.has(disjointPairLabel(a, b));
+  }
+  /**
+   * Every declared disjoint pair, once each, as the two kinds it names.
+   *
+   * The inverse of {@link disjointPairLabel} lives in this module alone, so a
+   * caller enumerating the pairs — the fence audit is the one that needs them —
+   * never has to know how a label is spelled. Iterating the kinds and folding
+   * {@link getDisjointKinds} would be a second, order-dependent spelling of
+   * exactly this set.
+   */
+  disjointKindPairs() {
+    return [...this.disjointPairs].map((pair) => disjointPairMembers(pair));
   }
   /**
    * Gets all kinds that are disjoint with the given kind.
@@ -443,9 +549,7 @@ var KindRegistry = class {
   getDisjointKinds(kind) {
     const result = [];
     for (const pair of this.disjointPairs) {
-      const parts = pair.split("|");
-      const firstKind = chunkN66HCGCY_cjs.requireDefined(parts[0]);
-      const secondKind = chunkN66HCGCY_cjs.requireDefined(parts[1]);
+      const [firstKind, secondKind] = disjointPairMembers(pair);
       if (firstKind === kind) result.push(secondKind);
       else if (secondKind === kind) result.push(firstKind);
     }
@@ -820,8 +924,7 @@ function computeDisjointPairs(relations, closures) {
     for (const left of leftKinds) {
       for (const right of rightKinds) {
         if (left === right) continue;
-        const normalized = left < right ? `${left}|${right}` : `${right}|${left}`;
-        result.add(normalized);
+        result.add(disjointPairLabel(left, right));
       }
     }
   }
@@ -1709,10 +1812,10 @@ function validateGraphExtensionIndexWhere(raw, path, issues, strict) {
   });
 }
 function refuseUnstorablePropertyName(propertyName, propertyPath, owner, issues) {
-  if (!chunk6NGW27EO_cjs.isUnstorablePropertyName(propertyName)) return false;
+  if (!chunkVLBTRXA2_cjs.isUnstorablePropertyName(propertyName)) return false;
   issues.push({
     path: propertyPath,
-    message: `Property name "${propertyName}" is not allowed for ${owner}: ${chunk6NGW27EO_cjs.UNSTORABLE_PROPERTY_NAME_REASON}.`,
+    message: `Property name "${propertyName}" is not allowed for ${owner}: ${chunkVLBTRXA2_cjs.UNSTORABLE_PROPERTY_NAME_REASON}.`,
     code: "RESERVED_PROPERTY_NAME"
   });
   return true;
@@ -1726,7 +1829,7 @@ function validatePropertiesMap(raw, path, ownerType, ownerName, issues, strict)
     });
     return void 0;
   }
-  const reserved = ownerType === "node" ? chunk6NGW27EO_cjs.RESERVED_NODE_KEYS : chunk6NGW27EO_cjs.RESERVED_EDGE_KEYS;
+  const reserved = ownerType === "node" ? chunkVLBTRXA2_cjs.RESERVED_NODE_KEYS : chunkVLBTRXA2_cjs.RESERVED_EDGE_KEYS;
   const result = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [propertyName, propertyValue] of Object.entries(raw)) {
     const propertyPath = `${path}/${chunkA7J2YDDI_cjs.encodeJsonPointerSegment(propertyName)}`;
@@ -2408,9 +2511,9 @@ function validateAnnotations(raw, path, ownerLabel, issues) {
     return void 0;
   }
   try {
-    chunk6NGW27EO_cjs.assertJsonValue(raw, "annotations", ownerLabel);
+    chunkVLBTRXA2_cjs.assertJsonValue(raw, "annotations", ownerLabel);
   } catch (error) {
-    if (error instanceof chunkMRDBBHIZ_cjs.ConfigurationError) {
+    if (error instanceof chunkX4GDXBOP_cjs.ConfigurationError) {
       const detailPath = error.details["path"];
       const annotationPath = typeof detailPath === "string" ? `${path}/${detailPath.replace(/^annotations\.?/, "").replaceAll(".", "/")}` : path;
       issues.push({
@@ -2526,5 +2629,5 @@ exports.ok = ok;
 exports.unwrap = unwrap;
 exports.validateGraphExtension = validateGraphExtension;
 exports.validateOntologyRelations = validateOntologyRelations;
-//# sourceMappingURL=chunk-GYEG3ZLZ.cjs.map
-//# sourceMappingURL=chunk-GYEG3ZLZ.cjs.map
+//# sourceMappingURL=chunk-RJMHU2MG.cjs.map
+//# sourceMappingURL=chunk-RJMHU2MG.cjs.map