@nicia-ai/typegraph 0.29.0 → 0.31.0

package/dist/schema/index.d.ts

@@ -1,14 +1,14 @@
-import { K as KindRegistry, G as GraphDef } from '../manager-BUugwCYz.js';
-export { C as ChangeSeverity, a as ChangeType, D as DeprecatedKindsChange, E as EdgeChange, b as ExtensionChange, I as IndexChange, M as MigrationHookContext, N as NodeChange, O as OntologyChange, S as SchemaDiff, c as SchemaManagerOptions, d as SchemaValidationResult, e as applyDeprecatedKinds, f as assertSchemaCurrent, g as computeSchemaDiff, h as ensureSchema, i as getActiveSchema, j as getMigrationActions, k as getSchemaChanges, l as initializeSchema, m as isBackwardsCompatible, n as isSchemaInitialized, o as loadActiveSchemaWithBootstrap, p as loadAndMergeGraphExtensionDocument, q as migrateSchema, r as parseSerializedSchema, s as rollbackSchema } from '../manager-BUugwCYz.js';
-import { f as SerializedNodeDef, g as SerializedEdgeDef, h as SerializedMetaEdge, i as SerializedOntologyRelation, j as SerializedClosures, k as SerializedSchema, l as SchemaHash } from '../types-CmAT-Z47.js';
-export { m as JsonSchema, n as SerializedOntology, o as SerializedUniqueConstraint } from '../types-CmAT-Z47.js';
-import { a as NullCheckOp, K as KindEntity } from '../extension-types-CwHV-Uk4.js';
+import { K as KindRegistry, G as GraphDef } from '../manager-By-WEd8M.js';
+export { C as ChangeSeverity, a as ChangeType, D as DeprecatedKindsChange, E as EdgeChange, b as ExtensionChange, I as IndexChange, M as MigrationHookContext, N as NodeChange, O as OntologyChange, S as SchemaDiff, c as SchemaManagerOptions, d as SchemaValidationResult, e as applyDeprecatedKinds, f as assertSchemaCurrent, g as computeSchemaDiff, h as ensureSchema, i as getActiveSchema, j as getMigrationActions, k as getSchemaChanges, l as initializeSchema, m as isBackwardsCompatible, n as isSchemaInitialized, o as loadActiveSchemaWithBootstrap, p as loadAndMergeGraphExtensionDocument, q as migrateSchema, r as parseSerializedSchema, s as rollbackSchema } from '../manager-By-WEd8M.js';
+import { f as SerializedNodeDef, g as SerializedEdgeDef, h as SerializedMetaEdge, i as SerializedOntologyRelation, j as SerializedClosures, k as SerializedSchema, l as SchemaHash } from '../types-BKQljXom.js';
+export { m as JsonSchema, n as SerializedOntology, o as SerializedUniqueConstraint } from '../types-BKQljXom.js';
+import { a as NullCheckOp, K as KindEntity } from '../extension-types-D1k0inWU.js';
 import { ZodType, ZodError } from 'zod';
-import { V as ValidationIssue, a as ValidationError } from '../index-CapHwi1a.js';
+import { V as ValidationIssue, a as ValidationError } from '../index-BEK0VtNB.js';
 import 'drizzle-orm';
 import 'drizzle-orm/pg-core';
 import 'drizzle-orm/sqlite-core';
-import '../materialize-indexes-lkawaDor.js';
+import '../materialize-indexes-CAGhqPHQ.js';
 
 /**
  * Schema deserializer for loading stored schemas.

package/dist/schema/index.js

@@ -1,13 +1,14 @@
-import { KindRegistry } from '../chunk-MRMD7S7E.js';
-export { applyDeprecatedKinds, assertSchemaCurrent, computeSchemaDiff, computeSchemaHash, createValidationError, deserializeWherePredicate, ensureSchema, getActiveSchema, getMigrationActions, getSchemaChanges, initializeSchema, isBackwardsCompatible, isSchemaInitialized, loadActiveSchemaWithBootstrap, loadAndMergeGraphExtensionDocument, migrateSchema, parseSerializedSchema, rollbackSchema, serializeSchema, validateEdgeProps, validateNodeProps, validateProps, wrapZodError } from '../chunk-MRMD7S7E.js';
-import '../chunk-Z36W5WUM.js';
-import '../chunk-SFNUHFON.js';
-import '../chunk-M6OC455F.js';
-import '../chunk-OGUH56BB.js';
-import '../chunk-N3VVQDMA.js';
+import { KindRegistry } from '../chunk-XKJQQQVR.js';
+export { applyDeprecatedKinds, assertSchemaCurrent, computeSchemaDiff, computeSchemaHash, createValidationError, deserializeWherePredicate, ensureSchema, getActiveSchema, getMigrationActions, getSchemaChanges, initializeSchema, isBackwardsCompatible, isSchemaInitialized, loadActiveSchemaWithBootstrap, loadAndMergeGraphExtensionDocument, migrateSchema, parseSerializedSchema, rollbackSchema, serializeSchema, validateEdgeProps, validateNodeProps, validateProps, wrapZodError } from '../chunk-XKJQQQVR.js';
+import '../chunk-MAQJYNJR.js';
+import '../chunk-IJORSAC3.js';
+import '../chunk-MXE2U3EX.js';
 import '../chunk-454I6GDF.js';
-import '../chunk-MB363HT5.js';
-import '../chunk-NZ5PMBTG.js';
+import '../chunk-YCV72E6L.js';
+import '../chunk-M6OC455F.js';
+import '../chunk-2YMGNYXY.js';
+import '../chunk-TQOYM4LN.js';
+import '../chunk-K5P5OZXS.js';
 
 // src/schema/deserializer.ts
 function deserializeSchema(schema) {

package/dist/schema/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/schema/deserializer.ts"],"names":[],"mappings":";;;;;;;;;;;;AA6EO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,OAAO,IAAI,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IAC5C,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"index.js","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  return new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}
+{"version":3,"sources":["../../src/schema/deserializer.ts"],"names":[],"mappings":";;;;;;;;;;;;;AA6EO,SAAS,kBACd,MAAA,EACoB;AACpB,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAC1C,EAAA,MAAM,aAAA,GAAgB,MAAA,CAAO,IAAA,CAAK,MAAA,CAAO,SAAS,SAAS,CAAA;AAE3D,EAAA,OAAO;AAAA,IACL,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,SAAS,MAAA,CAAO,OAAA;AAAA,IAChB,aAAa,MAAA,CAAO,WAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,OAAA,EAAS,CAAC,IAAA,KAAS,MAAA,CAAO,MAAM,IAAI,CAAA;AAAA,IACpC,cAAc,MAAM,SAAA;AAAA,IAEpB,aAAa,CAAC,IAAA,KAAS,MAAA,CAAO,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACrD,kBAAkB,MAAM,aAAA;AAAA,IAExB,YAAA,EAAc,MAAM,MAAA,CAAO,QAAA,CAAS,SAAA;AAAA,IACpC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA,CAAS,QAAA;AAAA,IAEnC,WAAA,EAAa,MAAM,MAAA,CAAO,QAAA;AAAA,IAC1B,QAAQ,MAAM,MAAA;AAAA,IAEd,aAAA,EAAe,MAAM,yBAAA,CAA0B,MAAM;AAAA,GACvD;AACF;AAWA,SAAS,0BAA0B,MAAA,EAAwC;AACzE,EAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAA,CAAO,QAAA;AAG5B,EAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,QAAA,CAAS,iBAAiB,CAAA;AAChE,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AACpE,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,eAAA,GAAkB,WAAA,CAAY,QAAA,CAAS,eAAe,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,WAAA,CAAY,QAAA,CAAS,aAAa,CAAA;AACxD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,QAAA,CAAS,cAAc,CAAA;AAC1D,EAAA,MAAM,SAAA,GAAY,iBAAA,CAAkB,QAAA,CAAS,SAAS,CAAA;AACtD,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,QAAA,CAAS,aAAa,CAAA;AACpD,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,QAAA,CAAS,YAAY,CAAA;AAC5D,EAAA,MAAM,uBAAA,GAA0B,WAAA,CAAY,QAAA,CAAS,uBAAuB,CAAA;AAC5E,EAAA,MAAM,mBAAA,GAAsB,WAAA,CAAY,QAAA,CAAS,mBAAmB,CAAA;AAGpE,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAE1B,EAAA,OAAO,IAAI,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW;AAAA,IAC5C,iBAAA;AAAA,IACA,mBAAA;AAAA,IACA,cAAA;AAAA,IACA,eAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,YAAA;AAAA,IACA,uBAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH;AAKA,SAAS,YACP,MAAA,EAC0C;AAC1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAyB;AAC5C,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClD,IAAA,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,MAAA;AACT;AAKA,SAAS,kBACP,MAAA,EAC6B;AAC7B,EAAA,OAAO,IAAI,GAAA,CAAI,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAC,CAAA;AACvC","file":"index.js","sourcesContent":["/**\n * Schema deserializer for loading stored schemas.\n *\n * Reconstructs runtime objects from SerializedSchema.\n * Note: Zod schemas cannot be fully reconstructed from JSON Schema,\n * so this provides access to the serialized data for introspection.\n */\nimport { KindRegistry } from \"../registry/kind-registry\";\nimport {\n  type SerializedClosures,\n  type SerializedEdgeDef,\n  type SerializedMetaEdge,\n  type SerializedNodeDef,\n  type SerializedOntologyRelation,\n  type SerializedSchema,\n} from \"./types\";\n\n// ============================================================\n// Deserialized Schema\n// ============================================================\n\n/**\n * A deserialized schema provides read-only access to schema metadata.\n *\n * Note: Unlike the original GraphDef, this does not include Zod schemas\n * since those cannot be reconstructed from JSON Schema. Use this for\n * introspection and metadata access only.\n */\nexport type DeserializedSchema = Readonly<{\n  graphId: string;\n  version: number;\n  generatedAt: string;\n\n  /** Get node definition by name */\n  getNode: (name: string) => SerializedNodeDef | undefined;\n\n  /** Get all node names */\n  getNodeNames: () => readonly string[];\n\n  /** Get edge definition by name */\n  getEdge: (name: string) => SerializedEdgeDef | undefined;\n\n  /** Get all edge names */\n  getEdgeNames: () => readonly string[];\n\n  /** Get meta-edge definition by name */\n  getMetaEdge: (name: string) => SerializedMetaEdge | undefined;\n\n  /** Get all meta-edge names */\n  getMetaEdgeNames: () => readonly string[];\n\n  /** Get all ontology relations */\n  getRelations: () => readonly SerializedOntologyRelation[];\n\n  /** Get precomputed closures */\n  getClosures: () => SerializedClosures;\n\n  /** Get graph defaults */\n  getDefaults: () => SerializedSchema[\"defaults\"];\n\n  /** Get the raw serialized schema */\n  getRaw: () => SerializedSchema;\n\n  /** Build a KindRegistry from the closures */\n  buildRegistry: () => KindRegistry;\n}>;\n\n// ============================================================\n// Deserialization\n// ============================================================\n\n/**\n * Deserializes a SerializedSchema into a DeserializedSchema.\n *\n * @param schema - The serialized schema to deserialize\n * @returns A deserialized schema with accessor methods\n */\nexport function deserializeSchema(\n  schema: SerializedSchema,\n): DeserializedSchema {\n  const nodeNames = Object.keys(schema.nodes);\n  const edgeNames = Object.keys(schema.edges);\n  const metaEdgeNames = Object.keys(schema.ontology.metaEdges);\n\n  return {\n    graphId: schema.graphId,\n    version: schema.version,\n    generatedAt: schema.generatedAt,\n\n    getNode: (name) => schema.nodes[name],\n    getNodeNames: () => nodeNames,\n\n    getEdge: (name) => schema.edges[name],\n    getEdgeNames: () => edgeNames,\n\n    getMetaEdge: (name) => schema.ontology.metaEdges[name],\n    getMetaEdgeNames: () => metaEdgeNames,\n\n    getRelations: () => schema.ontology.relations,\n    getClosures: () => schema.ontology.closures,\n\n    getDefaults: () => schema.defaults,\n    getRaw: () => schema,\n\n    buildRegistry: () => buildRegistryFromClosures(schema),\n  };\n}\n\n// ============================================================\n// Registry Building\n// ============================================================\n\n/**\n * Builds a KindRegistry from serialized closures.\n *\n * This allows query execution without recomputing closures.\n */\nfunction buildRegistryFromClosures(schema: SerializedSchema): KindRegistry {\n  const { closures } = schema.ontology;\n\n  // Convert Record<string, string[]> back to Map<string, Set<string>>\n  const subClassAncestors = recordToMap(closures.subClassAncestors);\n  const subClassDescendants = recordToMap(closures.subClassDescendants);\n  const broaderClosure = recordToMap(closures.broaderClosure);\n  const narrowerClosure = recordToMap(closures.narrowerClosure);\n  const equivalenceSets = recordToMap(closures.equivalenceSets);\n  const partOfClosure = recordToMap(closures.partOfClosure);\n  const hasPartClosure = recordToMap(closures.hasPartClosure);\n  const iriToKind = simpleRecordToMap(closures.iriToKind);\n  const disjointPairs = new Set(closures.disjointPairs);\n  const edgeInverses = simpleRecordToMap(closures.edgeInverses);\n  const edgeImplicationsClosure = recordToMap(closures.edgeImplicationsClosure);\n  const edgeImplyingClosure = recordToMap(closures.edgeImplyingClosure);\n\n  // Build empty node/edge kind maps (we don't have the actual Zod schemas)\n  const nodeKinds = new Map();\n  const edgeKinds = new Map();\n\n  return new KindRegistry(nodeKinds, edgeKinds, {\n    subClassAncestors,\n    subClassDescendants,\n    broaderClosure,\n    narrowerClosure,\n    equivalenceSets,\n    iriToKind,\n    disjointPairs,\n    partOfClosure,\n    hasPartClosure,\n    edgeInverses,\n    edgeImplicationsClosure,\n    edgeImplyingClosure,\n  });\n}\n\n/**\n * Converts Record<string, string[]> to Map<string, Set<string>>.\n */\nfunction recordToMap(\n  record: Record<string, readonly string[]>,\n): ReadonlyMap<string, ReadonlySet<string>> {\n  const result = new Map<string, Set<string>>();\n  for (const [key, values] of Object.entries(record)) {\n    result.set(key, new Set(values));\n  }\n  return result;\n}\n\n/**\n * Converts Record<string, string> to Map<string, string>.\n */\nfunction simpleRecordToMap(\n  record: Record<string, string>,\n): ReadonlyMap<string, string> {\n  return new Map(Object.entries(record));\n}\n"]}

package/dist/{sqlite-Rj3xu4It.d.cts → sqlite-Gatk_iw_.d.cts}

@@ -1,5 +1,5 @@
 import * as drizzle_orm_sqlite_core from 'drizzle-orm/sqlite-core';
-import { I as IndexDeclaration } from './types-DXCSyxac.cjs';
+import { I as IndexDeclaration } from './types-C1CYxWrL.cjs';
 
 /**
  * Table name configuration.

package/dist/{sqlite-CZDFUfHS.d.ts → sqlite-aM_PAz-O.d.ts}

@@ -1,5 +1,5 @@
 import * as drizzle_orm_sqlite_core from 'drizzle-orm/sqlite-core';
-import { I as IndexDeclaration } from './types-CmAT-Z47.js';
+import { I as IndexDeclaration } from './types-BKQljXom.js';
 
 /**
  * Table name configuration.

package/dist/{store-B43FpOVX.d.cts → store-DuCbdqsh.d.cts}

@@ -1,9 +1,9 @@
 import { z } from 'zod';
-import { p as SqlDialect, ai as SqlSchema, F as FulltextStrategy, V as VectorStrategy, aA as VectorSlotMap, aB as ValueType, aC as PredicateExpression, aD as VectorMetricType, a1 as FulltextQueryMode, Q as QueryAst, J as JsonPointer, P as FieldRef, ad as ParameterRef, G as GraphBackend, am as TransactionBackend, a6 as JsonPointerInput, an as TraversalExpansion, aE as Traversal, aF as NodePredicate, aG as ProjectedField, ac as OrderSpec, aH as GroupBySpec, a4 as HybridFusionOptions, aI as RecursiveCyclePolicy, aJ as TraversalDirection$1, aK as EdgeRow, aL as NodeRow, W as AdoptedTransaction, L as AggregateExpr, aM as SelectiveField, aN as ComposableQuery, aO as SetOperationType, aP as SetOperation, ah as SortDirection, m as JsonSchema, aQ as VectorMetric } from './types-DXCSyxac.cjs';
-import { K as KindRegistry, G as GraphDef, u as EdgeKinds, x as NodeKinds, t as AllNodeTypes, c as SchemaManagerOptions, d as SchemaValidationResult } from './manager-DpIpn1HQ.cjs';
-import { A as AnyEdgeType, N as NodeType, T as TemporalMode, d as EdgeType, E as EdgeRegistration, i as EdgeId, m as NodeId, b as NodeRegistration, K as KindEntity, f as Cardinality, g as EndpointExistence, e as KindAnnotations, U as UniquenessScope, C as Collation, G as GraphExtension } from './extension-types-CwHV-Uk4.cjs';
+import { aA as ValueType, aB as PredicateExpression, aC as VectorMetricType, a1 as FulltextQueryMode, Q as QueryAst, J as JsonPointer, P as FieldRef, ad as ParameterRef, G as GraphBackend, am as TransactionBackend, a6 as JsonPointerInput, an as TraversalExpansion, p as SqlDialect, ai as SqlSchema, aD as Traversal, aE as NodePredicate, aF as ProjectedField, ac as OrderSpec, aG as GroupBySpec, a4 as HybridFusionOptions, aH as RecursiveCyclePolicy, aI as TraversalDirection$1, aJ as EdgeRow, aK as NodeRow, W as AdoptedTransaction, L as AggregateExpr, F as FulltextStrategy, V as VectorStrategy, aL as VectorSlotMap, aM as SelectiveField, aN as ComposableQuery, aO as SetOperationType, aP as SetOperation, ah as SortDirection, m as JsonSchema, aQ as VectorMetric } from './types-C1CYxWrL.cjs';
+import { K as KindRegistry, G as GraphDef, w as EdgeKinds, t as NodeKinds, v as AllNodeTypes, c as SchemaManagerOptions, d as SchemaValidationResult } from './manager-Np7VVSlE.cjs';
+import { A as AnyEdgeType, N as NodeType, T as TemporalMode, g as EdgeType, E as EdgeRegistration, e as EdgeId, d as NodeId, b as NodeRegistration, K as KindEntity, m as Cardinality, n as EndpointExistence, f as KindAnnotations, U as UniquenessScope, C as Collation, G as GraphExtension } from './extension-types-D1k0inWU.cjs';
 import { SQL } from 'drizzle-orm';
-import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-oanE3RU0.cjs';
+import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-DEYkU-wr.cjs';
 
 /**
  * Embedding type for vector search.
@@ -216,45 +216,6 @@ declare function searchable(options?: SearchableOptions): SearchableSchema;
 declare function isSearchableSchema(value: unknown): value is SearchableSchema;
 declare function getSearchableMetadata(schema: z.ZodType): SearchableMetadata | undefined;
 
-/**
- * Query Compiler Module
- *
- * Main entry point for compiling query ASTs to SQL.
- * Re-exports individual compiler modules and provides the main compile functions.
- */
-
-/**
- * Options for query compilation.
- */
-type CompileQueryOptions = Readonly<{
-    /** SQL dialect ("sqlite" or "postgres"). Defaults to "sqlite". */
-    dialect?: SqlDialect | undefined;
-    /** SQL schema configuration for table names. Defaults to standard names. */
-    schema?: SqlSchema | undefined;
-    /**
-     * Fulltext strategy override. When set, overrides the dialect's
-     * default fulltext strategy for `$fulltext.matches()` compilation.
-     * Callers typically read this from `backend.fulltextStrategy` so a
-     * backend-declared strategy (e.g. ParadeDB) wins over the dialect
-     * default (tsvector).
-     */
-    fulltextStrategy?: FulltextStrategy | undefined;
-    /**
-     * Vector strategy override. When set, `field.similarTo(...)`
-     * predicates compile against the strategy's per-`(kind, field)`
-     * tables and distance expression. Callers read it from
-     * `backend.vectorStrategy` so a backend-declared strategy (pgvector,
-     * libsql-native, sqlite-vec) drives the per-field relevance scan.
-     */
-    vectorStrategy?: VectorStrategy | undefined;
-    /**
-     * Declared embedding slots `(kind, fieldPath) -> descriptor` used by
-     * the `field.similarTo(...)` CTE to know which kinds in an alias
-     * declare the field. Callers build it from the graph's node schemas.
-     */
-    vectorSlots?: VectorSlotMap | undefined;
-}>;
-
 type FieldTypeInfo = Readonly<{
     valueType: ValueType;
     elementType?: ValueType | undefined;
@@ -1187,6 +1148,19 @@ type NodeGetOrCreateByConstraintOptions = Readonly<{
     /** Existing record behavior. Default: "return" */
     ifExists?: IfExistsMode;
 }>;
+/**
+ * Options for node bulkFindByIndex operations.
+ */
+type NodeBulkFindByIndexOptions = Readonly<{
+    /**
+     * Maximum number of candidate nodes returned per input item. When omitted,
+     * each input's candidate set is unbounded. Must be a positive integer.
+     *
+     * Candidates are ordered deterministically by node id, so the cap is stable
+     * across calls. Use this to bound fan-out on low-selectivity index keys.
+     */
+    limitPerInput?: number;
+}>;
 /**
  * Result of an edge getOrCreateByEndpoints operation.
  */
@@ -1363,6 +1337,28 @@ type NodeCollection<N extends NodeType, CN extends string = string> = Readonly<{
     bulkFindByConstraint: (constraintName: CN, items: readonly Readonly<{
         props: z.input<N["schema"]>;
     }>[]) => Promise<(Node<N> | undefined)[]>;
+    /**
+     * Batched candidate retrieval against a declared node index.
+     *
+     * For each input item, TypeGraph computes the index lookup key from
+     * `index.fields` (JSON-pointer extraction, partial-`where` applied to
+     * stored rows, null-safe matching) and returns the live, non-soft-deleted
+     * nodes that share that key. Unlike {@link bulkFindByConstraint}, the index
+     * may be non-unique, so each input yields a (possibly empty) array.
+     *
+     * Results preserve input order; each inner array is ordered by node id.
+     * Empty input returns `[]`. An unknown index name throws
+     * `NodeIndexNotFoundError`; a type-incompatible indexed field throws
+     * `ValidationError`. This is candidate retrieval, not a uniqueness or
+     * identity guarantee.
+     *
+     * @param indexName - Name of the declared node index to match on
+     * @param items - Records whose `props` supply the indexed-field values
+     * @param options - Optional `limitPerInput` to bound per-input fan-out
+     */
+    bulkFindByIndex: (indexName: string, items: readonly Readonly<{
+        props: Partial<z.input<N["schema"]>>;
+    }>[], options?: NodeBulkFindByIndexOptions) => Promise<readonly Node<N>[][]>;
     /**
      * Get an existing node by uniqueness constraint, or create a new one.
      *
@@ -2010,6 +2006,50 @@ declare class ExecutableAggregateQuery<G extends GraphDef, Aliases extends Alias
     execute(): Promise<readonly AggregateResult<R>[]>;
 }
 
+/**
+ * Query Compiler Module
+ *
+ * Main entry point for compiling query ASTs to SQL.
+ * Re-exports individual compiler modules and provides the main compile functions.
+ */
+
+/**
+ * Options for query compilation.
+ */
+type CompileQueryOptions = Readonly<{
+    /** SQL dialect ("sqlite" or "postgres"). Defaults to "sqlite". */
+    dialect?: SqlDialect | undefined;
+    /** SQL schema configuration for table names. Defaults to standard names. */
+    schema?: SqlSchema | undefined;
+    /**
+     * Fulltext strategy override. When set, overrides the dialect's
+     * default fulltext strategy for `$fulltext.matches()` compilation.
+     * Callers typically read this from `backend.fulltextStrategy` so a
+     * backend-declared strategy (e.g. ParadeDB) wins over the dialect
+     * default (tsvector).
+     */
+    fulltextStrategy?: FulltextStrategy | undefined;
+    /**
+     * Vector strategy override. When set, `field.similarTo(...)`
+     * predicates compile against the strategy's per-`(kind, field)`
+     * tables and distance expression. Callers read it from
+     * `backend.vectorStrategy` so a backend-declared strategy (pgvector,
+     * libsql-native, sqlite-vec) drives the per-field relevance scan.
+     */
+    vectorStrategy?: VectorStrategy | undefined;
+    /**
+     * Whether the active backend supports SQL window functions such as
+     * `ROW_NUMBER()`. Defaults to true for direct compiler callers.
+     */
+    windowFunctions?: boolean | undefined;
+    /**
+     * Declared embedding slots `(kind, fieldPath) -> descriptor` used by
+     * the `field.similarTo(...)` CTE to know which kinds in an alias
+     * declare the field. Callers build it from the graph's node schemas.
+     */
+    vectorSlots?: VectorSlotMap | undefined;
+}>;
+
 type PreparedQueryConfig<R> = Readonly<{
     ast: QueryAst;
     unoptimizedAst: QueryAst;
@@ -3912,4 +3952,4 @@ declare function createStoreWithSchema<G extends GraphDef>(graph: G, backend: Gr
  */
 declare function createVerifiedStore<G extends GraphDef>(graph: G, backend: GraphBackend, options?: StoreOptions): Promise<[Store<G>, SchemaValidationResult]>;
 
-export { type KindIntrospection as $, type AliasMap as A, type BaseTraversalOptions as B, type CreateQueryBuilderOptions as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EmbeddingMetric as E, type EdgeGetOrCreateByEndpointsResult as F, type EdgeIntrospection as G, type EmbeddingSchema as H, type EmbeddingValue as I, ExecutableAggregateQuery as J, ExecutableQuery as K, type FieldAccessor as L, type FulltextSearchHit as M, type FulltextSearchOptions as N, type GetOrCreateAction as O, type GraphAlgorithms as P, QueryBuilder as Q, type GraphEdgeCollections as R, Store as S, TraversalBuilder as T, type GraphNodeCollections as U, type HookContext as V, type HybridFulltextOptions as W, type HybridSearchHit as X, type HybridSearchOptions as Y, type HybridVectorOptions as Z, type IfExistsMode as _, type EmbeddingIndexType as a, createStoreWithSchema as a$, type MaterializeRemovalsEntry as a0, type MaterializeRemovalsOptions as a1, type MaterializeRemovalsResult as a2, type NeighborsOptions as a3, type Node as a4, type NodeAccessor as a5, type NodeAlias as a6, type NodeCollection as a7, type NodeGetOrCreateByConstraintOptions as a8, type NodeGetOrCreateByConstraintResult as a9, type SelectableEdge as aA, type SelectableNode as aB, type ShortestPathOptions as aC, type ShortestPathResult as aD, type StoreHooks as aE, type StoreOptions as aF, type StoreProjection as aG, type StoreRef as aH, StoreSearch as aI, type StreamOptions as aJ, type SubgraphEdgeResult as aK, type SubgraphNodeResult as aL, type SubgraphOptions as aM, type SubgraphResult as aN, type SubsetEdge as aO, type SubsetNode as aP, type TemporalAlgorithmOptions as aQ, type TransactionContext as aR, type TraversalDirection as aS, type TypedEdgeCollection as aT, UnionableQuery as aU, type UniqueIntrospection as aV, type UpdateEdgeInput as aW, type UpdateNodeInput as aX, type VectorSearchHit as aY, type VectorSearchOptions as aZ, createStore as a_, type NodeIdentifier as aa, type NodeRef as ab, type OntologyIntrospection as ac, type OperationHookContext as ad, type PaginateOptions as ae, type PaginatedResult as af, type PathNode as ag, type Predicate as ah, PreparedQuery as ai, type PropsAccessor as aj, type QueryHookContext as ak, type QueryOptions as al, type ReachableNode as am, type ReachableOptions as an, type RebuildFulltextOptions as ao, type RebuildFulltextResult as ap, type ReclaimedVectorFieldEntry as aq, type RecursiveTraversalOptions as ar, type ReembedFunction as as, type ReembedVectorFieldOptions as at, type ReembedVectorFieldResult as au, type SchemaIntrospection as av, type SearchableMetadata as aw, type SearchableOptions as ax, type SearchableSchema as ay, type SelectContext as az, type EdgeAliasMap as b, createVerifiedStore as b0, defineSubgraphProject as b1, embedding as b2, exists as b3, fieldRef as b4, getEmbeddingDimensions as b5, getSearchableMetadata as b6, inSubquery as b7, isEmbeddingSchema as b8, isParameterRef as b9, isSearchableSchema as ba, notExists as bb, notInSubquery as bc, param as bd, searchable as be, type AggregateResult as c, type AlgorithmCyclePolicy as d, type AnyEdge as e, type AnyNode as f, type BatchResults as g, type BatchableQuery as h, type ConstraintNames as i, type CreateEdgeInput as j, type CreateNodeInput as k, type DegreeOptions as l, type DynamicEdgeAccessor as m, type DynamicEdgeCollection as n, type DynamicEdgeType as o, type DynamicFieldBuilder as p, type DynamicNodeAccessor as q, type DynamicNodeCollection as r, type DynamicNodeType as s, type DynamicSelectableEdge as t, type DynamicSelectableNode as u, type Edge as v, type EdgeAccessor as w, type EdgeCollection as x, type EdgeFindByEndpointsOptions as y, type EdgeGetOrCreateByEndpointsOptions as z };
+export { type HybridVectorOptions as $, type AliasMap as A, type BaseTraversalOptions as B, type CreateQueryBuilderOptions as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EmbeddingMetric as E, type EdgeGetOrCreateByEndpointsResult as F, type EdgeIntrospection as G, type EmbeddingSchema as H, type EmbeddingValue as I, ExecutableAggregateQuery as J, ExecutableQuery as K, type FieldAccessor as L, type FulltextSearchHit as M, type Node as N, type FulltextSearchOptions as O, type GetOrCreateAction as P, QueryBuilder as Q, type GraphAlgorithms as R, Store as S, TraversalBuilder as T, type UniqueIntrospection as U, type GraphEdgeCollections as V, type GraphNodeCollections as W, type HookContext as X, type HybridFulltextOptions as Y, type HybridSearchHit as Z, type HybridSearchOptions as _, type EmbeddingIndexType as a, createStore as a$, type IfExistsMode as a0, type KindIntrospection as a1, type MaterializeRemovalsEntry as a2, type MaterializeRemovalsOptions as a3, type MaterializeRemovalsResult as a4, type NeighborsOptions as a5, type NodeAccessor as a6, type NodeAlias as a7, type NodeBulkFindByIndexOptions as a8, type NodeCollection as a9, type SearchableSchema as aA, type SelectContext as aB, type SelectableEdge as aC, type SelectableNode as aD, type ShortestPathOptions as aE, type ShortestPathResult as aF, type StoreHooks as aG, type StoreOptions as aH, type StoreProjection as aI, type StoreRef as aJ, StoreSearch as aK, type StreamOptions as aL, type SubgraphEdgeResult as aM, type SubgraphNodeResult as aN, type SubgraphOptions as aO, type SubgraphResult as aP, type SubsetEdge as aQ, type SubsetNode as aR, type TemporalAlgorithmOptions as aS, type TransactionContext as aT, type TraversalDirection as aU, type TypedEdgeCollection as aV, UnionableQuery as aW, type UpdateEdgeInput as aX, type UpdateNodeInput as aY, type VectorSearchHit as aZ, type VectorSearchOptions as a_, type NodeGetOrCreateByConstraintOptions as aa, type NodeGetOrCreateByConstraintResult as ab, type NodeIdentifier as ac, type NodeRef as ad, type OntologyIntrospection as ae, type OperationHookContext as af, type PaginateOptions as ag, type PaginatedResult as ah, type PathNode as ai, type Predicate as aj, PreparedQuery as ak, type PropsAccessor as al, type QueryHookContext as am, type QueryOptions as an, type ReachableNode as ao, type ReachableOptions as ap, type RebuildFulltextOptions as aq, type RebuildFulltextResult as ar, type ReclaimedVectorFieldEntry as as, type RecursiveTraversalOptions as at, type ReembedFunction as au, type ReembedVectorFieldOptions as av, type ReembedVectorFieldResult as aw, type SchemaIntrospection as ax, type SearchableMetadata as ay, type SearchableOptions as az, type EdgeAliasMap as b, createStoreWithSchema as b0, createVerifiedStore as b1, defineSubgraphProject as b2, embedding as b3, exists as b4, fieldRef as b5, getEmbeddingDimensions as b6, getSearchableMetadata as b7, inSubquery as b8, isEmbeddingSchema as b9, isParameterRef as ba, isSearchableSchema as bb, notExists as bc, notInSubquery as bd, param as be, searchable as bf, type AggregateResult as c, type AlgorithmCyclePolicy as d, type AnyEdge as e, type AnyNode as f, type BatchResults as g, type BatchableQuery as h, type ConstraintNames as i, type CreateEdgeInput as j, type CreateNodeInput as k, type DegreeOptions as l, type DynamicEdgeAccessor as m, type DynamicEdgeCollection as n, type DynamicEdgeType as o, type DynamicFieldBuilder as p, type DynamicNodeAccessor as q, type DynamicNodeCollection as r, type DynamicNodeType as s, type DynamicSelectableEdge as t, type DynamicSelectableNode as u, type Edge as v, type EdgeAccessor as w, type EdgeCollection as x, type EdgeFindByEndpointsOptions as y, type EdgeGetOrCreateByEndpointsOptions as z };

package/dist/{store-De0Y33wP.d.ts → store-MloRPwb9.d.ts}

@@ -1,9 +1,9 @@
 import { z } from 'zod';
-import { p as SqlDialect, ai as SqlSchema, F as FulltextStrategy, V as VectorStrategy, aA as VectorSlotMap, aB as ValueType, aC as PredicateExpression, aD as VectorMetricType, a1 as FulltextQueryMode, Q as QueryAst, J as JsonPointer, P as FieldRef, ad as ParameterRef, G as GraphBackend, am as TransactionBackend, a6 as JsonPointerInput, an as TraversalExpansion, aE as Traversal, aF as NodePredicate, aG as ProjectedField, ac as OrderSpec, aH as GroupBySpec, a4 as HybridFusionOptions, aI as RecursiveCyclePolicy, aJ as TraversalDirection$1, aK as EdgeRow, aL as NodeRow, W as AdoptedTransaction, L as AggregateExpr, aM as SelectiveField, aN as ComposableQuery, aO as SetOperationType, aP as SetOperation, ah as SortDirection, m as JsonSchema, aQ as VectorMetric } from './types-CmAT-Z47.js';
-import { K as KindRegistry, G as GraphDef, u as EdgeKinds, x as NodeKinds, t as AllNodeTypes, c as SchemaManagerOptions, d as SchemaValidationResult } from './manager-BUugwCYz.js';
-import { A as AnyEdgeType, N as NodeType, T as TemporalMode, d as EdgeType, E as EdgeRegistration, i as EdgeId, m as NodeId, b as NodeRegistration, K as KindEntity, f as Cardinality, g as EndpointExistence, e as KindAnnotations, U as UniquenessScope, C as Collation, G as GraphExtension } from './extension-types-CwHV-Uk4.js';
+import { aA as ValueType, aB as PredicateExpression, aC as VectorMetricType, a1 as FulltextQueryMode, Q as QueryAst, J as JsonPointer, P as FieldRef, ad as ParameterRef, G as GraphBackend, am as TransactionBackend, a6 as JsonPointerInput, an as TraversalExpansion, p as SqlDialect, ai as SqlSchema, aD as Traversal, aE as NodePredicate, aF as ProjectedField, ac as OrderSpec, aG as GroupBySpec, a4 as HybridFusionOptions, aH as RecursiveCyclePolicy, aI as TraversalDirection$1, aJ as EdgeRow, aK as NodeRow, W as AdoptedTransaction, L as AggregateExpr, F as FulltextStrategy, V as VectorStrategy, aL as VectorSlotMap, aM as SelectiveField, aN as ComposableQuery, aO as SetOperationType, aP as SetOperation, ah as SortDirection, m as JsonSchema, aQ as VectorMetric } from './types-BKQljXom.js';
+import { K as KindRegistry, G as GraphDef, w as EdgeKinds, t as NodeKinds, v as AllNodeTypes, c as SchemaManagerOptions, d as SchemaValidationResult } from './manager-By-WEd8M.js';
+import { A as AnyEdgeType, N as NodeType, T as TemporalMode, g as EdgeType, E as EdgeRegistration, e as EdgeId, d as NodeId, b as NodeRegistration, K as KindEntity, m as Cardinality, n as EndpointExistence, f as KindAnnotations, U as UniquenessScope, C as Collation, G as GraphExtension } from './extension-types-D1k0inWU.js';
 import { SQL } from 'drizzle-orm';
-import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-lkawaDor.js';
+import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-CAGhqPHQ.js';
 
 /**
  * Embedding type for vector search.
@@ -216,45 +216,6 @@ declare function searchable(options?: SearchableOptions): SearchableSchema;
 declare function isSearchableSchema(value: unknown): value is SearchableSchema;
 declare function getSearchableMetadata(schema: z.ZodType): SearchableMetadata | undefined;
 
-/**
- * Query Compiler Module
- *
- * Main entry point for compiling query ASTs to SQL.
- * Re-exports individual compiler modules and provides the main compile functions.
- */
-
-/**
- * Options for query compilation.
- */
-type CompileQueryOptions = Readonly<{
-    /** SQL dialect ("sqlite" or "postgres"). Defaults to "sqlite". */
-    dialect?: SqlDialect | undefined;
-    /** SQL schema configuration for table names. Defaults to standard names. */
-    schema?: SqlSchema | undefined;
-    /**
-     * Fulltext strategy override. When set, overrides the dialect's
-     * default fulltext strategy for `$fulltext.matches()` compilation.
-     * Callers typically read this from `backend.fulltextStrategy` so a
-     * backend-declared strategy (e.g. ParadeDB) wins over the dialect
-     * default (tsvector).
-     */
-    fulltextStrategy?: FulltextStrategy | undefined;
-    /**
-     * Vector strategy override. When set, `field.similarTo(...)`
-     * predicates compile against the strategy's per-`(kind, field)`
-     * tables and distance expression. Callers read it from
-     * `backend.vectorStrategy` so a backend-declared strategy (pgvector,
-     * libsql-native, sqlite-vec) drives the per-field relevance scan.
-     */
-    vectorStrategy?: VectorStrategy | undefined;
-    /**
-     * Declared embedding slots `(kind, fieldPath) -> descriptor` used by
-     * the `field.similarTo(...)` CTE to know which kinds in an alias
-     * declare the field. Callers build it from the graph's node schemas.
-     */
-    vectorSlots?: VectorSlotMap | undefined;
-}>;
-
 type FieldTypeInfo = Readonly<{
     valueType: ValueType;
     elementType?: ValueType | undefined;
@@ -1187,6 +1148,19 @@ type NodeGetOrCreateByConstraintOptions = Readonly<{
     /** Existing record behavior. Default: "return" */
     ifExists?: IfExistsMode;
 }>;
+/**
+ * Options for node bulkFindByIndex operations.
+ */
+type NodeBulkFindByIndexOptions = Readonly<{
+    /**
+     * Maximum number of candidate nodes returned per input item. When omitted,
+     * each input's candidate set is unbounded. Must be a positive integer.
+     *
+     * Candidates are ordered deterministically by node id, so the cap is stable
+     * across calls. Use this to bound fan-out on low-selectivity index keys.
+     */
+    limitPerInput?: number;
+}>;
 /**
  * Result of an edge getOrCreateByEndpoints operation.
  */
@@ -1363,6 +1337,28 @@ type NodeCollection<N extends NodeType, CN extends string = string> = Readonly<{
     bulkFindByConstraint: (constraintName: CN, items: readonly Readonly<{
         props: z.input<N["schema"]>;
     }>[]) => Promise<(Node<N> | undefined)[]>;
+    /**
+     * Batched candidate retrieval against a declared node index.
+     *
+     * For each input item, TypeGraph computes the index lookup key from
+     * `index.fields` (JSON-pointer extraction, partial-`where` applied to
+     * stored rows, null-safe matching) and returns the live, non-soft-deleted
+     * nodes that share that key. Unlike {@link bulkFindByConstraint}, the index
+     * may be non-unique, so each input yields a (possibly empty) array.
+     *
+     * Results preserve input order; each inner array is ordered by node id.
+     * Empty input returns `[]`. An unknown index name throws
+     * `NodeIndexNotFoundError`; a type-incompatible indexed field throws
+     * `ValidationError`. This is candidate retrieval, not a uniqueness or
+     * identity guarantee.
+     *
+     * @param indexName - Name of the declared node index to match on
+     * @param items - Records whose `props` supply the indexed-field values
+     * @param options - Optional `limitPerInput` to bound per-input fan-out
+     */
+    bulkFindByIndex: (indexName: string, items: readonly Readonly<{
+        props: Partial<z.input<N["schema"]>>;
+    }>[], options?: NodeBulkFindByIndexOptions) => Promise<readonly Node<N>[][]>;
     /**
      * Get an existing node by uniqueness constraint, or create a new one.
      *
@@ -2010,6 +2006,50 @@ declare class ExecutableAggregateQuery<G extends GraphDef, Aliases extends Alias
     execute(): Promise<readonly AggregateResult<R>[]>;
 }
 
+/**
+ * Query Compiler Module
+ *
+ * Main entry point for compiling query ASTs to SQL.
+ * Re-exports individual compiler modules and provides the main compile functions.
+ */
+
+/**
+ * Options for query compilation.
+ */
+type CompileQueryOptions = Readonly<{
+    /** SQL dialect ("sqlite" or "postgres"). Defaults to "sqlite". */
+    dialect?: SqlDialect | undefined;
+    /** SQL schema configuration for table names. Defaults to standard names. */
+    schema?: SqlSchema | undefined;
+    /**
+     * Fulltext strategy override. When set, overrides the dialect's
+     * default fulltext strategy for `$fulltext.matches()` compilation.
+     * Callers typically read this from `backend.fulltextStrategy` so a
+     * backend-declared strategy (e.g. ParadeDB) wins over the dialect
+     * default (tsvector).
+     */
+    fulltextStrategy?: FulltextStrategy | undefined;
+    /**
+     * Vector strategy override. When set, `field.similarTo(...)`
+     * predicates compile against the strategy's per-`(kind, field)`
+     * tables and distance expression. Callers read it from
+     * `backend.vectorStrategy` so a backend-declared strategy (pgvector,
+     * libsql-native, sqlite-vec) drives the per-field relevance scan.
+     */
+    vectorStrategy?: VectorStrategy | undefined;
+    /**
+     * Whether the active backend supports SQL window functions such as
+     * `ROW_NUMBER()`. Defaults to true for direct compiler callers.
+     */
+    windowFunctions?: boolean | undefined;
+    /**
+     * Declared embedding slots `(kind, fieldPath) -> descriptor` used by
+     * the `field.similarTo(...)` CTE to know which kinds in an alias
+     * declare the field. Callers build it from the graph's node schemas.
+     */
+    vectorSlots?: VectorSlotMap | undefined;
+}>;
+
 type PreparedQueryConfig<R> = Readonly<{
     ast: QueryAst;
     unoptimizedAst: QueryAst;
@@ -3912,4 +3952,4 @@ declare function createStoreWithSchema<G extends GraphDef>(graph: G, backend: Gr
  */
 declare function createVerifiedStore<G extends GraphDef>(graph: G, backend: GraphBackend, options?: StoreOptions): Promise<[Store<G>, SchemaValidationResult]>;
 
-export { type KindIntrospection as $, type AliasMap as A, type BaseTraversalOptions as B, type CreateQueryBuilderOptions as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EmbeddingMetric as E, type EdgeGetOrCreateByEndpointsResult as F, type EdgeIntrospection as G, type EmbeddingSchema as H, type EmbeddingValue as I, ExecutableAggregateQuery as J, ExecutableQuery as K, type FieldAccessor as L, type FulltextSearchHit as M, type FulltextSearchOptions as N, type GetOrCreateAction as O, type GraphAlgorithms as P, QueryBuilder as Q, type GraphEdgeCollections as R, Store as S, TraversalBuilder as T, type GraphNodeCollections as U, type HookContext as V, type HybridFulltextOptions as W, type HybridSearchHit as X, type HybridSearchOptions as Y, type HybridVectorOptions as Z, type IfExistsMode as _, type EmbeddingIndexType as a, createStoreWithSchema as a$, type MaterializeRemovalsEntry as a0, type MaterializeRemovalsOptions as a1, type MaterializeRemovalsResult as a2, type NeighborsOptions as a3, type Node as a4, type NodeAccessor as a5, type NodeAlias as a6, type NodeCollection as a7, type NodeGetOrCreateByConstraintOptions as a8, type NodeGetOrCreateByConstraintResult as a9, type SelectableEdge as aA, type SelectableNode as aB, type ShortestPathOptions as aC, type ShortestPathResult as aD, type StoreHooks as aE, type StoreOptions as aF, type StoreProjection as aG, type StoreRef as aH, StoreSearch as aI, type StreamOptions as aJ, type SubgraphEdgeResult as aK, type SubgraphNodeResult as aL, type SubgraphOptions as aM, type SubgraphResult as aN, type SubsetEdge as aO, type SubsetNode as aP, type TemporalAlgorithmOptions as aQ, type TransactionContext as aR, type TraversalDirection as aS, type TypedEdgeCollection as aT, UnionableQuery as aU, type UniqueIntrospection as aV, type UpdateEdgeInput as aW, type UpdateNodeInput as aX, type VectorSearchHit as aY, type VectorSearchOptions as aZ, createStore as a_, type NodeIdentifier as aa, type NodeRef as ab, type OntologyIntrospection as ac, type OperationHookContext as ad, type PaginateOptions as ae, type PaginatedResult as af, type PathNode as ag, type Predicate as ah, PreparedQuery as ai, type PropsAccessor as aj, type QueryHookContext as ak, type QueryOptions as al, type ReachableNode as am, type ReachableOptions as an, type RebuildFulltextOptions as ao, type RebuildFulltextResult as ap, type ReclaimedVectorFieldEntry as aq, type RecursiveTraversalOptions as ar, type ReembedFunction as as, type ReembedVectorFieldOptions as at, type ReembedVectorFieldResult as au, type SchemaIntrospection as av, type SearchableMetadata as aw, type SearchableOptions as ax, type SearchableSchema as ay, type SelectContext as az, type EdgeAliasMap as b, createVerifiedStore as b0, defineSubgraphProject as b1, embedding as b2, exists as b3, fieldRef as b4, getEmbeddingDimensions as b5, getSearchableMetadata as b6, inSubquery as b7, isEmbeddingSchema as b8, isParameterRef as b9, isSearchableSchema as ba, notExists as bb, notInSubquery as bc, param as bd, searchable as be, type AggregateResult as c, type AlgorithmCyclePolicy as d, type AnyEdge as e, type AnyNode as f, type BatchResults as g, type BatchableQuery as h, type ConstraintNames as i, type CreateEdgeInput as j, type CreateNodeInput as k, type DegreeOptions as l, type DynamicEdgeAccessor as m, type DynamicEdgeCollection as n, type DynamicEdgeType as o, type DynamicFieldBuilder as p, type DynamicNodeAccessor as q, type DynamicNodeCollection as r, type DynamicNodeType as s, type DynamicSelectableEdge as t, type DynamicSelectableNode as u, type Edge as v, type EdgeAccessor as w, type EdgeCollection as x, type EdgeFindByEndpointsOptions as y, type EdgeGetOrCreateByEndpointsOptions as z };
+export { type HybridVectorOptions as $, type AliasMap as A, type BaseTraversalOptions as B, type CreateQueryBuilderOptions as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EmbeddingMetric as E, type EdgeGetOrCreateByEndpointsResult as F, type EdgeIntrospection as G, type EmbeddingSchema as H, type EmbeddingValue as I, ExecutableAggregateQuery as J, ExecutableQuery as K, type FieldAccessor as L, type FulltextSearchHit as M, type Node as N, type FulltextSearchOptions as O, type GetOrCreateAction as P, QueryBuilder as Q, type GraphAlgorithms as R, Store as S, TraversalBuilder as T, type UniqueIntrospection as U, type GraphEdgeCollections as V, type GraphNodeCollections as W, type HookContext as X, type HybridFulltextOptions as Y, type HybridSearchHit as Z, type HybridSearchOptions as _, type EmbeddingIndexType as a, createStore as a$, type IfExistsMode as a0, type KindIntrospection as a1, type MaterializeRemovalsEntry as a2, type MaterializeRemovalsOptions as a3, type MaterializeRemovalsResult as a4, type NeighborsOptions as a5, type NodeAccessor as a6, type NodeAlias as a7, type NodeBulkFindByIndexOptions as a8, type NodeCollection as a9, type SearchableSchema as aA, type SelectContext as aB, type SelectableEdge as aC, type SelectableNode as aD, type ShortestPathOptions as aE, type ShortestPathResult as aF, type StoreHooks as aG, type StoreOptions as aH, type StoreProjection as aI, type StoreRef as aJ, StoreSearch as aK, type StreamOptions as aL, type SubgraphEdgeResult as aM, type SubgraphNodeResult as aN, type SubgraphOptions as aO, type SubgraphResult as aP, type SubsetEdge as aQ, type SubsetNode as aR, type TemporalAlgorithmOptions as aS, type TransactionContext as aT, type TraversalDirection as aU, type TypedEdgeCollection as aV, UnionableQuery as aW, type UpdateEdgeInput as aX, type UpdateNodeInput as aY, type VectorSearchHit as aZ, type VectorSearchOptions as a_, type NodeGetOrCreateByConstraintOptions as aa, type NodeGetOrCreateByConstraintResult as ab, type NodeIdentifier as ac, type NodeRef as ad, type OntologyIntrospection as ae, type OperationHookContext as af, type PaginateOptions as ag, type PaginatedResult as ah, type PathNode as ai, type Predicate as aj, PreparedQuery as ak, type PropsAccessor as al, type QueryHookContext as am, type QueryOptions as an, type ReachableNode as ao, type ReachableOptions as ap, type RebuildFulltextOptions as aq, type RebuildFulltextResult as ar, type ReclaimedVectorFieldEntry as as, type RecursiveTraversalOptions as at, type ReembedFunction as au, type ReembedVectorFieldOptions as av, type ReembedVectorFieldResult as aw, type SchemaIntrospection as ax, type SearchableMetadata as ay, type SearchableOptions as az, type EdgeAliasMap as b, createStoreWithSchema as b0, createVerifiedStore as b1, defineSubgraphProject as b2, embedding as b3, exists as b4, fieldRef as b5, getEmbeddingDimensions as b6, getSearchableMetadata as b7, inSubquery as b8, isEmbeddingSchema as b9, isParameterRef as ba, isSearchableSchema as bb, notExists as bc, notInSubquery as bd, param as be, searchable as bf, type AggregateResult as c, type AlgorithmCyclePolicy as d, type AnyEdge as e, type AnyNode as f, type BatchResults as g, type BatchableQuery as h, type ConstraintNames as i, type CreateEdgeInput as j, type CreateNodeInput as k, type DegreeOptions as l, type DynamicEdgeAccessor as m, type DynamicEdgeCollection as n, type DynamicEdgeType as o, type DynamicFieldBuilder as p, type DynamicNodeAccessor as q, type DynamicNodeCollection as r, type DynamicNodeType as s, type DynamicSelectableEdge as t, type DynamicSelectableNode as u, type Edge as v, type EdgeAccessor as w, type EdgeCollection as x, type EdgeFindByEndpointsOptions as y, type EdgeGetOrCreateByEndpointsOptions as z };

package/dist/{types-DXCSyxac.d.cts → types-BKQljXom.d.ts}

@@ -1,5 +1,5 @@
 import { z } from 'zod';
-import { N as NodeType, d as EdgeType, U as UniquenessScope, C as Collation, D as DeleteBehavior, e as KindAnnotations, f as Cardinality, g as EndpointExistence, T as TemporalMode, G as GraphExtension, I as IndexEntity, K as KindEntity, a as NullCheckOp, A as AnyEdgeType } from './extension-types-CwHV-Uk4.cjs';
+import { N as NodeType, g as EdgeType, U as UniquenessScope, C as Collation, D as DeleteBehavior, f as KindAnnotations, m as Cardinality, n as EndpointExistence, T as TemporalMode, G as GraphExtension, I as IndexEntity, K as KindEntity, a as NullCheckOp, A as AnyEdgeType } from './extension-types-D1k0inWU.js';
 import { SQL } from 'drizzle-orm';
 import { PgDatabase, PgQueryResultHKT } from 'drizzle-orm/pg-core';
 import { BaseSQLiteDatabase } from 'drizzle-orm/sqlite-core';
@@ -799,6 +799,8 @@ type FulltextCapabilities = Readonly<{
 type BackendCapabilities = Readonly<{
     /** Whether the backend supports atomic transactions (D1 does not) */
     transactions: boolean;
+    /** Whether the backend supports SQL window functions such as ROW_NUMBER() */
+    windowFunctions: boolean;
     /** Vector search capabilities (undefined if not configured) */
     vector?: VectorCapabilities | undefined;
     /** Fulltext search capabilities (undefined if not configured) */
@@ -1876,6 +1878,20 @@ type FindEdgesByKindParams = Readonly<{
     temporalMode?: TemporalMode;
     /** Timestamp for "current" and "asOf" temporal modes. */
     asOf?: string;
+    /**
+     * Stable ordering for keyset pagination. Default: "created_at" (existing
+     * behavior). Use "id" for iteration that is stable under shared `created_at`
+     * timestamps — the offset path orders by the NON-unique `created_at`, so a
+     * full enumeration must page by the unique `id` to avoid skipping a row at a
+     * page boundary. Mirrors {@link FindNodesByKindParams.orderBy}.
+     */
+    orderBy?: "id" | "created_at";
+    /**
+     * Keyset cursor. Returns rows strictly greater (by `orderBy`) than this value.
+     * When `orderBy: "id"`, compared lexicographically. Mutually exclusive with
+     * `offset` — callers pick one. Mirrors {@link FindNodesByKindParams.after}.
+     */
+    after?: string;
 }>;
 /**
  * Parameters for counting edges by kind.
@@ -2602,4 +2618,4 @@ type RelationalIndexDeclaration = NodeIndexDeclaration | EdgeIndexDeclaration;
 type IndexDeclaration = RelationalIndexDeclaration | VectorIndexDeclaration;
 type SystemColumnName = "graph_id" | "kind" | "id" | "from_kind" | "from_id" | "to_kind" | "to_id" | "deleted_at" | "valid_from" | "valid_to" | "created_at" | "updated_at" | "version";
 
-export { type FulltextBatchRow as $, type AnySqliteDatabase as A, type BackendCapabilities as B, type VectorIndexMetric as C, type VectorIndexParams as D, type EdgeIndexConfig as E, type FulltextStrategy as F, type GraphBackend as G, type SchemaVersionRow as H, type IndexDeclaration as I, type JsonPointer as J, type InferenceType as K, type AggregateExpr as L, type MetaEdge as M, type NodeIndexConfig as N, type OntologyRelation as O, type FieldRef as P, type QueryAst as Q, type RelationalIndexDeclaration as R, type SqliteExecutionProfileHints as S, type ComparisonOp as T, type AggregateComparisonPredicate as U, type VectorStrategy as V, type AdoptedTransaction as W, type CommitSchemaVersionExpected as X, type CommitSchemaVersionParams as Y, DEFAULT_SQL_SCHEMA as Z, type DeleteFulltextBatchParams as _, type SqliteTransactionMode as a, type FulltextCapabilities as a0, type FulltextQueryMode as a1, type FulltextSearchParams as a2, type FulltextSearchResult as a3, type HybridFusionOptions as a4, type JsonPointerFor as a5, type JsonPointerInput as a6, type JsonPointerSegment as a7, type JsonPointerSegments as a8, type JsonPointerSegmentsFor as a9, type VectorSlotMap as aA, type ValueType as aB, type PredicateExpression as aC, type VectorMetricType as aD, type Traversal as aE, type NodePredicate as aF, type ProjectedField as aG, type GroupBySpec as aH, type RecursiveCyclePolicy as aI, type TraversalDirection as aJ, type EdgeRow as aK, type NodeRow as aL, type SelectiveField as aM, type ComposableQuery as aN, type SetOperationType as aO, type SetOperation as aP, type VectorMetric as aQ, MAX_JSON_POINTER_DEPTH as aa, type MetaEdgeProperties as ab, type OrderSpec as ac, type ParameterRef as ad, type ResolveJsonPointer as ae, type ResolveJsonPointerSegments as af, type SetActiveVersionParams as ag, type SortDirection as ah, type SqlSchema as ai, type SqlTableNames as aj, type StrategyTableContribution as ak, type TableContribution as al, type TransactionBackend as am, type TraversalExpansion as an, type UpsertFulltextBatchParams as ao, type VectorCapabilities as ap, type VectorSlot as aq, buildVectorCapabilities as ar, createSqlSchema as as, fts5Strategy as at, isMetaEdge as au, joinJsonPointers as av, jsonPointer as aw, normalizeJsonPointer as ax, parseJsonPointer as ay, tsvectorStrategy as az, type AnyPgDatabase as b, type EdgeIndexDeclaration as c, type NodeIndexDeclaration as d, type IndexWhereExpression as e, type SerializedNodeDef as f, type SerializedEdgeDef as g, type SerializedMetaEdge as h, type SerializedOntologyRelation as i, type SerializedClosures as j, type SerializedSchema as k, type SchemaHash as l, type JsonSchema as m, type SerializedOntology as n, type SerializedUniqueConstraint as o, type SqlDialect as p, type EdgeIndexDirection as q, type EdgeIndexWhereBuilder as r, type IndexOrigin as s, type IndexScope as t, type IndexWhereFieldBuilder as u, type IndexWhereInput as v, type NodeIndexWhereBuilder as w, type SystemColumnName as x, type VectorIndexDeclaration as y, type VectorIndexImplementation as z };
+export { type FulltextBatchRow as $, type AnySqliteDatabase as A, type BackendCapabilities as B, type VectorIndexMetric as C, type VectorIndexParams as D, type EdgeIndexConfig as E, type FulltextStrategy as F, type GraphBackend as G, type SchemaVersionRow as H, type IndexDeclaration as I, type JsonPointer as J, type InferenceType as K, type AggregateExpr as L, type MetaEdge as M, type NodeIndexConfig as N, type OntologyRelation as O, type FieldRef as P, type QueryAst as Q, type RelationalIndexDeclaration as R, type SqliteExecutionProfileHints as S, type ComparisonOp as T, type AggregateComparisonPredicate as U, type VectorStrategy as V, type AdoptedTransaction as W, type CommitSchemaVersionExpected as X, type CommitSchemaVersionParams as Y, DEFAULT_SQL_SCHEMA as Z, type DeleteFulltextBatchParams as _, type SqliteTransactionMode as a, type FulltextCapabilities as a0, type FulltextQueryMode as a1, type FulltextSearchParams as a2, type FulltextSearchResult as a3, type HybridFusionOptions as a4, type JsonPointerFor as a5, type JsonPointerInput as a6, type JsonPointerSegment as a7, type JsonPointerSegments as a8, type JsonPointerSegmentsFor as a9, type ValueType as aA, type PredicateExpression as aB, type VectorMetricType as aC, type Traversal as aD, type NodePredicate as aE, type ProjectedField as aF, type GroupBySpec as aG, type RecursiveCyclePolicy as aH, type TraversalDirection as aI, type EdgeRow as aJ, type NodeRow as aK, type VectorSlotMap as aL, type SelectiveField as aM, type ComposableQuery as aN, type SetOperationType as aO, type SetOperation as aP, type VectorMetric as aQ, MAX_JSON_POINTER_DEPTH as aa, type MetaEdgeProperties as ab, type OrderSpec as ac, type ParameterRef as ad, type ResolveJsonPointer as ae, type ResolveJsonPointerSegments as af, type SetActiveVersionParams as ag, type SortDirection as ah, type SqlSchema as ai, type SqlTableNames as aj, type StrategyTableContribution as ak, type TableContribution as al, type TransactionBackend as am, type TraversalExpansion as an, type UpsertFulltextBatchParams as ao, type VectorCapabilities as ap, type VectorSlot as aq, buildVectorCapabilities as ar, createSqlSchema as as, fts5Strategy as at, isMetaEdge as au, joinJsonPointers as av, jsonPointer as aw, normalizeJsonPointer as ax, parseJsonPointer as ay, tsvectorStrategy as az, type AnyPgDatabase as b, type EdgeIndexDeclaration as c, type NodeIndexDeclaration as d, type IndexWhereExpression as e, type SerializedNodeDef as f, type SerializedEdgeDef as g, type SerializedMetaEdge as h, type SerializedOntologyRelation as i, type SerializedClosures as j, type SerializedSchema as k, type SchemaHash as l, type JsonSchema as m, type SerializedOntology as n, type SerializedUniqueConstraint as o, type SqlDialect as p, type EdgeIndexDirection as q, type EdgeIndexWhereBuilder as r, type IndexOrigin as s, type IndexScope as t, type IndexWhereFieldBuilder as u, type IndexWhereInput as v, type NodeIndexWhereBuilder as w, type SystemColumnName as x, type VectorIndexDeclaration as y, type VectorIndexImplementation as z };

package/dist/{types-CmAT-Z47.d.ts → types-C1CYxWrL.d.cts}

@@ -1,5 +1,5 @@
 import { z } from 'zod';
-import { N as NodeType, d as EdgeType, U as UniquenessScope, C as Collation, D as DeleteBehavior, e as KindAnnotations, f as Cardinality, g as EndpointExistence, T as TemporalMode, G as GraphExtension, I as IndexEntity, K as KindEntity, a as NullCheckOp, A as AnyEdgeType } from './extension-types-CwHV-Uk4.js';
+import { N as NodeType, g as EdgeType, U as UniquenessScope, C as Collation, D as DeleteBehavior, f as KindAnnotations, m as Cardinality, n as EndpointExistence, T as TemporalMode, G as GraphExtension, I as IndexEntity, K as KindEntity, a as NullCheckOp, A as AnyEdgeType } from './extension-types-D1k0inWU.cjs';
 import { SQL } from 'drizzle-orm';
 import { PgDatabase, PgQueryResultHKT } from 'drizzle-orm/pg-core';
 import { BaseSQLiteDatabase } from 'drizzle-orm/sqlite-core';
@@ -799,6 +799,8 @@ type FulltextCapabilities = Readonly<{
 type BackendCapabilities = Readonly<{
     /** Whether the backend supports atomic transactions (D1 does not) */
     transactions: boolean;
+    /** Whether the backend supports SQL window functions such as ROW_NUMBER() */
+    windowFunctions: boolean;
     /** Vector search capabilities (undefined if not configured) */
     vector?: VectorCapabilities | undefined;
     /** Fulltext search capabilities (undefined if not configured) */
@@ -1876,6 +1878,20 @@ type FindEdgesByKindParams = Readonly<{
     temporalMode?: TemporalMode;
     /** Timestamp for "current" and "asOf" temporal modes. */
     asOf?: string;
+    /**
+     * Stable ordering for keyset pagination. Default: "created_at" (existing
+     * behavior). Use "id" for iteration that is stable under shared `created_at`
+     * timestamps — the offset path orders by the NON-unique `created_at`, so a
+     * full enumeration must page by the unique `id` to avoid skipping a row at a
+     * page boundary. Mirrors {@link FindNodesByKindParams.orderBy}.
+     */
+    orderBy?: "id" | "created_at";
+    /**
+     * Keyset cursor. Returns rows strictly greater (by `orderBy`) than this value.
+     * When `orderBy: "id"`, compared lexicographically. Mutually exclusive with
+     * `offset` — callers pick one. Mirrors {@link FindNodesByKindParams.after}.
+     */
+    after?: string;
 }>;
 /**
  * Parameters for counting edges by kind.
@@ -2602,4 +2618,4 @@ type RelationalIndexDeclaration = NodeIndexDeclaration | EdgeIndexDeclaration;
 type IndexDeclaration = RelationalIndexDeclaration | VectorIndexDeclaration;
 type SystemColumnName = "graph_id" | "kind" | "id" | "from_kind" | "from_id" | "to_kind" | "to_id" | "deleted_at" | "valid_from" | "valid_to" | "created_at" | "updated_at" | "version";
 
-export { type FulltextBatchRow as $, type AnySqliteDatabase as A, type BackendCapabilities as B, type VectorIndexMetric as C, type VectorIndexParams as D, type EdgeIndexConfig as E, type FulltextStrategy as F, type GraphBackend as G, type SchemaVersionRow as H, type IndexDeclaration as I, type JsonPointer as J, type InferenceType as K, type AggregateExpr as L, type MetaEdge as M, type NodeIndexConfig as N, type OntologyRelation as O, type FieldRef as P, type QueryAst as Q, type RelationalIndexDeclaration as R, type SqliteExecutionProfileHints as S, type ComparisonOp as T, type AggregateComparisonPredicate as U, type VectorStrategy as V, type AdoptedTransaction as W, type CommitSchemaVersionExpected as X, type CommitSchemaVersionParams as Y, DEFAULT_SQL_SCHEMA as Z, type DeleteFulltextBatchParams as _, type SqliteTransactionMode as a, type FulltextCapabilities as a0, type FulltextQueryMode as a1, type FulltextSearchParams as a2, type FulltextSearchResult as a3, type HybridFusionOptions as a4, type JsonPointerFor as a5, type JsonPointerInput as a6, type JsonPointerSegment as a7, type JsonPointerSegments as a8, type JsonPointerSegmentsFor as a9, type VectorSlotMap as aA, type ValueType as aB, type PredicateExpression as aC, type VectorMetricType as aD, type Traversal as aE, type NodePredicate as aF, type ProjectedField as aG, type GroupBySpec as aH, type RecursiveCyclePolicy as aI, type TraversalDirection as aJ, type EdgeRow as aK, type NodeRow as aL, type SelectiveField as aM, type ComposableQuery as aN, type SetOperationType as aO, type SetOperation as aP, type VectorMetric as aQ, MAX_JSON_POINTER_DEPTH as aa, type MetaEdgeProperties as ab, type OrderSpec as ac, type ParameterRef as ad, type ResolveJsonPointer as ae, type ResolveJsonPointerSegments as af, type SetActiveVersionParams as ag, type SortDirection as ah, type SqlSchema as ai, type SqlTableNames as aj, type StrategyTableContribution as ak, type TableContribution as al, type TransactionBackend as am, type TraversalExpansion as an, type UpsertFulltextBatchParams as ao, type VectorCapabilities as ap, type VectorSlot as aq, buildVectorCapabilities as ar, createSqlSchema as as, fts5Strategy as at, isMetaEdge as au, joinJsonPointers as av, jsonPointer as aw, normalizeJsonPointer as ax, parseJsonPointer as ay, tsvectorStrategy as az, type AnyPgDatabase as b, type EdgeIndexDeclaration as c, type NodeIndexDeclaration as d, type IndexWhereExpression as e, type SerializedNodeDef as f, type SerializedEdgeDef as g, type SerializedMetaEdge as h, type SerializedOntologyRelation as i, type SerializedClosures as j, type SerializedSchema as k, type SchemaHash as l, type JsonSchema as m, type SerializedOntology as n, type SerializedUniqueConstraint as o, type SqlDialect as p, type EdgeIndexDirection as q, type EdgeIndexWhereBuilder as r, type IndexOrigin as s, type IndexScope as t, type IndexWhereFieldBuilder as u, type IndexWhereInput as v, type NodeIndexWhereBuilder as w, type SystemColumnName as x, type VectorIndexDeclaration as y, type VectorIndexImplementation as z };
+export { type FulltextBatchRow as $, type AnySqliteDatabase as A, type BackendCapabilities as B, type VectorIndexMetric as C, type VectorIndexParams as D, type EdgeIndexConfig as E, type FulltextStrategy as F, type GraphBackend as G, type SchemaVersionRow as H, type IndexDeclaration as I, type JsonPointer as J, type InferenceType as K, type AggregateExpr as L, type MetaEdge as M, type NodeIndexConfig as N, type OntologyRelation as O, type FieldRef as P, type QueryAst as Q, type RelationalIndexDeclaration as R, type SqliteExecutionProfileHints as S, type ComparisonOp as T, type AggregateComparisonPredicate as U, type VectorStrategy as V, type AdoptedTransaction as W, type CommitSchemaVersionExpected as X, type CommitSchemaVersionParams as Y, DEFAULT_SQL_SCHEMA as Z, type DeleteFulltextBatchParams as _, type SqliteTransactionMode as a, type FulltextCapabilities as a0, type FulltextQueryMode as a1, type FulltextSearchParams as a2, type FulltextSearchResult as a3, type HybridFusionOptions as a4, type JsonPointerFor as a5, type JsonPointerInput as a6, type JsonPointerSegment as a7, type JsonPointerSegments as a8, type JsonPointerSegmentsFor as a9, type ValueType as aA, type PredicateExpression as aB, type VectorMetricType as aC, type Traversal as aD, type NodePredicate as aE, type ProjectedField as aF, type GroupBySpec as aG, type RecursiveCyclePolicy as aH, type TraversalDirection as aI, type EdgeRow as aJ, type NodeRow as aK, type VectorSlotMap as aL, type SelectiveField as aM, type ComposableQuery as aN, type SetOperationType as aO, type SetOperation as aP, type VectorMetric as aQ, MAX_JSON_POINTER_DEPTH as aa, type MetaEdgeProperties as ab, type OrderSpec as ac, type ParameterRef as ad, type ResolveJsonPointer as ae, type ResolveJsonPointerSegments as af, type SetActiveVersionParams as ag, type SortDirection as ah, type SqlSchema as ai, type SqlTableNames as aj, type StrategyTableContribution as ak, type TableContribution as al, type TransactionBackend as am, type TraversalExpansion as an, type UpsertFulltextBatchParams as ao, type VectorCapabilities as ap, type VectorSlot as aq, buildVectorCapabilities as ar, createSqlSchema as as, fts5Strategy as at, isMetaEdge as au, joinJsonPointers as av, jsonPointer as aw, normalizeJsonPointer as ax, parseJsonPointer as ay, tsvectorStrategy as az, type AnyPgDatabase as b, type EdgeIndexDeclaration as c, type NodeIndexDeclaration as d, type IndexWhereExpression as e, type SerializedNodeDef as f, type SerializedEdgeDef as g, type SerializedMetaEdge as h, type SerializedOntologyRelation as i, type SerializedClosures as j, type SerializedSchema as k, type SchemaHash as l, type JsonSchema as m, type SerializedOntology as n, type SerializedUniqueConstraint as o, type SqlDialect as p, type EdgeIndexDirection as q, type EdgeIndexWhereBuilder as r, type IndexOrigin as s, type IndexScope as t, type IndexWhereFieldBuilder as u, type IndexWhereInput as v, type NodeIndexWhereBuilder as w, type SystemColumnName as x, type VectorIndexDeclaration as y, type VectorIndexImplementation as z };

package/dist/{types-Bwlp_yvu.d.cts → types-DoByHGyU.d.cts}

@@ -1,5 +1,5 @@
-import { K as KindEntity } from './extension-types-CwHV-Uk4.cjs';
-import { J as JsonPointer } from './types-DXCSyxac.cjs';
+import { K as KindEntity } from './extension-types-D1k0inWU.cjs';
+import { J as JsonPointer } from './types-C1CYxWrL.cjs';
 
 /**
  * QueryProfiler types.

package/dist/{types-B5GSeE3t.d.ts → types-K3vpaJAL.d.ts}

@@ -1,5 +1,5 @@
-import { K as KindEntity } from './extension-types-CwHV-Uk4.js';
-import { J as JsonPointer } from './types-CmAT-Z47.js';
+import { K as KindEntity } from './extension-types-D1k0inWU.js';
+import { J as JsonPointer } from './types-BKQljXom.js';
 
 /**
  * QueryProfiler types.

package/dist/{where-CP4qGIHd.d.ts → where-Dt49bvo6.d.ts}

@@ -1,5 +1,5 @@
-import { A as AnyEdgeType, N as NodeType } from './extension-types-CwHV-Uk4.js';
-import { E as EdgeIndexConfig, c as EdgeIndexDeclaration, N as NodeIndexConfig, d as NodeIndexDeclaration, e as IndexWhereExpression } from './types-CmAT-Z47.js';
+import { A as AnyEdgeType, N as NodeType } from './extension-types-D1k0inWU.js';
+import { E as EdgeIndexConfig, c as EdgeIndexDeclaration, N as NodeIndexConfig, d as NodeIndexDeclaration, e as IndexWhereExpression } from './types-BKQljXom.js';
 
 declare function defineNodeIndex<N extends NodeType>(node: N, config: NodeIndexConfig<N>): NodeIndexDeclaration;
 declare function defineEdgeIndex<E extends AnyEdgeType>(edge: E, config: EdgeIndexConfig<E>): EdgeIndexDeclaration;