@nicia-ai/typegraph 0.30.0 → 0.32.0

package/dist/{chunk-K4N35E7B.cjs → chunk-LAZGHOZW.cjs}

@@ -1,30 +1,31 @@
 'use strict';
 
-var chunk7JGLPAFV_cjs = require('./chunk-7JGLPAFV.cjs');
-var chunkSGPXKJ4A_cjs = require('./chunk-SGPXKJ4A.cjs');
-var chunkRP7YITHX_cjs = require('./chunk-RP7YITHX.cjs');
-var chunk4BXHVEFB_cjs = require('./chunk-4BXHVEFB.cjs');
+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 chunkJIEJCTDS_cjs = require('./chunk-JIEJCTDS.cjs');
 var zod = require('zod');
 
 // src/core/node.ts
 function validateSchemaKeys(schema, name) {
-  chunkSGPXKJ4A_cjs.assertSchemaKeysAreFree(
+  chunkKTIEB7VH_cjs.assertSchemaKeysAreFree(
     "Node",
     name,
     Object.keys(schema.shape),
-    chunkSGPXKJ4A_cjs.RESERVED_NODE_KEYS
+    chunkKTIEB7VH_cjs.RESERVED_NODE_KEYS
   );
 }
 function defineNode(name, options) {
   validateSchemaKeys(options.schema, name);
   if (options.annotations !== void 0) {
-    chunkSGPXKJ4A_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
+    chunkKTIEB7VH_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
   }
   return Object.freeze({
-    [chunk7JGLPAFV_cjs.NODE_TYPE_BRAND]: true,
+    [chunkEEYV6UOE_cjs.NODE_TYPE_BRAND]: true,
     kind: name,
     schema: options.schema,
     description: options.description,
@@ -33,21 +34,21 @@ function defineNode(name, options) {
 }
 var EMPTY_SCHEMA = zod.z.object({});
 function validateSchemaKeys2(schema, name) {
-  chunkSGPXKJ4A_cjs.assertSchemaKeysAreFree(
+  chunkKTIEB7VH_cjs.assertSchemaKeysAreFree(
     "Edge",
     name,
     Object.keys(schema.shape),
-    chunkSGPXKJ4A_cjs.RESERVED_EDGE_KEYS
+    chunkKTIEB7VH_cjs.RESERVED_EDGE_KEYS
   );
 }
 function defineEdge(name, options) {
   const schema = options?.schema ?? EMPTY_SCHEMA;
   validateSchemaKeys2(schema, name);
   if (options?.annotations !== void 0) {
-    chunkSGPXKJ4A_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
+    chunkKTIEB7VH_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
   }
   return Object.freeze({
-    [chunk7JGLPAFV_cjs.EDGE_TYPE_BRAND]: true,
+    [chunkEEYV6UOE_cjs.EDGE_TYPE_BRAND]: true,
     kind: name,
     schema,
     description: options?.description,
@@ -84,7 +85,7 @@ function createMetaEdge(name, properties) {
     }
   });
 }
-var subClassOfMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_SUB_CLASS_OF, {
+var subClassOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_SUB_CLASS_OF, {
   transitive: true,
   inference: "subsumption",
   description: "Type inheritance (Podcast subClassOf Media)"
@@ -96,9 +97,9 @@ function subClassOf(child, parent) {
     to: parent
   };
 }
-var broaderMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_BROADER, {
+var broaderMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_BROADER, {
   transitive: true,
-  inverse: chunkSGPXKJ4A_cjs.META_EDGE_NARROWER,
+  inverse: chunkKTIEB7VH_cjs.META_EDGE_NARROWER,
   inference: "hierarchy",
   description: "Broader concept (ML broader AI)"
 });
@@ -109,9 +110,9 @@ function broader(narrowerConcept, broaderConcept) {
     to: broaderConcept
   };
 }
-var narrowerMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_NARROWER, {
+var narrowerMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_NARROWER, {
   transitive: true,
-  inverse: chunkSGPXKJ4A_cjs.META_EDGE_BROADER,
+  inverse: chunkKTIEB7VH_cjs.META_EDGE_BROADER,
   inference: "hierarchy",
   description: "Narrower concept (AI narrower ML)"
 });
@@ -122,7 +123,7 @@ function narrower(broaderConcept, narrowerConcept) {
     to: narrowerConcept
   };
 }
-var relatedToMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_RELATED_TO, {
+var relatedToMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_RELATED_TO, {
   symmetric: true,
   inference: "association",
   description: "Non-hierarchical association"
@@ -134,7 +135,7 @@ function relatedTo(conceptA, conceptB) {
     to: conceptB
   };
 }
-var equivalentToMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_EQUIVALENT_TO, {
+var equivalentToMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_EQUIVALENT_TO, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -147,7 +148,7 @@ function equivalentTo(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var sameAsMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_SAME_AS, {
+var sameAsMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_SAME_AS, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -160,7 +161,7 @@ function sameAs(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var differentFromMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_DIFFERENT_FROM, {
+var differentFromMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_DIFFERENT_FROM, {
   symmetric: true,
   inference: "constraint",
   description: "Explicitly different individuals"
@@ -172,7 +173,7 @@ function differentFrom(kindA, kindB) {
     to: kindB
   };
 }
-var disjointWithMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_DISJOINT_WITH, {
+var disjointWithMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_DISJOINT_WITH, {
   symmetric: true,
   inference: "constraint",
   description: "Mutually exclusive types"
@@ -184,9 +185,9 @@ function disjointWith(kindA, kindB) {
     to: kindB
   };
 }
-var partOfMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_PART_OF, {
+var partOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_PART_OF, {
   transitive: true,
-  inverse: chunkSGPXKJ4A_cjs.META_EDGE_HAS_PART,
+  inverse: chunkKTIEB7VH_cjs.META_EDGE_HAS_PART,
   inference: "composition",
   description: "X is part of Y"
 });
@@ -197,9 +198,9 @@ function partOf(part, whole) {
     to: whole
   };
 }
-var hasPartMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_HAS_PART, {
+var hasPartMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_HAS_PART, {
   transitive: true,
-  inverse: chunkSGPXKJ4A_cjs.META_EDGE_PART_OF,
+  inverse: chunkKTIEB7VH_cjs.META_EDGE_PART_OF,
   inference: "composition",
   description: "Y has part X"
 });
@@ -210,12 +211,12 @@ function hasPart(whole, part) {
     to: part
   };
 }
-var inverseOfMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_INVERSE_OF, {
+var inverseOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_INVERSE_OF, {
   symmetric: true,
   inference: "none",
   description: "Edge A is inverse of edge B"
 });
-var impliesMetaEdge = createMetaEdge(chunkSGPXKJ4A_cjs.META_EDGE_IMPLIES, {
+var impliesMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_IMPLIES, {
   transitive: true,
   inference: "none",
   description: "Edge A implies edge B exists"
@@ -804,7 +805,7 @@ var KindRegistry = class {
    * Checks if child is a subclass of parent (directly or transitively).
    */
   isSubClassOf(child, parent) {
-    return chunkSGPXKJ4A_cjs.isReachable(this.subClassAncestors, child, parent);
+    return chunkKTIEB7VH_cjs.isReachable(this.subClassAncestors, child, parent);
   }
   /**
    * Expands a kind to include all its subclasses.
@@ -831,13 +832,13 @@ var KindRegistry = class {
    * Checks if narrowerConcept is narrower than broaderConcept.
    */
   isNarrowerThan(narrowerConcept, broaderConcept) {
-    return chunkSGPXKJ4A_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
+    return chunkKTIEB7VH_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
   }
   /**
    * Checks if broaderConcept is broader than narrowerConcept.
    */
   isBroaderThan(broaderConcept, narrowerConcept) {
-    return chunkSGPXKJ4A_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
+    return chunkKTIEB7VH_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
   }
   /**
    * Expands to include all narrower concepts.
@@ -901,7 +902,7 @@ var KindRegistry = class {
    * Checks if part is part of whole (directly or transitively).
    */
   isPartOf(part, whole) {
-    return chunkSGPXKJ4A_cjs.isReachable(this.partOfClosure, part, whole);
+    return chunkKTIEB7VH_cjs.isReachable(this.partOfClosure, part, whole);
   }
   /**
    * Gets all wholes that contain this part.
@@ -1012,57 +1013,57 @@ function computeClosuresFromOntology(ontology) {
     const fromName = getKindName(relation.from);
     const toName = getKindName(relation.to);
     switch (relation.metaEdge.name) {
-      case chunkSGPXKJ4A_cjs.META_EDGE_SUB_CLASS_OF: {
+      case chunkKTIEB7VH_cjs.META_EDGE_SUB_CLASS_OF: {
         subClassRelations.push([fromName, toName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_BROADER: {
+      case chunkKTIEB7VH_cjs.META_EDGE_BROADER: {
         broaderRelations.push([fromName, toName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_NARROWER: {
+      case chunkKTIEB7VH_cjs.META_EDGE_NARROWER: {
         broaderRelations.push([toName, fromName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_EQUIVALENT_TO:
-      case chunkSGPXKJ4A_cjs.META_EDGE_SAME_AS: {
+      case chunkKTIEB7VH_cjs.META_EDGE_EQUIVALENT_TO:
+      case chunkKTIEB7VH_cjs.META_EDGE_SAME_AS: {
         equivalentRelations.push([fromName, toName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_DISJOINT_WITH: {
+      case chunkKTIEB7VH_cjs.META_EDGE_DISJOINT_WITH: {
         disjointRelations.push([fromName, toName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_PART_OF: {
+      case chunkKTIEB7VH_cjs.META_EDGE_PART_OF: {
         partOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_HAS_PART: {
+      case chunkKTIEB7VH_cjs.META_EDGE_HAS_PART: {
         partOfRelations.push([toName, fromName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_INVERSE_OF: {
+      case chunkKTIEB7VH_cjs.META_EDGE_INVERSE_OF: {
         inverseOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkSGPXKJ4A_cjs.META_EDGE_IMPLIES: {
+      case chunkKTIEB7VH_cjs.META_EDGE_IMPLIES: {
         impliesRelations.push([fromName, toName]);
         break;
       }
     }
   }
-  const subClassAncestors = chunkSGPXKJ4A_cjs.computeTransitiveClosure(subClassRelations);
-  const subClassDescendants = chunkSGPXKJ4A_cjs.invertClosure(subClassAncestors);
-  const broaderClosure = chunkSGPXKJ4A_cjs.computeTransitiveClosure(broaderRelations);
-  const narrowerClosure = chunkSGPXKJ4A_cjs.invertClosure(broaderClosure);
+  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 equivalenceSets = computeEquivalenceSets(equivalentRelations);
   const iriToKind = computeIriMapping(equivalentRelations);
   const disjointPairs = computeDisjointPairs(disjointRelations);
-  const partOfClosure = chunkSGPXKJ4A_cjs.computeTransitiveClosure(partOfRelations);
-  const hasPartClosure = chunkSGPXKJ4A_cjs.invertClosure(partOfClosure);
+  const partOfClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(partOfRelations);
+  const hasPartClosure = chunkKTIEB7VH_cjs.invertClosure(partOfClosure);
   const edgeInverses = computeEdgeInverses(inverseOfRelations);
-  const edgeImplicationsClosure = chunkSGPXKJ4A_cjs.computeTransitiveClosure(impliesRelations);
-  const edgeImplyingClosure = chunkSGPXKJ4A_cjs.invertClosure(edgeImplicationsClosure);
+  const edgeImplicationsClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(impliesRelations);
+  const edgeImplyingClosure = chunkKTIEB7VH_cjs.invertClosure(edgeImplicationsClosure);
   return {
     subClassAncestors,
     subClassDescendants,
@@ -1166,7 +1167,7 @@ function serializeSchema(graph, version) {
   return {
     graphId: graph.id,
     version,
-    generatedAt: chunk7JGLPAFV_cjs.nowIso(),
+    generatedAt: chunkEEYV6UOE_cjs.nowIso(),
     nodes,
     edges,
     ontology,
@@ -1197,7 +1198,7 @@ function serializeDeprecatedKinds(set) {
 function canonicalExtension(document) {
   if (document === void 0) return void 0;
   if (document.version === void 0) return document;
-  if (document.version !== chunkSGPXKJ4A_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
+  if (document.version !== chunkKTIEB7VH_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
   const { version: _omit, ...rest } = document;
   return rest;
 }
@@ -1271,7 +1272,7 @@ function serializeEdgeIndexDeclaration(declaration) {
 }
 function serializeNodes(graph) {
   const result = {};
-  for (const kindName of chunk7JGLPAFV_cjs.getNodeKinds(graph)) {
+  for (const kindName of chunkEEYV6UOE_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeNodeDef(registration);
@@ -1339,7 +1340,7 @@ function deserializeWherePredicate(serialized) {
 }
 function serializeEdges(graph) {
   const result = {};
-  for (const kindName of chunk7JGLPAFV_cjs.getEdgeKinds(graph)) {
+  for (const kindName of chunkEEYV6UOE_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeEdgeDef(registration);
@@ -1488,7 +1489,7 @@ async function computeSchemaHash(schema) {
     ...schema.deprecatedKinds === void 0 ? {} : { deprecatedKinds: schema.deprecatedKinds }
   };
   const json = JSON.stringify(hashable, chunkRP7YITHX_cjs.sortedReplacer);
-  return chunk4BXHVEFB_cjs.sha256Hex(json);
+  return chunk73KASJGO_cjs.sha256Hex(json);
 }
 var COMPILE_NODE_CACHE = /* @__PURE__ */ new Map();
 var COMPILE_EDGE_SCHEMA_CACHE = /* @__PURE__ */ new WeakMap();
@@ -1536,7 +1537,7 @@ function compileNode(kindName, document) {
   const schema = buildObjectSchema(document.properties);
   const type = defineNode(
     kindName,
-    chunkSGPXKJ4A_cjs.compactUndefined({
+    chunkKTIEB7VH_cjs.compactUndefined({
       schema,
       description: document.description,
       annotations: document.annotations
@@ -1560,7 +1561,7 @@ function compileEdge(kindName, document, nodeTypeByName) {
     (name) => nodeTypeByName.get(name) ?? name
   );
   return Object.freeze(
-    chunkSGPXKJ4A_cjs.compactUndefined({
+    chunkKTIEB7VH_cjs.compactUndefined({
       kindName,
       schema,
       description: document.description,
@@ -1694,7 +1695,7 @@ function makeWherePredicate(field, op) {
   };
 }
 var META_EDGE_BY_NAME = Object.fromEntries(
-  chunkSGPXKJ4A_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
+  chunkKTIEB7VH_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
 );
 function compileOntologyRelation(relation, nodeTypeByName) {
   const metaEdge = META_EDGE_BY_NAME[relation.metaEdge];
@@ -1733,7 +1734,7 @@ function mergeGraphExtension(graph, document) {
   if (graph.extension !== void 0 && chunkRP7YITHX_cjs.canonicalEqual(unionDocument, existingDocument)) {
     return graph;
   }
-  const validatedUnion = chunkSGPXKJ4A_cjs.unwrap(chunkSGPXKJ4A_cjs.validateGraphExtension(unionDocument));
+  const validatedUnion = chunkKTIEB7VH_cjs.unwrap(chunkKTIEB7VH_cjs.validateGraphExtension(unionDocument));
   const compiled = compileGraphExtension(validatedUnion);
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(existingDocument);
   const nodeKinds = /* @__PURE__ */ new Map();
@@ -1785,7 +1786,7 @@ function mergeGraphExtension(graph, document) {
     });
     const type = defineEdge(
       edge.kindName,
-      chunkSGPXKJ4A_cjs.compactUndefined({
+      chunkKTIEB7VH_cjs.compactUndefined({
         schema: edge.schema,
         description: edge.description,
         annotations: edge.annotations,
@@ -1835,7 +1836,7 @@ function deriveGraphExtensionVectorIndexes(compiledNodes) {
       ...compiled.unique.length === 0 ? {} : { unique: [...compiled.unique] }
     };
   }
-  return chunk7JGLPAFV_cjs.autoDeriveVectorIndexes(registrations).map(
+  return chunkEEYV6UOE_cjs.autoDeriveVectorIndexes(registrations).map(
     (index) => Object.freeze({ ...index, origin: "runtime" })
   );
 }
@@ -1853,7 +1854,7 @@ function mergeIndexesWithGraphExtension(existing, runtimeIndexes, graphId) {
   const runtimeRelational = runtimeIndexes.filter(
     (index) => index.entity !== "vector"
   );
-  const vectorMerged = chunk7JGLPAFV_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
+  const vectorMerged = chunkEEYV6UOE_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
   const merged = [...vectorMerged, ...runtimeRelational];
   assertUniqueIndexNames(merged, graphId);
   return merged;
@@ -1886,7 +1887,7 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
           suggestion: "Declare the kind under `nodes` in this graph extension, or remove the index from `indexes`."
         });
       }
-      const declaration2 = chunk4BXHVEFB_cjs.defineNodeIndex(
+      const declaration2 = chunk6RMLO5O4_cjs.defineNodeIndex(
         node,
         toNodeIndexConfig(document)
       );
@@ -1900,7 +1901,7 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
         suggestion: "Declare the edge under `edges` in this graph extension, or remove the index from `indexes`."
       });
     }
-    const declaration = chunk4BXHVEFB_cjs.defineEdgeIndex(
+    const declaration = chunk6RMLO5O4_cjs.defineEdgeIndex(
       edgeRegistration.type,
       toEdgeIndexConfig(document)
     );
@@ -1921,7 +1922,7 @@ function buildWhereCallback(where) {
   };
 }
 function toNodeIndexConfig(document) {
-  return chunkSGPXKJ4A_cjs.compactUndefined({
+  return chunkKTIEB7VH_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -1931,7 +1932,7 @@ function toNodeIndexConfig(document) {
   });
 }
 function toEdgeIndexConfig(document) {
-  return chunkSGPXKJ4A_cjs.compactUndefined({
+  return chunkKTIEB7VH_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -1987,14 +1988,14 @@ function isEmptyExtension(extension) {
 }
 function assertNoCollision(kindName, entity, collides, graphId) {
   if (!collides) return;
-  throw new chunkSGPXKJ4A_cjs.KindCollisionError(kindName, entity, graphId);
+  throw new chunkKTIEB7VH_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 chunkSGPXKJ4A_cjs.GraphExtensionUnresolvedEndpointError(
+      throw new chunkKTIEB7VH_cjs.GraphExtensionUnresolvedEndpointError(
         context.edgeKind,
         context.side,
         entry,
@@ -2352,7 +2353,7 @@ function parseSerializedSchema(json) {
       { operation: "select", entity: "schema" }
     );
   }
-  const validated = chunkSGPXKJ4A_cjs.freezeDeep(result.data);
+  const validated = chunkKTIEB7VH_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);
@@ -2717,5 +2718,5 @@ exports.validateEdgeProps = validateEdgeProps;
 exports.validateNodeProps = validateNodeProps;
 exports.validateProps = validateProps;
 exports.wrapZodError = wrapZodError;
-//# sourceMappingURL=chunk-K4N35E7B.cjs.map
-//# sourceMappingURL=chunk-K4N35E7B.cjs.map
+//# sourceMappingURL=chunk-LAZGHOZW.cjs.map
+//# sourceMappingURL=chunk-LAZGHOZW.cjs.map