cvx-kit 0.1.17 → 0.1.19

package/dist/querying/relationships.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"relationships.mjs","names":["RelationshipError","code","assertRelationshipDepth","nested","selection","depth","relationshipExecutor","metadata","planner","navigation","z","base","leg","edge","declared","table","name","guarded","guard","row","lookup","index","field","position","i","key","relationIndex","indexes","bound","plan","usable","length","size","condition","conditions","c","chosen","candidates","b","a","relationPrefix","prefix","get","id","request","result","targets","value","target","iterator","range","q","binding","next","permitted","traverse","parent","junction","one","match","matches","ast","scalarMatches","child","output","dto","selected","args","path","parents","pageRelation","prepare","guardConstraint","input","constraints","from","to","through","sourceTable","targetIndex","rootBinding","rootId","open","codec","token","CursorError","prepared","opened","lookupPlan","indexedTarget","executeStream","schema","raw","nativeSchema","fields","getIndexFields","source","reference","EmptyStream","stream","db","continuation","rootTable","declarations","declaration","final","start","end","ancestors","found","error","rethrowQueryError"],"sources":["../../src/querying/relationships.ts"],"sourcesContent":["import type { GenericSchema, SchemaDefinition, IndexRangeBuilder } from 'convex/server'\nimport type { GenericId, Value } from 'convex/values'\nimport type { RelationEdge, RelationGuard } from '../relations'\nimport type { createPlanner, QueryInput, StoredConstraint } from './planner'\nimport { scalarMatches } from './planner'\nimport type {\n\tFilterAst,\n\tFilterScalar,\n\tIndexCondition,\n\tNativePagination,\n\tQueryIndex,\n} from './filters'\nimport { executeStream, rethrowQueryError, type ExecutionRequest } from './execution'\nimport type { createCursorCodec, CursorBinding } from './cursors'\nimport { CursorError } from './cursors'\nimport { z } from 'zod'\nimport { stream, EmptyStream, getIndexFields } from 'convex-helpers/server/stream'\n\nexport interface OutputSelection {\n\t[name: string]: true | OutputSelection\n}\ntype Edge = RelationEdge<string, string, 'one' | 'many', any, any>\nexport type RelationDocument = Record<string, Value> & {\n\t_id: GenericId<string>\n\t_creationTime: number\n}\ntype Document = RelationDocument\ntype Planner = ReturnType<typeof createPlanner>\n\nexport class RelationshipError extends Error {\n\tconstructor(readonly code: 'AMBIGUOUS_RELATION' | 'INVALID_RELATION') {\n\t\tsuper(code)\n\t\tthis.name = 'RelationshipError'\n\t}\n}\n\n/** The selection has already passed the registry validator; count leaf edges too. */\nexport function assertRelationshipDepth(selection: OutputSelection, depth: number): void {\n\tfor (const nested of Object.values(selection)) {\n\t\tif (depth >= 4) throw new RelationshipError('INVALID_RELATION')\n\t\tif (nested !== true) assertRelationshipDepth(nested, depth + 1)\n\t}\n}\n\n/** One request owns all traversal and authorized ID memoization. No raw reader escapes. */\nexport function relationshipExecutor(\n\tschema: SchemaDefinition<GenericSchema, boolean>,\n\trequest: ExecutionRequest,\n\tplanner: Planner,\n\tcodec: ReturnType<typeof createCursorCodec>,\n\trootBinding: CursorBinding,\n) {\n\tconst metadata = planner.metadata\n\tconst navigation = z\n\t\t.object({ cursor: z.string(), ancestors: z.array(z.string()).max(3) })\n\t\t.strict()\n\tconst base = (leg: Edge['from']) => ('base' in leg ? leg.base : leg)\n\tfunction edge(table: string, name: string): Edge {\n\t\tplanner.assertUnchanged()\n\t\tconst declared = metadata.declarations[table]?.[name]\n\t\tif (!declared) throw new RelationshipError('INVALID_RELATION')\n\t\treturn declared\n\t}\n\tconst guarded = (row: Document | Record<string, Value>, guard?: RelationGuard) =>\n\t\t!guard || row[guard.discriminator] === guard.tag\n\tfunction lookup(table: string, field: string, guard?: RelationGuard) {\n\t\tconst index =\n\t\t\tfield === '_id'\n\t\t\t\t? { name: 'by_id', fields: ['_id'] }\n\t\t\t\t: metadata.tables[table].indexes.find((i) => {\n\t\t\t\t\t\tconst position = i.fields.indexOf(field)\n\t\t\t\t\t\treturn (\n\t\t\t\t\t\t\tposition >= 0 &&\n\t\t\t\t\t\t\ti.fields.slice(0, position).every((key) => key === guard?.discriminator)\n\t\t\t\t\t\t)\n\t\t\t\t\t})\n\t\tif (!index) throw new RelationshipError('INVALID_RELATION')\n\t\treturn index\n\t}\n\tfunction relationIndex(\n\t\ttable: string,\n\t\tfield: string,\n\t\tplan: ReturnType<Planner['plan']>,\n\t\tconditions: readonly IndexCondition[],\n\t\tguard?: RelationGuard,\n\t): QueryIndex {\n\t\tconst indexes =\n\t\t\tfield === '_id' ? [{ name: 'by_id', fields: ['_id'] }] : metadata.tables[table].indexes\n\t\tconst bound = (key: string) =>\n\t\t\tkey === field || key === guard?.discriminator || plan.bindings.has(key)\n\t\tconst usable = (index: QueryIndex) =>\n\t\t\tindex.fields.includes(field) &&\n\t\t\tindex.fields.slice(0, index.fields.indexOf(field)).every(bound)\n\t\tconst length = (index: QueryIndex) => {\n\t\t\tlet size = 0\n\t\t\tfor (const key of index.fields) {\n\t\t\t\tif (!bound(key)) break\n\t\t\t\tsize++\n\t\t\t}\n\t\t\treturn size\n\t\t}\n\t\tconst condition = conditions.find((c) => c.value !== null && c.value !== undefined)\n\t\tif (condition) {\n\t\t\tconst chosen = indexes.find((i) => i.name === condition.index && usable(i))\n\t\t\tif (!chosen)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Explicit index \"${condition.index}\" is incompatible with declared relationship lookup`,\n\t\t\t\t)\n\t\t\treturn chosen\n\t\t}\n\t\tconst candidates = indexes\n\t\t\t.filter(usable)\n\t\t\t.sort(\n\t\t\t\t(a, b) =>\n\t\t\t\t\tlength(b) - length(a) ||\n\t\t\t\t\ta.name.localeCompare(b.name) ||\n\t\t\t\t\ta.fields.join('\\0').localeCompare(b.fields.join('\\0')),\n\t\t\t)\n\t\tif (!candidates.length) throw new RelationshipError('INVALID_RELATION')\n\t\treturn candidates[0]\n\t}\n\tfunction relationPrefix(\n\t\tindex: QueryIndex,\n\t\tfield: string,\n\t\tvalue: FilterScalar,\n\t\tplan?: ReturnType<Planner['plan']>,\n\t\tguard?: RelationGuard,\n\t) {\n\t\tconst prefix: { field: string; value: FilterScalar }[] = []\n\t\tfor (const key of index.fields) {\n\t\t\tif (key === field) prefix.push({ field: key, value })\n\t\t\telse if (key === guard?.discriminator) prefix.push({ field: key, value: guard.tag })\n\t\t\telse if (plan?.bindings.has(key)) prefix.push({ field: key, value: plan.bindings.get(key)! })\n\t\t\telse break\n\t\t}\n\t\treturn prefix\n\t}\n\n\tasync function get(table: string, id: Value | undefined): Promise<Document | null> {\n\t\tplanner.beforeLeaf(table)\n\t\t// SAFETY: native normalization rejects non-string/non-table IDs before any read.\n\t\tif (id == null || !request.db.normalizeId(table, id as string)) return null\n\t\t// SAFETY: normalizeId verifies the declared native table before the authorized metered get.\n\t\tconst result = await request.db.get(table, id as GenericId<string>)\n\t\tplanner.assertUnchanged()\n\t\tif (result) planner.validateDocument(table, result)\n\t\t// SAFETY: normalizeId checked the table; the authorized native get retains system fields.\n\t\treturn result as Document | null\n\t}\n\tasync function* targets(\n\t\ttable: string,\n\t\tfield: string,\n\t\tvalue: Value | undefined,\n\t\tdepth: number,\n\t\tguard?: RelationGuard,\n\t): AsyncGenerator<Document> {\n\t\trequest.expand(depth, 0)\n\t\tif (value == null) return\n\t\tif (field === '_id') {\n\t\t\tconst target = await get(table, value)\n\t\t\tif (target && guarded(target, guard)) {\n\t\t\t\trequest.expand(depth)\n\t\t\t\tyield target\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t\tplanner.beforeLeaf(table)\n\t\tconst index = lookup(table, field, guard)\n\t\t// SAFETY: registry validates the indexed native lookup prefix and compatible values.\n\t\tconst source = request.leafQuery(table).withIndex(index.name, (q) => {\n\t\t\t// SAFETY: registration checks the mandatory join and every preceding guard equality.\n\t\t\tlet range = q as IndexRangeBuilder<any, string[], number>\n\t\t\t// SAFETY: registered relation fields are native scalars; each equality advances the consecutive checked prefix.\n\t\t\tfor (const binding of relationPrefix(index, field, value as FilterScalar, undefined, guard)) {\n\t\t\t\t// SAFETY: the prefix comes from the declared index and registry-owned guard.\n\t\t\t\trange = range.eq(binding.field, binding.value) as IndexRangeBuilder<any, string[], number>\n\t\t\t}\n\t\t\treturn range\n\t\t})\n\t\tconst iterator = source[Symbol.asyncIterator]()\n\t\ttry {\n\t\t\twhile (true) {\n\t\t\t\tplanner.assertUnchanged()\n\t\t\t\tplanner.beforeLeaf(table)\n\t\t\t\tconst next = await iterator.next()\n\t\t\t\tplanner.assertUnchanged()\n\t\t\t\tif (next.done) return\n\t\t\t\tconst permitted = await request.authorize(table, next.value)\n\t\t\t\t// Denials are an await boundary too; never hide them inside an authorized iterator.\n\t\t\t\tplanner.assertUnchanged()\n\t\t\t\tif (!permitted) continue\n\t\t\t\tplanner.validateDocument(table, next.value)\n\t\t\t\tif (!guarded(next.value, guard)) continue\n\t\t\t\trequest.expand(depth)\n\t\t\t\t// SAFETY: native rows include system fields and explicit authorization just completed.\n\t\t\t\tyield next.value as Document\n\t\t\t}\n\t\t} finally {\n\t\t\tawait iterator.return?.()\n\t\t}\n\t}\n\tasync function* traverse(\n\t\tdeclared: Edge,\n\t\tparent: Document,\n\t\tdepth: number,\n\t): AsyncGenerator<Document> {\n\t\trequest.expand(depth, 0)\n\t\tif (!guarded(parent, declared.sourceGuard)) return\n\t\tconst value = parent[base(declared.from).field]\n\t\tif (value == null) return\n\t\tif ('base' in declared.from && 'base' in declared.to) {\n\t\t\tfor await (const junction of targets(\n\t\t\t\tdeclared.from.junction.table,\n\t\t\t\tdeclared.from.junction.field,\n\t\t\t\tvalue,\n\t\t\t\tdepth,\n\t\t\t\tdeclared.junctionGuard,\n\t\t\t))\n\t\t\t\tyield* targets(\n\t\t\t\t\tdeclared.target,\n\t\t\t\t\tdeclared.to.base.field,\n\t\t\t\t\tjunction[declared.to.junction.field],\n\t\t\t\t\tdepth,\n\t\t\t\t\tdeclared.targetGuard,\n\t\t\t\t)\n\t\t} else\n\t\t\tyield* targets(declared.target, base(declared.to).field, value, depth, declared.targetGuard)\n\t}\n\tasync function one(declared: Edge, parent: Document, depth: number) {\n\t\tlet match: Document | null = null\n\t\tfor await (const target of traverse(declared, parent, depth)) {\n\t\t\tif (match) throw new RelationshipError('AMBIGUOUS_RELATION')\n\t\t\tmatch = target\n\t\t}\n\t\treturn match\n\t}\n\tasync function matches(\n\t\ttable: string,\n\t\tparent: Document,\n\t\tast: FilterAst,\n\t\tdepth = 0,\n\t): Promise<boolean> {\n\t\trequest.expand(depth, 0)\n\t\tplanner.assertUnchanged()\n\t\tplanner.validateDocument(table, parent)\n\t\tif (ast.kind === 'variant')\n\t\t\treturn parent[ast.discriminator] === ast.tag && matches(table, parent, ast.child, depth)\n\t\tif (ast.kind === 'scalar') return scalarMatches(ast, parent)\n\t\tif (ast.kind === 'not') return !(await matches(table, parent, ast.child, depth))\n\t\tif (ast.kind === 'and' || ast.kind === 'or') {\n\t\t\tfor (const child of ast.children) {\n\t\t\t\tconst result = await matches(table, parent, child, depth)\n\t\t\t\tif (ast.kind === 'and' && !result) return false\n\t\t\t\tif (ast.kind === 'or' && result) return true\n\t\t\t}\n\t\t\treturn ast.kind === 'and'\n\t\t}\n\t\tif (ast.kind !== 'relation') throw new RelationshipError('INVALID_RELATION')\n\t\tconst declared = edge(table, ast.name)\n\t\tif (ast.mode === 'one') {\n\t\t\tconst target = await one(declared, parent, depth + 1)\n\t\t\treturn ast.predicate === null\n\t\t\t\t? target === null\n\t\t\t\t: target !== null && (await matches(declared.target, target, ast.predicate, depth + 1))\n\t\t}\n\t\tfor await (const target of traverse(declared, parent, depth + 1))\n\t\t\tif (await matches(declared.target, target, ast.predicate!, depth + 1))\n\t\t\t\treturn ast.mode === 'some'\n\t\t// Only actual authorized traversal exhaustion proves none.\n\t\treturn ast.mode === 'none'\n\t}\n\tasync function output(\n\t\ttable: string,\n\t\tparent: Document,\n\t\tselection: OutputSelection,\n\t\targs: NativePagination & { order?: 'asc' | 'desc' },\n\t\tpath: readonly string[] = [],\n\t\tdepth = 0,\n\t\tparents: readonly string[] = [],\n\t): Promise<Record<string, Value>> {\n\t\trequest.expand(depth, 0)\n\t\t// SAFETY: the registry strictly validates this public native DTO projection.\n\t\tconst dto = planner.complete(table, parent, true, { kind: 'and', children: [] }) as Record<\n\t\t\tstring,\n\t\t\tValue\n\t\t>\n\t\tfor (const [name, selected] of Object.entries(selection)) {\n\t\t\tconst declared = edge(table, name),\n\t\t\t\tnested = selected === true ? {} : selected\n\t\t\tif (declared.cardinality === 'one') {\n\t\t\t\tconst target = await one(declared, parent, depth + 1)\n\t\t\t\tdto[name] = target\n\t\t\t\t\t? await output(declared.target, target, nested, args, [...path, name], depth + 1, [\n\t\t\t\t\t\t\t...parents,\n\t\t\t\t\t\t\tparent._id,\n\t\t\t\t\t\t])\n\t\t\t\t\t: null\n\t\t\t} else {\n\t\t\t\tconst page = await pageRelation(\n\t\t\t\t\ttable,\n\t\t\t\t\tparent,\n\t\t\t\t\tname,\n\t\t\t\t\tnested,\n\t\t\t\t\t{ numItems: args.numItems, cursor: null, order: args.order },\n\t\t\t\t\t[],\n\t\t\t\t\t[],\n\t\t\t\t\t[...path, name],\n\t\t\t\t\tdepth + 1,\n\t\t\t\t\t[...parents, parent._id],\n\t\t\t\t)\n\t\t\t\t// SAFETY: the declared page validator has parsed this nested DTO page.\n\t\t\t\tdto[name] = page as Value\n\t\t\t}\n\t\t}\n\t\treturn dto\n\t}\n\tfunction prepare(\n\t\ttable: string,\n\t\tname: string,\n\t\tselection: OutputSelection,\n\t\tinput: QueryInput,\n\t\tconditions: readonly IndexCondition[],\n\t\tconstraints: readonly StoredConstraint[],\n\t\tpath: readonly string[],\n\t\trootId: string,\n\t) {\n\t\tplanner.page(edge(table, name).target, selection)\n\t\tassertRelationshipDepth(selection, path.length)\n\t\tconst declared = edge(table, name)\n\t\tif (declared.cardinality !== 'many') throw new RelationshipError('INVALID_RELATION')\n\t\tconst guardConstraint = declared.targetGuard\n\t\t\t? { fields: { [declared.targetGuard.discriminator]: declared.targetGuard.tag } }\n\t\t\t: undefined\n\t\tconst plan = planner.plan(\n\t\t\tdeclared.target,\n\t\t\tinput,\n\t\t\t[],\n\t\t\tguardConstraint ? [...constraints, guardConstraint] : constraints,\n\t\t)\n\t\tconst from = declared.from,\n\t\t\tto = declared.to\n\t\tconst through =\n\t\t\t'base' in from && 'base' in to\n\t\t\t\t? {\n\t\t\t\t\t\ttable: from.junction.table,\n\t\t\t\t\t\tfield: from.junction.field,\n\t\t\t\t\t\ttargetField: to.base.field,\n\t\t\t\t\t\ttargetReference: to.junction.field,\n\t\t\t\t\t}\n\t\t\t\t: null\n\t\tconst sourceTable = through ? through.table : declared.target\n\t\tconst field = through ? through.field : base(to).field\n\t\tconst targetIndex = relationIndex(\n\t\t\tdeclared.target,\n\t\t\tthrough ? through.targetField : field,\n\t\t\tplan,\n\t\t\tconditions,\n\t\t\tdeclared.targetGuard,\n\t\t)\n\t\tconst index = through ? lookup(sourceTable, field, declared.junctionGuard) : targetIndex\n\t\t// SAFETY: planner.page validated the complete output mask before cursor binding.\n\t\tconst binding: CursorBinding = {\n\t\t\t...rootBinding,\n\t\t\ttable: sourceTable,\n\t\t\tindex: index.name,\n\t\t\torder: plan.args.order ?? 'asc',\n\t\t\tclientFilters: plan.clientIdentity,\n\t\t\tserverFilters: {\n\t\t\t\tpredicates: plan.serverIdentity,\n\t\t\t\tselection: selection as Value,\n\t\t\t\tscope: { ...request.scope },\n\t\t\t\trootTable: rootBinding.table,\n\t\t\t\tlookupIndex: targetIndex.name,\n\t\t\t\tguards: {\n\t\t\t\t\tsource: declared.sourceGuard ? { ...declared.sourceGuard } : null,\n\t\t\t\t\ttarget: declared.targetGuard ? { ...declared.targetGuard } : null,\n\t\t\t\t\tjunction: declared.junctionGuard ? { ...declared.junctionGuard } : null,\n\t\t\t\t},\n\t\t\t},\n\t\t\trelationPath: path,\n\t\t\tparent: rootId,\n\t\t}\n\t\tfunction open(token: string) {\n\t\t\ttry {\n\t\t\t\treturn navigation.parse(JSON.parse(codec.open(token, binding)))\n\t\t\t} catch {\n\t\t\t\tthrow new CursorError()\n\t\t\t}\n\t\t}\n\t\treturn { declared, plan, through, sourceTable, field, index, targetIndex, binding, open }\n\t}\n\tasync function pageRelation(\n\t\ttable: string,\n\t\tparent: Document | null,\n\t\tname: string,\n\t\tselection: OutputSelection,\n\t\tinput: QueryInput,\n\t\tconditions: readonly IndexCondition[] = [],\n\t\tconstraints: readonly StoredConstraint[] = [],\n\t\tpath: readonly string[] = [name],\n\t\tdepth = 1,\n\t\tparents: readonly string[] = [],\n\t\tprepared = prepare(\n\t\t\ttable,\n\t\t\tname,\n\t\t\tselection,\n\t\t\tinput,\n\t\t\tconditions,\n\t\t\tconstraints,\n\t\t\tpath,\n\t\t\tparents[0] ?? parent!._id,\n\t\t),\n\t\topened?: { cursor: string | null; endCursor?: string | null },\n\t) {\n\t\trequest.expand(depth, 0)\n\t\tconst { declared, plan, through, sourceTable, field, index, targetIndex, binding } = prepared\n\t\tconst value =\n\t\t\tparent && guarded(parent, declared.sourceGuard)\n\t\t\t\t? parent[base(declared.from).field]\n\t\t\t\t: undefined\n\t\tconst args = { ...plan.args, ...(opened ?? { cursor: null }) }\n\t\t// SAFETY: declarations accept only native scalar lookup values; nullish references are absence.\n\t\tconst lookupPlan = {\n\t\t\t...plan,\n\t\t\tindex,\n\t\t\tprefix:\n\t\t\t\tvalue == null\n\t\t\t\t\t? []\n\t\t\t\t\t: through\n\t\t\t\t\t\t? relationPrefix(index, field, value as FilterScalar, undefined, declared.junctionGuard)\n\t\t\t\t\t\t: relationPrefix(index, field, value as FilterScalar, plan, declared.targetGuard),\n\t\t\tunsatisfiable: value == null || plan.unsatisfiable,\n\t\t}\n\t\tconst indexedTarget = through && through.targetField !== '_id'\n\t\tconst result = await executeStream(\n\t\t\tschema,\n\t\t\trequest,\n\t\t\tsourceTable,\n\t\t\tlookupPlan,\n\t\t\tplanner,\n\t\t\tcodec,\n\t\t\tbinding,\n\t\t\targs,\n\t\t\tasync (row, permitted) => {\n\t\t\t\tif (permitted) planner.validateDocument(indexedTarget ? declared.target : sourceTable, row)\n\t\t\t\tif (!permitted || (through && !indexedTarget && !guarded(row, declared.junctionGuard)))\n\t\t\t\t\treturn null\n\t\t\t\trequest.expand(depth)\n\t\t\t\tlet target: Document | null\n\t\t\t\tif (through && !indexedTarget)\n\t\t\t\t\ttarget = await get(declared.target, row[through.targetReference])\n\t\t\t\telse {\n\t\t\t\t\t// SAFETY: native direct/flattened target streams retain validated system fields.\n\t\t\t\t\ttarget = row as Document\n\t\t\t\t}\n\t\t\t\tif (\n\t\t\t\t\t!target ||\n\t\t\t\t\t!guarded(target, declared.targetGuard) ||\n\t\t\t\t\t!(await matches(declared.target, target, plan.residual, depth))\n\t\t\t\t)\n\t\t\t\t\treturn null\n\t\t\t\treturn output(declared.target, target, selection, plan.args, path, depth, parents)\n\t\t\t},\n\t\t\t(raw) => codec.seal(JSON.stringify({ cursor: raw, ancestors: parents.slice(1) }), binding),\n\t\t\tindexedTarget\n\t\t\t\t? (source, db) => {\n\t\t\t\t\t\t// SAFETY: the registry owns the native schema/index descriptors. Public\n\t\t\t\t\t\t// helper flatMap concatenates native outer/inner keys and paginates them.\n\t\t\t\t\t\tconst nativeSchema = schema as SchemaDefinition<\n\t\t\t\t\t\t\tRecord<\n\t\t\t\t\t\t\t\tstring,\n\t\t\t\t\t\t\t\timport('convex/server').TableDefinition<any, Record<string, string[]>>\n\t\t\t\t\t\t\t>,\n\t\t\t\t\t\t\tboolean\n\t\t\t\t\t\t>\n\t\t\t\t\t\tconst fields = getIndexFields(declared.target, targetIndex.name, nativeSchema)\n\t\t\t\t\t\treturn source.flatMap(async (junction) => {\n\t\t\t\t\t\t\trequest.expand(depth)\n\t\t\t\t\t\t\tconst permitted = await request.authorize(sourceTable, junction)\n\t\t\t\t\t\t\tplanner.assertUnchanged()\n\t\t\t\t\t\t\tif (permitted) planner.validateDocument(sourceTable, junction)\n\t\t\t\t\t\t\tconst reference = junction[through.targetReference]\n\t\t\t\t\t\t\tif (!permitted || !guarded(junction, declared.junctionGuard) || reference == null)\n\t\t\t\t\t\t\t\treturn new EmptyStream(plan.args.order ?? 'asc', fields)\n\t\t\t\t\t\t\treturn stream(db, nativeSchema)\n\t\t\t\t\t\t\t\t.query(declared.target)\n\t\t\t\t\t\t\t\t.withIndex(targetIndex.name, (q) => {\n\t\t\t\t\t\t\t\t\t// SAFETY: registry validates the native leading lookup; validated filters supply each consecutive trailing binding.\n\t\t\t\t\t\t\t\t\tlet range = q as IndexRangeBuilder<any, string[], number>\n\t\t\t\t\t\t\t\t\t// SAFETY: junction references are native scalar Values validated by the declared lookup.\n\t\t\t\t\t\t\t\t\tconst prefix = relationPrefix(\n\t\t\t\t\t\t\t\t\t\ttargetIndex,\n\t\t\t\t\t\t\t\t\t\tthrough.targetField,\n\t\t\t\t\t\t\t\t\t\treference as FilterScalar,\n\t\t\t\t\t\t\t\t\t\tplan,\n\t\t\t\t\t\t\t\t\t\tdeclared.targetGuard,\n\t\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t\tfor (const binding of prefix) {\n\t\t\t\t\t\t\t\t\t\t// SAFETY: native eq advances the validated consecutive index prefix.\n\t\t\t\t\t\t\t\t\t\trange = range.eq(binding.field, binding.value) as IndexRangeBuilder<\n\t\t\t\t\t\t\t\t\t\t\tany,\n\t\t\t\t\t\t\t\t\t\t\tstring[],\n\t\t\t\t\t\t\t\t\t\t\tnumber\n\t\t\t\t\t\t\t\t\t\t>\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn range\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t\t.order(plan.args.order ?? 'asc')\n\t\t\t\t\t\t}, fields)\n\t\t\t\t\t}\n\t\t\t\t: undefined,\n\t\t\tindexedTarget ? declared.target : sourceTable,\n\t\t)\n\t\tplanner.assertUnchanged()\n\t\treturn planner.page(declared.target, selection).parse(result)\n\t}\n\tasync function continuation(\n\t\trootTable: string,\n\t\trootId: string,\n\t\tpath: readonly string[],\n\t\tselection: OutputSelection,\n\t\tinput: QueryInput,\n\t\tconditions: readonly IndexCondition[],\n\t\tconstraints: readonly StoredConstraint[],\n\t) {\n\t\tif (!path.length || path.length > 4 || !request.db.normalizeId(rootTable, rootId))\n\t\t\tthrow new RelationshipError('INVALID_RELATION')\n\t\tlet table = rootTable\n\t\tconst declarations = path.map((name) => {\n\t\t\tconst declaration = edge(table, name)\n\t\t\ttable = declaration.target\n\t\t\treturn declaration\n\t\t})\n\t\tconst final = declarations.at(-1)!\n\t\tconst prepared = prepare(\n\t\t\tfinal.source,\n\t\t\tpath.at(-1)!,\n\t\t\tselection,\n\t\t\tinput,\n\t\t\tconditions,\n\t\t\tconstraints,\n\t\t\tpath,\n\t\t\trootId,\n\t\t)\n\t\t// Authenticate both slots and native ancestor IDs before ANY parent/traversal read.\n\t\tconst start = input.cursor === null ? null : prepared.open(input.cursor)\n\t\tconst end = input.endCursor == null ? null : prepared.open(input.endCursor)\n\t\tconst ancestors = start?.ancestors ?? end?.ancestors ?? []\n\t\tif (\n\t\t\tancestors.length !== path.length - 1 ||\n\t\t\t(start && end && JSON.stringify(start.ancestors) !== JSON.stringify(end.ancestors)) ||\n\t\t\tancestors.some((id, i) => !request.db.normalizeId(declarations[i].target, id))\n\t\t)\n\t\t\tthrow new CursorError()\n\t\t// Declarative input/index/cursor validation above retains its pre-read errors,\n\t\t// just as on the root path. Every awaited read, ancestry proof and page is protected.\n\t\ttry {\n\t\t\tlet parent = await get(rootTable, rootId)\n\t\t\tfor (let i = 0; parent && i < ancestors.length; i++) {\n\t\t\t\tconst declared = declarations[i]\n\t\t\t\tlet found: Document | null = null\n\t\t\t\tif (declared.cardinality === 'one') {\n\t\t\t\t\tconst target = await one(declared, parent, i + 1)\n\t\t\t\t\tif (target?._id === ancestors[i]) found = target\n\t\t\t\t} else\n\t\t\t\t\tfor await (const target of traverse(declared, parent, i + 1)) {\n\t\t\t\t\t\tif (target._id === ancestors[i]) {\n\t\t\t\t\t\t\tfound = target\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tparent = found\n\t\t\t}\n\t\t\treturn await pageRelation(\n\t\t\t\tfinal.source,\n\t\t\t\tparent,\n\t\t\t\tpath.at(-1)!,\n\t\t\t\tselection,\n\t\t\t\tinput,\n\t\t\t\tconditions,\n\t\t\t\tconstraints,\n\t\t\t\tpath,\n\t\t\t\tpath.length,\n\t\t\t\t[rootId, ...ancestors],\n\t\t\t\tprepared,\n\t\t\t\t{ cursor: start?.cursor ?? null, endCursor: end?.cursor ?? input.endCursor },\n\t\t\t)\n\t\t} catch (error) {\n\t\t\trethrowQueryError(error)\n\t\t}\n\t}\n\treturn { matches, output, continuation, edge }\n}\n"],"mappings":"oRA6BA,IAAaA,EAAb,cAAuC,KAAM,CACvB,KAArB,YAAY,EAA0D,CACrE,MAAMC,CAAI,EADU,KAAA,KAAAA,EAEpB,KAAK,KAAO,mBACb,CACD,EAGA,SAAgBC,EAAwB,EAA4B,EAAqB,CACxF,IAAK,IAAMC,KAAU,OAAO,OAAOC,CAAS,EAAG,CAC9C,GAAIC,GAAS,EAAG,MAAM,IAAIL,EAAkB,kBAAkB,EAC1DG,IAAW,IAAMD,EAAwBC,EAAQE,EAAQ,CAAC,CAC/D,CACD,CAGA,SAAgBC,EACf,EACA,EACA,EACA,EACA,EACC,CACD,IAAMC,EAAWC,EAAQ,SACnBC,EAAaC,EACjB,OAAO,CAAE,OAAQA,EAAE,OAAO,EAAG,UAAWA,EAAE,MAAMA,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CACrE,OAAO,EACHC,EAAQ,GAAuB,SAAUC,EAAMA,EAAI,KAAOA,EAChE,SAASC,EAAK,EAAe,EAAoB,CAChDL,EAAQ,gBAAgB,EACxB,IAAMM,EAAWP,EAAS,aAAaQ,EAAM,GAAGC,GAChD,GAAI,CAACF,EAAU,MAAM,IAAId,EAAkB,kBAAkB,EAC7D,OAAOc,CACR,CACA,IAAMG,GAAW,EAAuC,IACvD,CAACC,GAASC,EAAID,EAAM,iBAAmBA,EAAM,IAC9C,SAASE,EAAO,EAAe,EAAe,EAAuB,CACpE,IAAMC,EACLC,IAAU,MACP,CAAE,KAAM,QAAS,OAAQ,CAAC,KAAK,CAAE,EACjCf,EAAS,OAAOQ,EAAM,CAAC,QAAQ,KAAM,GAAM,CAC3C,IAAMQ,EAAWC,EAAE,OAAO,QAAQF,CAAK,EACvC,OACCC,GAAY,GACZC,EAAE,OAAO,MAAM,EAAGD,CAAQ,CAAC,CAAC,MAAO,GAAQE,IAAQP,GAAO,aAAa,CAEzE,CAAC,EACJ,GAAI,CAACG,EAAO,MAAM,IAAIrB,EAAkB,kBAAkB,EAC1D,OAAOqB,CACR,CACA,SAASK,EACR,EACA,EACA,EACA,EACA,EACa,CACb,IAAMC,EACLL,IAAU,MAAQ,CAAC,CAAE,KAAM,QAAS,OAAQ,CAAC,KAAK,CAAE,CAAC,EAAIf,EAAS,OAAOQ,EAAM,CAAC,QAC3Ea,EAAS,GACdH,IAAQH,GAASG,IAAQP,GAAO,eAAiBW,EAAK,SAAS,IAAIJ,CAAG,EACjEK,EAAU,GACfT,EAAM,OAAO,SAASC,CAAK,GAC3BD,EAAM,OAAO,MAAM,EAAGA,EAAM,OAAO,QAAQC,CAAK,CAAC,CAAC,CAAC,MAAMM,CAAK,EACzDG,EAAU,GAAsB,CACrC,IAAIC,EAAO,EACX,IAAK,IAAMP,KAAOJ,EAAM,OAAQ,CAC/B,GAAI,CAACO,EAAMH,CAAG,EAAG,MACjB,GACD,CACA,OAAOO,CACR,EACMC,EAAYC,EAAW,KAAM,GAAMC,EAAE,QAAU,MAAQA,EAAE,QAAU,IAAA,EAAS,EAClF,GAAIF,EAAW,CACd,IAAMG,EAAST,EAAQ,KAAM,GAAMH,EAAE,OAASS,EAAU,OAASH,EAAON,CAAC,CAAC,EAC1E,GAAI,CAACY,EACJ,MAAU,MACT,mBAAmBH,EAAU,MAAM,oDACpC,EACD,OAAOG,CACR,CACA,IAAMC,EAAaV,EACjB,OAAOG,CAAM,CAAC,CACd,MACC,EAAG,IACHC,EAAOO,CAAC,EAAIP,EAAOQ,CAAC,GACpBA,EAAE,KAAK,cAAcD,EAAE,IAAI,GAC3BC,EAAE,OAAO,KAAK,IAAI,CAAC,CAAC,cAAcD,EAAE,OAAO,KAAK,IAAI,CAAC,CACvD,EACD,GAAI,CAACD,EAAW,OAAQ,MAAM,IAAIrC,EAAkB,kBAAkB,EACtE,OAAOqC,EAAW,EACnB,CACA,SAASG,EACR,EACA,EACA,EACA,EACA,EACC,CACD,IAAMC,EAAmD,CAAC,EAC1D,IAAK,IAAMhB,KAAOJ,EAAM,OACvB,GAAII,IAAQH,EAAOmB,EAAO,KAAK,CAAE,MAAOhB,EAAK,OAAM,CAAC,OAC/C,GAAIA,IAAQP,GAAO,cAAeuB,EAAO,KAAK,CAAE,MAAOhB,EAAK,MAAOP,EAAM,GAAI,CAAC,OAC9E,GAAIW,GAAM,SAAS,IAAIJ,CAAG,EAAGgB,EAAO,KAAK,CAAE,MAAOhB,EAAK,MAAOI,EAAK,SAAS,IAAIJ,CAAG,CAAG,CAAC,OACvF,MAEN,OAAOgB,CACR,CAEA,eAAeC,EAAI,EAAe,EAAiD,CAGlF,GAFAlC,EAAQ,WAAWO,CAAK,EAEpB4B,GAAM,MAAQ,CAACC,EAAQ,GAAG,YAAY7B,EAAO4B,CAAY,EAAG,OAAO,KAEvE,IAAME,EAAS,MAAMD,EAAQ,GAAG,IAAI7B,EAAO4B,CAAuB,EAIlE,OAHAnC,EAAQ,gBAAgB,EACpBqC,GAAQrC,EAAQ,iBAAiBO,EAAO8B,CAAM,EAE3CA,CACR,CACA,eAAgBC,EACf,EACA,EACA,EACA,EACA,EAC2B,CAE3B,GADAF,EAAQ,OAAOvC,EAAO,CAAC,EACnB0C,GAAS,KAAM,OACnB,GAAIzB,IAAU,MAAO,CACpB,IAAM0B,EAAS,MAAMN,EAAI3B,EAAOgC,CAAK,EACjCC,GAAU/B,EAAQ+B,EAAQ9B,CAAK,IAClC0B,EAAQ,OAAOvC,CAAK,EACpB,MAAM2C,GAEP,MACD,CACAxC,EAAQ,WAAWO,CAAK,EACxB,IAAMM,EAAQD,EAAOL,EAAOO,EAAOJ,CAAK,EAYlC+B,EAVSL,EAAQ,UAAU7B,CAAK,CAAC,CAAC,UAAUM,EAAM,KAAO,GAAM,CAEpE,IAAI6B,EAAQC,EAEZ,IAAK,IAAMC,KAAWZ,EAAenB,EAAOC,EAAOyB,EAAuB,IAAA,GAAW7B,CAAK,EAEzF,EAAQgC,EAAM,GAAGE,EAAQ,MAAOA,EAAQ,KAAK,EAE9C,OAAOF,CACR,CACsB,CAAC,CAAC,OAAO,cAAc,CAAC,EAC9C,GAAI,CACH,OAAa,CACZ1C,EAAQ,gBAAgB,EACxBA,EAAQ,WAAWO,CAAK,EACxB,IAAMsC,EAAO,MAAMJ,EAAS,KAAK,EAEjC,GADAzC,EAAQ,gBAAgB,EACpB6C,EAAK,KAAM,OACf,IAAMC,EAAY,MAAMV,EAAQ,UAAU7B,EAAOsC,EAAK,KAAK,EAE3D7C,EAAQ,gBAAgB,EACnB8C,IACL9C,EAAQ,iBAAiBO,EAAOsC,EAAK,KAAK,EACrCpC,EAAQoC,EAAK,MAAOnC,CAAK,IAC9B0B,EAAQ,OAAOvC,CAAK,EAEpB,MAAMgD,EAAK,OACZ,CACD,QAAU,CACT,MAAMJ,EAAS,SAAS,CACzB,CACD,CACA,eAAgBM,EACf,EACA,EACA,EAC2B,CAE3B,GADAX,EAAQ,OAAOvC,EAAO,CAAC,EACnB,CAACY,EAAQuC,EAAQ1C,EAAS,WAAW,EAAG,OAC5C,IAAMiC,EAAQS,EAAO7C,EAAKG,EAAS,IAAI,CAAC,CAAC,OACzC,GAAIiC,GAAS,KACb,IAAI,SAAUjC,EAAS,MAAQ,SAAUA,EAAS,GACjD,UAAW,IAAM2C,KAAYX,EAC5BhC,EAAS,KAAK,SAAS,MACvBA,EAAS,KAAK,SAAS,MACvBiC,EACA1C,EACAS,EAAS,aACV,EACC,MAAOgC,EACNhC,EAAS,OACTA,EAAS,GAAG,KAAK,MACjB2C,EAAS3C,EAAS,GAAG,SAAS,OAC9BT,EACAS,EAAS,WACV,OAED,MAAOgC,EAAQhC,EAAS,OAAQH,EAAKG,EAAS,EAAE,CAAC,CAAC,MAAOiC,EAAO1C,EAAOS,EAAS,WAAW,CAAA,CAC7F,CACA,eAAe4C,EAAI,EAAgB,EAAkB,EAAe,CACnE,IAAIC,EAAyB,KAC7B,UAAW,IAAMX,KAAUO,EAASzC,EAAU0C,EAAQnD,CAAK,EAAG,CAC7D,GAAIsD,EAAO,MAAM,IAAI3D,EAAkB,oBAAoB,EAC3D,EAAQgD,CACT,CACA,OAAOW,CACR,CACA,eAAeC,EACd,EACA,EACA,EACA,EAAQ,EACW,CAInB,GAHAhB,EAAQ,OAAOvC,EAAO,CAAC,EACvBG,EAAQ,gBAAgB,EACxBA,EAAQ,iBAAiBO,EAAOyC,CAAM,EAClCK,EAAI,OAAS,UAChB,OAAOL,EAAOK,EAAI,iBAAmBA,EAAI,KAAOD,EAAQ7C,EAAOyC,EAAQK,EAAI,MAAOxD,CAAK,EACxF,GAAIwD,EAAI,OAAS,SAAU,OAAOC,EAAcD,EAAKL,CAAM,EAC3D,GAAIK,EAAI,OAAS,MAAO,MAAO,CAAE,MAAMD,EAAQ7C,EAAOyC,EAAQK,EAAI,MAAOxD,CAAK,EAC9E,GAAIwD,EAAI,OAAS,OAASA,EAAI,OAAS,KAAM,CAC5C,IAAK,IAAME,KAASF,EAAI,SAAU,CACjC,IAAMhB,EAAS,MAAMe,EAAQ7C,EAAOyC,EAAQO,EAAO1D,CAAK,EACxD,GAAIwD,EAAI,OAAS,OAAS,CAAChB,EAAQ,MAAO,GAC1C,GAAIgB,EAAI,OAAS,MAAQhB,EAAQ,MAAO,EACzC,CACA,OAAOgB,EAAI,OAAS,KACrB,CACA,GAAIA,EAAI,OAAS,WAAY,MAAM,IAAI7D,EAAkB,kBAAkB,EAC3E,IAAMc,EAAWD,EAAKE,EAAO8C,EAAI,IAAI,EACrC,GAAIA,EAAI,OAAS,MAAO,CACvB,IAAMb,EAAS,MAAMU,EAAI5C,EAAU0C,EAAQnD,EAAQ,CAAC,EACpD,OAAOwD,EAAI,YAAc,KACtBb,IAAW,KACXA,IAAW,MAAS,MAAMY,EAAQ9C,EAAS,OAAQkC,EAAQa,EAAI,UAAWxD,EAAQ,CAAC,CACvF,CACA,UAAW,IAAM2C,KAAUO,EAASzC,EAAU0C,EAAQnD,EAAQ,CAAC,EAC9D,GAAI,MAAMuD,EAAQ9C,EAAS,OAAQkC,EAAQa,EAAI,UAAYxD,EAAQ,CAAC,EACnE,OAAOwD,EAAI,OAAS,OAEtB,OAAOA,EAAI,OAAS,MACrB,CACA,eAAeG,EACd,EACA,EACA,EACA,EACA,EAA0B,CAAC,EAC3B,EAAQ,EACR,EAA6B,CAAC,EACG,CACjCpB,EAAQ,OAAOvC,EAAO,CAAC,EAEvB,IAAM4D,EAAMzD,EAAQ,SAASO,EAAOyC,EAAQ,GAAM,CAAE,KAAM,MAAO,SAAU,CAAC,CAAE,CAAC,EAI/E,IAAK,GAAM,CAACxC,EAAMkD,KAAa,OAAO,QAAQ9D,CAAS,EAAG,CACzD,IAAMU,EAAWD,EAAKE,EAAOC,CAAI,EAChCb,EAAS+D,IAAa,GAAO,CAAC,EAAIA,EACnC,GAAIpD,EAAS,cAAgB,MAAO,CACnC,IAAMkC,EAAS,MAAMU,EAAI5C,EAAU0C,EAAQnD,EAAQ,CAAC,EACpD,EAAIW,GAAQgC,EACT,MAAMgB,EAAOlD,EAAS,OAAQkC,EAAQ7C,EAAQgE,EAAM,CAAC,GAAGC,EAAMpD,CAAI,EAAGX,EAAQ,EAAG,CAChF,GAAGgE,EACHb,EAAO,GACR,CAAC,EACA,IACJ,KAcC,GAAIxC,GAAQ,MAbOsD,EAClBvD,EACAyC,EACAxC,EACAb,EACA,CAAE,SAAUgE,EAAK,SAAU,OAAQ,KAAM,MAAOA,EAAK,KAAM,EAC3D,CAAC,EACD,CAAC,EACD,CAAC,GAAGC,EAAMpD,CAAI,EACdX,EAAQ,EACR,CAAC,GAAGgE,EAASb,EAAO,GAAG,CACxB,CAIF,CACA,OAAOS,CACR,CACA,SAASM,EACR,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACC,CACD/D,EAAQ,KAAKK,EAAKE,EAAOC,CAAI,CAAC,CAAC,OAAQZ,CAAS,EAChDF,EAAwBE,EAAWgE,EAAK,MAAM,EAC9C,IAAMtD,EAAWD,EAAKE,EAAOC,CAAI,EACjC,GAAIF,EAAS,cAAgB,OAAQ,MAAM,IAAId,EAAkB,kBAAkB,EACnF,IAAMwE,EAAkB1D,EAAS,YAC9B,CAAE,OAAQ,EAAGA,EAAS,YAAY,eAAgBA,EAAS,YAAY,GAAI,CAAE,EAC7E,IAAA,GACGe,EAAOrB,EAAQ,KACpBM,EAAS,OACT2D,EACA,CAAC,EACDD,EAAkB,CAAC,GAAGE,EAAaF,CAAe,EAAIE,CACvD,EACMC,EAAO7D,EAAS,KACrB8D,EAAK9D,EAAS,GACT+D,EACL,SAAUF,GAAQ,SAAUC,EACzB,CACA,MAAOD,EAAK,SAAS,MACrB,MAAOA,EAAK,SAAS,MACrB,YAAaC,EAAG,KAAK,MACrB,gBAAiBA,EAAG,SAAS,KAC9B,EACC,KACEE,EAAcD,EAAUA,EAAQ,MAAQ/D,EAAS,OACjDQ,EAAQuD,EAAUA,EAAQ,MAAQlE,EAAKiE,CAAE,CAAC,CAAC,MAC3CG,EAAcrD,EACnBZ,EAAS,OACT+D,EAAUA,EAAQ,YAAcvD,EAChCO,EACAK,EACApB,EAAS,WACV,EACMO,EAAQwD,EAAUzD,EAAO0D,EAAaxD,EAAOR,EAAS,aAAa,EAAIiE,EAEvE3B,EAAyB,CAC9B,GAAG4B,EACH,MAAOF,EACP,MAAOzD,EAAM,KACb,MAAOQ,EAAK,KAAK,OAAS,MAC1B,cAAeA,EAAK,eACpB,cAAe,CACd,WAAYA,EAAK,eACN,YACX,MAAO,CAAE,GAAGe,EAAQ,KAAM,EAC1B,UAAWoC,EAAY,MACvB,YAAaD,EAAY,KACzB,OAAQ,CACP,OAAQjE,EAAS,YAAc,CAAE,GAAGA,EAAS,WAAY,EAAI,KAC7D,OAAQA,EAAS,YAAc,CAAE,GAAGA,EAAS,WAAY,EAAI,KAC7D,SAAUA,EAAS,cAAgB,CAAE,GAAGA,EAAS,aAAc,EAAI,IACpE,CACD,EACA,aAAcsD,EACd,OAAQa,CACT,EACA,SAASC,EAAK,EAAe,CAC5B,GAAI,CACH,OAAOzE,EAAW,MAAM,KAAK,MAAM0E,EAAM,KAAKC,EAAOhC,CAAO,CAAC,CAAC,CAC/D,MAAQ,CACP,MAAM,IAAIiC,CACX,CACD,CACA,MAAO,CAAE,WAAU,OAAM,UAAS,cAAa,QAAO,QAAO,cAAa,UAAS,MAAK,CACzF,CACA,eAAef,EACd,EACA,EACA,EACA,EACA,EACA,EAAwC,CAAC,EACzC,EAA2C,CAAC,EAC5C,EAA0B,CAACtD,CAAI,EAC/B,EAAQ,EACR,EAA6B,CAAC,EAC9B,EAAWuD,EACVxD,EACAC,EACAZ,EACAqE,EACAvC,EACAwC,EACAN,EACAC,EAAQ,IAAMb,EAAQ,GACvB,EACA,EACC,CACDZ,EAAQ,OAAOvC,EAAO,CAAC,EACvB,GAAM,CAAE,WAAU,OAAM,UAAS,cAAa,QAAO,QAAO,cAAa,WAAYiF,EAC/EvC,EACLS,GAAUvC,EAAQuC,EAAQ1C,EAAS,WAAW,EAC3C0C,EAAO7C,EAAKG,EAAS,IAAI,CAAC,CAAC,OAC3B,IAAA,GACEqD,EAAO,CAAE,GAAGtC,EAAK,KAAM,GAAI0D,GAAU,CAAE,OAAQ,IAAK,CAAG,EAEvDC,EAAa,CAClB,GAAG3D,EACH,QACA,OACCkB,GAAS,KACN,CAAC,EACD8B,EACCrC,EAAenB,EAAOC,EAAOyB,EAAuB,IAAA,GAAWjC,EAAS,aAAa,EACrF0B,EAAenB,EAAOC,EAAOyB,EAAuBlB,EAAMf,EAAS,WAAW,EACnF,cAAeiC,GAAS,MAAQlB,EAAK,aACtC,EACM4D,EAAgBZ,GAAWA,EAAQ,cAAgB,MACnDhC,EAAS,MAAM6C,EACpBC,EACA/C,EACAkC,EACAU,EACAhF,EACA2E,EACA/B,EACAe,EACA,MAAO,EAAK,IAAc,CAEzB,GADIb,GAAW9C,EAAQ,iBAAiBiF,EAAgB3E,EAAS,OAASgE,EAAa3D,CAAG,EACtF,CAACmC,GAAcuB,GAAW,CAACY,GAAiB,CAACxE,EAAQE,EAAKL,EAAS,aAAa,EACnF,OAAO,KACR8B,EAAQ,OAAOvC,CAAK,EACpB,IAAI2C,EAaJ,MAZA,CAICA,EAJG6B,GAAW,CAACY,EACN,MAAM/C,EAAI5B,EAAS,OAAQK,EAAI0D,EAAQ,gBAAgB,EAGvD1D,EAGT,CAAC6B,GACD,CAAC/B,EAAQ+B,EAAQlC,EAAS,WAAW,GACrC,CAAE,MAAM8C,EAAQ9C,EAAS,OAAQkC,EAAQnB,EAAK,SAAUxB,CAAK,EAEtD,KACD2D,EAAOlD,EAAS,OAAQkC,EAAQ5C,EAAWyB,EAAK,KAAMuC,EAAM/D,EAAOgE,CAAO,CAClF,EACC,GAAQc,EAAM,KAAK,KAAK,UAAU,CAAE,OAAQS,EAAK,UAAWvB,EAAQ,MAAM,CAAC,CAAE,CAAC,EAAGjB,CAAO,EACzFqC,GACI,EAAQ,IAAO,CAGhB,IAAMI,EAAeF,EAOfG,EAASC,EAAejF,EAAS,OAAQiE,EAAY,KAAMc,CAAY,EAC7E,OAAOG,EAAO,QAAQ,KAAO,IAAa,CACzCpD,EAAQ,OAAOvC,CAAK,EACpB,IAAMiD,EAAY,MAAMV,EAAQ,UAAUkC,EAAarB,CAAQ,EAC/DjD,EAAQ,gBAAgB,EACpB8C,GAAW9C,EAAQ,iBAAiBsE,EAAarB,CAAQ,EAC7D,IAAMwC,EAAYxC,EAASoB,EAAQ,iBAGnC,MAFI,CAACvB,GAAa,CAACrC,EAAQwC,EAAU3C,EAAS,aAAa,GAAKmF,GAAa,KACrE,IAAIC,EAAYrE,EAAK,KAAK,OAAS,MAAOiE,CAAM,EACjDK,EAAOC,EAAIP,CAAY,CAAC,CAC7B,MAAM/E,EAAS,MAAM,CAAC,CACtB,UAAUiE,EAAY,KAAO,GAAM,CAEnC,IAAI7B,EAAQC,EAENV,EAASD,EACduC,EACAF,EAAQ,YACRoB,EACApE,EACAf,EAAS,WACV,EACA,IAAK,IAAMsC,KAAWX,EAErB,EAAQS,EAAM,GAAGE,EAAQ,MAAOA,EAAQ,KAAK,EAM9C,OAAOF,CACR,CAAC,CAAC,CACD,MAAMrB,EAAK,KAAK,OAAS,KAAK,CACjC,EAAGiE,CAAM,CACV,EACC,IAAA,GACHL,EAAgB3E,EAAS,OAASgE,CACnC,EAEA,OADAtE,EAAQ,gBAAgB,EACjBA,EAAQ,KAAKM,EAAS,OAAQV,CAAS,CAAC,CAAC,MAAMyC,CAAM,CAC7D,CACA,eAAewD,EACd,EACA,EACA,EACA,EACA,EACA,EACA,EACC,CACD,GAAI,CAACjC,EAAK,QAAUA,EAAK,OAAS,GAAK,CAACxB,EAAQ,GAAG,YAAY0D,EAAWrB,CAAM,EAC/E,MAAM,IAAIjF,EAAkB,kBAAkB,EAC/C,IAAIe,EAAQuF,EACNC,EAAenC,EAAK,IAAK,GAAS,CACvC,IAAMoC,EAAc3F,EAAKE,EAAOC,CAAI,EAEpC,MADA,GAAQwF,EAAY,OACbA,CACR,CAAC,EACKC,EAAQF,EAAa,GAAG,EAAE,EAC1BjB,EAAWf,EAChBkC,EAAM,OACNrC,EAAK,GAAG,EAAE,EACVhE,EACAqE,EACAvC,EACAwC,EACAN,EACAa,CACD,EAEMyB,EAAQjC,EAAM,SAAW,KAAO,KAAOa,EAAS,KAAKb,EAAM,MAAM,EACjEkC,EAAMlC,EAAM,WAAa,KAAO,KAAOa,EAAS,KAAKb,EAAM,SAAS,EACpEmC,EAAYF,GAAO,WAAaC,GAAK,WAAa,CAAC,EACzD,GACCC,EAAU,SAAWxC,EAAK,OAAS,GAClCsC,GAASC,GAAO,KAAK,UAAUD,EAAM,SAAS,IAAM,KAAK,UAAUC,EAAI,SAAS,GACjFC,EAAU,MAAM,EAAI,IAAM,CAAChE,EAAQ,GAAG,YAAY2D,EAAa/E,EAAE,CAAC,OAAQmB,CAAE,CAAC,EAE7E,MAAM,IAAI0C,EAGX,GAAI,CACH,IAAI7B,EAAS,MAAMd,EAAI4D,EAAWrB,CAAM,EACxC,IAAK,IAAIzD,EAAI,EAAGgC,GAAUhC,EAAIoF,EAAU,OAAQ,IAAK,CACpD,IAAM9F,EAAWyF,EAAa/E,GAC1BqF,EAAyB,KAC7B,GAAI/F,EAAS,cAAgB,MAAO,CACnC,IAAMkC,EAAS,MAAMU,EAAI5C,EAAU0C,EAAQhC,EAAI,CAAC,EAC5CwB,GAAQ,MAAQ4D,EAAUpF,KAAI,EAAQwB,EAC3C,MACC,UAAW,IAAMA,KAAUO,EAASzC,EAAU0C,EAAQhC,EAAI,CAAC,EAC1D,GAAIwB,EAAO,MAAQ4D,EAAUpF,GAAI,CAChC,EAAQwB,EACR,KACD,CAEF,EAAS6D,CACV,CACA,OAAO,MAAMvC,EACZmC,EAAM,OACNjD,EACAY,EAAK,GAAG,EAAE,EACVhE,EACAqE,EACAvC,EACAwC,EACAN,EACAA,EAAK,OACL,CAACa,EAAQ,GAAG2B,CAAS,EACrBtB,EACA,CAAE,OAAQoB,GAAO,QAAU,KAAM,UAAWC,GAAK,QAAUlC,EAAM,SAAU,CAC5E,CACD,OAASqC,EAAO,CACfC,EAAkBD,CAAK,CACxB,CACD,CACA,MAAO,CAAE,UAAS,SAAQ,eAAc,MAAK,CAC9C"}
+{"version":3,"file":"relationships.mjs","names":["RelationshipError","code","assertRelationshipDepth","nested","selection","depth","relationshipExecutor","metadata","planner","navigation","z","base","leg","edge","declared","table","name","guarded","guard","row","memberIdSchema","memberMatches","member","id","value","request","sourceValue","parent","lookup","index","field","position","i","key","relationIndex","indexes","bound","plan","usable","length","size","condition","conditions","c","chosen","candidates","b","a","relationPrefix","prefix","get","result","targets","target","iterator","range","q","binding","next","permitted","traverse","junction","one","match","matches","scalarOnly","ast","scalarMatches","child","output","dto","selected","args","path","parents","pageRelation","prepare","guardConstraint","input","constraints","from","to","through","sourceTable","targetIndex","rootBinding","rootId","open","codec","token","CursorError","prepared","opened","lookupPlan","indexedTarget","executeStream","schema","raw","nativeSchema","fields","getIndexFields","source","reference","EmptyStream","stream","db","continuation","rootTable","declarations","declaration","final","start","end","ancestors","found","error","rethrowQueryError"],"sources":["../../src/querying/relationships.ts"],"sourcesContent":["import type { GenericSchema, SchemaDefinition, IndexRangeBuilder } from 'convex/server'\nimport type { GenericId, Value } from 'convex/values'\nimport type { RelationEdge, RelationGuard } from '../relations'\nimport type { createPlanner, QueryInput, StoredConstraint } from './planner'\nimport { scalarMatches } from './planner'\nimport type {\n\tFilterAst,\n\tFilterScalar,\n\tIndexCondition,\n\tNativePagination,\n\tQueryIndex,\n} from './filters'\nimport { executeStream, rethrowQueryError, type ExecutionRequest } from './execution'\nimport type { createCursorCodec, CursorBinding } from './cursors'\nimport { CursorError } from './cursors'\nimport { z } from 'zod'\nimport { stream, EmptyStream, getIndexFields } from 'convex-helpers/server/stream'\n\nexport interface OutputSelection {\n\t[name: string]: true | OutputSelection\n}\ntype Edge = RelationEdge<string, string, 'one' | 'many', any, any>\nexport type RelationDocument = Record<string, Value> & {\n\t_id: GenericId<string>\n\t_creationTime: number\n}\ntype Document = RelationDocument\ntype Planner = ReturnType<typeof createPlanner>\n\nexport class RelationshipError extends Error {\n\tconstructor(readonly code: 'AMBIGUOUS_RELATION' | 'INVALID_RELATION') {\n\t\tsuper(code)\n\t\tthis.name = 'RelationshipError'\n\t}\n}\n\n/** The selection has already passed the registry validator; count leaf edges too. */\nexport function assertRelationshipDepth(selection: OutputSelection, depth: number): void {\n\tfor (const nested of Object.values(selection)) {\n\t\tif (depth >= 4) throw new RelationshipError('INVALID_RELATION')\n\t\tif (nested !== true) assertRelationshipDepth(nested, depth + 1)\n\t}\n}\n\n/** One request owns all traversal and authorized ID memoization. No raw reader escapes. */\nexport function relationshipExecutor(\n\tschema: SchemaDefinition<GenericSchema, boolean>,\n\trequest: ExecutionRequest,\n\tplanner: Planner,\n\tcodec: ReturnType<typeof createCursorCodec>,\n\trootBinding: CursorBinding,\n) {\n\tconst metadata = planner.metadata\n\tconst navigation = z\n\t\t.object({ cursor: z.string(), ancestors: z.array(z.string()).max(3) })\n\t\t.strict()\n\tconst base = (leg: Edge['from']) => ('base' in leg ? leg.base : leg)\n\tfunction edge(table: string, name: string): Edge {\n\t\tplanner.assertUnchanged()\n\t\tconst declared = metadata.declarations[table]?.[name]\n\t\tif (!declared) throw new RelationshipError('INVALID_RELATION')\n\t\treturn declared\n\t}\n\tconst guarded = (row: Document | Record<string, Value>, guard?: RelationGuard) =>\n\t\t!guard || row[guard.discriminator] === guard.tag\n\tconst memberIdSchema = z.string()\n\tfunction memberMatches(value: Value | undefined, member: Edge['sourceMember']): boolean {\n\t\tif (!member) return true\n\t\tconst id = memberIdSchema.safeParse(value)\n\t\treturn id.success && request.db.normalizeId(member.table, id.data) !== null\n\t}\n\tfunction sourceValue(declared: Edge, parent: Document | null): Value | undefined {\n\t\tif (!parent || !guarded(parent, declared.sourceGuard)) return undefined\n\t\tconst value = parent[base(declared.from).field]\n\t\treturn memberMatches(value, declared.sourceMember) &&\n\t\t\tmemberMatches(value, declared.targetMember)\n\t\t\t? value\n\t\t\t: undefined\n\t}\n\tfunction lookup(table: string, field: string, guard?: RelationGuard) {\n\t\tconst index =\n\t\t\tfield === '_id'\n\t\t\t\t? { name: 'by_id', fields: ['_id'] }\n\t\t\t\t: metadata.tables[table].indexes.find((i) => {\n\t\t\t\t\t\tconst position = i.fields.indexOf(field)\n\t\t\t\t\t\treturn (\n\t\t\t\t\t\t\tposition >= 0 &&\n\t\t\t\t\t\t\ti.fields.slice(0, position).every((key) => key === guard?.discriminator)\n\t\t\t\t\t\t)\n\t\t\t\t\t})\n\t\tif (!index) throw new RelationshipError('INVALID_RELATION')\n\t\treturn index\n\t}\n\tfunction relationIndex(\n\t\ttable: string,\n\t\tfield: string,\n\t\tplan: ReturnType<Planner['plan']>,\n\t\tconditions: readonly IndexCondition[],\n\t\tguard?: RelationGuard,\n\t): QueryIndex {\n\t\tconst indexes =\n\t\t\tfield === '_id' ? [{ name: 'by_id', fields: ['_id'] }] : metadata.tables[table].indexes\n\t\tconst bound = (key: string) =>\n\t\t\tkey === field || key === guard?.discriminator || plan.bindings.has(key)\n\t\tconst usable = (index: QueryIndex) =>\n\t\t\tindex.fields.includes(field) &&\n\t\t\tindex.fields.slice(0, index.fields.indexOf(field)).every(bound)\n\t\tconst length = (index: QueryIndex) => {\n\t\t\tlet size = 0\n\t\t\tfor (const key of index.fields) {\n\t\t\t\tif (!bound(key)) break\n\t\t\t\tsize++\n\t\t\t}\n\t\t\treturn size\n\t\t}\n\t\tconst condition = conditions.find((c) => c.value !== null && c.value !== undefined)\n\t\tif (condition) {\n\t\t\tconst chosen = indexes.find((i) => i.name === condition.index && usable(i))\n\t\t\tif (!chosen)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Explicit index \"${condition.index}\" is incompatible with declared relationship lookup`,\n\t\t\t\t)\n\t\t\treturn chosen\n\t\t}\n\t\tconst candidates = indexes\n\t\t\t.filter(usable)\n\t\t\t.sort(\n\t\t\t\t(a, b) =>\n\t\t\t\t\tlength(b) - length(a) ||\n\t\t\t\t\ta.name.localeCompare(b.name) ||\n\t\t\t\t\ta.fields.join('\\0').localeCompare(b.fields.join('\\0')),\n\t\t\t)\n\t\tif (!candidates.length) throw new RelationshipError('INVALID_RELATION')\n\t\treturn candidates[0]\n\t}\n\tfunction relationPrefix(\n\t\tindex: QueryIndex,\n\t\tfield: string,\n\t\tvalue: FilterScalar,\n\t\tplan?: ReturnType<Planner['plan']>,\n\t\tguard?: RelationGuard,\n\t) {\n\t\tconst prefix: { field: string; value: FilterScalar }[] = []\n\t\tfor (const key of index.fields) {\n\t\t\tif (key === field) prefix.push({ field: key, value })\n\t\t\telse if (key === guard?.discriminator) prefix.push({ field: key, value: guard.tag })\n\t\t\telse if (plan?.bindings.has(key)) prefix.push({ field: key, value: plan.bindings.get(key)! })\n\t\t\telse break\n\t\t}\n\t\treturn prefix\n\t}\n\n\tasync function get(table: string, id: Value | undefined): Promise<Document | null> {\n\t\tplanner.beforeLeaf(table)\n\t\t// SAFETY: native normalization rejects non-string/non-table IDs before any read.\n\t\tif (id == null || !request.db.normalizeId(table, id as string)) return null\n\t\t// SAFETY: normalizeId verifies the declared native table before the authorized metered get.\n\t\tconst result = await request.db.get(table, id as GenericId<string>)\n\t\tplanner.assertUnchanged()\n\t\tif (result) planner.validateDocument(table, result)\n\t\t// SAFETY: normalizeId checked the table; the authorized native get retains system fields.\n\t\treturn result as Document | null\n\t}\n\tasync function* targets(\n\t\ttable: string,\n\t\tfield: string,\n\t\tvalue: Value | undefined,\n\t\tdepth: number,\n\t\tguard?: RelationGuard,\n\t\tmember?: Edge['targetMember'],\n\t): AsyncGenerator<Document> {\n\t\trequest.expand(depth, 0)\n\t\tif (value == null || !memberMatches(value, member)) return\n\t\tif (field === '_id') {\n\t\t\tconst target = await get(table, value)\n\t\t\tif (target && guarded(target, guard) && memberMatches(target[field], member)) {\n\t\t\t\trequest.expand(depth)\n\t\t\t\tyield target\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t\tplanner.beforeLeaf(table)\n\t\tconst index = lookup(table, field, guard)\n\t\t// SAFETY: registry validates the indexed native lookup prefix and compatible values.\n\t\tconst source = request.leafQuery(table).withIndex(index.name, (q) => {\n\t\t\t// SAFETY: registration checks the mandatory join and every preceding guard equality.\n\t\t\tlet range = q as IndexRangeBuilder<any, string[], number>\n\t\t\t// SAFETY: registered relation fields are native scalars; each equality advances the consecutive checked prefix.\n\t\t\tfor (const binding of relationPrefix(index, field, value as FilterScalar, undefined, guard)) {\n\t\t\t\t// SAFETY: the prefix comes from the declared index and registry-owned guard.\n\t\t\t\trange = range.eq(binding.field, binding.value) as IndexRangeBuilder<any, string[], number>\n\t\t\t}\n\t\t\treturn range\n\t\t})\n\t\tconst iterator = source[Symbol.asyncIterator]()\n\t\ttry {\n\t\t\twhile (true) {\n\t\t\t\tplanner.assertUnchanged()\n\t\t\t\tplanner.beforeLeaf(table)\n\t\t\t\tconst next = await iterator.next()\n\t\t\t\tplanner.assertUnchanged()\n\t\t\t\tif (next.done) return\n\t\t\t\tconst permitted = await request.authorize(table, next.value)\n\t\t\t\t// Denials are an await boundary too; never hide them inside an authorized iterator.\n\t\t\t\tplanner.assertUnchanged()\n\t\t\t\tif (!permitted) continue\n\t\t\t\tplanner.validateDocument(table, next.value)\n\t\t\t\tif (!guarded(next.value, guard) || !memberMatches(next.value[field], member)) continue\n\t\t\t\trequest.expand(depth)\n\t\t\t\t// SAFETY: native rows include system fields and explicit authorization just completed.\n\t\t\t\tyield next.value as Document\n\t\t\t}\n\t\t} finally {\n\t\t\tawait iterator.return?.()\n\t\t}\n\t}\n\tasync function* traverse(\n\t\tdeclared: Edge,\n\t\tparent: Document,\n\t\tdepth: number,\n\t): AsyncGenerator<Document> {\n\t\trequest.expand(depth, 0)\n\t\tconst value = sourceValue(declared, parent)\n\t\tif (value == null) return\n\t\tif ('base' in declared.from && 'base' in declared.to) {\n\t\t\tfor await (const junction of targets(\n\t\t\t\tdeclared.from.junction.table,\n\t\t\t\tdeclared.from.junction.field,\n\t\t\t\tvalue,\n\t\t\t\tdepth,\n\t\t\t\tdeclared.junctionGuard,\n\t\t\t))\n\t\t\t\tyield* targets(\n\t\t\t\t\tdeclared.target,\n\t\t\t\t\tdeclared.to.base.field,\n\t\t\t\t\tjunction[declared.to.junction.field],\n\t\t\t\t\tdepth,\n\t\t\t\t\tdeclared.targetGuard,\n\t\t\t\t)\n\t\t} else\n\t\t\tyield* targets(\n\t\t\t\tdeclared.target,\n\t\t\t\tbase(declared.to).field,\n\t\t\t\tvalue,\n\t\t\t\tdepth,\n\t\t\t\tdeclared.targetGuard,\n\t\t\t\tdeclared.targetMember,\n\t\t\t)\n\t}\n\tasync function one(declared: Edge, parent: Document, depth: number) {\n\t\tlet match: Document | null = null\n\t\tfor await (const target of traverse(declared, parent, depth)) {\n\t\t\tif (match) throw new RelationshipError('AMBIGUOUS_RELATION')\n\t\t\tmatch = target\n\t\t}\n\t\treturn match\n\t}\n\tasync function matches(\n\t\ttable: string,\n\t\tparent: Document,\n\t\tast: FilterAst,\n\t\tdepth = 0,\n\t): Promise<boolean> {\n\t\trequest.expand(depth, 0)\n\t\tplanner.assertUnchanged()\n\t\t// Ordinary tables have no variant document validation. The live schema\n\t\t// guard above still covers them; variant rows retain full stored validation.\n\t\tif (metadata.tables[table].variant) planner.validateDocument(table, parent)\n\t\t// Evaluate a scalar Boolean tree synchronously under that same guard,\n\t\t// rather than rechecking every registry schema at each predicate node.\n\t\tif (scalarOnly(ast)) return scalarMatches(ast, parent)\n\t\tif (ast.kind === 'variant')\n\t\t\treturn parent[ast.discriminator] === ast.tag && matches(table, parent, ast.child, depth)\n\t\tif (ast.kind === 'scalar') return scalarMatches(ast, parent)\n\t\tif (ast.kind === 'not') return !(await matches(table, parent, ast.child, depth))\n\t\tif (ast.kind === 'and' || ast.kind === 'or') {\n\t\t\tfor (const child of ast.children) {\n\t\t\t\tconst result = await matches(table, parent, child, depth)\n\t\t\t\tif (ast.kind === 'and' && !result) return false\n\t\t\t\tif (ast.kind === 'or' && result) return true\n\t\t\t}\n\t\t\treturn ast.kind === 'and'\n\t\t}\n\t\tif (ast.kind !== 'relation') throw new RelationshipError('INVALID_RELATION')\n\t\tconst declared = edge(table, ast.name)\n\t\tif (ast.mode === 'one') {\n\t\t\tconst target = await one(declared, parent, depth + 1)\n\t\t\treturn ast.predicate === null\n\t\t\t\t? target === null\n\t\t\t\t: target !== null && (await matches(declared.target, target, ast.predicate, depth + 1))\n\t\t}\n\t\tfor await (const target of traverse(declared, parent, depth + 1))\n\t\t\tif (await matches(declared.target, target, ast.predicate!, depth + 1))\n\t\t\t\treturn ast.mode === 'some'\n\t\t// Only actual authorized traversal exhaustion proves none.\n\t\treturn ast.mode === 'none'\n\t}\n\tasync function output(\n\t\ttable: string,\n\t\tparent: Document,\n\t\tselection: OutputSelection,\n\t\targs: NativePagination & { order?: 'asc' | 'desc' },\n\t\tpath: readonly string[] = [],\n\t\tdepth = 0,\n\t\tparents: readonly string[] = [],\n\t): Promise<Record<string, Value>> {\n\t\trequest.expand(depth, 0)\n\t\t// SAFETY: the registry strictly validates this public native DTO projection.\n\t\tconst dto = planner.complete(table, parent, true, { kind: 'and', children: [] }) as Record<\n\t\t\tstring,\n\t\t\tValue\n\t\t>\n\t\tfor (const [name, selected] of Object.entries(selection)) {\n\t\t\tconst declared = edge(table, name),\n\t\t\t\tnested = selected === true ? {} : selected\n\t\t\tif (declared.cardinality === 'one') {\n\t\t\t\tconst target = await one(declared, parent, depth + 1)\n\t\t\t\tdto[name] = target\n\t\t\t\t\t? await output(declared.target, target, nested, args, [...path, name], depth + 1, [\n\t\t\t\t\t\t\t...parents,\n\t\t\t\t\t\t\tparent._id,\n\t\t\t\t\t\t])\n\t\t\t\t\t: null\n\t\t\t} else {\n\t\t\t\tconst page = await pageRelation(\n\t\t\t\t\ttable,\n\t\t\t\t\tparent,\n\t\t\t\t\tname,\n\t\t\t\t\tnested,\n\t\t\t\t\t{ numItems: args.numItems, cursor: null, order: args.order },\n\t\t\t\t\t[],\n\t\t\t\t\t[],\n\t\t\t\t\t[...path, name],\n\t\t\t\t\tdepth + 1,\n\t\t\t\t\t[...parents, parent._id],\n\t\t\t\t)\n\t\t\t\t// SAFETY: the declared page validator has parsed this nested DTO page.\n\t\t\t\tdto[name] = page as Value\n\t\t\t}\n\t\t}\n\t\treturn dto\n\t}\n\tfunction prepare(\n\t\ttable: string,\n\t\tname: string,\n\t\tselection: OutputSelection,\n\t\tinput: QueryInput,\n\t\tconditions: readonly IndexCondition[],\n\t\tconstraints: readonly StoredConstraint[],\n\t\tpath: readonly string[],\n\t\trootId: string,\n\t) {\n\t\tplanner.page(edge(table, name).target, selection)\n\t\tassertRelationshipDepth(selection, path.length)\n\t\tconst declared = edge(table, name)\n\t\tif (declared.cardinality !== 'many') throw new RelationshipError('INVALID_RELATION')\n\t\tconst guardConstraint = declared.targetGuard\n\t\t\t? { fields: { [declared.targetGuard.discriminator]: declared.targetGuard.tag } }\n\t\t\t: undefined\n\t\tconst plan = planner.plan(\n\t\t\tdeclared.target,\n\t\t\tinput,\n\t\t\t[],\n\t\t\tguardConstraint ? [...constraints, guardConstraint] : constraints,\n\t\t)\n\t\tconst from = declared.from,\n\t\t\tto = declared.to\n\t\tconst through =\n\t\t\t'base' in from && 'base' in to\n\t\t\t\t? {\n\t\t\t\t\t\ttable: from.junction.table,\n\t\t\t\t\t\tfield: from.junction.field,\n\t\t\t\t\t\ttargetField: to.base.field,\n\t\t\t\t\t\ttargetReference: to.junction.field,\n\t\t\t\t\t}\n\t\t\t\t: null\n\t\tconst sourceTable = through ? through.table : declared.target\n\t\tconst field = through ? through.field : base(to).field\n\t\tconst targetIndex = relationIndex(\n\t\t\tdeclared.target,\n\t\t\tthrough ? through.targetField : field,\n\t\t\tplan,\n\t\t\tconditions,\n\t\t\tdeclared.targetGuard,\n\t\t)\n\t\tconst index = through ? lookup(sourceTable, field, declared.junctionGuard) : targetIndex\n\t\t// SAFETY: planner.page validated the complete output mask before cursor binding.\n\t\tconst binding: CursorBinding = {\n\t\t\t...rootBinding,\n\t\t\ttable: sourceTable,\n\t\t\tindex: index.name,\n\t\t\torder: plan.args.order ?? 'asc',\n\t\t\tclientFilters: plan.clientIdentity,\n\t\t\tserverFilters: {\n\t\t\t\tpredicates: plan.serverIdentity,\n\t\t\t\tselection: selection as Value,\n\t\t\t\tscope: { ...request.scope },\n\t\t\t\trootTable: rootBinding.table,\n\t\t\t\tlookupIndex: targetIndex.name,\n\t\t\t\tguards: {\n\t\t\t\t\tsource: declared.sourceGuard ? { ...declared.sourceGuard } : null,\n\t\t\t\t\ttarget: declared.targetGuard ? { ...declared.targetGuard } : null,\n\t\t\t\t\tjunction: declared.junctionGuard ? { ...declared.junctionGuard } : null,\n\t\t\t\t},\n\t\t\t\t...((declared.sourceMember || declared.targetMember) && {\n\t\t\t\t\tmembers: {\n\t\t\t\t\t\tsource: declared.sourceMember ? { ...declared.sourceMember } : null,\n\t\t\t\t\t\ttarget: declared.targetMember ? { ...declared.targetMember } : null,\n\t\t\t\t\t},\n\t\t\t\t}),\n\t\t\t},\n\t\t\trelationPath: path,\n\t\t\tparent: rootId,\n\t\t}\n\t\tfunction open(token: string) {\n\t\t\ttry {\n\t\t\t\treturn navigation.parse(JSON.parse(codec.open(token, binding)))\n\t\t\t} catch {\n\t\t\t\tthrow new CursorError()\n\t\t\t}\n\t\t}\n\t\treturn { declared, plan, through, sourceTable, field, index, targetIndex, binding, open }\n\t}\n\tasync function pageRelation(\n\t\ttable: string,\n\t\tparent: Document | null,\n\t\tname: string,\n\t\tselection: OutputSelection,\n\t\tinput: QueryInput,\n\t\tconditions: readonly IndexCondition[] = [],\n\t\tconstraints: readonly StoredConstraint[] = [],\n\t\tpath: readonly string[] = [name],\n\t\tdepth = 1,\n\t\tparents: readonly string[] = [],\n\t\tprepared = prepare(\n\t\t\ttable,\n\t\t\tname,\n\t\t\tselection,\n\t\t\tinput,\n\t\t\tconditions,\n\t\t\tconstraints,\n\t\t\tpath,\n\t\t\tparents[0] ?? parent!._id,\n\t\t),\n\t\topened?: { cursor: string | null; endCursor?: string | null },\n\t) {\n\t\trequest.expand(depth, 0)\n\t\tconst { declared, plan, through, sourceTable, field, index, targetIndex, binding } = prepared\n\t\tconst value = sourceValue(declared, parent)\n\t\tconst args = { ...plan.args, ...(opened ?? { cursor: null }) }\n\t\t// SAFETY: declarations accept only native scalar lookup values; nullish references are absence.\n\t\tconst lookupPlan = {\n\t\t\t...plan,\n\t\t\tindex,\n\t\t\tprefix:\n\t\t\t\tvalue == null\n\t\t\t\t\t? []\n\t\t\t\t\t: through\n\t\t\t\t\t\t? relationPrefix(index, field, value as FilterScalar, undefined, declared.junctionGuard)\n\t\t\t\t\t\t: relationPrefix(index, field, value as FilterScalar, plan, declared.targetGuard),\n\t\t\tunsatisfiable: value == null || plan.unsatisfiable,\n\t\t}\n\t\tconst indexedTarget = through && through.targetField !== '_id'\n\t\tconst result = await executeStream(\n\t\t\tschema,\n\t\t\trequest,\n\t\t\tsourceTable,\n\t\t\tlookupPlan,\n\t\t\tplanner,\n\t\t\tcodec,\n\t\t\tbinding,\n\t\t\targs,\n\t\t\tasync (row, permitted) => {\n\t\t\t\tif (permitted) planner.validateDocument(indexedTarget ? declared.target : sourceTable, row)\n\t\t\t\tif (!permitted || (through && !indexedTarget && !guarded(row, declared.junctionGuard)))\n\t\t\t\t\treturn null\n\t\t\t\trequest.expand(depth)\n\t\t\t\tlet target: Document | null\n\t\t\t\tif (through && !indexedTarget)\n\t\t\t\t\ttarget = await get(declared.target, row[through.targetReference])\n\t\t\t\telse {\n\t\t\t\t\t// SAFETY: native direct/flattened target streams retain validated system fields.\n\t\t\t\t\ttarget = row as Document\n\t\t\t\t}\n\t\t\t\tif (\n\t\t\t\t\t!target ||\n\t\t\t\t\t!guarded(target, declared.targetGuard) ||\n\t\t\t\t\t!memberMatches(target[base(declared.to).field], declared.targetMember) ||\n\t\t\t\t\t!(await matches(declared.target, target, plan.residual, depth))\n\t\t\t\t)\n\t\t\t\t\treturn null\n\t\t\t\treturn output(declared.target, target, selection, plan.args, path, depth, parents)\n\t\t\t},\n\t\t\t(raw) => codec.seal(JSON.stringify({ cursor: raw, ancestors: parents.slice(1) }), binding),\n\t\t\tindexedTarget\n\t\t\t\t? (source, db) => {\n\t\t\t\t\t\t// SAFETY: the registry owns the native schema/index descriptors. Public\n\t\t\t\t\t\t// helper flatMap concatenates native outer/inner keys and paginates them.\n\t\t\t\t\t\tconst nativeSchema = schema as SchemaDefinition<\n\t\t\t\t\t\t\tRecord<\n\t\t\t\t\t\t\t\tstring,\n\t\t\t\t\t\t\t\timport('convex/server').TableDefinition<any, Record<string, string[]>>\n\t\t\t\t\t\t\t>,\n\t\t\t\t\t\t\tboolean\n\t\t\t\t\t\t>\n\t\t\t\t\t\tconst fields = getIndexFields(declared.target, targetIndex.name, nativeSchema)\n\t\t\t\t\t\treturn source.flatMap(async (junction) => {\n\t\t\t\t\t\t\trequest.expand(depth)\n\t\t\t\t\t\t\tconst permitted = await request.authorize(sourceTable, junction)\n\t\t\t\t\t\t\tplanner.assertUnchanged()\n\t\t\t\t\t\t\tif (permitted) planner.validateDocument(sourceTable, junction)\n\t\t\t\t\t\t\tconst reference = junction[through.targetReference]\n\t\t\t\t\t\t\tif (!permitted || !guarded(junction, declared.junctionGuard) || reference == null)\n\t\t\t\t\t\t\t\treturn new EmptyStream(plan.args.order ?? 'asc', fields)\n\t\t\t\t\t\t\treturn stream(db, nativeSchema)\n\t\t\t\t\t\t\t\t.query(declared.target)\n\t\t\t\t\t\t\t\t.withIndex(targetIndex.name, (q) => {\n\t\t\t\t\t\t\t\t\t// SAFETY: registry validates the native leading lookup; validated filters supply each consecutive trailing binding.\n\t\t\t\t\t\t\t\t\tlet range = q as IndexRangeBuilder<any, string[], number>\n\t\t\t\t\t\t\t\t\t// SAFETY: junction references are native scalar Values validated by the declared lookup.\n\t\t\t\t\t\t\t\t\tconst prefix = relationPrefix(\n\t\t\t\t\t\t\t\t\t\ttargetIndex,\n\t\t\t\t\t\t\t\t\t\tthrough.targetField,\n\t\t\t\t\t\t\t\t\t\treference as FilterScalar,\n\t\t\t\t\t\t\t\t\t\tplan,\n\t\t\t\t\t\t\t\t\t\tdeclared.targetGuard,\n\t\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t\tfor (const binding of prefix) {\n\t\t\t\t\t\t\t\t\t\t// SAFETY: native eq advances the validated consecutive index prefix.\n\t\t\t\t\t\t\t\t\t\trange = range.eq(binding.field, binding.value) as IndexRangeBuilder<\n\t\t\t\t\t\t\t\t\t\t\tany,\n\t\t\t\t\t\t\t\t\t\t\tstring[],\n\t\t\t\t\t\t\t\t\t\t\tnumber\n\t\t\t\t\t\t\t\t\t\t>\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn range\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t\t.order(plan.args.order ?? 'asc')\n\t\t\t\t\t\t}, fields)\n\t\t\t\t\t}\n\t\t\t\t: undefined,\n\t\t\tindexedTarget ? declared.target : sourceTable,\n\t\t)\n\t\tplanner.assertUnchanged()\n\t\treturn planner.page(declared.target, selection).parse(result)\n\t}\n\tasync function continuation(\n\t\trootTable: string,\n\t\trootId: string,\n\t\tpath: readonly string[],\n\t\tselection: OutputSelection,\n\t\tinput: QueryInput,\n\t\tconditions: readonly IndexCondition[],\n\t\tconstraints: readonly StoredConstraint[],\n\t) {\n\t\tif (!path.length || path.length > 4 || !request.db.normalizeId(rootTable, rootId))\n\t\t\tthrow new RelationshipError('INVALID_RELATION')\n\t\tlet table = rootTable\n\t\tconst declarations = path.map((name) => {\n\t\t\tconst declaration = edge(table, name)\n\t\t\ttable = declaration.target\n\t\t\treturn declaration\n\t\t})\n\t\tconst final = declarations.at(-1)!\n\t\tconst prepared = prepare(\n\t\t\tfinal.source,\n\t\t\tpath.at(-1)!,\n\t\t\tselection,\n\t\t\tinput,\n\t\t\tconditions,\n\t\t\tconstraints,\n\t\t\tpath,\n\t\t\trootId,\n\t\t)\n\t\t// Authenticate both slots and native ancestor IDs before ANY parent/traversal read.\n\t\tconst start = input.cursor === null ? null : prepared.open(input.cursor)\n\t\tconst end = input.endCursor == null ? null : prepared.open(input.endCursor)\n\t\tconst ancestors = start?.ancestors ?? end?.ancestors ?? []\n\t\tif (\n\t\t\tancestors.length !== path.length - 1 ||\n\t\t\t(start && end && JSON.stringify(start.ancestors) !== JSON.stringify(end.ancestors)) ||\n\t\t\tancestors.some((id, i) => !request.db.normalizeId(declarations[i].target, id))\n\t\t)\n\t\t\tthrow new CursorError()\n\t\t// Declarative input/index/cursor validation above retains its pre-read errors,\n\t\t// just as on the root path. Every awaited read, ancestry proof and page is protected.\n\t\ttry {\n\t\t\tlet parent = await get(rootTable, rootId)\n\t\t\tfor (let i = 0; parent && i < ancestors.length; i++) {\n\t\t\t\tconst declared = declarations[i]\n\t\t\t\tlet found: Document | null = null\n\t\t\t\tif (declared.cardinality === 'one') {\n\t\t\t\t\tconst target = await one(declared, parent, i + 1)\n\t\t\t\t\tif (target?._id === ancestors[i]) found = target\n\t\t\t\t} else\n\t\t\t\t\tfor await (const target of traverse(declared, parent, i + 1)) {\n\t\t\t\t\t\tif (target._id === ancestors[i]) {\n\t\t\t\t\t\t\tfound = target\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tparent = found\n\t\t\t}\n\t\t\treturn await pageRelation(\n\t\t\t\tfinal.source,\n\t\t\t\tparent,\n\t\t\t\tpath.at(-1)!,\n\t\t\t\tselection,\n\t\t\t\tinput,\n\t\t\t\tconditions,\n\t\t\t\tconstraints,\n\t\t\t\tpath,\n\t\t\t\tpath.length,\n\t\t\t\t[rootId, ...ancestors],\n\t\t\t\tprepared,\n\t\t\t\t{ cursor: start?.cursor ?? null, endCursor: end?.cursor ?? input.endCursor },\n\t\t\t)\n\t\t} catch (error) {\n\t\t\trethrowQueryError(error)\n\t\t}\n\t}\n\treturn { matches, output, continuation, edge }\n}\n\n/** Scalar subtrees have no reads or await boundaries requiring another live guard. */\nfunction scalarOnly(ast: FilterAst): boolean {\n\tif (ast.kind === 'relation') return false\n\tif (ast.kind === 'and' || ast.kind === 'or') return ast.children.every(scalarOnly)\n\tif (ast.kind === 'not' || ast.kind === 'variant') return scalarOnly(ast.child)\n\treturn true\n}\n"],"mappings":"oRA6BA,IAAaA,EAAb,cAAuC,KAAM,CACvB,KAArB,YAAY,EAA0D,CACrE,MAAMC,CAAI,EADU,KAAA,KAAAA,EAEpB,KAAK,KAAO,mBACb,CACD,EAGA,SAAgBC,EAAwB,EAA4B,EAAqB,CACxF,IAAK,IAAMC,KAAU,OAAO,OAAOC,CAAS,EAAG,CAC9C,GAAIC,GAAS,EAAG,MAAM,IAAIL,EAAkB,kBAAkB,EAC1DG,IAAW,IAAMD,EAAwBC,EAAQE,EAAQ,CAAC,CAC/D,CACD,CAGA,SAAgBC,EACf,EACA,EACA,EACA,EACA,EACC,CACD,IAAMC,EAAWC,EAAQ,SACnBC,EAAaC,EACjB,OAAO,CAAE,OAAQA,EAAE,OAAO,EAAG,UAAWA,EAAE,MAAMA,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CACrE,OAAO,EACHC,EAAQ,GAAuB,SAAUC,EAAMA,EAAI,KAAOA,EAChE,SAASC,EAAK,EAAe,EAAoB,CAChDL,EAAQ,gBAAgB,EACxB,IAAMM,EAAWP,EAAS,aAAaQ,EAAM,GAAGC,GAChD,GAAI,CAACF,EAAU,MAAM,IAAId,EAAkB,kBAAkB,EAC7D,OAAOc,CACR,CACA,IAAMG,GAAW,EAAuC,IACvD,CAACC,GAASC,EAAID,EAAM,iBAAmBA,EAAM,IACxCE,EAAiBV,EAAE,OAAO,EAChC,SAASW,EAAc,EAA0B,EAAuC,CACvF,GAAI,CAACC,EAAQ,MAAO,GACpB,IAAMC,EAAKH,EAAe,UAAUI,CAAK,EACzC,OAAOD,EAAG,SAAWE,EAAQ,GAAG,YAAYH,EAAO,MAAOC,EAAG,IAAI,IAAM,IACxE,CACA,SAASG,EAAY,EAAgB,EAA4C,CAChF,GAAI,CAACC,GAAU,CAACV,EAAQU,EAAQb,EAAS,WAAW,EAAG,OACvD,IAAMU,EAAQG,EAAOhB,EAAKG,EAAS,IAAI,CAAC,CAAC,OACzC,OAAOO,EAAcG,EAAOV,EAAS,YAAY,GAChDO,EAAcG,EAAOV,EAAS,YAAY,EACxCU,EACA,IAAA,EACJ,CACA,SAASI,EAAO,EAAe,EAAe,EAAuB,CACpE,IAAMC,EACLC,IAAU,MACP,CAAE,KAAM,QAAS,OAAQ,CAAC,KAAK,CAAE,EACjCvB,EAAS,OAAOQ,EAAM,CAAC,QAAQ,KAAM,GAAM,CAC3C,IAAMgB,EAAWC,EAAE,OAAO,QAAQF,CAAK,EACvC,OACCC,GAAY,GACZC,EAAE,OAAO,MAAM,EAAGD,CAAQ,CAAC,CAAC,MAAO,GAAQE,IAAQf,GAAO,aAAa,CAEzE,CAAC,EACJ,GAAI,CAACW,EAAO,MAAM,IAAI7B,EAAkB,kBAAkB,EAC1D,OAAO6B,CACR,CACA,SAASK,EACR,EACA,EACA,EACA,EACA,EACa,CACb,IAAMC,EACLL,IAAU,MAAQ,CAAC,CAAE,KAAM,QAAS,OAAQ,CAAC,KAAK,CAAE,CAAC,EAAIvB,EAAS,OAAOQ,EAAM,CAAC,QAC3EqB,EAAS,GACdH,IAAQH,GAASG,IAAQf,GAAO,eAAiBmB,EAAK,SAAS,IAAIJ,CAAG,EACjEK,EAAU,GACfT,EAAM,OAAO,SAASC,CAAK,GAC3BD,EAAM,OAAO,MAAM,EAAGA,EAAM,OAAO,QAAQC,CAAK,CAAC,CAAC,CAAC,MAAMM,CAAK,EACzDG,EAAU,GAAsB,CACrC,IAAIC,EAAO,EACX,IAAK,IAAMP,KAAOJ,EAAM,OAAQ,CAC/B,GAAI,CAACO,EAAMH,CAAG,EAAG,MACjB,GACD,CACA,OAAOO,CACR,EACMC,EAAYC,EAAW,KAAM,GAAMC,EAAE,QAAU,MAAQA,EAAE,QAAU,IAAA,EAAS,EAClF,GAAIF,EAAW,CACd,IAAMG,EAAST,EAAQ,KAAM,GAAMH,EAAE,OAASS,EAAU,OAASH,EAAON,CAAC,CAAC,EAC1E,GAAI,CAACY,EACJ,MAAU,MACT,mBAAmBH,EAAU,MAAM,oDACpC,EACD,OAAOG,CACR,CACA,IAAMC,EAAaV,EACjB,OAAOG,CAAM,CAAC,CACd,MACC,EAAG,IACHC,EAAOO,CAAC,EAAIP,EAAOQ,CAAC,GACpBA,EAAE,KAAK,cAAcD,EAAE,IAAI,GAC3BC,EAAE,OAAO,KAAK,IAAI,CAAC,CAAC,cAAcD,EAAE,OAAO,KAAK,IAAI,CAAC,CACvD,EACD,GAAI,CAACD,EAAW,OAAQ,MAAM,IAAI7C,EAAkB,kBAAkB,EACtE,OAAO6C,EAAW,EACnB,CACA,SAASG,EACR,EACA,EACA,EACA,EACA,EACC,CACD,IAAMC,EAAmD,CAAC,EAC1D,IAAK,IAAMhB,KAAOJ,EAAM,OACvB,GAAII,IAAQH,EAAOmB,EAAO,KAAK,CAAE,MAAOhB,EAAK,OAAM,CAAC,OAC/C,GAAIA,IAAQf,GAAO,cAAe+B,EAAO,KAAK,CAAE,MAAOhB,EAAK,MAAOf,EAAM,GAAI,CAAC,OAC9E,GAAImB,GAAM,SAAS,IAAIJ,CAAG,EAAGgB,EAAO,KAAK,CAAE,MAAOhB,EAAK,MAAOI,EAAK,SAAS,IAAIJ,CAAG,CAAG,CAAC,OACvF,MAEN,OAAOgB,CACR,CAEA,eAAeC,EAAI,EAAe,EAAiD,CAGlF,GAFA1C,EAAQ,WAAWO,CAAK,EAEpBQ,GAAM,MAAQ,CAACE,EAAQ,GAAG,YAAYV,EAAOQ,CAAY,EAAG,OAAO,KAEvE,IAAM4B,EAAS,MAAM1B,EAAQ,GAAG,IAAIV,EAAOQ,CAAuB,EAIlE,OAHAf,EAAQ,gBAAgB,EACpB2C,GAAQ3C,EAAQ,iBAAiBO,EAAOoC,CAAM,EAE3CA,CACR,CACA,eAAgBC,EACf,EACA,EACA,EACA,EACA,EACA,EAC2B,CAE3B,GADA3B,EAAQ,OAAOpB,EAAO,CAAC,EACnBmB,GAAS,MAAQ,CAACH,EAAcG,EAAOF,CAAM,EAAG,OACpD,GAAIQ,IAAU,MAAO,CACpB,IAAMuB,EAAS,MAAMH,EAAInC,EAAOS,CAAK,EACjC6B,GAAUpC,EAAQoC,EAAQnC,CAAK,GAAKG,EAAcgC,EAAOvB,GAAQR,CAAM,IAC1EG,EAAQ,OAAOpB,CAAK,EACpB,MAAMgD,GAEP,MACD,CACA7C,EAAQ,WAAWO,CAAK,EACxB,IAAMc,EAAQD,EAAOb,EAAOe,EAAOZ,CAAK,EAYlCoC,EAVS7B,EAAQ,UAAUV,CAAK,CAAC,CAAC,UAAUc,EAAM,KAAO,GAAM,CAEpE,IAAI0B,EAAQC,EAEZ,IAAK,IAAMC,KAAWT,EAAenB,EAAOC,EAAON,EAAuB,IAAA,GAAWN,CAAK,EAEzF,EAAQqC,EAAM,GAAGE,EAAQ,MAAOA,EAAQ,KAAK,EAE9C,OAAOF,CACR,CACsB,CAAC,CAAC,OAAO,cAAc,CAAC,EAC9C,GAAI,CACH,OAAa,CACZ/C,EAAQ,gBAAgB,EACxBA,EAAQ,WAAWO,CAAK,EACxB,IAAM2C,EAAO,MAAMJ,EAAS,KAAK,EAEjC,GADA9C,EAAQ,gBAAgB,EACpBkD,EAAK,KAAM,OACf,IAAMC,EAAY,MAAMlC,EAAQ,UAAUV,EAAO2C,EAAK,KAAK,EAE3DlD,EAAQ,gBAAgB,EACnBmD,IACLnD,EAAQ,iBAAiBO,EAAO2C,EAAK,KAAK,EACrCzC,EAAQyC,EAAK,MAAOxC,CAAK,GAAMG,EAAcqC,EAAK,MAAM5B,GAAQR,CAAM,IAC3EG,EAAQ,OAAOpB,CAAK,EAEpB,MAAMqD,EAAK,OACZ,CACD,QAAU,CACT,MAAMJ,EAAS,SAAS,CACzB,CACD,CACA,eAAgBM,EACf,EACA,EACA,EAC2B,CAC3BnC,EAAQ,OAAOpB,EAAO,CAAC,EACvB,IAAMmB,EAAQE,EAAYZ,EAAUa,CAAM,EAC1C,GAAIH,GAAS,KACb,IAAI,SAAUV,EAAS,MAAQ,SAAUA,EAAS,GACjD,UAAW,IAAM+C,KAAYT,EAC5BtC,EAAS,KAAK,SAAS,MACvBA,EAAS,KAAK,SAAS,MACvBU,EACAnB,EACAS,EAAS,aACV,EACC,MAAOsC,EACNtC,EAAS,OACTA,EAAS,GAAG,KAAK,MACjB+C,EAAS/C,EAAS,GAAG,SAAS,OAC9BT,EACAS,EAAS,WACV,OAED,MAAOsC,EACNtC,EAAS,OACTH,EAAKG,EAAS,EAAE,CAAC,CAAC,MAClBU,EACAnB,EACAS,EAAS,YACTA,EAAS,YACV,CAAA,CACF,CACA,eAAegD,EAAI,EAAgB,EAAkB,EAAe,CACnE,IAAIC,EAAyB,KAC7B,UAAW,IAAMV,KAAUO,EAAS9C,EAAUa,EAAQtB,CAAK,EAAG,CAC7D,GAAI0D,EAAO,MAAM,IAAI/D,EAAkB,oBAAoB,EAC3D,EAAQqD,CACT,CACA,OAAOU,CACR,CACA,eAAeC,EACd,EACA,EACA,EACA,EAAQ,EACW,CAQnB,GAPAvC,EAAQ,OAAOpB,EAAO,CAAC,EACvBG,EAAQ,gBAAgB,EAGpBD,EAAS,OAAOQ,EAAM,CAAC,SAASP,EAAQ,iBAAiBO,EAAOY,CAAM,EAGtEsC,EAAWC,CAAG,EAAG,OAAOC,EAAcD,EAAKvC,CAAM,EACrD,GAAIuC,EAAI,OAAS,UAChB,OAAOvC,EAAOuC,EAAI,iBAAmBA,EAAI,KAAOF,EAAQjD,EAAOY,EAAQuC,EAAI,MAAO7D,CAAK,EACxF,GAAI6D,EAAI,OAAS,SAAU,OAAOC,EAAcD,EAAKvC,CAAM,EAC3D,GAAIuC,EAAI,OAAS,MAAO,MAAO,CAAE,MAAMF,EAAQjD,EAAOY,EAAQuC,EAAI,MAAO7D,CAAK,EAC9E,GAAI6D,EAAI,OAAS,OAASA,EAAI,OAAS,KAAM,CAC5C,IAAK,IAAME,KAASF,EAAI,SAAU,CACjC,IAAMf,EAAS,MAAMa,EAAQjD,EAAOY,EAAQyC,EAAO/D,CAAK,EACxD,GAAI6D,EAAI,OAAS,OAAS,CAACf,EAAQ,MAAO,GAC1C,GAAIe,EAAI,OAAS,MAAQf,EAAQ,MAAO,EACzC,CACA,OAAOe,EAAI,OAAS,KACrB,CACA,GAAIA,EAAI,OAAS,WAAY,MAAM,IAAIlE,EAAkB,kBAAkB,EAC3E,IAAMc,EAAWD,EAAKE,EAAOmD,EAAI,IAAI,EACrC,GAAIA,EAAI,OAAS,MAAO,CACvB,IAAMb,EAAS,MAAMS,EAAIhD,EAAUa,EAAQtB,EAAQ,CAAC,EACpD,OAAO6D,EAAI,YAAc,KACtBb,IAAW,KACXA,IAAW,MAAS,MAAMW,EAAQlD,EAAS,OAAQuC,EAAQa,EAAI,UAAW7D,EAAQ,CAAC,CACvF,CACA,UAAW,IAAMgD,KAAUO,EAAS9C,EAAUa,EAAQtB,EAAQ,CAAC,EAC9D,GAAI,MAAM2D,EAAQlD,EAAS,OAAQuC,EAAQa,EAAI,UAAY7D,EAAQ,CAAC,EACnE,OAAO6D,EAAI,OAAS,OAEtB,OAAOA,EAAI,OAAS,MACrB,CACA,eAAeG,EACd,EACA,EACA,EACA,EACA,EAA0B,CAAC,EAC3B,EAAQ,EACR,EAA6B,CAAC,EACG,CACjC5C,EAAQ,OAAOpB,EAAO,CAAC,EAEvB,IAAMiE,EAAM9D,EAAQ,SAASO,EAAOY,EAAQ,GAAM,CAAE,KAAM,MAAO,SAAU,CAAC,CAAE,CAAC,EAI/E,IAAK,GAAM,CAACX,EAAMuD,KAAa,OAAO,QAAQnE,CAAS,EAAG,CACzD,IAAMU,EAAWD,EAAKE,EAAOC,CAAI,EAChCb,EAASoE,IAAa,GAAO,CAAC,EAAIA,EACnC,GAAIzD,EAAS,cAAgB,MAAO,CACnC,IAAMuC,EAAS,MAAMS,EAAIhD,EAAUa,EAAQtB,EAAQ,CAAC,EACpD,EAAIW,GAAQqC,EACT,MAAMgB,EAAOvD,EAAS,OAAQuC,EAAQlD,EAAQqE,EAAM,CAAC,GAAGC,EAAMzD,CAAI,EAAGX,EAAQ,EAAG,CAChF,GAAGqE,EACH/C,EAAO,GACR,CAAC,EACA,IACJ,KAcC,GAAIX,GAAQ,MAbO2D,EAClB5D,EACAY,EACAX,EACAb,EACA,CAAE,SAAUqE,EAAK,SAAU,OAAQ,KAAM,MAAOA,EAAK,KAAM,EAC3D,CAAC,EACD,CAAC,EACD,CAAC,GAAGC,EAAMzD,CAAI,EACdX,EAAQ,EACR,CAAC,GAAGqE,EAAS/C,EAAO,GAAG,CACxB,CAIF,CACA,OAAO2C,CACR,CACA,SAASM,EACR,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACC,CACDpE,EAAQ,KAAKK,EAAKE,EAAOC,CAAI,CAAC,CAAC,OAAQZ,CAAS,EAChDF,EAAwBE,EAAWqE,EAAK,MAAM,EAC9C,IAAM3D,EAAWD,EAAKE,EAAOC,CAAI,EACjC,GAAIF,EAAS,cAAgB,OAAQ,MAAM,IAAId,EAAkB,kBAAkB,EACnF,IAAM6E,EAAkB/D,EAAS,YAC9B,CAAE,OAAQ,EAAGA,EAAS,YAAY,eAAgBA,EAAS,YAAY,GAAI,CAAE,EAC7E,IAAA,GACGuB,EAAO7B,EAAQ,KACpBM,EAAS,OACTgE,EACA,CAAC,EACDD,EAAkB,CAAC,GAAGE,EAAaF,CAAe,EAAIE,CACvD,EACMC,EAAOlE,EAAS,KACrBmE,EAAKnE,EAAS,GACToE,EACL,SAAUF,GAAQ,SAAUC,EACzB,CACA,MAAOD,EAAK,SAAS,MACrB,MAAOA,EAAK,SAAS,MACrB,YAAaC,EAAG,KAAK,MACrB,gBAAiBA,EAAG,SAAS,KAC9B,EACC,KACEE,EAAcD,EAAUA,EAAQ,MAAQpE,EAAS,OACjDgB,EAAQoD,EAAUA,EAAQ,MAAQvE,EAAKsE,CAAE,CAAC,CAAC,MAC3CG,EAAclD,EACnBpB,EAAS,OACToE,EAAUA,EAAQ,YAAcpD,EAChCO,EACAK,EACA5B,EAAS,WACV,EACMe,EAAQqD,EAAUtD,EAAOuD,EAAarD,EAAOhB,EAAS,aAAa,EAAIsE,EAEvE3B,EAAyB,CAC9B,GAAG4B,EACH,MAAOF,EACP,MAAOtD,EAAM,KACb,MAAOQ,EAAK,KAAK,OAAS,MAC1B,cAAeA,EAAK,eACpB,cAAe,CACd,WAAYA,EAAK,eACN,YACX,MAAO,CAAE,GAAGZ,EAAQ,KAAM,EAC1B,UAAW4D,EAAY,MACvB,YAAaD,EAAY,KACzB,OAAQ,CACP,OAAQtE,EAAS,YAAc,CAAE,GAAGA,EAAS,WAAY,EAAI,KAC7D,OAAQA,EAAS,YAAc,CAAE,GAAGA,EAAS,WAAY,EAAI,KAC7D,SAAUA,EAAS,cAAgB,CAAE,GAAGA,EAAS,aAAc,EAAI,IACpE,EACA,IAAKA,EAAS,cAAgBA,EAAS,eAAiB,CACvD,QAAS,CACR,OAAQA,EAAS,aAAe,CAAE,GAAGA,EAAS,YAAa,EAAI,KAC/D,OAAQA,EAAS,aAAe,CAAE,GAAGA,EAAS,YAAa,EAAI,IAChE,CACD,CACD,EACA,aAAc2D,EACd,OAAQa,CACT,EACA,SAASC,EAAK,EAAe,CAC5B,GAAI,CACH,OAAO9E,EAAW,MAAM,KAAK,MAAM+E,EAAM,KAAKC,EAAOhC,CAAO,CAAC,CAAC,CAC/D,MAAQ,CACP,MAAM,IAAIiC,CACX,CACD,CACA,MAAO,CAAE,WAAU,OAAM,UAAS,cAAa,QAAO,QAAO,cAAa,UAAS,MAAK,CACzF,CACA,eAAef,EACd,EACA,EACA,EACA,EACA,EACA,EAAwC,CAAC,EACzC,EAA2C,CAAC,EAC5C,EAA0B,CAAC3D,CAAI,EAC/B,EAAQ,EACR,EAA6B,CAAC,EAC9B,EAAW4D,EACV7D,EACAC,EACAZ,EACA0E,EACApC,EACAqC,EACAN,EACAC,EAAQ,IAAM/C,EAAQ,GACvB,EACA,EACC,CACDF,EAAQ,OAAOpB,EAAO,CAAC,EACvB,GAAM,CAAE,WAAU,OAAM,UAAS,cAAa,QAAO,QAAO,cAAa,WAAYsF,EAC/EnE,EAAQE,EAAYZ,EAAUa,CAAM,EACpC6C,EAAO,CAAE,GAAGnC,EAAK,KAAM,GAAIuD,GAAU,CAAE,OAAQ,IAAK,CAAG,EAEvDC,EAAa,CAClB,GAAGxD,EACH,QACA,OACCb,GAAS,KACN,CAAC,EACD0D,EACClC,EAAenB,EAAOC,EAAON,EAAuB,IAAA,GAAWV,EAAS,aAAa,EACrFkC,EAAenB,EAAOC,EAAON,EAAuBa,EAAMvB,EAAS,WAAW,EACnF,cAAeU,GAAS,MAAQa,EAAK,aACtC,EACMyD,EAAgBZ,GAAWA,EAAQ,cAAgB,MACnD/B,EAAS,MAAM4C,EACpBC,EACAvE,EACA0D,EACAU,EACArF,EACAgF,EACA/B,EACAe,EACA,MAAO,EAAK,IAAc,CAEzB,GADIb,GAAWnD,EAAQ,iBAAiBsF,EAAgBhF,EAAS,OAASqE,EAAahE,CAAG,EACtF,CAACwC,GAAcuB,GAAW,CAACY,GAAiB,CAAC7E,EAAQE,EAAKL,EAAS,aAAa,EACnF,OAAO,KACRW,EAAQ,OAAOpB,CAAK,EACpB,IAAIgD,EAcJ,MAbA,CAICA,EAJG6B,GAAW,CAACY,EACN,MAAM5C,EAAIpC,EAAS,OAAQK,EAAI+D,EAAQ,gBAAgB,EAGvD/D,EAGT,CAACkC,GACD,CAACpC,EAAQoC,EAAQvC,EAAS,WAAW,GACrC,CAACO,EAAcgC,EAAO1C,EAAKG,EAAS,EAAE,CAAC,CAAC,OAAQA,EAAS,YAAY,GACrE,CAAE,MAAMkD,EAAQlD,EAAS,OAAQuC,EAAQhB,EAAK,SAAUhC,CAAK,EAEtD,KACDgE,EAAOvD,EAAS,OAAQuC,EAAQjD,EAAWiC,EAAK,KAAMoC,EAAMpE,EAAOqE,CAAO,CAClF,EACC,GAAQc,EAAM,KAAK,KAAK,UAAU,CAAE,OAAQS,EAAK,UAAWvB,EAAQ,MAAM,CAAC,CAAE,CAAC,EAAGjB,CAAO,EACzFqC,GACI,EAAQ,IAAO,CAGhB,IAAMI,EAAeF,EAOfG,EAASC,EAAetF,EAAS,OAAQsE,EAAY,KAAMc,CAAY,EAC7E,OAAOG,EAAO,QAAQ,KAAO,IAAa,CACzC5E,EAAQ,OAAOpB,CAAK,EACpB,IAAMsD,EAAY,MAAMlC,EAAQ,UAAU0D,EAAatB,CAAQ,EAC/DrD,EAAQ,gBAAgB,EACpBmD,GAAWnD,EAAQ,iBAAiB2E,EAAatB,CAAQ,EAC7D,IAAMyC,EAAYzC,EAASqB,EAAQ,iBAGnC,MAFI,CAACvB,GAAa,CAAC1C,EAAQ4C,EAAU/C,EAAS,aAAa,GAAKwF,GAAa,KACrE,IAAIC,EAAYlE,EAAK,KAAK,OAAS,MAAO8D,CAAM,EACjDK,EAAOC,EAAIP,CAAY,CAAC,CAC7B,MAAMpF,EAAS,MAAM,CAAC,CACtB,UAAUsE,EAAY,KAAO,GAAM,CAEnC,IAAI7B,EAAQC,EAENP,EAASD,EACdoC,EACAF,EAAQ,YACRoB,EACAjE,EACAvB,EAAS,WACV,EACA,IAAK,IAAM2C,KAAWR,EAErB,EAAQM,EAAM,GAAGE,EAAQ,MAAOA,EAAQ,KAAK,EAM9C,OAAOF,CACR,CAAC,CAAC,CACD,MAAMlB,EAAK,KAAK,OAAS,KAAK,CACjC,EAAG8D,CAAM,CACV,EACC,IAAA,GACHL,EAAgBhF,EAAS,OAASqE,CACnC,EAEA,OADA3E,EAAQ,gBAAgB,EACjBA,EAAQ,KAAKM,EAAS,OAAQV,CAAS,CAAC,CAAC,MAAM+C,CAAM,CAC7D,CACA,eAAeuD,EACd,EACA,EACA,EACA,EACA,EACA,EACA,EACC,CACD,GAAI,CAACjC,EAAK,QAAUA,EAAK,OAAS,GAAK,CAAChD,EAAQ,GAAG,YAAYkF,EAAWrB,CAAM,EAC/E,MAAM,IAAItF,EAAkB,kBAAkB,EAC/C,IAAIe,EAAQ4F,EACNC,EAAenC,EAAK,IAAK,GAAS,CACvC,IAAMoC,EAAchG,EAAKE,EAAOC,CAAI,EAEpC,MADA,GAAQ6F,EAAY,OACbA,CACR,CAAC,EACKC,EAAQF,EAAa,GAAG,EAAE,EAC1BjB,EAAWf,EAChBkC,EAAM,OACNrC,EAAK,GAAG,EAAE,EACVrE,EACA0E,EACApC,EACAqC,EACAN,EACAa,CACD,EAEMyB,EAAQjC,EAAM,SAAW,KAAO,KAAOa,EAAS,KAAKb,EAAM,MAAM,EACjEkC,EAAMlC,EAAM,WAAa,KAAO,KAAOa,EAAS,KAAKb,EAAM,SAAS,EACpEmC,EAAYF,GAAO,WAAaC,GAAK,WAAa,CAAC,EACzD,GACCC,EAAU,SAAWxC,EAAK,OAAS,GAClCsC,GAASC,GAAO,KAAK,UAAUD,EAAM,SAAS,IAAM,KAAK,UAAUC,EAAI,SAAS,GACjFC,EAAU,MAAM,EAAI,IAAM,CAACxF,EAAQ,GAAG,YAAYmF,EAAa5E,EAAE,CAAC,OAAQT,CAAE,CAAC,EAE7E,MAAM,IAAImE,EAGX,GAAI,CACH,IAAI/D,EAAS,MAAMuB,EAAIyD,EAAWrB,CAAM,EACxC,IAAK,IAAItD,EAAI,EAAGL,GAAUK,EAAIiF,EAAU,OAAQ,IAAK,CACpD,IAAMnG,EAAW8F,EAAa5E,GAC1BkF,EAAyB,KAC7B,GAAIpG,EAAS,cAAgB,MAAO,CACnC,IAAMuC,EAAS,MAAMS,EAAIhD,EAAUa,EAAQK,EAAI,CAAC,EAC5CqB,GAAQ,MAAQ4D,EAAUjF,KAAI,EAAQqB,EAC3C,MACC,UAAW,IAAMA,KAAUO,EAAS9C,EAAUa,EAAQK,EAAI,CAAC,EAC1D,GAAIqB,EAAO,MAAQ4D,EAAUjF,GAAI,CAChC,EAAQqB,EACR,KACD,CAEF,EAAS6D,CACV,CACA,OAAO,MAAMvC,EACZmC,EAAM,OACNnF,EACA8C,EAAK,GAAG,EAAE,EACVrE,EACA0E,EACApC,EACAqC,EACAN,EACAA,EAAK,OACL,CAACa,EAAQ,GAAG2B,CAAS,EACrBtB,EACA,CAAE,OAAQoB,GAAO,QAAU,KAAM,UAAWC,GAAK,QAAUlC,EAAM,SAAU,CAC5E,CACD,OAASqC,EAAO,CACfC,EAAkBD,CAAK,CACxB,CACD,CACA,MAAO,CAAE,UAAS,SAAQ,eAAc,MAAK,CAC9C,CAGA,SAASlD,EAAW,EAAyB,CAI5C,OAHIC,EAAI,OAAS,WAAmB,GAChCA,EAAI,OAAS,OAASA,EAAI,OAAS,KAAaA,EAAI,SAAS,MAAMD,CAAU,EAC7EC,EAAI,OAAS,OAASA,EAAI,OAAS,UAAkBD,EAAWC,EAAI,KAAK,EACtE,EACR"}

package/dist/relations.d.mts

@@ -39,19 +39,22 @@ type Native<T extends RelationTable, K extends keyof Fields<T>> = ConvexValidato
 declare const fieldBrand: unique symbol;
 declare const edgeBrand: unique symbol;
 type Comparable<Value> = Exclude<Value, null | undefined>;
+type IdMembers<Value, Registered extends string> = [Comparable<Value>] extends [never] ? never : [Comparable<Value>] extends [GenericId<string>] ? Extract<Comparable<Value>, GenericId<string>>['__tableName'] & Registered : never;
 type Same<A, B> = [Comparable<A> | Comparable<B>] extends [never] ? false : [Comparable<A>] extends [Comparable<B>] ? [Comparable<B>] extends [Comparable<A>] ? true : false : false;
-export interface FieldReference<Table extends string, Field extends string, Value, Scope extends string = never> {
+export interface FieldReference<Table extends string, Field extends string, Value, Scope extends string = never, Registered extends string = string, Member extends string = never> {
   readonly guard?: RelationGuard<Scope>;
   readonly [fieldBrand]: Value;
   readonly table: Table;
   readonly field: Field;
-  through<J extends AnyField>(junction: J & (Same<Value, J[typeof fieldBrand]> extends true ? {} : never)): ThroughReference<Table, Field, Value, J, Scope>;
+  /** Select a registered native-ID member, retaining this field's nullish wrappers. */
+  forTable<const T extends ([Scope] extends [never] ? IdMembers<Value, Registered> : never)>(table: T): FieldReference<Table, Field, Extract<Value, GenericId<T> | null | undefined>, Scope, Registered, T>;
+  through<J extends AnyField>(junction: J & ([Member] extends [never] ? {} : never) & (J extends FieldReference<string, string, any, any, any, infer M> ? [M] extends [never] ? {} : never : never) & (Same<Value, J[typeof fieldBrand]> extends true ? {} : never)): ThroughReference<Table, Field, Value, J, Scope>;
 }
 export interface RelationGuard<Tag extends string = string> {
   readonly discriminator: string;
   readonly tag: Tag;
 }
-type AnyField = FieldReference<string, string, any, any>;
+type AnyField = FieldReference<string, string, any, any, any, any>;
 export interface ThroughReference<Table extends string, Field extends string, Value, Junction extends AnyField, Scope extends string = never> {
   readonly base: FieldReference<Table, Field, Value, Scope>;
   readonly junction: Junction;
@@ -65,6 +68,8 @@ export interface RelationEdge<Source extends string, Target extends string, Card
   readonly sourceGuard?: RelationGuard<SourceScope>;
   readonly targetGuard?: RelationGuard<TargetScope>;
   readonly junctionGuard?: RelationGuard;
+  readonly sourceMember?: RelationMember;
+  readonly targetMember?: RelationMember;
   readonly [edgeBrand]: true;
   readonly source: Source;
   readonly target: Target;
@@ -72,8 +77,11 @@ export interface RelationEdge<Source extends string, Target extends string, Card
   readonly from: Leg;
   readonly to: Leg;
 }
+interface RelationMember {
+  readonly table: string;
+}
 type AnyEdge = RelationEdge<string, string, 'one' | 'many', any, any>;
-type FieldReferences<Tables extends RelationTables> = { [T in keyof Tables]: { [K in Extract<keyof Fields<Tables[T]>, string>]: FieldReference<Extract<T, string>, K, Native<Tables[T], K>>; }; };
+type FieldReferences<Tables extends RelationTables> = { [T in keyof Tables]: { [K in Extract<keyof Fields<Tables[T]>, string>]: FieldReference<Extract<T, string>, K, Native<Tables[T], K>, never, Extract<keyof Tables, string>>; }; };
 export type BranchBuilder<Tables extends RelationTables> = <const T extends keyof Tables & string, const Tag extends Tags<Tables[T]>>(table: T, tag: Tag) => { [K in keyof BranchFields<Tables[T], Tag> & string]: FieldReference<T, K, ConvexValidatorFromZod<Extract<BranchFields<Tables[T], Tag>[K], z.ZodType>, 'required'>['type'], Tag>; };
 type Scope<L extends Leg> = NonNullable<Base<L>['guard']>['tag'];
 type AllReferences<Tables extends RelationTables> = { [T in keyof Tables]: FieldReferences<Tables>[T][Extract<keyof FieldReferences<Tables>[T], string>]; }[keyof Tables];

package/dist/relations.mjs

@@ -1,2 +1,2 @@
-import{nativePagination as e,relationFilterSchema as t,scalarPredicateSchema as n}from"./querying/filters.mjs";import{paginated as r}from"./zod-table.mjs";import{convexToZod as i,zodToConvex as a}from"convex-helpers/server/zod4";import{z as o}from"zod";import{v as s}from"convex/values";const c=Symbol(`relationField`),l=Symbol(`relationEdge`),u=/* @__PURE__ */ new WeakMap,d=/* @__PURE__ */ new WeakMap,f=/* @__PURE__ */ new WeakMap,p=/* @__PURE__ */ new WeakSet,m=/* @__PURE__ */ new WeakSet,h=o.object({indexes:o.array(o.object({indexDescriptor:o.string(),fields:o.array(o.string())}))});function g(n,i){let s={},l=/* @__PURE__ */ new Set,g=/* @__PURE__ */ new Map,_={},v={},y={};for(let[e,t]of Object.entries(n)){if(t.tableName!==e||[`one`,`many`,`__proto__`,`constructor`,`prototype`].includes(e))throw Error(`Invalid relation table "${e}"`);let n=t.dto(!0);if(!(n instanceof o.ZodObject)&&!(n instanceof o.ZodDiscriminatedUnion))throw Error(`Expected object or discriminated union DTO`);let r=B(n),i=N(t.table);I(i.documentType);let u=j(e,t.schema,n,i.documentType),d=h.parse(i).indexes.map(e=>({name:e.indexDescriptor,fields:[...e.fields]})).sort((e,t)=>e.name.localeCompare(t.name));I(P(a(n))),s[e]={...u,indexes:d,dto:n,assertUnchanged:r};let m=(t,n)=>{let r=Object.create(null);for(let[i,a]of Object.entries(t)){let t={[c]:void 0,table:e,field:i,guard:n,through(e){let n=f.get(e);if(!l.has(e)||!n||!w(a,n))throw Error(`Invalid junction field or registry`);let r=Object.freeze({base:t,junction:e});return p.add(r),r}};f.set(t,a),l.add(t),r[i]=Object.freeze(t)}return Object.freeze(r)};if(_[e]=m(u.fields),u.branches)for(let[t,n]of Object.entries(u.branches.options))g.set(JSON.stringify([e,t]),m(n.fields,Object.freeze({discriminator:u.branches.discriminator,tag:t})));v[e]=t=>S(e,`one`,t,l),y[e]=t=>S(e,`many`,t,l)}let C=i(Object.freeze({..._,one:Object.freeze(v),many:Object.freeze(y)}),((e,t)=>{let n=g.get(JSON.stringify([e,t]));if(!n)throw Error(`Unknown variant scope "${e}.${t}"`);return n})),T=Object.fromEntries(Object.entries(C).map(([e,t])=>[e,Object.freeze({...t})]));Object.freeze(T);for(let[e,t]of Object.entries(T)){if(!Object.hasOwn(n,e))throw Error(`Unknown source table "${e}"`);for(let[n,r]of Object.entries(t)){if(s[e].allFields.has(n)||s[e].branches&&[`variant`,`variants`].includes(n)||[`and`,`or`,`not`,`fields`,`then`,`__proto__`,`constructor`,`prototype`].includes(n))throw Error(`Relation name collision "${n}"`);if(!m.has(r)||!l.has(x(r.from))||!l.has(x(r.to))||r.source!==e)throw Error(`Relation source bucket mismatch`);E(r,s)}}let D={metadata:s,declarations:T},M={};for(let i of Object.keys(n))M[i]={paginationOpts(n){return W(D),b(n),K(e.extend({filters:t(k(D,i,n)).optional(),order:o.enum([`asc`,`desc`]).optional()}),()=>W(D))},pageDto(e){return W(D),b(e),K(r(A(D,i,e)).result,()=>W(D))}};let L=JSON.stringify([2,Object.entries(s).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,Object.entries(t.fields).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,t.isOptional,P(t)]),t.branches?[t.branches.discriminator,Object.entries(t.branches.options).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,Object.entries(t.fields).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,t.isOptional,P(t)])])]:null,t.indexes,F(P(a(t.dto)))]),Object.entries(T).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,Object.entries(t).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,t.cardinality,t.target,O(t.from),O(t.to)])])]),R=Object.freeze({identity:L,version:1,tables:Object.freeze(M)});u.set(R,Y(D));let z=Object.freeze({...n}),V=Object.fromEntries(Object.entries(z).map(([e,t])=>{let n=U(t.schema,`stored`),r=U(t.publicDto,`dto`),i=t.table.validator,a=i.isOptional,o=JSON.stringify(N(t.table));return[e,()=>{if(n(),r(),t.table.validator!==i||i.isOptional!==a||JSON.stringify(N(t.table))!==o)throw Error(`Native schema mutated after registry construction: ${e}`)}]}));for(let[e,t]of Object.entries(s)){if(!t.branches)continue;let n=t.assertUnchanged;t.assertUnchanged=()=>{n(),V[e]()}}return d.set(R,{internal:D,tables:z,assertStoredUnchanged:()=>{for(let e of Object.values(V))e()},assertNativeTable(e,t){if(!Object.hasOwn(z,e)||z[e].table!==t)throw Error(`Native schema/table ownership disagrees with relation registry`);V[e]()}}),R}function _(a){let c=d.get(a);if(!c)throw Error(`Unknown relation registry`);let l=()=>{W(c.internal),c.assertStoredUnchanged()},u=e=>{l();let t=Object.keys(c.tables);if(t.length!==Object.keys(e).length||t.some(t=>e[t]!==c.tables[t].table))throw Error(`Native schema/table ownership disagrees with relation registry`)};l();let f=/* @__PURE__ */ new WeakMap;function p(e,t){l();let n=c.internal.metadata[e];if(!n)throw Error(`Unknown query table`);if(!n.branches)return;let r=o.string().safeParse(t[n.branches.discriminator]),a=r.success&&Object.hasOwn(n.branches.options,r.data)?n.branches.options[r.data]:void 0;if(!a)throw Error(`Invalid variant document`);let u=Object.fromEntries(Object.keys(a.fields).filter(e=>Object.hasOwn(t,e)).map(e=>[e,t[e]])),d=f.get(a);d||(d=i(s.object(a.fields)),f.set(a,d)),d.parse(u)}return Object.freeze({assertUnchanged:l,validateDocument:p,assertNativeTable:c.assertNativeTable,assertSchema:u,pagination(r){l();let i=c.internal,a=/* @__PURE__ */ new Map;function s(e,t,r){let o=i.metadata[e];if(!o)throw Error(`Unknown query table`);let c=JSON.stringify([e,r??null]),l=a.get(c);if(!l){l={};for(let[e,t]of Object.entries(r===void 0?o.fields:o.branches.options[r].fields))y(t)&&(l[e]=n(t).optional());a.set(c,l)}return{fields:l,variants:o.branches&&r===void 0&&t<4?{discriminator:o.branches.discriminator,options:Object.fromEntries(Object.keys(o.branches.options).map(n=>[n,s(e,t+1,n)]))}:void 0,relations:t>=4?{}:Object.fromEntries(Object.entries(i.declarations[e]??{}).map(([e,n])=>[e,{cardinality:n.cardinality,target:s(n.target,t+1)}]))}}return e.extend({filters:t(s(r,0)).optional(),order:o.enum([`asc`,`desc`]).optional()})},page(e,t){return l(),b(t),r(A(c.internal,e,t)).result},project(e,t,n,r){if(u(e),!r())return null;let i=c.internal.metadata[t];if(!i)throw Error(`Unknown query table`);let a=i.branches?i.branches.options[String(n[i.branches.discriminator])]:void 0;if(i.branches&&!a)throw Error(`Invalid variant document`);let s=a?.dto??i.dto;if(!(s instanceof o.ZodObject))throw Error(`Invalid variant DTO`);return p(t,n),s.parse(Object.fromEntries(Object.keys(s.shape).filter(e=>Object.hasOwn(n,e)).map(e=>[e,n[e]])))}})}function v(e){let t=u.get(e);if(!t)throw Error(`Unknown relation registry`);return t}function y(e){return[`id`,`string`,`float64`,`int64`,`boolean`,`null`,`literal`].includes(e.kind)||e.kind===`union`&&e.members.every(y)}function b(e){let t=[{value:e,depth:0,ancestors:[]}],n=0;for(;t.length;){let{value:e,depth:r,ancestors:i}=t.pop();if(++n>256||r>4||i.includes(e))throw Error(`Selection cycle or depth/node budget exceeded`);let a=Object.getPrototypeOf(e);if(a!==Object.prototype&&a!==null)throw Error(`Invalid selection`);let o=Reflect.ownKeys(e);if(o.length+n+t.length>256)throw Error(`Selection node budget exceeded`);for(let a of o){let o=Object.getOwnPropertyDescriptor(e,a);if(!o.enumerable||!(`value`in o)||String(a)!==a)throw Error(`Invalid selection property`);if(o.value!==!0)t.push({value:o.value,depth:r+1,ancestors:[...i,e]});else if(++n>256)throw Error(`Selection node budget exceeded`)}}}function x(e){return`base`in e?e.base:e}function S(e,t,n,r){for(let e of[n.from,n.to])if(!r.has(x(e))||`base`in e&&(!p.has(e)||!r.has(e.junction)))throw Error(`Foreign registry or invalid field reference`);if(x(n.to).table!==e)throw Error(`Wrong relation target table`);let i=Object.freeze({[l]:!0,source:x(n.from).table,target:e,cardinality:t,from:n.from,to:n.to,sourceGuard:x(n.from).guard,targetGuard:x(n.to).guard,junctionGuard:C(n.from,n.to)});return m.add(i),i}function C(e,t){let n=`base`in e?e.junction.guard:void 0,r=`base`in t?t.junction.guard:void 0;if(n&&r&&(n.discriminator!==r.discriminator||n.tag!==r.tag))throw Error(`Contradictory junction scopes`);return n??r}function w(e,t){let n=T(e);return n.length>0&&JSON.stringify(n)===JSON.stringify(T(t))}function T(e){if(e.kind===`union`)return[...new Set(e.members.flatMap(T))].sort();if(e.kind===`null`)return[];if(![`id`,`string`,`float64`,`int64`,`boolean`,`literal`].includes(e.kind))throw Error(`Unsupported relation field kind`);return[JSON.stringify(P(e))]}function E(e,t){let n=e.from,r=e.to;if(`base`in n!=`base`in r)throw Error(`Both relation legs must use through`);if(`base`in n&&`base`in r){if(n.junction.table!==r.junction.table)throw Error(`Different junction tables`);D(t,n.junction.table,n.junction.field,e.junctionGuard),D(t,e.target,r.base.field,e.targetGuard);return}if(!w(f.get(x(n)),f.get(x(r))))throw Error(`Incompatible relation field types`);D(t,e.target,x(r).field,e.targetGuard)}function D(e,t,n,r){if(n!==`_id`&&!e[t].indexes.some(e=>{let t=e.fields.indexOf(n);return t>=0&&e.fields.slice(0,t).every(e=>e===r?.discriminator)}))throw Error(`No active index begins with or has a guarded prefix for "${t}.${n}"`)}function O(e){return`base`in e?[e.base.table,e.base.field,e.base.guard??null,e.junction.table,e.junction.field,e.junction.guard??null]:[e.table,e.field,e.guard??null]}function k(e,t,r,i=0,a){let o={},s={},c=e.metadata[t],l={};for(let[u,d]of Object.entries(r)){if(u===`variants`&&d!==!0&&c.branches&&a===void 0){if(i>=4)throw Error(`Invalid variant selection`);for(let[n,a]of Object.entries(d)){if(!Object.hasOwn(c.branches.options,n)||a===!0)throw Error(`Unknown variant filter selection`);l[n]=k(e,t,{...Object.fromEntries(Object.entries(r).filter(([e])=>e!==`variants`)),...a},i+1,n)}continue}let f=(a===void 0?c.fields:c.branches.options[a].fields)[u],p=e.declarations[t]?.[u];if(d===!0&&f)o[u]=n(f).optional();else if(d!==!0&&p&&i<4)s[u]={cardinality:p.cardinality,target:k(e,p.target,d,i+1)};else throw Error(`Invalid relation filter selection "${t}.${u}"`)}return{fields:o,relations:s,variants:c.branches&&a===void 0?{discriminator:c.branches.discriminator,options:l}:void 0}}function A(e,t,n,i=0){let a={};for(let[s,c]of Object.entries(n)){let n=e.declarations[t]?.[s];if(!n||i>=4)throw Error(`Unknown or too deep relation "${t}.${s}"`);let l=c===!0?e.metadata[n.target].dto:A(e,n.target,c,i+1);if(n.targetGuard){if(!(l instanceof o.ZodDiscriminatedUnion))throw Error(`Invalid target scope`);l=l.options.find(e=>e.shape[n.targetGuard.discriminator]instanceof o.ZodLiteral&&e.shape[n.targetGuard.discriminator].value===n.targetGuard.tag)}a[s]=n.cardinality===`one`?l.nullable():r(l).result}let s=e.metadata[t];function c(n,r){let i={...a};for(let n of Object.keys(i)){let a=e.declarations[t][n];a.sourceGuard&&r!==a.sourceGuard.tag&&a.cardinality===`one`&&(i[n]=o.null())}return K(n.extend(i).strict(),()=>W(e))}if(s.branches){let t=Object.entries(s.branches.options).map(([e,t])=>c(t.dto,e));return J(o.discriminatedUnion(s.branches.discriminator,[t[0],...t.slice(1)]),()=>W(e))}if(!(s.dto instanceof o.ZodObject))throw Error(`Expected object DTO`);return c(s.dto)}function j(e,t,n,r){if(t instanceof o.ZodObject&&n instanceof o.ZodObject){let n=a(t).fields;return L(e,n,r),{fields:n,allFields:new Set(Object.keys(n))}}if(!(t instanceof o.ZodDiscriminatedUnion)||!(n instanceof o.ZodDiscriminatedUnion))throw Error(`Expected matching discriminated union boundaries "${e}"`);let i=t._zod.def.discriminator;if(n._zod.def.discriminator!==i)throw Error(`DTO discriminator mismatch`);function c(e){let t=Object.create(null);for(let n of e.options){if(!(n instanceof o.ZodObject))throw Error(`Variant branches must be objects`);let e=n.shape[i];if(!(e instanceof o.ZodLiteral)||e.values.size!==1)throw Error(`Variant tags must be unique required string literals`);let r=o.string().safeParse(e.value);if(!r.success||Object.hasOwn(t,r.data))throw Error(`Variant tags must be unique required string literals`);t[r.data]=n}if(Object.keys(t).length===0)throw Error(`Expected at least one variant branch`);return t}let l=c(t),u=c(n);if(Object.keys(l).sort().join(`\0`)!==Object.keys(u).sort().join(`\0`))throw Error(`DTO variant tags mismatch`);let d={discriminator:i,options:Object.create(null)},f=[];for(let[t,n]of Object.entries(l)){let r=a(n).fields,{_id:i,_creationTime:o,...c}=r;L(e,r,P(s.object(c))),f.push(s.object(c)),d.options[t]={fields:r,dto:u[t]}}if(F(r)!==F(P(s.union(...f))))throw Error(`Native stored document disagrees with boundary "${e}"`);let p=Object.values(d.options).map(e=>e.fields),m={};for(let e of Object.keys(p[0])){if(!p.every(t=>Object.hasOwn(t,e))||e!==i&&!p.every(t=>M(t[e],p[0][e])))continue;let t=p.map(t=>t[e]),n=s.union(...t);m[e]=t.some(e=>e.isOptional===`optional`)?s.optional(n):n}return{fields:m,branches:d,allFields:new Set(p.flatMap(e=>Object.keys(e)))}}function M(e,t){try{return w(e,t)}catch{return F(P(e))===F(P(t))}}function N(e){return e.export()}function P(e){return e.json}function F(e){if(Array.isArray(e))return`[${e.map(F).join(`,`)}]`;if(e!==null&&Object(e)===e){let t=e;return`{${Object.keys(t).sort().map(e=>`${JSON.stringify(e)}:${F(t[e])}`).join(`,`)}}`}return JSON.stringify(e)}function I(e){if(e===null||Object(e)!==e)return;let t=e;if(t.type===`any`)throw Error(`Unsupported native validation form`);for(let e of Object.values(t))I(e)}function L(e,t,n){let{_id:r,_creationTime:i,...a}=t;if(!r||!i||F(P(r))!==F(P(s.id(e)))||F(P(i))!==F(P(s.number()))||r.isOptional!==`required`||i.isOptional!==`required`||F(n)!==F(P(s.object(a))))throw Error(`Native stored document disagrees with boundary "${e}"`)}const R=o.object({field:o.string()}),z=new Set([R,R.pick({field:!0}),R.omit({field:!0}),R.extend({other:o.string()}),R.safeExtend({other:o.string()}),R.merge(o.object({other:o.string()})),R.partial(),R.required()].flatMap(e=>{let t=Object.getOwnPropertyDescriptor(e._zod.def,`shape`)?.get;return t?[Function.prototype.toString.call(t)]:[]}));function B(e){return U(e,`dto`)}const V=Function.prototype.toString.call(Object.getOwnPropertyDescriptor(o.string().default(``)._zod.def,`defaultValue`).get),H=Function.prototype.toString.call(Object.getOwnPropertyDescriptor(o.string().prefault(``)._zod.def,`defaultValue`).get);function U(e,t){let n=[],r=/* @__PURE__ */ new Set,i=[],a=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=[];function l(e,u){if(s.has(e))throw Error(`Unsupported cyclic DTO schema`);if(!a.has(e)){if(u>32||n.length>=4096)throw Error(`DTO schema graph budget exceeded`);a.add(e),s.add(e);try{if(e instanceof RegExp&&i.push({expression:e,source:e.source,flags:e.flags}),e instanceof o.core.$ZodCheck&&`check`in e._zod.def){if(t===`dto`&&e._zod.def.check===`overwrite`)throw Error(`Unsupported DTO overwrite check`);l(e._zod.def,u+1),n.push({object:e._zod,exactKeys:!1,keys:[`def`,`check`],values:[`def`,`check`].map(t=>Object.getOwnPropertyDescriptor(e._zod,t))});return}if(e instanceof o.core.$ZodType){let i=e._zod.def;if(t===`dto`&&(![`object`,`array`,`optional`,`nullable`,`nonoptional`,`union`,`intersection`,`tuple`,`record`,`string`,`number`,`boolean`,`bigint`,`null`,`never`,`literal`,`enum`].includes(i.type)||`coerce`in i&&i.coerce))throw Error(`Unsupported DTO schema "${i.type}"`);if(t===`stored`&&(i.type==="default"||i.type===`prefault`)){let e=Object.getOwnPropertyDescriptor(i,`defaultValue`);if(e?.get){if(e.set||Function.prototype.toString.call(e.get)!==(i.type==="default"?V:H))throw Error(`Unsupported stored schema accessor`);r.add(i)}}if(e instanceof o.ZodUnion&&(l(e.options,u+1),n.push({object:e,exactKeys:!1,keys:[`options`],values:[Object.getOwnPropertyDescriptor(e,`options`)]})),i.type===`object`){let t=Object.getOwnPropertyDescriptor(i,`shape`);if(t?.get){if(t.set||!z.has(Function.prototype.toString.call(t.get)))throw Error(`Unsupported DTO schema accessor`);let e=i.shape;l(e,u+1),Object.getOwnPropertyDescriptor(i,`shape`)?.get&&c.push({definition:i,fields:e})}if(e instanceof o.ZodObject){let t=Object.getOwnPropertyDescriptor(e,`shape`);if(t&&!(`value`in t))throw Error(`Unsupported DTO schema accessor`);l(e.shape,u+1)}}l(i,u+1),n.push({object:e._zod,exactKeys:!1,keys:[`def`],values:[Object.getOwnPropertyDescriptor(e._zod,`def`)]});return}let a=Reflect.ownKeys(e),s=a.map(t=>Object.getOwnPropertyDescriptor(e,t));if(s.some((t,n)=>!(`value`in t)&&!c.some(({definition:t})=>t===e&&a[n]===`shape`)&&!(r.has(e)&&a[n]===`defaultValue`)))throw Error(`Unsupported DTO schema accessor`);n.push({object:e,exactKeys:!0,keys:a,values:s});for(let e of s)e.value!==null&&Object(e.value)===e.value&&!(e.value instanceof Function)&&l(e.value,u+1)}finally{s.delete(e)}}}return l(e,0),()=>{for(let e of i)if(e.expression.source!==e.source||e.expression.flags!==e.flags)throw Error(`DTO schema mutated after registry construction`);for(let e of n){let t=e.keys;if(e.exactKeys&&Reflect.ownKeys(e.object).length!==t.length)throw Error(`DTO schema mutated after registry construction`);for(let n=0;n<t.length;n++){if(e.object instanceof RegExp&&t[n]===`lastIndex`)continue;let r=Object.getOwnPropertyDescriptor(e.object,t[n]),i=e.values[n];if(!r||r.value!==i.value||r.get!==i.get||r.set!==i.set||r.enumerable!==i.enumerable)throw Error(`DTO schema mutated after registry construction`)}}for(let{definition:e,fields:t}of c){let n=e.shape,r=Reflect.ownKeys(t);if(Reflect.ownKeys(n).length!==r.length||r.some(e=>Object.getOwnPropertyDescriptor(n,e)?.value!==Object.getOwnPropertyDescriptor(t,e)?.value))throw Error(`DTO schema mutated after registry construction`)}}}function W(e){for(let t of Object.values(e.metadata))t.assertUnchanged()}const G=o.core.$constructor(`GuardedDtoObject`,(e,t)=>{let n=t;o.ZodObject.init(e,t),e._zod.deferred??=[],e._zod.deferred.push(()=>{let t=e._zod.run;e._zod.run=(e,r)=>{try{n.assertUnchanged()}catch{return e.issues.push({code:`custom`,input:e.value,message:`DTO schema mutated after registry construction`}),e}return t(e,r)}})});function K(e,t){let n=e.shape,r={...e._zod.def,assertUnchanged:t};return Object.defineProperty(r,"shape",{enumerable:!0,configurable:!0,get:()=>(t(),n)}),new G(r)}const q=o.core.$constructor(`GuardedDtoUnion`,(e,t)=>{let n=t;o.ZodDiscriminatedUnion.init(e,t),e._zod.deferred??=[],e._zod.deferred.push(()=>{let t=e._zod.run;e._zod.run=(e,r)=>{try{n.assertUnchanged()}catch{return e.issues.push({code:`custom`,input:e.value,message:`DTO schema mutated after registry construction`}),e}return t(e,r)}})});function J(e,t){let n=e.options,r={...e._zod.def,assertUnchanged:t};return Object.defineProperty(r,"options",{enumerable:!0,configurable:!0,get:()=>(t(),n)}),new q(r)}function Y(e){let t={};for(let[n,r]of Object.entries(e.metadata)){let e={};for(let[t,n]of Object.entries(r.fields))e[t]=Object.freeze({kind:n.kind,optional:n.isOptional===`optional`,nullable:X(n),idTables:Object.freeze(Z(n)),native:Q(P(n))});t[n]=Object.freeze({fields:Object.freeze(e),variant:r.branches?Object.freeze({discriminator:r.branches.discriminator,tags:Object.freeze(Object.keys(r.branches.options))}):void 0,indexes:Object.freeze(r.indexes.map(e=>Object.freeze({name:e.name,fields:Object.freeze([...e.fields])})))})}return Object.freeze({tables:Object.freeze(t),declarations:e.declarations})}function X(e){return e.kind===`null`||e.kind===`union`&&e.members.some(X)}function Z(e){return e.kind===`id`?[e.tableName]:e.kind===`union`?[...new Set(e.members.flatMap(Z))].sort():[]}function Q(e){let t=structuredClone(e),n=[t];for(;n.length;){let e=n.pop();if(Object(e)!==e)continue;let t=e;Object.freeze(t),n.push(...Object.values(t))}return t}export{g as defineRelations,_ as getRelationExecutor,v as getRelationMetadata};
+import{nativePagination as e,relationFilterSchema as t,scalarPredicateSchema as n}from"./querying/filters.mjs";import{paginated as r}from"./zod-table.mjs";import{convexToZod as i,zodToConvex as a}from"convex-helpers/server/zod4";import{z as o}from"zod";import{v as s}from"convex/values";const c=Symbol(`relationField`),l=Symbol(`relationEdge`),u=/* @__PURE__ */ new WeakMap,d=/* @__PURE__ */ new WeakMap,f=/* @__PURE__ */ new WeakMap,p=/* @__PURE__ */ new WeakMap,m=/* @__PURE__ */ new WeakSet,h=/* @__PURE__ */ new WeakSet,g=o.object({indexes:o.array(o.object({indexDescriptor:o.string(),fields:o.array(o.string())}))});function _(n,i){let l={},_=/* @__PURE__ */ new Set,v=/* @__PURE__ */ new Map,y={},b={},w={};for(let[e,t]of Object.entries(n)){if(t.tableName!==e||[`one`,`many`,`__proto__`,`constructor`,`prototype`].includes(e))throw Error(`Invalid relation table "${e}"`);let n=t.dto(!0);if(!(n instanceof o.ZodObject)&&!(n instanceof o.ZodDiscriminatedUnion))throw Error(`Expected object or discriminated union DTO`);let r=H(n),i=F(t.table);R(i.documentType);let u=N(e,t.schema,n,i.documentType),d=g.parse(i).indexes.map(e=>({name:e.indexDescriptor,fields:[...e.fields]})).sort((e,t)=>e.name.localeCompare(t.name));R(I(a(n))),l[e]={...u,indexes:d,dto:n,assertUnchanged:r};let h=(t,n)=>{let r=Object.create(null);function i(t,r,a){let o={[c]:void 0,table:e,field:t,guard:n,forTable(e){if(n)throw Error(`forTable on branch-scoped fields is unsupported`);if(!T(r)?.includes(e))throw Error(`Invalid native ID member selection`);if(!Object.hasOwn(l,e))throw Error(`Native ID member table is not registered`);let a=Q(r)?s.union(s.id(e),s.null()):s.id(e);return i(t,r.isOptional===`optional`?s.optional(a):a,Object.freeze({table:e}))},through(e){if(a||p.has(e))throw Error(`forTable with through is unsupported`);let t=f.get(e);if(!_.has(e)||!t||!E(r,t))throw Error(`Invalid junction field or registry`);let n=Object.freeze({base:o,junction:e});return m.add(n),n}};return f.set(o,r),a&&p.set(o,a),_.add(o),Object.freeze(o)}for(let[e,n]of Object.entries(t))r[e]=i(e,n);return Object.freeze(r)};if(y[e]=h(u.fields),u.branches)for(let[t,n]of Object.entries(u.branches.options))v.set(JSON.stringify([e,t]),h(n.fields,Object.freeze({discriminator:u.branches.discriminator,tag:t})));b[e]=t=>C(e,`one`,t,_),w[e]=t=>C(e,`many`,t,_)}let D=i(Object.freeze({...y,one:Object.freeze(b),many:Object.freeze(w)}),((e,t)=>{let n=v.get(JSON.stringify([e,t]));if(!n)throw Error(`Unknown variant scope "${e}.${t}"`);return n})),k=Object.fromEntries(Object.entries(D).map(([e,t])=>[e,Object.freeze({...t})]));Object.freeze(k);for(let[e,t]of Object.entries(k)){if(!Object.hasOwn(n,e))throw Error(`Unknown source table "${e}"`);for(let[n,r]of Object.entries(t)){if(l[e].allFields.has(n)||l[e].branches&&[`variant`,`variants`].includes(n)||[`and`,`or`,`not`,`fields`,`then`,`__proto__`,`constructor`,`prototype`].includes(n))throw Error(`Relation name collision "${n}"`);if(!h.has(r)||!_.has(S(r.from))||!_.has(S(r.to))||r.source!==e)throw Error(`Relation source bucket mismatch`);O(r,l)}}let P={metadata:l,declarations:k},z={};for(let i of Object.keys(n))z[i]={paginationOpts(n){return K(P),x(n),J(e.extend({filters:t(j(P,i,n)).optional(),order:o.enum([`asc`,`desc`]).optional()}),()=>K(P))},pageDto(e){return K(P),x(e),J(r(M(P,i,e)).result,()=>K(P))}};let B=JSON.stringify([2,Object.entries(l).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,Object.entries(t.fields).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,t.isOptional,I(t)]),t.branches?[t.branches.discriminator,Object.entries(t.branches.options).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,Object.entries(t.fields).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,t.isOptional,I(t)])])]:null,t.indexes,L(I(a(t.dto)))]),Object.entries(k).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,Object.entries(t).sort(([e],[t])=>e.localeCompare(t)).map(([e,t])=>[e,t.cardinality,t.target,A(t.from),A(t.to)])])]),V=Object.freeze({identity:B,version:1,tables:Object.freeze(z)});u.set(V,Z(P));let U=Object.freeze({...n}),W=Object.fromEntries(Object.entries(U).map(([e,t])=>{let n=G(t.schema,`stored`),r=G(t.publicDto,`dto`),i=t.table.validator,a=i.isOptional,o=JSON.stringify(F(t.table));return[e,()=>{if(n(),r(),t.table.validator!==i||i.isOptional!==a||JSON.stringify(F(t.table))!==o)throw Error(`Native schema mutated after registry construction: ${e}`)}]}));for(let[e,t]of Object.entries(l)){if(!t.branches)continue;let n=t.assertUnchanged;t.assertUnchanged=()=>{n(),W[e]()}}return d.set(V,{internal:P,tables:U,assertStoredUnchanged:()=>{for(let e of Object.values(W))e()},assertNativeTable(e,t){if(!Object.hasOwn(U,e)||U[e].table!==t)throw Error(`Native schema/table ownership disagrees with relation registry`);W[e]()}}),V}function v(a){let c=d.get(a);if(!c)throw Error(`Unknown relation registry`);let l=()=>{K(c.internal),c.assertStoredUnchanged()},u=e=>{l();let t=Object.keys(c.tables);if(t.length!==Object.keys(e).length||t.some(t=>e[t]!==c.tables[t].table))throw Error(`Native schema/table ownership disagrees with relation registry`)};l();let f=/* @__PURE__ */ new WeakMap,p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new WeakMap;function g(e,t){l();let n=c.internal.metadata[e];if(!n)throw Error(`Unknown query table`);if(!n.branches)return;let r=o.string().safeParse(t[n.branches.discriminator]),a=r.success&&Object.hasOwn(n.branches.options,r.data)?n.branches.options[r.data]:void 0;if(!a)throw Error(`Invalid variant document`);let u=Object.fromEntries(Object.keys(a.fields).filter(e=>Object.hasOwn(t,e)).map(e=>[e,t[e]])),d=f.get(a);d||(d=i(s.object(a.fields)),f.set(a,d)),d.parse(u)}return Object.freeze({assertUnchanged:l,validateDocument:g,assertNativeTable:c.assertNativeTable,assertSchema:u,pagination(r){l();let i=c.internal;function a(e,t,r){let o=JSON.stringify([e,t,r??null]),s=m.get(o);if(s)return s;let c=i.metadata[e];if(!c)throw Error(`Unknown query table`);let l=JSON.stringify([e,r??null]),u=p.get(l);if(!u){u={};for(let[e,t]of Object.entries(r===void 0?c.fields:c.branches.options[r].fields))b(t)&&(u[e]=n(t).optional());p.set(l,u)}let d={fields:u,variants:c.branches&&r===void 0&&t<4?{discriminator:c.branches.discriminator,options:Object.fromEntries(Object.keys(c.branches.options).map(n=>[n,a(e,t+1,n)]))}:void 0,relations:t>=4?{}:Object.fromEntries(Object.entries(i.declarations[e]??{}).map(([e,n])=>[e,{cardinality:n.cardinality,target:a(n.target,t+1)}]))};return m.set(o,d),d}return e.extend({filters:t(a(r,0),h).optional(),order:o.enum([`asc`,`desc`]).optional()})},page(e,t){return l(),x(t),r(M(c.internal,e,t)).result},project(e,t,n,r){if(u(e),!r())return null;let i=c.internal.metadata[t];if(!i)throw Error(`Unknown query table`);let a=i.branches?i.branches.options[String(n[i.branches.discriminator])]:void 0;if(i.branches&&!a)throw Error(`Invalid variant document`);let s=a?.dto??i.dto;if(!(s instanceof o.ZodObject))throw Error(`Invalid variant DTO`);return g(t,n),s.parse(Object.fromEntries(Object.keys(s.shape).filter(e=>Object.hasOwn(n,e)).map(e=>[e,n[e]])))}})}function y(e){let t=u.get(e);if(!t)throw Error(`Unknown relation registry`);return t}function b(e){return[`id`,`string`,`float64`,`int64`,`boolean`,`null`,`literal`].includes(e.kind)||e.kind===`union`&&e.members.every(b)}function x(e){let t=[{value:e,depth:0,ancestors:[]}],n=0;for(;t.length;){let{value:e,depth:r,ancestors:i}=t.pop();if(++n>256||r>4||i.includes(e))throw Error(`Selection cycle or depth/node budget exceeded`);let a=Object.getPrototypeOf(e);if(a!==Object.prototype&&a!==null)throw Error(`Invalid selection`);let o=Reflect.ownKeys(e);if(o.length+n+t.length>256)throw Error(`Selection node budget exceeded`);for(let a of o){let o=Object.getOwnPropertyDescriptor(e,a);if(!o.enumerable||!(`value`in o)||String(a)!==a)throw Error(`Invalid selection property`);if(o.value!==!0)t.push({value:o.value,depth:r+1,ancestors:[...i,e]});else if(++n>256)throw Error(`Selection node budget exceeded`)}}}function S(e){return`base`in e?e.base:e}function C(e,t,n,r){for(let e of[n.from,n.to])if(!r.has(S(e))||`base`in e&&(!m.has(e)||!r.has(e.junction)))throw Error(`Foreign registry or invalid field reference`);if(S(n.to).table!==e)throw Error(`Wrong relation target table`);let i=Object.freeze({[l]:!0,source:S(n.from).table,target:e,cardinality:t,from:n.from,to:n.to,sourceGuard:S(n.from).guard,targetGuard:S(n.to).guard,junctionGuard:w(n.from,n.to),sourceMember:p.get(S(n.from)),targetMember:p.get(S(n.to))});return h.add(i),i}function w(e,t){let n=`base`in e?e.junction.guard:void 0,r=`base`in t?t.junction.guard:void 0;if(n&&r&&(n.discriminator!==r.discriminator||n.tag!==r.tag))throw Error(`Contradictory junction scopes`);return n??r}function T(e){if(e.kind===`id`)return[e.tableName];if(e.kind===`null`)return[];if(e.kind!==`union`)return null;let t=e.members.map(T);return t.some(e=>e===null)?null:[...new Set(t.flatMap(e=>e))].sort()}function E(e,t){let n=D(e);return n.length>0&&JSON.stringify(n)===JSON.stringify(D(t))}function D(e){if(e.kind===`union`)return[...new Set(e.members.flatMap(D))].sort();if(e.kind===`null`)return[];if(![`id`,`string`,`float64`,`int64`,`boolean`,`literal`].includes(e.kind))throw Error(`Unsupported relation field kind`);return[JSON.stringify(I(e))]}function O(e,t){let n=e.from,r=e.to;if(`base`in n!=`base`in r)throw Error(`Both relation legs must use through`);if(`base`in n&&`base`in r){if(n.junction.table!==r.junction.table)throw Error(`Different junction tables`);k(t,n.junction.table,n.junction.field,e.junctionGuard),k(t,e.target,r.base.field,e.targetGuard);return}if(!E(f.get(S(n)),f.get(S(r))))throw Error(`Incompatible relation field types`);k(t,e.target,S(r).field,e.targetGuard)}function k(e,t,n,r){if(n!==`_id`&&!e[t].indexes.some(e=>{let t=e.fields.indexOf(n);return t>=0&&e.fields.slice(0,t).every(e=>e===r?.discriminator)}))throw Error(`No active index begins with or has a guarded prefix for "${t}.${n}"`)}function A(e){return`base`in e?[e.base.table,e.base.field,e.base.guard??null,e.junction.table,e.junction.field,e.junction.guard??null]:p.has(e)?[e.table,e.field,e.guard??null,p.get(e)]:[e.table,e.field,e.guard??null]}function j(e,t,r,i=0,a){let o={},s={},c=e.metadata[t],l={};for(let[u,d]of Object.entries(r)){if(u===`variants`&&d!==!0&&c.branches&&a===void 0){if(i>=4)throw Error(`Invalid variant selection`);for(let[n,a]of Object.entries(d)){if(!Object.hasOwn(c.branches.options,n)||a===!0)throw Error(`Unknown variant filter selection`);l[n]=j(e,t,{...Object.fromEntries(Object.entries(r).filter(([e])=>e!==`variants`)),...a},i+1,n)}continue}let f=(a===void 0?c.fields:c.branches.options[a].fields)[u],p=e.declarations[t]?.[u];if(d===!0&&f)o[u]=n(f).optional();else if(d!==!0&&p&&i<4)s[u]={cardinality:p.cardinality,target:j(e,p.target,d,i+1)};else throw Error(`Invalid relation filter selection "${t}.${u}"`)}return{fields:o,relations:s,variants:c.branches&&a===void 0?{discriminator:c.branches.discriminator,options:l}:void 0}}function M(e,t,n,i=0){let a={};for(let[s,c]of Object.entries(n)){let n=e.declarations[t]?.[s];if(!n||i>=4)throw Error(`Unknown or too deep relation "${t}.${s}"`);let l=c===!0?e.metadata[n.target].dto:M(e,n.target,c,i+1);if(n.targetGuard){if(!(l instanceof o.ZodDiscriminatedUnion))throw Error(`Invalid target scope`);l=l.options.find(e=>e.shape[n.targetGuard.discriminator]instanceof o.ZodLiteral&&e.shape[n.targetGuard.discriminator].value===n.targetGuard.tag)}a[s]=n.cardinality===`one`?l.nullable():r(l).result}let s=e.metadata[t];function c(n,r){let i={...a};for(let n of Object.keys(i)){let a=e.declarations[t][n];a.sourceGuard&&r!==a.sourceGuard.tag&&a.cardinality===`one`&&(i[n]=o.null())}return J(n.extend(i).strict(),()=>K(e))}if(s.branches){let t=Object.entries(s.branches.options).map(([e,t])=>c(t.dto,e));return X(o.discriminatedUnion(s.branches.discriminator,[t[0],...t.slice(1)]),()=>K(e))}if(!(s.dto instanceof o.ZodObject))throw Error(`Expected object DTO`);return c(s.dto)}function N(e,t,n,r){if(t instanceof o.ZodObject&&n instanceof o.ZodObject){let n=a(t).fields;return z(e,n,r),{fields:n,allFields:new Set(Object.keys(n))}}if(!(t instanceof o.ZodDiscriminatedUnion)||!(n instanceof o.ZodDiscriminatedUnion))throw Error(`Expected matching discriminated union boundaries "${e}"`);let i=t._zod.def.discriminator;if(n._zod.def.discriminator!==i)throw Error(`DTO discriminator mismatch`);function c(e){let t=Object.create(null);for(let n of e.options){if(!(n instanceof o.ZodObject))throw Error(`Variant branches must be objects`);let e=n.shape[i];if(!(e instanceof o.ZodLiteral)||e.values.size!==1)throw Error(`Variant tags must be unique required string literals`);let r=o.string().safeParse(e.value);if(!r.success||Object.hasOwn(t,r.data))throw Error(`Variant tags must be unique required string literals`);t[r.data]=n}if(Object.keys(t).length===0)throw Error(`Expected at least one variant branch`);return t}let l=c(t),u=c(n);if(Object.keys(l).sort().join(`\0`)!==Object.keys(u).sort().join(`\0`))throw Error(`DTO variant tags mismatch`);let d={discriminator:i,options:Object.create(null)},f=[];for(let[t,n]of Object.entries(l)){let r=a(n).fields,{_id:i,_creationTime:o,...c}=r;z(e,r,I(s.object(c))),f.push(s.object(c)),d.options[t]={fields:r,dto:u[t]}}if(L(r)!==L(I(s.union(...f))))throw Error(`Native stored document disagrees with boundary "${e}"`);let p=Object.values(d.options).map(e=>e.fields),m={};for(let e of Object.keys(p[0])){if(!p.every(t=>Object.hasOwn(t,e))||e!==i&&!p.every(t=>P(t[e],p[0][e])))continue;let t=p.map(t=>t[e]),n=s.union(...t);m[e]=t.some(e=>e.isOptional===`optional`)?s.optional(n):n}return{fields:m,branches:d,allFields:new Set(p.flatMap(e=>Object.keys(e)))}}function P(e,t){try{return E(e,t)}catch{return L(I(e))===L(I(t))}}function F(e){return e.export()}function I(e){return e.json}function L(e){if(Array.isArray(e))return`[${e.map(L).join(`,`)}]`;if(e!==null&&Object(e)===e){let t=e;return`{${Object.keys(t).sort().map(e=>`${JSON.stringify(e)}:${L(t[e])}`).join(`,`)}}`}return JSON.stringify(e)}function R(e){if(e===null||Object(e)!==e)return;let t=e;if(t.type===`any`)throw Error(`Unsupported native validation form`);for(let e of Object.values(t))R(e)}function z(e,t,n){let{_id:r,_creationTime:i,...a}=t;if(!r||!i||L(I(r))!==L(I(s.id(e)))||L(I(i))!==L(I(s.number()))||r.isOptional!==`required`||i.isOptional!==`required`||L(n)!==L(I(s.object(a))))throw Error(`Native stored document disagrees with boundary "${e}"`)}const B=o.object({field:o.string()}),V=new Set([B,B.pick({field:!0}),B.omit({field:!0}),B.extend({other:o.string()}),B.safeExtend({other:o.string()}),B.merge(o.object({other:o.string()})),B.partial(),B.required()].flatMap(e=>{let t=Object.getOwnPropertyDescriptor(e._zod.def,`shape`)?.get;return t?[Function.prototype.toString.call(t)]:[]}));function H(e){return G(e,`dto`)}const U=Function.prototype.toString.call(Object.getOwnPropertyDescriptor(o.string().default(``)._zod.def,`defaultValue`).get),W=Function.prototype.toString.call(Object.getOwnPropertyDescriptor(o.string().prefault(``)._zod.def,`defaultValue`).get);function G(e,t){let n=[],r=/* @__PURE__ */ new Set,i=[],a=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=[];function l(e,u){if(s.has(e))throw Error(`Unsupported cyclic DTO schema`);if(!a.has(e)){if(u>32||n.length>=4096)throw Error(`DTO schema graph budget exceeded`);a.add(e),s.add(e);try{if(e instanceof RegExp&&i.push({expression:e,source:e.source,flags:e.flags}),e instanceof o.core.$ZodCheck&&`check`in e._zod.def){if(t===`dto`&&e._zod.def.check===`overwrite`)throw Error(`Unsupported DTO overwrite check`);l(e._zod.def,u+1),n.push({object:e._zod,exactKeys:!1,keys:[`def`,`check`],values:[`def`,`check`].map(t=>Object.getOwnPropertyDescriptor(e._zod,t))});return}if(e instanceof o.core.$ZodType){let i=e._zod.def;if(t===`dto`&&(![`object`,`array`,`optional`,`nullable`,`nonoptional`,`union`,`intersection`,`tuple`,`record`,`string`,`number`,`boolean`,`bigint`,`null`,`never`,`literal`,`enum`].includes(i.type)||`coerce`in i&&i.coerce))throw Error(`Unsupported DTO schema "${i.type}"`);if(t===`stored`&&(i.type==="default"||i.type===`prefault`)){let e=Object.getOwnPropertyDescriptor(i,`defaultValue`);if(e?.get){if(e.set||Function.prototype.toString.call(e.get)!==(i.type==="default"?U:W))throw Error(`Unsupported stored schema accessor`);r.add(i)}}if(e instanceof o.ZodUnion&&(l(e.options,u+1),n.push({object:e,exactKeys:!1,keys:[`options`],values:[Object.getOwnPropertyDescriptor(e,`options`)]})),i.type===`object`){let t=Object.getOwnPropertyDescriptor(i,`shape`);if(t?.get){if(t.set||!V.has(Function.prototype.toString.call(t.get)))throw Error(`Unsupported DTO schema accessor`);let e=i.shape;l(e,u+1),Object.getOwnPropertyDescriptor(i,`shape`)?.get&&c.push({definition:i,fields:e})}if(e instanceof o.ZodObject){let t=Object.getOwnPropertyDescriptor(e,`shape`);if(t&&!(`value`in t))throw Error(`Unsupported DTO schema accessor`);l(e.shape,u+1)}}l(i,u+1),n.push({object:e._zod,exactKeys:!1,keys:[`def`],values:[Object.getOwnPropertyDescriptor(e._zod,`def`)]});return}let a=Reflect.ownKeys(e),s=a.map(t=>Object.getOwnPropertyDescriptor(e,t));if(s.some((t,n)=>!(`value`in t)&&!c.some(({definition:t})=>t===e&&a[n]===`shape`)&&!(r.has(e)&&a[n]===`defaultValue`)))throw Error(`Unsupported DTO schema accessor`);n.push({object:e,exactKeys:!0,keys:a,values:s});for(let e of s)e.value!==null&&Object(e.value)===e.value&&!(e.value instanceof Function)&&l(e.value,u+1)}finally{s.delete(e)}}}return l(e,0),()=>{for(let e of i)if(e.expression.source!==e.source||e.expression.flags!==e.flags)throw Error(`DTO schema mutated after registry construction`);for(let e of n){let t=e.keys;if(e.exactKeys&&Reflect.ownKeys(e.object).length!==t.length)throw Error(`DTO schema mutated after registry construction`);for(let n=0;n<t.length;n++){if(e.object instanceof RegExp&&t[n]===`lastIndex`)continue;let r=Object.getOwnPropertyDescriptor(e.object,t[n]),i=e.values[n];if(!r||r.value!==i.value||r.get!==i.get||r.set!==i.set||r.enumerable!==i.enumerable)throw Error(`DTO schema mutated after registry construction`)}}for(let{definition:e,fields:t}of c){let n=e.shape,r=Reflect.ownKeys(t);if(Reflect.ownKeys(n).length!==r.length||r.some(e=>Object.getOwnPropertyDescriptor(n,e)?.value!==Object.getOwnPropertyDescriptor(t,e)?.value))throw Error(`DTO schema mutated after registry construction`)}}}function K(e){for(let t of Object.values(e.metadata))t.assertUnchanged()}const q=o.core.$constructor(`GuardedDtoObject`,(e,t)=>{let n=t;o.ZodObject.init(e,t),e._zod.deferred??=[],e._zod.deferred.push(()=>{let t=e._zod.run;e._zod.run=(e,r)=>{try{n.assertUnchanged()}catch{return e.issues.push({code:`custom`,input:e.value,message:`DTO schema mutated after registry construction`}),e}return t(e,r)}})});function J(e,t){let n=e.shape,r={...e._zod.def,assertUnchanged:t};return Object.defineProperty(r,"shape",{enumerable:!0,configurable:!0,get:()=>(t(),n)}),new q(r)}const Y=o.core.$constructor(`GuardedDtoUnion`,(e,t)=>{let n=t;o.ZodDiscriminatedUnion.init(e,t),e._zod.deferred??=[],e._zod.deferred.push(()=>{let t=e._zod.run;e._zod.run=(e,r)=>{try{n.assertUnchanged()}catch{return e.issues.push({code:`custom`,input:e.value,message:`DTO schema mutated after registry construction`}),e}return t(e,r)}})});function X(e,t){let n=e.options,r={...e._zod.def,assertUnchanged:t};return Object.defineProperty(r,"options",{enumerable:!0,configurable:!0,get:()=>(t(),n)}),new Y(r)}function Z(e){let t={};for(let[n,r]of Object.entries(e.metadata)){let e={};for(let[t,n]of Object.entries(r.fields))e[t]=Object.freeze({kind:n.kind,optional:n.isOptional===`optional`,nullable:Q(n),idTables:Object.freeze($(n)),native:ee(I(n))});t[n]=Object.freeze({fields:Object.freeze(e),variant:r.branches?Object.freeze({discriminator:r.branches.discriminator,tags:Object.freeze(Object.keys(r.branches.options))}):void 0,indexes:Object.freeze(r.indexes.map(e=>Object.freeze({name:e.name,fields:Object.freeze([...e.fields])})))})}return Object.freeze({tables:Object.freeze(t),declarations:e.declarations})}function Q(e){return e.kind===`null`||e.kind===`union`&&e.members.some(Q)}function $(e){return e.kind===`id`?[e.tableName]:e.kind===`union`?[...new Set(e.members.flatMap($))].sort():[]}function ee(e){let t=structuredClone(e),n=[t];for(;n.length;){let e=n.pop();if(Object(e)!==e)continue;let t=e;Object.freeze(t),n.push(...Object.values(t))}return t}export{_ as defineRelations,v as getRelationExecutor,y as getRelationMetadata};
 //# sourceMappingURL=relations.mjs.map