@nicia-ai/typegraph 0.45.0 → 0.46.1

package/dist/chunk-ZTAJL4DT.cjs

@@ -1,85 +0,0 @@
-'use strict';
-
-var chunkC4F7VJ5D_cjs = require('./chunk-C4F7VJ5D.cjs');
-
-// src/utils/date.ts
-var CANONICAL_ISO_DATE_PATTERN = /^\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}\.\d{3}Z$/;
-var ZONELESS_DATETIME_PATTERN = /^\d{4}-\d{2}-\d{2}[ T]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?$/;
-var OFFSET_DATETIME_PATTERN = /^(\d{4}-\d{2}-\d{2})[ T](\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?)(Z|[+-]\d{2}(?::?\d{2})?)$/i;
-var DATE_ONLY_PATTERN = /^\d{4}-\d{2}-\d{2}$/;
-function normalizedOffset(offset) {
-  if (offset.toUpperCase() === "Z") return "Z";
-  if (/^[+-]\d{2}$/.test(offset)) return `${offset}:00`;
-  if (/^[+-]\d{4}$/.test(offset)) {
-    return `${offset.slice(0, 3)}:${offset.slice(3)}`;
-  }
-  return offset;
-}
-function databaseTimestampMilliseconds(value) {
-  if (ZONELESS_DATETIME_PATTERN.test(value)) {
-    return Date.parse(`${value.replace(" ", "T")}Z`);
-  }
-  const offsetMatch = OFFSET_DATETIME_PATTERN.exec(value);
-  if (offsetMatch !== null) {
-    const date = offsetMatch[1];
-    const time = offsetMatch[2];
-    const offset = offsetMatch[3];
-    if (date === void 0 || time === void 0 || offset === void 0) {
-      return Number.NaN;
-    }
-    return Date.parse(`${date}T${time}${normalizedOffset(offset)}`);
-  }
-  if (DATE_ONLY_PATTERN.test(value)) {
-    return Date.parse(`${value}T00:00:00.000Z`);
-  }
-  return Number.NaN;
-}
-function canonicalizeDatabaseTimestamp(value) {
-  if (value instanceof Date) {
-    if (Number.isNaN(value.getTime())) return void 0;
-    return value.toISOString();
-  }
-  if (typeof value !== "string") return void 0;
-  const milliseconds = databaseTimestampMilliseconds(value);
-  if (Number.isNaN(milliseconds)) return void 0;
-  return new Date(milliseconds).toISOString();
-}
-function isCanonicalIsoDate(value) {
-  if (!CANONICAL_ISO_DATE_PATTERN.test(value)) return false;
-  const date = new Date(value);
-  return !Number.isNaN(date.getTime()) && date.toISOString() === value;
-}
-function validateCanonicalIsoDate(value, fieldName) {
-  if (!isCanonicalIsoDate(value)) {
-    throw new chunkC4F7VJ5D_cjs.ValidationError(
-      `Invalid canonical ISO 8601 datetime for "${fieldName}": "${value}". Expected fixed-width UTC: YYYY-MM-DDTHH:mm:ss.sssZ`,
-      {
-        issues: [
-          {
-            path: fieldName,
-            message: `Expected canonical UTC ISO 8601 (YYYY-MM-DDTHH:mm:ss.sssZ), got: "${value}"`
-          }
-        ]
-      },
-      {
-        suggestion: `Use a fixed-width UTC datetime like "2024-01-15T10:30:00.000Z" (e.g. new Date(value).toISOString()).`
-      }
-    );
-  }
-  return value;
-}
-function validateOptionalCanonicalIsoDate(value, fieldName) {
-  if (value === void 0) return void 0;
-  return validateCanonicalIsoDate(value, fieldName);
-}
-function nowIso() {
-  return (/* @__PURE__ */ new Date()).toISOString();
-}
-
-exports.canonicalizeDatabaseTimestamp = canonicalizeDatabaseTimestamp;
-exports.isCanonicalIsoDate = isCanonicalIsoDate;
-exports.nowIso = nowIso;
-exports.validateCanonicalIsoDate = validateCanonicalIsoDate;
-exports.validateOptionalCanonicalIsoDate = validateOptionalCanonicalIsoDate;
-//# sourceMappingURL=chunk-ZTAJL4DT.cjs.map
-//# sourceMappingURL=chunk-ZTAJL4DT.cjs.map

package/dist/chunk-ZTAJL4DT.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/date.ts"],"names":["ValidationError"],"mappings":";;;;;AAyEA,IAAM,0BAAA,GACJ,+CAAA;AAEF,IAAM,yBAAA,GACJ,yDAAA;AACF,IAAM,uBAAA,GACJ,uFAAA;AACF,IAAM,iBAAA,GAAoB,qBAAA;AAE1B,SAAS,iBAAiB,MAAA,EAAwB;AAChD,EAAA,IAAI,MAAA,CAAO,WAAA,EAAY,KAAM,GAAA,EAAK,OAAO,GAAA;AACzC,EAAA,IAAI,cAAc,IAAA,CAAK,MAAM,CAAA,EAAG,OAAO,GAAG,MAAM,CAAA,GAAA,CAAA;AAChD,EAAA,IAAI,aAAA,CAAc,IAAA,CAAK,MAAM,CAAA,EAAG;AAC9B,IAAA,OAAO,CAAA,EAAG,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA,CAAA,EAAI,MAAA,CAAO,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA;AAAA,EACjD;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,8BAA8B,KAAA,EAAuB;AAC5D,EAAA,IAAI,yBAAA,CAA0B,IAAA,CAAK,KAAK,CAAA,EAAG;AACzC,IAAA,OAAO,IAAA,CAAK,MAAM,CAAA,EAAG,KAAA,CAAM,QAAQ,GAAA,EAAK,GAAG,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACjD;AACA,EAAA,MAAM,WAAA,GAAc,uBAAA,CAAwB,IAAA,CAAK,KAAK,CAAA;AACtD,EAAA,IAAI,gBAAgB,IAAA,EAAM;AACxB,IAAA,MAAM,IAAA,GAAO,YAAY,CAAC,CAAA;AAC1B,IAAA,MAAM,IAAA,GAAO,YAAY,CAAC,CAAA;AAC1B,IAAA,MAAM,MAAA,GAAS,YAAY,CAAC,CAAA;AAC5B,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,MAAA,IAAa,WAAW,MAAA,EAAW;AACpE,MAAA,OAAO,MAAA,CAAO,GAAA;AAAA,IAChB;AACA,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,IAAI,CAAA,EAAG,gBAAA,CAAiB,MAAM,CAAC,CAAA,CAAE,CAAA;AAAA,EAChE;AACA,EAAA,IAAI,iBAAA,CAAkB,IAAA,CAAK,KAAK,CAAA,EAAG;AACjC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA,cAAA,CAAgB,CAAA;AAAA,EAC5C;AACA,EAAA,OAAO,MAAA,CAAO,GAAA;AAChB;AAWO,SAAS,8BACd,KAAA,EACoB;AACpB,EAAA,IAAI,iBAAiB,IAAA,EAAM;AACzB,IAAA,IAAI,OAAO,KAAA,CAAM,KAAA,CAAM,OAAA,EAAS,GAAG,OAAO,MAAA;AAC1C,IAAA,OAAO,MAAM,WAAA,EAAY;AAAA,EAC3B;AACA,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,OAAO,MAAA;AACtC,EAAA,MAAM,YAAA,GAAe,8BAA8B,KAAK,CAAA;AACxD,EAAA,IAAI,MAAA,CAAO,KAAA,CAAM,YAAY,CAAA,EAAG,OAAO,MAAA;AACvC,EAAA,OAAO,IAAI,IAAA,CAAK,YAAY,CAAA,CAAE,WAAA,EAAY;AAC5C;AAMO,SAAS,mBAAmB,KAAA,EAAwB;AACzD,EAAA,IAAI,CAAC,0BAAA,CAA2B,IAAA,CAAK,KAAK,GAAG,OAAO,KAAA;AACpD,EAAA,MAAM,IAAA,GAAO,IAAI,IAAA,CAAK,KAAK,CAAA;AAC3B,EAAA,OAAO,CAAC,OAAO,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA,IAAK,IAAA,CAAK,WAAA,EAAY,KAAM,KAAA;AACjE;AAgBO,SAAS,wBAAA,CACd,OACA,SAAA,EACQ;AACR,EAAA,IAAI,CAAC,kBAAA,CAAmB,KAAK,CAAA,EAAG;AAC9B,IAAA,MAAM,IAAIA,iCAAA;AAAA,MACR,CAAA,yCAAA,EAA4C,SAAS,CAAA,IAAA,EAAO,KAAK,CAAA,qDAAA,CAAA;AAAA,MAEjE;AAAA,QACE,MAAA,EAAQ;AAAA,UACN;AAAA,YACE,IAAA,EAAM,SAAA;AAAA,YACN,OAAA,EAAS,qEAAqE,KAAK,CAAA,CAAA;AAAA;AACrF;AACF,OACF;AAAA,MACA;AAAA,QACE,UAAA,EAAY,CAAA,oGAAA;AAAA;AACd,KACF;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAUO,SAAS,gCAAA,CACd,OACA,SAAA,EACoB;AACpB,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAChC,EAAA,OAAO,wBAAA,CAAyB,OAAO,SAAS,CAAA;AAClD;AAuBO,SAAS,MAAA,GAAiB;AAC/B,EAAA,OAAA,iBAAO,IAAI,IAAA,EAAK,EAAE,WAAA,EAAY;AAChC","file":"chunk-ZTAJL4DT.cjs","sourcesContent":["/**\n * Date encoding utilities for consistent storage.\n *\n * Contract: All dates are stored as ISO 8601 strings in UTC.\n * - Always includes milliseconds\n * - Always UTC (Z suffix)\n * - Sorts correctly as strings\n */\n\nimport { ValidationError } from \"../errors\";\n\n/**\n * ISO 8601 datetime pattern.\n * Matches formats like:\n * - 2024-01-15T10:30:00.000Z\n * - 2024-01-15T10:30:00Z\n * - 2024-01-15T10:30:00.123Z\n */\nconst ISO_DATE_PATTERN = /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(?:\\.\\d{1,3})?Z$/;\n\n/**\n * Checks if a string is a valid ISO 8601 datetime.\n *\n * @param value - String to validate\n * @returns True if valid ISO 8601 datetime\n */\nexport function isValidIsoDate(value: string): boolean {\n  if (!ISO_DATE_PATTERN.test(value)) {\n    return false;\n  }\n  // Also check that Date parsing produces a valid date\n  const date = new Date(value);\n  return !Number.isNaN(date.getTime());\n}\n\n/**\n * Validates that a string is a valid ISO 8601 datetime.\n * Throws ValidationError if invalid.\n *\n * @param value - String to validate\n * @param fieldName - Name of field for error message\n * @returns The validated string\n * @throws ValidationError if not a valid ISO datetime\n */\nexport function validateIsoDate(value: string, fieldName: string): string {\n  if (!isValidIsoDate(value)) {\n    throw new ValidationError(\n      `Invalid ISO 8601 datetime for \"${fieldName}\": \"${value}\". ` +\n        `Expected format: YYYY-MM-DDTHH:mm:ss.sssZ`,\n      {\n        issues: [\n          {\n            path: fieldName,\n            message: `Invalid ISO 8601 datetime format. Expected: YYYY-MM-DDTHH:mm:ss.sssZ, got: \"${value}\"`,\n          },\n        ],\n      },\n      {\n        suggestion: `Use a valid ISO 8601 UTC datetime like \"2024-01-15T10:30:00.000Z\"`,\n      },\n    );\n  }\n  return value;\n}\n\n/**\n * Strict canonical ISO 8601 pattern: fixed-width UTC with exactly\n * millisecond precision (`YYYY-MM-DDTHH:mm:ss.sssZ`). Unlike\n * {@link ISO_DATE_PATTERN}, which tolerates a missing or variable-width\n * fractional part, this is the only shape whose lexicographic text order\n * matches chronological order — avoiding cases like `\"...:00.1Z\"` (= `.100`)\n * sorting *after* `\"...:00.101Z\"`.\n */\nconst CANONICAL_ISO_DATE_PATTERN =\n  /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}\\.\\d{3}Z$/;\n\nconst ZONELESS_DATETIME_PATTERN =\n  /^\\d{4}-\\d{2}-\\d{2}[ T]\\d{2}:\\d{2}(?::\\d{2}(?:\\.\\d+)?)?$/;\nconst OFFSET_DATETIME_PATTERN =\n  /^(\\d{4}-\\d{2}-\\d{2})[ T](\\d{2}:\\d{2}(?::\\d{2}(?:\\.\\d+)?)?)(Z|[+-]\\d{2}(?::?\\d{2})?)$/i;\nconst DATE_ONLY_PATTERN = /^\\d{4}-\\d{2}-\\d{2}$/;\n\nfunction normalizedOffset(offset: string): string {\n  if (offset.toUpperCase() === \"Z\") return \"Z\";\n  if (/^[+-]\\d{2}$/.test(offset)) return `${offset}:00`;\n  if (/^[+-]\\d{4}$/.test(offset)) {\n    return `${offset.slice(0, 3)}:${offset.slice(3)}`;\n  }\n  return offset;\n}\n\nfunction databaseTimestampMilliseconds(value: string): number {\n  if (ZONELESS_DATETIME_PATTERN.test(value)) {\n    return Date.parse(`${value.replace(\" \", \"T\")}Z`);\n  }\n  const offsetMatch = OFFSET_DATETIME_PATTERN.exec(value);\n  if (offsetMatch !== null) {\n    const date = offsetMatch[1];\n    const time = offsetMatch[2];\n    const offset = offsetMatch[3];\n    if (date === undefined || time === undefined || offset === undefined) {\n      return Number.NaN;\n    }\n    return Date.parse(`${date}T${time}${normalizedOffset(offset)}`);\n  }\n  if (DATE_ONLY_PATTERN.test(value)) {\n    return Date.parse(`${value}T00:00:00.000Z`);\n  }\n  return Number.NaN;\n}\n\n/**\n * Canonicalizes a database-driver timestamp without interpreting a zoneless\n * string in the host timezone. PostgreSQL drivers can return values such as\n * `2026-06-25 12:00:00`; TypeGraph treats that shape as UTC so the same stored\n * clock value cannot move across hosts or daylight-saving boundaries.\n *\n * Returns `undefined` for an unsupported or unrepresentable value so callers\n * can raise an error specific to their storage boundary.\n */\nexport function canonicalizeDatabaseTimestamp(\n  value: unknown,\n): string | undefined {\n  if (value instanceof Date) {\n    if (Number.isNaN(value.getTime())) return undefined;\n    return value.toISOString();\n  }\n  if (typeof value !== \"string\") return undefined;\n  const milliseconds = databaseTimestampMilliseconds(value);\n  if (Number.isNaN(milliseconds)) return undefined;\n  return new Date(milliseconds).toISOString();\n}\n\n/**\n * Checks if a string is a canonical UTC ISO 8601 datetime with fixed\n * millisecond width (`YYYY-MM-DDTHH:mm:ss.sssZ`).\n */\nexport function isCanonicalIsoDate(value: string): boolean {\n  if (!CANONICAL_ISO_DATE_PATTERN.test(value)) return false;\n  const date = new Date(value);\n  return !Number.isNaN(date.getTime()) && date.toISOString() === value;\n}\n\n/**\n * Validates that a string is a canonical UTC ISO 8601 datetime with fixed\n * millisecond width. Stricter than {@link validateIsoDate} (which also\n * accepts missing or 1–2 digit milliseconds): required wherever the value\n * is compared **as text** against stored timestamps and must sort\n * chronologically — e.g. a temporal `asOf` coordinate, where a\n * variable-width value would mis-order and silently include or exclude the\n * wrong rows. Produce one with `new Date(value).toISOString()`.\n *\n * @param value - String to validate\n * @param fieldName - Name of field for error message\n * @returns The validated string\n * @throws ValidationError if not a canonical UTC ISO datetime\n */\nexport function validateCanonicalIsoDate(\n  value: string,\n  fieldName: string,\n): string {\n  if (!isCanonicalIsoDate(value)) {\n    throw new ValidationError(\n      `Invalid canonical ISO 8601 datetime for \"${fieldName}\": \"${value}\". ` +\n        `Expected fixed-width UTC: YYYY-MM-DDTHH:mm:ss.sssZ`,\n      {\n        issues: [\n          {\n            path: fieldName,\n            message: `Expected canonical UTC ISO 8601 (YYYY-MM-DDTHH:mm:ss.sssZ), got: \"${value}\"`,\n          },\n        ],\n      },\n      {\n        suggestion: `Use a fixed-width UTC datetime like \"2024-01-15T10:30:00.000Z\" (e.g. new Date(value).toISOString()).`,\n      },\n    );\n  }\n  return value;\n}\n\n/**\n * Validates an optional canonical ISO date string. Returns `undefined` for an\n * absent value; otherwise enforces canonical fixed-width UTC ISO 8601 via\n * {@link validateCanonicalIsoDate}. Used for stored validity-window inputs\n * (`validFrom` / `validTo`) so every timestamp the temporal filters compare as\n * text is canonical and sorts chronologically — the same contract the `asOf`\n * read coordinate already enforces.\n */\nexport function validateOptionalCanonicalIsoDate(\n  value: string | undefined,\n  fieldName: string,\n): string | undefined {\n  if (value === undefined) return undefined;\n  return validateCanonicalIsoDate(value, fieldName);\n}\n\n/**\n * Encodes a Date to an ISO 8601 string for storage.\n */\nexport function encodeDate(date: Date): string {\n  return date.toISOString();\n}\n\n/**\n * Decodes an ISO 8601 string to a Date.\n * Validates the string format first.\n *\n * @throws ValidationError if not a valid ISO datetime\n */\nexport function decodeDate(isoString: string): Date {\n  validateIsoDate(isoString, \"date\");\n  return new Date(isoString);\n}\n\n/**\n * Returns the current timestamp as an ISO string.\n */\nexport function nowIso(): string {\n  return new Date().toISOString();\n}\n"]}

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

@@ -1,173 +0,0 @@
-import { N as NodeRegistration, E as EdgeRegistration, O as OntologyRelation, D as DeleteBehavior, T as TemporalMode, I as IndexDeclaration, G as GraphExtension, d as NodeType, e as AnyEdgeType, f as GraphDefaults } from './types-Ch9a0Dx6.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/define-graph-alREY2wj.d.cts

@@ -1,173 +0,0 @@
-import { N as NodeRegistration, E as EdgeRegistration, O as OntologyRelation, D as DeleteBehavior, T as TemporalMode, I as IndexDeclaration, G as GraphExtension, d as NodeType, e as AnyEdgeType, f as GraphDefaults } from './types-Ch9a0Dx6.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 };