@confect/core 10.0.0-next.22 → 10.0.0-next.24

package/dist/SystemFields.d.ts

@@ -2,7 +2,8 @@ import type { IdField, SystemFields as NonIdSystemFields } from "convex/server";
 import * as Schema from "effect/Schema";
 import * as Struct from "effect/Struct";
 /**
- * Produces a schema for Convex system fields. In Confect, system fields include `_id`.
+ * Produces a schema for Convex system fields. In Confect, system fields include
+ * `_id`.
  */
 export declare const SystemFields: <TableName extends string>(tableName: TableName) => Schema.Struct<{
     readonly _id: Schema.Codec<import("convex/values").GenericId<TableName>, import("convex/values").GenericId<TableName>, never, never>;
@@ -16,10 +17,11 @@ type SystemFieldsFor<TableName extends string> = ReturnType<typeof SystemFields<
 /**
  * Extend a table schema with Convex system fields.
  *
- * A plain `Struct` gains the fields via `Schema.fieldsAssign` and a `Union`
- * has them distributed across its members, preserving the schema's
- * `Struct`/`Union` structure. Any other object-shaped schema—one built with
- * `Schema.decodeTo`/`Schema.encodeKeys`, a branded struct, a suspended schema—is extended at the AST level: every object node in its encoding chain
+ * A plain `Struct` gains the fields via `Schema.fieldsAssign` and a `Union` has
+ * them distributed across its members, preserving the schema's `Struct`/`Union`
+ * structure. Any other object-shaped schema—one built with
+ * `Schema.decodeTo`/`Schema.encodeKeys`, a branded struct, a suspended
+ * schema—is extended at the AST level: every object node in its encoding chain
  * gains the system fields, and each transformation is wrapped so the fields
  * bypass the user-defined getters. Schemas that do not resolve to an object
  * shape at every step (such as `Schema.Class`, whose decoded values are class
@@ -31,9 +33,9 @@ type SystemFieldsFor<TableName extends string> = ReturnType<typeof SystemFields<
  */
 export declare const extendWithSystemFields: <TableName extends string, TableSchema extends Schema.Codec<any, any>>(tableName: TableName, schema: TableSchema) => ExtendWithSystemFields<TableName, TableSchema>;
 /**
- * Applies the system fields to a single struct, mirroring `Schema.fieldsAssign`.
- * Any other (already-extended or opaque) schema falls back to a `Codec` carrying
- * the system-field document shape.
+ * Applies the system fields to a single struct, mirroring
+ * `Schema.fieldsAssign`. Any other (already-extended or opaque) schema falls
+ * back to a `Codec` carrying the system-field document shape.
  */
 type ApplySystemFields<TableName extends string, S> = S extends Schema.Struct<infer Fields extends Schema.Struct.Fields> ? Schema.Struct<Struct.Simplify<Struct.Assign<Fields, SystemFieldsFor<TableName>>>> : S extends Schema.Codec<infer Type, infer Encoded> ? Schema.Codec<WithSystemFields<TableName, Type>, WithSystemFields<TableName, Encoded>> : never;
 /**
@@ -42,10 +44,10 @@ type ApplySystemFields<TableName extends string, S> = S extends Schema.Struct<in
  * This mirrors the runtime {@link extendWithSystemFields}: a `Struct` gains the
  * system fields directly (matching `Schema.fieldsAssign`), and a `Union` has
  * them distributed across its members (matching
- * `union.mapMembers(Tuple.map(Schema.fieldsAssign(...)))`). The `Struct`/`Union`
- * structure is preserved rather than collapsed to a bare `Codec`; any other
- * schema falls back to a `Codec` carrying the system-field document shape,
- * matching the runtime's AST-level extension.
+ * `union.mapMembers(Tuple.map(Schema.fieldsAssign(...)))`). The
+ * `Struct`/`Union` structure is preserved rather than collapsed to a bare
+ * `Codec`; any other schema falls back to a `Codec` carrying the system-field
+ * document shape, matching the runtime's AST-level extension.
  */
 export type ExtendWithSystemFields<TableName extends string, TableSchema extends Schema.Top> = TableSchema extends Schema.Union<infer Members extends ReadonlyArray<Schema.Top>> ? Schema.Union<Struct.Simplify<Readonly<{
     [K in keyof Members]: ExtendWithSystemFields<TableName, Members[K]>;

package/dist/SystemFields.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SystemFields.d.ts","sourceRoot":"","sources":["../src/SystemFields.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,IAAI,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAOhF,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAIxC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAGxC;;GAEG;AACH,eAAO,MAAM,YAAY,GAAI,SAAS,SAAS,MAAM,aAAa,SAAS;;;EAIvE,CAAC;AAEL;;;GAGG;AACH,KAAK,eAAe,CAAC,SAAS,SAAS,MAAM,IAAI,UAAU,CACzD,OAAO,YAAY,CAAC,SAAS,CAAC,CAC/B,CAAC,QAAQ,CAAC,CAAC;AA4HZ;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,sBAAsB,GACjC,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,aAE/B,SAAS,UACZ,WAAW,KAClB,sBAAsB,CAAC,SAAS,EAAE,WAAW,CA0C/C,CAAC;AAEF;;;;GAIG;AACH,KAAK,iBAAiB,CAAC,SAAS,SAAS,MAAM,EAAE,CAAC,IAChD,CAAC,SAAS,MAAM,CAAC,MAAM,CAAC,MAAM,MAAM,SAAS,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAC9D,MAAM,CAAC,MAAM,CACX,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CACnE,GACD,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,MAAM,OAAO,CAAC,GAC/C,MAAM,CAAC,KAAK,CACV,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,EACjC,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CACrC,GACD,KAAK,CAAC;AAEd;;;;;;;;;;GAUG;AACH,MAAM,MAAM,sBAAsB,CAChC,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,MAAM,CAAC,GAAG,IAE9B,WAAW,SAAS,MAAM,CAAC,KAAK,CAC9B,MAAM,OAAO,SAAS,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAChD,GACG,MAAM,CAAC,KAAK,CACV,MAAM,CAAC,QAAQ,CACb,QAAQ,CAAC;KACN,CAAC,IAAI,MAAM,OAAO,GAAG,sBAAsB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CACpE,CAAC,CACH,CACF,GACD,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;AAEhD;;;;;;GAMG;AACH,MAAM,MAAM,gBAAgB,CAC1B,SAAS,SAAS,MAAM,EACxB,QAAQ,IACN,QAAQ,SAAS,OAAO,GACxB,OAAO,CAAC,SAAS,CAAC,GAAG,iBAAiB,GAAG,QAAQ,GACjD,KAAK,CAAC"}
+{"version":3,"file":"SystemFields.d.ts","sourceRoot":"","sources":["../src/SystemFields.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,IAAI,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAOhF,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAIxC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAGxC;;;GAGG;AACH,eAAO,MAAM,YAAY,GAAI,SAAS,SAAS,MAAM,aAAa,SAAS;;;EAIvE,CAAC;AAEL;;;GAGG;AACH,KAAK,eAAe,CAAC,SAAS,SAAS,MAAM,IAAI,UAAU,CACzD,OAAO,YAAY,CAAC,SAAS,CAAC,CAC/B,CAAC,QAAQ,CAAC,CAAC;AA0HZ;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,sBAAsB,GACjC,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,aAE/B,SAAS,UACZ,WAAW,KAClB,sBAAsB,CAAC,SAAS,EAAE,WAAW,CA0C/C,CAAC;AAEF;;;;GAIG;AACH,KAAK,iBAAiB,CAAC,SAAS,SAAS,MAAM,EAAE,CAAC,IAChD,CAAC,SAAS,MAAM,CAAC,MAAM,CAAC,MAAM,MAAM,SAAS,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAC9D,MAAM,CAAC,MAAM,CACX,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CACnE,GACD,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,MAAM,OAAO,CAAC,GAC/C,MAAM,CAAC,KAAK,CACV,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,EACjC,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CACrC,GACD,KAAK,CAAC;AAEd;;;;;;;;;;GAUG;AACH,MAAM,MAAM,sBAAsB,CAChC,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,MAAM,CAAC,GAAG,IAE9B,WAAW,SAAS,MAAM,CAAC,KAAK,CAC9B,MAAM,OAAO,SAAS,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAChD,GACG,MAAM,CAAC,KAAK,CACV,MAAM,CAAC,QAAQ,CACb,QAAQ,CAAC;KACN,CAAC,IAAI,MAAM,OAAO,GAAG,sBAAsB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;CACpE,CAAC,CACH,CACF,GACD,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;AAEhD;;;;;;GAMG;AACH,MAAM,MAAM,gBAAgB,CAC1B,SAAS,SAAS,MAAM,EACxB,QAAQ,IACN,QAAQ,SAAS,OAAO,GACxB,OAAO,CAAC,SAAS,CAAC,GAAG,iBAAiB,GAAG,QAAQ,GACjD,KAAK,CAAC"}

package/dist/SystemFields.js

@@ -7,17 +7,18 @@ import * as SchemaAST from "effect/SchemaAST";
 import * as Record from "effect/Record";
 import * as Effect from "effect/Effect";
 import { pipe } from "effect/Function";
+import * as Struct from "effect/Struct";
 import * as Array from "effect/Array";
 import * as SchemaGetter from "effect/SchemaGetter";
 import * as SchemaTransformation from "effect/SchemaTransformation";
-import * as Struct from "effect/Struct";
 //#region src/SystemFields.ts
 var SystemFields_exports = /* @__PURE__ */ __exportAll({
 	SystemFields: () => SystemFields,
 	extendWithSystemFields: () => extendWithSystemFields
 });
 /**
-* Produces a schema for Convex system fields. In Confect, system fields include `_id`.
+* Produces a schema for Convex system fields. In Confect, system fields include
+* `_id`.
 */
 const SystemFields = (tableName) => Schema.Struct({
 	_id: GenericId(tableName),
@@ -43,10 +44,10 @@ const splitSystemFields = (input) => {
 * output. Transformations construct fresh objects, so without this the system
 * fields would be dropped at every transformation step.
 */
-const wrapGetter = (getter) => new SchemaGetter.Getter((input, options) => {
-	if (Option.isNone(input) || !Predicate.isObject(input.value)) return getter.run(input, options);
+const wrapGetter = (getter) => SchemaGetter.transformOptionalEffect((input, options) => {
+	if (Option.isNone(input) || !Predicate.isObject(input.value)) return SchemaGetter.run(getter, input, options);
 	const { system, rest } = splitSystemFields(input.value);
-	return getter.run(Option.some(rest), options).pipe(Effect.map(Option.map((output) => Predicate.isObject(output) ? Struct.assign(output, system) : output)));
+	return SchemaGetter.run(getter, Option.some(rest), options).pipe(Effect.map(Option.map((output) => Predicate.isObject(output) ? Struct.assign(output, system) : output)));
 });
 const wrapTransformation = (transformation) => {
 	if (!SchemaTransformation.isTransformation(transformation)) throw new Error("Cannot extend a table schema that uses decoding/encoding middleware with system fields");
@@ -70,10 +71,11 @@ const makeExtendAst = (systemPropertySignatures) => {
 /**
 * Extend a table schema with Convex system fields.
 *
-* A plain `Struct` gains the fields via `Schema.fieldsAssign` and a `Union`
-* has them distributed across its members, preserving the schema's
-* `Struct`/`Union` structure. Any other object-shaped schema—one built with
-* `Schema.decodeTo`/`Schema.encodeKeys`, a branded struct, a suspended schema—is extended at the AST level: every object node in its encoding chain
+* A plain `Struct` gains the fields via `Schema.fieldsAssign` and a `Union` has
+* them distributed across its members, preserving the schema's `Struct`/`Union`
+* structure. Any other object-shaped schema—one built with
+* `Schema.decodeTo`/`Schema.encodeKeys`, a branded struct, a suspended
+* schema—is extended at the AST level: every object node in its encoding chain
 * gains the system fields, and each transformation is wrapped so the fields
 * bypass the user-defined getters. Schemas that do not resolve to an object
 * shape at every step (such as `Schema.Class`, whose decoded values are class

package/dist/SystemFields.js.map

@@ -1 +1 @@
-{"version":3,"file":"SystemFields.js","names":["GenericId.GenericId"],"sources":["../src/SystemFields.ts"],"sourcesContent":["import type { IdField, SystemFields as NonIdSystemFields } from \"convex/server\";\nimport { pipe } from \"effect/Function\";\nimport * as Array from \"effect/Array\";\nimport * as Effect from \"effect/Effect\";\nimport * as Option from \"effect/Option\";\nimport * as Predicate from \"effect/Predicate\";\nimport * as Record from \"effect/Record\";\nimport * as Schema from \"effect/Schema\";\nimport * as SchemaAST from \"effect/SchemaAST\";\nimport * as SchemaGetter from \"effect/SchemaGetter\";\nimport * as SchemaTransformation from \"effect/SchemaTransformation\";\nimport * as Struct from \"effect/Struct\";\nimport * as GenericId from \"./GenericId\";\n\n/**\n * Produces a schema for Convex system fields. In Confect, system fields include `_id`.\n */\nexport const SystemFields = <TableName extends string>(tableName: TableName) =>\n  Schema.Struct({\n    _id: GenericId.GenericId(tableName),\n    _creationTime: Schema.Finite,\n  });\n\n/**\n * The field map added to a table schema, derived from {@link SystemFields} so it\n * stays in lockstep with the runtime schema.\n */\ntype SystemFieldsFor<TableName extends string> = ReturnType<\n  typeof SystemFields<TableName>\n>[\"fields\"];\n\n/**\n * The system field names, derived from {@link SystemFields} so they stay in\n * lockstep with the schema.\n */\nconst systemFieldNames: ReadonlyArray<string> = Record.keys(\n  SystemFields(\"\").fields,\n);\n\nconst isSystemFieldKey = (key: string | symbol): key is string =>\n  Predicate.isString(key) && Array.contains(systemFieldNames, key);\n\nconst splitSystemFields = (input: { [key: PropertyKey]: unknown }) => {\n  const keys = Reflect.ownKeys(input);\n  const pick = (pickedKeys: ReadonlyArray<string | symbol>) =>\n    Record.fromEntries(\n      Array.map(pickedKeys, (key) => [key, input[key]] as const),\n    );\n  return {\n    system: pick(Array.filter(keys, isSystemFieldKey)),\n    rest: pick(Array.filter(keys, Predicate.not(isSystemFieldKey))),\n  };\n};\n\n/**\n * Wraps a transformation getter so the system fields bypass it: they are split\n * off the input before the user-defined getter runs and merged back into its\n * output. Transformations construct fresh objects, so without this the system\n * fields would be dropped at every transformation step.\n */\nconst wrapGetter = <R>(\n  getter: SchemaGetter.Getter<any, any, R>,\n): SchemaGetter.Getter<any, any, R> =>\n  new SchemaGetter.Getter((input, options) => {\n    if (Option.isNone(input) || !Predicate.isObject(input.value)) {\n      return getter.run(input, options);\n    }\n    const { system, rest } = splitSystemFields(input.value);\n    return getter\n      .run(Option.some(rest), options)\n      .pipe(\n        Effect.map(\n          Option.map((output) =>\n            Predicate.isObject(output) ? Struct.assign(output, system) : output,\n          ),\n        ),\n      );\n  });\n\nconst wrapTransformation = (\n  transformation: SchemaAST.Link[\"transformation\"],\n): SchemaTransformation.Transformation<any, any, any, any> => {\n  if (!SchemaTransformation.isTransformation(transformation)) {\n    throw new Error(\n      \"Cannot extend a table schema that uses decoding/encoding middleware with system fields\",\n    );\n  }\n  return new SchemaTransformation.Transformation(\n    wrapGetter(transformation.decode),\n    wrapGetter(transformation.encode),\n  );\n};\n\n/**\n * Builds an AST walker that adds the given system-field property signatures to\n * every object node of a schema's AST—including each step of its encoding\n * chain—wrapping transformations so the fields survive them.\n */\nconst makeExtendAst = (\n  systemPropertySignatures: ReadonlyArray<SchemaAST.PropertySignature>,\n) => {\n  const extendEncoding = (encoding: SchemaAST.Encoding): SchemaAST.Encoding =>\n    Array.map(\n      encoding,\n      (link) =>\n        new SchemaAST.Link(\n          extendAst(link.to),\n          wrapTransformation(link.transformation),\n        ),\n    );\n\n  const extendAst = (ast: SchemaAST.AST): SchemaAST.AST => {\n    if (SchemaAST.isUnion(ast)) {\n      return new SchemaAST.Union(\n        Array.map(ast.types, extendAst),\n        ast.options,\n        ast.annotations,\n        ast.checks,\n        ast.encoding === undefined ? undefined : extendEncoding(ast.encoding),\n        ast.context,\n        ast.encodingChecks,\n      );\n    }\n    if (SchemaAST.isSuspend(ast)) {\n      return new SchemaAST.Suspend(\n        () => extendAst(ast.thunk()),\n        ast.annotations,\n        undefined,\n        ast.encoding === undefined ? undefined : extendEncoding(ast.encoding),\n        ast.context,\n      );\n    }\n    if (SchemaAST.isObjects(ast)) {\n      return new SchemaAST.Objects(\n        Array.appendAll(ast.propertySignatures, systemPropertySignatures),\n        ast.indexSignatures,\n        ast.annotations,\n        ast.checks,\n        ast.encoding === undefined ? undefined : extendEncoding(ast.encoding),\n        ast.context,\n        ast.encodingChecks,\n      );\n    }\n    throw new Error(\n      ast._tag === \"Declaration\"\n        ? \"Cannot extend a `Declaration` schema (such as a `Schema.Class`) with system fields: its decoded values are constructed instances, which cannot gain extra fields. Use a plain `Schema.Struct`, or transform to one with `Schema.decodeTo`.\"\n        : `Cannot extend a \\`${ast._tag}\\` schema node with system fields: a table schema must resolve to an object shape at every step of its encoding.`,\n    );\n  };\n\n  return extendAst;\n};\n\n/**\n * Extend a table schema with Convex system fields.\n *\n * A plain `Struct` gains the fields via `Schema.fieldsAssign` and a `Union`\n * has them distributed across its members, preserving the schema's\n * `Struct`/`Union` structure. Any other object-shaped schema—one built with\n * `Schema.decodeTo`/`Schema.encodeKeys`, a branded struct, a suspended schema—is extended at the AST level: every object node in its encoding chain\n * gains the system fields, and each transformation is wrapped so the fields\n * bypass the user-defined getters. Schemas that do not resolve to an object\n * shape at every step (such as `Schema.Class`, whose decoded values are class\n * instances) are rejected with a descriptive error.\n *\n * Note that struct-level checks on an extended schema observe the value with\n * the system fields attached, and encoding an extended schema emits the system\n * fields alongside the table fields.\n */\nexport const extendWithSystemFields = <\n  TableName extends string,\n  TableSchema extends Schema.Codec<any, any>,\n>(\n  tableName: TableName,\n  schema: TableSchema,\n): ExtendWithSystemFields<TableName, TableSchema> => {\n  const system = SystemFields(tableName).fields;\n\n  const extendAst = makeExtendAst(\n    pipe(\n      system,\n      Record.toEntries,\n      Array.map(\n        ([name, field]) => new SchemaAST.PropertySignature(name, field.ast),\n      ),\n    ),\n  );\n\n  const extend = (s: Schema.Top): Schema.Top => {\n    if (\n      s.ast.encoding === undefined &&\n      SchemaAST.isUnion(s.ast) &&\n      Array.isArray((s as { readonly members?: unknown }).members)\n    ) {\n      return Schema.Union(\n        Array.map(\n          (s as Schema.Union<ReadonlyArray<Schema.Top>>).members,\n          extend,\n        ),\n      );\n    }\n    if (\n      s.ast.encoding === undefined &&\n      SchemaAST.isObjects(s.ast) &&\n      typeof (s as { readonly mapFields?: unknown }).mapFields === \"function\"\n    ) {\n      return Schema.fieldsAssign(system)(\n        s as Schema.Struct<Schema.Struct.Fields>,\n      );\n    }\n    return Schema.make(extendAst(s.ast));\n  };\n\n  return extend(schema) as unknown as ExtendWithSystemFields<\n    TableName,\n    TableSchema\n  >;\n};\n\n/**\n * Applies the system fields to a single struct, mirroring `Schema.fieldsAssign`.\n * Any other (already-extended or opaque) schema falls back to a `Codec` carrying\n * the system-field document shape.\n */\ntype ApplySystemFields<TableName extends string, S> =\n  S extends Schema.Struct<infer Fields extends Schema.Struct.Fields>\n    ? Schema.Struct<\n        Struct.Simplify<Struct.Assign<Fields, SystemFieldsFor<TableName>>>\n      >\n    : S extends Schema.Codec<infer Type, infer Encoded>\n      ? Schema.Codec<\n          WithSystemFields<TableName, Type>,\n          WithSystemFields<TableName, Encoded>\n        >\n      : never;\n\n/**\n * Extend a table schema with Convex system fields at the type level.\n *\n * This mirrors the runtime {@link extendWithSystemFields}: a `Struct` gains the\n * system fields directly (matching `Schema.fieldsAssign`), and a `Union` has\n * them distributed across its members (matching\n * `union.mapMembers(Tuple.map(Schema.fieldsAssign(...)))`). The `Struct`/`Union`\n * structure is preserved rather than collapsed to a bare `Codec`; any other\n * schema falls back to a `Codec` carrying the system-field document shape,\n * matching the runtime's AST-level extension.\n */\nexport type ExtendWithSystemFields<\n  TableName extends string,\n  TableSchema extends Schema.Top,\n> =\n  TableSchema extends Schema.Union<\n    infer Members extends ReadonlyArray<Schema.Top>\n  >\n    ? Schema.Union<\n        Struct.Simplify<\n          Readonly<{\n            [K in keyof Members]: ExtendWithSystemFields<TableName, Members[K]>;\n          }>\n        >\n      >\n    : ApplySystemFields<TableName, TableSchema>;\n\n/**\n * The decoded/encoded document shape: a table's fields plus Convex's system\n * fields. Deliberately a bare intersection (no `Expand`/`Simplify`)—flattening\n * it with a homomorphic mapped type collapses to `{ [x: string]: any }` when\n * `Document` is still an unresolved generic, which breaks structural\n * comparability in the database reader/writer plumbing.\n */\nexport type WithSystemFields<\n  TableName extends string,\n  Document,\n> = Document extends unknown\n  ? IdField<TableName> & NonIdSystemFields & Document\n  : never;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAiBA,MAAa,gBAA0C,cACrD,OAAO,OAAO;CACZ,KAAKA,UAAoB,SAAS;CAClC,eAAe,OAAO;AACxB,CAAC;;;;;AAcH,MAAM,mBAA0C,OAAO,KACrD,aAAa,EAAE,CAAC,CAAC,MACnB;AAEA,MAAM,oBAAoB,QACxB,UAAU,SAAS,GAAG,KAAK,MAAM,SAAS,kBAAkB,GAAG;AAEjE,MAAM,qBAAqB,UAA2C;CACpE,MAAM,OAAO,QAAQ,QAAQ,KAAK;CAClC,MAAM,QAAQ,eACZ,OAAO,YACL,MAAM,IAAI,aAAa,QAAQ,CAAC,KAAK,MAAM,IAAI,CAAU,CAC3D;CACF,OAAO;EACL,QAAQ,KAAK,MAAM,OAAO,MAAM,gBAAgB,CAAC;EACjD,MAAM,KAAK,MAAM,OAAO,MAAM,UAAU,IAAI,gBAAgB,CAAC,CAAC;CAChE;AACF;;;;;;;AAQA,MAAM,cACJ,WAEA,IAAI,aAAa,QAAQ,OAAO,YAAY;CAC1C,IAAI,OAAO,OAAO,KAAK,KAAK,CAAC,UAAU,SAAS,MAAM,KAAK,GACzD,OAAO,OAAO,IAAI,OAAO,OAAO;CAElC,MAAM,EAAE,QAAQ,SAAS,kBAAkB,MAAM,KAAK;CACtD,OAAO,OACJ,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,CAAC,CAC/B,KACC,OAAO,IACL,OAAO,KAAK,WACV,UAAU,SAAS,MAAM,IAAI,OAAO,OAAO,QAAQ,MAAM,IAAI,MAC/D,CACF,CACF;AACJ,CAAC;AAEH,MAAM,sBACJ,mBAC4D;CAC5D,IAAI,CAAC,qBAAqB,iBAAiB,cAAc,GACvD,MAAM,IAAI,MACR,wFACF;CAEF,OAAO,IAAI,qBAAqB,eAC9B,WAAW,eAAe,MAAM,GAChC,WAAW,eAAe,MAAM,CAClC;AACF;;;;;;AAOA,MAAM,iBACJ,6BACG;CACH,MAAM,kBAAkB,aACtB,MAAM,IACJ,WACC,SACC,IAAI,UAAU,KACZ,UAAU,KAAK,EAAE,GACjB,mBAAmB,KAAK,cAAc,CACxC,CACJ;CAEF,MAAM,aAAa,QAAsC;EACvD,IAAI,UAAU,QAAQ,GAAG,GACvB,OAAO,IAAI,UAAU,MACnB,MAAM,IAAI,IAAI,OAAO,SAAS,GAC9B,IAAI,SACJ,IAAI,aACJ,IAAI,QACJ,IAAI,aAAa,KAAA,IAAY,KAAA,IAAY,eAAe,IAAI,QAAQ,GACpE,IAAI,SACJ,IAAI,cACN;EAEF,IAAI,UAAU,UAAU,GAAG,GACzB,OAAO,IAAI,UAAU,cACb,UAAU,IAAI,MAAM,CAAC,GAC3B,IAAI,aACJ,KAAA,GACA,IAAI,aAAa,KAAA,IAAY,KAAA,IAAY,eAAe,IAAI,QAAQ,GACpE,IAAI,OACN;EAEF,IAAI,UAAU,UAAU,GAAG,GACzB,OAAO,IAAI,UAAU,QACnB,MAAM,UAAU,IAAI,oBAAoB,wBAAwB,GAChE,IAAI,iBACJ,IAAI,aACJ,IAAI,QACJ,IAAI,aAAa,KAAA,IAAY,KAAA,IAAY,eAAe,IAAI,QAAQ,GACpE,IAAI,SACJ,IAAI,cACN;EAEF,MAAM,IAAI,MACR,IAAI,SAAS,gBACT,+OACA,qBAAqB,IAAI,KAAK,iHACpC;CACF;CAEA,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,MAAa,0BAIX,WACA,WACmD;CACnD,MAAM,SAAS,aAAa,SAAS,CAAC,CAAC;CAEvC,MAAM,YAAY,cAChB,KACE,QACA,OAAO,WACP,MAAM,KACH,CAAC,MAAM,WAAW,IAAI,UAAU,kBAAkB,MAAM,MAAM,GAAG,CACpE,CACF,CACF;CAEA,MAAM,UAAU,MAA8B;EAC5C,IACE,EAAE,IAAI,aAAa,KAAA,KACnB,UAAU,QAAQ,EAAE,GAAG,KACvB,MAAM,QAAS,EAAqC,OAAO,GAE3D,OAAO,OAAO,MACZ,MAAM,IACH,EAA8C,SAC/C,MACF,CACF;EAEF,IACE,EAAE,IAAI,aAAa,KAAA,KACnB,UAAU,UAAU,EAAE,GAAG,KACzB,OAAQ,EAAuC,cAAc,YAE7D,OAAO,OAAO,aAAa,MAAM,CAAC,CAChC,CACF;EAEF,OAAO,OAAO,KAAK,UAAU,EAAE,GAAG,CAAC;CACrC;CAEA,OAAO,OAAO,MAAM;AAItB"}
+{"version":3,"file":"SystemFields.js","names":["GenericId.GenericId"],"sources":["../src/SystemFields.ts"],"sourcesContent":["import type { IdField, SystemFields as NonIdSystemFields } from \"convex/server\";\nimport { pipe } from \"effect/Function\";\nimport * as Array from \"effect/Array\";\nimport * as Effect from \"effect/Effect\";\nimport * as Option from \"effect/Option\";\nimport * as Predicate from \"effect/Predicate\";\nimport * as Record from \"effect/Record\";\nimport * as Schema from \"effect/Schema\";\nimport * as SchemaAST from \"effect/SchemaAST\";\nimport * as SchemaGetter from \"effect/SchemaGetter\";\nimport * as SchemaTransformation from \"effect/SchemaTransformation\";\nimport * as Struct from \"effect/Struct\";\nimport * as GenericId from \"./GenericId\";\n\n/**\n * Produces a schema for Convex system fields. In Confect, system fields include\n * `_id`.\n */\nexport const SystemFields = <TableName extends string>(tableName: TableName) =>\n  Schema.Struct({\n    _id: GenericId.GenericId(tableName),\n    _creationTime: Schema.Finite,\n  });\n\n/**\n * The field map added to a table schema, derived from {@link SystemFields} so it\n * stays in lockstep with the runtime schema.\n */\ntype SystemFieldsFor<TableName extends string> = ReturnType<\n  typeof SystemFields<TableName>\n>[\"fields\"];\n\n/**\n * The system field names, derived from {@link SystemFields} so they stay in\n * lockstep with the schema.\n */\nconst systemFieldNames: ReadonlyArray<string> = Record.keys(\n  SystemFields(\"\").fields,\n);\n\nconst isSystemFieldKey = (key: string | symbol): key is string =>\n  Predicate.isString(key) && Array.contains(systemFieldNames, key);\n\nconst splitSystemFields = (input: { [key: PropertyKey]: unknown }) => {\n  const keys = Reflect.ownKeys(input);\n  const pick = (pickedKeys: ReadonlyArray<string | symbol>) =>\n    Record.fromEntries(\n      Array.map(pickedKeys, (key) => [key, input[key]] as const),\n    );\n  return {\n    system: pick(Array.filter(keys, isSystemFieldKey)),\n    rest: pick(Array.filter(keys, Predicate.not(isSystemFieldKey))),\n  };\n};\n\n/**\n * Wraps a transformation getter so the system fields bypass it: they are split\n * off the input before the user-defined getter runs and merged back into its\n * output. Transformations construct fresh objects, so without this the system\n * fields would be dropped at every transformation step.\n */\nconst wrapGetter = <R>(\n  getter: SchemaGetter.Getter<any, any, R>,\n): SchemaGetter.Getter<any, any, R> =>\n  SchemaGetter.transformOptionalEffect((input, options) => {\n    if (Option.isNone(input) || !Predicate.isObject(input.value)) {\n      return SchemaGetter.run(getter, input, options);\n    }\n    const { system, rest } = splitSystemFields(input.value);\n    return SchemaGetter.run(getter, Option.some(rest), options).pipe(\n      Effect.map(\n        Option.map((output) =>\n          Predicate.isObject(output) ? Struct.assign(output, system) : output,\n        ),\n      ),\n    );\n  });\n\nconst wrapTransformation = (\n  transformation: SchemaAST.Link[\"transformation\"],\n): SchemaTransformation.Transformation<any, any, any, any> => {\n  if (!SchemaTransformation.isTransformation(transformation)) {\n    throw new Error(\n      \"Cannot extend a table schema that uses decoding/encoding middleware with system fields\",\n    );\n  }\n  return new SchemaTransformation.Transformation(\n    wrapGetter(transformation.decode),\n    wrapGetter(transformation.encode),\n  );\n};\n\n/**\n * Builds an AST walker that adds the given system-field property signatures to\n * every object node of a schema's AST—including each step of its encoding\n * chain—wrapping transformations so the fields survive them.\n */\nconst makeExtendAst = (\n  systemPropertySignatures: ReadonlyArray<SchemaAST.PropertySignature>,\n) => {\n  const extendEncoding = (encoding: SchemaAST.Encoding): SchemaAST.Encoding =>\n    Array.map(\n      encoding,\n      (link) =>\n        new SchemaAST.Link(\n          extendAst(link.to),\n          wrapTransformation(link.transformation),\n        ),\n    );\n\n  const extendAst = (ast: SchemaAST.AST): SchemaAST.AST => {\n    if (SchemaAST.isUnion(ast)) {\n      return new SchemaAST.Union(\n        Array.map(ast.types, extendAst),\n        ast.options,\n        ast.annotations,\n        ast.checks,\n        ast.encoding === undefined ? undefined : extendEncoding(ast.encoding),\n        ast.context,\n        ast.encodingChecks,\n      );\n    }\n    if (SchemaAST.isSuspend(ast)) {\n      return new SchemaAST.Suspend(\n        () => extendAst(ast.thunk()),\n        ast.annotations,\n        undefined,\n        ast.encoding === undefined ? undefined : extendEncoding(ast.encoding),\n        ast.context,\n      );\n    }\n    if (SchemaAST.isObjects(ast)) {\n      return new SchemaAST.Objects(\n        Array.appendAll(ast.propertySignatures, systemPropertySignatures),\n        ast.indexSignatures,\n        ast.annotations,\n        ast.checks,\n        ast.encoding === undefined ? undefined : extendEncoding(ast.encoding),\n        ast.context,\n        ast.encodingChecks,\n      );\n    }\n    throw new Error(\n      ast._tag === \"Declaration\"\n        ? \"Cannot extend a `Declaration` schema (such as a `Schema.Class`) with system fields: its decoded values are constructed instances, which cannot gain extra fields. Use a plain `Schema.Struct`, or transform to one with `Schema.decodeTo`.\"\n        : `Cannot extend a \\`${ast._tag}\\` schema node with system fields: a table schema must resolve to an object shape at every step of its encoding.`,\n    );\n  };\n\n  return extendAst;\n};\n\n/**\n * Extend a table schema with Convex system fields.\n *\n * A plain `Struct` gains the fields via `Schema.fieldsAssign` and a `Union` has\n * them distributed across its members, preserving the schema's `Struct`/`Union`\n * structure. Any other object-shaped schema—one built with\n * `Schema.decodeTo`/`Schema.encodeKeys`, a branded struct, a suspended\n * schema—is extended at the AST level: every object node in its encoding chain\n * gains the system fields, and each transformation is wrapped so the fields\n * bypass the user-defined getters. Schemas that do not resolve to an object\n * shape at every step (such as `Schema.Class`, whose decoded values are class\n * instances) are rejected with a descriptive error.\n *\n * Note that struct-level checks on an extended schema observe the value with\n * the system fields attached, and encoding an extended schema emits the system\n * fields alongside the table fields.\n */\nexport const extendWithSystemFields = <\n  TableName extends string,\n  TableSchema extends Schema.Codec<any, any>,\n>(\n  tableName: TableName,\n  schema: TableSchema,\n): ExtendWithSystemFields<TableName, TableSchema> => {\n  const system = SystemFields(tableName).fields;\n\n  const extendAst = makeExtendAst(\n    pipe(\n      system,\n      Record.toEntries,\n      Array.map(\n        ([name, field]) => new SchemaAST.PropertySignature(name, field.ast),\n      ),\n    ),\n  );\n\n  const extend = (s: Schema.Top): Schema.Top => {\n    if (\n      s.ast.encoding === undefined &&\n      SchemaAST.isUnion(s.ast) &&\n      Array.isArray((s as { readonly members?: unknown }).members)\n    ) {\n      return Schema.Union(\n        Array.map(\n          (s as Schema.Union<ReadonlyArray<Schema.Top>>).members,\n          extend,\n        ),\n      );\n    }\n    if (\n      s.ast.encoding === undefined &&\n      SchemaAST.isObjects(s.ast) &&\n      typeof (s as { readonly mapFields?: unknown }).mapFields === \"function\"\n    ) {\n      return Schema.fieldsAssign(system)(\n        s as Schema.Struct<Schema.Struct.Fields>,\n      );\n    }\n    return Schema.make(extendAst(s.ast));\n  };\n\n  return extend(schema) as unknown as ExtendWithSystemFields<\n    TableName,\n    TableSchema\n  >;\n};\n\n/**\n * Applies the system fields to a single struct, mirroring\n * `Schema.fieldsAssign`. Any other (already-extended or opaque) schema falls\n * back to a `Codec` carrying the system-field document shape.\n */\ntype ApplySystemFields<TableName extends string, S> =\n  S extends Schema.Struct<infer Fields extends Schema.Struct.Fields>\n    ? Schema.Struct<\n        Struct.Simplify<Struct.Assign<Fields, SystemFieldsFor<TableName>>>\n      >\n    : S extends Schema.Codec<infer Type, infer Encoded>\n      ? Schema.Codec<\n          WithSystemFields<TableName, Type>,\n          WithSystemFields<TableName, Encoded>\n        >\n      : never;\n\n/**\n * Extend a table schema with Convex system fields at the type level.\n *\n * This mirrors the runtime {@link extendWithSystemFields}: a `Struct` gains the\n * system fields directly (matching `Schema.fieldsAssign`), and a `Union` has\n * them distributed across its members (matching\n * `union.mapMembers(Tuple.map(Schema.fieldsAssign(...)))`). The\n * `Struct`/`Union` structure is preserved rather than collapsed to a bare\n * `Codec`; any other schema falls back to a `Codec` carrying the system-field\n * document shape, matching the runtime's AST-level extension.\n */\nexport type ExtendWithSystemFields<\n  TableName extends string,\n  TableSchema extends Schema.Top,\n> =\n  TableSchema extends Schema.Union<\n    infer Members extends ReadonlyArray<Schema.Top>\n  >\n    ? Schema.Union<\n        Struct.Simplify<\n          Readonly<{\n            [K in keyof Members]: ExtendWithSystemFields<TableName, Members[K]>;\n          }>\n        >\n      >\n    : ApplySystemFields<TableName, TableSchema>;\n\n/**\n * The decoded/encoded document shape: a table's fields plus Convex's system\n * fields. Deliberately a bare intersection (no `Expand`/`Simplify`)—flattening\n * it with a homomorphic mapped type collapses to `{ [x: string]: any }` when\n * `Document` is still an unresolved generic, which breaks structural\n * comparability in the database reader/writer plumbing.\n */\nexport type WithSystemFields<\n  TableName extends string,\n  Document,\n> = Document extends unknown\n  ? IdField<TableName> & NonIdSystemFields & Document\n  : never;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAkBA,MAAa,gBAA0C,cACrD,OAAO,OAAO;CACZ,KAAKA,UAAoB,SAAS;CAClC,eAAe,OAAO;AACxB,CAAC;;;;;AAcH,MAAM,mBAA0C,OAAO,KACrD,aAAa,EAAE,CAAC,CAAC,MACnB;AAEA,MAAM,oBAAoB,QACxB,UAAU,SAAS,GAAG,KAAK,MAAM,SAAS,kBAAkB,GAAG;AAEjE,MAAM,qBAAqB,UAA2C;CACpE,MAAM,OAAO,QAAQ,QAAQ,KAAK;CAClC,MAAM,QAAQ,eACZ,OAAO,YACL,MAAM,IAAI,aAAa,QAAQ,CAAC,KAAK,MAAM,IAAI,CAAU,CAC3D;CACF,OAAO;EACL,QAAQ,KAAK,MAAM,OAAO,MAAM,gBAAgB,CAAC;EACjD,MAAM,KAAK,MAAM,OAAO,MAAM,UAAU,IAAI,gBAAgB,CAAC,CAAC;CAChE;AACF;;;;;;;AAQA,MAAM,cACJ,WAEA,aAAa,yBAAyB,OAAO,YAAY;CACvD,IAAI,OAAO,OAAO,KAAK,KAAK,CAAC,UAAU,SAAS,MAAM,KAAK,GACzD,OAAO,aAAa,IAAI,QAAQ,OAAO,OAAO;CAEhD,MAAM,EAAE,QAAQ,SAAS,kBAAkB,MAAM,KAAK;CACtD,OAAO,aAAa,IAAI,QAAQ,OAAO,KAAK,IAAI,GAAG,OAAO,CAAC,CAAC,KAC1D,OAAO,IACL,OAAO,KAAK,WACV,UAAU,SAAS,MAAM,IAAI,OAAO,OAAO,QAAQ,MAAM,IAAI,MAC/D,CACF,CACF;AACF,CAAC;AAEH,MAAM,sBACJ,mBAC4D;CAC5D,IAAI,CAAC,qBAAqB,iBAAiB,cAAc,GACvD,MAAM,IAAI,MACR,wFACF;CAEF,OAAO,IAAI,qBAAqB,eAC9B,WAAW,eAAe,MAAM,GAChC,WAAW,eAAe,MAAM,CAClC;AACF;;;;;;AAOA,MAAM,iBACJ,6BACG;CACH,MAAM,kBAAkB,aACtB,MAAM,IACJ,WACC,SACC,IAAI,UAAU,KACZ,UAAU,KAAK,EAAE,GACjB,mBAAmB,KAAK,cAAc,CACxC,CACJ;CAEF,MAAM,aAAa,QAAsC;EACvD,IAAI,UAAU,QAAQ,GAAG,GACvB,OAAO,IAAI,UAAU,MACnB,MAAM,IAAI,IAAI,OAAO,SAAS,GAC9B,IAAI,SACJ,IAAI,aACJ,IAAI,QACJ,IAAI,aAAa,KAAA,IAAY,KAAA,IAAY,eAAe,IAAI,QAAQ,GACpE,IAAI,SACJ,IAAI,cACN;EAEF,IAAI,UAAU,UAAU,GAAG,GACzB,OAAO,IAAI,UAAU,cACb,UAAU,IAAI,MAAM,CAAC,GAC3B,IAAI,aACJ,KAAA,GACA,IAAI,aAAa,KAAA,IAAY,KAAA,IAAY,eAAe,IAAI,QAAQ,GACpE,IAAI,OACN;EAEF,IAAI,UAAU,UAAU,GAAG,GACzB,OAAO,IAAI,UAAU,QACnB,MAAM,UAAU,IAAI,oBAAoB,wBAAwB,GAChE,IAAI,iBACJ,IAAI,aACJ,IAAI,QACJ,IAAI,aAAa,KAAA,IAAY,KAAA,IAAY,eAAe,IAAI,QAAQ,GACpE,IAAI,SACJ,IAAI,cACN;EAEF,MAAM,IAAI,MACR,IAAI,SAAS,gBACT,+OACA,qBAAqB,IAAI,KAAK,iHACpC;CACF;CAEA,OAAO;AACT;;;;;;;;;;;;;;;;;;AAmBA,MAAa,0BAIX,WACA,WACmD;CACnD,MAAM,SAAS,aAAa,SAAS,CAAC,CAAC;CAEvC,MAAM,YAAY,cAChB,KACE,QACA,OAAO,WACP,MAAM,KACH,CAAC,MAAM,WAAW,IAAI,UAAU,kBAAkB,MAAM,MAAM,GAAG,CACpE,CACF,CACF;CAEA,MAAM,UAAU,MAA8B;EAC5C,IACE,EAAE,IAAI,aAAa,KAAA,KACnB,UAAU,QAAQ,EAAE,GAAG,KACvB,MAAM,QAAS,EAAqC,OAAO,GAE3D,OAAO,OAAO,MACZ,MAAM,IACH,EAA8C,SAC/C,MACF,CACF;EAEF,IACE,EAAE,IAAI,aAAa,KAAA,KACnB,UAAU,UAAU,EAAE,GAAG,KACzB,OAAQ,EAAuC,cAAc,YAE7D,OAAO,OAAO,aAAa,MAAM,CAAC,CAChC,CACF;EAEF,OAAO,OAAO,KAAK,UAAU,EAAE,GAAG,CAAC;CACrC;CAEA,OAAO,OAAO,MAAM;AAItB"}

package/dist/Table.d.ts

@@ -67,6 +67,7 @@ export declare const make: <const TableSchema_ extends Schema.Codec<any, any>>(l
  * Extract all of the index field paths within a Convex `Validator`.
  *
  * This is used when declaring table indexes.
+ *
  * @public
  */
 type ExtractFieldPaths<T extends Validator<any, any, any>> = T["fieldPaths"] | keyof ConvexSystemFields;

package/dist/Table.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Table.d.ts","sourceRoot":"","sources":["../src/Table.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,YAAY,MAAM,gBAAgB,CAAC;AAC/C,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,KAAK,EACV,YAAY,IAAI,kBAAkB,EAClC,MAAM,EACN,mBAAmB,EACnB,yBAAyB,EACzB,yBAAyB,EACzB,oBAAoB,EACpB,iBAAiB,EACjB,iBAAiB,EAClB,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAEjE,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAC;AAE7C,eAAO,MAAM,MAAM,yBAAyB,CAAC;AAC7C,MAAM,MAAM,MAAM,GAAG,OAAO,MAAM,CAAC;AAanC,eAAO,MAAM,OAAO,MAAO,OAAO,KAAG,CAAC,IAAI,GACiC,CAAC;AAE5E,eAAO,MAAM,cAAc,MAAO,OAAO,KAAG,CAAC,IAAI,UAC2B,CAAC;AAW7E,MAAM,WAAW,KAAK,CACpB,KAAK,SAAS,MAAM,EACpB,YAAY,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EAC3C,eAAe,SAAS,gBAAgB,GACtC,2BAA2B,CAAC,YAAY,CAAC,EAC3C,QAAQ,SAAS,mBAAmB,GAAG,EAAE,EACzC,cAAc,SAAS,yBAAyB,GAAG,EAAE,EACrD,cAAc,SAAS,yBAAyB,GAAG,EAAE;IAErD,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC,sBAAsB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACvE,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC;IAC3B,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,iBAAiB,EAAE,eAAe,CAAC;CAC7C;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,MAAM,YAAY,GAAG,KAAK,CAC9B,GAAG,EACH,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EACtB,gBAAgB,EAChB,mBAAmB,EACnB,yBAAyB,EACzB,yBAAyB,CAC1B,CAAC;AAeF,MAAM,WAAW,YAAY,CAC3B,YAAY,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EAC3C,eAAe,SAAS,gBAAgB,GACtC,2BAA2B,CAAC,YAAY,CAAC,EAC3C,QAAQ,SAAS,mBAAmB,GAAG,EAAE,EACzC,cAAc,SAAS,yBAAyB,GAAG,EAAE,EACrD,cAAc,SAAS,yBAAyB,GAAG,EAAE;IAErD,CAAC,KAAK,CAAC,KAAK,SAAS,MAAM,EACzB,SAAS,EAAE,KAAK,GACf,KAAK,CACN,KAAK,EACL,YAAY,EACZ,eAAe,EACf,QAAQ,EACR,cAAc,EACd,cAAc,CACf,CAAC;IAEF,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC;IAC3B,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,iBAAiB,EAAE,eAAe,CAAC;IAE5C,KAAK,CACH,SAAS,SAAS,MAAM,EACxB,cAAc,SAAS,iBAAiB,CAAC,eAAe,CAAC,EACzD,cAAc,SAAS,iBAAiB,CAAC,eAAe,CAAC,EAAE,EAE3D,IAAI,EAAE,SAAS,EACf,MAAM,EAAE,CAAC,cAAc,EAAE,GAAG,cAAc,CAAC,GAC1C,YAAY,CACb,YAAY,EACZ,eAAe,EACf,MAAM,CACJ,QAAQ,GACN,MAAM,CACJ,SAAS,EACT;QAAC,cAAc;QAAE,GAAG,cAAc;QAAE,oBAAoB;KAAC,CAC1D,CACJ,EACD,cAAc,EACd,cAAc,CACf,CAAC;IAEF,WAAW,CACT,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,iBAAiB,CAAC,eAAe,CAAC,EACtD,YAAY,SAAS,iBAAiB,CAAC,eAAe,CAAC,GAAG,KAAK,EAE/D,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,MAAM,CAAC,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,GAChE,YAAY,CACb,YAAY,EACZ,eAAe,EACf,QAAQ,EACR,MAAM,CACJ,cAAc,GACZ,MAAM,CACJ,SAAS,EACT;QACE,WAAW,EAAE,WAAW,CAAC;QACzB,YAAY,EAAE,YAAY,CAAC;KAC5B,CACF,CACJ,EACD,cAAc,CACf,CAAC;IAEF,WAAW,CACT,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,iBAAiB,CAAC,eAAe,CAAC,EACtD,YAAY,SAAS,iBAAiB,CAAC,eAAe,CAAC,GAAG,KAAK,EAE/D,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,MAAM,CAAC,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,GAChE,YAAY,CACb,YAAY,EACZ,eAAe,EACf,QAAQ,EACR,cAAc,EACd,MAAM,CACJ,cAAc,GACZ,MAAM,CACJ,SAAS,EACT;QACE,WAAW,EAAE,WAAW,CAAC;QACzB,UAAU,EAAE,MAAM,CAAC;QACnB,YAAY,EAAE,YAAY,CAAC;KAC5B,CACF,CACJ,CACF,CAAC;CACH;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,MAAM,mBAAmB,GAAG,YAAY,CAC5C,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EACtB,gBAAgB,EAChB,mBAAmB,EACnB,yBAAyB,EACzB,yBAAyB,CAC1B,CAAC;AAMF,MAAM,MAAM,IAAI,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,WAAW,CAAC,GACrE,MAAM,CAAC;AAET,MAAM,MAAM,WAAW,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAE5E,MAAM,MAAM,cAAc,CAAC,QAAQ,SAAS,YAAY,IACtD,QAAQ,CAAC,iBAAiB,CAAC,CAAC;AAE9B,MAAM,MAAM,OAAO,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC;AAEzE,MAAM,MAAM,aAAa,CAAC,QAAQ,SAAS,YAAY,IACrD,QAAQ,CAAC,eAAe,CAAC,CAAC;AAE5B,MAAM,MAAM,aAAa,CAAC,QAAQ,SAAS,YAAY,IACrD,QAAQ,CAAC,eAAe,CAAC,CAAC;AAE5B,MAAM,MAAM,GAAG,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;AAEjE,MAAM,MAAM,MAAM,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAEvE,MAAM,MAAM,QAAQ,CAClB,QAAQ,SAAS,YAAY,EAC7B,KAAK,SAAS,MAAM,IAClB,QAAQ,SAAS;IAAE,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAA;CAAE,GAAG,QAAQ,GAAG,KAAK,CAAC;AAEtE,MAAM,MAAM,YAAY,CAAC,MAAM,SAAS,YAAY,IAAI;IACtD,QAAQ,EAAE,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;CACpE,CAAC;AAwKF,eAAO,MAAM,IAAI,GAAI,KAAK,CAAC,YAAY,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,cACxD,MAAM,YAAY,KAC7B,YAAY,CAAC,YAAY,EAAE,2BAA2B,CAAC,YAAY,CAAC,CAUtE,CAAC;AAIF;;;;;GAKG;AACH,KAAK,iBAAiB,CAAC,CAAC,SAAS,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,IAIvD,CAAC,CAAC,YAAY,CAAC,GAAG,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"Table.d.ts","sourceRoot":"","sources":["../src/Table.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,YAAY,MAAM,gBAAgB,CAAC;AAC/C,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,KAAK,EACV,YAAY,IAAI,kBAAkB,EAClC,MAAM,EACN,mBAAmB,EACnB,yBAAyB,EACzB,yBAAyB,EACzB,oBAAoB,EACpB,iBAAiB,EACjB,iBAAiB,EAClB,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAEjE,OAAO,KAAK,KAAK,MAAM,MAAM,eAAe,CAAC;AAE7C,eAAO,MAAM,MAAM,yBAAyB,CAAC;AAC7C,MAAM,MAAM,MAAM,GAAG,OAAO,MAAM,CAAC;AAanC,eAAO,MAAM,OAAO,MAAO,OAAO,KAAG,CAAC,IAAI,GACiC,CAAC;AAE5E,eAAO,MAAM,cAAc,MAAO,OAAO,KAAG,CAAC,IAAI,UAC2B,CAAC;AAW7E,MAAM,WAAW,KAAK,CACpB,KAAK,SAAS,MAAM,EACpB,YAAY,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EAC3C,eAAe,SAAS,gBAAgB,GACtC,2BAA2B,CAAC,YAAY,CAAC,EAC3C,QAAQ,SAAS,mBAAmB,GAAG,EAAE,EACzC,cAAc,SAAS,yBAAyB,GAAG,EAAE,EACrD,cAAc,SAAS,yBAAyB,GAAG,EAAE;IAErD,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC,sBAAsB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACvE,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC;IAC3B,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,iBAAiB,EAAE,eAAe,CAAC;CAC7C;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,MAAM,YAAY,GAAG,KAAK,CAC9B,GAAG,EACH,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EACtB,gBAAgB,EAChB,mBAAmB,EACnB,yBAAyB,EACzB,yBAAyB,CAC1B,CAAC;AAeF,MAAM,WAAW,YAAY,CAC3B,YAAY,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EAC3C,eAAe,SAAS,gBAAgB,GACtC,2BAA2B,CAAC,YAAY,CAAC,EAC3C,QAAQ,SAAS,mBAAmB,GAAG,EAAE,EACzC,cAAc,SAAS,yBAAyB,GAAG,EAAE,EACrD,cAAc,SAAS,yBAAyB,GAAG,EAAE;IAErD,CAAC,KAAK,CAAC,KAAK,SAAS,MAAM,EACzB,SAAS,EAAE,KAAK,GACf,KAAK,CACN,KAAK,EACL,YAAY,EACZ,eAAe,EACf,QAAQ,EACR,cAAc,EACd,cAAc,CACf,CAAC;IAEF,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC;IAC3B,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC;IACvC,QAAQ,CAAC,iBAAiB,EAAE,eAAe,CAAC;IAE5C,KAAK,CACH,SAAS,SAAS,MAAM,EACxB,cAAc,SAAS,iBAAiB,CAAC,eAAe,CAAC,EACzD,cAAc,SAAS,iBAAiB,CAAC,eAAe,CAAC,EAAE,EAE3D,IAAI,EAAE,SAAS,EACf,MAAM,EAAE,CAAC,cAAc,EAAE,GAAG,cAAc,CAAC,GAC1C,YAAY,CACb,YAAY,EACZ,eAAe,EACf,MAAM,CACJ,QAAQ,GACN,MAAM,CACJ,SAAS,EACT;QAAC,cAAc;QAAE,GAAG,cAAc;QAAE,oBAAoB;KAAC,CAC1D,CACJ,EACD,cAAc,EACd,cAAc,CACf,CAAC;IAEF,WAAW,CACT,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,iBAAiB,CAAC,eAAe,CAAC,EACtD,YAAY,SAAS,iBAAiB,CAAC,eAAe,CAAC,GAAG,KAAK,EAE/D,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,MAAM,CAAC,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,GAChE,YAAY,CACb,YAAY,EACZ,eAAe,EACf,QAAQ,EACR,MAAM,CACJ,cAAc,GACZ,MAAM,CACJ,SAAS,EACT;QACE,WAAW,EAAE,WAAW,CAAC;QACzB,YAAY,EAAE,YAAY,CAAC;KAC5B,CACF,CACJ,EACD,cAAc,CACf,CAAC;IAEF,WAAW,CACT,SAAS,SAAS,MAAM,EACxB,WAAW,SAAS,iBAAiB,CAAC,eAAe,CAAC,EACtD,YAAY,SAAS,iBAAiB,CAAC,eAAe,CAAC,GAAG,KAAK,EAE/D,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,MAAM,CAAC,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,GAChE,YAAY,CACb,YAAY,EACZ,eAAe,EACf,QAAQ,EACR,cAAc,EACd,MAAM,CACJ,cAAc,GACZ,MAAM,CACJ,SAAS,EACT;QACE,WAAW,EAAE,WAAW,CAAC;QACzB,UAAU,EAAE,MAAM,CAAC;QACnB,YAAY,EAAE,YAAY,CAAC;KAC5B,CACF,CACJ,CACF,CAAC;CACH;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,MAAM,mBAAmB,GAAG,YAAY,CAC5C,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EACtB,gBAAgB,EAChB,mBAAmB,EACnB,yBAAyB,EACzB,yBAAyB,CAC1B,CAAC;AAMF,MAAM,MAAM,IAAI,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,WAAW,CAAC,GACrE,MAAM,CAAC;AAET,MAAM,MAAM,WAAW,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAE5E,MAAM,MAAM,cAAc,CAAC,QAAQ,SAAS,YAAY,IACtD,QAAQ,CAAC,iBAAiB,CAAC,CAAC;AAE9B,MAAM,MAAM,OAAO,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC;AAEzE,MAAM,MAAM,aAAa,CAAC,QAAQ,SAAS,YAAY,IACrD,QAAQ,CAAC,eAAe,CAAC,CAAC;AAE5B,MAAM,MAAM,aAAa,CAAC,QAAQ,SAAS,YAAY,IACrD,QAAQ,CAAC,eAAe,CAAC,CAAC;AAE5B,MAAM,MAAM,GAAG,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;AAEjE,MAAM,MAAM,MAAM,CAAC,QAAQ,SAAS,YAAY,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAEvE,MAAM,MAAM,QAAQ,CAClB,QAAQ,SAAS,YAAY,EAC7B,KAAK,SAAS,MAAM,IAClB,QAAQ,SAAS;IAAE,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAA;CAAE,GAAG,QAAQ,GAAG,KAAK,CAAC;AAEtE,MAAM,MAAM,YAAY,CAAC,MAAM,SAAS,YAAY,IAAI;IACtD,QAAQ,EAAE,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;CACpE,CAAC;AAwKF,eAAO,MAAM,IAAI,GAAI,KAAK,CAAC,YAAY,SAAS,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,cACxD,MAAM,YAAY,KAC7B,YAAY,CAAC,YAAY,EAAE,2BAA2B,CAAC,YAAY,CAAC,CAUtE,CAAC;AAIF;;;;;;GAMG;AACH,KAAK,iBAAiB,CAAC,CAAC,SAAS,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,IAIvD,CAAC,CAAC,YAAY,CAAC,GAAG,MAAM,kBAAkB,CAAC"}

package/dist/Table.js.map

@@ -1 +1 @@
-{"version":3,"file":"Table.js","names":["SystemFields.extendWithSystemFields"],"sources":["../src/Table.ts"],"sourcesContent":["import * as Lazy from \"./Lazy\";\nimport * as SystemFields from \"./SystemFields\";\nimport type { TableSchemaToTableValidator } from \"./SchemaToValidator\";\nimport type {\n  SystemFields as ConvexSystemFields,\n  Expand,\n  GenericTableIndexes,\n  GenericTableSearchIndexes,\n  GenericTableVectorIndexes,\n  IndexTiebreakerField,\n  SearchIndexConfig,\n  VectorIndexConfig,\n} from \"convex/server\";\nimport type { GenericValidator, Validator } from \"convex/values\";\nimport * as Predicate from \"effect/Predicate\";\nimport type * as Schema from \"effect/Schema\";\n\nexport const TypeId = \"~@confect/core/Table\";\nexport type TypeId = typeof TypeId;\n\n// -----------------------------------------------------------------------------\n// Predicates\n// -----------------------------------------------------------------------------\n//\n// Both bound `Table`s and `UnnamedTable` callables share the same `[TypeId]`\n// brand. They disambiguate by whether a `tableName` property is set: bound\n// tables have one, unnamed callables do not.\n//\n// The discriminator is `tableName` (not `name`) so it does not collide with\n// the built-in `Function.prototype.name` that every JS function carries.\n\nexport const isTable = (u: unknown): u is Any =>\n  Predicate.hasProperty(u, TypeId) && Predicate.hasProperty(u, \"tableName\");\n\nexport const isUnnamedTable = (u: unknown): u is UnnamedAny =>\n  Predicate.hasProperty(u, TypeId) && !Predicate.hasProperty(u, \"tableName\");\n\n// -----------------------------------------------------------------------------\n// Bound Table\n// -----------------------------------------------------------------------------\n//\n// A bound `Table` is the client-safe document schema: `Fields`, `Doc`, and\n// the index metadata records. The Convex deploy `tableDefinition` (which\n// value-imports `convex/server`) is produced separately by\n// `@confect/server/Table.tableDefinition`.\n\nexport interface Table<\n  Name_ extends string,\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends GenericValidator =\n    TableSchemaToTableValidator<TableSchema_>,\n  Indexes_ extends GenericTableIndexes = {},\n  SearchIndexes_ extends GenericTableSearchIndexes = {},\n  VectorIndexes_ extends GenericTableVectorIndexes = {},\n> {\n  readonly [TypeId]: TypeId;\n  readonly tableName: Name_;\n  readonly Fields: TableSchema_;\n  readonly Doc: SystemFields.ExtendWithSystemFields<Name_, TableSchema_>;\n  readonly indexes: Indexes_;\n  readonly searchIndexes: SearchIndexes_;\n  readonly vectorIndexes: VectorIndexes_;\n  readonly \"~TableValidator\": TableValidator_;\n}\n\nexport interface Any {\n  readonly [TypeId]: TypeId;\n  readonly tableName: string;\n}\n\nexport type AnyWithProps = Table<\n  any,\n  Schema.Codec<any, any>,\n  GenericValidator,\n  GenericTableIndexes,\n  GenericTableSearchIndexes,\n  GenericTableVectorIndexes\n>;\n\n// -----------------------------------------------------------------------------\n// UnnamedTable (callable)\n// -----------------------------------------------------------------------------\n//\n// `Table.make(lazyFields)` returns an `UnnamedTable`: a callable that\n// produces a fully bound `Table` when invoked with a name. Chaining methods\n// (`.index`, `.searchIndex`, `.vectorIndex`) live here and return new\n// `UnnamedTable`s, accumulating plain index metadata records. The\n// user-supplied `lazyFields` callback is just carried through until first\n// access of `Fields`/`Doc` on a bound table. The codegen pipeline emits a\n// wrapper file per user-authored table that simply invokes the unnamed\n// callable with the filename basename.\n\nexport interface UnnamedTable<\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends GenericValidator =\n    TableSchemaToTableValidator<TableSchema_>,\n  Indexes_ extends GenericTableIndexes = {},\n  SearchIndexes_ extends GenericTableSearchIndexes = {},\n  VectorIndexes_ extends GenericTableVectorIndexes = {},\n> {\n  <const Name_ extends string>(\n    tableName: Name_,\n  ): Table<\n    Name_,\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  readonly [TypeId]: TypeId;\n  readonly indexes: Indexes_;\n  readonly searchIndexes: SearchIndexes_;\n  readonly vectorIndexes: VectorIndexes_;\n  readonly \"~TableValidator\": TableValidator_;\n\n  index<\n    IndexName extends string,\n    FirstFieldPath extends ExtractFieldPaths<TableValidator_>,\n    RestFieldPaths extends ExtractFieldPaths<TableValidator_>[],\n  >(\n    name: IndexName,\n    fields: [FirstFieldPath, ...RestFieldPaths],\n  ): UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Expand<\n      Indexes_ &\n        Record<\n          IndexName,\n          [FirstFieldPath, ...RestFieldPaths, IndexTiebreakerField]\n        >\n    >,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  searchIndex<\n    IndexName extends string,\n    SearchField extends ExtractFieldPaths<TableValidator_>,\n    FilterFields extends ExtractFieldPaths<TableValidator_> = never,\n  >(\n    name: IndexName,\n    indexConfig: Expand<SearchIndexConfig<SearchField, FilterFields>>,\n  ): UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    Expand<\n      SearchIndexes_ &\n        Record<\n          IndexName,\n          {\n            searchField: SearchField;\n            filterFields: FilterFields;\n          }\n        >\n    >,\n    VectorIndexes_\n  >;\n\n  vectorIndex<\n    IndexName extends string,\n    VectorField extends ExtractFieldPaths<TableValidator_>,\n    FilterFields extends ExtractFieldPaths<TableValidator_> = never,\n  >(\n    name: IndexName,\n    indexConfig: Expand<VectorIndexConfig<VectorField, FilterFields>>,\n  ): UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    Expand<\n      VectorIndexes_ &\n        Record<\n          IndexName,\n          {\n            vectorField: VectorField;\n            dimensions: number;\n            filterFields: FilterFields;\n          }\n        >\n    >\n  >;\n}\n\nexport interface UnnamedAny {\n  readonly [TypeId]: TypeId;\n}\n\nexport type UnnamedAnyWithProps = UnnamedTable<\n  Schema.Codec<any, any>,\n  GenericValidator,\n  GenericTableIndexes,\n  GenericTableSearchIndexes,\n  GenericTableVectorIndexes\n>;\n\n// -----------------------------------------------------------------------------\n// Type extractors\n// -----------------------------------------------------------------------------\n\nexport type Name<TableDef extends AnyWithProps> = TableDef[\"tableName\"] &\n  string;\n\nexport type TableSchema<TableDef extends AnyWithProps> = TableDef[\"Fields\"];\n\nexport type TableValidator<TableDef extends AnyWithProps> =\n  TableDef[\"~TableValidator\"];\n\nexport type Indexes<TableDef extends AnyWithProps> = TableDef[\"indexes\"];\n\nexport type SearchIndexes<TableDef extends AnyWithProps> =\n  TableDef[\"searchIndexes\"];\n\nexport type VectorIndexes<TableDef extends AnyWithProps> =\n  TableDef[\"vectorIndexes\"];\n\nexport type Doc<TableDef extends AnyWithProps> = TableDef[\"Doc\"];\n\nexport type Fields<TableDef extends AnyWithProps> = TableDef[\"Fields\"];\n\nexport type WithName<\n  TableDef extends AnyWithProps,\n  Name_ extends string,\n> = TableDef extends { readonly tableName: Name_ } ? TableDef : never;\n\nexport type TablesRecord<Tables extends AnyWithProps> = {\n  readonly [TableName_ in Name<Tables>]: WithName<Tables, TableName_>;\n};\n\n// -----------------------------------------------------------------------------\n// Construction\n// -----------------------------------------------------------------------------\n//\n// `make` only stores the user-supplied `lazyFields` callback alongside any\n// chained index metadata. Neither `Fields` nor `Doc` is constructed until\n// first access on a bound `Table`. Each chain step is O(1) (plain object\n// spread of the metadata records) and never invokes the callback. Binding\n// via `unnamed(tableName)` installs lazy memoised getters for `Fields` and\n// `Doc` via `Lazy.defineProperty`, so the first access materialises the\n// value and replaces the getter with a plain data property—second-and-\n// subsequent accesses are observably indistinguishable from a plain\n// property and avoid all function-call overhead.\n\ninterface UnnamedState<\n  TableSchema_ extends Schema.Codec<any, any>,\n  Indexes_ extends GenericTableIndexes,\n  SearchIndexes_ extends GenericTableSearchIndexes,\n  VectorIndexes_ extends GenericTableVectorIndexes,\n> {\n  readonly lazyFields: () => TableSchema_;\n  readonly indexes: Indexes_;\n  readonly searchIndexes: SearchIndexes_;\n  readonly vectorIndexes: VectorIndexes_;\n}\n\nconst makeBound = <\n  Name_ extends string,\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends Validator<any, any, any>,\n  Indexes_ extends GenericTableIndexes,\n  SearchIndexes_ extends GenericTableSearchIndexes,\n  VectorIndexes_ extends GenericTableVectorIndexes,\n>(\n  tableName: Name_,\n  state: UnnamedState<TableSchema_, Indexes_, SearchIndexes_, VectorIndexes_>,\n): Table<\n  Name_,\n  TableSchema_,\n  TableValidator_,\n  Indexes_,\n  SearchIndexes_,\n  VectorIndexes_\n> => {\n  const bound = {\n    [TypeId]: TypeId as TypeId,\n    tableName,\n    indexes: state.indexes,\n    searchIndexes: state.searchIndexes,\n    vectorIndexes: state.vectorIndexes,\n  } as Table<\n    Name_,\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  Lazy.defineProperty(bound, \"Fields\", () => state.lazyFields());\n\n  Lazy.defineProperty(bound, \"Doc\", () =>\n    SystemFields.extendWithSystemFields(\n      tableName,\n      (bound as { Fields: TableSchema_ }).Fields,\n    ),\n  );\n\n  return bound;\n};\n\nconst makeUnnamed = <\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends Validator<any, any, any>,\n  Indexes_ extends GenericTableIndexes,\n  SearchIndexes_ extends GenericTableSearchIndexes,\n  VectorIndexes_ extends GenericTableVectorIndexes,\n>(\n  state: UnnamedState<TableSchema_, Indexes_, SearchIndexes_, VectorIndexes_>,\n): UnnamedTable<\n  TableSchema_,\n  TableValidator_,\n  Indexes_,\n  SearchIndexes_,\n  VectorIndexes_\n> => {\n  type UnnamedTable_ = UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  type UnnamedTableFunction<FunctionName extends keyof UnnamedTable_> =\n    UnnamedTable_[FunctionName];\n\n  const bind = <const Name_ extends string>(\n    tableName: Name_,\n  ): Table<\n    Name_,\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  > =>\n    makeBound<\n      Name_,\n      TableSchema_,\n      TableValidator_,\n      Indexes_,\n      SearchIndexes_,\n      VectorIndexes_\n    >(tableName, state);\n\n  const index: UnnamedTableFunction<\"index\"> = (name, fields) =>\n    makeUnnamed({\n      lazyFields: state.lazyFields,\n      indexes: {\n        ...state.indexes,\n        [name]: fields,\n      } as any,\n      searchIndexes: state.searchIndexes,\n      vectorIndexes: state.vectorIndexes,\n    });\n\n  const searchIndex: UnnamedTableFunction<\"searchIndex\"> = (\n    name,\n    indexConfig,\n  ) =>\n    makeUnnamed({\n      lazyFields: state.lazyFields,\n      indexes: state.indexes,\n      searchIndexes: {\n        ...state.searchIndexes,\n        [name]: indexConfig,\n      } as any,\n      vectorIndexes: state.vectorIndexes,\n    });\n\n  const vectorIndex: UnnamedTableFunction<\"vectorIndex\"> = (\n    name,\n    indexConfig,\n  ) =>\n    makeUnnamed({\n      lazyFields: state.lazyFields,\n      indexes: state.indexes,\n      searchIndexes: state.searchIndexes,\n      vectorIndexes: {\n        ...state.vectorIndexes,\n        [name]: indexConfig,\n      } as any,\n    });\n\n  return Object.assign(bind, {\n    [TypeId]: TypeId as TypeId,\n    indexes: state.indexes,\n    searchIndexes: state.searchIndexes,\n    vectorIndexes: state.vectorIndexes,\n    index,\n    searchIndex,\n    vectorIndex,\n  }) as UnnamedTable_;\n};\n\nexport const make = <const TableSchema_ extends Schema.Codec<any, any>>(\n  lazyFields: () => TableSchema_,\n): UnnamedTable<TableSchema_, TableSchemaToTableValidator<TableSchema_>> => {\n  type TableValidator_ = TableSchemaToTableValidator<TableSchema_>;\n  type UnnamedTable_ = UnnamedTable<TableSchema_, TableValidator_>;\n\n  return makeUnnamed<TableSchema_, TableValidator_, {}, {}, {}>({\n    lazyFields,\n    indexes: {},\n    searchIndexes: {},\n    vectorIndexes: {},\n  }) as UnnamedTable_;\n};\n\n// Vendored types from convex-js, partially modified. Ideally we could use these directly. See https://github.com/get-convex/convex-js/pull/14\n\n/**\n * Extract all of the index field paths within a Convex `Validator`.\n *\n * This is used when declaring table indexes.\n * @public\n */\ntype ExtractFieldPaths<T extends Validator<any, any, any>> =\n  // Add in the system fields available in index definitions.\n  // This should be everything except for `_id` because thats added to indexes\n  // automatically.\n  T[\"fieldPaths\"] | keyof ConvexSystemFields;\n"],"mappings":";;;;;;;;;;;AAiBA,MAAa,SAAS;AActB,MAAa,WAAW,MACtB,UAAU,YAAY,GAAA,sBAAS,KAAK,UAAU,YAAY,GAAG,WAAW;AAE1E,MAAa,kBAAkB,MAC7B,UAAU,YAAY,GAAA,sBAAS,KAAK,CAAC,UAAU,YAAY,GAAG,WAAW;AAgO3E,MAAM,aAQJ,WACA,UAQG;CACH,MAAM,QAAQ;GACX,SAAS;EACV;EACA,SAAS,MAAM;EACf,eAAe,MAAM;EACrB,eAAe,MAAM;CACvB;CASA,eAAoB,OAAO,gBAAgB,MAAM,WAAW,CAAC;CAE7D,eAAoB,OAAO,aACzBA,uBACE,WACC,MAAmC,MACtC,CACF;CAEA,OAAO;AACT;AAEA,MAAM,eAOJ,UAOG;CAYH,MAAM,QACJ,cASA,UAOE,WAAW,KAAK;CAEpB,MAAM,SAAwC,MAAM,WAClD,YAAY;EACV,YAAY,MAAM;EAClB,SAAS;GACP,GAAG,MAAM;IACR,OAAO;EACV;EACA,eAAe,MAAM;EACrB,eAAe,MAAM;CACvB,CAAC;CAEH,MAAM,eACJ,MACA,gBAEA,YAAY;EACV,YAAY,MAAM;EAClB,SAAS,MAAM;EACf,eAAe;GACb,GAAG,MAAM;IACR,OAAO;EACV;EACA,eAAe,MAAM;CACvB,CAAC;CAEH,MAAM,eACJ,MACA,gBAEA,YAAY;EACV,YAAY,MAAM;EAClB,SAAS,MAAM;EACf,eAAe,MAAM;EACrB,eAAe;GACb,GAAG,MAAM;IACR,OAAO;EACV;CACF,CAAC;CAEH,OAAO,OAAO,OAAO,MAAM;GACxB,SAAS;EACV,SAAS,MAAM;EACf,eAAe,MAAM;EACrB,eAAe,MAAM;EACrB;EACA;EACA;CACF,CAAC;AACH;AAEA,MAAa,QACX,eAC0E;CAI1E,OAAO,YAAuD;EAC5D;EACA,SAAS,CAAC;EACV,eAAe,CAAC;EAChB,eAAe,CAAC;CAClB,CAAC;AACH"}
+{"version":3,"file":"Table.js","names":["SystemFields.extendWithSystemFields"],"sources":["../src/Table.ts"],"sourcesContent":["import * as Lazy from \"./Lazy\";\nimport * as SystemFields from \"./SystemFields\";\nimport type { TableSchemaToTableValidator } from \"./SchemaToValidator\";\nimport type {\n  SystemFields as ConvexSystemFields,\n  Expand,\n  GenericTableIndexes,\n  GenericTableSearchIndexes,\n  GenericTableVectorIndexes,\n  IndexTiebreakerField,\n  SearchIndexConfig,\n  VectorIndexConfig,\n} from \"convex/server\";\nimport type { GenericValidator, Validator } from \"convex/values\";\nimport * as Predicate from \"effect/Predicate\";\nimport type * as Schema from \"effect/Schema\";\n\nexport const TypeId = \"~@confect/core/Table\";\nexport type TypeId = typeof TypeId;\n\n// -----------------------------------------------------------------------------\n// Predicates\n// -----------------------------------------------------------------------------\n//\n// Both bound `Table`s and `UnnamedTable` callables share the same `[TypeId]`\n// brand. They disambiguate by whether a `tableName` property is set: bound\n// tables have one, unnamed callables do not.\n//\n// The discriminator is `tableName` (not `name`) so it does not collide with\n// the built-in `Function.prototype.name` that every JS function carries.\n\nexport const isTable = (u: unknown): u is Any =>\n  Predicate.hasProperty(u, TypeId) && Predicate.hasProperty(u, \"tableName\");\n\nexport const isUnnamedTable = (u: unknown): u is UnnamedAny =>\n  Predicate.hasProperty(u, TypeId) && !Predicate.hasProperty(u, \"tableName\");\n\n// -----------------------------------------------------------------------------\n// Bound Table\n// -----------------------------------------------------------------------------\n//\n// A bound `Table` is the client-safe document schema: `Fields`, `Doc`, and\n// the index metadata records. The Convex deploy `tableDefinition` (which\n// value-imports `convex/server`) is produced separately by\n// `@confect/server/Table.tableDefinition`.\n\nexport interface Table<\n  Name_ extends string,\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends GenericValidator =\n    TableSchemaToTableValidator<TableSchema_>,\n  Indexes_ extends GenericTableIndexes = {},\n  SearchIndexes_ extends GenericTableSearchIndexes = {},\n  VectorIndexes_ extends GenericTableVectorIndexes = {},\n> {\n  readonly [TypeId]: TypeId;\n  readonly tableName: Name_;\n  readonly Fields: TableSchema_;\n  readonly Doc: SystemFields.ExtendWithSystemFields<Name_, TableSchema_>;\n  readonly indexes: Indexes_;\n  readonly searchIndexes: SearchIndexes_;\n  readonly vectorIndexes: VectorIndexes_;\n  readonly \"~TableValidator\": TableValidator_;\n}\n\nexport interface Any {\n  readonly [TypeId]: TypeId;\n  readonly tableName: string;\n}\n\nexport type AnyWithProps = Table<\n  any,\n  Schema.Codec<any, any>,\n  GenericValidator,\n  GenericTableIndexes,\n  GenericTableSearchIndexes,\n  GenericTableVectorIndexes\n>;\n\n// -----------------------------------------------------------------------------\n// UnnamedTable (callable)\n// -----------------------------------------------------------------------------\n//\n// `Table.make(lazyFields)` returns an `UnnamedTable`: a callable that\n// produces a fully bound `Table` when invoked with a name. Chaining methods\n// (`.index`, `.searchIndex`, `.vectorIndex`) live here and return new\n// `UnnamedTable`s, accumulating plain index metadata records. The\n// user-supplied `lazyFields` callback is just carried through until first\n// access of `Fields`/`Doc` on a bound table. The codegen pipeline emits a\n// wrapper file per user-authored table that simply invokes the unnamed\n// callable with the filename basename.\n\nexport interface UnnamedTable<\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends GenericValidator =\n    TableSchemaToTableValidator<TableSchema_>,\n  Indexes_ extends GenericTableIndexes = {},\n  SearchIndexes_ extends GenericTableSearchIndexes = {},\n  VectorIndexes_ extends GenericTableVectorIndexes = {},\n> {\n  <const Name_ extends string>(\n    tableName: Name_,\n  ): Table<\n    Name_,\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  readonly [TypeId]: TypeId;\n  readonly indexes: Indexes_;\n  readonly searchIndexes: SearchIndexes_;\n  readonly vectorIndexes: VectorIndexes_;\n  readonly \"~TableValidator\": TableValidator_;\n\n  index<\n    IndexName extends string,\n    FirstFieldPath extends ExtractFieldPaths<TableValidator_>,\n    RestFieldPaths extends ExtractFieldPaths<TableValidator_>[],\n  >(\n    name: IndexName,\n    fields: [FirstFieldPath, ...RestFieldPaths],\n  ): UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Expand<\n      Indexes_ &\n        Record<\n          IndexName,\n          [FirstFieldPath, ...RestFieldPaths, IndexTiebreakerField]\n        >\n    >,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  searchIndex<\n    IndexName extends string,\n    SearchField extends ExtractFieldPaths<TableValidator_>,\n    FilterFields extends ExtractFieldPaths<TableValidator_> = never,\n  >(\n    name: IndexName,\n    indexConfig: Expand<SearchIndexConfig<SearchField, FilterFields>>,\n  ): UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    Expand<\n      SearchIndexes_ &\n        Record<\n          IndexName,\n          {\n            searchField: SearchField;\n            filterFields: FilterFields;\n          }\n        >\n    >,\n    VectorIndexes_\n  >;\n\n  vectorIndex<\n    IndexName extends string,\n    VectorField extends ExtractFieldPaths<TableValidator_>,\n    FilterFields extends ExtractFieldPaths<TableValidator_> = never,\n  >(\n    name: IndexName,\n    indexConfig: Expand<VectorIndexConfig<VectorField, FilterFields>>,\n  ): UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    Expand<\n      VectorIndexes_ &\n        Record<\n          IndexName,\n          {\n            vectorField: VectorField;\n            dimensions: number;\n            filterFields: FilterFields;\n          }\n        >\n    >\n  >;\n}\n\nexport interface UnnamedAny {\n  readonly [TypeId]: TypeId;\n}\n\nexport type UnnamedAnyWithProps = UnnamedTable<\n  Schema.Codec<any, any>,\n  GenericValidator,\n  GenericTableIndexes,\n  GenericTableSearchIndexes,\n  GenericTableVectorIndexes\n>;\n\n// -----------------------------------------------------------------------------\n// Type extractors\n// -----------------------------------------------------------------------------\n\nexport type Name<TableDef extends AnyWithProps> = TableDef[\"tableName\"] &\n  string;\n\nexport type TableSchema<TableDef extends AnyWithProps> = TableDef[\"Fields\"];\n\nexport type TableValidator<TableDef extends AnyWithProps> =\n  TableDef[\"~TableValidator\"];\n\nexport type Indexes<TableDef extends AnyWithProps> = TableDef[\"indexes\"];\n\nexport type SearchIndexes<TableDef extends AnyWithProps> =\n  TableDef[\"searchIndexes\"];\n\nexport type VectorIndexes<TableDef extends AnyWithProps> =\n  TableDef[\"vectorIndexes\"];\n\nexport type Doc<TableDef extends AnyWithProps> = TableDef[\"Doc\"];\n\nexport type Fields<TableDef extends AnyWithProps> = TableDef[\"Fields\"];\n\nexport type WithName<\n  TableDef extends AnyWithProps,\n  Name_ extends string,\n> = TableDef extends { readonly tableName: Name_ } ? TableDef : never;\n\nexport type TablesRecord<Tables extends AnyWithProps> = {\n  readonly [TableName_ in Name<Tables>]: WithName<Tables, TableName_>;\n};\n\n// -----------------------------------------------------------------------------\n// Construction\n// -----------------------------------------------------------------------------\n//\n// `make` only stores the user-supplied `lazyFields` callback alongside any\n// chained index metadata. Neither `Fields` nor `Doc` is constructed until\n// first access on a bound `Table`. Each chain step is O(1) (plain object\n// spread of the metadata records) and never invokes the callback. Binding\n// via `unnamed(tableName)` installs lazy memoised getters for `Fields` and\n// `Doc` via `Lazy.defineProperty`, so the first access materialises the\n// value and replaces the getter with a plain data property—second-and-\n// subsequent accesses are observably indistinguishable from a plain\n// property and avoid all function-call overhead.\n\ninterface UnnamedState<\n  TableSchema_ extends Schema.Codec<any, any>,\n  Indexes_ extends GenericTableIndexes,\n  SearchIndexes_ extends GenericTableSearchIndexes,\n  VectorIndexes_ extends GenericTableVectorIndexes,\n> {\n  readonly lazyFields: () => TableSchema_;\n  readonly indexes: Indexes_;\n  readonly searchIndexes: SearchIndexes_;\n  readonly vectorIndexes: VectorIndexes_;\n}\n\nconst makeBound = <\n  Name_ extends string,\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends Validator<any, any, any>,\n  Indexes_ extends GenericTableIndexes,\n  SearchIndexes_ extends GenericTableSearchIndexes,\n  VectorIndexes_ extends GenericTableVectorIndexes,\n>(\n  tableName: Name_,\n  state: UnnamedState<TableSchema_, Indexes_, SearchIndexes_, VectorIndexes_>,\n): Table<\n  Name_,\n  TableSchema_,\n  TableValidator_,\n  Indexes_,\n  SearchIndexes_,\n  VectorIndexes_\n> => {\n  const bound = {\n    [TypeId]: TypeId as TypeId,\n    tableName,\n    indexes: state.indexes,\n    searchIndexes: state.searchIndexes,\n    vectorIndexes: state.vectorIndexes,\n  } as Table<\n    Name_,\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  Lazy.defineProperty(bound, \"Fields\", () => state.lazyFields());\n\n  Lazy.defineProperty(bound, \"Doc\", () =>\n    SystemFields.extendWithSystemFields(\n      tableName,\n      (bound as { Fields: TableSchema_ }).Fields,\n    ),\n  );\n\n  return bound;\n};\n\nconst makeUnnamed = <\n  TableSchema_ extends Schema.Codec<any, any>,\n  TableValidator_ extends Validator<any, any, any>,\n  Indexes_ extends GenericTableIndexes,\n  SearchIndexes_ extends GenericTableSearchIndexes,\n  VectorIndexes_ extends GenericTableVectorIndexes,\n>(\n  state: UnnamedState<TableSchema_, Indexes_, SearchIndexes_, VectorIndexes_>,\n): UnnamedTable<\n  TableSchema_,\n  TableValidator_,\n  Indexes_,\n  SearchIndexes_,\n  VectorIndexes_\n> => {\n  type UnnamedTable_ = UnnamedTable<\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  >;\n\n  type UnnamedTableFunction<FunctionName extends keyof UnnamedTable_> =\n    UnnamedTable_[FunctionName];\n\n  const bind = <const Name_ extends string>(\n    tableName: Name_,\n  ): Table<\n    Name_,\n    TableSchema_,\n    TableValidator_,\n    Indexes_,\n    SearchIndexes_,\n    VectorIndexes_\n  > =>\n    makeBound<\n      Name_,\n      TableSchema_,\n      TableValidator_,\n      Indexes_,\n      SearchIndexes_,\n      VectorIndexes_\n    >(tableName, state);\n\n  const index: UnnamedTableFunction<\"index\"> = (name, fields) =>\n    makeUnnamed({\n      lazyFields: state.lazyFields,\n      indexes: {\n        ...state.indexes,\n        [name]: fields,\n      } as any,\n      searchIndexes: state.searchIndexes,\n      vectorIndexes: state.vectorIndexes,\n    });\n\n  const searchIndex: UnnamedTableFunction<\"searchIndex\"> = (\n    name,\n    indexConfig,\n  ) =>\n    makeUnnamed({\n      lazyFields: state.lazyFields,\n      indexes: state.indexes,\n      searchIndexes: {\n        ...state.searchIndexes,\n        [name]: indexConfig,\n      } as any,\n      vectorIndexes: state.vectorIndexes,\n    });\n\n  const vectorIndex: UnnamedTableFunction<\"vectorIndex\"> = (\n    name,\n    indexConfig,\n  ) =>\n    makeUnnamed({\n      lazyFields: state.lazyFields,\n      indexes: state.indexes,\n      searchIndexes: state.searchIndexes,\n      vectorIndexes: {\n        ...state.vectorIndexes,\n        [name]: indexConfig,\n      } as any,\n    });\n\n  return Object.assign(bind, {\n    [TypeId]: TypeId as TypeId,\n    indexes: state.indexes,\n    searchIndexes: state.searchIndexes,\n    vectorIndexes: state.vectorIndexes,\n    index,\n    searchIndex,\n    vectorIndex,\n  }) as UnnamedTable_;\n};\n\nexport const make = <const TableSchema_ extends Schema.Codec<any, any>>(\n  lazyFields: () => TableSchema_,\n): UnnamedTable<TableSchema_, TableSchemaToTableValidator<TableSchema_>> => {\n  type TableValidator_ = TableSchemaToTableValidator<TableSchema_>;\n  type UnnamedTable_ = UnnamedTable<TableSchema_, TableValidator_>;\n\n  return makeUnnamed<TableSchema_, TableValidator_, {}, {}, {}>({\n    lazyFields,\n    indexes: {},\n    searchIndexes: {},\n    vectorIndexes: {},\n  }) as UnnamedTable_;\n};\n\n// Vendored types from convex-js, partially modified. Ideally we could use these directly. See https://github.com/get-convex/convex-js/pull/14\n\n/**\n * Extract all of the index field paths within a Convex `Validator`.\n *\n * This is used when declaring table indexes.\n *\n * @public\n */\ntype ExtractFieldPaths<T extends Validator<any, any, any>> =\n  // Add in the system fields available in index definitions.\n  // This should be everything except for `_id` because thats added to indexes\n  // automatically.\n  T[\"fieldPaths\"] | keyof ConvexSystemFields;\n"],"mappings":";;;;;;;;;;;AAiBA,MAAa,SAAS;AActB,MAAa,WAAW,MACtB,UAAU,YAAY,GAAA,sBAAS,KAAK,UAAU,YAAY,GAAG,WAAW;AAE1E,MAAa,kBAAkB,MAC7B,UAAU,YAAY,GAAA,sBAAS,KAAK,CAAC,UAAU,YAAY,GAAG,WAAW;AAgO3E,MAAM,aAQJ,WACA,UAQG;CACH,MAAM,QAAQ;GACX,SAAS;EACV;EACA,SAAS,MAAM;EACf,eAAe,MAAM;EACrB,eAAe,MAAM;CACvB;CASA,eAAoB,OAAO,gBAAgB,MAAM,WAAW,CAAC;CAE7D,eAAoB,OAAO,aACzBA,uBACE,WACC,MAAmC,MACtC,CACF;CAEA,OAAO;AACT;AAEA,MAAM,eAOJ,UAOG;CAYH,MAAM,QACJ,cASA,UAOE,WAAW,KAAK;CAEpB,MAAM,SAAwC,MAAM,WAClD,YAAY;EACV,YAAY,MAAM;EAClB,SAAS;GACP,GAAG,MAAM;IACR,OAAO;EACV;EACA,eAAe,MAAM;EACrB,eAAe,MAAM;CACvB,CAAC;CAEH,MAAM,eACJ,MACA,gBAEA,YAAY;EACV,YAAY,MAAM;EAClB,SAAS,MAAM;EACf,eAAe;GACb,GAAG,MAAM;IACR,OAAO;EACV;EACA,eAAe,MAAM;CACvB,CAAC;CAEH,MAAM,eACJ,MACA,gBAEA,YAAY;EACV,YAAY,MAAM;EAClB,SAAS,MAAM;EACf,eAAe,MAAM;EACrB,eAAe;GACb,GAAG,MAAM;IACR,OAAO;EACV;CACF,CAAC;CAEH,OAAO,OAAO,OAAO,MAAM;GACxB,SAAS;EACV,SAAS,MAAM;EACf,eAAe,MAAM;EACrB,eAAe,MAAM;EACrB;EACA;EACA;CACF,CAAC;AACH;AAEA,MAAa,QACX,eAC0E;CAI1E,OAAO,YAAuD;EAC5D;EACA,SAAS,CAAC;EACV,eAAe,CAAC;EAChB,eAAe,CAAC;CAClB,CAAC;AACH"}

package/dist/index.js

@@ -12,9 +12,9 @@ import { GroupSpec_exports } from "./GroupSpec.js";
 import { MiddlewareSpec_exports } from "./MiddlewareSpec.js";
 import { PaginationError_exports } from "./PaginationError.js";
 import { Ref_exports } from "./Ref.js";
+import { Spec_exports } from "./Spec.js";
 import { Refs_exports } from "./Refs.js";
 import { SchemaToValidator_exports } from "./SchemaToValidator.js";
-import { Spec_exports } from "./Spec.js";
 import { SystemFields_exports } from "./SystemFields.js";
 import { Table_exports } from "./Table.js";
 import { Types_exports } from "./Types.js";

package/package.json

@@ -1,16 +1,16 @@
 {
   "name": "@confect/core",
   "description": "Shared specs and schemas used by all Confect packages",
-  "version": "10.0.0-next.22",
+  "version": "10.0.0-next.24",
   "author": "RJ Dellecese",
   "bugs": {
     "url": "https://github.com/rjdellecese/confect/issues"
   },
   "devDependencies": {
-    "@effect/vitest": "4.0.0-rc.115",
+    "@effect/vitest": "4.0.0-rc.117",
     "@types/node": "24.13.3",
     "confect-bench-harness": "0.0.0",
-    "effect": "4.0.0-rc.115",
+    "effect": "4.0.0-rc.117",
     "tsdown": "0.23.0",
     "tsx": "4.23.13",
     "typescript": "7.0.2",
@@ -51,7 +51,7 @@
   "module": "./dist/index.js",
   "peerDependencies": {
     "convex": "^1.32.0",
-    "effect": "^4.0.0-rc.115"
+    "effect": "^4.0.0-rc.117"
   },
   "repository": {
     "type": "git",
@@ -65,6 +65,7 @@
     "clean": "shx rm -rf dist coverage node_modules",
     "dev": "tsdown --watch --no-clean --config-loader unrun",
     "test": "vitest run",
-    "typecheck": "tsc -b tsconfig.src.json"
+    "typecheck": "tsc -b tsconfig.src.json",
+    "typecheck:inexact": "tsc --noEmit --project tsconfig.json --exactOptionalPropertyTypes false"
   }
 }

package/src/FunctionProvenance.ts

@@ -27,7 +27,9 @@ export interface ArgsSchema<
   readonly fields: ArgsFields_;
 }
 
-/** Erased structural view used after the exact field map is no longer needed. */
+/**
+ * Erased structural view used after the exact field map is no longer needed.
+ */
 export type AnyArgsSchema = ArgsSchema<ArgsFields>;
 
 export type FunctionProvenance = Data.TaggedEnum<{
@@ -44,12 +46,11 @@ export type FunctionProvenance = Data.TaggedEnum<{
 }>;
 
 /**
- * The declaration shape of a Confect function—orthogonal to both the
- * provenance origin (Confect vs Convex) and the function type
- * (query/mutation/action). A `Standard` function declares its args fields and
- * returns schema directly; a `Paginated` function declares user-args fields
- * and an item schema from which the Convex-facing `args`/`returns` are
- * composed.
+ * The declaration shape of a Confect function—orthogonal to both the provenance
+ * origin (Confect vs Convex) and the function type (query/mutation/action). A
+ * `Standard` function declares its args fields and returns schema directly; a
+ * `Paginated` function declares user-args fields and an item schema from which
+ * the Convex-facing `args`/`returns` are composed.
  */
 export type ConfectKind = Standard | Paginated;
 
@@ -62,11 +63,17 @@ export interface Paginated<
   Item extends Schema.Codec<any, any> = Schema.Codec<any, any>,
 > {
   readonly _tag: "Paginated";
-  /** User-declared args—no `paginationOpts`. */
+  /**
+   * User-declared args—no `paginationOpts`.
+   */
   readonly userArgs: ArgsSchema<UserArgsFields_>;
-  /** Page element schema. */
+  /**
+   * Page element schema.
+   */
   readonly item: Item;
-  /** Mutable array of items—the page decode target. */
+  /**
+   * Mutable array of items—the page decode target.
+   */
   readonly page: Schema.Codec<any, any>;
 }
 
@@ -105,18 +112,20 @@ export const FunctionProvenance = Data.taggedEnum<FunctionProvenance>();
 const Standard: Standard = { _tag: "Standard" };
 
 /**
- * Build a `Confect` provenance from lazy args-fields and schema thunks.
- * `args`, `returns`, and `error` are exposed as sync lazy memoised getters
- * (via {@link Lazy.defineProperty}) that only evaluate their thunk on first
- * access, mirroring how `Table` defers `Fields`/`Doc`. This keeps importing the
- * assembled `_generated/spec.ts` cheap—no `Schema.Struct(...)`/`Schema.Array(...)` work runs at module load; it is deferred to the first
- * invocation that actually compiles validators or runs a codec.
+ * Build a `Confect` provenance from lazy args-fields and schema thunks. `args`,
+ * `returns`, and `error` are exposed as sync lazy memoised getters (via
+ * {@link Lazy.defineProperty}) that only evaluate their thunk on first access,
+ * mirroring how `Table` defers `Fields`/`Doc`. This keeps importing the
+ * assembled `_generated/spec.ts` cheap—no
+ * `Schema.Struct(...)`/`Schema.Array(...)` work runs at module load; it is
+ * deferred to the first invocation that actually compiles validators or runs a
+ * codec.
  *
  * The object is built by hand rather than through `FunctionProvenance.Confect`
  * because the `Data` constructor copies its input with `Object.assign`, which
- * would force the getters at construction time and defeat the laziness.
- * `error` is only installed when an `errorThunk` is provided, so its absence
- * is observable via `"error" in provenance` without forcing anything; nothing
+ * would force the getters at construction time and defeat the laziness. `error`
+ * is only installed when an `errorThunk` is provided, so its absence is
+ * observable via `"error" in provenance` without forcing anything; nothing
  * relies on `Data`'s structural `Equal`/`Hash` for provenance values.
  */
 export const Confect = <
@@ -140,8 +149,8 @@ export const Confect = <
 };
 
 /**
- * The composed args schema of a paginated query: the user-declared fields
- * plus the `paginationOpts` field managed by Convex's pagination protocol.
+ * The composed args schema of a paginated query: the user-declared fields plus
+ * the `paginationOpts` field managed by Convex's pagination protocol.
  *
  * The fields-first representation keeps the user-declared map available for
  * type-level composition without reconstructing it from an erased schema.
@@ -156,8 +165,8 @@ export type PaginatedArgs<UserArgsFields extends ArgsFields> = Schema.Struct<
 >;
 
 /**
- * The composed returns schema of a paginated query: a `PaginationResult` of
- * the item schema. Same deferred-conditional device as {@link PaginatedArgs}.
+ * The composed returns schema of a paginated query: a `PaginationResult` of the
+ * item schema. Same deferred-conditional device as {@link PaginatedArgs}.
  */
 export type PaginatedReturns<Item extends Schema.Codec<any, any>> =
   PaginationResult.PaginationResult<Item> extends infer ComposedReturns extends
@@ -182,8 +191,8 @@ export interface AnyConfectPaginated extends AnyConfect {
 
 /**
  * Build the provenance of a paginated query from lazy schema thunks, with the
- * same laziness contract as {@link Confect}. The user-facing schemas live on
- * the `Paginated` kind (`kind.userArgs`, `kind.item`, `kind.page`)—the kind
+ * same laziness contract as {@link Confect}. The user-facing schemas live on the
+ * `Paginated` kind (`kind.userArgs`, `kind.item`, `kind.page`)—the kind
  * container is built eagerly (it is cheap) while the schemas inside it stay
  * lazy. The composed Convex-facing `args`/`returns` are derived lazily from
  * them: `args` spreads the user fields plus `paginationOpts`, and `returns`

package/src/FunctionSpec.ts

@@ -141,7 +141,9 @@ export type Name<FunctionSpec_ extends AnyWithProps> = FunctionSpec_["name"];
 export type MiddlewareSpecs<FunctionSpec_ extends AnyWithProps> =
   FunctionSpec_["middlewareSpecs"][number];
 
-/** The field map declared by a Confect-provenance spec. */
+/**
+ * The field map declared by a Confect-provenance spec.
+ */
 export type ArgsFields<FunctionSpec_ extends AnyWithProps> =
   FunctionSpec_ extends {
     readonly functionProvenance: {
@@ -157,7 +159,9 @@ export type ArgsFields<FunctionSpec_ extends AnyWithProps> =
       ? FunctionProvenance.ArgsFields
       : never;
 
-/** The args schema assembled from a Confect-provenance spec's field map. */
+/**
+ * The args schema assembled from a Confect-provenance spec's field map.
+ */
 export type ArgsSchema<FunctionSpec_ extends AnyWithProps> =
   FunctionSpec_ extends {
     readonly functionProvenance: {
@@ -191,10 +195,10 @@ export type ErrorSchema<FunctionSpec_ extends AnyWithProps> =
   FunctionSpec_ extends {
     readonly functionProvenance: {
       readonly _tag: "Confect";
-      readonly error?: infer ErrorSchema_ extends Schema.Codec<any, any>;
+      readonly error?: infer ErrorSchema_;
     };
   }
-    ? ErrorSchema_
+    ? Extract<ErrorSchema_, Schema.Codec<any, any>>
     : never;
 
 export type Args<FunctionSpec_ extends AnyWithProps> = FunctionSpec_ extends {
@@ -395,10 +399,10 @@ const make = <
 };
 
 /**
- * `Schema.Struct` fields that must not declare `paginationOpts`. Used to
- * reject a user args schema that redeclares the field the paginated
- * constructors add themselves; the check reports at the `args` thunk with an
- * unsatisfiable type when violated.
+ * `Schema.Struct` fields that must not declare `paginationOpts`. Used to reject
+ * a user args schema that redeclares the field the paginated constructors add
+ * themselves; the check reports at the `args` thunk with an unsatisfiable type
+ * when violated.
  */
 type ForbidPaginationOpts<
   UserArgsFields extends FunctionProvenance.ArgsFields,

package/src/GroupPath.ts

@@ -4,7 +4,8 @@ import type * as GroupSpec from "./GroupSpec";
  * Recursively generates paths for a group and its nested groups.
  *
  * - For a group with no subgroups, returns just the group name.
- * - For a group with subgroups, returns the group name plus all possible paths through its direct subgroups.
+ * - For a group with subgroups, returns the group name plus all possible paths
+ *   through its direct subgroups.
  */
 export type All<
   Group extends GroupSpec.AnyWithProps,
@@ -26,13 +27,11 @@ type AllHelper<
   : never;
 
 /**
- * Recursively extracts the group at the given dot-separated path.
- * Path must match the format defined in `Path` above, e.g. "group" or "group.subgroup".
+ * Recursively extracts the group at the given dot-separated path. Path must
+ * match the format defined in `Path` above, e.g. "group" or "group.subgroup".
  *
  * @example
- * ```ts
- * type G = WithPath<RootGroup, "group.subgroup">;
- * ```
+ *   type G = WithPath<RootGroup, "group.subgroup">;
  */
 export type GroupAt<
   Group,

package/src/GroupSpec.ts

@@ -129,7 +129,10 @@ export type WithName<
   Name_ extends Name<Group>,
 > = Extract<Group, { readonly name: Name_ }>;
 
-/** Assigns a segment name to a leaf group created with {@link make} for typing and refs. */
+/**
+ * Assigns a segment name to a leaf group created with {@link make} for typing
+ * and refs.
+ */
 export type NamedAt<Group extends Any, Name_ extends string> = Omit<
   Group,
   "name"
@@ -349,10 +352,11 @@ export const makeNodeAt = <const Name_ extends string>(
   });
 };
 
-export const withName = <const Name_ extends string>(
+export function withName<const Name_ extends string, Group extends Any>(
   name: Name_,
-  group: Any,
-): AnyWithProps => {
+  group: Group,
+): NamedAt<Group, Name_>;
+export function withName(name: string, group: Any): AnyWithProps {
   validateConfectFunctionIdentifier(name);
   const group_ = group as AnyWithProps;
 
@@ -367,7 +371,7 @@ export const withName = <const Name_ extends string>(
     groups: group_.groups,
     middlewareAttachments: group_.middlewareAttachments,
   });
-};
+}
 
 export const validateMiddleware = (
   group: AnyWithProps,

package/src/Identifier.ts

@@ -95,15 +95,16 @@ export const validateConfectFunctionIdentifier = (identifier: string) => {
 };
 
 /**
- * Validate that `identifier` is suitable as a Convex table name (and, equivalently,
- * as a `confect/tables/<identifier>.ts` filename).
+ * Validate that `identifier` is suitable as a Convex table name (and,
+ * equivalently, as a `confect/tables/<identifier>.ts` filename).
  *
  * Rules:
+ *
  * - Must match `/^[A-Za-z][A-Za-z0-9_]*$/`—letter-leading, alphanumeric plus
  *   underscore. No `$` (not a valid Convex table name character); no leading
  *   `_` (Convex reserves `_<name>` for its system tables).
- * - Must not be a reserved JavaScript identifier, so the name can also be used
- *   as a binding name in generated code without escaping.
+ * - Must not be a reserved JavaScript identifier, so the name can also be used as
+ *   a binding name in generated code without escaping.
  */
 export const validateConfectTableIdentifier = (identifier: string) => {
   if (!matchesTableNamePattern(identifier)) {

package/src/Lazy.ts

@@ -1,20 +1,19 @@
 /**
  * Install a lazy memoised property on `target`. The first access runs
- * `compute()` and replaces the getter with a plain, non-writable data
- * property whose value is the computed result. Subsequent accesses hit
- * the V8 fast path for own data properties—no function call, identical
- * returned reference—so first and second-and-subsequent accesses are
- * observably indistinguishable.
+ * `compute()` and replaces the getter with a plain, non-writable data property
+ * whose value is the computed result. Subsequent accesses hit the V8 fast path
+ * for own data properties—no function call, identical returned reference—so
+ * first and second-and-subsequent accesses are observably indistinguishable.
  *
- * The replacement property is `enumerable: true` so the lazy property
- * still participates in `Object.keys`/`JSON.stringify` after it
- * materialises, matching the shape of a plain data property. The property
- * is also `enumerable` before materialising, so presence checks
- * (`"key" in target`, `Object.hasOwn(target, key)`) observe it without
- * forcing the computation.
+ * The replacement property is `enumerable: true` so the lazy property still
+ * participates in `Object.keys`/`JSON.stringify` after it materialises,
+ * matching the shape of a plain data property. The property is also
+ * `enumerable` before materialising, so presence checks (`"key" in target`,
+ * `Object.hasOwn(target, key)`) observe it without forcing the computation.
  *
  * This is the single shared implementation consumed across packages (e.g.
- * `@confect/core`'s lazy `FunctionSpec` schemas and lazy `Table` `Fields`/`Doc`), so there is no chance of the two drifting apart.
+ * `@confect/core`'s lazy `FunctionSpec` schemas and lazy `Table`
+ * `Fields`/`Doc`), so there is no chance of the two drifting apart.
  */
 export const defineProperty = <T extends object, K extends PropertyKey>(
   target: T,