@nicia-ai/typegraph 0.48.0 → 0.50.0

package/dist/{chunk-D5R42W5D.js → chunk-XZW2CTNO.js}

@@ -1,6 +1,7 @@
 import { ALL_META_EDGE_NAMES, META_EDGE_DISJOINT_WITH, META_EDGE_INVERSE_OF, META_EDGE_IMPLIES, META_EDGE_HAS_PART, META_EDGE_PART_OF, META_EDGE_RELATED_TO, META_EDGE_SAME_AS, META_EDGE_EQUIVALENT_TO, META_EDGE_NARROWER, META_EDGE_BROADER, META_EDGE_SUB_CLASS_OF } from './chunk-JXXDZTMN.js';
-import { RESERVED_NODE_KEYS, RESERVED_EDGE_KEYS, assertJsonValue, isUnstorablePropertyName, UNSTORABLE_PROPERTY_NAME_REASON } from './chunk-XVWOYKIK.js';
-import { TypeGraphError, ConfigurationError } from './chunk-ZLONH2UD.js';
+import { RESERVED_NODE_KEYS, RESERVED_EDGE_KEYS, assertJsonValue, isUnstorablePropertyName, UNSTORABLE_PROPERTY_NAME_REASON } from './chunk-FZHF5UWR.js';
+import { compareStrings } from './chunk-HZUB5CON.js';
+import { TypeGraphError, ConfigurationError } from './chunk-YDEJQWOL.js';
 import { encodeJsonPointerSegment } from './chunk-FWJKWH6U.js';
 import { requireDefined, isPlainObject, createDataKeyedBag, compactUndefined, hasOwnKey, freezeDeep } from './chunk-DYATYRY4.js';
 
@@ -297,6 +298,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 [requireDefined(first2), 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 = 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) => compareStrings(left, right))
+    );
+    for (const member of members) components.set(member, component);
+  }
+  return components;
+}
 var KindRegistry = class {
   // === Node & Edge Kinds ===
   nodeKinds;
@@ -311,6 +379,7 @@ var KindRegistry = class {
   // Transitive closure for inheritance
   subClassAncestors;
   subClassDescendants;
+  #subClassComponents;
   // === Hierarchy (broader/narrower) ===
   // Transitive closure for concept hierarchy (separate from subClassOf!)
   broaderClosure;
@@ -321,7 +390,7 @@ var KindRegistry = class {
   relatedKinds;
   // === Constraints ===
   disjointPairs;
-  // Normalized pairs: "Organization|Person"
+  // Injectively encoded unordered pairs
   // === Composition ===
   partOfClosure;
   hasPartClosure;
@@ -335,6 +404,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;
@@ -374,6 +448,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.
@@ -428,12 +509,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.
@@ -441,9 +547,7 @@ var KindRegistry = class {
   getDisjointKinds(kind) {
     const result = [];
     for (const pair of this.disjointPairs) {
-      const parts = pair.split("|");
-      const firstKind = requireDefined(parts[0]);
-      const secondKind = requireDefined(parts[1]);
+      const [firstKind, secondKind] = disjointPairMembers(pair);
       if (firstKind === kind) result.push(secondKind);
       else if (secondKind === kind) result.push(firstKind);
     }
@@ -818,8 +922,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));
       }
     }
   }
@@ -2496,5 +2599,5 @@ function freezeDocument(input) {
 }
 
 export { CURRENT_GRAPH_EXTENSION_VERSION, GRAPH_EXTENSION_ISSUE_CODES, GRAPH_EXTENSION_TOP_LEVEL_KEYS, GraphExtensionError, GraphExtensionUnresolvedEndpointError, GraphExtensionUnresolvedOntologyEndpointError, GraphExtensionValidationError, GraphExtensionVersionUnsupportedError, INCOMPATIBLE_CHANGE_TYPES, IncompatibleChangeError, KindCollisionError, KindHasReferentsError, KindRegistry, LEGACY_GRAPH_EXTENSION_VERSION, RemoveCompileTimeKindError, computeClosuresFromNamedOntology, computeClosuresFromOntology, computeTransitiveClosure, createEmptyClosures, err, invertClosure, isErr, isExternalIri, isOk, isReachable, ok, unwrap, validateGraphExtension, validateOntologyRelations };
-//# sourceMappingURL=chunk-D5R42W5D.js.map
-//# sourceMappingURL=chunk-D5R42W5D.js.map
+//# sourceMappingURL=chunk-XZW2CTNO.js.map
+//# sourceMappingURL=chunk-XZW2CTNO.js.map