@nicia-ai/typegraph 0.2.0 → 0.3.1

package/README.md

@@ -45,3 +45,26 @@ await store.edges.knows.create(alice, bob);
 See the repo README for more.
 
 Examples: [github.com/nicia-ai/typegraph/tree/main/packages/typegraph/examples](https://github.com/nicia-ai/typegraph/tree/main/packages/typegraph/examples)
+
+## Performance Smoke Check
+
+The perf harness lives in `@nicia-ai/typegraph-benchmarks`; these commands delegate to it.
+
+Run a deterministic SQLite perf sanity suite with guardrails:
+
+```bash
+pnpm --filter @nicia-ai/typegraph test:perf
+```
+
+Run the same guardrailed suite against PostgreSQL (requires `POSTGRES_URL`):
+
+```bash
+POSTGRES_URL=postgresql://typegraph:typegraph@127.0.0.1:5432/typegraph_test \
+  pnpm --filter @nicia-ai/typegraph test:perf:postgres
+```
+
+For report-only mode (no pass/fail guardrails):
+
+```bash
+pnpm --filter @nicia-ai/typegraph bench:perf
+```

package/dist/{ast-BVyihVbP.d.cts → ast-CXFx6bF6.d.ts}

@@ -1,159 +1,4 @@
-import { z } from 'zod';
-
-/** Brand key for NodeType */
-declare const NODE_TYPE_BRAND: "__nodeType";
-/** Brand key for EdgeType */
-declare const EDGE_TYPE_BRAND: "__edgeType";
-/** Brand symbol for NodeId */
-declare const __nodeId: unique symbol;
-/**
- * A node type definition.
- *
- * Created via `defineNode()`. Represents a type of node in the graph
- * with an associated Zod schema for properties.
- */
-type NodeType<K extends string = string, S extends z.ZodObject<z.ZodRawShape> = z.ZodObject<z.ZodRawShape>> = Readonly<{
-    [NODE_TYPE_BRAND]: true;
-    name: K;
-    schema: S;
-    description: string | undefined;
-}>;
-/**
- * Branded node ID type.
- *
- * Prevents mixing IDs from different node types at compile time.
- */
-type NodeId<N extends NodeType> = string & Readonly<{
-    [__nodeId]: N;
-}>;
-/**
- * Infer the props type from a NodeType.
- */
-type NodeProps<N extends NodeType> = z.infer<N["schema"]>;
-/**
- * An edge type definition.
- *
- * Created via `defineEdge()`. Represents a type of edge in the graph
- * with an optional Zod schema for properties.
- *
- * Optionally includes `from` and `to` arrays that define the allowed
- * source and target node types (domain and range constraints).
- */
-type EdgeType<K extends string = string, S extends z.ZodObject<z.ZodRawShape> = z.ZodObject<z.ZodRawShape>, From extends readonly NodeType[] | undefined = undefined, To extends readonly NodeType[] | undefined = undefined> = Readonly<{
-    [EDGE_TYPE_BRAND]: true;
-    name: K;
-    schema: S;
-    description: string | undefined;
-    from: From;
-    to: To;
-}>;
-/**
- * Base edge type for use in constraints - accepts any from/to configuration.
- */
-type AnyEdgeType = EdgeType<string, z.ZodObject<z.ZodRawShape>, readonly NodeType[] | undefined, readonly NodeType[] | undefined>;
-/**
- * An edge type that has both from and to constraints defined.
- * Can be used directly in defineGraph without an EdgeRegistration wrapper.
- */
-type EdgeTypeWithEndpoints = EdgeType<string, z.ZodObject<z.ZodRawShape>, readonly NodeType[], readonly NodeType[]>;
-/**
- * Infer the props type from an EdgeType.
- */
-type EdgeProps<E extends AnyEdgeType> = z.infer<E["schema"]>;
-/**
- * Delete behaviors for nodes.
- */
-type DeleteBehavior = "restrict" | "cascade" | "disconnect";
-/**
- * Edge cardinality constraints.
- */
-type Cardinality = "many" | "one" | "unique" | "oneActive";
-/**
- * Endpoint existence modes for edge validation.
- */
-type EndpointExistence = "notDeleted" | "currentlyValid" | "ever";
-/**
- * Temporal query modes.
- */
-type TemporalMode = "current" | "asOf" | "includeEnded" | "includeTombstones";
-/**
- * Uniqueness constraint scope.
- */
-type UniquenessScope = "kind" | "kindWithSubClasses";
-/**
- * Collation for uniqueness constraints.
- */
-type Collation = "binary" | "caseInsensitive";
-/**
- * Uniqueness constraint definition.
- */
-type UniqueConstraint<S extends z.ZodObject<z.ZodRawShape> = z.ZodObject<z.ZodRawShape>> = Readonly<{
-    name: string;
-    fields: readonly (keyof z.infer<S> & string)[];
-    where?: (props: UniqueConstraintPredicateBuilder<S>) => UniqueConstraintPredicate;
-    scope: UniquenessScope;
-    collation: Collation;
-}>;
-/**
- * Predicate builder for uniqueness constraint where clause.
- * Uses -? to make all fields required in the builder, even if optional in the schema.
- */
-type UniqueConstraintPredicateBuilder<S extends z.ZodObject<z.ZodRawShape>> = Readonly<{
-    [K in keyof z.infer<S>]-?: UniqueConstraintField;
-}>;
-/**
- * Field operations for uniqueness constraint predicates.
- */
-type UniqueConstraintField = Readonly<{
-    isNull: () => UniqueConstraintPredicate;
-    isNotNull: () => UniqueConstraintPredicate;
-}>;
-/**
- * A uniqueness constraint predicate (internal representation).
- */
-type UniqueConstraintPredicate = Readonly<{
-    __type: "unique_predicate";
-    field: string;
-    op: "isNull" | "isNotNull";
-}>;
-/**
- * Node registration in a graph definition.
- */
-type NodeRegistration<N extends NodeType = NodeType> = Readonly<{
-    type: N;
-    unique?: readonly UniqueConstraint<N["schema"]>[];
-    onDelete?: DeleteBehavior;
-}>;
-/**
- * Edge registration in a graph definition.
- */
-type EdgeRegistration<E extends AnyEdgeType = AnyEdgeType, FromTypes extends NodeType = NodeType, ToTypes extends NodeType = NodeType> = Readonly<{
-    type: E;
-    from: readonly FromTypes[];
-    to: readonly ToTypes[];
-    cardinality?: Cardinality;
-    endpointExistence?: EndpointExistence;
-}>;
-/**
- * Default settings for a graph.
- */
-type GraphDefaults = Readonly<{
-    onNodeDelete?: DeleteBehavior;
-    temporalMode?: TemporalMode;
-}>;
-/**
- * Checks if a value is a NodeType.
- */
-declare function isNodeType(value: unknown): value is NodeType;
-/**
- * Checks if a value is an EdgeType.
- */
-declare function isEdgeType(value: unknown): value is AnyEdgeType;
-/**
- * Checks if a value is an EdgeType with both from and to constraints defined.
- * Such edges can be used directly in defineGraph without an EdgeRegistration wrapper.
- */
-declare function isEdgeTypeWithEndpoints(value: unknown): value is EdgeTypeWithEndpoints;
+import { T as TemporalMode } from './types-DTJEu_-h.js';
 
 declare const MAX_JSON_POINTER_DEPTH: 5;
 type JsonPointer = string & {
@@ -224,6 +69,17 @@ type LiteralValue = Readonly<{
     value: string | number | boolean;
     valueType?: ValueType | undefined;
 }>;
+/**
+ * A parameter reference for prepared queries.
+ *
+ * Used in place of a literal value to create parameterized queries
+ * that can be executed multiple times with different bindings.
+ */
+type ParameterRef = Readonly<{
+    __type: "parameter";
+    name: string;
+    valueType?: ValueType | undefined;
+}>;
 /**
  * Supported value types for predicates.
  */
@@ -243,7 +99,7 @@ type ComparisonPredicate = Readonly<{
     __type: "comparison";
     op: ComparisonOp;
     left: FieldRef;
-    right: LiteralValue | LiteralValue[];
+    right: LiteralValue | LiteralValue[] | ParameterRef;
 }>;
 /**
  * A string predicate.
@@ -252,7 +108,7 @@ type StringPredicate = Readonly<{
     __type: "string_op";
     op: StringOp;
     field: FieldRef;
-    pattern: string;
+    pattern: string | ParameterRef;
 }>;
 /**
  * A null check predicate.
@@ -268,8 +124,8 @@ type NullPredicate = Readonly<{
 type BetweenPredicate = Readonly<{
     __type: "between";
     field: FieldRef;
-    lower: LiteralValue;
-    upper: LiteralValue;
+    lower: LiteralValue | ParameterRef;
+    upper: LiteralValue | ParameterRef;
 }>;
 /**
  * Array operators.
@@ -393,6 +249,19 @@ type QueryStart = Readonly<{
  * Direction of edge traversal.
  */
 type TraversalDirection = "out" | "in";
+/**
+ * Traversal ontology expansion behavior.
+ *
+ * - `"none"` — follow only the exact edge kind specified
+ * - `"implying"` — also follow edge kinds that imply the specified kind (subClassOf)
+ * - `"inverse"` — also follow the ontological inverse edge kind (inverseOf)
+ * - `"all"` — follow both implying and inverse expansions
+ */
+type TraversalExpansion = "none" | "implying" | "inverse" | "all";
+/**
+ * Cycle handling policy for recursive traversals.
+ */
+type RecursiveCyclePolicy = "prevent" | "allow";
 /**
  * Variable-length traversal specification for recursive graph traversals.
  */
@@ -401,11 +270,16 @@ type VariableLengthSpec = Readonly<{
     minDepth: number;
     /** Maximum number of hops (-1 = unlimited, default: -1) */
     maxDepth: number;
-    /** Include the traversal path as an array in results */
-    collectPath: boolean;
-    /** Column alias for path array (default: "{nodeAlias}_path") */
+    /**
+     * Cycle handling mode.
+     *
+     * - "prevent": Track visited nodes per path and reject revisits
+     * - "allow": Skip cycle checks (faster, may revisit nodes)
+     */
+    cyclePolicy: RecursiveCyclePolicy;
+    /** Optional column alias for projected traversal path array */
     pathAlias?: string;
-    /** Column alias for depth (default: "{nodeAlias}_depth") */
+    /** Optional column alias for projected traversal depth */
     depthAlias?: string;
 }>;
 /**
@@ -414,6 +288,12 @@ type VariableLengthSpec = Readonly<{
 type Traversal = Readonly<{
     edgeAlias: string;
     edgeKinds: readonly string[];
+    /**
+     * Edge kinds traversed in the opposite direction.
+     *
+     * Populated when query options request inverse/symmetric expansion.
+     */
+    inverseEdgeKinds?: readonly string[];
     direction: TraversalDirection;
     nodeAlias: string;
     nodeKinds: readonly string[];
@@ -561,4 +441,4 @@ type SetOperation = Readonly<{
  */
 type ComposableQuery = QueryAst | SetOperation;
 
-export { type AnyEdgeType as A, type Traversal as B, type ComparisonOp as C, type DeleteBehavior as D, type EdgeType as E, type FieldRef as F, type GraphDefaults as G, type NodePredicate as H, type ProjectedField as I, type JsonPointer as J, type GroupBySpec as K, type TraversalDirection as L, MAX_JSON_POINTER_DEPTH as M, type NodeType as N, type OrderSpec as O, type PredicateExpression as P, type QueryAst as Q, type ResolveJsonPointer as R, type SortDirection as S, type TemporalMode as T, type UniqueConstraint as U, type ValueType as V, type ComposableQuery as W, type SetOperationType as X, type SetOperation as Y, type JsonPointerFor as a, type JsonPointerSegmentsFor as b, type AggregateExpr as c, type AggregateComparisonPredicate as d, type Cardinality as e, type Collation as f, type EdgeProps as g, type EdgeRegistration as h, type EdgeTypeWithEndpoints as i, type EndpointExistence as j, type JsonPointerInput as k, type JsonPointerSegment as l, type JsonPointerSegments as m, type NodeId as n, type NodeProps as o, type NodeRegistration as p, type ResolveJsonPointerSegments as q, type UniquenessScope as r, isEdgeType as s, isEdgeTypeWithEndpoints as t, isNodeType as u, joinJsonPointers as v, jsonPointer as w, normalizeJsonPointer as x, parseJsonPointer as y, type VectorMetricType as z };
+export { type AggregateExpr as A, type ComparisonOp as C, type FieldRef as F, type GroupBySpec as G, type JsonPointer as J, MAX_JSON_POINTER_DEPTH as M, type NodePredicate as N, type OrderSpec as O, type ParameterRef as P, type QueryAst as Q, type ResolveJsonPointer as R, type SortDirection as S, type TraversalExpansion as T, type ValueType as V, type JsonPointerFor as a, type JsonPointerSegmentsFor as b, type AggregateComparisonPredicate as c, type JsonPointerInput as d, type JsonPointerSegment as e, type JsonPointerSegments as f, type ResolveJsonPointerSegments as g, jsonPointer as h, type PredicateExpression as i, joinJsonPointers as j, type VectorMetricType as k, type Traversal as l, type ProjectedField as m, normalizeJsonPointer as n, type RecursiveCyclePolicy as o, parseJsonPointer as p, type TraversalDirection as q, type SelectiveField as r, type ComposableQuery as s, type SetOperationType as t, type SetOperation as u };

package/dist/{ast-BVyihVbP.d.ts → ast-D-3bOanX.d.cts}

@@ -1,159 +1,4 @@
-import { z } from 'zod';
-
-/** Brand key for NodeType */
-declare const NODE_TYPE_BRAND: "__nodeType";
-/** Brand key for EdgeType */
-declare const EDGE_TYPE_BRAND: "__edgeType";
-/** Brand symbol for NodeId */
-declare const __nodeId: unique symbol;
-/**
- * A node type definition.
- *
- * Created via `defineNode()`. Represents a type of node in the graph
- * with an associated Zod schema for properties.
- */
-type NodeType<K extends string = string, S extends z.ZodObject<z.ZodRawShape> = z.ZodObject<z.ZodRawShape>> = Readonly<{
-    [NODE_TYPE_BRAND]: true;
-    name: K;
-    schema: S;
-    description: string | undefined;
-}>;
-/**
- * Branded node ID type.
- *
- * Prevents mixing IDs from different node types at compile time.
- */
-type NodeId<N extends NodeType> = string & Readonly<{
-    [__nodeId]: N;
-}>;
-/**
- * Infer the props type from a NodeType.
- */
-type NodeProps<N extends NodeType> = z.infer<N["schema"]>;
-/**
- * An edge type definition.
- *
- * Created via `defineEdge()`. Represents a type of edge in the graph
- * with an optional Zod schema for properties.
- *
- * Optionally includes `from` and `to` arrays that define the allowed
- * source and target node types (domain and range constraints).
- */
-type EdgeType<K extends string = string, S extends z.ZodObject<z.ZodRawShape> = z.ZodObject<z.ZodRawShape>, From extends readonly NodeType[] | undefined = undefined, To extends readonly NodeType[] | undefined = undefined> = Readonly<{
-    [EDGE_TYPE_BRAND]: true;
-    name: K;
-    schema: S;
-    description: string | undefined;
-    from: From;
-    to: To;
-}>;
-/**
- * Base edge type for use in constraints - accepts any from/to configuration.
- */
-type AnyEdgeType = EdgeType<string, z.ZodObject<z.ZodRawShape>, readonly NodeType[] | undefined, readonly NodeType[] | undefined>;
-/**
- * An edge type that has both from and to constraints defined.
- * Can be used directly in defineGraph without an EdgeRegistration wrapper.
- */
-type EdgeTypeWithEndpoints = EdgeType<string, z.ZodObject<z.ZodRawShape>, readonly NodeType[], readonly NodeType[]>;
-/**
- * Infer the props type from an EdgeType.
- */
-type EdgeProps<E extends AnyEdgeType> = z.infer<E["schema"]>;
-/**
- * Delete behaviors for nodes.
- */
-type DeleteBehavior = "restrict" | "cascade" | "disconnect";
-/**
- * Edge cardinality constraints.
- */
-type Cardinality = "many" | "one" | "unique" | "oneActive";
-/**
- * Endpoint existence modes for edge validation.
- */
-type EndpointExistence = "notDeleted" | "currentlyValid" | "ever";
-/**
- * Temporal query modes.
- */
-type TemporalMode = "current" | "asOf" | "includeEnded" | "includeTombstones";
-/**
- * Uniqueness constraint scope.
- */
-type UniquenessScope = "kind" | "kindWithSubClasses";
-/**
- * Collation for uniqueness constraints.
- */
-type Collation = "binary" | "caseInsensitive";
-/**
- * Uniqueness constraint definition.
- */
-type UniqueConstraint<S extends z.ZodObject<z.ZodRawShape> = z.ZodObject<z.ZodRawShape>> = Readonly<{
-    name: string;
-    fields: readonly (keyof z.infer<S> & string)[];
-    where?: (props: UniqueConstraintPredicateBuilder<S>) => UniqueConstraintPredicate;
-    scope: UniquenessScope;
-    collation: Collation;
-}>;
-/**
- * Predicate builder for uniqueness constraint where clause.
- * Uses -? to make all fields required in the builder, even if optional in the schema.
- */
-type UniqueConstraintPredicateBuilder<S extends z.ZodObject<z.ZodRawShape>> = Readonly<{
-    [K in keyof z.infer<S>]-?: UniqueConstraintField;
-}>;
-/**
- * Field operations for uniqueness constraint predicates.
- */
-type UniqueConstraintField = Readonly<{
-    isNull: () => UniqueConstraintPredicate;
-    isNotNull: () => UniqueConstraintPredicate;
-}>;
-/**
- * A uniqueness constraint predicate (internal representation).
- */
-type UniqueConstraintPredicate = Readonly<{
-    __type: "unique_predicate";
-    field: string;
-    op: "isNull" | "isNotNull";
-}>;
-/**
- * Node registration in a graph definition.
- */
-type NodeRegistration<N extends NodeType = NodeType> = Readonly<{
-    type: N;
-    unique?: readonly UniqueConstraint<N["schema"]>[];
-    onDelete?: DeleteBehavior;
-}>;
-/**
- * Edge registration in a graph definition.
- */
-type EdgeRegistration<E extends AnyEdgeType = AnyEdgeType, FromTypes extends NodeType = NodeType, ToTypes extends NodeType = NodeType> = Readonly<{
-    type: E;
-    from: readonly FromTypes[];
-    to: readonly ToTypes[];
-    cardinality?: Cardinality;
-    endpointExistence?: EndpointExistence;
-}>;
-/**
- * Default settings for a graph.
- */
-type GraphDefaults = Readonly<{
-    onNodeDelete?: DeleteBehavior;
-    temporalMode?: TemporalMode;
-}>;
-/**
- * Checks if a value is a NodeType.
- */
-declare function isNodeType(value: unknown): value is NodeType;
-/**
- * Checks if a value is an EdgeType.
- */
-declare function isEdgeType(value: unknown): value is AnyEdgeType;
-/**
- * Checks if a value is an EdgeType with both from and to constraints defined.
- * Such edges can be used directly in defineGraph without an EdgeRegistration wrapper.
- */
-declare function isEdgeTypeWithEndpoints(value: unknown): value is EdgeTypeWithEndpoints;
+import { T as TemporalMode } from './types-DTJEu_-h.cjs';
 
 declare const MAX_JSON_POINTER_DEPTH: 5;
 type JsonPointer = string & {
@@ -224,6 +69,17 @@ type LiteralValue = Readonly<{
     value: string | number | boolean;
     valueType?: ValueType | undefined;
 }>;
+/**
+ * A parameter reference for prepared queries.
+ *
+ * Used in place of a literal value to create parameterized queries
+ * that can be executed multiple times with different bindings.
+ */
+type ParameterRef = Readonly<{
+    __type: "parameter";
+    name: string;
+    valueType?: ValueType | undefined;
+}>;
 /**
  * Supported value types for predicates.
  */
@@ -243,7 +99,7 @@ type ComparisonPredicate = Readonly<{
     __type: "comparison";
     op: ComparisonOp;
     left: FieldRef;
-    right: LiteralValue | LiteralValue[];
+    right: LiteralValue | LiteralValue[] | ParameterRef;
 }>;
 /**
  * A string predicate.
@@ -252,7 +108,7 @@ type StringPredicate = Readonly<{
     __type: "string_op";
     op: StringOp;
     field: FieldRef;
-    pattern: string;
+    pattern: string | ParameterRef;
 }>;
 /**
  * A null check predicate.
@@ -268,8 +124,8 @@ type NullPredicate = Readonly<{
 type BetweenPredicate = Readonly<{
     __type: "between";
     field: FieldRef;
-    lower: LiteralValue;
-    upper: LiteralValue;
+    lower: LiteralValue | ParameterRef;
+    upper: LiteralValue | ParameterRef;
 }>;
 /**
  * Array operators.
@@ -393,6 +249,19 @@ type QueryStart = Readonly<{
  * Direction of edge traversal.
  */
 type TraversalDirection = "out" | "in";
+/**
+ * Traversal ontology expansion behavior.
+ *
+ * - `"none"` — follow only the exact edge kind specified
+ * - `"implying"` — also follow edge kinds that imply the specified kind (subClassOf)
+ * - `"inverse"` — also follow the ontological inverse edge kind (inverseOf)
+ * - `"all"` — follow both implying and inverse expansions
+ */
+type TraversalExpansion = "none" | "implying" | "inverse" | "all";
+/**
+ * Cycle handling policy for recursive traversals.
+ */
+type RecursiveCyclePolicy = "prevent" | "allow";
 /**
  * Variable-length traversal specification for recursive graph traversals.
  */
@@ -401,11 +270,16 @@ type VariableLengthSpec = Readonly<{
     minDepth: number;
     /** Maximum number of hops (-1 = unlimited, default: -1) */
     maxDepth: number;
-    /** Include the traversal path as an array in results */
-    collectPath: boolean;
-    /** Column alias for path array (default: "{nodeAlias}_path") */
+    /**
+     * Cycle handling mode.
+     *
+     * - "prevent": Track visited nodes per path and reject revisits
+     * - "allow": Skip cycle checks (faster, may revisit nodes)
+     */
+    cyclePolicy: RecursiveCyclePolicy;
+    /** Optional column alias for projected traversal path array */
     pathAlias?: string;
-    /** Column alias for depth (default: "{nodeAlias}_depth") */
+    /** Optional column alias for projected traversal depth */
     depthAlias?: string;
 }>;
 /**
@@ -414,6 +288,12 @@ type VariableLengthSpec = Readonly<{
 type Traversal = Readonly<{
     edgeAlias: string;
     edgeKinds: readonly string[];
+    /**
+     * Edge kinds traversed in the opposite direction.
+     *
+     * Populated when query options request inverse/symmetric expansion.
+     */
+    inverseEdgeKinds?: readonly string[];
     direction: TraversalDirection;
     nodeAlias: string;
     nodeKinds: readonly string[];
@@ -561,4 +441,4 @@ type SetOperation = Readonly<{
  */
 type ComposableQuery = QueryAst | SetOperation;
 
-export { type AnyEdgeType as A, type Traversal as B, type ComparisonOp as C, type DeleteBehavior as D, type EdgeType as E, type FieldRef as F, type GraphDefaults as G, type NodePredicate as H, type ProjectedField as I, type JsonPointer as J, type GroupBySpec as K, type TraversalDirection as L, MAX_JSON_POINTER_DEPTH as M, type NodeType as N, type OrderSpec as O, type PredicateExpression as P, type QueryAst as Q, type ResolveJsonPointer as R, type SortDirection as S, type TemporalMode as T, type UniqueConstraint as U, type ValueType as V, type ComposableQuery as W, type SetOperationType as X, type SetOperation as Y, type JsonPointerFor as a, type JsonPointerSegmentsFor as b, type AggregateExpr as c, type AggregateComparisonPredicate as d, type Cardinality as e, type Collation as f, type EdgeProps as g, type EdgeRegistration as h, type EdgeTypeWithEndpoints as i, type EndpointExistence as j, type JsonPointerInput as k, type JsonPointerSegment as l, type JsonPointerSegments as m, type NodeId as n, type NodeProps as o, type NodeRegistration as p, type ResolveJsonPointerSegments as q, type UniquenessScope as r, isEdgeType as s, isEdgeTypeWithEndpoints as t, isNodeType as u, joinJsonPointers as v, jsonPointer as w, normalizeJsonPointer as x, parseJsonPointer as y, type VectorMetricType as z };
+export { type AggregateExpr as A, type ComparisonOp as C, type FieldRef as F, type GroupBySpec as G, type JsonPointer as J, MAX_JSON_POINTER_DEPTH as M, type NodePredicate as N, type OrderSpec as O, type ParameterRef as P, type QueryAst as Q, type ResolveJsonPointer as R, type SortDirection as S, type TraversalExpansion as T, type ValueType as V, type JsonPointerFor as a, type JsonPointerSegmentsFor as b, type AggregateComparisonPredicate as c, type JsonPointerInput as d, type JsonPointerSegment as e, type JsonPointerSegments as f, type ResolveJsonPointerSegments as g, jsonPointer as h, type PredicateExpression as i, joinJsonPointers as j, type VectorMetricType as k, type Traversal as l, type ProjectedField as m, normalizeJsonPointer as n, type RecursiveCyclePolicy as o, parseJsonPointer as p, type TraversalDirection as q, type SelectiveField as r, type ComposableQuery as s, type SetOperationType as t, type SetOperation as u };

package/dist/backend/drizzle/index.cjs

@@ -1,40 +1,40 @@
 'use strict';
 
-var chunk2FURVVAX_cjs = require('../../chunk-2FURVVAX.cjs');
-var chunkUJAGXJDG_cjs = require('../../chunk-UJAGXJDG.cjs');
-var chunkH7THXVH6_cjs = require('../../chunk-H7THXVH6.cjs');
-require('../../chunk-HXAPXPZH.cjs');
-var chunkN4AOJ3VF_cjs = require('../../chunk-N4AOJ3VF.cjs');
-require('../../chunk-SV5H3XM5.cjs');
-require('../../chunk-DDM2FZRJ.cjs');
-require('../../chunk-YM5AL65Y.cjs');
+var chunkCMHFS34N_cjs = require('../../chunk-CMHFS34N.cjs');
+var chunkF23W4W3A_cjs = require('../../chunk-F23W4W3A.cjs');
+require('../../chunk-SFY2PPOY.cjs');
+var chunkXZL6MCZJ_cjs = require('../../chunk-XZL6MCZJ.cjs');
+var chunkNU2XNMVI_cjs = require('../../chunk-NU2XNMVI.cjs');
+require('../../chunk-OYL2SGBD.cjs');
+require('../../chunk-JQDWEX6V.cjs');
+require('../../chunk-2WVFEIHR.cjs');
 require('../../chunk-P5CNM325.cjs');
 
 
 
-Object.defineProperty(exports, "createPostgresBackend", {
+Object.defineProperty(exports, "createSqliteBackend", {
   enumerable: true,
-  get: function () { return chunk2FURVVAX_cjs.createPostgresBackend; }
+  get: function () { return chunkCMHFS34N_cjs.createSqliteBackend; }
 });
-Object.defineProperty(exports, "createPostgresTables", {
+Object.defineProperty(exports, "createPostgresBackend", {
   enumerable: true,
-  get: function () { return chunkUJAGXJDG_cjs.createPostgresTables; }
+  get: function () { return chunkF23W4W3A_cjs.createPostgresBackend; }
 });
-Object.defineProperty(exports, "postgresTables", {
+Object.defineProperty(exports, "createSqliteTables", {
   enumerable: true,
-  get: function () { return chunkUJAGXJDG_cjs.tables; }
+  get: function () { return chunkXZL6MCZJ_cjs.createSqliteTables; }
 });
-Object.defineProperty(exports, "createSqliteBackend", {
+Object.defineProperty(exports, "sqliteTables", {
   enumerable: true,
-  get: function () { return chunkH7THXVH6_cjs.createSqliteBackend; }
+  get: function () { return chunkXZL6MCZJ_cjs.tables; }
 });
-Object.defineProperty(exports, "createSqliteTables", {
+Object.defineProperty(exports, "createPostgresTables", {
   enumerable: true,
-  get: function () { return chunkN4AOJ3VF_cjs.createSqliteTables; }
+  get: function () { return chunkNU2XNMVI_cjs.createPostgresTables; }
 });
-Object.defineProperty(exports, "sqliteTables", {
+Object.defineProperty(exports, "postgresTables", {
   enumerable: true,
-  get: function () { return chunkN4AOJ3VF_cjs.tables; }
+  get: function () { return chunkNU2XNMVI_cjs.tables; }
 });
 //# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map

package/dist/backend/drizzle/index.d.cts

@@ -2,11 +2,12 @@ export { SqliteBackendOptions, createSqliteBackend } from './sqlite.cjs';
 export { PostgresBackendOptions, createPostgresBackend } from './postgres.cjs';
 export { PostgresTables, createPostgresTables, tables as postgresTables } from './schema/postgres.cjs';
 export { SqliteTables, createSqliteTables, tables as sqliteTables } from './schema/sqlite.cjs';
-import 'drizzle-orm/sqlite-core';
-import '../../types-aapj0GLz.cjs';
+import '../../types-DDP0MGBF.cjs';
 import 'drizzle-orm';
+import '../../types-DTJEu_-h.cjs';
+import 'zod';
 import '../../types-BRzHlhKC.cjs';
+import 'drizzle-orm/sqlite-core';
 import 'drizzle-orm/pg-core';
-import '../../types-a5rAxC92.cjs';
-import 'zod';
-import '../../ast-BVyihVbP.cjs';
+import '../../types-DHRsi6j9.cjs';
+import '../../ast-D-3bOanX.cjs';

package/dist/backend/drizzle/index.d.ts

@@ -2,11 +2,12 @@ export { SqliteBackendOptions, createSqliteBackend } from './sqlite.js';
 export { PostgresBackendOptions, createPostgresBackend } from './postgres.js';
 export { PostgresTables, createPostgresTables, tables as postgresTables } from './schema/postgres.js';
 export { SqliteTables, createSqliteTables, tables as sqliteTables } from './schema/sqlite.js';
-import 'drizzle-orm/sqlite-core';
-import '../../types-DsRfx0yk.js';
+import '../../types-Cdbi4hcx.js';
 import 'drizzle-orm';
+import '../../types-DTJEu_-h.js';
+import 'zod';
 import '../../types-BRzHlhKC.js';
+import 'drizzle-orm/sqlite-core';
 import 'drizzle-orm/pg-core';
-import '../../types-CX4cLd7M.js';
-import 'zod';
-import '../../ast-BVyihVbP.js';
+import '../../types-ZT5mlism.js';
+import '../../ast-CXFx6bF6.js';