@prisma/orm-family-mongo 0.16.0-dev.36

package/dist/dist-Dyp05u64.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dist-Dyp05u64.mjs","names":["#contract","#state","#withStage","#writeTerminal","#writeMeta","#ctx","#modelName","#filters","#foldedFilter"],"sources":["../../../../2-mongo-family/5-query-builders/query-builder/dist/index.mjs"],"sourcesContent":["import { i as ormError, n as expr, r as resolveUpdaterResult, t as createFieldAccessor } from \"./field-accessor-0oUt6RZC.mjs\";\nimport { AggregateCommand, DeleteManyCommand, DeleteOneCommand, FindOneAndDeleteCommand, FindOneAndUpdateCommand, InsertManyCommand, InsertOneCommand, MongoAddFieldsStage, MongoAggAccumulator, MongoAggCond, MongoAggFieldRef, MongoAggLiteral, MongoAggOperator, MongoAndExpr, MongoBucketAutoStage, MongoBucketStage, MongoCountStage, MongoDensifyStage, MongoExistsExpr, MongoFacetStage, MongoFillStage, MongoGeoNearStage, MongoGraphLookupStage, MongoGroupStage, MongoLimitStage, MongoLookupStage, MongoMatchStage, MongoMergeStage, MongoOutStage, MongoProjectStage, MongoRedactStage, MongoReplaceRootStage, MongoSampleStage, MongoSearchMetaStage, MongoSearchStage, MongoSetWindowFieldsStage, MongoSkipStage, MongoSortByCountStage, MongoSortStage, MongoUnionWithStage, MongoUnwindStage, MongoVectorSearchStage, UpdateManyCommand, UpdateOneCommand, freezeMongoFieldShape, freezeMongoResultShape } from \"@internal/mongo-query-ast/execution\";\nimport { domainModelsAtDefaultNamespace } from \"@internal/contract/types\";\nimport { blindCast, castAs } from \"@internal/utils/casts\";\nimport { ifDefined } from \"@internal/utils/defined\";\nimport { InternalError } from \"@internal/utils/internal-error\";\nimport { structuredError } from \"@internal/utils/structured-error\";\n//#region src/accumulator-helpers.ts\nfunction namedAccumulatorArgs(args) {\n\tconst result = {};\n\tfor (const [key, val] of Object.entries(args)) if (val !== void 0) result[key] = val.node;\n\treturn result;\n}\nconst acc = {\n\tsum(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.sum(expr.node)\n\t\t};\n\t},\n\tavg(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.avg(expr.node)\n\t\t};\n\t},\n\tmin(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.min(expr.node)\n\t\t};\n\t},\n\tmax(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.max(expr.node)\n\t\t};\n\t},\n\tfirst(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.first(expr.node)\n\t\t};\n\t},\n\tlast(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.last(expr.node)\n\t\t};\n\t},\n\tpush(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.push(expr.node)\n\t\t};\n\t},\n\taddToSet(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.addToSet(expr.node)\n\t\t};\n\t},\n\tcount() {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.count()\n\t\t};\n\t},\n\tstdDevPop(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.stdDevPop(expr.node)\n\t\t};\n\t},\n\tstdDevSamp(expr) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.stdDevSamp(expr.node)\n\t\t};\n\t},\n\tfirstN(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$firstN\", namedAccumulatorArgs(args))\n\t\t};\n\t},\n\tlastN(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$lastN\", namedAccumulatorArgs(args))\n\t\t};\n\t},\n\tmaxN(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$maxN\", namedAccumulatorArgs(args))\n\t\t};\n\t},\n\tminN(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$minN\", namedAccumulatorArgs(args))\n\t\t};\n\t},\n\ttop(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$top\", {\n\t\t\t\toutput: args.output.node,\n\t\t\t\tsortBy: MongoAggLiteral.of(args.sortBy)\n\t\t\t})\n\t\t};\n\t},\n\tbottom(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$bottom\", {\n\t\t\t\toutput: args.output.node,\n\t\t\t\tsortBy: MongoAggLiteral.of(args.sortBy)\n\t\t\t})\n\t\t};\n\t},\n\ttopN(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$topN\", {\n\t\t\t\toutput: args.output.node,\n\t\t\t\tsortBy: MongoAggLiteral.of(args.sortBy),\n\t\t\t\tn: args.n.node\n\t\t\t})\n\t\t};\n\t},\n\tbottomN(args) {\n\t\treturn {\n\t\t\t_field: void 0,\n\t\t\tnode: MongoAggAccumulator.of(\"$bottomN\", {\n\t\t\t\toutput: args.output.node,\n\t\t\t\tsortBy: MongoAggLiteral.of(args.sortBy),\n\t\t\t\tn: args.n.node\n\t\t\t})\n\t\t};\n\t}\n};\n//#endregion\n//#region src/lookup-builder.ts\n/**\n* Construct the `from` callable for `PipelineChain.lookup`. The contract\n* is captured so `from(name)` can resolve `roots[name]` to the foreign\n* model name at runtime, look up the foreign collection name from\n* `models[modelName].storage.collection`, and assemble a `LookupResult`\n* for the outer `lookup` to consume.\n*\n* The `Shape`/`Nested` generics are erased at runtime — they exist only\n* to type the local accessor inside the user's `on(...)` callback. The\n* contract value at runtime carries the real model lookup table.\n*/\nfunction createLookupFrom(contract) {\n\tconst callable = ((rootName) => {\n\t\tconst modelName = contract.roots[rootName]?.model;\n\t\tif (!modelName) throw ormError(\"ORM.MODEL_UNKNOWN\", `lookup() unknown root: \"${rootName}\". Valid roots: ${Object.keys(contract.roots).join(\", \")}`);\n\t\treturn createLookupBuilder({\n\t\t\trootName,\n\t\t\tmodelName,\n\t\t\tforeignCollection: domainModelsAtDefaultNamespace(contract.domain)[modelName]?.storage?.collection ?? rootName\n\t\t});\n\t});\n\treturn callable;\n}\nfunction createLookupBuilder(state) {\n\treturn { on(cb) {\n\t\tconst result = cb(createFieldAccessor(), createFieldAccessor());\n\t\tassertLeafExpression(result.local, \"local\");\n\t\tassertLeafExpression(result.foreign, \"foreign\");\n\t\treturn createLookupBuilderWithKey({\n\t\t\t...state,\n\t\t\tlocalField: result.local._path,\n\t\t\tforeignField: result.foreign._path\n\t\t});\n\t} };\n}\nfunction createLookupBuilderWithKey(state) {\n\treturn { as(name) {\n\t\treturn {\n\t\t\t_brand: \"mongo-query-builder/lookup-result@1\",\n\t\t\t_root: state.rootName,\n\t\t\t_model: state.modelName,\n\t\t\t_localField: state.localField,\n\t\t\t_foreignField: state.foreignField,\n\t\t\t_as: name\n\t\t};\n\t} };\n}\n/**\n* Defensive runtime guard catching the case where a user returns a\n* non-`LeafExpression` from the `on(...)` callback (e.g. by casting\n* around the type system, or threading a value in from outside the\n* callback). Compile-time gating via `LookupOnResult`'s `LeafExpression`\n* type already rejects `fn.<op>(…)` returns at the type level — this\n* guard is the runtime backstop matching the defensive style of\n* `deconstructFindAndModifyChain` in builder.ts.\n*/\nfunction assertLeafExpression(value, side) {\n\tif (!value || typeof value._path !== \"string\" || value._path.length === 0) throw ormError(\"ORM.ARGUMENT_INVALID\", `lookup().on() ${side} side must return a leaf field reference (e.g. \\`${side}.<field>\\`). Aggregation expressions and computed values are not supported.`);\n}\n/**\n* Extract the runtime metadata from a `LookupResult` for `PipelineChain\n* .lookup` to construct the `MongoLookupStage`. The internal fields are\n* intentionally underscore-prefixed and brand-checked here so user code\n* cannot synthesise a fake spec; this is the single ingress point.\n*/\nfunction extractLookupResult(result, contract) {\n\tif (result?._brand !== \"mongo-query-builder/lookup-result@1\") throw ormError(\"ORM.ARGUMENT_INVALID\", \"lookup() callback must return the result of `from(name).on(cb).as(name)`. Returning a hand-rolled options object is not supported.\");\n\treturn {\n\t\tforeignCollection: domainModelsAtDefaultNamespace(contract.domain)[result._model]?.storage?.collection ?? result._root,\n\t\tlocalField: result._localField,\n\t\tforeignField: result._foreignField,\n\t\tas: result._as,\n\t\tmodelName: result._model\n\t};\n}\n//#endregion\n//#region src/pipeline-result-shape.ts\nconst identityStageKinds = /* @__PURE__ */ new Set([\n\t\"match\",\n\t\"sort\",\n\t\"limit\",\n\t\"skip\",\n\t\"sample\",\n\t\"vectorSearch\"\n]);\nconst unknownShape = { kind: \"unknown\" };\nfunction fieldShapeAtPath(shape, path) {\n\tif (shape.kind !== \"document\" || path.includes(\".\")) return unknownShape;\n\treturn shape.fields[path] ?? unknownShape;\n}\nfunction shapeForExpr(currentShape, expr) {\n\tif (expr instanceof MongoAggFieldRef) return fieldShapeAtPath(currentShape, expr.path);\n\treturn unknownShape;\n}\nfunction resultShapeAfterProject(currentShape, stage) {\n\tif (currentShape.kind !== \"document\") return { kind: \"unknown\" };\n\tconst fields = {};\n\tfor (const [key, value] of Object.entries(stage.projection)) {\n\t\tif (value === 0) continue;\n\t\tif (value === 1) {\n\t\t\tfields[key] = currentShape.fields[key] ?? unknownShape;\n\t\t\tcontinue;\n\t\t}\n\t\tfields[key] = shapeForExpr(currentShape, value);\n\t}\n\tif (!Object.hasOwn(stage.projection, \"_id\") && currentShape.fields[\"_id\"]) fields[\"_id\"] = currentShape.fields[\"_id\"];\n\treturn freezeMongoResultShape({\n\t\tkind: \"document\",\n\t\tfields\n\t});\n}\nfunction resultShapeAfterAddFields(currentShape, stage) {\n\tif (currentShape.kind !== \"document\") return { kind: \"unknown\" };\n\tconst fields = { ...currentShape.fields };\n\tfor (const [key, expr] of Object.entries(stage.fields)) fields[key] = shapeForExpr(currentShape, expr);\n\treturn freezeMongoResultShape({\n\t\tkind: \"document\",\n\t\tfields\n\t});\n}\nfunction computePipelineResultShape(stages, startShape) {\n\tlet shape = startShape;\n\tfor (const stage of stages) {\n\t\tif (shape.kind === \"unknown\") return { kind: \"unknown\" };\n\t\tif (identityStageKinds.has(stage.kind)) continue;\n\t\tif (stage instanceof MongoProjectStage) {\n\t\t\tshape = resultShapeAfterProject(shape, stage);\n\t\t\tcontinue;\n\t\t}\n\t\tif (stage instanceof MongoAddFieldsStage) {\n\t\t\tshape = resultShapeAfterAddFields(shape, stage);\n\t\t\tcontinue;\n\t\t}\n\t\treturn { kind: \"unknown\" };\n\t}\n\treturn shape;\n}\n//#endregion\n//#region src/result-shape.ts\nfunction contractFieldToMongoFieldShape(field) {\n\tconst { type, nullable, many } = field;\n\tif (type.kind === \"valueObject\" || type.kind === \"union\") return Object.freeze({ kind: \"unknown\" });\n\tif (type.kind !== \"scalar\") return Object.freeze({ kind: \"unknown\" });\n\tif (field.dict === true) return Object.freeze({ kind: \"unknown\" });\n\tif (many === true) return freezeMongoFieldShape({\n\t\tkind: \"array\",\n\t\tnullable,\n\t\telement: {\n\t\t\tkind: \"leaf\",\n\t\t\tcodecId: type.codecId,\n\t\t\tnullable: false\n\t\t}\n\t});\n\treturn freezeMongoFieldShape({\n\t\tkind: \"leaf\",\n\t\tcodecId: type.codecId,\n\t\tnullable\n\t});\n}\nfunction contractModelToMongoResultShape(model, options) {\n\tconst fields = {};\n\tfor (const rel of options?.includeRelationNames ?? []) fields[rel] = Object.freeze({ kind: \"unknown\" });\n\tconst modelFields = model.fields;\n\tconst keys = options?.selection !== void 0 ? options.selection : Object.keys(modelFields);\n\tfor (const key of keys) {\n\t\tif (Object.hasOwn(fields, key)) continue;\n\t\tconst cf = modelFields[key];\n\t\tif (!cf) {\n\t\t\tfields[key] = Object.freeze({ kind: \"unknown\" });\n\t\t\tcontinue;\n\t\t}\n\t\tfields[key] = contractFieldToMongoFieldShape(cf);\n\t}\n\treturn freezeMongoResultShape({\n\t\tkind: \"document\",\n\t\tfields\n\t});\n}\n//#endregion\n//#region src/builder.ts\n/**\n* The pipeline state in the query-builder state machine.\n*\n* Reached from `CollectionHandle` or `FilteredCollection` after the first\n* pipeline-stage method call (or directly via `aggregate()` shortcuts). Holds\n* the accumulated `MongoPipelineStage[]` and exposes pipeline-stage methods,\n* the `merge`/`out` write terminals, and the `build`/`aggregate` read\n* terminals.\n*\n* Two phantom type parameters gate the conditional terminals:\n*\n*  - `U extends UpdateEnabled` — when `'update-ok'`, the no-arg `updateMany()` /\n*    `updateOne()` form is available (consume the chain as an\n*    update-with-pipeline spec). Cleared by stages that produce content the\n*    `update` AST cannot represent (e.g. `$group`, `$lookup`, `$limit`).\n*  - `F extends FindAndModifyEnabled` — when `'fam-ok'`, the\n*    `findOneAndUpdate(...)` / `findOneAndDelete(...)` terminals are\n*    available. Cleared by stages incompatible with their wire-command slots\n*    (`$limit`, `$group`, mutating stages, …).\n*\n* The marker semantics are encoded in the per-method return types — see the\n* marker table (and rationale per row) in\n* `docs/architecture docs/adrs/ADR 201 - State-machine pattern for typed DSL builders.md`.\n*/\nvar PipelineChain = class PipelineChain {\n\t#contract;\n\t#state;\n\tconstructor(contract, state) {\n\t\tthis.#contract = contract;\n\t\tthis.#state = state;\n\t}\n\t/**\n\t* Internal helper that appends a pipeline stage and branches into a new\n\t* state-type. The fifth type parameter `NewN` carries the nested-path\n\t* shape forward. It defaults to `Record<string, never>` so stages that\n\t* fundamentally rewrite the document (`$group`, `$project`,\n\t* `$replaceRoot`, …) automatically disable the callable form of\n\t* `FieldAccessor` downstream. Additive stages (`match`, `addFields`,\n\t* `sort`, `lookup`, …) explicitly re-thread the current `N`.\n\t*/\n\t#withStage(stage) {\n\t\treturn new PipelineChain(this.#contract, {\n\t\t\t...this.#state,\n\t\t\tstages: [...this.#state.stages, stage]\n\t\t});\n\t}\n\t#writeMeta() {\n\t\treturn {\n\t\t\ttarget: \"mongo\",\n\t\t\tstorageHash: this.#state.storageHash,\n\t\t\tlane: \"mongo-query\"\n\t\t};\n\t}\n\tmatch(filterOrFn) {\n\t\tconst filter = typeof filterOrFn === \"function\" ? filterOrFn(createFieldAccessor()) : filterOrFn;\n\t\treturn this.#withStage(new MongoMatchStage(filter));\n\t}\n\t/**\n\t* `$sort`. Clears `UpdateEnabled` (`update` has no per-document sort) but\n\t* preserves `FindAndModifyEnabled` (`findAndModify` has a `sort` slot).\n\t*/\n\tsort(spec) {\n\t\treturn this.#withStage(new MongoSortStage(spec));\n\t}\n\t/**\n\t* `$limit`. Clears both markers — `limit` is incompatible with the `update`\n\t* wire command, and `findAndModify` already implies single-document\n\t* semantics (so `.limit(...)` adds no meaning, only ambiguity).\n\t*/\n\tlimit(n) {\n\t\treturn this.#withStage(new MongoLimitStage(n));\n\t}\n\t/**\n\t* `$skip`. Clears both markers — MongoDB's `findAndModify` wire command\n\t* has no `skip` slot, so `deconstructFindAndModifyChain` rejects any\n\t* `$skip` at runtime; keeping the marker `fam-cleared` makes the type\n\t* system reflect the same constraint (see ADR 201 marker table).\n\t*/\n\tskip(n) {\n\t\treturn this.#withStage(new MongoSkipStage(n));\n\t}\n\tsample(n) {\n\t\treturn this.#withStage(new MongoSampleStage(n));\n\t}\n\t/**\n\t* `$addFields`. Preserves `UpdateEnabled` (representable as\n\t* update-with-pipeline `$set`); clears `FindAndModifyEnabled` (no analogue\n\t* in the find-and-modify wire commands). The nested-path shape `N` is\n\t* preserved — newly added flat fields are reachable via property access\n\t* (`f.newField`) but do not themselves carry nested structure.\n\t*/\n\taddFields(fn) {\n\t\tconst newFields = fn(createFieldAccessor());\n\t\tconst exprRecord = {};\n\t\tfor (const [key, typed] of Object.entries(newFields)) exprRecord[key] = typed.node;\n\t\treturn this.#withStage(new MongoAddFieldsStage(exprRecord));\n\t}\n\t/**\n\t* `$lookup`. Clears both markers — joins are not representable in either\n\t* the `update` or `findAndModify` wire commands. The original document's\n\t* nested-path shape `N` is preserved (the lookup adds a sidecar array\n\t* field; existing keys are untouched).\n\t*\n\t* The single callback receives a `from` callable that grounds the\n\t* foreign-root literal sequentially before the inner `on(...)`\n\t* callback is type-checked — see `lookup-builder.ts`. The resulting\n\t* `Shape` gains the `As` key as a `ModelArrayField<ModelName>` so\n\t* `ResolveRow` produces `Array<ForeignRow>` (with concrete leaf\n\t* types) instead of the legacy `unknown[]`.\n\t*/\n\tlookup(fn) {\n\t\tconst extracted = extractLookupResult(fn(createLookupFrom(this.#contract)), this.#contract);\n\t\treturn this.#withStage(new MongoLookupStage({\n\t\t\tfrom: extracted.foreignCollection,\n\t\t\tlocalField: extracted.localField,\n\t\t\tforeignField: extracted.foreignField,\n\t\t\tas: extracted.as\n\t\t}));\n\t}\n\tproject(...args) {\n\t\tif (args.length === 1 && typeof args[0] === \"function\") {\n\t\t\tconst fn = args[0];\n\t\t\tconst spec = fn(createFieldAccessor());\n\t\t\tconst projection = {};\n\t\t\tfor (const [key, val] of Object.entries(spec)) projection[key] = val === 1 ? 1 : val.node;\n\t\t\treturn this.#withStage(new MongoProjectStage(projection));\n\t\t}\n\t\tconst keys = args;\n\t\tconst projection = {};\n\t\tfor (const key of keys) projection[key] = 1;\n\t\treturn this.#withStage(new MongoProjectStage(projection));\n\t}\n\t/**\n\t* `$unwind`. Clears both markers — array unrolling produces multiple output\n\t* documents per input, incompatible with both single-document update and\n\t* find-and-modify wire commands. The original `N` is preserved: unwind\n\t* replaces the unwound array slot with its element but leaves the rest\n\t* of the document structurally intact.\n\t*/\n\tunwind(field, options) {\n\t\treturn this.#withStage(new MongoUnwindStage(`$${field}`, options?.preserveNullAndEmptyArrays ?? false));\n\t}\n\t/**\n\t* `$group`. Clears both markers — group output bears no relation to source\n\t* documents; neither `update` nor `findAndModify` can consume it. Nested\n\t* path shape is reset (the source document's path tree is gone).\n\t*/\n\tgroup(fn) {\n\t\tconst { _id: groupIdExpr, ...rest } = fn(createFieldAccessor());\n\t\tconst groupId = groupIdExpr === null ? null : groupIdExpr.node;\n\t\tconst accumulators = {};\n\t\tfor (const [key, typed] of Object.entries(rest)) {\n\t\t\tif (typed === null) throw ormError(\"ORM.ARGUMENT_INVALID\", `group() field \"${key}\" must not be null. Only _id can be null.`);\n\t\t\tif (typed.node.kind !== \"accumulator\") throw ormError(\"ORM.ARGUMENT_INVALID\", `group() field \"${key}\" must use an accumulator (e.g. acc.sum(), acc.count()). Got \"${typed.node.kind}\" expression.`);\n\t\t\taccumulators[key] = typed.node;\n\t\t}\n\t\treturn this.#withStage(new MongoGroupStage(groupId, accumulators));\n\t}\n\t/**\n\t* `$replaceRoot`. Preserves `UpdateEnabled` (representable as\n\t* update-with-pipeline `$replaceRoot`); clears `FindAndModifyEnabled`.\n\t* Nested path shape is reset — the replaced root has no relation to\n\t* the original document structure.\n\t*/\n\treplaceRoot(fn) {\n\t\tconst expr = fn(createFieldAccessor());\n\t\treturn this.#withStage(new MongoReplaceRootStage(expr.node));\n\t}\n\tcount(field) {\n\t\treturn this.#withStage(new MongoCountStage(field));\n\t}\n\tsortByCount(fn) {\n\t\tconst expr = fn(createFieldAccessor());\n\t\treturn this.#withStage(new MongoSortByCountStage(expr.node));\n\t}\n\t/**\n\t* `$redact`. Preserves `UpdateEnabled`; clears `FindAndModifyEnabled`.\n\t* Shape- and nested-path-preserving (the document tree is unchanged).\n\t*/\n\tredact(fn) {\n\t\tconst expr = fn(createFieldAccessor());\n\t\treturn this.#withStage(new MongoRedactStage(expr.node));\n\t}\n\t/**\n\t* `$out` write terminal. Materialises the pipeline output into\n\t* `collection` (optionally in `db`), replacing any prior contents. Unlike\n\t* the other pipeline-stage methods, this **terminates** the chain — it\n\t* returns a `MongoQueryPlan` rather than another `PipelineChain`, since\n\t* `$out` must be the final stage and there is nothing further to chain.\n\t*\n\t* Lane is `mongo-query` (matching all other terminals in this package) so\n\t* middleware can dispatch on intent without inspecting the command.\n\t*\n\t* The result row stream is empty (`unknown` row type) — the data lives\n\t* in the destination collection, not the response.\n\t*/\n\tout(collection, db) {\n\t\treturn this.#writeTerminal(new MongoOutStage(collection, db));\n\t}\n\t/**\n\t* `$merge` write terminal. Streams the pipeline output into the target\n\t* collection per the supplied merge semantics (`whenMatched` /\n\t* `whenNotMatched`). Like `out()`, terminates the chain — `$merge` must\n\t* be the final stage.\n\t*/\n\tmerge(options) {\n\t\treturn this.#writeTerminal(new MongoMergeStage(options));\n\t}\n\t#writeTerminal(stage) {\n\t\tconst pipeline = [...this.#state.stages, stage];\n\t\tconst command = new AggregateCommand(this.#state.collection, pipeline);\n\t\tconst meta = {\n\t\t\ttarget: \"mongo\",\n\t\t\tstorageHash: this.#state.storageHash,\n\t\t\tlane: \"mongo-query\"\n\t\t};\n\t\treturn {\n\t\t\tcollection: this.#state.collection,\n\t\t\tcommand,\n\t\t\tmeta\n\t\t};\n\t}\n\tunionWith(collection, pipeline) {\n\t\treturn this.#withStage(new MongoUnionWithStage(collection, pipeline));\n\t}\n\tbucket(options) {\n\t\treturn this.#withStage(new MongoBucketStage(options));\n\t}\n\tbucketAuto(options) {\n\t\treturn this.#withStage(new MongoBucketAutoStage(options));\n\t}\n\tgeoNear(options) {\n\t\treturn this.#withStage(new MongoGeoNearStage(options));\n\t}\n\tfacet(facets) {\n\t\treturn this.#withStage(new MongoFacetStage(facets));\n\t}\n\tgraphLookup(options) {\n\t\treturn this.#withStage(new MongoGraphLookupStage(options));\n\t}\n\tsetWindowFields(options) {\n\t\treturn this.#withStage(new MongoSetWindowFieldsStage(options));\n\t}\n\tdensify(options) {\n\t\treturn this.#withStage(new MongoDensifyStage(options));\n\t}\n\tfill(options) {\n\t\treturn this.#withStage(new MongoFillStage(options));\n\t}\n\tsearch(config, index) {\n\t\treturn this.#withStage(new MongoSearchStage(config, index));\n\t}\n\tsearchMeta(config, index) {\n\t\treturn this.#withStage(new MongoSearchMetaStage(config, index));\n\t}\n\tvectorSearch(options) {\n\t\treturn this.#withStage(new MongoVectorSearchStage(options));\n\t}\n\tpipe(stage) {\n\t\treturn this.#withStage(stage);\n\t}\n\t/**\n\t* No-arg `updateMany()`: deconstruct the chain into leading `$match`\n\t* stages (folded into the filter) and remaining stages (which must all\n\t* be valid pipeline-update stages). Available only when `U = 'update-ok'`.\n\t*\n\t* The optional callback parameter exists for subclass-override\n\t* compatibility with `FilteredCollection.updateMany(updaterFn)` — TS's\n\t* strict override check requires the parent's parameter to accept at\n\t* least what the child's signature does. A runtime guard throws if a\n\t* callback is actually passed on a bare `PipelineChain`. Note that\n\t* because nothing in the public surface transitions `U` from\n\t* `'update-cleared'` (the initial state on `CollectionHandle` /\n\t* `FilteredCollection`) back to `'update-ok'`, the no-arg form is\n\t* reachable only via explicit type casts in internal tests — the\n\t* callback-form \"type hole\" is therefore not reachable from user\n\t* code. See `docs/architecture docs/adrs/ADR 201 - State-machine\n\t* pattern for typed DSL builders.md` for the marker-transition table.\n\t*/\n\tupdateMany(updaterFn) {\n\t\tif (updaterFn !== void 0) throw ormError(\"ORM.ARGUMENT_INVALID\", \"updateMany() on a PipelineChain expects no arguments — the chain itself is the update pipeline. To update with an operator callback, call .updateMany(fn) on a FilteredCollection (i.e. after .match()).\");\n\t\tconst { filter, updatePipeline } = deconstructUpdateChain(this.#state.stages);\n\t\tconst command = new UpdateManyCommand(this.#state.collection, filter, updatePipeline);\n\t\treturn {\n\t\t\tcollection: this.#state.collection,\n\t\t\tcommand,\n\t\t\tmeta: this.#writeMeta()\n\t\t};\n\t}\n\t/**\n\t* No-arg `updateOne()`: same as `updateMany()` but maps to a single-doc\n\t* update. Carries the same optional-callback/subclass-compat caveat\n\t* documented above — the callback form is reachable only via forced\n\t* casts in internal tests.\n\t*/\n\tupdateOne(updaterFn) {\n\t\tif (updaterFn !== void 0) throw ormError(\"ORM.ARGUMENT_INVALID\", \"updateOne() on a PipelineChain expects no arguments — the chain itself is the update pipeline. To update with an operator callback, call .updateOne(fn) on a FilteredCollection (i.e. after .match()).\");\n\t\tconst { filter, updatePipeline } = deconstructUpdateChain(this.#state.stages);\n\t\tconst command = new UpdateOneCommand(this.#state.collection, filter, updatePipeline);\n\t\treturn {\n\t\t\tcollection: this.#state.collection,\n\t\t\tcommand,\n\t\t\tmeta: this.#writeMeta()\n\t\t};\n\t}\n\t/**\n\t* Find a single document matching the accumulated pipeline (which must\n\t* consist solely of leading `$match` stages followed by at most one\n\t* `$sort`) and apply `updaterFn`. Available only when\n\t* `FindAndModifyEnabled` is `'fam-ok'` — stages that clear the marker\n\t* (including `$skip`, which MongoDB's `findAndModify` has no slot for)\n\t* make this method invisible at the type level.\n\t*\n\t* The pipeline stages are deconstructed into the wire command's `filter`\n\t* and `sort` slots. If any non-deconstructable stage is present, a\n\t* runtime error is thrown as a defensive check (the type system should\n\t* prevent this).\n\t*/\n\tfindOneAndUpdate(updaterFn, opts = {}) {\n\t\tconst { filter, sort } = deconstructFindAndModifyChain(this.#state.stages);\n\t\tconst update = resolveUpdaterResult(updaterFn(createFieldAccessor()));\n\t\tconst command = new FindOneAndUpdateCommand(this.#state.collection, filter, update, opts.upsert ?? false, sort, opts.returnDocument ?? \"after\");\n\t\tconst meta = {\n\t\t\ttarget: \"mongo\",\n\t\t\tstorageHash: this.#state.storageHash,\n\t\t\tlane: \"mongo-query\"\n\t\t};\n\t\treturn {\n\t\t\tcollection: this.#state.collection,\n\t\t\tcommand,\n\t\t\tmeta\n\t\t};\n\t}\n\t/**\n\t* Find a single document matching the accumulated pipeline and delete it.\n\t* Same marker gating and deconstruction as `findOneAndUpdate`.\n\t*/\n\tfindOneAndDelete() {\n\t\tconst { filter, sort } = deconstructFindAndModifyChain(this.#state.stages);\n\t\tconst command = new FindOneAndDeleteCommand(this.#state.collection, filter, sort);\n\t\tconst meta = {\n\t\t\ttarget: \"mongo\",\n\t\t\tstorageHash: this.#state.storageHash,\n\t\t\tlane: \"mongo-query\"\n\t\t};\n\t\treturn {\n\t\t\tcollection: this.#state.collection,\n\t\t\tcommand,\n\t\t\tmeta\n\t\t};\n\t}\n\t/**\n\t* Materialise the chain as a `MongoQueryPlan` wrapping an `AggregateCommand`.\n\t*/\n\tbuild() {\n\t\tconst command = new AggregateCommand(this.#state.collection, this.#state.stages);\n\t\tconst meta = {\n\t\t\ttarget: \"mongo\",\n\t\t\tstorageHash: this.#state.storageHash,\n\t\t\tlane: \"mongo-query\"\n\t\t};\n\t\tconst modelName = this.#state.modelName;\n\t\tconst contractNarrow = this.#contract;\n\t\tlet resultShape;\n\t\tif (modelName !== void 0) {\n\t\t\tconst model = castAs(domainModelsAtDefaultNamespace(contractNarrow.domain)[modelName]);\n\t\t\tresultShape = model ? computePipelineResultShape(this.#state.stages, contractModelToMongoResultShape(model)) : { kind: \"unknown\" };\n\t\t}\n\t\treturn {\n\t\t\tcollection: this.#state.collection,\n\t\t\tcommand,\n\t\t\tmeta,\n\t\t\t...ifDefined(\"resultShape\", resultShape)\n\t\t};\n\t}\n\t/**\n\t* Alias for `build()` — surfaces the read intent at the call site.\n\t*/\n\taggregate() {\n\t\treturn this.build();\n\t}\n};\n/**\n* Walk the accumulated pipeline stages and extract the `filter` and `sort`\n* slots for a `findOneAndUpdate` / `findOneAndDelete` wire command.\n*\n* The helper accepts exactly the canonical shape `match+ -> sort?` and\n* nothing else:\n*\n*  - one or more `$match` stages (AND-folded into a single filter),\n*  - optionally followed by a single `$sort` stage.\n*\n* Anything else — a `$sort` before `$match`, multiple `$sort` stages, a\n* `$skip` stage, or any non-`$match`/`$sort` stage — is rejected with a\n* clear error. The type system already prevents most of these at compile\n* time via the `FindAndModifyEnabled` marker, but the runtime check\n* guards the escape hatches (e.g. `.pipe(...)`) and future marker gaps.\n*\n* `$skip` is rejected outright because MongoDB's `findAndModify` command\n* has no skip slot; a silently-dropped skip is a latent correctness bug\n* waiting to happen. (A02 removed skip from the typed AST for the same\n* reason.)\n*/\nfunction deconstructFindAndModifyChain(stages) {\n\tconst matchFilters = [];\n\tlet sort;\n\tlet seenNonMatch = false;\n\tfor (const stage of stages) if (stage instanceof MongoMatchStage) {\n\t\tif (seenNonMatch) throw ormError(\"ORM.ARGUMENT_INVALID\", \"findOneAndUpdate/findOneAndDelete requires the canonical $match+ -> $sort? shape, but a $match stage was found after a $sort. Re-order the chain so every .match() call precedes the .sort() call.\");\n\t\tmatchFilters.push(stage.filter);\n\t} else if (stage instanceof MongoSortStage) {\n\t\tif (sort !== void 0) throw ormError(\"ORM.ARGUMENT_INVALID\", \"findOneAndUpdate/findOneAndDelete accepts at most one $sort stage; drop the extra .sort() call or combine the keys into a single sort spec.\");\n\t\tsort = { ...stage.sort };\n\t\tseenNonMatch = true;\n\t} else if (stage instanceof MongoSkipStage) throw ormError(\"ORM.OPERATION_UNSUPPORTED\", \"findOneAndUpdate/findOneAndDelete does not support .skip() — MongoDB findAndModify has no skip slot. Remove the .skip() call, or use .aggregate()/.build() if the chain needs skip semantics.\");\n\telse throw ormError(\"ORM.ARGUMENT_INVALID\", `findOneAndUpdate/findOneAndDelete requires the canonical \\$match+ -> \\$sort? shape, but encountered a '${stage.constructor.name}' stage. This is likely a bug — the type system should have prevented this chain.`);\n\tif (matchFilters.length === 0) throw ormError(\"ORM.ARGUMENT_INVALID\", \"findOneAndUpdate/findOneAndDelete requires at least one .match() call.\");\n\tconst first = matchFilters[0];\n\tif (first === void 0) throw new InternalError(\"Unreachable: matchFilters.length > 0 but first is undefined\");\n\treturn {\n\t\tfilter: matchFilters.length === 1 ? first : MongoAndExpr.of(matchFilters),\n\t\tsort\n\t};\n}\n/**\n* Walk the accumulated pipeline stages: leading `$match` stages become the\n* filter, remaining stages must all be valid `MongoUpdatePipelineStage`\n* members (currently `$addFields`, `$project`, `$replaceRoot`).\n*/\nfunction deconstructUpdateChain(stages) {\n\tconst matchFilters = [];\n\tlet boundary = 0;\n\tfor (const stage of stages) {\n\t\tif (!(stage instanceof MongoMatchStage)) break;\n\t\tmatchFilters.push(stage.filter);\n\t\tboundary++;\n\t}\n\tif (matchFilters.length === 0) throw ormError(\"ORM.ARGUMENT_INVALID\", \"No-arg updateMany/updateOne requires at least one .match() call.\");\n\tconst remaining = stages.slice(boundary);\n\tif (remaining.length === 0) throw ormError(\"ORM.ARGUMENT_INVALID\", \"No-arg updateMany/updateOne requires at least one pipeline-update stage (e.g. .addFields(), .project(), .replaceRoot()) after the .match() stages.\");\n\tconst updatePipeline = [];\n\tfor (const stage of remaining) if (stage instanceof MongoAddFieldsStage || stage instanceof MongoProjectStage || stage instanceof MongoReplaceRootStage) updatePipeline.push(stage);\n\telse throw ormError(\"ORM.ARGUMENT_INVALID\", `No-arg updateMany/updateOne: encountered non-update stage '${stage.constructor.name}' after the leading \\$match stages. Only \\$addFields/\\$set, \\$project/\\$unset, and \\$replaceRoot/\\$replaceWith stages are valid in an update pipeline.`);\n\tconst first = matchFilters[0];\n\tif (first === void 0) throw new InternalError(\"Unreachable: matchFilters.length > 0 but first is undefined\");\n\treturn {\n\t\tfilter: matchFilters.length === 1 ? first : MongoAndExpr.of(matchFilters),\n\t\tupdatePipeline\n\t};\n}\n//#endregion\n//#region src/expression-helpers.ts\nfunction numericExpr(op, args) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/double@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, args.map((a) => a.node))\n\t};\n}\nfunction numericUnaryExpr(op, arg) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/double@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, arg.node)\n\t};\n}\nfunction stringExpr(op, args) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/string@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, args.map((a) => a.node))\n\t};\n}\nfunction stringUnaryExpr(op, arg) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/string@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, arg.node)\n\t};\n}\nfunction booleanExpr(op, args) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/bool@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, args.map((a) => a.node))\n\t};\n}\nfunction booleanUnaryExpr(op, arg) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/bool@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, arg.node)\n\t};\n}\nfunction dateUnaryExpr(op, arg) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/date@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, arg.node)\n\t};\n}\nfunction arrayExpr(op, args) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/array@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, args.map((a) => a.node))\n\t};\n}\nfunction arrayUnaryExpr(op, arg) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: \"mongo/array@1\",\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, arg.node)\n\t};\n}\nfunction docUnaryExpr(op, arg) {\n\treturn {\n\t\t_field: {\n\t\t\tcodecId: arg._field.codecId,\n\t\t\tnullable: false\n\t\t},\n\t\tnode: MongoAggOperator.of(op, arg.node)\n\t};\n}\nfunction namedArgsExpr(op, args, _field) {\n\tconst nodeArgs = {};\n\tfor (const [key, val] of Object.entries(args)) if (val !== void 0) nodeArgs[key] = val.node;\n\treturn {\n\t\t_field,\n\t\tnode: MongoAggOperator.of(op, nodeArgs)\n\t};\n}\nconst NUMERIC = {\n\tcodecId: \"mongo/double@1\",\n\tnullable: false\n};\nconst STRING = {\n\tcodecId: \"mongo/string@1\",\n\tnullable: false\n};\nconst BOOLEAN = {\n\tcodecId: \"mongo/bool@1\",\n\tnullable: false\n};\nconst DATE = {\n\tcodecId: \"mongo/date@1\",\n\tnullable: false\n};\nconst ARRAY = {\n\tcodecId: \"mongo/array@1\",\n\tnullable: false\n};\nconst DOC = {\n\tcodecId: \"mongo/document@1\",\n\tnullable: false\n};\nfunction literal(value) {\n\treturn {\n\t\t_field: void 0,\n\t\tnode: MongoAggLiteral.of(value)\n\t};\n}\nconst fn = {\n\tadd(...args) {\n\t\treturn numericExpr(\"$add\", args);\n\t},\n\tsubtract(a, b) {\n\t\treturn numericExpr(\"$subtract\", [a, b]);\n\t},\n\tmultiply(...args) {\n\t\treturn numericExpr(\"$multiply\", args);\n\t},\n\tdivide(a, b) {\n\t\treturn numericExpr(\"$divide\", [a, b]);\n\t},\n\tconcat(...args) {\n\t\treturn stringExpr(\"$concat\", args);\n\t},\n\ttoLower(a) {\n\t\treturn stringUnaryExpr(\"$toLower\", a);\n\t},\n\ttoUpper(a) {\n\t\treturn stringUnaryExpr(\"$toUpper\", a);\n\t},\n\tsize(a) {\n\t\treturn numericUnaryExpr(\"$size\", a);\n\t},\n\tcond(condition, thenExpr, elseExpr) {\n\t\treturn {\n\t\t\t_field: thenExpr._field,\n\t\t\tnode: new MongoAggCond(condition, thenExpr.node, elseExpr.node)\n\t\t};\n\t},\n\tliteral,\n\tyear(a) {\n\t\treturn numericUnaryExpr(\"$year\", a);\n\t},\n\tmonth(a) {\n\t\treturn numericUnaryExpr(\"$month\", a);\n\t},\n\tdayOfMonth(a) {\n\t\treturn numericUnaryExpr(\"$dayOfMonth\", a);\n\t},\n\thour(a) {\n\t\treturn numericUnaryExpr(\"$hour\", a);\n\t},\n\tminute(a) {\n\t\treturn numericUnaryExpr(\"$minute\", a);\n\t},\n\tsecond(a) {\n\t\treturn numericUnaryExpr(\"$second\", a);\n\t},\n\tmillisecond(a) {\n\t\treturn numericUnaryExpr(\"$millisecond\", a);\n\t},\n\tdateToString(args) {\n\t\treturn namedArgsExpr(\"$dateToString\", args, STRING);\n\t},\n\tdateFromString(args) {\n\t\treturn namedArgsExpr(\"$dateFromString\", args, DATE);\n\t},\n\tdateDiff(args) {\n\t\treturn namedArgsExpr(\"$dateDiff\", args, NUMERIC);\n\t},\n\tdateAdd(args) {\n\t\treturn namedArgsExpr(\"$dateAdd\", args, DATE);\n\t},\n\tdateSubtract(args) {\n\t\treturn namedArgsExpr(\"$dateSubtract\", args, DATE);\n\t},\n\tdateTrunc(args) {\n\t\treturn namedArgsExpr(\"$dateTrunc\", args, DATE);\n\t},\n\tsubstr(str, start, length) {\n\t\treturn stringExpr(\"$substr\", [\n\t\t\tstr,\n\t\t\tstart,\n\t\t\tlength\n\t\t]);\n\t},\n\tsubstrBytes(str, start, count) {\n\t\treturn stringExpr(\"$substrBytes\", [\n\t\t\tstr,\n\t\t\tstart,\n\t\t\tcount\n\t\t]);\n\t},\n\ttrim(args) {\n\t\treturn namedArgsExpr(\"$trim\", args, STRING);\n\t},\n\tltrim(args) {\n\t\treturn namedArgsExpr(\"$ltrim\", args, STRING);\n\t},\n\trtrim(args) {\n\t\treturn namedArgsExpr(\"$rtrim\", args, STRING);\n\t},\n\tsplit(str, delimiter) {\n\t\treturn arrayExpr(\"$split\", [str, delimiter]);\n\t},\n\tstrLenCP(a) {\n\t\treturn numericUnaryExpr(\"$strLenCP\", a);\n\t},\n\tstrLenBytes(a) {\n\t\treturn numericUnaryExpr(\"$strLenBytes\", a);\n\t},\n\tregexMatch(args) {\n\t\treturn namedArgsExpr(\"$regexMatch\", args, BOOLEAN);\n\t},\n\tregexFind(args) {\n\t\treturn namedArgsExpr(\"$regexFind\", args, DOC);\n\t},\n\tregexFindAll(args) {\n\t\treturn namedArgsExpr(\"$regexFindAll\", args, ARRAY);\n\t},\n\treplaceOne(args) {\n\t\treturn namedArgsExpr(\"$replaceOne\", args, STRING);\n\t},\n\treplaceAll(args) {\n\t\treturn namedArgsExpr(\"$replaceAll\", args, STRING);\n\t},\n\tcmp(a, b) {\n\t\treturn numericExpr(\"$cmp\", [a, b]);\n\t},\n\teq(a, b) {\n\t\treturn booleanExpr(\"$eq\", [a, b]);\n\t},\n\tne(a, b) {\n\t\treturn booleanExpr(\"$ne\", [a, b]);\n\t},\n\tgt(a, b) {\n\t\treturn booleanExpr(\"$gt\", [a, b]);\n\t},\n\tgte(a, b) {\n\t\treturn booleanExpr(\"$gte\", [a, b]);\n\t},\n\tlt(a, b) {\n\t\treturn booleanExpr(\"$lt\", [a, b]);\n\t},\n\tlte(a, b) {\n\t\treturn booleanExpr(\"$lte\", [a, b]);\n\t},\n\tarrayElemAt(arr, idx) {\n\t\treturn {\n\t\t\t_field: {\n\t\t\t\tcodecId: DOC.codecId,\n\t\t\t\tnullable: true\n\t\t\t},\n\t\t\tnode: MongoAggOperator.of(\"$arrayElemAt\", [arr.node, idx.node])\n\t\t};\n\t},\n\tconcatArrays(...args) {\n\t\treturn arrayExpr(\"$concatArrays\", args);\n\t},\n\tfirstElem(a) {\n\t\treturn {\n\t\t\t_field: {\n\t\t\t\tcodecId: DOC.codecId,\n\t\t\t\tnullable: true\n\t\t\t},\n\t\t\tnode: MongoAggOperator.of(\"$first\", a.node)\n\t\t};\n\t},\n\tlastElem(a) {\n\t\treturn {\n\t\t\t_field: {\n\t\t\t\tcodecId: DOC.codecId,\n\t\t\t\tnullable: true\n\t\t\t},\n\t\t\tnode: MongoAggOperator.of(\"$last\", a.node)\n\t\t};\n\t},\n\tisIn(elem, arr) {\n\t\treturn booleanExpr(\"$in\", [elem, arr]);\n\t},\n\tindexOfArray(arr, value, ...rest) {\n\t\treturn numericExpr(\"$indexOfArray\", [\n\t\t\tarr,\n\t\t\tvalue,\n\t\t\t...rest\n\t\t]);\n\t},\n\tisArray(a) {\n\t\treturn booleanUnaryExpr(\"$isArray\", a);\n\t},\n\treverseArray(a) {\n\t\treturn arrayUnaryExpr(\"$reverseArray\", a);\n\t},\n\tslice(arr, ...rest) {\n\t\treturn arrayExpr(\"$slice\", [arr, ...rest]);\n\t},\n\tzip(args) {\n\t\tconst nodeArgs = { inputs: args.inputs.map((a) => a.node) };\n\t\tif (args.useLongestLength) nodeArgs[\"useLongestLength\"] = args.useLongestLength.node;\n\t\tif (args.defaults) nodeArgs[\"defaults\"] = args.defaults.node;\n\t\treturn {\n\t\t\t_field: ARRAY,\n\t\t\tnode: MongoAggOperator.of(\"$zip\", nodeArgs)\n\t\t};\n\t},\n\trange(start, end, step) {\n\t\treturn arrayExpr(\"$range\", [\n\t\t\tstart,\n\t\t\tend,\n\t\t\tstep\n\t\t]);\n\t},\n\tsetUnion(...args) {\n\t\treturn arrayExpr(\"$setUnion\", args);\n\t},\n\tsetIntersection(...args) {\n\t\treturn arrayExpr(\"$setIntersection\", args);\n\t},\n\tsetDifference(a, b) {\n\t\treturn arrayExpr(\"$setDifference\", [a, b]);\n\t},\n\tsetEquals(...args) {\n\t\treturn booleanExpr(\"$setEquals\", args);\n\t},\n\tsetIsSubset(a, b) {\n\t\treturn booleanExpr(\"$setIsSubset\", [a, b]);\n\t},\n\tanyElementTrue(a) {\n\t\treturn booleanUnaryExpr(\"$anyElementTrue\", a);\n\t},\n\tallElementsTrue(a) {\n\t\treturn booleanUnaryExpr(\"$allElementsTrue\", a);\n\t},\n\ttypeOf(a) {\n\t\treturn stringUnaryExpr(\"$type\", a);\n\t},\n\tconvert(args) {\n\t\treturn namedArgsExpr(\"$convert\", args, DOC);\n\t},\n\ttoInt(a) {\n\t\treturn numericUnaryExpr(\"$toInt\", a);\n\t},\n\ttoLong(a) {\n\t\treturn numericUnaryExpr(\"$toLong\", a);\n\t},\n\ttoDouble(a) {\n\t\treturn numericUnaryExpr(\"$toDouble\", a);\n\t},\n\ttoDecimal(a) {\n\t\treturn numericUnaryExpr(\"$toDecimal\", a);\n\t},\n\ttoString_(a) {\n\t\treturn stringUnaryExpr(\"$toString\", a);\n\t},\n\ttoObjectId(a) {\n\t\treturn docUnaryExpr(\"$toObjectId\", a);\n\t},\n\ttoBool(a) {\n\t\treturn booleanUnaryExpr(\"$toBool\", a);\n\t},\n\ttoDate(a) {\n\t\treturn dateUnaryExpr(\"$toDate\", a);\n\t},\n\tobjectToArray(a) {\n\t\treturn arrayUnaryExpr(\"$objectToArray\", a);\n\t},\n\tarrayToObject(a) {\n\t\treturn {\n\t\t\t_field: DOC,\n\t\t\tnode: MongoAggOperator.of(\"$arrayToObject\", a.node)\n\t\t};\n\t},\n\tgetField(args) {\n\t\treturn namedArgsExpr(\"$getField\", args, DOC);\n\t},\n\tsetField(args) {\n\t\treturn namedArgsExpr(\"$setField\", args, DOC);\n\t}\n};\n//#endregion\n//#region src/contract-errors.ts\nfunction contractError(code, message, options) {\n\treturn structuredError(code, message, options);\n}\n//#endregion\n//#region src/state-classes.ts\n/**\n* \"Match-all\" filter used by the unqualified-write terminals\n* (`updateAll`/`deleteAll`). The canonical representation is still\n* undecided — `MongoAndExpr` with an empty conjunction and a dedicated\n* `MongoMatchAllExpr` node are both candidates. For now we use\n* `_id $exists: true`, which is trivially true on every document and\n* avoids introducing a new AST node before the wider question is\n* resolved. Centralised so the eventual switch is a one-line change.\n*/\nfunction matchAllFilter() {\n\treturn MongoExistsExpr.exists(\"_id\");\n}\n/**\n* Resolve an updater callback into a `MongoUpdateSpec` (either the folded\n* operator object or a pipeline-stage array). Centralised so all write\n* terminals share the same fold / dispatch semantics.\n*/\nfunction resolveUpdaterCallback(updaterFn) {\n\treturn resolveUpdaterResult(updaterFn(createFieldAccessor()));\n}\n/**\n* Build the `PlanMeta` envelope shared by every write terminal in this\n* package. Lane is `mongo-query` (single lane for all query-builder terminals)\n* so middleware can dispatch on intent without inspecting the command.\n*/\nfunction writeMeta(storageHash) {\n\treturn {\n\t\ttarget: \"mongo\",\n\t\tstorageHash,\n\t\tlane: \"mongo-query\"\n\t};\n}\n/**\n* Root state of the query-builder state machine. Returned from\n* `mongoQuery(...).from(name)` and bound to a single collection.\n*\n* Inherits the entire pipeline-stage surface from `PipelineChain` (since an\n* empty `CollectionHandle` is observably an empty pipeline). Adds:\n*\n*  - `match(...)` — overridden to transition to `FilteredCollection`, which\n*    accumulates filters for eventual splatting into write/find-and-modify\n*    wire commands.\n*  - **Insert / unqualified-write methods** (M2): `insertOne`, `insertMany`,\n*    `updateAll`, `deleteAll`. These live *only* here — the corresponding\n*    methods are absent from `FilteredCollection`, so a caller cannot\n*    accidentally produce an unqualified write by forgetting to `.match(...)`\n*    later in the chain. Bodies land in M2.\n*/\nvar CollectionHandle = class extends PipelineChain {\n\t#ctx;\n\t#modelName;\n\tconstructor(ctx, modelName) {\n\t\tsuper(ctx.contract, {\n\t\t\tcollection: ctx.collection,\n\t\t\tstages: [],\n\t\t\tstorageHash: ctx.storageHash,\n\t\t\tmodelName\n\t\t});\n\t\tthis.#ctx = ctx;\n\t\tthis.#modelName = modelName;\n\t}\n\t/**\n\t* Bound model name. Exposed so type tests can assert the binding without\n\t* flipping into a pipeline. Not part of the public-API contract.\n\t*/\n\tget _modelName() {\n\t\treturn this.#modelName;\n\t}\n\tmatch(filterOrFn) {\n\t\tconst resolved = typeof filterOrFn === \"function\" ? filterOrFn(createFieldAccessor()) : filterOrFn;\n\t\treturn new FilteredCollection(this.#ctx, this.#modelName, [resolved]);\n\t}\n\t/**\n\t* Insert a single document. Document fields are passed straight through to\n\t* the wire `InsertOneCommand` — codec normalisation happens at the\n\t* adapter/driver boundary, identically to the SQL builder (see Open Item\n\t* #14 confirmation in the design conversation).\n\t*\n\t* Returns a `MongoQueryPlan<InsertOneResult>` whose row stream yields a\n\t* single result document with the server-assigned `insertedId`.\n\t*/\n\tinsertOne(document) {\n\t\tconst command = new InsertOneCommand(this.#ctx.collection, document);\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Insert a batch of documents. Order is preserved in the returned\n\t* `insertedIds` array.\n\t*/\n\tinsertMany(documents) {\n\t\tif (documents.length === 0) throw ormError(\"ORM.MUTATION_DATA_MISSING\", \"insertMany() requires at least one document.\");\n\t\tconst command = new InsertManyCommand(this.#ctx.collection, documents);\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Update *every* document in the collection. Lives only on\n\t* `CollectionHandle` — the corresponding method is intentionally absent\n\t* from `FilteredCollection` so a caller cannot accidentally produce an\n\t* unqualified write by forgetting to `.match(...)` first. Pair with\n\t* `.match(...).updateMany(...)` for the filtered case.\n\t*/\n\tupdateAll(updaterFn) {\n\t\tconst update = resolveUpdaterCallback(updaterFn);\n\t\tconst command = new UpdateManyCommand(this.#ctx.collection, matchAllFilter(), update);\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Delete *every* document in the collection. See `updateAll` for the\n\t* rationale around the unqualified-write surface being limited to this\n\t* state class.\n\t*/\n\tdeleteAll() {\n\t\tconst command = new DeleteManyCommand(this.#ctx.collection, matchAllFilter());\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Insert-or-update the document matching `filterFn`. The filter is\n\t* mandatory (vs. `updateAll`'s tautological match) because an upsert\n\t* without a discriminating predicate would either match every existing\n\t* document or insert an indistinguishable new one.\n\t*\n\t* Maps to `UpdateOneCommand` with `upsert: true`. The driver inserts a\n\t* new document derived from the filter equality fields plus the update\n\t* spec when no match is found; otherwise updates the matched document.\n\t*/\n\tupsertOne(filterFn, updaterFn) {\n\t\tconst filter = filterFn(createFieldAccessor());\n\t\tconst update = resolveUpdaterCallback(updaterFn);\n\t\tconst command = new UpdateOneCommand(this.#ctx.collection, filter, update, true);\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n};\n/**\n* State reached after one or more `.match(...)` calls on `CollectionHandle`.\n*\n* Inherits the pipeline-stage surface from `PipelineChain`, with the\n* accumulated filters baked in as a leading `$match` stage on the underlying\n* pipeline state. This means read-terminal output (`.aggregate()` /\n* `.build()`) and any subsequent pipeline-stage chain see the filtered\n* collection as input — the read story works through pure inheritance.\n*\n* Adds:\n*\n*  - `match(...)` — pushes another `$match` stage *and* records the filter in\n*    the accumulator, so the eventual write/find-and-modify terminal can\n*    splat the AND-folded filter into the wire command's `filter` slot.\n*  - **Filtered writes** (M2): `updateMany`, `updateOne`, `deleteMany`,\n*    `deleteOne`, `upsertOne`. Stubbed in M1. (Upsert-many is an open\n*    question in the spec — see TML-2267 — and is intentionally absent.)\n*  - **Find-and-modify** (M3): `findOneAndUpdate`, `findOneAndDelete`.\n*    Stubbed in M1.\n*\n* Notably *does not* expose `insertOne`/`insertMany`/`updateAll`/`deleteAll`\n* — those are insert or unqualified-write operations that are nonsense\n* after a filter has been applied.\n*/\nvar FilteredCollection = class FilteredCollection extends PipelineChain {\n\t#ctx;\n\t#modelName;\n\t#filters;\n\tconstructor(ctx, modelName, filters) {\n\t\tif (filters.length === 0) throw new InternalError(\"FilteredCollection requires at least one accumulated filter\");\n\t\tconst first = filters[0];\n\t\tif (first === void 0) throw new InternalError(\"FilteredCollection: unreachable empty-filters branch\");\n\t\tconst leading = filters.length === 1 ? first : foldAnd(filters);\n\t\tsuper(ctx.contract, {\n\t\t\tcollection: ctx.collection,\n\t\t\tstages: [new MongoMatchStage(leading)],\n\t\t\tstorageHash: ctx.storageHash,\n\t\t\tmodelName\n\t\t});\n\t\tthis.#ctx = ctx;\n\t\tthis.#modelName = modelName;\n\t\tthis.#filters = filters;\n\t}\n\tget _modelName() {\n\t\treturn this.#modelName;\n\t}\n\t/**\n\t* Accumulated filter list. Exposed for the M2/M3 write/find-and-modify\n\t* terminals to splat into wire-command `filter` slots; not part of the\n\t* public-API contract.\n\t*/\n\tget _filters() {\n\t\treturn this.#filters;\n\t}\n\tmatch(filterOrFn) {\n\t\tconst resolved = typeof filterOrFn === \"function\" ? filterOrFn(createFieldAccessor()) : filterOrFn;\n\t\treturn new FilteredCollection(this.#ctx, this.#modelName, [...this.#filters, resolved]);\n\t}\n\t/**\n\t* AND-fold the accumulated filters into a single `MongoFilterExpr` for\n\t* splatting into a write/find-and-modify wire command's `filter` slot.\n\t* Length-1 short-circuits to avoid a redundant `$and` wrapper.\n\t*/\n\t#foldedFilter() {\n\t\tconst first = this.#filters[0];\n\t\tif (first === void 0) throw new InternalError(\"FilteredCollection: invariant violated — empty filter accumulator\");\n\t\treturn this.#filters.length === 1 ? first : foldAnd(this.#filters);\n\t}\n\t/**\n\t* Update every matching document. `updaterFn` receives a `FieldAccessor`\n\t* and returns an array of `TypedUpdateOp` (e.g. `[f.amount.inc(1),\n\t* f.status.set('done')]`). Operators are folded into the wire-format\n\t* update spec by `foldUpdateOps`, which throws on operator+path\n\t* collisions.\n\t*/\n\tupdateMany(updaterFn) {\n\t\tconst update = resolveUpdaterCallback(updaterFn);\n\t\tconst command = new UpdateManyCommand(this.#ctx.collection, this.#foldedFilter(), update);\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Update at most one matching document. The driver picks the document\n\t* (typically the first one matched by the underlying scan); no ordering\n\t* guarantee is implied — chain `.sort(...)` and use the M3\n\t* `.findOneAndUpdate(...)` terminal when ordering matters.\n\t*/\n\tupdateOne(updaterFn) {\n\t\tconst update = resolveUpdaterCallback(updaterFn);\n\t\tconst command = new UpdateOneCommand(this.#ctx.collection, this.#foldedFilter(), update);\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Delete every matching document.\n\t*/\n\tdeleteMany() {\n\t\tconst command = new DeleteManyCommand(this.#ctx.collection, this.#foldedFilter());\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Delete at most one matching document. See the `updateOne` note about\n\t* driver-chosen victim selection.\n\t*/\n\tdeleteOne() {\n\t\tconst command = new DeleteOneCommand(this.#ctx.collection, this.#foldedFilter());\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Insert-or-update against the accumulated filter. Maps to\n\t* `UpdateOneCommand` with `upsert: true`. Equivalent to\n\t* `CollectionHandle.upsertOne(f => filter, updaterFn)` but reuses the\n\t* already-accumulated `.match(...)` filter chain.\n\t*/\n\tupsertOne(updaterFn) {\n\t\tconst update = resolveUpdaterCallback(updaterFn);\n\t\tconst command = new UpdateOneCommand(this.#ctx.collection, this.#foldedFilter(), update, true);\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Find a single matching document and apply `updaterFn` to it.\n\t*\n\t* `opts.upsert` (default `false`) toggles insert-on-miss behaviour.\n\t* `opts.returnDocument` (default `'after'`) controls whether the row\n\t* stream yields the document as it was before or after the update.\n\t*/\n\tfindOneAndUpdate(updaterFn, opts = {}) {\n\t\tconst update = resolveUpdaterCallback(updaterFn);\n\t\tconst command = new FindOneAndUpdateCommand(this.#ctx.collection, this.#foldedFilter(), update, opts.upsert ?? false, void 0, opts.returnDocument ?? \"after\");\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n\t/**\n\t* Find a single matching document and delete it. Returns the deleted\n\t* document via the row stream.\n\t*/\n\tfindOneAndDelete() {\n\t\tconst command = new FindOneAndDeleteCommand(this.#ctx.collection, this.#foldedFilter());\n\t\treturn {\n\t\t\tcollection: this.#ctx.collection,\n\t\t\tcommand,\n\t\t\tmeta: writeMeta(this.#ctx.storageHash)\n\t\t};\n\t}\n};\nfunction foldAnd(filters) {\n\treturn MongoAndExpr.of(filters);\n}\n/**\n* Narrow a `MongoContractWithTypeMaps`-shaped value down to its underlying\n* `MongoContract` view. `MongoContractWithTypeMaps<C, ...>` is defined as\n* `C & { readonly [phantom]?: TTypeMaps }`, so every contract we accept is\n* structurally a `MongoContract` — the phantom is type-only. This helper\n* centralises that narrowing so callers don't reach for `as unknown as\n* MongoContract` double-casts.\n*/\nfunction asMongoContract(contract) {\n\treturn contract;\n}\n/**\n* Construct a `CollectionHandle` from a validated contract + root name.\n* Used by `mongoQuery(...).from(name)` to enter the state machine.\n*/\nfunction createCollectionHandle(contract, rootName) {\n\tconst c = asMongoContract(contract);\n\tconst modelName = c.roots[rootName]?.model;\n\tif (!modelName) throw ormError(\"ORM.MODEL_UNKNOWN\", `Unknown root: \"${rootName}\". Valid roots: ${Object.keys(c.roots).join(\", \")}`);\n\tconst model = domainModelsAtDefaultNamespace(c.domain)[modelName];\n\tif (!model) throw contractError(\"CONTRACT.MODEL_UNKNOWN\", `Unknown model: \"${modelName}\" referenced by root \"${rootName}\".`);\n\tconst collectionName = model.storage.collection ?? rootName;\n\tif (!c.storage?.storageHash) throw contractError(\"CONTRACT.VALIDATION_FAILED\", \"Contract is missing storage.storageHash. Pass a validated contract to mongoQuery().\");\n\treturn new CollectionHandle({\n\t\tcontract,\n\t\tcollection: collectionName,\n\t\tstorageHash: String(c.storage.storageHash)\n\t}, modelName);\n}\n//#endregion\n//#region src/query.ts\nfunction mongoQuery(options) {\n\tconst contract = blindCast(options.contractJson);\n\treturn {\n\t\tfrom(rootName) {\n\t\t\treturn createCollectionHandle(contract, rootName);\n\t\t},\n\t\trawCommand(command) {\n\t\t\tconst storageHash = asMongoContract(contract).storage?.storageHash;\n\t\t\tif (!storageHash) throw contractError(\"CONTRACT.VALIDATION_FAILED\", \"Contract is missing storage.storageHash. Pass a validated contract to mongoQuery().\");\n\t\t\tconst meta = {\n\t\t\t\ttarget: \"mongo\",\n\t\t\t\tstorageHash: String(storageHash),\n\t\t\t\tlane: \"mongo-query\"\n\t\t\t};\n\t\t\treturn {\n\t\t\t\tcollection: command.collection,\n\t\t\t\tcommand,\n\t\t\t\tmeta\n\t\t\t};\n\t\t}\n\t};\n}\n//#endregion\nexport { CollectionHandle, FilteredCollection, PipelineChain, acc, contractFieldToMongoFieldShape, contractModelToMongoResultShape, createFieldAccessor, expr, fn, mongoQuery };\n\n//# sourceMappingURL=index.mjs.map"],"mappings":";;;;;;;;;AAQA,SAAS,qBAAqB,MAAM;CACnC,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG,OAAO,OAAO,IAAI;CACrF,OAAO;AACR;AACA,MAAM,MAAM;CACX,IAAI,MAAM;EACT,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,IAAI,KAAK,IAAI;EACxC;CACD;CACA,IAAI,MAAM;EACT,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,IAAI,KAAK,IAAI;EACxC;CACD;CACA,IAAI,MAAM;EACT,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,IAAI,KAAK,IAAI;EACxC;CACD;CACA,IAAI,MAAM;EACT,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,IAAI,KAAK,IAAI;EACxC;CACD;CACA,MAAM,MAAM;EACX,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,MAAM,KAAK,IAAI;EAC1C;CACD;CACA,KAAK,MAAM;EACV,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,KAAK,KAAK,IAAI;EACzC;CACD;CACA,KAAK,MAAM;EACV,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,KAAK,KAAK,IAAI;EACzC;CACD;CACA,SAAS,MAAM;EACd,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,SAAS,KAAK,IAAI;EAC7C;CACD;CACA,QAAQ;EACP,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,MAAM;EACjC;CACD;CACA,UAAU,MAAM;EACf,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,UAAU,KAAK,IAAI;EAC9C;CACD;CACA,WAAW,MAAM;EAChB,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,WAAW,KAAK,IAAI;EAC/C;CACD;CACA,OAAO,MAAM;EACZ,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,WAAW,qBAAqB,IAAI,CAAC;EACnE;CACD;CACA,MAAM,MAAM;EACX,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,UAAU,qBAAqB,IAAI,CAAC;EAClE;CACD;CACA,KAAK,MAAM;EACV,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,SAAS,qBAAqB,IAAI,CAAC;EACjE;CACD;CACA,KAAK,MAAM;EACV,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,SAAS,qBAAqB,IAAI,CAAC;EACjE;CACD;CACA,IAAI,MAAM;EACT,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,QAAQ;IACpC,QAAQ,KAAK,OAAO;IACpB,QAAQ,gBAAgB,GAAG,KAAK,MAAM;GACvC,CAAC;EACF;CACD;CACA,OAAO,MAAM;EACZ,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,WAAW;IACvC,QAAQ,KAAK,OAAO;IACpB,QAAQ,gBAAgB,GAAG,KAAK,MAAM;GACvC,CAAC;EACF;CACD;CACA,KAAK,MAAM;EACV,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,SAAS;IACrC,QAAQ,KAAK,OAAO;IACpB,QAAQ,gBAAgB,GAAG,KAAK,MAAM;IACtC,GAAG,KAAK,EAAE;GACX,CAAC;EACF;CACD;CACA,QAAQ,MAAM;EACb,OAAO;GACN,QAAQ,KAAK;GACb,MAAM,oBAAoB,GAAG,YAAY;IACxC,QAAQ,KAAK,OAAO;IACpB,QAAQ,gBAAgB,GAAG,KAAK,MAAM;IACtC,GAAG,KAAK,EAAE;GACX,CAAC;EACF;CACD;AACD;;;;;;;;;;;;AAcA,SAAS,iBAAiB,UAAU;CACnC,MAAM,aAAa,aAAa;EAC/B,MAAM,YAAY,SAAS,MAAM,SAAS,EAAE;EAC5C,IAAI,CAAC,WAAW,MAAM,SAAS,qBAAqB,2BAA2B,SAAS,kBAAkB,OAAO,KAAK,SAAS,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG;EAClJ,OAAO,oBAAoB;GAC1B;GACA;GACA,mBAAmB,+BAA+B,SAAS,MAAM,CAAC,CAAC,UAAU,EAAE,SAAS,cAAc;EACvG,CAAC;CACF;CACA,OAAO;AACR;AACA,SAAS,oBAAoB,OAAO;CACnC,OAAO,EAAE,GAAG,IAAI;EACf,MAAM,SAAS,GAAG,oBAAoB,GAAG,oBAAoB,CAAC;EAC9D,qBAAqB,OAAO,OAAO,OAAO;EAC1C,qBAAqB,OAAO,SAAS,SAAS;EAC9C,OAAO,2BAA2B;GACjC,GAAG;GACH,YAAY,OAAO,MAAM;GACzB,cAAc,OAAO,QAAQ;EAC9B,CAAC;CACF,EAAE;AACH;AACA,SAAS,2BAA2B,OAAO;CAC1C,OAAO,EAAE,GAAG,MAAM;EACjB,OAAO;GACN,QAAQ;GACR,OAAO,MAAM;GACb,QAAQ,MAAM;GACd,aAAa,MAAM;GACnB,eAAe,MAAM;GACrB,KAAK;EACN;CACD,EAAE;AACH;;;;;;;;;;AAUA,SAAS,qBAAqB,OAAO,MAAM;CAC1C,IAAI,CAAC,SAAS,OAAO,MAAM,UAAU,YAAY,MAAM,MAAM,WAAW,GAAG,MAAM,SAAS,wBAAwB,iBAAiB,KAAK,mDAAmD,KAAK,4EAA4E;AAC7Q;;;;;;;AAOA,SAAS,oBAAoB,QAAQ,UAAU;CAC9C,IAAI,QAAQ,WAAW,uCAAuC,MAAM,SAAS,wBAAwB,oIAAoI;CACzO,OAAO;EACN,mBAAmB,+BAA+B,SAAS,MAAM,CAAC,CAAC,OAAO,OAAO,EAAE,SAAS,cAAc,OAAO;EACjH,YAAY,OAAO;EACnB,cAAc,OAAO;EACrB,IAAI,OAAO;EACX,WAAW,OAAO;CACnB;AACD;AAGA,MAAM,qCAAqC,IAAI,IAAI;CAClD;CACA;CACA;CACA;CACA;CACA;AACD,CAAC;AACD,MAAM,eAAe,EAAE,MAAM,UAAU;AACvC,SAAS,iBAAiB,OAAO,MAAM;CACtC,IAAI,MAAM,SAAS,cAAc,KAAK,SAAS,GAAG,GAAG,OAAO;CAC5D,OAAO,MAAM,OAAO,SAAS;AAC9B;AACA,SAAS,aAAa,cAAc,MAAM;CACzC,IAAI,gBAAgB,kBAAkB,OAAO,iBAAiB,cAAc,KAAK,IAAI;CACrF,OAAO;AACR;AACA,SAAS,wBAAwB,cAAc,OAAO;CACrD,IAAI,aAAa,SAAS,YAAY,OAAO,EAAE,MAAM,UAAU;CAC/D,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,UAAU,GAAG;EAC5D,IAAI,UAAU,GAAG;EACjB,IAAI,UAAU,GAAG;GAChB,OAAO,OAAO,aAAa,OAAO,QAAQ;GAC1C;EACD;EACA,OAAO,OAAO,aAAa,cAAc,KAAK;CAC/C;CACA,IAAI,CAAC,OAAO,OAAO,MAAM,YAAY,KAAK,KAAK,aAAa,OAAO,QAAQ,OAAO,SAAS,aAAa,OAAO;CAC/G,OAAO,uBAAuB;EAC7B,MAAM;EACN;CACD,CAAC;AACF;AACA,SAAS,0BAA0B,cAAc,OAAO;CACvD,IAAI,aAAa,SAAS,YAAY,OAAO,EAAE,MAAM,UAAU;CAC/D,MAAM,SAAS,EAAE,GAAG,aAAa,OAAO;CACxC,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,MAAM,MAAM,GAAG,OAAO,OAAO,aAAa,cAAc,IAAI;CACrG,OAAO,uBAAuB;EAC7B,MAAM;EACN;CACD,CAAC;AACF;AACA,SAAS,2BAA2B,QAAQ,YAAY;CACvD,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,QAAQ;EAC3B,IAAI,MAAM,SAAS,WAAW,OAAO,EAAE,MAAM,UAAU;EACvD,IAAI,mBAAmB,IAAI,MAAM,IAAI,GAAG;EACxC,IAAI,iBAAiB,mBAAmB;GACvC,QAAQ,wBAAwB,OAAO,KAAK;GAC5C;EACD;EACA,IAAI,iBAAiB,qBAAqB;GACzC,QAAQ,0BAA0B,OAAO,KAAK;GAC9C;EACD;EACA,OAAO,EAAE,MAAM,UAAU;CAC1B;CACA,OAAO;AACR;AAGA,SAAS,+BAA+B,OAAO;CAC9C,MAAM,EAAE,MAAM,UAAU,SAAS;CACjC,IAAI,KAAK,SAAS,iBAAiB,KAAK,SAAS,SAAS,OAAO,OAAO,OAAO,EAAE,MAAM,UAAU,CAAC;CAClG,IAAI,KAAK,SAAS,UAAU,OAAO,OAAO,OAAO,EAAE,MAAM,UAAU,CAAC;CACpE,IAAI,MAAM,SAAS,MAAM,OAAO,OAAO,OAAO,EAAE,MAAM,UAAU,CAAC;CACjE,IAAI,SAAS,MAAM,OAAO,sBAAsB;EAC/C,MAAM;EACN;EACA,SAAS;GACR,MAAM;GACN,SAAS,KAAK;GACd,UAAU;EACX;CACD,CAAC;CACD,OAAO,sBAAsB;EAC5B,MAAM;EACN,SAAS,KAAK;EACd;CACD,CAAC;AACF;AACA,SAAS,gCAAgC,OAAO,SAAS;CACxD,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,OAAO,SAAS,wBAAwB,CAAC,GAAG,OAAO,OAAO,OAAO,OAAO,EAAE,MAAM,UAAU,CAAC;CACtG,MAAM,cAAc,MAAM;CAC1B,MAAM,OAAO,SAAS,cAAc,KAAK,IAAI,QAAQ,YAAY,OAAO,KAAK,WAAW;CACxF,KAAK,MAAM,OAAO,MAAM;EACvB,IAAI,OAAO,OAAO,QAAQ,GAAG,GAAG;EAChC,MAAM,KAAK,YAAY;EACvB,IAAI,CAAC,IAAI;GACR,OAAO,OAAO,OAAO,OAAO,EAAE,MAAM,UAAU,CAAC;GAC/C;EACD;EACA,OAAO,OAAO,+BAA+B,EAAE;CAChD;CACA,OAAO,uBAAuB;EAC7B,MAAM;EACN;CACD,CAAC;AACF;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,IAAI,gBAAgB,MAAM,cAAc;CACvC;CACA;CACA,YAAY,UAAU,OAAO;EAC5B,KAAKA,YAAY;EACjB,KAAKC,SAAS;CACf;;;;;;;;;;CAUA,WAAW,OAAO;EACjB,OAAO,IAAI,cAAc,KAAKD,WAAW;GACxC,GAAG,KAAKC;GACR,QAAQ,CAAC,GAAG,KAAKA,OAAO,QAAQ,KAAK;EACtC,CAAC;CACF;CACA,aAAa;EACZ,OAAO;GACN,QAAQ;GACR,aAAa,KAAKA,OAAO;GACzB,MAAM;EACP;CACD;CACA,MAAM,YAAY;EACjB,MAAM,SAAS,OAAO,eAAe,aAAa,WAAW,oBAAoB,CAAC,IAAI;EACtF,OAAO,KAAKC,WAAW,IAAI,gBAAgB,MAAM,CAAC;CACnD;;;;;CAKA,KAAK,MAAM;EACV,OAAO,KAAKA,WAAW,IAAI,eAAe,IAAI,CAAC;CAChD;;;;;;CAMA,MAAM,GAAG;EACR,OAAO,KAAKA,WAAW,IAAI,gBAAgB,CAAC,CAAC;CAC9C;;;;;;;CAOA,KAAK,GAAG;EACP,OAAO,KAAKA,WAAW,IAAI,eAAe,CAAC,CAAC;CAC7C;CACA,OAAO,GAAG;EACT,OAAO,KAAKA,WAAW,IAAI,iBAAiB,CAAC,CAAC;CAC/C;;;;;;;;CAQA,UAAU,IAAI;EACb,MAAM,YAAY,GAAG,oBAAoB,CAAC;EAC1C,MAAM,aAAa,CAAC;EACpB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,SAAS,GAAG,WAAW,OAAO,MAAM;EAC9E,OAAO,KAAKA,WAAW,IAAI,oBAAoB,UAAU,CAAC;CAC3D;;;;;;;;;;;;;;CAcA,OAAO,IAAI;EACV,MAAM,YAAY,oBAAoB,GAAG,iBAAiB,KAAKF,SAAS,CAAC,GAAG,KAAKA,SAAS;EAC1F,OAAO,KAAKE,WAAW,IAAI,iBAAiB;GAC3C,MAAM,UAAU;GAChB,YAAY,UAAU;GACtB,cAAc,UAAU;GACxB,IAAI,UAAU;EACf,CAAC,CAAC;CACH;CACA,QAAQ,GAAG,MAAM;EAChB,IAAI,KAAK,WAAW,KAAK,OAAO,KAAK,OAAO,YAAY;GACvD,MAAM,KAAK,KAAK;GAChB,MAAM,OAAO,GAAG,oBAAoB,CAAC;GACrC,MAAM,aAAa,CAAC;GACpB,KAAK,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,IAAI,GAAG,WAAW,OAAO,QAAQ,IAAI,IAAI,IAAI;GACrF,OAAO,KAAKA,WAAW,IAAI,kBAAkB,UAAU,CAAC;EACzD;EACA,MAAM,OAAO;EACb,MAAM,aAAa,CAAC;EACpB,KAAK,MAAM,OAAO,MAAM,WAAW,OAAO;EAC1C,OAAO,KAAKA,WAAW,IAAI,kBAAkB,UAAU,CAAC;CACzD;;;;;;;;CAQA,OAAO,OAAO,SAAS;EACtB,OAAO,KAAKA,WAAW,IAAI,iBAAiB,IAAI,SAAS,SAAS,8BAA8B,KAAK,CAAC;CACvG;;;;;;CAMA,MAAM,IAAI;EACT,MAAM,EAAE,KAAK,aAAa,GAAG,SAAS,GAAG,oBAAoB,CAAC;EAC9D,MAAM,UAAU,gBAAgB,OAAO,OAAO,YAAY;EAC1D,MAAM,eAAe,CAAC;EACtB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,GAAG;GAChD,IAAI,UAAU,MAAM,MAAM,SAAS,wBAAwB,kBAAkB,IAAI,0CAA0C;GAC3H,IAAI,MAAM,KAAK,SAAS,eAAe,MAAM,SAAS,wBAAwB,kBAAkB,IAAI,gEAAgE,MAAM,KAAK,KAAK,cAAc;GAClM,aAAa,OAAO,MAAM;EAC3B;EACA,OAAO,KAAKA,WAAW,IAAI,gBAAgB,SAAS,YAAY,CAAC;CAClE;;;;;;;CAOA,YAAY,IAAI;EACf,MAAM,OAAO,GAAG,oBAAoB,CAAC;EACrC,OAAO,KAAKA,WAAW,IAAI,sBAAsB,KAAK,IAAI,CAAC;CAC5D;CACA,MAAM,OAAO;EACZ,OAAO,KAAKA,WAAW,IAAI,gBAAgB,KAAK,CAAC;CAClD;CACA,YAAY,IAAI;EACf,MAAM,OAAO,GAAG,oBAAoB,CAAC;EACrC,OAAO,KAAKA,WAAW,IAAI,sBAAsB,KAAK,IAAI,CAAC;CAC5D;;;;;CAKA,OAAO,IAAI;EACV,MAAM,OAAO,GAAG,oBAAoB,CAAC;EACrC,OAAO,KAAKA,WAAW,IAAI,iBAAiB,KAAK,IAAI,CAAC;CACvD;;;;;;;;;;;;;;CAcA,IAAI,YAAY,IAAI;EACnB,OAAO,KAAKC,eAAe,IAAI,cAAc,YAAY,EAAE,CAAC;CAC7D;;;;;;;CAOA,MAAM,SAAS;EACd,OAAO,KAAKA,eAAe,IAAI,gBAAgB,OAAO,CAAC;CACxD;CACA,eAAe,OAAO;EACrB,MAAM,WAAW,CAAC,GAAG,KAAKF,OAAO,QAAQ,KAAK;EAC9C,MAAM,UAAU,IAAI,iBAAiB,KAAKA,OAAO,YAAY,QAAQ;EACrE,MAAM,OAAO;GACZ,QAAQ;GACR,aAAa,KAAKA,OAAO;GACzB,MAAM;EACP;EACA,OAAO;GACN,YAAY,KAAKA,OAAO;GACxB;GACA;EACD;CACD;CACA,UAAU,YAAY,UAAU;EAC/B,OAAO,KAAKC,WAAW,IAAI,oBAAoB,YAAY,QAAQ,CAAC;CACrE;CACA,OAAO,SAAS;EACf,OAAO,KAAKA,WAAW,IAAI,iBAAiB,OAAO,CAAC;CACrD;CACA,WAAW,SAAS;EACnB,OAAO,KAAKA,WAAW,IAAI,qBAAqB,OAAO,CAAC;CACzD;CACA,QAAQ,SAAS;EAChB,OAAO,KAAKA,WAAW,IAAI,kBAAkB,OAAO,CAAC;CACtD;CACA,MAAM,QAAQ;EACb,OAAO,KAAKA,WAAW,IAAI,gBAAgB,MAAM,CAAC;CACnD;CACA,YAAY,SAAS;EACpB,OAAO,KAAKA,WAAW,IAAI,sBAAsB,OAAO,CAAC;CAC1D;CACA,gBAAgB,SAAS;EACxB,OAAO,KAAKA,WAAW,IAAI,0BAA0B,OAAO,CAAC;CAC9D;CACA,QAAQ,SAAS;EAChB,OAAO,KAAKA,WAAW,IAAI,kBAAkB,OAAO,CAAC;CACtD;CACA,KAAK,SAAS;EACb,OAAO,KAAKA,WAAW,IAAI,eAAe,OAAO,CAAC;CACnD;CACA,OAAO,QAAQ,OAAO;EACrB,OAAO,KAAKA,WAAW,IAAI,iBAAiB,QAAQ,KAAK,CAAC;CAC3D;CACA,WAAW,QAAQ,OAAO;EACzB,OAAO,KAAKA,WAAW,IAAI,qBAAqB,QAAQ,KAAK,CAAC;CAC/D;CACA,aAAa,SAAS;EACrB,OAAO,KAAKA,WAAW,IAAI,uBAAuB,OAAO,CAAC;CAC3D;CACA,KAAK,OAAO;EACX,OAAO,KAAKA,WAAW,KAAK;CAC7B;;;;;;;;;;;;;;;;;;;CAmBA,WAAW,WAAW;EACrB,IAAI,cAAc,KAAK,GAAG,MAAM,SAAS,wBAAwB,0MAA0M;EAC3Q,MAAM,EAAE,QAAQ,mBAAmB,uBAAuB,KAAKD,OAAO,MAAM;EAC5E,MAAM,UAAU,IAAI,kBAAkB,KAAKA,OAAO,YAAY,QAAQ,cAAc;EACpF,OAAO;GACN,YAAY,KAAKA,OAAO;GACxB;GACA,MAAM,KAAKG,WAAW;EACvB;CACD;;;;;;;CAOA,UAAU,WAAW;EACpB,IAAI,cAAc,KAAK,GAAG,MAAM,SAAS,wBAAwB,wMAAwM;EACzQ,MAAM,EAAE,QAAQ,mBAAmB,uBAAuB,KAAKH,OAAO,MAAM;EAC5E,MAAM,UAAU,IAAI,iBAAiB,KAAKA,OAAO,YAAY,QAAQ,cAAc;EACnF,OAAO;GACN,YAAY,KAAKA,OAAO;GACxB;GACA,MAAM,KAAKG,WAAW;EACvB;CACD;;;;;;;;;;;;;;CAcA,iBAAiB,WAAW,OAAO,CAAC,GAAG;EACtC,MAAM,EAAE,QAAQ,SAAS,8BAA8B,KAAKH,OAAO,MAAM;EACzE,MAAM,SAAS,qBAAqB,UAAU,oBAAoB,CAAC,CAAC;EACpE,MAAM,UAAU,IAAI,wBAAwB,KAAKA,OAAO,YAAY,QAAQ,QAAQ,KAAK,UAAU,OAAO,MAAM,KAAK,kBAAkB,OAAO;EAC9I,MAAM,OAAO;GACZ,QAAQ;GACR,aAAa,KAAKA,OAAO;GACzB,MAAM;EACP;EACA,OAAO;GACN,YAAY,KAAKA,OAAO;GACxB;GACA;EACD;CACD;;;;;CAKA,mBAAmB;EAClB,MAAM,EAAE,QAAQ,SAAS,8BAA8B,KAAKA,OAAO,MAAM;EACzE,MAAM,UAAU,IAAI,wBAAwB,KAAKA,OAAO,YAAY,QAAQ,IAAI;EAChF,MAAM,OAAO;GACZ,QAAQ;GACR,aAAa,KAAKA,OAAO;GACzB,MAAM;EACP;EACA,OAAO;GACN,YAAY,KAAKA,OAAO;GACxB;GACA;EACD;CACD;;;;CAIA,QAAQ;EACP,MAAM,UAAU,IAAI,iBAAiB,KAAKA,OAAO,YAAY,KAAKA,OAAO,MAAM;EAC/E,MAAM,OAAO;GACZ,QAAQ;GACR,aAAa,KAAKA,OAAO;GACzB,MAAM;EACP;EACA,MAAM,YAAY,KAAKA,OAAO;EAC9B,MAAM,iBAAiB,KAAKD;EAC5B,IAAI;EACJ,IAAI,cAAc,KAAK,GAAG;GACzB,MAAM,QAAQ,OAAO,+BAA+B,eAAe,MAAM,CAAC,CAAC,UAAU;GACrF,cAAc,QAAQ,2BAA2B,KAAKC,OAAO,QAAQ,gCAAgC,KAAK,CAAC,IAAI,EAAE,MAAM,UAAU;EAClI;EACA,OAAO;GACN,YAAY,KAAKA,OAAO;GACxB;GACA;GACA,GAAG,UAAU,eAAe,WAAW;EACxC;CACD;;;;CAIA,YAAY;EACX,OAAO,KAAK,MAAM;CACnB;AACD;;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAS,8BAA8B,QAAQ;CAC9C,MAAM,eAAe,CAAC;CACtB,IAAI;CACJ,IAAI,eAAe;CACnB,KAAK,MAAM,SAAS,QAAQ,IAAI,iBAAiB,iBAAiB;EACjE,IAAI,cAAc,MAAM,SAAS,wBAAwB,oMAAoM;EAC7P,aAAa,KAAK,MAAM,MAAM;CAC/B,OAAO,IAAI,iBAAiB,gBAAgB;EAC3C,IAAI,SAAS,KAAK,GAAG,MAAM,SAAS,wBAAwB,6IAA6I;EACzM,OAAO,EAAE,GAAG,MAAM,KAAK;EACvB,eAAe;CAChB,OAAO,IAAI,iBAAiB,gBAAgB,MAAM,SAAS,6BAA6B,+LAA+L;MAClR,MAAM,SAAS,wBAAwB,0GAA0G,MAAM,YAAY,KAAK,kFAAkF;CAC/P,IAAI,aAAa,WAAW,GAAG,MAAM,SAAS,wBAAwB,wEAAwE;CAC9I,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,KAAK,GAAG,MAAM,IAAI,cAAc,6DAA6D;CAC3G,OAAO;EACN,QAAQ,aAAa,WAAW,IAAI,QAAQ,aAAa,GAAG,YAAY;EACxE;CACD;AACD;;;;;;AAMA,SAAS,uBAAuB,QAAQ;CACvC,MAAM,eAAe,CAAC;CACtB,IAAI,WAAW;CACf,KAAK,MAAM,SAAS,QAAQ;EAC3B,IAAI,EAAE,iBAAiB,kBAAkB;EACzC,aAAa,KAAK,MAAM,MAAM;EAC9B;CACD;CACA,IAAI,aAAa,WAAW,GAAG,MAAM,SAAS,wBAAwB,kEAAkE;CACxI,MAAM,YAAY,OAAO,MAAM,QAAQ;CACvC,IAAI,UAAU,WAAW,GAAG,MAAM,SAAS,wBAAwB,oJAAoJ;CACvN,MAAM,iBAAiB,CAAC;CACxB,KAAK,MAAM,SAAS,WAAW,IAAI,iBAAiB,uBAAuB,iBAAiB,qBAAqB,iBAAiB,uBAAuB,eAAe,KAAK,KAAK;MAC7K,MAAM,SAAS,wBAAwB,8DAA8D,MAAM,YAAY,KAAK,uJAAuJ;CACxR,MAAM,QAAQ,aAAa;CAC3B,IAAI,UAAU,KAAK,GAAG,MAAM,IAAI,cAAc,6DAA6D;CAC3G,OAAO;EACN,QAAQ,aAAa,WAAW,IAAI,QAAQ,aAAa,GAAG,YAAY;EACxE;CACD;AACD;AAGA,SAAS,YAAY,IAAI,MAAM;CAC9B,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,KAAK,KAAK,MAAM,EAAE,IAAI,CAAC;CACtD;AACD;AACA,SAAS,iBAAiB,IAAI,KAAK;CAClC,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,IAAI,IAAI;CACvC;AACD;AACA,SAAS,WAAW,IAAI,MAAM;CAC7B,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,KAAK,KAAK,MAAM,EAAE,IAAI,CAAC;CACtD;AACD;AACA,SAAS,gBAAgB,IAAI,KAAK;CACjC,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,IAAI,IAAI;CACvC;AACD;AACA,SAAS,YAAY,IAAI,MAAM;CAC9B,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,KAAK,KAAK,MAAM,EAAE,IAAI,CAAC;CACtD;AACD;AACA,SAAS,iBAAiB,IAAI,KAAK;CAClC,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,IAAI,IAAI;CACvC;AACD;AACA,SAAS,cAAc,IAAI,KAAK;CAC/B,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,IAAI,IAAI;CACvC;AACD;AACA,SAAS,UAAU,IAAI,MAAM;CAC5B,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,KAAK,KAAK,MAAM,EAAE,IAAI,CAAC;CACtD;AACD;AACA,SAAS,eAAe,IAAI,KAAK;CAChC,OAAO;EACN,QAAQ;GACP,SAAS;GACT,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,IAAI,IAAI;CACvC;AACD;AACA,SAAS,aAAa,IAAI,KAAK;CAC9B,OAAO;EACN,QAAQ;GACP,SAAS,IAAI,OAAO;GACpB,UAAU;EACX;EACA,MAAM,iBAAiB,GAAG,IAAI,IAAI,IAAI;CACvC;AACD;AACA,SAAS,cAAc,IAAI,MAAM,QAAQ;CACxC,MAAM,WAAW,CAAC;CAClB,KAAK,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG,SAAS,OAAO,IAAI;CACvF,OAAO;EACN;EACA,MAAM,iBAAiB,GAAG,IAAI,QAAQ;CACvC;AACD;AACA,MAAM,UAAU;CACf,SAAS;CACT,UAAU;AACX;AACA,MAAM,SAAS;CACd,SAAS;CACT,UAAU;AACX;AACA,MAAM,UAAU;CACf,SAAS;CACT,UAAU;AACX;AACA,MAAM,OAAO;CACZ,SAAS;CACT,UAAU;AACX;AACA,MAAM,QAAQ;CACb,SAAS;CACT,UAAU;AACX;AACA,MAAM,MAAM;CACX,SAAS;CACT,UAAU;AACX;AACA,SAAS,QAAQ,OAAO;CACvB,OAAO;EACN,QAAQ,KAAK;EACb,MAAM,gBAAgB,GAAG,KAAK;CAC/B;AACD;AACA,MAAM,KAAK;CACV,IAAI,GAAG,MAAM;EACZ,OAAO,YAAY,QAAQ,IAAI;CAChC;CACA,SAAS,GAAG,GAAG;EACd,OAAO,YAAY,aAAa,CAAC,GAAG,CAAC,CAAC;CACvC;CACA,SAAS,GAAG,MAAM;EACjB,OAAO,YAAY,aAAa,IAAI;CACrC;CACA,OAAO,GAAG,GAAG;EACZ,OAAO,YAAY,WAAW,CAAC,GAAG,CAAC,CAAC;CACrC;CACA,OAAO,GAAG,MAAM;EACf,OAAO,WAAW,WAAW,IAAI;CAClC;CACA,QAAQ,GAAG;EACV,OAAO,gBAAgB,YAAY,CAAC;CACrC;CACA,QAAQ,GAAG;EACV,OAAO,gBAAgB,YAAY,CAAC;CACrC;CACA,KAAK,GAAG;EACP,OAAO,iBAAiB,SAAS,CAAC;CACnC;CACA,KAAK,WAAW,UAAU,UAAU;EACnC,OAAO;GACN,QAAQ,SAAS;GACjB,MAAM,IAAI,aAAa,WAAW,SAAS,MAAM,SAAS,IAAI;EAC/D;CACD;CACA;CACA,KAAK,GAAG;EACP,OAAO,iBAAiB,SAAS,CAAC;CACnC;CACA,MAAM,GAAG;EACR,OAAO,iBAAiB,UAAU,CAAC;CACpC;CACA,WAAW,GAAG;EACb,OAAO,iBAAiB,eAAe,CAAC;CACzC;CACA,KAAK,GAAG;EACP,OAAO,iBAAiB,SAAS,CAAC;CACnC;CACA,OAAO,GAAG;EACT,OAAO,iBAAiB,WAAW,CAAC;CACrC;CACA,OAAO,GAAG;EACT,OAAO,iBAAiB,WAAW,CAAC;CACrC;CACA,YAAY,GAAG;EACd,OAAO,iBAAiB,gBAAgB,CAAC;CAC1C;CACA,aAAa,MAAM;EAClB,OAAO,cAAc,iBAAiB,MAAM,MAAM;CACnD;CACA,eAAe,MAAM;EACpB,OAAO,cAAc,mBAAmB,MAAM,IAAI;CACnD;CACA,SAAS,MAAM;EACd,OAAO,cAAc,aAAa,MAAM,OAAO;CAChD;CACA,QAAQ,MAAM;EACb,OAAO,cAAc,YAAY,MAAM,IAAI;CAC5C;CACA,aAAa,MAAM;EAClB,OAAO,cAAc,iBAAiB,MAAM,IAAI;CACjD;CACA,UAAU,MAAM;EACf,OAAO,cAAc,cAAc,MAAM,IAAI;CAC9C;CACA,OAAO,KAAK,OAAO,QAAQ;EAC1B,OAAO,WAAW,WAAW;GAC5B;GACA;GACA;EACD,CAAC;CACF;CACA,YAAY,KAAK,OAAO,OAAO;EAC9B,OAAO,WAAW,gBAAgB;GACjC;GACA;GACA;EACD,CAAC;CACF;CACA,KAAK,MAAM;EACV,OAAO,cAAc,SAAS,MAAM,MAAM;CAC3C;CACA,MAAM,MAAM;EACX,OAAO,cAAc,UAAU,MAAM,MAAM;CAC5C;CACA,MAAM,MAAM;EACX,OAAO,cAAc,UAAU,MAAM,MAAM;CAC5C;CACA,MAAM,KAAK,WAAW;EACrB,OAAO,UAAU,UAAU,CAAC,KAAK,SAAS,CAAC;CAC5C;CACA,SAAS,GAAG;EACX,OAAO,iBAAiB,aAAa,CAAC;CACvC;CACA,YAAY,GAAG;EACd,OAAO,iBAAiB,gBAAgB,CAAC;CAC1C;CACA,WAAW,MAAM;EAChB,OAAO,cAAc,eAAe,MAAM,OAAO;CAClD;CACA,UAAU,MAAM;EACf,OAAO,cAAc,cAAc,MAAM,GAAG;CAC7C;CACA,aAAa,MAAM;EAClB,OAAO,cAAc,iBAAiB,MAAM,KAAK;CAClD;CACA,WAAW,MAAM;EAChB,OAAO,cAAc,eAAe,MAAM,MAAM;CACjD;CACA,WAAW,MAAM;EAChB,OAAO,cAAc,eAAe,MAAM,MAAM;CACjD;CACA,IAAI,GAAG,GAAG;EACT,OAAO,YAAY,QAAQ,CAAC,GAAG,CAAC,CAAC;CAClC;CACA,GAAG,GAAG,GAAG;EACR,OAAO,YAAY,OAAO,CAAC,GAAG,CAAC,CAAC;CACjC;CACA,GAAG,GAAG,GAAG;EACR,OAAO,YAAY,OAAO,CAAC,GAAG,CAAC,CAAC;CACjC;CACA,GAAG,GAAG,GAAG;EACR,OAAO,YAAY,OAAO,CAAC,GAAG,CAAC,CAAC;CACjC;CACA,IAAI,GAAG,GAAG;EACT,OAAO,YAAY,QAAQ,CAAC,GAAG,CAAC,CAAC;CAClC;CACA,GAAG,GAAG,GAAG;EACR,OAAO,YAAY,OAAO,CAAC,GAAG,CAAC,CAAC;CACjC;CACA,IAAI,GAAG,GAAG;EACT,OAAO,YAAY,QAAQ,CAAC,GAAG,CAAC,CAAC;CAClC;CACA,YAAY,KAAK,KAAK;EACrB,OAAO;GACN,QAAQ;IACP,SAAS,IAAI;IACb,UAAU;GACX;GACA,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC;EAC/D;CACD;CACA,aAAa,GAAG,MAAM;EACrB,OAAO,UAAU,iBAAiB,IAAI;CACvC;CACA,UAAU,GAAG;EACZ,OAAO;GACN,QAAQ;IACP,SAAS,IAAI;IACb,UAAU;GACX;GACA,MAAM,iBAAiB,GAAG,UAAU,EAAE,IAAI;EAC3C;CACD;CACA,SAAS,GAAG;EACX,OAAO;GACN,QAAQ;IACP,SAAS,IAAI;IACb,UAAU;GACX;GACA,MAAM,iBAAiB,GAAG,SAAS,EAAE,IAAI;EAC1C;CACD;CACA,KAAK,MAAM,KAAK;EACf,OAAO,YAAY,OAAO,CAAC,MAAM,GAAG,CAAC;CACtC;CACA,aAAa,KAAK,OAAO,GAAG,MAAM;EACjC,OAAO,YAAY,iBAAiB;GACnC;GACA;GACA,GAAG;EACJ,CAAC;CACF;CACA,QAAQ,GAAG;EACV,OAAO,iBAAiB,YAAY,CAAC;CACtC;CACA,aAAa,GAAG;EACf,OAAO,eAAe,iBAAiB,CAAC;CACzC;CACA,MAAM,KAAK,GAAG,MAAM;EACnB,OAAO,UAAU,UAAU,CAAC,KAAK,GAAG,IAAI,CAAC;CAC1C;CACA,IAAI,MAAM;EACT,MAAM,WAAW,EAAE,QAAQ,KAAK,OAAO,KAAK,MAAM,EAAE,IAAI,EAAE;EAC1D,IAAI,KAAK,kBAAkB,SAAS,sBAAsB,KAAK,iBAAiB;EAChF,IAAI,KAAK,UAAU,SAAS,cAAc,KAAK,SAAS;EACxD,OAAO;GACN,QAAQ;GACR,MAAM,iBAAiB,GAAG,QAAQ,QAAQ;EAC3C;CACD;CACA,MAAM,OAAO,KAAK,MAAM;EACvB,OAAO,UAAU,UAAU;GAC1B;GACA;GACA;EACD,CAAC;CACF;CACA,SAAS,GAAG,MAAM;EACjB,OAAO,UAAU,aAAa,IAAI;CACnC;CACA,gBAAgB,GAAG,MAAM;EACxB,OAAO,UAAU,oBAAoB,IAAI;CAC1C;CACA,cAAc,GAAG,GAAG;EACnB,OAAO,UAAU,kBAAkB,CAAC,GAAG,CAAC,CAAC;CAC1C;CACA,UAAU,GAAG,MAAM;EAClB,OAAO,YAAY,cAAc,IAAI;CACtC;CACA,YAAY,GAAG,GAAG;EACjB,OAAO,YAAY,gBAAgB,CAAC,GAAG,CAAC,CAAC;CAC1C;CACA,eAAe,GAAG;EACjB,OAAO,iBAAiB,mBAAmB,CAAC;CAC7C;CACA,gBAAgB,GAAG;EAClB,OAAO,iBAAiB,oBAAoB,CAAC;CAC9C;CACA,OAAO,GAAG;EACT,OAAO,gBAAgB,SAAS,CAAC;CAClC;CACA,QAAQ,MAAM;EACb,OAAO,cAAc,YAAY,MAAM,GAAG;CAC3C;CACA,MAAM,GAAG;EACR,OAAO,iBAAiB,UAAU,CAAC;CACpC;CACA,OAAO,GAAG;EACT,OAAO,iBAAiB,WAAW,CAAC;CACrC;CACA,SAAS,GAAG;EACX,OAAO,iBAAiB,aAAa,CAAC;CACvC;CACA,UAAU,GAAG;EACZ,OAAO,iBAAiB,cAAc,CAAC;CACxC;CACA,UAAU,GAAG;EACZ,OAAO,gBAAgB,aAAa,CAAC;CACtC;CACA,WAAW,GAAG;EACb,OAAO,aAAa,eAAe,CAAC;CACrC;CACA,OAAO,GAAG;EACT,OAAO,iBAAiB,WAAW,CAAC;CACrC;CACA,OAAO,GAAG;EACT,OAAO,cAAc,WAAW,CAAC;CAClC;CACA,cAAc,GAAG;EAChB,OAAO,eAAe,kBAAkB,CAAC;CAC1C;CACA,cAAc,GAAG;EAChB,OAAO;GACN,QAAQ;GACR,MAAM,iBAAiB,GAAG,kBAAkB,EAAE,IAAI;EACnD;CACD;CACA,SAAS,MAAM;EACd,OAAO,cAAc,aAAa,MAAM,GAAG;CAC5C;CACA,SAAS,MAAM;EACd,OAAO,cAAc,aAAa,MAAM,GAAG;CAC5C;AACD;AAGA,SAAS,cAAc,MAAM,SAAS,SAAS;CAC9C,OAAO,gBAAgB,MAAM,SAAS,OAAO;AAC9C;;;;;;;;;;AAYA,SAAS,iBAAiB;CACzB,OAAO,gBAAgB,OAAO,KAAK;AACpC;;;;;;AAMA,SAAS,uBAAuB,WAAW;CAC1C,OAAO,qBAAqB,UAAU,oBAAoB,CAAC,CAAC;AAC7D;;;;;;AAMA,SAAS,UAAU,aAAa;CAC/B,OAAO;EACN,QAAQ;EACR;EACA,MAAM;CACP;AACD;;;;;;;;;;;;;;;;;AAiBA,IAAI,mBAAmB,cAAc,cAAc;CAClD;CACA;CACA,YAAY,KAAK,WAAW;EAC3B,MAAM,IAAI,UAAU;GACnB,YAAY,IAAI;GAChB,QAAQ,CAAC;GACT,aAAa,IAAI;GACjB;EACD,CAAC;EACD,KAAKI,OAAO;EACZ,KAAKC,aAAa;CACnB;;;;;CAKA,IAAI,aAAa;EAChB,OAAO,KAAKA;CACb;CACA,MAAM,YAAY;EACjB,MAAM,WAAW,OAAO,eAAe,aAAa,WAAW,oBAAoB,CAAC,IAAI;EACxF,OAAO,IAAI,mBAAmB,KAAKD,MAAM,KAAKC,YAAY,CAAC,QAAQ,CAAC;CACrE;;;;;;;;;;CAUA,UAAU,UAAU;EACnB,MAAM,UAAU,IAAI,iBAAiB,KAAKD,KAAK,YAAY,QAAQ;EACnE,OAAO;GACN,YAAY,KAAKA,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;CAKA,WAAW,WAAW;EACrB,IAAI,UAAU,WAAW,GAAG,MAAM,SAAS,6BAA6B,8CAA8C;EACtH,MAAM,UAAU,IAAI,kBAAkB,KAAKA,KAAK,YAAY,SAAS;EACrE,OAAO;GACN,YAAY,KAAKA,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;;;;CAQA,UAAU,WAAW;EACpB,MAAM,SAAS,uBAAuB,SAAS;EAC/C,MAAM,UAAU,IAAI,kBAAkB,KAAKA,KAAK,YAAY,eAAe,GAAG,MAAM;EACpF,OAAO;GACN,YAAY,KAAKA,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;;CAMA,YAAY;EACX,MAAM,UAAU,IAAI,kBAAkB,KAAKA,KAAK,YAAY,eAAe,CAAC;EAC5E,OAAO;GACN,YAAY,KAAKA,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;;;;;;;CAWA,UAAU,UAAU,WAAW;EAC9B,MAAM,SAAS,SAAS,oBAAoB,CAAC;EAC7C,MAAM,SAAS,uBAAuB,SAAS;EAC/C,MAAM,UAAU,IAAI,iBAAiB,KAAKA,KAAK,YAAY,QAAQ,QAAQ,IAAI;EAC/E,OAAO;GACN,YAAY,KAAKA,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;AACD;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,IAAI,qBAAqB,MAAM,2BAA2B,cAAc;CACvE;CACA;CACA;CACA,YAAY,KAAK,WAAW,SAAS;EACpC,IAAI,QAAQ,WAAW,GAAG,MAAM,IAAI,cAAc,6DAA6D;EAC/G,MAAM,QAAQ,QAAQ;EACtB,IAAI,UAAU,KAAK,GAAG,MAAM,IAAI,cAAc,sDAAsD;EACpG,MAAM,UAAU,QAAQ,WAAW,IAAI,QAAQ,QAAQ,OAAO;EAC9D,MAAM,IAAI,UAAU;GACnB,YAAY,IAAI;GAChB,QAAQ,CAAC,IAAI,gBAAgB,OAAO,CAAC;GACrC,aAAa,IAAI;GACjB;EACD,CAAC;EACD,KAAKA,OAAO;EACZ,KAAKC,aAAa;EAClB,KAAKC,WAAW;CACjB;CACA,IAAI,aAAa;EAChB,OAAO,KAAKD;CACb;;;;;;CAMA,IAAI,WAAW;EACd,OAAO,KAAKC;CACb;CACA,MAAM,YAAY;EACjB,MAAM,WAAW,OAAO,eAAe,aAAa,WAAW,oBAAoB,CAAC,IAAI;EACxF,OAAO,IAAI,mBAAmB,KAAKF,MAAM,KAAKC,YAAY,CAAC,GAAG,KAAKC,UAAU,QAAQ,CAAC;CACvF;;;;;;CAMA,gBAAgB;EACf,MAAM,QAAQ,KAAKA,SAAS;EAC5B,IAAI,UAAU,KAAK,GAAG,MAAM,IAAI,cAAc,mEAAmE;EACjH,OAAO,KAAKA,SAAS,WAAW,IAAI,QAAQ,QAAQ,KAAKA,QAAQ;CAClE;;;;;;;;CAQA,WAAW,WAAW;EACrB,MAAM,SAAS,uBAAuB,SAAS;EAC/C,MAAM,UAAU,IAAI,kBAAkB,KAAKF,KAAK,YAAY,KAAKG,cAAc,GAAG,MAAM;EACxF,OAAO;GACN,YAAY,KAAKH,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;;;CAOA,UAAU,WAAW;EACpB,MAAM,SAAS,uBAAuB,SAAS;EAC/C,MAAM,UAAU,IAAI,iBAAiB,KAAKA,KAAK,YAAY,KAAKG,cAAc,GAAG,MAAM;EACvF,OAAO;GACN,YAAY,KAAKH,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;CAIA,aAAa;EACZ,MAAM,UAAU,IAAI,kBAAkB,KAAKA,KAAK,YAAY,KAAKG,cAAc,CAAC;EAChF,OAAO;GACN,YAAY,KAAKH,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;CAKA,YAAY;EACX,MAAM,UAAU,IAAI,iBAAiB,KAAKA,KAAK,YAAY,KAAKG,cAAc,CAAC;EAC/E,OAAO;GACN,YAAY,KAAKH,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;;;CAOA,UAAU,WAAW;EACpB,MAAM,SAAS,uBAAuB,SAAS;EAC/C,MAAM,UAAU,IAAI,iBAAiB,KAAKA,KAAK,YAAY,KAAKG,cAAc,GAAG,QAAQ,IAAI;EAC7F,OAAO;GACN,YAAY,KAAKH,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;;;;CAQA,iBAAiB,WAAW,OAAO,CAAC,GAAG;EACtC,MAAM,SAAS,uBAAuB,SAAS;EAC/C,MAAM,UAAU,IAAI,wBAAwB,KAAKA,KAAK,YAAY,KAAKG,cAAc,GAAG,QAAQ,KAAK,UAAU,OAAO,KAAK,GAAG,KAAK,kBAAkB,OAAO;EAC5J,OAAO;GACN,YAAY,KAAKH,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;;;;;CAKA,mBAAmB;EAClB,MAAM,UAAU,IAAI,wBAAwB,KAAKA,KAAK,YAAY,KAAKG,cAAc,CAAC;EACtF,OAAO;GACN,YAAY,KAAKH,KAAK;GACtB;GACA,MAAM,UAAU,KAAKA,KAAK,WAAW;EACtC;CACD;AACD;AACA,SAAS,QAAQ,SAAS;CACzB,OAAO,aAAa,GAAG,OAAO;AAC/B;;;;;;;;;AASA,SAAS,gBAAgB,UAAU;CAClC,OAAO;AACR;;;;;AAKA,SAAS,uBAAuB,UAAU,UAAU;CACnD,MAAM,IAAI,gBAAgB,QAAQ;CAClC,MAAM,YAAY,EAAE,MAAM,SAAS,EAAE;CACrC,IAAI,CAAC,WAAW,MAAM,SAAS,qBAAqB,kBAAkB,SAAS,kBAAkB,OAAO,KAAK,EAAE,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG;CAClI,MAAM,QAAQ,+BAA+B,EAAE,MAAM,CAAC,CAAC;CACvD,IAAI,CAAC,OAAO,MAAM,cAAc,0BAA0B,mBAAmB,UAAU,wBAAwB,SAAS,GAAG;CAC3H,MAAM,iBAAiB,MAAM,QAAQ,cAAc;CACnD,IAAI,CAAC,EAAE,SAAS,aAAa,MAAM,cAAc,8BAA8B,qFAAqF;CACpK,OAAO,IAAI,iBAAiB;EAC3B;EACA,YAAY;EACZ,aAAa,OAAO,EAAE,QAAQ,WAAW;CAC1C,GAAG,SAAS;AACb;AAGA,SAAS,WAAW,SAAS;CAC5B,MAAM,WAAW,UAAU,QAAQ,YAAY;CAC/C,OAAO;EACN,KAAK,UAAU;GACd,OAAO,uBAAuB,UAAU,QAAQ;EACjD;EACA,WAAW,SAAS;GACnB,MAAM,cAAc,gBAAgB,QAAQ,CAAC,CAAC,SAAS;GACvD,IAAI,CAAC,aAAa,MAAM,cAAc,8BAA8B,qFAAqF;GACzJ,MAAM,OAAO;IACZ,QAAQ;IACR,aAAa,OAAO,WAAW;IAC/B,MAAM;GACP;GACA,OAAO;IACN,YAAY,QAAQ;IACpB;IACA;GACD;EACD;CACD;AACD"}

package/dist/emitter.d.mts

@@ -0,0 +1,22 @@
+import { Contract, ContractModelBase, JsonValue } from "@prisma/orm-framework/contract/types";
+import { ImportSpecifierResolver, ValidationContext } from "@prisma/orm-framework/components/emission";
+//#region ../../../2-mongo-family/3-tooling/emitter/dist/exports/index.d.mts
+//#region src/index.d.ts
+declare const mongoEmission: {
+  id: string;
+  validateTypes(contract: Contract, _ctx: ValidationContext): void;
+  validateStructure(contract: Contract): void;
+  generateStorageType(contract: Contract, storageHashTypeName: string): string;
+  generateModelStorageType(_modelName: string, model: ContractModelBase): string;
+  resolveFieldValueSet(_modelName: string, fieldName: string, model: ContractModelBase, contract: Contract): {
+    readonly encodedValues: readonly JsonValue[];
+    readonly codecId: string;
+  } | undefined;
+  getFamilyImports(resolveImportSpecifier: ImportSpecifierResolver): string[];
+  getFamilyTypeAliases(): string;
+  getTypeMapsExpression(): string;
+  getContractWrapper(contractBaseName: string, typeMapsName: string): string;
+};
+//#endregion
+export { mongoEmission };
+//# sourceMappingURL=emitter.d.mts.map

package/dist/emitter.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"emitter.d.mts","names":[],"sources":["../../../../2-mongo-family/3-tooling/emitter/dist/exports/index.d.mts"],"mappings":";;;;cAGc;EACZ;EACA,cAAc,UAAU,UAAU,MAAM;EACxC,kBAAkB,UAAU;EAC5B,oBAAoB,UAAU,UAAU;EACxC,yBAAyB,oBAAoB,OAAO;EACpD,qBAAqB,oBAAoB,mBAAmB,OAAO,mBAAmB,UAAU;aACrF,wBAAwB;aACxB;;EAEX,iBAAiB,wBAAwB;EACzC;EACA;EACA,mBAAmB,0BAA0B"}

package/dist/emitter.mjs

@@ -0,0 +1,2 @@
+import { t as mongoEmission } from "./exports-CJMh0VTU.mjs";
+export { mongoEmission };