@nicia-ai/typegraph 0.28.1 → 0.30.0

package/dist/{store-Ufc1Eoey.d.ts → store--z1Tmk7U.d.cts}

@@ -1,9 +1,9 @@
 import { z } from 'zod';
-import { p as SqlDialect, ah as SqlSchema, F as FulltextStrategy, ax as ValueType, ay as PredicateExpression, az as VectorMetricType, a0 as FulltextQueryMode, Q as QueryAst, J as JsonPointer, L as FieldRef, ac as ParameterRef, G as GraphBackend, al as TransactionBackend, a5 as JsonPointerInput, am as TraversalExpansion, aA as Traversal, aB as NodePredicate, aC as ProjectedField, ab as OrderSpec, aD as GroupBySpec, a3 as HybridFusionOptions, aE as RecursiveCyclePolicy, aF as TraversalDirection$1, aG as EdgeRow, aH as NodeRow, U as AdoptedTransaction, K as AggregateExpr, aI as SelectiveField, aJ as ComposableQuery, aK as SetOperationType, aL as SetOperation, ag as SortDirection, m as JsonSchema, aM as VectorMetric } from './types-CQ7xXJMP.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-ehLTTNq0.js';
-import { A as AnyEdgeType, N as NodeType, T as TemporalMode, e as EdgeType, E as EdgeRegistration, h as EdgeId, m as NodeId, b as NodeRegistration, K as KindEntity, f as Cardinality, k as EndpointExistence, d as KindAnnotations, o as UniquenessScope, g as Collation, G as GraphExtension } from './extension-types-B78CZfA5.js';
+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-dL-clxO3.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-wTDgjoXG.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 { SQL } from 'drizzle-orm';
-import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-DFavFQah.js';
+import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-oanE3RU0.cjs';
 
 /**
  * Embedding type for vector search.
@@ -239,6 +239,25 @@ type CompileQueryOptions = Readonly<{
      * 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 FieldTypeInfo = Readonly<{
@@ -1173,6 +1192,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.
  */
@@ -1349,6 +1381,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.
      *
@@ -1920,8 +1974,29 @@ type MaterializeRemovalsEntry = Readonly<{
     status: "removed" | "failed";
     error?: Error;
 }>;
+/**
+ * Outcome of reclaiming one per-`(graphId, kind, field)` vector table that
+ * was orphaned when its embedding field was dropped from a *surviving*
+ * kind's schema. Distinct from {@link MaterializeRemovalsEntry} (whole
+ * kinds) because the unit is a single embedding field, not a kind.
+ */
+type ReclaimedVectorFieldEntry = Readonly<{
+    kind: string;
+    fieldPath: string;
+    status: "reclaimed" | "failed";
+    error?: Error;
+}>;
 type MaterializeRemovalsResult = Readonly<{
     results: readonly MaterializeRemovalsEntry[];
+    /**
+     * Embedding fields removed from a *surviving* kind whose per-field vector
+     * table this pass dropped (or confirmed already absent). Empty when the
+     * backend has no vector strategy or no embedding field has ever been
+     * dropped. Re-derived from immutable schema history each call, so it lists
+     * the same removed fields on repeat passes — the underlying drop is
+     * idempotent (`DROP ... IF EXISTS`). See {@link reclaimRemovedVectorFieldTables}.
+     */
+    reclaimedVectorFields: readonly ReclaimedVectorFieldEntry[];
 }>;
 
 /**
@@ -3147,6 +3222,32 @@ type StoreSchemaMetadata = Readonly<{
  *   .execute();
  * ```
  */
+/**
+ * Optional embedder for {@link Store.reembedVectorField}. Receives a batch of
+ * the kind's nodes and returns a map of `nodeId → new embedding vector` (omit
+ * an id to leave that node without an embedding). Called once per page; the
+ * page size is `batchSize`.
+ */
+type ReembedFunction = (nodes: readonly Node[]) => Promise<ReadonlyMap<string, readonly number[]>> | ReadonlyMap<string, readonly number[]>;
+/** Options for {@link Store.reembedVectorField}. */
+type ReembedVectorFieldOptions = Readonly<{
+    /**
+     * When supplied, drives a batched re-embed loop after recreating storage:
+     * pages the kind's nodes, calls `embed(batch)`, and upserts the returned
+     * vectors. When omitted, storage is recreated empty and the caller
+     * re-embeds via normal `update()` / `upsertEmbedding` writes.
+     */
+    embed?: ReembedFunction;
+    /** Re-embed page size. Default 200. */
+    batchSize?: number;
+}>;
+/** Result of {@link Store.reembedVectorField}. */
+type ReembedVectorFieldResult = Readonly<{
+    /** Whether the per-field storage was dropped and recreated. */
+    recreated: boolean;
+    /** Number of nodes whose embedding was re-written (0 without `embed`). */
+    reembedded: number;
+}>;
 declare class Store<G extends GraphDef> {
     #private;
     constructor(graph: G, backend: GraphBackend, options?: StoreOptions, schemaMetadata?: StoreSchemaMetadata);
@@ -3680,6 +3781,24 @@ declare class Store<G extends GraphDef> {
      *   has no schema yet.
      */
     materializeIndexes(options?: MaterializeIndexesOptions): Promise<MaterializeIndexesResult>;
+    /**
+     * Recreate a vector field's per-field storage at its current declared
+     * dimension, then optionally re-embed existing rows.
+     *
+     * Use this after changing a field's `embedding(N)` to `embedding(M)` (e.g. a
+     * new embedding model): the stored N-dim vectors are invalid under the new
+     * dimension and must be recomputed, not converted. This drops and recreates
+     * the per-`(graphId, kind, field)` table at the new dimension — a brief
+     * window where the field returns no vector hits — resets its materialization
+     * marker, then, when `options.embed` is supplied, pages the kind's nodes,
+     * calls `embed(batch)`, and upserts the returned vectors. Without `embed`,
+     * storage is recreated empty and the caller re-embeds via normal
+     * `update()` / `upsertEmbedding` writes.
+     *
+     * @throws {ConfigurationError} when the backend has no vector strategy or
+     *   cannot execute DDL, or `(kind, fieldPath)` is not a declared embedding.
+     */
+    reembedVectorField(kind: string, fieldPath: string, options?: ReembedVectorFieldOptions): Promise<ReembedVectorFieldResult>;
     /**
      * Removes extension kinds from the schema with cascading edge and
      * ontology cleanup. Two-phase by design:
@@ -3833,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 MaterializeRemovalsOptions as $, type AliasMap as A, type BaseTraversalOptions as B, type CreateQueryBuilderOptions as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EdgeAliasMap as E, type EmbeddingSchema as F, type EmbeddingValue as G, ExecutableAggregateQuery as H, ExecutableQuery as I, type FieldAccessor as J, type FulltextSearchHit as K, type FulltextSearchOptions as L, type GetOrCreateAction as M, type GraphAlgorithms as N, type GraphEdgeCollections as O, type GraphNodeCollections as P, QueryBuilder as Q, type HookContext as R, Store as S, TraversalBuilder as T, type HybridFulltextOptions as U, type HybridSearchHit as V, type HybridSearchOptions as W, type HybridVectorOptions as X, type IfExistsMode as Y, type KindIntrospection as Z, type MaterializeRemovalsEntry as _, type AggregateResult as a, getEmbeddingDimensions as a$, type MaterializeRemovalsResult as a0, type NeighborsOptions as a1, type Node as a2, type NodeAccessor as a3, type NodeAlias as a4, type NodeCollection as a5, type NodeGetOrCreateByConstraintOptions as a6, type NodeGetOrCreateByConstraintResult as a7, type NodeIdentifier as a8, type NodeRef as a9, type StoreProjection as aA, type StoreRef as aB, StoreSearch as aC, type StreamOptions as aD, type SubgraphEdgeResult as aE, type SubgraphNodeResult as aF, type SubgraphOptions as aG, type SubgraphResult as aH, type SubsetEdge as aI, type SubsetNode as aJ, type TemporalAlgorithmOptions as aK, type TransactionContext as aL, type TraversalDirection as aM, type TypedEdgeCollection as aN, UnionableQuery as aO, type UniqueIntrospection as aP, type UpdateEdgeInput as aQ, type UpdateNodeInput as aR, type VectorSearchHit as aS, type VectorSearchOptions as aT, createStore as aU, createStoreWithSchema as aV, createVerifiedStore as aW, defineSubgraphProject as aX, embedding as aY, exists as aZ, fieldRef as a_, type OntologyIntrospection as aa, type OperationHookContext as ab, type PaginateOptions as ac, type PaginatedResult as ad, type PathNode as ae, type Predicate as af, PreparedQuery as ag, type PropsAccessor as ah, type QueryHookContext as ai, type QueryOptions as aj, type ReachableNode as ak, type ReachableOptions as al, type RebuildFulltextOptions as am, type RebuildFulltextResult as an, type RecursiveTraversalOptions as ao, type SchemaIntrospection as ap, type SearchableMetadata as aq, type SearchableOptions as ar, type SearchableSchema as as, type SelectContext as at, type SelectableEdge as au, type SelectableNode as av, type ShortestPathOptions as aw, type ShortestPathResult as ax, type StoreHooks as ay, type StoreOptions as az, type AlgorithmCyclePolicy as b, getSearchableMetadata as b0, inSubquery as b1, isEmbeddingSchema as b2, isParameterRef as b3, isSearchableSchema as b4, notExists as b5, notInSubquery as b6, param as b7, searchable as b8, type AnyEdge as c, type AnyNode as d, type BatchResults as e, type BatchableQuery as f, type ConstraintNames as g, type CreateEdgeInput as h, type CreateNodeInput as i, type DegreeOptions as j, type DynamicEdgeAccessor as k, type DynamicEdgeCollection as l, type DynamicEdgeType as m, type DynamicFieldBuilder as n, type DynamicNodeAccessor as o, type DynamicNodeCollection as p, type DynamicNodeType as q, type DynamicSelectableEdge as r, type DynamicSelectableNode as s, type Edge as t, type EdgeAccessor as u, type EdgeCollection as v, type EdgeFindByEndpointsOptions as w, type EdgeGetOrCreateByEndpointsOptions as x, type EdgeGetOrCreateByEndpointsResult as y, type EdgeIntrospection as z };
+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, createStore 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 NodeBulkFindByIndexOptions as a7, type NodeCollection as a8, type NodeGetOrCreateByConstraintOptions as a9, type SelectContext as aA, type SelectableEdge as aB, type SelectableNode as aC, type ShortestPathOptions as aD, type ShortestPathResult as aE, type StoreHooks as aF, type StoreOptions as aG, type StoreProjection as aH, type StoreRef as aI, StoreSearch as aJ, type StreamOptions as aK, type SubgraphEdgeResult as aL, type SubgraphNodeResult as aM, type SubgraphOptions as aN, type SubgraphResult as aO, type SubsetEdge as aP, type SubsetNode as aQ, type TemporalAlgorithmOptions as aR, type TransactionContext as aS, type TraversalDirection as aT, type TypedEdgeCollection as aU, UnionableQuery as aV, type UniqueIntrospection as aW, type UpdateEdgeInput as aX, type UpdateNodeInput as aY, type VectorSearchHit as aZ, type VectorSearchOptions as a_, type NodeGetOrCreateByConstraintResult as aa, type NodeIdentifier as ab, type NodeRef as ac, type OntologyIntrospection as ad, type OperationHookContext as ae, type PaginateOptions as af, type PaginatedResult as ag, type PathNode as ah, type Predicate as ai, PreparedQuery as aj, type PropsAccessor as ak, type QueryHookContext as al, type QueryOptions as am, type ReachableNode as an, type ReachableOptions as ao, type RebuildFulltextOptions as ap, type RebuildFulltextResult as aq, type ReclaimedVectorFieldEntry as ar, type RecursiveTraversalOptions as as, type ReembedFunction as at, type ReembedVectorFieldOptions as au, type ReembedVectorFieldResult as av, type SchemaIntrospection as aw, type SearchableMetadata as ax, type SearchableOptions as ay, type SearchableSchema 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-D7YEMg2v.d.cts → store-CNKM334w.d.ts}

@@ -1,9 +1,9 @@
 import { z } from 'zod';
-import { p as SqlDialect, ah as SqlSchema, F as FulltextStrategy, ax as ValueType, ay as PredicateExpression, az as VectorMetricType, a0 as FulltextQueryMode, Q as QueryAst, J as JsonPointer, L as FieldRef, ac as ParameterRef, G as GraphBackend, al as TransactionBackend, a5 as JsonPointerInput, am as TraversalExpansion, aA as Traversal, aB as NodePredicate, aC as ProjectedField, ab as OrderSpec, aD as GroupBySpec, a3 as HybridFusionOptions, aE as RecursiveCyclePolicy, aF as TraversalDirection$1, aG as EdgeRow, aH as NodeRow, U as AdoptedTransaction, K as AggregateExpr, aI as SelectiveField, aJ as ComposableQuery, aK as SetOperationType, aL as SetOperation, ag as SortDirection, m as JsonSchema, aM as VectorMetric } from './types-CMQymcwk.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-c1MGaVVR.cjs';
-import { A as AnyEdgeType, N as NodeType, T as TemporalMode, e as EdgeType, E as EdgeRegistration, h as EdgeId, m as NodeId, b as NodeRegistration, K as KindEntity, f as Cardinality, k as EndpointExistence, d as KindAnnotations, o as UniquenessScope, g as Collation, G as GraphExtension } from './extension-types-B78CZfA5.cjs';
+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-BBiDqJCU.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-BbdyNhkv.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 { SQL } from 'drizzle-orm';
-import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-BQfaAZKA.cjs';
+import { b as MaterializeIndexesOptions, M as MaterializeIndexesResult } from './materialize-indexes-lkawaDor.js';
 
 /**
  * Embedding type for vector search.
@@ -239,6 +239,25 @@ type CompileQueryOptions = Readonly<{
      * 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 FieldTypeInfo = Readonly<{
@@ -1173,6 +1192,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.
  */
@@ -1349,6 +1381,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.
      *
@@ -1920,8 +1974,29 @@ type MaterializeRemovalsEntry = Readonly<{
     status: "removed" | "failed";
     error?: Error;
 }>;
+/**
+ * Outcome of reclaiming one per-`(graphId, kind, field)` vector table that
+ * was orphaned when its embedding field was dropped from a *surviving*
+ * kind's schema. Distinct from {@link MaterializeRemovalsEntry} (whole
+ * kinds) because the unit is a single embedding field, not a kind.
+ */
+type ReclaimedVectorFieldEntry = Readonly<{
+    kind: string;
+    fieldPath: string;
+    status: "reclaimed" | "failed";
+    error?: Error;
+}>;
 type MaterializeRemovalsResult = Readonly<{
     results: readonly MaterializeRemovalsEntry[];
+    /**
+     * Embedding fields removed from a *surviving* kind whose per-field vector
+     * table this pass dropped (or confirmed already absent). Empty when the
+     * backend has no vector strategy or no embedding field has ever been
+     * dropped. Re-derived from immutable schema history each call, so it lists
+     * the same removed fields on repeat passes — the underlying drop is
+     * idempotent (`DROP ... IF EXISTS`). See {@link reclaimRemovedVectorFieldTables}.
+     */
+    reclaimedVectorFields: readonly ReclaimedVectorFieldEntry[];
 }>;
 
 /**
@@ -3147,6 +3222,32 @@ type StoreSchemaMetadata = Readonly<{
  *   .execute();
  * ```
  */
+/**
+ * Optional embedder for {@link Store.reembedVectorField}. Receives a batch of
+ * the kind's nodes and returns a map of `nodeId → new embedding vector` (omit
+ * an id to leave that node without an embedding). Called once per page; the
+ * page size is `batchSize`.
+ */
+type ReembedFunction = (nodes: readonly Node[]) => Promise<ReadonlyMap<string, readonly number[]>> | ReadonlyMap<string, readonly number[]>;
+/** Options for {@link Store.reembedVectorField}. */
+type ReembedVectorFieldOptions = Readonly<{
+    /**
+     * When supplied, drives a batched re-embed loop after recreating storage:
+     * pages the kind's nodes, calls `embed(batch)`, and upserts the returned
+     * vectors. When omitted, storage is recreated empty and the caller
+     * re-embeds via normal `update()` / `upsertEmbedding` writes.
+     */
+    embed?: ReembedFunction;
+    /** Re-embed page size. Default 200. */
+    batchSize?: number;
+}>;
+/** Result of {@link Store.reembedVectorField}. */
+type ReembedVectorFieldResult = Readonly<{
+    /** Whether the per-field storage was dropped and recreated. */
+    recreated: boolean;
+    /** Number of nodes whose embedding was re-written (0 without `embed`). */
+    reembedded: number;
+}>;
 declare class Store<G extends GraphDef> {
     #private;
     constructor(graph: G, backend: GraphBackend, options?: StoreOptions, schemaMetadata?: StoreSchemaMetadata);
@@ -3680,6 +3781,24 @@ declare class Store<G extends GraphDef> {
      *   has no schema yet.
      */
     materializeIndexes(options?: MaterializeIndexesOptions): Promise<MaterializeIndexesResult>;
+    /**
+     * Recreate a vector field's per-field storage at its current declared
+     * dimension, then optionally re-embed existing rows.
+     *
+     * Use this after changing a field's `embedding(N)` to `embedding(M)` (e.g. a
+     * new embedding model): the stored N-dim vectors are invalid under the new
+     * dimension and must be recomputed, not converted. This drops and recreates
+     * the per-`(graphId, kind, field)` table at the new dimension — a brief
+     * window where the field returns no vector hits — resets its materialization
+     * marker, then, when `options.embed` is supplied, pages the kind's nodes,
+     * calls `embed(batch)`, and upserts the returned vectors. Without `embed`,
+     * storage is recreated empty and the caller re-embeds via normal
+     * `update()` / `upsertEmbedding` writes.
+     *
+     * @throws {ConfigurationError} when the backend has no vector strategy or
+     *   cannot execute DDL, or `(kind, fieldPath)` is not a declared embedding.
+     */
+    reembedVectorField(kind: string, fieldPath: string, options?: ReembedVectorFieldOptions): Promise<ReembedVectorFieldResult>;
     /**
      * Removes extension kinds from the schema with cascading edge and
      * ontology cleanup. Two-phase by design:
@@ -3833,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 MaterializeRemovalsOptions as $, type AliasMap as A, type BaseTraversalOptions as B, type CreateQueryBuilderOptions as C, DEFAULT_SEARCHABLE_LANGUAGE as D, type EdgeAliasMap as E, type EmbeddingSchema as F, type EmbeddingValue as G, ExecutableAggregateQuery as H, ExecutableQuery as I, type FieldAccessor as J, type FulltextSearchHit as K, type FulltextSearchOptions as L, type GetOrCreateAction as M, type GraphAlgorithms as N, type GraphEdgeCollections as O, type GraphNodeCollections as P, QueryBuilder as Q, type HookContext as R, Store as S, TraversalBuilder as T, type HybridFulltextOptions as U, type HybridSearchHit as V, type HybridSearchOptions as W, type HybridVectorOptions as X, type IfExistsMode as Y, type KindIntrospection as Z, type MaterializeRemovalsEntry as _, type AggregateResult as a, getEmbeddingDimensions as a$, type MaterializeRemovalsResult as a0, type NeighborsOptions as a1, type Node as a2, type NodeAccessor as a3, type NodeAlias as a4, type NodeCollection as a5, type NodeGetOrCreateByConstraintOptions as a6, type NodeGetOrCreateByConstraintResult as a7, type NodeIdentifier as a8, type NodeRef as a9, type StoreProjection as aA, type StoreRef as aB, StoreSearch as aC, type StreamOptions as aD, type SubgraphEdgeResult as aE, type SubgraphNodeResult as aF, type SubgraphOptions as aG, type SubgraphResult as aH, type SubsetEdge as aI, type SubsetNode as aJ, type TemporalAlgorithmOptions as aK, type TransactionContext as aL, type TraversalDirection as aM, type TypedEdgeCollection as aN, UnionableQuery as aO, type UniqueIntrospection as aP, type UpdateEdgeInput as aQ, type UpdateNodeInput as aR, type VectorSearchHit as aS, type VectorSearchOptions as aT, createStore as aU, createStoreWithSchema as aV, createVerifiedStore as aW, defineSubgraphProject as aX, embedding as aY, exists as aZ, fieldRef as a_, type OntologyIntrospection as aa, type OperationHookContext as ab, type PaginateOptions as ac, type PaginatedResult as ad, type PathNode as ae, type Predicate as af, PreparedQuery as ag, type PropsAccessor as ah, type QueryHookContext as ai, type QueryOptions as aj, type ReachableNode as ak, type ReachableOptions as al, type RebuildFulltextOptions as am, type RebuildFulltextResult as an, type RecursiveTraversalOptions as ao, type SchemaIntrospection as ap, type SearchableMetadata as aq, type SearchableOptions as ar, type SearchableSchema as as, type SelectContext as at, type SelectableEdge as au, type SelectableNode as av, type ShortestPathOptions as aw, type ShortestPathResult as ax, type StoreHooks as ay, type StoreOptions as az, type AlgorithmCyclePolicy as b, getSearchableMetadata as b0, inSubquery as b1, isEmbeddingSchema as b2, isParameterRef as b3, isSearchableSchema as b4, notExists as b5, notInSubquery as b6, param as b7, searchable as b8, type AnyEdge as c, type AnyNode as d, type BatchResults as e, type BatchableQuery as f, type ConstraintNames as g, type CreateEdgeInput as h, type CreateNodeInput as i, type DegreeOptions as j, type DynamicEdgeAccessor as k, type DynamicEdgeCollection as l, type DynamicEdgeType as m, type DynamicFieldBuilder as n, type DynamicNodeAccessor as o, type DynamicNodeCollection as p, type DynamicNodeType as q, type DynamicSelectableEdge as r, type DynamicSelectableNode as s, type Edge as t, type EdgeAccessor as u, type EdgeCollection as v, type EdgeFindByEndpointsOptions as w, type EdgeGetOrCreateByEndpointsOptions as x, type EdgeGetOrCreateByEndpointsResult as y, type EdgeIntrospection as z };
+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, createStore 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 NodeBulkFindByIndexOptions as a7, type NodeCollection as a8, type NodeGetOrCreateByConstraintOptions as a9, type SelectContext as aA, type SelectableEdge as aB, type SelectableNode as aC, type ShortestPathOptions as aD, type ShortestPathResult as aE, type StoreHooks as aF, type StoreOptions as aG, type StoreProjection as aH, type StoreRef as aI, StoreSearch as aJ, type StreamOptions as aK, type SubgraphEdgeResult as aL, type SubgraphNodeResult as aM, type SubgraphOptions as aN, type SubgraphResult as aO, type SubsetEdge as aP, type SubsetNode as aQ, type TemporalAlgorithmOptions as aR, type TransactionContext as aS, type TraversalDirection as aT, type TypedEdgeCollection as aU, UnionableQuery as aV, type UniqueIntrospection as aW, type UpdateEdgeInput as aX, type UpdateNodeInput as aY, type VectorSearchHit as aZ, type VectorSearchOptions as a_, type NodeGetOrCreateByConstraintResult as aa, type NodeIdentifier as ab, type NodeRef as ac, type OntologyIntrospection as ad, type OperationHookContext as ae, type PaginateOptions as af, type PaginatedResult as ag, type PathNode as ah, type Predicate as ai, PreparedQuery as aj, type PropsAccessor as ak, type QueryHookContext as al, type QueryOptions as am, type ReachableNode as an, type ReachableOptions as ao, type RebuildFulltextOptions as ap, type RebuildFulltextResult as aq, type ReclaimedVectorFieldEntry as ar, type RecursiveTraversalOptions as as, type ReembedFunction as at, type ReembedVectorFieldOptions as au, type ReembedVectorFieldResult as av, type SchemaIntrospection as aw, type SearchableMetadata as ax, type SearchableOptions as ay, type SearchableSchema 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 };