@nicia-ai/typegraph 0.37.1 → 0.38.0

package/dist/define-graph-CzEvA_8F.d.cts

@@ -0,0 +1,174 @@
+import { N as NodeRegistration, E as EdgeRegistration, D as DeleteBehavior, T as TemporalMode, G as GraphExtension, a as NodeType, A as AnyEdgeType, b as GraphDefaults } from './extension-types-BLEVH4SG.cjs';
+import { O as OntologyRelation, I as IndexDeclaration } from './index-CrFL_ENI.cjs';
+
+/** Brand key for GraphDef */
+declare const GRAPH_DEF_BRAND: "__graphDef";
+/**
+ * An edge entry in the graph definition.
+ * Can be:
+ * - EdgeType directly (constrained or unconstrained)
+ * - EdgeRegistration object (always works, can override/narrow defaults)
+ */
+type EdgeEntry = EdgeRegistration | AnyEdgeType;
+/**
+ * Normalized edge map type - all entries become EdgeRegistration.
+ * For bare EdgeTypes, constrained endpoints are extracted from the type;
+ * unconstrained edges fall back to all node types in the graph.
+ */
+type NormalizedEdges<TNodes extends Record<string, NodeRegistration>, TEdges extends Record<string, EdgeEntry>> = {
+    [K in keyof TEdges]: TEdges[K] extends EdgeRegistration ? TEdges[K] : TEdges[K] extends AnyEdgeType ? EdgeRegistration<TEdges[K], TEdges[K]["from"] extends readonly (infer N extends NodeType)[] ? N : TNodes[keyof TNodes]["type"], TEdges[K]["to"] extends readonly (infer N extends NodeType)[] ? N : TNodes[keyof TNodes]["type"]> : never;
+};
+/**
+ * Configuration for defineGraph.
+ */
+type GraphDefConfig<TNodes extends Record<string, NodeRegistration>, TEdges extends Record<string, EdgeEntry>, TOntology extends readonly OntologyRelation[]> = Readonly<{
+    /** Unique identifier for this graph */
+    id: string;
+    /** Node registrations */
+    nodes: TNodes;
+    /** Edge registrations or EdgeTypes with built-in domain/range */
+    edges: TEdges;
+    /** Ontology relations */
+    ontology?: TOntology;
+    /** Graph-wide defaults */
+    defaults?: GraphDefaults;
+    /**
+     * Index declarations attached to this graph.
+     *
+     * Accepts the outputs of `defineNodeIndex` / `defineEdgeIndex` (which
+     * already return `IndexDeclaration` values) or pre-built declarations
+     * reconstructed from a stored schema or graph extension.
+     *
+     * Validated at definition time: every index must reference a `kind`
+     * that exists in `nodes` / `edges`, and index `name`s must be unique
+     * within the graph.
+     *
+     * Index DDL is **not** generated by `defineGraph`. Indexes flow into
+     * `SerializedSchema.indexes` so they can later be materialized via
+     * `store.materializeIndexes()` — lifting the storage concern out of
+     * the schema-version commit path.
+     */
+    indexes?: readonly IndexDeclaration[];
+}>;
+/**
+ * A graph definition.
+ *
+ * This is a compile-time artifact that describes the structure of a graph.
+ * Use `createStore()` to create a runtime store from this definition.
+ */
+type GraphDef<TNodes extends Record<string, NodeRegistration> = Record<string, NodeRegistration>, TEdges extends Record<string, EdgeRegistration> = Record<string, EdgeRegistration>, TOntology extends readonly OntologyRelation[] = readonly OntologyRelation[]> = Readonly<{
+    [GRAPH_DEF_BRAND]: true;
+    id: string;
+    nodes: TNodes;
+    edges: TEdges;
+    ontology: TOntology;
+    defaults: Readonly<{
+        onNodeDelete: DeleteBehavior;
+        temporalMode: TemporalMode;
+    }>;
+    /**
+     * Index declarations attached to this graph. Preserves whatever the
+     * caller passed to `defineGraph` (including an explicit empty array)
+     * for introspection purposes.
+     *
+     * The serialized canonical form is order-canonicalized (sorted by
+     * `name`) and treats `undefined` and `[]` as the same "no slice" form
+     * — an empty array does not bump the schema hash, since indexes are
+     * an unordered set keyed by name and `[]` carries no semantic meaning
+     * that an absent slice doesn't.
+     */
+    indexes: readonly IndexDeclaration[] | undefined;
+    /**
+     * Graph extension this graph was merged with, if any. Set by
+     * `mergeGraphExtension`; never set by `defineGraph` directly.
+     * Exists solely so re-serialization is stable — the rest of the
+     * system reads the merged kinds through `nodes` / `edges` /
+     * `ontology` and never inspects this field. Absent on graphs that
+     * have never been extended; legacy graphs hash byte-identically.
+     */
+    extension: GraphExtension | undefined;
+    /**
+     * Soft-deprecated kind names attached to this graph. Set by the
+     * loader from the persisted schema and by `store.deprecateKinds(...)`
+     * / `store.undeprecateKinds(...)`. A purely informational signal
+     * surfaced for introspection — does not gate reads, writes, or
+     * queries. Defaults to the empty set on freshly-defined graphs.
+     */
+    deprecatedKinds: ReadonlySet<string>;
+}>;
+/**
+ * Extract node kind names from a GraphDef.
+ */
+type NodeKinds<G extends GraphDef> = keyof G["nodes"] & string;
+/**
+ * Extract edge kind names from a GraphDef.
+ */
+type EdgeKinds<G extends GraphDef> = keyof G["edges"] & string;
+/**
+ * Get a NodeType from a GraphDef by kind name.
+ */
+type GetNodeType<G extends GraphDef, K extends NodeKinds<G>> = G["nodes"][K]["type"];
+/**
+ * Get an EdgeType from a GraphDef by kind name.
+ */
+type GetEdgeType<G extends GraphDef, K extends EdgeKinds<G>> = G["edges"][K]["type"];
+/**
+ * Get all NodeTypes from a GraphDef.
+ */
+type AllNodeTypes<G extends GraphDef> = {
+    [K in NodeKinds<G>]: G["nodes"][K]["type"];
+}[NodeKinds<G>];
+/**
+ * Get all EdgeTypes from a GraphDef.
+ */
+type AllEdgeTypes<G extends GraphDef> = {
+    [K in EdgeKinds<G>]: G["edges"][K]["type"];
+}[EdgeKinds<G>];
+/**
+ * Creates a graph definition.
+ *
+ * @example
+ * ```typescript
+ * const graph = defineGraph({
+ *   id: "my_graph",
+ *   nodes: {
+ *     Person: { type: Person },
+ *     Company: { type: Company },
+ *   },
+ *   edges: {
+ *     // Traditional EdgeRegistration syntax
+ *     worksAt: {
+ *       type: worksAt,
+ *       from: [Person],
+ *       to: [Company],
+ *       cardinality: "many",
+ *     },
+ *     // Or use EdgeType directly if it has from/to defined
+ *     knows,  // EdgeType with built-in domain/range
+ *   },
+ *   ontology: [
+ *     subClassOf(Company, Organization),
+ *     disjointWith(Person, Organization),
+ *   ],
+ *   defaults: {
+ *     onNodeDelete: "restrict",
+ *     temporalMode: "current",
+ *   },
+ * });
+ * ```
+ */
+declare function defineGraph<const TNodes extends Record<string, NodeRegistration<NodeType>>, const TEdges extends Record<string, EdgeEntry>, const TOntology extends readonly OntologyRelation[]>(config: GraphDefConfig<TNodes, TEdges, TOntology>): GraphDef<TNodes, NormalizedEdges<TNodes, TEdges>, TOntology>;
+/**
+ * Checks if a value is a GraphDef.
+ */
+declare function isGraphDef(value: unknown): value is GraphDef;
+/**
+ * Gets all node kind names from a GraphDef.
+ */
+declare function getNodeKinds<G extends GraphDef>(graph: G): readonly (keyof G["nodes"] & string)[];
+/**
+ * Gets all edge kind names from a GraphDef.
+ */
+declare function getEdgeKinds<G extends GraphDef>(graph: G): readonly (keyof G["edges"] & string)[];
+
+export { type AllEdgeTypes as A, type EdgeKinds as E, type GraphDef as G, type NodeKinds as N, type AllNodeTypes as a, type GetEdgeType as b, type GetNodeType as c, defineGraph as d, getNodeKinds as e, getEdgeKinds as g, isGraphDef as i };

package/dist/define-graph-DRo9xpYN.d.ts

@@ -0,0 +1,174 @@
+import { N as NodeRegistration, E as EdgeRegistration, D as DeleteBehavior, T as TemporalMode, G as GraphExtension, a as NodeType, A as AnyEdgeType, b as GraphDefaults } from './extension-types-BLEVH4SG.js';
+import { O as OntologyRelation, I as IndexDeclaration } from './index-Bq7vSPHy.js';
+
+/** Brand key for GraphDef */
+declare const GRAPH_DEF_BRAND: "__graphDef";
+/**
+ * An edge entry in the graph definition.
+ * Can be:
+ * - EdgeType directly (constrained or unconstrained)
+ * - EdgeRegistration object (always works, can override/narrow defaults)
+ */
+type EdgeEntry = EdgeRegistration | AnyEdgeType;
+/**
+ * Normalized edge map type - all entries become EdgeRegistration.
+ * For bare EdgeTypes, constrained endpoints are extracted from the type;
+ * unconstrained edges fall back to all node types in the graph.
+ */
+type NormalizedEdges<TNodes extends Record<string, NodeRegistration>, TEdges extends Record<string, EdgeEntry>> = {
+    [K in keyof TEdges]: TEdges[K] extends EdgeRegistration ? TEdges[K] : TEdges[K] extends AnyEdgeType ? EdgeRegistration<TEdges[K], TEdges[K]["from"] extends readonly (infer N extends NodeType)[] ? N : TNodes[keyof TNodes]["type"], TEdges[K]["to"] extends readonly (infer N extends NodeType)[] ? N : TNodes[keyof TNodes]["type"]> : never;
+};
+/**
+ * Configuration for defineGraph.
+ */
+type GraphDefConfig<TNodes extends Record<string, NodeRegistration>, TEdges extends Record<string, EdgeEntry>, TOntology extends readonly OntologyRelation[]> = Readonly<{
+    /** Unique identifier for this graph */
+    id: string;
+    /** Node registrations */
+    nodes: TNodes;
+    /** Edge registrations or EdgeTypes with built-in domain/range */
+    edges: TEdges;
+    /** Ontology relations */
+    ontology?: TOntology;
+    /** Graph-wide defaults */
+    defaults?: GraphDefaults;
+    /**
+     * Index declarations attached to this graph.
+     *
+     * Accepts the outputs of `defineNodeIndex` / `defineEdgeIndex` (which
+     * already return `IndexDeclaration` values) or pre-built declarations
+     * reconstructed from a stored schema or graph extension.
+     *
+     * Validated at definition time: every index must reference a `kind`
+     * that exists in `nodes` / `edges`, and index `name`s must be unique
+     * within the graph.
+     *
+     * Index DDL is **not** generated by `defineGraph`. Indexes flow into
+     * `SerializedSchema.indexes` so they can later be materialized via
+     * `store.materializeIndexes()` — lifting the storage concern out of
+     * the schema-version commit path.
+     */
+    indexes?: readonly IndexDeclaration[];
+}>;
+/**
+ * A graph definition.
+ *
+ * This is a compile-time artifact that describes the structure of a graph.
+ * Use `createStore()` to create a runtime store from this definition.
+ */
+type GraphDef<TNodes extends Record<string, NodeRegistration> = Record<string, NodeRegistration>, TEdges extends Record<string, EdgeRegistration> = Record<string, EdgeRegistration>, TOntology extends readonly OntologyRelation[] = readonly OntologyRelation[]> = Readonly<{
+    [GRAPH_DEF_BRAND]: true;
+    id: string;
+    nodes: TNodes;
+    edges: TEdges;
+    ontology: TOntology;
+    defaults: Readonly<{
+        onNodeDelete: DeleteBehavior;
+        temporalMode: TemporalMode;
+    }>;
+    /**
+     * Index declarations attached to this graph. Preserves whatever the
+     * caller passed to `defineGraph` (including an explicit empty array)
+     * for introspection purposes.
+     *
+     * The serialized canonical form is order-canonicalized (sorted by
+     * `name`) and treats `undefined` and `[]` as the same "no slice" form
+     * — an empty array does not bump the schema hash, since indexes are
+     * an unordered set keyed by name and `[]` carries no semantic meaning
+     * that an absent slice doesn't.
+     */
+    indexes: readonly IndexDeclaration[] | undefined;
+    /**
+     * Graph extension this graph was merged with, if any. Set by
+     * `mergeGraphExtension`; never set by `defineGraph` directly.
+     * Exists solely so re-serialization is stable — the rest of the
+     * system reads the merged kinds through `nodes` / `edges` /
+     * `ontology` and never inspects this field. Absent on graphs that
+     * have never been extended; legacy graphs hash byte-identically.
+     */
+    extension: GraphExtension | undefined;
+    /**
+     * Soft-deprecated kind names attached to this graph. Set by the
+     * loader from the persisted schema and by `store.deprecateKinds(...)`
+     * / `store.undeprecateKinds(...)`. A purely informational signal
+     * surfaced for introspection — does not gate reads, writes, or
+     * queries. Defaults to the empty set on freshly-defined graphs.
+     */
+    deprecatedKinds: ReadonlySet<string>;
+}>;
+/**
+ * Extract node kind names from a GraphDef.
+ */
+type NodeKinds<G extends GraphDef> = keyof G["nodes"] & string;
+/**
+ * Extract edge kind names from a GraphDef.
+ */
+type EdgeKinds<G extends GraphDef> = keyof G["edges"] & string;
+/**
+ * Get a NodeType from a GraphDef by kind name.
+ */
+type GetNodeType<G extends GraphDef, K extends NodeKinds<G>> = G["nodes"][K]["type"];
+/**
+ * Get an EdgeType from a GraphDef by kind name.
+ */
+type GetEdgeType<G extends GraphDef, K extends EdgeKinds<G>> = G["edges"][K]["type"];
+/**
+ * Get all NodeTypes from a GraphDef.
+ */
+type AllNodeTypes<G extends GraphDef> = {
+    [K in NodeKinds<G>]: G["nodes"][K]["type"];
+}[NodeKinds<G>];
+/**
+ * Get all EdgeTypes from a GraphDef.
+ */
+type AllEdgeTypes<G extends GraphDef> = {
+    [K in EdgeKinds<G>]: G["edges"][K]["type"];
+}[EdgeKinds<G>];
+/**
+ * Creates a graph definition.
+ *
+ * @example
+ * ```typescript
+ * const graph = defineGraph({
+ *   id: "my_graph",
+ *   nodes: {
+ *     Person: { type: Person },
+ *     Company: { type: Company },
+ *   },
+ *   edges: {
+ *     // Traditional EdgeRegistration syntax
+ *     worksAt: {
+ *       type: worksAt,
+ *       from: [Person],
+ *       to: [Company],
+ *       cardinality: "many",
+ *     },
+ *     // Or use EdgeType directly if it has from/to defined
+ *     knows,  // EdgeType with built-in domain/range
+ *   },
+ *   ontology: [
+ *     subClassOf(Company, Organization),
+ *     disjointWith(Person, Organization),
+ *   ],
+ *   defaults: {
+ *     onNodeDelete: "restrict",
+ *     temporalMode: "current",
+ *   },
+ * });
+ * ```
+ */
+declare function defineGraph<const TNodes extends Record<string, NodeRegistration<NodeType>>, const TEdges extends Record<string, EdgeEntry>, const TOntology extends readonly OntologyRelation[]>(config: GraphDefConfig<TNodes, TEdges, TOntology>): GraphDef<TNodes, NormalizedEdges<TNodes, TEdges>, TOntology>;
+/**
+ * Checks if a value is a GraphDef.
+ */
+declare function isGraphDef(value: unknown): value is GraphDef;
+/**
+ * Gets all node kind names from a GraphDef.
+ */
+declare function getNodeKinds<G extends GraphDef>(graph: G): readonly (keyof G["nodes"] & string)[];
+/**
+ * Gets all edge kind names from a GraphDef.
+ */
+declare function getEdgeKinds<G extends GraphDef>(graph: G): readonly (keyof G["edges"] & string)[];
+
+export { type AllEdgeTypes as A, type EdgeKinds as E, type GraphDef as G, type NodeKinds as N, type AllNodeTypes as a, type GetEdgeType as b, type GetNodeType as c, defineGraph as d, getNodeKinds as e, getEdgeKinds as g, isGraphDef as i };

package/dist/{extension-types-BM2ACfYO.d.cts → extension-types-BLEVH4SG.d.cts}

@@ -568,4 +568,4 @@ type GraphExtension = Readonly<{
 declare const GRAPH_EXTENSION_TOP_LEVEL_KEYS: readonly ["version", "nodes", "edges", "ontology", "indexes"];
 type GraphExtensionTopLevelKey = (typeof GRAPH_EXTENSION_TOP_LEVEL_KEYS)[number];
 
-export { type GraphExtensionTopLevelKey as $, type AnyEdgeType as A, type ExtensionBooleanProperty as B, CURRENT_GRAPH_EXTENSION_VERSION as C, type DeleteBehavior as D, type EdgeRegistration as E, type ExtensionEdgeIndex as F, type GraphExtension as G, type ExtensionEmbeddingModifier as H, type IndexEntity as I, type JsonValue as J, type KindEntity as K, LEGACY_GRAPH_EXTENSION_VERSION as L, type ExtensionEnumProperty as M, type NodeType as N, type ExtensionIndexWhere as O, type ExtensionNodeIndex as P, type ExtensionNumberProperty as Q, type ExtensionObjectFieldProperty as R, type ExtensionObjectProperty as S, type TemporalMode as T, type UniqueConstraint as U, type ExtensionPropertyType as V, type ExtensionSearchableModifier as W, type ExtensionStringProperty as X, type ExtensionUniqueConstraint as Y, type ExtensionUniqueWhere as Z, GRAPH_EXTENSION_TOP_LEVEL_KEYS as _, type NullCheckOp as a, type NodeRegistration as b, type GraphDefaults as c, type NodeId as d, type EdgeId as e, type KindAnnotations as f, type EdgeType as g, type GraphExtensionVersion as h, type ExtensionNodeDef as i, type ExtensionEdgeDef as j, type ExtensionOntologyRelation as k, type ExtensionIndex as l, type Cardinality as m, type Collation as n, type EdgeProps as o, type EdgeTypeWithEndpoints as p, type EndpointExistence as q, type NodeProps as r, type UniquenessScope as s, asEdgeId as t, asNodeId as u, isEdgeType as v, isEdgeTypeWithEndpoints as w, isNodeType as x, type ExtensionArrayItemType as y, type ExtensionArrayProperty as z };
+export { type ExtensionUniqueWhere as $, type AnyEdgeType as A, type ExtensionArrayProperty as B, CURRENT_GRAPH_EXTENSION_VERSION as C, type DeleteBehavior as D, type EdgeRegistration as E, type ExtensionBooleanProperty as F, type GraphExtension as G, type ExtensionEdgeIndex as H, type IndexEntity as I, type JsonValue as J, type KindEntity as K, LEGACY_GRAPH_EXTENSION_VERSION as L, type ExtensionEmbeddingModifier as M, type NodeRegistration as N, type ExtensionEnumProperty as O, type ExtensionIndexWhere as P, type ExtensionNodeIndex as Q, type ExtensionNumberProperty as R, type ExtensionObjectFieldProperty as S, type TemporalMode as T, type UniqueConstraint as U, type ExtensionObjectProperty as V, type ExtensionPropertyModifiers as W, type ExtensionPropertyType as X, type ExtensionSearchableModifier as Y, type ExtensionStringProperty as Z, type ExtensionUniqueConstraint as _, type NodeType as a, type MetaEdgeName as a0, GRAPH_EXTENSION_TOP_LEVEL_KEYS as a1, type GraphExtensionTopLevelKey as a2, type GraphDefaults as b, type NullCheckOp as c, type EdgeType as d, type Cardinality as e, type Collation as f, type EdgeId as g, type EdgeProps as h, type EdgeTypeWithEndpoints as i, type EndpointExistence as j, type GraphExtensionVersion as k, type KindAnnotations as l, type NodeId as m, type NodeProps as n, type UniquenessScope as o, asEdgeId as p, asNodeId as q, isEdgeType as r, isEdgeTypeWithEndpoints as s, isNodeType as t, type ExtensionNodeDef as u, type ExtensionEdgeDef as v, type ExtensionOntologyRelation as w, type ExtensionIndex as x, ALL_META_EDGE_NAMES as y, type ExtensionArrayItemType as z };

package/dist/{extension-types-BM2ACfYO.d.ts → extension-types-BLEVH4SG.d.ts}

@@ -568,4 +568,4 @@ type GraphExtension = Readonly<{
 declare const GRAPH_EXTENSION_TOP_LEVEL_KEYS: readonly ["version", "nodes", "edges", "ontology", "indexes"];
 type GraphExtensionTopLevelKey = (typeof GRAPH_EXTENSION_TOP_LEVEL_KEYS)[number];
 
-export { type GraphExtensionTopLevelKey as $, type AnyEdgeType as A, type ExtensionBooleanProperty as B, CURRENT_GRAPH_EXTENSION_VERSION as C, type DeleteBehavior as D, type EdgeRegistration as E, type ExtensionEdgeIndex as F, type GraphExtension as G, type ExtensionEmbeddingModifier as H, type IndexEntity as I, type JsonValue as J, type KindEntity as K, LEGACY_GRAPH_EXTENSION_VERSION as L, type ExtensionEnumProperty as M, type NodeType as N, type ExtensionIndexWhere as O, type ExtensionNodeIndex as P, type ExtensionNumberProperty as Q, type ExtensionObjectFieldProperty as R, type ExtensionObjectProperty as S, type TemporalMode as T, type UniqueConstraint as U, type ExtensionPropertyType as V, type ExtensionSearchableModifier as W, type ExtensionStringProperty as X, type ExtensionUniqueConstraint as Y, type ExtensionUniqueWhere as Z, GRAPH_EXTENSION_TOP_LEVEL_KEYS as _, type NullCheckOp as a, type NodeRegistration as b, type GraphDefaults as c, type NodeId as d, type EdgeId as e, type KindAnnotations as f, type EdgeType as g, type GraphExtensionVersion as h, type ExtensionNodeDef as i, type ExtensionEdgeDef as j, type ExtensionOntologyRelation as k, type ExtensionIndex as l, type Cardinality as m, type Collation as n, type EdgeProps as o, type EdgeTypeWithEndpoints as p, type EndpointExistence as q, type NodeProps as r, type UniquenessScope as s, asEdgeId as t, asNodeId as u, isEdgeType as v, isEdgeTypeWithEndpoints as w, isNodeType as x, type ExtensionArrayItemType as y, type ExtensionArrayProperty as z };
+export { type ExtensionUniqueWhere as $, type AnyEdgeType as A, type ExtensionArrayProperty as B, CURRENT_GRAPH_EXTENSION_VERSION as C, type DeleteBehavior as D, type EdgeRegistration as E, type ExtensionBooleanProperty as F, type GraphExtension as G, type ExtensionEdgeIndex as H, type IndexEntity as I, type JsonValue as J, type KindEntity as K, LEGACY_GRAPH_EXTENSION_VERSION as L, type ExtensionEmbeddingModifier as M, type NodeRegistration as N, type ExtensionEnumProperty as O, type ExtensionIndexWhere as P, type ExtensionNodeIndex as Q, type ExtensionNumberProperty as R, type ExtensionObjectFieldProperty as S, type TemporalMode as T, type UniqueConstraint as U, type ExtensionObjectProperty as V, type ExtensionPropertyModifiers as W, type ExtensionPropertyType as X, type ExtensionSearchableModifier as Y, type ExtensionStringProperty as Z, type ExtensionUniqueConstraint as _, type NodeType as a, type MetaEdgeName as a0, GRAPH_EXTENSION_TOP_LEVEL_KEYS as a1, type GraphExtensionTopLevelKey as a2, type GraphDefaults as b, type NullCheckOp as c, type EdgeType as d, type Cardinality as e, type Collation as f, type EdgeId as g, type EdgeProps as h, type EdgeTypeWithEndpoints as i, type EndpointExistence as j, type GraphExtensionVersion as k, type KindAnnotations as l, type NodeId as m, type NodeProps as n, type UniquenessScope as o, asEdgeId as p, asNodeId as q, isEdgeType as r, isEdgeTypeWithEndpoints as s, isNodeType as t, type ExtensionNodeDef as u, type ExtensionEdgeDef as v, type ExtensionOntologyRelation as w, type ExtensionIndex as x, ALL_META_EDGE_NAMES as y, type ExtensionArrayItemType as z };

package/dist/graph-extension/index.cjs

@@ -1,73 +1,75 @@
 'use strict';
 
-var chunkQSXTWU4U_cjs = require('../chunk-QSXTWU4U.cjs');
-var chunkIP3CGGPA_cjs = require('../chunk-IP3CGGPA.cjs');
-require('../chunk-DEFQM7JU.cjs');
+var chunkIMQKXL4E_cjs = require('../chunk-IMQKXL4E.cjs');
+var chunkN2V3HJFV_cjs = require('../chunk-N2V3HJFV.cjs');
+require('../chunk-SVJ5GEXW.cjs');
+require('../chunk-NMQ6C6TS.cjs');
 require('../chunk-DI74SMXS.cjs');
-require('../chunk-BVRDGYXQ.cjs');
+require('../chunk-XRU7V7FF.cjs');
+require('../chunk-SAFZ6JTI.cjs');
 require('../chunk-TDXIBCGY.cjs');
 
 
 
 Object.defineProperty(exports, "defineGraphExtension", {
   enumerable: true,
-  get: function () { return chunkQSXTWU4U_cjs.defineGraphExtension; }
+  get: function () { return chunkIMQKXL4E_cjs.defineGraphExtension; }
 });
 Object.defineProperty(exports, "CURRENT_GRAPH_EXTENSION_VERSION", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.CURRENT_GRAPH_EXTENSION_VERSION; }
+  get: function () { return chunkN2V3HJFV_cjs.CURRENT_GRAPH_EXTENSION_VERSION; }
 });
 Object.defineProperty(exports, "GRAPH_EXTENSION_ISSUE_CODES", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.GRAPH_EXTENSION_ISSUE_CODES; }
+  get: function () { return chunkN2V3HJFV_cjs.GRAPH_EXTENSION_ISSUE_CODES; }
 });
 Object.defineProperty(exports, "GRAPH_EXTENSION_TOP_LEVEL_KEYS", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.GRAPH_EXTENSION_TOP_LEVEL_KEYS; }
+  get: function () { return chunkN2V3HJFV_cjs.GRAPH_EXTENSION_TOP_LEVEL_KEYS; }
 });
 Object.defineProperty(exports, "GraphExtensionError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.GraphExtensionError; }
+  get: function () { return chunkN2V3HJFV_cjs.GraphExtensionError; }
 });
 Object.defineProperty(exports, "GraphExtensionUnresolvedEndpointError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.GraphExtensionUnresolvedEndpointError; }
+  get: function () { return chunkN2V3HJFV_cjs.GraphExtensionUnresolvedEndpointError; }
 });
 Object.defineProperty(exports, "GraphExtensionValidationError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.GraphExtensionValidationError; }
+  get: function () { return chunkN2V3HJFV_cjs.GraphExtensionValidationError; }
 });
 Object.defineProperty(exports, "GraphExtensionVersionUnsupportedError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.GraphExtensionVersionUnsupportedError; }
+  get: function () { return chunkN2V3HJFV_cjs.GraphExtensionVersionUnsupportedError; }
 });
 Object.defineProperty(exports, "INCOMPATIBLE_CHANGE_TYPES", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.INCOMPATIBLE_CHANGE_TYPES; }
+  get: function () { return chunkN2V3HJFV_cjs.INCOMPATIBLE_CHANGE_TYPES; }
 });
 Object.defineProperty(exports, "IncompatibleChangeError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.IncompatibleChangeError; }
+  get: function () { return chunkN2V3HJFV_cjs.IncompatibleChangeError; }
 });
 Object.defineProperty(exports, "KindCollisionError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.KindCollisionError; }
+  get: function () { return chunkN2V3HJFV_cjs.KindCollisionError; }
 });
 Object.defineProperty(exports, "KindHasReferentsError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.KindHasReferentsError; }
+  get: function () { return chunkN2V3HJFV_cjs.KindHasReferentsError; }
 });
 Object.defineProperty(exports, "LEGACY_GRAPH_EXTENSION_VERSION", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.LEGACY_GRAPH_EXTENSION_VERSION; }
+  get: function () { return chunkN2V3HJFV_cjs.LEGACY_GRAPH_EXTENSION_VERSION; }
 });
 Object.defineProperty(exports, "RemoveCompileTimeKindError", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.RemoveCompileTimeKindError; }
+  get: function () { return chunkN2V3HJFV_cjs.RemoveCompileTimeKindError; }
 });
 Object.defineProperty(exports, "validateGraphExtension", {
   enumerable: true,
-  get: function () { return chunkIP3CGGPA_cjs.validateGraphExtension; }
+  get: function () { return chunkN2V3HJFV_cjs.validateGraphExtension; }
 });
 //# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map

package/dist/graph-extension/index.d.cts

@@ -1,9 +1,9 @@
-import { G as GraphExtension, K as KindEntity } from '../extension-types-BM2ACfYO.cjs';
-export { C as CURRENT_GRAPH_EXTENSION_VERSION, y as ExtensionArrayItemType, z as ExtensionArrayProperty, B as ExtensionBooleanProperty, j as ExtensionEdgeDef, F as ExtensionEdgeIndex, H as ExtensionEmbeddingModifier, M as ExtensionEnumProperty, l as ExtensionIndex, O as ExtensionIndexWhere, i as ExtensionNodeDef, P as ExtensionNodeIndex, Q as ExtensionNumberProperty, R as ExtensionObjectFieldProperty, S as ExtensionObjectProperty, k as ExtensionOntologyRelation, V as ExtensionPropertyType, W as ExtensionSearchableModifier, X as ExtensionStringProperty, Y as ExtensionUniqueConstraint, Z as ExtensionUniqueWhere, _ as GRAPH_EXTENSION_TOP_LEVEL_KEYS, $ as GraphExtensionTopLevelKey, h as GraphExtensionVersion, L as LEGACY_GRAPH_EXTENSION_VERSION } from '../extension-types-BM2ACfYO.cjs';
-import { T as TypeGraphError, q as ErrorCategory } from '../index-BPM59vsg.cjs';
+import { G as GraphExtension, K as KindEntity } from '../extension-types-BLEVH4SG.cjs';
+export { C as CURRENT_GRAPH_EXTENSION_VERSION, z as ExtensionArrayItemType, B as ExtensionArrayProperty, F as ExtensionBooleanProperty, v as ExtensionEdgeDef, H as ExtensionEdgeIndex, M as ExtensionEmbeddingModifier, O as ExtensionEnumProperty, x as ExtensionIndex, P as ExtensionIndexWhere, u as ExtensionNodeDef, Q as ExtensionNodeIndex, R as ExtensionNumberProperty, S as ExtensionObjectFieldProperty, V as ExtensionObjectProperty, w as ExtensionOntologyRelation, X as ExtensionPropertyType, Y as ExtensionSearchableModifier, Z as ExtensionStringProperty, _ as ExtensionUniqueConstraint, $ as ExtensionUniqueWhere, a1 as GRAPH_EXTENSION_TOP_LEVEL_KEYS, a2 as GraphExtensionTopLevelKey, k as GraphExtensionVersion, L as LEGACY_GRAPH_EXTENSION_VERSION } from '../extension-types-BLEVH4SG.cjs';
+import { $ as TypeGraphError, q as ErrorCategory } from '../index-BihFPsPu.cjs';
 import { R as Result } from '../result-DWo6mUVz.cjs';
 import 'zod';
-import '../materialize-indexes-CuR3gAZb.cjs';
+import '../materialize-indexes-ExQ6OrAh.cjs';
 
 /**
  * Validates and freezes a graph-extension document.

package/dist/graph-extension/index.d.ts

@@ -1,9 +1,9 @@
-import { G as GraphExtension, K as KindEntity } from '../extension-types-BM2ACfYO.js';
-export { C as CURRENT_GRAPH_EXTENSION_VERSION, y as ExtensionArrayItemType, z as ExtensionArrayProperty, B as ExtensionBooleanProperty, j as ExtensionEdgeDef, F as ExtensionEdgeIndex, H as ExtensionEmbeddingModifier, M as ExtensionEnumProperty, l as ExtensionIndex, O as ExtensionIndexWhere, i as ExtensionNodeDef, P as ExtensionNodeIndex, Q as ExtensionNumberProperty, R as ExtensionObjectFieldProperty, S as ExtensionObjectProperty, k as ExtensionOntologyRelation, V as ExtensionPropertyType, W as ExtensionSearchableModifier, X as ExtensionStringProperty, Y as ExtensionUniqueConstraint, Z as ExtensionUniqueWhere, _ as GRAPH_EXTENSION_TOP_LEVEL_KEYS, $ as GraphExtensionTopLevelKey, h as GraphExtensionVersion, L as LEGACY_GRAPH_EXTENSION_VERSION } from '../extension-types-BM2ACfYO.js';
-import { T as TypeGraphError, q as ErrorCategory } from '../index-BeacbPoe.js';
+import { G as GraphExtension, K as KindEntity } from '../extension-types-BLEVH4SG.js';
+export { C as CURRENT_GRAPH_EXTENSION_VERSION, z as ExtensionArrayItemType, B as ExtensionArrayProperty, F as ExtensionBooleanProperty, v as ExtensionEdgeDef, H as ExtensionEdgeIndex, M as ExtensionEmbeddingModifier, O as ExtensionEnumProperty, x as ExtensionIndex, P as ExtensionIndexWhere, u as ExtensionNodeDef, Q as ExtensionNodeIndex, R as ExtensionNumberProperty, S as ExtensionObjectFieldProperty, V as ExtensionObjectProperty, w as ExtensionOntologyRelation, X as ExtensionPropertyType, Y as ExtensionSearchableModifier, Z as ExtensionStringProperty, _ as ExtensionUniqueConstraint, $ as ExtensionUniqueWhere, a1 as GRAPH_EXTENSION_TOP_LEVEL_KEYS, a2 as GraphExtensionTopLevelKey, k as GraphExtensionVersion, L as LEGACY_GRAPH_EXTENSION_VERSION } from '../extension-types-BLEVH4SG.js';
+import { $ as TypeGraphError, q as ErrorCategory } from '../index-BD_3TCgh.js';
 import { R as Result } from '../result-DWo6mUVz.js';
 import 'zod';
-import '../materialize-indexes-zK2J_flP.js';
+import '../materialize-indexes-D4iei4Kp.js';
 
 /**
  * Validates and freezes a graph-extension document.

package/dist/graph-extension/index.js

@@ -1,8 +1,10 @@
-export { defineGraphExtension } from '../chunk-RRSNR3TP.js';
-export { CURRENT_GRAPH_EXTENSION_VERSION, GRAPH_EXTENSION_ISSUE_CODES, GRAPH_EXTENSION_TOP_LEVEL_KEYS, GraphExtensionError, GraphExtensionUnresolvedEndpointError, GraphExtensionValidationError, GraphExtensionVersionUnsupportedError, INCOMPATIBLE_CHANGE_TYPES, IncompatibleChangeError, KindCollisionError, KindHasReferentsError, LEGACY_GRAPH_EXTENSION_VERSION, RemoveCompileTimeKindError, validateGraphExtension } from '../chunk-L7HQ2OSI.js';
-import '../chunk-TPF25IG6.js';
+export { defineGraphExtension } from '../chunk-YIRLBUNN.js';
+export { CURRENT_GRAPH_EXTENSION_VERSION, GRAPH_EXTENSION_ISSUE_CODES, GRAPH_EXTENSION_TOP_LEVEL_KEYS, GraphExtensionError, GraphExtensionUnresolvedEndpointError, GraphExtensionValidationError, GraphExtensionVersionUnsupportedError, INCOMPATIBLE_CHANGE_TYPES, IncompatibleChangeError, KindCollisionError, KindHasReferentsError, LEGACY_GRAPH_EXTENSION_VERSION, RemoveCompileTimeKindError, validateGraphExtension } from '../chunk-SCTZRFW5.js';
+import '../chunk-GYA4JRP5.js';
+import '../chunk-TAUGGLNQ.js';
 import '../chunk-ITE4IXAK.js';
-import '../chunk-5PNMDJ7J.js';
+import '../chunk-XZA3Y4YH.js';
+import '../chunk-DPNA466P.js';
 import '../chunk-G6Q5UM7U.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map