@entifix/testing-unit 0.1.1 → 0.1.3

package/dist/drivers/fake-mongo.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/drivers/fake-mongo.ts"],"sourcesContent":["/**\n * A fake of the mongodb driver, not of the repository port.\n *\n * It sits one level *below* `makeMongoRepository`, so the adapter's own code —\n * the filter translation, the projection, the upsert rule, the error mapping —\n * actually runs and is measured by coverage. A fake at the port level would\n * skip all of it.\n *\n * Only the surface the adapter uses is implemented; anything else is a\n * deliberate `TypeError` rather than a silent no-op.\n */\n\n/** The subset of a Mongo query document the adapter produces. */\ntype QueryDocument = Record<string, unknown>;\ntype Document = Record<string, unknown>;\n\nconst isPlainObject = (value: unknown): value is Document =>\n  typeof value === 'object' && value !== null && !Array.isArray(value);\n\nconst compare = (left: unknown, right: unknown): number => {\n  if (left == null && right == null) return 0;\n  if (left == null) return -1;\n  if (right == null) return 1;\n  if (typeof left === 'number' && typeof right === 'number')\n    return left - right;\n  if (left instanceof Date && right instanceof Date) {\n    return left.getTime() - right.getTime();\n  }\n  return String(left).localeCompare(String(right));\n};\n\n/** Evaluates one `{ $op: value }` condition against a document field. */\nconst matchesCondition = (actual: unknown, condition: unknown): boolean => {\n  if (!isPlainObject(condition)) {\n    return actual === condition;\n  }\n\n  return Object.entries(condition).every(([operator, operand]) => {\n    switch (operator) {\n      case '$eq':\n        return actual === operand;\n      case '$ne':\n        return actual !== operand;\n      case '$gt':\n        return compare(actual, operand) > 0;\n      case '$gte':\n        return compare(actual, operand) >= 0;\n      case '$lt':\n        return compare(actual, operand) < 0;\n      case '$lte':\n        return compare(actual, operand) <= 0;\n      case '$in':\n        return (operand as unknown[]).includes(actual);\n      // Absence, not falsiness. A settlement ledger keys \"unpaid\" on a `runId`\n      // that is not there at all, and `undefined` is what a document without\n      // the field reads as — so `{ $exists: false }` must be a different test\n      // from `{ $eq: undefined }` would be if the serializer ever wrote one.\n      case '$exists':\n        return (actual !== undefined) === (operand as boolean);\n      case '$nin':\n        return !(operand as unknown[]).includes(actual);\n      case '$not':\n        return !matchesCondition(actual, operand);\n      case '$regex':\n        return new RegExp(\n          operand as string,\n          (condition['$options'] as string) ?? '',\n        ).test(String(actual));\n      case '$options':\n        // Handled together with `$regex`.\n        return true;\n      default:\n        throw new TypeError(`fake mongo: unsupported operator \"${operator}\"`);\n    }\n  });\n};\n\n/**\n * Evaluates one node of an aggregation expression — the `$expr` half of a\n * query, which is a different language from the operators above: it compares\n * two *fields of the same document* rather than a field against a constant.\n *\n * Only the shape a conditional stock write sends is implemented — a\n * `$subtract` of two field paths compared with `$gte` — and anything else is a\n * `TypeError`. That is the same rule the rest of this file follows: a fake that\n * quietly evaluated an expression it does not understand would answer `true`\n * for a document the real server would have refused, which turns an\n * oversell-prevention test into a test that asserts nothing.\n */\nconst evaluateExpression = (doc: Document, node: unknown): unknown => {\n  if (typeof node === 'string' && node.startsWith('$')) {\n    return doc[node.slice(1)];\n  }\n  if (!isPlainObject(node)) {\n    return node;\n  }\n\n  const entries = Object.entries(node);\n  if (entries.length !== 1) {\n    throw new TypeError(\n      `fake mongo: $expr node must have exactly one operator, got ${entries.length}`,\n    );\n  }\n  const [operator, operand] = entries[0];\n  const operands = (operand as unknown[]).map(child =>\n    evaluateExpression(doc, child),\n  );\n\n  switch (operator) {\n    case '$subtract':\n      return (operands[0] as number) - (operands[1] as number);\n    case '$add':\n      return (operands[0] as number) + (operands[1] as number);\n    case '$gte':\n      return compare(operands[0], operands[1]) >= 0;\n    case '$gt':\n      return compare(operands[0], operands[1]) > 0;\n    case '$lte':\n      return compare(operands[0], operands[1]) <= 0;\n    case '$lt':\n      return compare(operands[0], operands[1]) < 0;\n    case '$eq':\n      return operands[0] === operands[1];\n    default:\n      throw new TypeError(\n        `fake mongo: unsupported $expr operator \"${operator}\"`,\n      );\n  }\n};\n\n/**\n * Every value a field path names, the way the server reads one.\n *\n * A dotted path descends, and **an array on the way down is walked\n * element-wise** — which is what makes `{'items.vendorId': x}` match an order\n * with a line for that vendor rather than nothing at all. Without it a query\n * into an embedded collection silently answers empty here while working against\n * a real server, which is worse than an unsupported-operator throw: the spec\n * passes and asserts the opposite of what it claims.\n *\n * The array itself is kept as a candidate beside its elements, because the\n * server matches both — `{ tags: 'a' }` matches `{ tags: ['a'] }` and\n * `{ tags: 'a' }` alike.\n */\nconst valuesAt = (doc: Document, field: string): unknown[] => {\n  let current: unknown[] = [doc];\n  for (const segment of field.split('.')) {\n    const next: unknown[] = [];\n    for (const value of current) {\n      const container = Array.isArray(value) ? value : [value];\n      for (const element of container) {\n        if (isPlainObject(element)) {\n          next.push(element[segment]);\n        }\n      }\n    }\n    current = next;\n  }\n  return current.flatMap(value =>\n    Array.isArray(value) ? [value, ...value] : [value],\n  );\n};\n\n/** Operators that exclude a document when a single value matches them. */\nconst NEGATIVE_OPERATORS = new Set(['$ne', '$nin', '$not']);\n\nconst isNegativeCondition = (condition: unknown): boolean =>\n  isPlainObject(condition) &&\n  Object.keys(condition).some(operator => NEGATIVE_OPERATORS.has(operator));\n\nconst matches = (doc: Document, query: QueryDocument): boolean =>\n  Object.entries(query).every(([field, condition]) => {\n    if (field === '$and') {\n      return (condition as QueryDocument[]).every(child => matches(doc, child));\n    }\n    if (field === '$or') {\n      return (condition as QueryDocument[]).some(child => matches(doc, child));\n    }\n    if (field === '$expr') {\n      return evaluateExpression(doc, condition) === true;\n    }\n    const candidates = valuesAt(doc, field);\n    if (candidates.length === 0) {\n      return matchesCondition(undefined, condition);\n    }\n    // A positive condition matches when **any** value at the path satisfies it;\n    // a negative one only when **every** value does. That asymmetry is the\n    // server's: `{ 'items.vendorId': { $ne: 'a' } }` must exclude an order that\n    // has a line for `a`, not include it because some other line differs.\n    return isNegativeCondition(condition)\n      ? candidates.every(value => matchesCondition(value, condition))\n      : candidates.some(value => matchesCondition(value, condition));\n  });\n\n/**\n * The error a real server raises when a write violates a unique index.\n *\n * The `code` matters and the message does not: callers recognise a duplicate\n * key by `error.code === 11000` (or the same code inside `writeErrors`), and a\n * fake that threw a plain `Error` would send a retry path that exists precisely\n * for this case down the \"unexpected failure\" branch instead.\n */\nclass FakeDuplicateKeyError extends Error {\n  readonly code = 11000;\n\n  constructor(collection: string, key: Document) {\n    super(\n      `fake mongo: E11000 duplicate key error collection: ${collection} dup key: ${JSON.stringify(key)}`,\n    );\n    this.name = 'MongoServerError';\n  }\n}\n\nexport interface FakeMongoCollection {\n  /** The documents currently stored, as the driver would return them. */\n  readonly documents: Document[];\n}\n\nexport interface FakeMongoDb {\n  /** Replaces a collection's contents. */\n  seed(collection: string, documents: Document[]): void;\n  /** Reads a collection's current contents. */\n  read(collection: string): Document[];\n  /**\n   * Makes every subsequent driver call reject with `error`, so the adapter's\n   * `EntifixConnError` mapping is reachable. Pass `undefined` to restore.\n   */\n  failWith(error: unknown): void;\n  /**\n   * Makes only `operation` reject, leaving the rest working — the way a read\n   * that succeeds and a count that then fails reaches a distinct error branch.\n   */\n  failOn(operation: string, error: unknown): void;\n  /** Every operation performed, for assertions about what the adapter did. */\n  readonly operations: ReadonlyArray<{ collection: string; op: string }>;\n  /**\n   * Opens a session whose `withTransaction` rolls the whole store back when its\n   * body throws. What a service hands to `client.startSession()`; see the\n   * implementation for why it is atomicity and not isolation.\n   */\n  startSession(): {\n    withTransaction(body: () => Promise<unknown>): Promise<unknown>;\n    endSession(): Promise<void>;\n    readonly hasEnded: boolean;\n  };\n  /** The object to hand to `makeMongoRepository` in place of a real `Db`. */\n  readonly db: unknown;\n}\n\n/**\n * Builds an in-memory stand-in for a mongodb `Db`.\n *\n * `db` is typed `unknown` on purpose: casting it at the call site keeps this\n * package free of a hard dependency on the `mongodb` types while remaining\n * honest that it is not a real driver.\n */\nexport const makeFakeMongoDb = (\n  seed: Record<string, Document[]> = {},\n): FakeMongoDb => {\n  const collections = new Map<string, Document[]>(\n    Object.entries(seed).map(([name, docs]) => [\n      name,\n      docs.map(d => ({ ...d })),\n    ]),\n  );\n  const operations: Array<{ collection: string; op: string }> = [];\n  let failure: unknown;\n  const failuresByOperation = new Map<string, unknown>();\n\n  const documentsOf = (name: string): Document[] => {\n    if (!collections.has(name)) collections.set(name, []);\n    return collections.get(name) as Document[];\n  };\n\n  /**\n   * The unique indexes `createIndex` has been asked for, per collection, as the\n   * field lists they key on.\n   *\n   * Recording them is not bookkeeping: `updateOne` with `upsert` is atomic per\n   * *document*, so two concurrent upserts for the same key each fail to see the\n   * other's uncommitted insert and each create a row. The index is what makes\n   * the fold singular, and a fake that accepted `createIndex` as a no-op would\n   * report a service as covered while the property the index exists for went\n   * untested (ADR 0010).\n   */\n  const uniqueIndexes = new Map<string, string[][]>();\n\n  const uniqueIndexesOf = (name: string): string[][] =>\n    uniqueIndexes.get(name) ?? [];\n\n  /**\n   * Refuses `candidate` if it would duplicate an existing document under one of\n   * the collection's unique indexes.\n   *\n   * `ignored` is the document being replaced by an update, which must not count\n   * as its own duplicate. A key whose value is `undefined` on the candidate is\n   * skipped: a real index treats a missing field as `null` and would collide,\n   * but nothing in this repo indexes an optional member, and guessing wrong\n   * here would fail writes the server accepts.\n   */\n  const assertUnique = (\n    name: string,\n    candidate: Document,\n    ignored?: Document,\n  ): void => {\n    for (const fields of uniqueIndexesOf(name)) {\n      if (fields.some(field => candidate[field] === undefined)) continue;\n      const clash = documentsOf(name).find(\n        doc =>\n          doc !== ignored &&\n          fields.every(field => doc[field] === candidate[field]),\n      );\n      if (clash !== undefined) {\n        throw new FakeDuplicateKeyError(\n          name,\n          Object.fromEntries(fields.map(field => [field, candidate[field]])),\n        );\n      }\n    }\n  };\n\n  const record = <TValue>(name: string, op: string, produce: () => TValue) => {\n    operations.push({ collection: name, op });\n    const scoped = failuresByOperation.get(op);\n    if (scoped !== undefined) return Promise.reject(scoped);\n    if (failure !== undefined) return Promise.reject(failure);\n    // `try`/`catch` rather than `Promise.resolve(produce())`: a real driver\n    // returns a promise and *rejects*, so a fake that threw synchronously would\n    // need different handling at every call site than the thing it stands in for.\n    try {\n      return Promise.resolve(produce());\n    } catch (error) {\n      return Promise.reject(error);\n    }\n  };\n\n  /** Applies `{ projection: { _id: 0 } }`, the only projection the adapter uses. */\n  const project = (doc: Document, options?: { projection?: Document }) => {\n    const copy = { ...doc };\n    if (options?.projection && options.projection['_id'] === 0) {\n      delete copy['_id'];\n    }\n    return copy;\n  };\n\n  const collection = (name: string) => ({\n    find: (query: QueryDocument = {}, options?: { projection?: Document }) => {\n      let sortSpec: Record<string, 1 | -1> = {};\n      let skipCount = 0;\n      let limitCount = Infinity;\n\n      const cursor = {\n        sort(spec: Record<string, 1 | -1>) {\n          sortSpec = spec;\n          return cursor;\n        },\n        skip(count: number) {\n          skipCount = count;\n          return cursor;\n        },\n        limit(count: number) {\n          limitCount = count;\n          return cursor;\n        },\n        toArray: () =>\n          record(name, 'find', () => {\n            const matched = documentsOf(name).filter(doc =>\n              matches(doc, query),\n            );\n            const sorted = Object.entries(sortSpec).reduceRight(\n              (items, [field, direction]) =>\n                [...items].sort(\n                  (left, right) =>\n                    compare(left[field], right[field]) * direction,\n                ),\n              matched,\n            );\n            return sorted\n              .slice(skipCount, skipCount + limitCount)\n              .map(doc => project(doc, options));\n          }),\n      };\n      return cursor;\n    },\n\n    findOne: (query: QueryDocument, options?: { projection?: Document }) =>\n      record(name, 'findOne', () => {\n        const found = documentsOf(name).find(doc => matches(doc, query));\n        return found === undefined ? null : project(found, options);\n      }),\n\n    countDocuments: (query: QueryDocument = {}) =>\n      record(\n        name,\n        'countDocuments',\n        () => documentsOf(name).filter(doc => matches(doc, query)).length,\n      ),\n\n    // Used by the services' own seeding, which the e2e `mock` profile runs for\n    // real so both profiles serve the same catalog.\n    insertMany: (documents: Document[]) =>\n      record(name, 'insertMany', () => {\n        const stored = documentsOf(name);\n        for (const document of documents) {\n          assertUnique(name, document);\n          stored.push({ ...document });\n        }\n        return { insertedCount: documents.length };\n      }),\n\n    /**\n     * A single insert — how an append-only ledger grows, and how a hold is\n     * written beside the counter it moved.\n     *\n     * The options argument is accepted and ignored except for its `session`,\n     * which the transaction wrapper already handles: a caller that passes one\n     * is inside `withTransaction`, and this fake's rollback is a snapshot of\n     * the whole store rather than anything per-operation.\n     */\n    insertOne: (document: Document) =>\n      record(name, 'insertOne', () => {\n        assertUnique(name, document);\n        documentsOf(name).push({ ...document });\n        return { acknowledged: true, insertedId: document['id'] ?? null };\n      }),\n\n    replaceOne: (\n      query: QueryDocument,\n      replacement: Document,\n      options?: { upsert?: boolean },\n    ) =>\n      record(name, 'replaceOne', () => {\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n        if (index === -1) {\n          if (!options?.upsert) return { matchedCount: 0, upsertedCount: 0 };\n          documents.push({ ...replacement });\n          return { matchedCount: 0, upsertedCount: 1 };\n        }\n        documents[index] = { ...replacement };\n        return { matchedCount: 1, upsertedCount: 0 };\n      }),\n\n    /**\n     * Partial update. `$set`, `$addToSet`, `$inc` and `$setOnInsert` are\n     * implemented — the operators the adapters and the stock ledger use — and\n     * **anything else throws**, because a fake that silently accepted `$unset`\n     * without applying it would let a spec pass on an update that never\n     * happened.\n     *\n     * `$addToSet` is what links an identifier onto `user-identity.identifiers`\n     * without duplicating it on a repair run; supporting it here rather than\n     * ignoring it is the difference between the e2e proving the link and merely\n     * not noticing its absence.\n     *\n     * `$inc` with `upsert` is how a quantity moves. It matters that it is a\n     * real increment and not a read-modify-write even here: the whole rule it\n     * implements is that an absolute-value write loses updates, so a fake that\n     * computed the new total from a value it had already read would model the\n     * bug rather than the fix.\n     */\n    updateOne: (\n      query: QueryDocument,\n      update: {\n        $set?: Document;\n        $addToSet?: Document;\n        $inc?: Document;\n        $setOnInsert?: Document;\n      },\n      options?: { upsert?: boolean },\n    ) =>\n      record(name, 'updateOne', () => {\n        const supported = ['$set', '$addToSet', '$inc', '$setOnInsert'];\n        const unsupported = Object.keys(update).filter(\n          operator => !supported.includes(operator),\n        );\n        if (unsupported.length > 0) {\n          throw new Error(\n            `fake-mongo: updateOne does not implement ${unsupported.join(', ')}`,\n          );\n        }\n\n        // A real server rejects an update whose operators both name one field,\n        // and the message is the one this repro'd against: `$setOnInsert` that\n        // also named a field `$inc` touches. Reproducing the refusal is what\n        // keeps the fake from blessing an update Mongo would refuse.\n        const conflicting = Object.keys(update.$setOnInsert ?? {}).filter(\n          field => field in (update.$inc ?? {}) || field in (update.$set ?? {}),\n        );\n        if (conflicting.length > 0) {\n          throw new Error(\n            `fake-mongo: updateOne has conflicting paths in $setOnInsert and $inc/$set: ${conflicting.join(', ')}`,\n          );\n        }\n\n        /** `$set`, `$addToSet` and `$inc`, which apply on both branches. */\n        const applyOperators = (base: Document): Document => {\n          const updated = { ...base, ...(update.$set ?? {}) };\n          for (const [field, value] of Object.entries(update.$addToSet ?? {})) {\n            const current = updated[field];\n            const array = Array.isArray(current) ? current : [];\n            if (!array.includes(value)) {\n              updated[field] = [...array, value];\n            }\n          }\n          for (const [field, delta] of Object.entries(update.$inc ?? {})) {\n            // An absent field is created at the increment's value, which is\n            // exactly why `$setOnInsert` must not also name it.\n            const current = updated[field];\n            updated[field] =\n              (typeof current === 'number' ? current : 0) + (delta as number);\n          }\n          return updated;\n        };\n\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n\n        if (index === -1) {\n          if (options?.upsert !== true) {\n            return { matchedCount: 0, modifiedCount: 0, upsertedCount: 0 };\n          }\n          // The upserted document starts from the query's *equality* fields,\n          // the way a real server seeds one — an operator condition contributes\n          // nothing, which is why a `$expr`-guarded upsert would insert a row\n          // missing the very field it filtered on.\n          const seedFields = Object.fromEntries(\n            Object.entries(query).filter(\n              ([field, condition]) =>\n                !field.startsWith('$') && !isPlainObject(condition),\n            ),\n          );\n          const inserted = applyOperators({\n            ...seedFields,\n            ...(update.$setOnInsert ?? {}),\n          });\n          assertUnique(name, inserted);\n          documents.push(inserted);\n          return { matchedCount: 0, modifiedCount: 0, upsertedCount: 1 };\n        }\n\n        const updated = applyOperators(documents[index]);\n        assertUnique(name, updated, documents[index]);\n        documents[index] = updated;\n        return { matchedCount: 1, modifiedCount: 1, upsertedCount: 0 };\n      }),\n\n    /**\n     * `$set` across every matching document, and the count of what changed.\n     *\n     * ⚠️ **The count is what a caller branches on.** A settlement run claims its\n     * ledger lines with this and reads `modifiedCount === 0` as \"another replica\n     * took them all\" — so a fake returning a fixed `1`, or the match count\n     * rather than the modified count, would make the losing replica behave like\n     * the winning one and the conditional claim would test nothing.\n     *\n     * `$set` only. Anything else throws, for the reason `updateOne` gives:\n     * silently accepting an operator it does not apply lets a spec pass on an\n     * update that never happened.\n     */\n    updateMany: (query: QueryDocument, update: { $set?: Document }) =>\n      record(name, 'updateMany', () => {\n        const unsupported = Object.keys(update).filter(\n          operator => operator !== '$set',\n        );\n        if (unsupported.length > 0) {\n          throw new Error(\n            `fake-mongo: updateMany does not implement ${unsupported.join(', ')}`,\n          );\n        }\n\n        const documents = documentsOf(name);\n        let modifiedCount = 0;\n        documents.forEach((doc, index) => {\n          if (!matches(doc, query)) return;\n          const updated = { ...doc, ...(update.$set ?? {}) };\n          assertUnique(name, updated, doc);\n          documents[index] = updated;\n          modifiedCount += 1;\n        });\n        return { matchedCount: modifiedCount, modifiedCount };\n      }),\n\n    /**\n     * Update one document and hand back the result, upserting when asked.\n     *\n     * ⚠️ **`returnDocument: 'after'` is the only mode implemented, and the\n     * default here is `'after'` rather than the driver's `'before'`** — because\n     * the callers that need this primitive at all need the merged document. A\n     * two-message join upserts its own half and then asks \"is the pair complete\n     * now?\", which is a question only the *after* state answers. `'before'`\n     * throws rather than quietly returning the wrong half.\n     *\n     * Implemented over {@link updateOne} so the upsert seeding rule, the\n     * conflicting-path refusal and the unique-index enforcement are the same\n     * ones, rather than a second copy that could drift from them.\n     */\n    findOneAndUpdate: (\n      query: QueryDocument,\n      update: {\n        $set?: Document;\n        $addToSet?: Document;\n        $inc?: Document;\n        $setOnInsert?: Document;\n      },\n      options?: { upsert?: boolean; returnDocument?: 'before' | 'after' },\n    ) =>\n      record(name, 'findOneAndUpdate', async () => {\n        if (options?.returnDocument === 'before') {\n          throw new Error(\n            'fake-mongo: findOneAndUpdate only implements returnDocument: \"after\"',\n          );\n        }\n        // Where the document is *before* the write, because afterwards the\n        // query may no longer find it: an upsert's operator conditions need not\n        // hold of the row it just inserted — `{ folded: { $exists: false } }`\n        // matches nothing once `folded` has been set. `documentsOf` hands back\n        // the live array, which `updateOne` mutates in place or pushes onto, so\n        // the position is enough to identify it either way.\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n\n        const result = await collection(name).updateOne(query, update, {\n          upsert: options?.upsert === true,\n        });\n        if (result.matchedCount === 0 && result.upsertedCount === 0) {\n          return null;\n        }\n\n        return index === -1\n          ? documents[documents.length - 1]\n          : documents[index];\n      }),\n\n    deleteOne: (query: QueryDocument) =>\n      record(name, 'deleteOne', () => {\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n        if (index === -1) return { deletedCount: 0 };\n        documents.splice(index, 1);\n        return { deletedCount: 1 };\n      }),\n\n    /**\n     * Declares an index, and **enforces it when it is unique**.\n     *\n     * Idempotent, like the real one: a service that ensures its index per\n     * request rather than at boot — because a tenant database only appears on\n     * first write — calls this on every write.\n     */\n    createIndex: (spec: Document, options?: Document) =>\n      record(name, 'createIndex', () => {\n        if (options?.['unique'] === true) {\n          const fields = Object.keys(spec);\n          const existing = uniqueIndexes.get(name) ?? [];\n          const already = existing.some(\n            candidate =>\n              candidate.length === fields.length &&\n              candidate.every((field, at) => field === fields[at]),\n          );\n          if (!already) {\n            uniqueIndexes.set(name, [...existing, fields]);\n          }\n        }\n        return { spec, options };\n      }),\n  });\n\n  /**\n   * A session whose `withTransaction` really rolls back.\n   *\n   * ⚠️ **It is atomicity, not isolation, and the difference decides where a\n   * test may live.** The store is a single-threaded object graph, so nothing\n   * runs concurrently with the body and a \"race\" here resolves in the order it\n   * was written: a concurrency property — two writers contending for the last\n   * unit — is green under this fake no matter what the code does, and belongs\n   * in a `*.live.spec.ts` against real Mongo (ADR 0010).\n   *\n   * What it *does* model is the abort path, which is worth having: a body that\n   * throws leaves the store exactly as it found it, so a conditional write that\n   * moves a counter and then fails to write its row cannot leave the counter\n   * moved. That is a real bug shape, and one a fake without rollback would hide\n   * by committing half of it.\n   */\n  const startSession = () => {\n    let open = true;\n    return {\n      withTransaction: async (body: () => Promise<unknown>) => {\n        const snapshot = new Map(\n          [...collections].map(([name, docs]) => [\n            name,\n            docs.map(doc => ({ ...doc })),\n          ]),\n        );\n        try {\n          return await body();\n        } catch (error) {\n          collections.clear();\n          for (const [name, docs] of snapshot) collections.set(name, docs);\n          throw error;\n        }\n      },\n      endSession: () => {\n        open = false;\n        return Promise.resolve();\n      },\n      get hasEnded() {\n        return !open;\n      },\n    };\n  };\n\n  return {\n    seed: (name, documents) => {\n      collections.set(\n        name,\n        documents.map(doc => ({ ...doc })),\n      );\n    },\n    read: name => documentsOf(name).map(doc => ({ ...doc })),\n    failWith: error => {\n      failure = error;\n    },\n    failOn: (operation, error) => {\n      failuresByOperation.set(operation, error);\n    },\n    get operations() {\n      return operations;\n    },\n    startSession,\n    db: { collection },\n  };\n};\n"],"names":["isPlainObject","value","Array","isArray","compare","left","right","Date","getTime","String","localeCompare","matchesCondition","actual","condition","Object","entries","every","operator","operand","includes","undefined","RegExp","test","TypeError","evaluateExpression","doc","node","startsWith","slice","length","operands","map","child","valuesAt","field","current","segment","split","next","container","element","push","flatMap","NEGATIVE_OPERATORS","Set","isNegativeCondition","keys","some","has","matches","query","candidates","FakeDuplicateKeyError","Error","collection","key","JSON","stringify","code","name","makeFakeMongoDb","seed","collections","Map","docs","d","operations","failure","failuresByOperation","documentsOf","set","get","uniqueIndexes","uniqueIndexesOf","assertUnique","candidate","ignored","fields","clash","find","fromEntries","record","op","produce","scoped","Promise","reject","resolve","error","project","options","copy","projection","sortSpec","skipCount","limitCount","Infinity","cursor","sort","spec","skip","count","limit","toArray","matched","filter","sorted","reduceRight","items","direction","findOne","found","countDocuments","insertMany","documents","stored","document","insertedCount","insertOne","acknowledged","insertedId","replaceOne","replacement","index","findIndex","upsert","matchedCount","upsertedCount","updateOne","update","supported","unsupported","join","conflicting","$setOnInsert","$inc","$set","applyOperators","base","updated","$addToSet","array","delta","modifiedCount","seedFields","inserted","updateMany","forEach","findOneAndUpdate","returnDocument","result","deleteOne","deletedCount","splice","createIndex","existing","already","at","startSession","open","withTransaction","body","snapshot","clear","endSession","hasEnded","read","failWith","failOn","operation","db"],"mappings":"AAAA;;;;;;;;;;CAUC,GAED,+DAA+D;AAI/D,MAAMA,gBAAgB,CAACC,QACrB,OAAOA,UAAU,YAAYA,UAAU,QAAQ,CAACC,MAAMC,OAAO,CAACF;AAEhE,MAAMG,UAAU,CAACC,MAAeC;IAC9B,IAAID,QAAQ,QAAQC,SAAS,MAAM,OAAO;IAC1C,IAAID,QAAQ,MAAM,OAAO,CAAC;IAC1B,IAAIC,SAAS,MAAM,OAAO;IAC1B,IAAI,OAAOD,SAAS,YAAY,OAAOC,UAAU,UAC/C,OAAOD,OAAOC;IAChB,IAAID,gBAAgBE,QAAQD,iBAAiBC,MAAM;QACjD,OAAOF,KAAKG,OAAO,KAAKF,MAAME,OAAO;IACvC;IACA,OAAOC,OAAOJ,MAAMK,aAAa,CAACD,OAAOH;AAC3C;AAEA,uEAAuE,GACvE,MAAMK,mBAAmB,CAACC,QAAiBC;IACzC,IAAI,CAACb,cAAca,YAAY;QAC7B,OAAOD,WAAWC;IACpB;IAEA,OAAOC,OAAOC,OAAO,CAACF,WAAWG,KAAK,CAAC,CAAC,CAACC,UAAUC,QAAQ;QACzD,OAAQD;YACN,KAAK;gBACH,OAAOL,WAAWM;YACpB,KAAK;gBACH,OAAON,WAAWM;YACpB,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,WAAW;YACpC,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,YAAY;YACrC,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,WAAW;YACpC,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,YAAY;YACrC,KAAK;gBACH,OAAO,AAACA,QAAsBC,QAAQ,CAACP;YACzC,yEAAyE;YACzE,uEAAuE;YACvE,wEAAwE;YACxE,uEAAuE;YACvE,KAAK;gBACH,OAAO,AAACA,WAAWQ,cAAgBF;YACrC,KAAK;gBACH,OAAO,CAAC,AAACA,QAAsBC,QAAQ,CAACP;YAC1C,KAAK;gBACH,OAAO,CAACD,iBAAiBC,QAAQM;YACnC,KAAK;oBAGAL;gBAFH,OAAO,IAAIQ,OACTH,UACCL,sBAAAA,SAAS,CAAC,WAAW,YAArBA,sBAAoC,IACrCS,IAAI,CAACb,OAAOG;YAChB,KAAK;gBACH,kCAAkC;gBAClC,OAAO;YACT;gBACE,MAAM,IAAIW,UAAU,CAAC,kCAAkC,EAAEN,SAAS,CAAC,CAAC;QACxE;IACF;AACF;AAEA;;;;;;;;;;;CAWC,GACD,MAAMO,qBAAqB,CAACC,KAAeC;IACzC,IAAI,OAAOA,SAAS,YAAYA,KAAKC,UAAU,CAAC,MAAM;QACpD,OAAOF,GAAG,CAACC,KAAKE,KAAK,CAAC,GAAG;IAC3B;IACA,IAAI,CAAC5B,cAAc0B,OAAO;QACxB,OAAOA;IACT;IAEA,MAAMX,UAAUD,OAAOC,OAAO,CAACW;IAC/B,IAAIX,QAAQc,MAAM,KAAK,GAAG;QACxB,MAAM,IAAIN,UACR,CAAC,2DAA2D,EAAER,QAAQc,MAAM,EAAE;IAElF;IACA,MAAM,CAACZ,UAAUC,QAAQ,GAAGH,OAAO,CAAC,EAAE;IACtC,MAAMe,WAAW,AAACZ,QAAsBa,GAAG,CAACC,CAAAA,QAC1CR,mBAAmBC,KAAKO;IAG1B,OAAQf;QACN,KAAK;YACH,OAAO,AAACa,QAAQ,CAAC,EAAE,GAAeA,QAAQ,CAAC,EAAE;QAC/C,KAAK;YACH,OAAO,AAACA,QAAQ,CAAC,EAAE,GAAeA,QAAQ,CAAC,EAAE;QAC/C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,KAAK;QAC9C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,IAAI;QAC7C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,KAAK;QAC9C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,IAAI;QAC7C,KAAK;YACH,OAAOA,QAAQ,CAAC,EAAE,KAAKA,QAAQ,CAAC,EAAE;QACpC;YACE,MAAM,IAAIP,UACR,CAAC,wCAAwC,EAAEN,SAAS,CAAC,CAAC;IAE5D;AACF;AAEA;;;;;;;;;;;;;CAaC,GACD,MAAMgB,WAAW,CAACR,KAAeS;IAC/B,IAAIC,UAAqB;QAACV;KAAI;IAC9B,KAAK,MAAMW,WAAWF,MAAMG,KAAK,CAAC,KAAM;QACtC,MAAMC,OAAkB,EAAE;QAC1B,KAAK,MAAMrC,SAASkC,QAAS;YAC3B,MAAMI,YAAYrC,MAAMC,OAAO,CAACF,SAASA,QAAQ;gBAACA;aAAM;YACxD,KAAK,MAAMuC,WAAWD,UAAW;gBAC/B,IAAIvC,cAAcwC,UAAU;oBAC1BF,KAAKG,IAAI,CAACD,OAAO,CAACJ,QAAQ;gBAC5B;YACF;QACF;QACAD,UAAUG;IACZ;IACA,OAAOH,QAAQO,OAAO,CAACzC,CAAAA,QACrBC,MAAMC,OAAO,CAACF,SAAS;YAACA;eAAUA;SAAM,GAAG;YAACA;SAAM;AAEtD;AAEA,wEAAwE,GACxE,MAAM0C,qBAAqB,IAAIC,IAAI;IAAC;IAAO;IAAQ;CAAO;AAE1D,MAAMC,sBAAsB,CAAChC,YAC3Bb,cAAca,cACdC,OAAOgC,IAAI,CAACjC,WAAWkC,IAAI,CAAC9B,CAAAA,WAAY0B,mBAAmBK,GAAG,CAAC/B;AAEjE,MAAMgC,UAAU,CAACxB,KAAeyB,QAC9BpC,OAAOC,OAAO,CAACmC,OAAOlC,KAAK,CAAC,CAAC,CAACkB,OAAOrB,UAAU;QAC7C,IAAIqB,UAAU,QAAQ;YACpB,OAAO,AAACrB,UAA8BG,KAAK,CAACgB,CAAAA,QAASiB,QAAQxB,KAAKO;QACpE;QACA,IAAIE,UAAU,OAAO;YACnB,OAAO,AAACrB,UAA8BkC,IAAI,CAACf,CAAAA,QAASiB,QAAQxB,KAAKO;QACnE;QACA,IAAIE,UAAU,SAAS;YACrB,OAAOV,mBAAmBC,KAAKZ,eAAe;QAChD;QACA,MAAMsC,aAAalB,SAASR,KAAKS;QACjC,IAAIiB,WAAWtB,MAAM,KAAK,GAAG;YAC3B,OAAOlB,iBAAiBS,WAAWP;QACrC;QACA,4EAA4E;QAC5E,uEAAuE;QACvE,4EAA4E;QAC5E,sEAAsE;QACtE,OAAOgC,oBAAoBhC,aACvBsC,WAAWnC,KAAK,CAACf,CAAAA,QAASU,iBAAiBV,OAAOY,cAClDsC,WAAWJ,IAAI,CAAC9C,CAAAA,QAASU,iBAAiBV,OAAOY;IACvD;AAEF;;;;;;;CAOC,GACD,IAAA,AAAMuC,wBAAN,MAAMA,8BAA8BC;IAGlC,YAAYC,UAAkB,EAAEC,GAAa,CAAE;QAC7C,KAAK,CACH,CAAC,mDAAmD,EAAED,WAAW,UAAU,EAAEE,KAAKC,SAAS,CAACF,MAAM,QAJ7FG,OAAO;QAMd,IAAI,CAACC,IAAI,GAAG;IACd;AACF;AAsCA;;;;;;CAMC,GACD,OAAO,MAAMC,kBAAkB,CAC7BC,OAAmC,CAAC,CAAC;IAErC,MAAMC,cAAc,IAAIC,IACtBjD,OAAOC,OAAO,CAAC8C,MAAM9B,GAAG,CAAC,CAAC,CAAC4B,MAAMK,KAAK,GAAK;YACzCL;YACAK,KAAKjC,GAAG,CAACkC,CAAAA,IAAM,aAAKA;SACrB;IAEH,MAAMC,aAAwD,EAAE;IAChE,IAAIC;IACJ,MAAMC,sBAAsB,IAAIL;IAEhC,MAAMM,cAAc,CAACV;QACnB,IAAI,CAACG,YAAYd,GAAG,CAACW,OAAOG,YAAYQ,GAAG,CAACX,MAAM,EAAE;QACpD,OAAOG,YAAYS,GAAG,CAACZ;IACzB;IAEA;;;;;;;;;;GAUC,GACD,MAAMa,gBAAgB,IAAIT;IAE1B,MAAMU,kBAAkB,CAACd;YACvBa;gBAAAA,qBAAAA,cAAcD,GAAG,CAACZ,iBAAlBa,qBAA2B,EAAE;;IAE/B;;;;;;;;;GASC,GACD,MAAME,eAAe,CACnBf,MACAgB,WACAC;QAEA,KAAK,MAAMC,UAAUJ,gBAAgBd,MAAO;YAC1C,IAAIkB,OAAO9B,IAAI,CAACb,CAAAA,QAASyC,SAAS,CAACzC,MAAM,KAAKd,YAAY;YAC1D,MAAM0D,QAAQT,YAAYV,MAAMoB,IAAI,CAClCtD,CAAAA,MACEA,QAAQmD,WACRC,OAAO7D,KAAK,CAACkB,CAAAA,QAAST,GAAG,CAACS,MAAM,KAAKyC,SAAS,CAACzC,MAAM;YAEzD,IAAI4C,UAAU1D,WAAW;gBACvB,MAAM,IAAIgC,sBACRO,MACA7C,OAAOkE,WAAW,CAACH,OAAO9C,GAAG,CAACG,CAAAA,QAAS;wBAACA;wBAAOyC,SAAS,CAACzC,MAAM;qBAAC;YAEpE;QACF;IACF;IAEA,MAAM+C,SAAS,CAAStB,MAAcuB,IAAYC;QAChDjB,WAAWzB,IAAI,CAAC;YAAEa,YAAYK;YAAMuB;QAAG;QACvC,MAAME,SAAShB,oBAAoBG,GAAG,CAACW;QACvC,IAAIE,WAAWhE,WAAW,OAAOiE,QAAQC,MAAM,CAACF;QAChD,IAAIjB,YAAY/C,WAAW,OAAOiE,QAAQC,MAAM,CAACnB;QACjD,wEAAwE;QACxE,4EAA4E;QAC5E,8EAA8E;QAC9E,IAAI;YACF,OAAOkB,QAAQE,OAAO,CAACJ;QACzB,EAAE,OAAOK,OAAO;YACd,OAAOH,QAAQC,MAAM,CAACE;QACxB;IACF;IAEA,gFAAgF,GAChF,MAAMC,UAAU,CAAChE,KAAeiE;QAC9B,MAAMC,OAAO,aAAKlE;QAClB,IAAIiE,CAAAA,2BAAAA,QAASE,UAAU,KAAIF,QAAQE,UAAU,CAAC,MAAM,KAAK,GAAG;YAC1D,OAAOD,IAAI,CAAC,MAAM;QACpB;QACA,OAAOA;IACT;IAEA,MAAMrC,aAAa,CAACK,OAAkB,CAAA;YACpCoB,MAAM,CAAC7B,QAAuB,CAAC,CAAC,EAAEwC;gBAChC,IAAIG,WAAmC,CAAC;gBACxC,IAAIC,YAAY;gBAChB,IAAIC,aAAaC;gBAEjB,MAAMC,SAAS;oBACbC,MAAKC,IAA4B;wBAC/BN,WAAWM;wBACX,OAAOF;oBACT;oBACAG,MAAKC,KAAa;wBAChBP,YAAYO;wBACZ,OAAOJ;oBACT;oBACAK,OAAMD,KAAa;wBACjBN,aAAaM;wBACb,OAAOJ;oBACT;oBACAM,SAAS,IACPtB,OAAOtB,MAAM,QAAQ;4BACnB,MAAM6C,UAAUnC,YAAYV,MAAM8C,MAAM,CAAChF,CAAAA,MACvCwB,QAAQxB,KAAKyB;4BAEf,MAAMwD,SAAS5F,OAAOC,OAAO,CAAC8E,UAAUc,WAAW,CACjD,CAACC,OAAO,CAAC1E,OAAO2E,UAAU,GACxB;uCAAID;iCAAM,CAACV,IAAI,CACb,CAAC7F,MAAMC,QACLF,QAAQC,IAAI,CAAC6B,MAAM,EAAE5B,KAAK,CAAC4B,MAAM,IAAI2E,YAE3CL;4BAEF,OAAOE,OACJ9E,KAAK,CAACkE,WAAWA,YAAYC,YAC7BhE,GAAG,CAACN,CAAAA,MAAOgE,QAAQhE,KAAKiE;wBAC7B;gBACJ;gBACA,OAAOO;YACT;YAEAa,SAAS,CAAC5D,OAAsBwC,UAC9BT,OAAOtB,MAAM,WAAW;oBACtB,MAAMoD,QAAQ1C,YAAYV,MAAMoB,IAAI,CAACtD,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBACzD,OAAO6D,UAAU3F,YAAY,OAAOqE,QAAQsB,OAAOrB;gBACrD;YAEFsB,gBAAgB,CAAC9D,QAAuB,CAAC,CAAC,GACxC+B,OACEtB,MACA,kBACA,IAAMU,YAAYV,MAAM8C,MAAM,CAAChF,CAAAA,MAAOwB,QAAQxB,KAAKyB,QAAQrB,MAAM;YAGrE,2EAA2E;YAC3E,gDAAgD;YAChDoF,YAAY,CAACC,YACXjC,OAAOtB,MAAM,cAAc;oBACzB,MAAMwD,SAAS9C,YAAYV;oBAC3B,KAAK,MAAMyD,YAAYF,UAAW;wBAChCxC,aAAaf,MAAMyD;wBACnBD,OAAO1E,IAAI,CAAC,aAAK2E;oBACnB;oBACA,OAAO;wBAAEC,eAAeH,UAAUrF,MAAM;oBAAC;gBAC3C;YAEF;;;;;;;;KAQC,GACDyF,WAAW,CAACF,WACVnC,OAAOtB,MAAM,aAAa;wBAGiByD;oBAFzC1C,aAAaf,MAAMyD;oBACnB/C,YAAYV,MAAMlB,IAAI,CAAC,aAAK2E;oBAC5B,OAAO;wBAAEG,cAAc;wBAAMC,UAAU,GAAEJ,eAAAA,QAAQ,CAAC,KAAK,YAAdA,eAAkB;oBAAK;gBAClE;YAEFK,YAAY,CACVvE,OACAwE,aACAhC,UAEAT,OAAOtB,MAAM,cAAc;oBACzB,MAAMuD,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBACtD,IAAIyE,UAAU,CAAC,GAAG;wBAChB,IAAI,EAACjC,2BAAAA,QAASmC,MAAM,GAAE,OAAO;4BAAEC,cAAc;4BAAGC,eAAe;wBAAE;wBACjEb,UAAUzE,IAAI,CAAC,aAAKiF;wBACpB,OAAO;4BAAEI,cAAc;4BAAGC,eAAe;wBAAE;oBAC7C;oBACAb,SAAS,CAACS,MAAM,GAAG,aAAKD;oBACxB,OAAO;wBAAEI,cAAc;wBAAGC,eAAe;oBAAE;gBAC7C;YAEF;;;;;;;;;;;;;;;;;KAiBC,GACDC,WAAW,CACT9E,OACA+E,QAMAvC,UAEAT,OAAOtB,MAAM,aAAa;wBAeQsE;oBAdhC,MAAMC,YAAY;wBAAC;wBAAQ;wBAAa;wBAAQ;qBAAe;oBAC/D,MAAMC,cAAcrH,OAAOgC,IAAI,CAACmF,QAAQxB,MAAM,CAC5CxF,CAAAA,WAAY,CAACiH,UAAU/G,QAAQ,CAACF;oBAElC,IAAIkH,YAAYtG,MAAM,GAAG,GAAG;wBAC1B,MAAM,IAAIwB,MACR,CAAC,yCAAyC,EAAE8E,YAAYC,IAAI,CAAC,OAAO;oBAExE;oBAEA,uEAAuE;oBACvE,uEAAuE;oBACvE,qEAAqE;oBACrE,6DAA6D;oBAC7D,MAAMC,cAAcvH,OAAOgC,IAAI,EAACmF,uBAAAA,OAAOK,YAAY,YAAnBL,uBAAuB,CAAC,GAAGxB,MAAM,CAC/DvE,CAAAA;4BAAmB+F,cAAgCA;+BAA1C/F,WAAU+F,eAAAA,OAAOM,IAAI,YAAXN,eAAe,CAAC,MAAM/F,WAAU+F,eAAAA,OAAOO,IAAI,YAAXP,eAAe,CAAC;;oBAErE,IAAII,YAAYxG,MAAM,GAAG,GAAG;wBAC1B,MAAM,IAAIwB,MACR,CAAC,2EAA2E,EAAEgF,YAAYD,IAAI,CAAC,OAAO;oBAE1G;oBAEA,kEAAkE,GAClE,MAAMK,iBAAiB,CAACC;4BACST,cACaA,mBAOAA;wBAR5C,MAAMU,UAAU,aAAKD,OAAUT,eAAAA,OAAOO,IAAI,YAAXP,eAAe,CAAC;wBAC/C,KAAK,MAAM,CAAC/F,OAAOjC,MAAM,IAAIa,OAAOC,OAAO,EAACkH,oBAAAA,OAAOW,SAAS,YAAhBX,oBAAoB,CAAC,GAAI;4BACnE,MAAM9F,UAAUwG,OAAO,CAACzG,MAAM;4BAC9B,MAAM2G,QAAQ3I,MAAMC,OAAO,CAACgC,WAAWA,UAAU,EAAE;4BACnD,IAAI,CAAC0G,MAAM1H,QAAQ,CAAClB,QAAQ;gCAC1B0I,OAAO,CAACzG,MAAM,GAAG;uCAAI2G;oCAAO5I;iCAAM;4BACpC;wBACF;wBACA,KAAK,MAAM,CAACiC,OAAO4G,MAAM,IAAIhI,OAAOC,OAAO,EAACkH,eAAAA,OAAOM,IAAI,YAAXN,eAAe,CAAC,GAAI;4BAC9D,gEAAgE;4BAChE,oDAAoD;4BACpD,MAAM9F,UAAUwG,OAAO,CAACzG,MAAM;4BAC9ByG,OAAO,CAACzG,MAAM,GACZ,AAAC,CAAA,OAAOC,YAAY,WAAWA,UAAU,CAAA,IAAM2G;wBACnD;wBACA,OAAOH;oBACT;oBAEA,MAAMzB,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBAEtD,IAAIyE,UAAU,CAAC,GAAG;4BAgBVM;wBAfN,IAAIvC,CAAAA,2BAAAA,QAASmC,MAAM,MAAK,MAAM;4BAC5B,OAAO;gCAAEC,cAAc;gCAAGiB,eAAe;gCAAGhB,eAAe;4BAAE;wBAC/D;wBACA,mEAAmE;wBACnE,sEAAsE;wBACtE,oEAAoE;wBACpE,yCAAyC;wBACzC,MAAMiB,aAAalI,OAAOkE,WAAW,CACnClE,OAAOC,OAAO,CAACmC,OAAOuD,MAAM,CAC1B,CAAC,CAACvE,OAAOrB,UAAU,GACjB,CAACqB,MAAMP,UAAU,CAAC,QAAQ,CAAC3B,cAAca;wBAG/C,MAAMoI,WAAWR,eAAe,aAC3BO,aACCf,wBAAAA,OAAOK,YAAY,YAAnBL,wBAAuB,CAAC;wBAE9BvD,aAAaf,MAAMsF;wBACnB/B,UAAUzE,IAAI,CAACwG;wBACf,OAAO;4BAAEnB,cAAc;4BAAGiB,eAAe;4BAAGhB,eAAe;wBAAE;oBAC/D;oBAEA,MAAMY,UAAUF,eAAevB,SAAS,CAACS,MAAM;oBAC/CjD,aAAaf,MAAMgF,SAASzB,SAAS,CAACS,MAAM;oBAC5CT,SAAS,CAACS,MAAM,GAAGgB;oBACnB,OAAO;wBAAEb,cAAc;wBAAGiB,eAAe;wBAAGhB,eAAe;oBAAE;gBAC/D;YAEF;;;;;;;;;;;;KAYC,GACDmB,YAAY,CAAChG,OAAsB+E,SACjChD,OAAOtB,MAAM,cAAc;oBACzB,MAAMwE,cAAcrH,OAAOgC,IAAI,CAACmF,QAAQxB,MAAM,CAC5CxF,CAAAA,WAAYA,aAAa;oBAE3B,IAAIkH,YAAYtG,MAAM,GAAG,GAAG;wBAC1B,MAAM,IAAIwB,MACR,CAAC,0CAA0C,EAAE8E,YAAYC,IAAI,CAAC,OAAO;oBAEzE;oBAEA,MAAMlB,YAAY7C,YAAYV;oBAC9B,IAAIoF,gBAAgB;oBACpB7B,UAAUiC,OAAO,CAAC,CAAC1H,KAAKkG;4BAEQM;wBAD9B,IAAI,CAAChF,QAAQxB,KAAKyB,QAAQ;wBAC1B,MAAMyF,UAAU,aAAKlH,MAASwG,eAAAA,OAAOO,IAAI,YAAXP,eAAe,CAAC;wBAC9CvD,aAAaf,MAAMgF,SAASlH;wBAC5ByF,SAAS,CAACS,MAAM,GAAGgB;wBACnBI,iBAAiB;oBACnB;oBACA,OAAO;wBAAEjB,cAAciB;wBAAeA;oBAAc;gBACtD;YAEF;;;;;;;;;;;;;KAaC,GACDK,kBAAkB,CAChBlG,OACA+E,QAMAvC,UAEAT,OAAOtB,MAAM,oBAAoB;oBAC/B,IAAI+B,CAAAA,2BAAAA,QAAS2D,cAAc,MAAK,UAAU;wBACxC,MAAM,IAAIhG,MACR;oBAEJ;oBACA,mEAAmE;oBACnE,wEAAwE;oBACxE,sEAAsE;oBACtE,uEAAuE;oBACvE,wEAAwE;oBACxE,oDAAoD;oBACpD,MAAM6D,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBAEtD,MAAMoG,SAAS,MAAMhG,WAAWK,MAAMqE,SAAS,CAAC9E,OAAO+E,QAAQ;wBAC7DJ,QAAQnC,CAAAA,2BAAAA,QAASmC,MAAM,MAAK;oBAC9B;oBACA,IAAIyB,OAAOxB,YAAY,KAAK,KAAKwB,OAAOvB,aAAa,KAAK,GAAG;wBAC3D,OAAO;oBACT;oBAEA,OAAOJ,UAAU,CAAC,IACdT,SAAS,CAACA,UAAUrF,MAAM,GAAG,EAAE,GAC/BqF,SAAS,CAACS,MAAM;gBACtB;YAEF4B,WAAW,CAACrG,QACV+B,OAAOtB,MAAM,aAAa;oBACxB,MAAMuD,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBACtD,IAAIyE,UAAU,CAAC,GAAG,OAAO;wBAAE6B,cAAc;oBAAE;oBAC3CtC,UAAUuC,MAAM,CAAC9B,OAAO;oBACxB,OAAO;wBAAE6B,cAAc;oBAAE;gBAC3B;YAEF;;;;;;KAMC,GACDE,aAAa,CAACvD,MAAgBT,UAC5BT,OAAOtB,MAAM,eAAe;oBAC1B,IAAI+B,CAAAA,2BAAAA,OAAS,CAAC,SAAS,MAAK,MAAM;4BAEflB;wBADjB,MAAMK,SAAS/D,OAAOgC,IAAI,CAACqD;wBAC3B,MAAMwD,YAAWnF,qBAAAA,cAAcD,GAAG,CAACZ,iBAAlBa,qBAA2B,EAAE;wBAC9C,MAAMoF,UAAUD,SAAS5G,IAAI,CAC3B4B,CAAAA,YACEA,UAAU9C,MAAM,KAAKgD,OAAOhD,MAAM,IAClC8C,UAAU3D,KAAK,CAAC,CAACkB,OAAO2H,KAAO3H,UAAU2C,MAAM,CAACgF,GAAG;wBAEvD,IAAI,CAACD,SAAS;4BACZpF,cAAcF,GAAG,CAACX,MAAM;mCAAIgG;gCAAU9E;6BAAO;wBAC/C;oBACF;oBACA,OAAO;wBAAEsB;wBAAMT;oBAAQ;gBACzB;QACJ,CAAA;IAEA;;;;;;;;;;;;;;;GAeC,GACD,MAAMoE,eAAe;QACnB,IAAIC,OAAO;QACX,OAAO;YACLC,iBAAiB,OAAOC;gBACtB,MAAMC,WAAW,IAAInG,IACnB;uBAAID;iBAAY,CAAC/B,GAAG,CAAC,CAAC,CAAC4B,MAAMK,KAAK,GAAK;wBACrCL;wBACAK,KAAKjC,GAAG,CAACN,CAAAA,MAAQ,aAAKA;qBACvB;gBAEH,IAAI;oBACF,OAAO,MAAMwI;gBACf,EAAE,OAAOzE,OAAO;oBACd1B,YAAYqG,KAAK;oBACjB,KAAK,MAAM,CAACxG,MAAMK,KAAK,IAAIkG,SAAUpG,YAAYQ,GAAG,CAACX,MAAMK;oBAC3D,MAAMwB;gBACR;YACF;YACA4E,YAAY;gBACVL,OAAO;gBACP,OAAO1E,QAAQE,OAAO;YACxB;YACA,IAAI8E,YAAW;gBACb,OAAO,CAACN;YACV;QACF;IACF;IAEA,OAAO;QACLlG,MAAM,CAACF,MAAMuD;YACXpD,YAAYQ,GAAG,CACbX,MACAuD,UAAUnF,GAAG,CAACN,CAAAA,MAAQ,aAAKA;QAE/B;QACA6I,MAAM3G,CAAAA,OAAQU,YAAYV,MAAM5B,GAAG,CAACN,CAAAA,MAAQ,aAAKA;QACjD8I,UAAU/E,CAAAA;YACRrB,UAAUqB;QACZ;QACAgF,QAAQ,CAACC,WAAWjF;YAClBpB,oBAAoBE,GAAG,CAACmG,WAAWjF;QACrC;QACA,IAAItB,cAAa;YACf,OAAOA;QACT;QACA4F;QACAY,IAAI;YAAEpH;QAAW;IACnB;AACF,EAAE"}
+{"version":3,"sources":["../../src/drivers/fake-mongo.ts"],"sourcesContent":["/**\n * A fake of the mongodb driver, not of the repository port.\n *\n * It sits one level *below* `makeMongoRepository`, so the adapter's own code —\n * the filter translation, the projection, the upsert rule, the error mapping —\n * actually runs and is measured by coverage. A fake at the port level would\n * skip all of it.\n *\n * Only the surface the adapter uses is implemented; anything else is a\n * deliberate `TypeError` rather than a silent no-op.\n */\n\n/** The subset of a Mongo query document the adapter produces. */\ntype QueryDocument = Record<string, unknown>;\ntype Document = Record<string, unknown>;\n\nconst isPlainObject = (value: unknown): value is Document =>\n  typeof value === 'object' && value !== null && !Array.isArray(value);\n\nconst compare = (left: unknown, right: unknown): number => {\n  if (left == null && right == null) return 0;\n  if (left == null) return -1;\n  if (right == null) return 1;\n  if (typeof left === 'number' && typeof right === 'number')\n    return left - right;\n  if (left instanceof Date && right instanceof Date) {\n    return left.getTime() - right.getTime();\n  }\n  return String(left).localeCompare(String(right));\n};\n\n/** Evaluates one `{ $op: value }` condition against a document field. */\nconst matchesCondition = (actual: unknown, condition: unknown): boolean => {\n  if (!isPlainObject(condition)) {\n    return actual === condition;\n  }\n\n  return Object.entries(condition).every(([operator, operand]) => {\n    switch (operator) {\n      case '$eq':\n        return actual === operand;\n      case '$ne':\n        return actual !== operand;\n      case '$gt':\n        return compare(actual, operand) > 0;\n      case '$gte':\n        return compare(actual, operand) >= 0;\n      case '$lt':\n        return compare(actual, operand) < 0;\n      case '$lte':\n        return compare(actual, operand) <= 0;\n      case '$in':\n        return (operand as unknown[]).includes(actual);\n      // Absence, not falsiness. A settlement ledger keys \"unpaid\" on a `runId`\n      // that is not there at all, and `undefined` is what a document without\n      // the field reads as — so `{ $exists: false }` must be a different test\n      // from `{ $eq: undefined }` would be if the serializer ever wrote one.\n      case '$exists':\n        return (actual !== undefined) === (operand as boolean);\n      case '$nin':\n        return !(operand as unknown[]).includes(actual);\n      case '$not':\n        return !matchesCondition(actual, operand);\n      case '$regex':\n        return new RegExp(\n          operand as string,\n          (condition['$options'] as string) ?? '',\n        ).test(String(actual));\n      case '$options':\n        // Handled together with `$regex`.\n        return true;\n      default:\n        throw new TypeError(`fake mongo: unsupported operator \"${operator}\"`);\n    }\n  });\n};\n\n/**\n * Evaluates one node of an aggregation expression — the `$expr` half of a\n * query, which is a different language from the operators above: it compares\n * two *fields of the same document* rather than a field against a constant.\n *\n * Only the shape a conditional stock write sends is implemented — a\n * `$subtract` of two field paths compared with `$gte` — and anything else is a\n * `TypeError`. That is the same rule the rest of this file follows: a fake that\n * quietly evaluated an expression it does not understand would answer `true`\n * for a document the real server would have refused, which turns an\n * oversell-prevention test into a test that asserts nothing.\n */\nconst evaluateExpression = (doc: Document, node: unknown): unknown => {\n  if (typeof node === 'string' && node.startsWith('$')) {\n    return doc[node.slice(1)];\n  }\n  if (!isPlainObject(node)) {\n    return node;\n  }\n\n  const entries = Object.entries(node);\n  if (entries.length !== 1) {\n    throw new TypeError(\n      `fake mongo: $expr node must have exactly one operator, got ${entries.length}`,\n    );\n  }\n  const [operator, operand] = entries[0];\n  const operands = (operand as unknown[]).map(child =>\n    evaluateExpression(doc, child),\n  );\n\n  switch (operator) {\n    case '$subtract':\n      return (operands[0] as number) - (operands[1] as number);\n    case '$add':\n      return (operands[0] as number) + (operands[1] as number);\n    case '$gte':\n      return compare(operands[0], operands[1]) >= 0;\n    case '$gt':\n      return compare(operands[0], operands[1]) > 0;\n    case '$lte':\n      return compare(operands[0], operands[1]) <= 0;\n    case '$lt':\n      return compare(operands[0], operands[1]) < 0;\n    case '$eq':\n      return operands[0] === operands[1];\n    default:\n      throw new TypeError(\n        `fake mongo: unsupported $expr operator \"${operator}\"`,\n      );\n  }\n};\n\n/**\n * Every value a field path names, the way the server reads one.\n *\n * A dotted path descends, and **an array on the way down is walked\n * element-wise** — which is what makes `{'items.vendorId': x}` match an order\n * with a line for that vendor rather than nothing at all. Without it a query\n * into an embedded collection silently answers empty here while working against\n * a real server, which is worse than an unsupported-operator throw: the spec\n * passes and asserts the opposite of what it claims.\n *\n * The array itself is kept as a candidate beside its elements, because the\n * server matches both — `{ tags: 'a' }` matches `{ tags: ['a'] }` and\n * `{ tags: 'a' }` alike.\n */\nconst valuesAt = (doc: Document, field: string): unknown[] => {\n  let current: unknown[] = [doc];\n  for (const segment of field.split('.')) {\n    const next: unknown[] = [];\n    for (const value of current) {\n      const container = Array.isArray(value) ? value : [value];\n      for (const element of container) {\n        if (isPlainObject(element)) {\n          next.push(element[segment]);\n        }\n      }\n    }\n    current = next;\n  }\n  return current.flatMap(value =>\n    Array.isArray(value) ? [value, ...value] : [value],\n  );\n};\n\n/** Operators that exclude a document when a single value matches them. */\nconst NEGATIVE_OPERATORS = new Set(['$ne', '$nin', '$not']);\n\nconst isNegativeCondition = (condition: unknown): boolean =>\n  isPlainObject(condition) &&\n  Object.keys(condition).some(operator => NEGATIVE_OPERATORS.has(operator));\n\nconst matches = (doc: Document, query: QueryDocument): boolean =>\n  Object.entries(query).every(([field, condition]) => {\n    if (field === '$and') {\n      return (condition as QueryDocument[]).every(child => matches(doc, child));\n    }\n    if (field === '$or') {\n      return (condition as QueryDocument[]).some(child => matches(doc, child));\n    }\n    if (field === '$expr') {\n      return evaluateExpression(doc, condition) === true;\n    }\n    const candidates = valuesAt(doc, field);\n    if (candidates.length === 0) {\n      return matchesCondition(undefined, condition);\n    }\n    // A positive condition matches when **any** value at the path satisfies it;\n    // a negative one only when **every** value does. That asymmetry is the\n    // server's: `{ 'items.vendorId': { $ne: 'a' } }` must exclude an order that\n    // has a line for `a`, not include it because some other line differs.\n    return isNegativeCondition(condition)\n      ? candidates.every(value => matchesCondition(value, condition))\n      : candidates.some(value => matchesCondition(value, condition));\n  });\n\n/**\n * The error a real server raises when a write violates a unique index.\n *\n * The `code` matters and the message does not: callers recognise a duplicate\n * key by `error.code === 11000` (or the same code inside `writeErrors`), and a\n * fake that threw a plain `Error` would send a retry path that exists precisely\n * for this case down the \"unexpected failure\" branch instead.\n */\nclass FakeDuplicateKeyError extends Error {\n  readonly code = 11000;\n\n  constructor(collection: string, key: Document) {\n    super(\n      `fake mongo: E11000 duplicate key error collection: ${collection} dup key: ${JSON.stringify(key)}`,\n    );\n    this.name = 'MongoServerError';\n  }\n}\n\nexport interface FakeMongoCollection {\n  /** The documents currently stored, as the driver would return them. */\n  readonly documents: Document[];\n}\n\nexport interface FakeMongoDb {\n  /** Replaces a collection's contents. */\n  seed(collection: string, documents: Document[]): void;\n  /** Reads a collection's current contents. */\n  read(collection: string): Document[];\n  /**\n   * Makes every subsequent driver call reject with `error`, so the adapter's\n   * `EntifixConnError` mapping is reachable. Pass `undefined` to restore.\n   */\n  failWith(error: unknown): void;\n  /**\n   * Makes only `operation` reject, leaving the rest working — the way a read\n   * that succeeds and a count that then fails reaches a distinct error branch.\n   */\n  failOn(operation: string, error: unknown): void;\n  /** Every operation performed, for assertions about what the adapter did. */\n  readonly operations: ReadonlyArray<{ collection: string; op: string }>;\n  /**\n   * Opens a session whose `withTransaction` rolls the whole store back when its\n   * body throws. What a service hands to `client.startSession()`; see the\n   * implementation for why it is atomicity and not isolation.\n   */\n  startSession(): {\n    withTransaction(body: () => Promise<unknown>): Promise<unknown>;\n    endSession(): Promise<void>;\n    readonly hasEnded: boolean;\n  };\n  /** The object to hand to `makeMongoRepository` in place of a real `Db`. */\n  readonly db: unknown;\n}\n\n/**\n * Builds an in-memory stand-in for a mongodb `Db`.\n *\n * `db` is typed `unknown` on purpose: casting it at the call site keeps this\n * package free of a hard dependency on the `mongodb` types while remaining\n * honest that it is not a real driver.\n */\nexport const makeFakeMongoDb = (\n  seed: Record<string, Document[]> = {},\n): FakeMongoDb => {\n  const collections = new Map<string, Document[]>(\n    Object.entries(seed).map(([name, docs]) => [\n      name,\n      docs.map(d => ({ ...d })),\n    ]),\n  );\n  const operations: Array<{ collection: string; op: string }> = [];\n  let failure: unknown;\n  const failuresByOperation = new Map<string, unknown>();\n\n  const documentsOf = (name: string): Document[] => {\n    if (!collections.has(name)) collections.set(name, []);\n    return collections.get(name) as Document[];\n  };\n\n  /**\n   * The unique indexes `createIndex` has been asked for, per collection, as the\n   * field lists they key on.\n   *\n   * Recording them is not bookkeeping: `updateOne` with `upsert` is atomic per\n   * *document*, so two concurrent upserts for the same key each fail to see the\n   * other's uncommitted insert and each create a row. The index is what makes\n   * the fold singular, and a fake that accepted `createIndex` as a no-op would\n   * report a service as covered while the property the index exists for went\n   * untested (ADR 0010).\n   */\n  const uniqueIndexes = new Map<string, string[][]>();\n\n  const uniqueIndexesOf = (name: string): string[][] =>\n    uniqueIndexes.get(name) ?? [];\n\n  /**\n   * Refuses `candidate` if it would duplicate an existing document under one of\n   * the collection's unique indexes.\n   *\n   * `ignored` is the document being replaced by an update, which must not count\n   * as its own duplicate. A key whose value is `undefined` on the candidate is\n   * skipped: a real index treats a missing field as `null` and would collide,\n   * but nothing in this repo indexes an optional member, and guessing wrong\n   * here would fail writes the server accepts.\n   */\n  const assertUnique = (\n    name: string,\n    candidate: Document,\n    ignored?: Document,\n  ): void => {\n    for (const fields of uniqueIndexesOf(name)) {\n      if (fields.some(field => candidate[field] === undefined)) continue;\n      const clash = documentsOf(name).find(\n        doc =>\n          doc !== ignored &&\n          fields.every(field => doc[field] === candidate[field]),\n      );\n      if (clash !== undefined) {\n        throw new FakeDuplicateKeyError(\n          name,\n          Object.fromEntries(fields.map(field => [field, candidate[field]])),\n        );\n      }\n    }\n  };\n\n  const record = <TValue>(name: string, op: string, produce: () => TValue) => {\n    operations.push({ collection: name, op });\n    const scoped = failuresByOperation.get(op);\n    if (scoped !== undefined) return Promise.reject(scoped);\n    if (failure !== undefined) return Promise.reject(failure);\n    // `try`/`catch` rather than `Promise.resolve(produce())`: a real driver\n    // returns a promise and *rejects*, so a fake that threw synchronously would\n    // need different handling at every call site than the thing it stands in for.\n    try {\n      return Promise.resolve(produce());\n    } catch (error) {\n      return Promise.reject(error);\n    }\n  };\n\n  /** Applies `{ projection: { _id: 0 } }`, the only projection the adapter uses. */\n  const project = (doc: Document, options?: { projection?: Document }) => {\n    const copy = { ...doc };\n    if (options?.projection && options.projection['_id'] === 0) {\n      delete copy['_id'];\n    }\n    return copy;\n  };\n\n  const collection = (name: string) => ({\n    find: (query: QueryDocument = {}, options?: { projection?: Document }) => {\n      let sortSpec: Record<string, 1 | -1> = {};\n      let skipCount = 0;\n      let limitCount = Infinity;\n\n      const cursor = {\n        sort(spec: Record<string, 1 | -1>) {\n          sortSpec = spec;\n          return cursor;\n        },\n        skip(count: number) {\n          skipCount = count;\n          return cursor;\n        },\n        limit(count: number) {\n          limitCount = count;\n          return cursor;\n        },\n        toArray: () =>\n          record(name, 'find', () => {\n            const matched = documentsOf(name).filter(doc =>\n              matches(doc, query),\n            );\n            const sorted = Object.entries(sortSpec).reduceRight(\n              (items, [field, direction]) =>\n                [...items].sort(\n                  (left, right) =>\n                    compare(left[field], right[field]) * direction,\n                ),\n              matched,\n            );\n            return sorted\n              .slice(skipCount, skipCount + limitCount)\n              .map(doc => project(doc, options));\n          }),\n      };\n      return cursor;\n    },\n\n    findOne: (query: QueryDocument, options?: { projection?: Document }) =>\n      record(name, 'findOne', () => {\n        const found = documentsOf(name).find(doc => matches(doc, query));\n        return found === undefined ? null : project(found, options);\n      }),\n\n    countDocuments: (query: QueryDocument = {}) =>\n      record(\n        name,\n        'countDocuments',\n        () => documentsOf(name).filter(doc => matches(doc, query)).length,\n      ),\n\n    // Used by the services' own seeding, which the e2e `mock` profile runs for\n    // real so both profiles serve the same catalog.\n    insertMany: (documents: Document[]) =>\n      record(name, 'insertMany', () => {\n        const stored = documentsOf(name);\n        for (const document of documents) {\n          assertUnique(name, document);\n          stored.push({ ...document });\n        }\n        return { insertedCount: documents.length };\n      }),\n\n    /**\n     * A single insert — how an append-only ledger grows, and how a hold is\n     * written beside the counter it moved.\n     *\n     * The options argument is accepted and ignored except for its `session`,\n     * which the transaction wrapper already handles: a caller that passes one\n     * is inside `withTransaction`, and this fake's rollback is a snapshot of\n     * the whole store rather than anything per-operation.\n     */\n    insertOne: (document: Document) =>\n      record(name, 'insertOne', () => {\n        assertUnique(name, document);\n        documentsOf(name).push({ ...document });\n        return { acknowledged: true, insertedId: document['id'] ?? null };\n      }),\n\n    replaceOne: (\n      query: QueryDocument,\n      replacement: Document,\n      options?: { upsert?: boolean },\n    ) =>\n      record(name, 'replaceOne', () => {\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n        if (index === -1) {\n          if (!options?.upsert) return { matchedCount: 0, upsertedCount: 0 };\n          documents.push({ ...replacement });\n          return { matchedCount: 0, upsertedCount: 1 };\n        }\n        documents[index] = { ...replacement };\n        return { matchedCount: 1, upsertedCount: 0 };\n      }),\n\n    /**\n     * Partial update. `$set`, `$addToSet`, `$inc` and `$setOnInsert` are\n     * implemented — the operators the adapters and the stock ledger use — and\n     * **anything else throws**, because a fake that silently accepted `$unset`\n     * without applying it would let a spec pass on an update that never\n     * happened.\n     *\n     * `$addToSet` is what links an identifier onto `user-identity.identifiers`\n     * without duplicating it on a repair run; supporting it here rather than\n     * ignoring it is the difference between the e2e proving the link and merely\n     * not noticing its absence.\n     *\n     * `$inc` with `upsert` is how a quantity moves. It matters that it is a\n     * real increment and not a read-modify-write even here: the whole rule it\n     * implements is that an absolute-value write loses updates, so a fake that\n     * computed the new total from a value it had already read would model the\n     * bug rather than the fix.\n     *\n     * `$push` appends, and a `$set` key of the form `field.$[name].member`\n     * applies to every element of `field` that `options.arrayFilters` selects —\n     * the pair a saga store records an outcome with and later flags one\n     * compensated. Both are what keep an array update from being a\n     * read-modify-write, which is the point of using them.\n     */\n    updateOne: (\n      query: QueryDocument,\n      update: {\n        $set?: Document;\n        $addToSet?: Document;\n        $inc?: Document;\n        $setOnInsert?: Document;\n        $push?: Document;\n      },\n      options?: { upsert?: boolean; arrayFilters?: readonly Document[] },\n    ) =>\n      record(name, 'updateOne', () => {\n        const supported = [\n          '$set',\n          '$addToSet',\n          '$inc',\n          '$setOnInsert',\n          '$push',\n        ];\n        const unsupported = Object.keys(update).filter(\n          operator => !supported.includes(operator),\n        );\n        if (unsupported.length > 0) {\n          throw new Error(\n            `fake-mongo: updateOne does not implement ${unsupported.join(', ')}`,\n          );\n        }\n\n        // A real server rejects an update whose operators both name one field,\n        // and the message is the one this repro'd against: `$setOnInsert` that\n        // also named a field `$inc` touches. Reproducing the refusal is what\n        // keeps the fake from blessing an update Mongo would refuse.\n        const conflicting = Object.keys(update.$setOnInsert ?? {}).filter(\n          field => field in (update.$inc ?? {}) || field in (update.$set ?? {}),\n        );\n        if (conflicting.length > 0) {\n          throw new Error(\n            `fake-mongo: updateOne has conflicting paths in $setOnInsert and $inc/$set: ${conflicting.join(', ')}`,\n          );\n        }\n\n        /** `$set`, `$addToSet`, `$inc` and `$push`, which apply on both branches. */\n        const applyOperators = (base: Document): Document => {\n          const plain = Object.entries(update.$set ?? {}).filter(\n            ([field]) => !field.includes('.$['),\n          );\n          const updated = { ...base, ...Object.fromEntries(plain) };\n          for (const [path, value] of Object.entries(update.$set ?? {})) {\n            const filtered = /^([^.]+)\\.\\$\\[([^\\]]+)\\]\\.(.+)$/.exec(path);\n            if (filtered === null) continue;\n            const [, field, identifier, member] = filtered as unknown as [\n              string,\n              string,\n              string,\n              string,\n            ];\n            // The server refuses a filtered position with no filter naming it.\n            const conditions = (options?.arrayFilters ?? []).flatMap(filter =>\n              Object.entries(filter)\n                .filter(([key]) => key.startsWith(`${identifier}.`))\n                .map(\n                  ([key, condition]) =>\n                    [key.slice(identifier.length + 1), condition] as const,\n                ),\n            );\n            if (conditions.length === 0) {\n              throw new Error(\n                `fake-mongo: no array filter found for identifier ${identifier}`,\n              );\n            }\n            const current = updated[field];\n            updated[field] = (Array.isArray(current) ? current : []).map(\n              element =>\n                isPlainObject(element) &&\n                conditions.every(([key, condition]) =>\n                  matchesCondition(element[key], condition),\n                )\n                  ? { ...element, [member]: value }\n                  : element,\n            );\n          }\n          for (const [field, value] of Object.entries(update.$push ?? {})) {\n            const current = updated[field];\n            updated[field] = [\n              ...(Array.isArray(current) ? current : []),\n              value,\n            ];\n          }\n          for (const [field, value] of Object.entries(update.$addToSet ?? {})) {\n            const current = updated[field];\n            const array = Array.isArray(current) ? current : [];\n            if (!array.includes(value)) {\n              updated[field] = [...array, value];\n            }\n          }\n          for (const [field, delta] of Object.entries(update.$inc ?? {})) {\n            // An absent field is created at the increment's value, which is\n            // exactly why `$setOnInsert` must not also name it.\n            const current = updated[field];\n            updated[field] =\n              (typeof current === 'number' ? current : 0) + (delta as number);\n          }\n          return updated;\n        };\n\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n\n        if (index === -1) {\n          if (options?.upsert !== true) {\n            return { matchedCount: 0, modifiedCount: 0, upsertedCount: 0 };\n          }\n          // The upserted document starts from the query's *equality* fields,\n          // the way a real server seeds one — an operator condition contributes\n          // nothing, which is why a `$expr`-guarded upsert would insert a row\n          // missing the very field it filtered on.\n          const seedFields = Object.fromEntries(\n            Object.entries(query).filter(\n              ([field, condition]) =>\n                !field.startsWith('$') && !isPlainObject(condition),\n            ),\n          );\n          const inserted = applyOperators({\n            ...seedFields,\n            ...(update.$setOnInsert ?? {}),\n          });\n          assertUnique(name, inserted);\n          documents.push(inserted);\n          return { matchedCount: 0, modifiedCount: 0, upsertedCount: 1 };\n        }\n\n        const updated = applyOperators(documents[index]);\n        assertUnique(name, updated, documents[index]);\n        documents[index] = updated;\n        return { matchedCount: 1, modifiedCount: 1, upsertedCount: 0 };\n      }),\n\n    /**\n     * `$set` across every matching document, and the count of what changed.\n     *\n     * ⚠️ **The count is what a caller branches on.** A settlement run claims its\n     * ledger lines with this and reads `modifiedCount === 0` as \"another replica\n     * took them all\" — so a fake returning a fixed `1`, or the match count\n     * rather than the modified count, would make the losing replica behave like\n     * the winning one and the conditional claim would test nothing.\n     *\n     * `$set` only. Anything else throws, for the reason `updateOne` gives:\n     * silently accepting an operator it does not apply lets a spec pass on an\n     * update that never happened.\n     */\n    updateMany: (query: QueryDocument, update: { $set?: Document }) =>\n      record(name, 'updateMany', () => {\n        const unsupported = Object.keys(update).filter(\n          operator => operator !== '$set',\n        );\n        if (unsupported.length > 0) {\n          throw new Error(\n            `fake-mongo: updateMany does not implement ${unsupported.join(', ')}`,\n          );\n        }\n\n        const documents = documentsOf(name);\n        let modifiedCount = 0;\n        documents.forEach((doc, index) => {\n          if (!matches(doc, query)) return;\n          const updated = { ...doc, ...(update.$set ?? {}) };\n          assertUnique(name, updated, doc);\n          documents[index] = updated;\n          modifiedCount += 1;\n        });\n        return { matchedCount: modifiedCount, modifiedCount };\n      }),\n\n    /**\n     * Update one document and hand back the result, upserting when asked.\n     *\n     * ⚠️ **`returnDocument: 'after'` is the only mode implemented, and the\n     * default here is `'after'` rather than the driver's `'before'`** — because\n     * the callers that need this primitive at all need the merged document. A\n     * two-message join upserts its own half and then asks \"is the pair complete\n     * now?\", which is a question only the *after* state answers. `'before'`\n     * throws rather than quietly returning the wrong half.\n     *\n     * Implemented over {@link updateOne} so the upsert seeding rule, the\n     * conflicting-path refusal and the unique-index enforcement are the same\n     * ones, rather than a second copy that could drift from them.\n     */\n    findOneAndUpdate: (\n      query: QueryDocument,\n      update: {\n        $set?: Document;\n        $addToSet?: Document;\n        $inc?: Document;\n        $setOnInsert?: Document;\n        $push?: Document;\n      },\n      options?: { upsert?: boolean; returnDocument?: 'before' | 'after' },\n    ) =>\n      record(name, 'findOneAndUpdate', async () => {\n        if (options?.returnDocument === 'before') {\n          throw new Error(\n            'fake-mongo: findOneAndUpdate only implements returnDocument: \"after\"',\n          );\n        }\n        // Where the document is *before* the write, because afterwards the\n        // query may no longer find it: an upsert's operator conditions need not\n        // hold of the row it just inserted — `{ folded: { $exists: false } }`\n        // matches nothing once `folded` has been set. `documentsOf` hands back\n        // the live array, which `updateOne` mutates in place or pushes onto, so\n        // the position is enough to identify it either way.\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n\n        const result = await collection(name).updateOne(query, update, {\n          upsert: options?.upsert === true,\n        });\n        if (result.matchedCount === 0 && result.upsertedCount === 0) {\n          return null;\n        }\n\n        return index === -1\n          ? documents[documents.length - 1]\n          : documents[index];\n      }),\n\n    deleteOne: (query: QueryDocument) =>\n      record(name, 'deleteOne', () => {\n        const documents = documentsOf(name);\n        const index = documents.findIndex(doc => matches(doc, query));\n        if (index === -1) return { deletedCount: 0 };\n        documents.splice(index, 1);\n        return { deletedCount: 1 };\n      }),\n\n    /**\n     * Declares an index, and **enforces it when it is unique**.\n     *\n     * Idempotent, like the real one: a service that ensures its index per\n     * request rather than at boot — because a tenant database only appears on\n     * first write — calls this on every write.\n     */\n    createIndex: (spec: Document, options?: Document) =>\n      record(name, 'createIndex', () => {\n        if (options?.['unique'] === true) {\n          const fields = Object.keys(spec);\n          const existing = uniqueIndexes.get(name) ?? [];\n          const already = existing.some(\n            candidate =>\n              candidate.length === fields.length &&\n              candidate.every((field, at) => field === fields[at]),\n          );\n          if (!already) {\n            uniqueIndexes.set(name, [...existing, fields]);\n          }\n        }\n        return { spec, options };\n      }),\n  });\n\n  /**\n   * A session whose `withTransaction` really rolls back.\n   *\n   * ⚠️ **It is atomicity, not isolation, and the difference decides where a\n   * test may live.** The store is a single-threaded object graph, so nothing\n   * runs concurrently with the body and a \"race\" here resolves in the order it\n   * was written: a concurrency property — two writers contending for the last\n   * unit — is green under this fake no matter what the code does, and belongs\n   * in a `*.live.spec.ts` against real Mongo (ADR 0010).\n   *\n   * What it *does* model is the abort path, which is worth having: a body that\n   * throws leaves the store exactly as it found it, so a conditional write that\n   * moves a counter and then fails to write its row cannot leave the counter\n   * moved. That is a real bug shape, and one a fake without rollback would hide\n   * by committing half of it.\n   */\n  const startSession = () => {\n    let open = true;\n    return {\n      withTransaction: async (body: () => Promise<unknown>) => {\n        const snapshot = new Map(\n          [...collections].map(([name, docs]) => [\n            name,\n            docs.map(doc => ({ ...doc })),\n          ]),\n        );\n        try {\n          return await body();\n        } catch (error) {\n          collections.clear();\n          for (const [name, docs] of snapshot) collections.set(name, docs);\n          throw error;\n        }\n      },\n      endSession: () => {\n        open = false;\n        return Promise.resolve();\n      },\n      get hasEnded() {\n        return !open;\n      },\n    };\n  };\n\n  return {\n    seed: (name, documents) => {\n      collections.set(\n        name,\n        documents.map(doc => ({ ...doc })),\n      );\n    },\n    read: name => documentsOf(name).map(doc => ({ ...doc })),\n    failWith: error => {\n      failure = error;\n    },\n    failOn: (operation, error) => {\n      failuresByOperation.set(operation, error);\n    },\n    get operations() {\n      return operations;\n    },\n    startSession,\n    db: { collection },\n  };\n};\n"],"names":["isPlainObject","value","Array","isArray","compare","left","right","Date","getTime","String","localeCompare","matchesCondition","actual","condition","Object","entries","every","operator","operand","includes","undefined","RegExp","test","TypeError","evaluateExpression","doc","node","startsWith","slice","length","operands","map","child","valuesAt","field","current","segment","split","next","container","element","push","flatMap","NEGATIVE_OPERATORS","Set","isNegativeCondition","keys","some","has","matches","query","candidates","FakeDuplicateKeyError","Error","collection","key","JSON","stringify","code","name","makeFakeMongoDb","seed","collections","Map","docs","d","operations","failure","failuresByOperation","documentsOf","set","get","uniqueIndexes","uniqueIndexesOf","assertUnique","candidate","ignored","fields","clash","find","fromEntries","record","op","produce","scoped","Promise","reject","resolve","error","project","options","copy","projection","sortSpec","skipCount","limitCount","Infinity","cursor","sort","spec","skip","count","limit","toArray","matched","filter","sorted","reduceRight","items","direction","findOne","found","countDocuments","insertMany","documents","stored","document","insertedCount","insertOne","acknowledged","insertedId","replaceOne","replacement","index","findIndex","upsert","matchedCount","upsertedCount","updateOne","update","supported","unsupported","join","conflicting","$setOnInsert","$inc","$set","applyOperators","base","plain","updated","path","filtered","exec","identifier","member","conditions","arrayFilters","$push","$addToSet","array","delta","modifiedCount","seedFields","inserted","updateMany","forEach","findOneAndUpdate","returnDocument","result","deleteOne","deletedCount","splice","createIndex","existing","already","at","startSession","open","withTransaction","body","snapshot","clear","endSession","hasEnded","read","failWith","failOn","operation","db"],"mappings":"AAAA;;;;;;;;;;CAUC,GAED,+DAA+D;AAI/D,MAAMA,gBAAgB,CAACC,QACrB,OAAOA,UAAU,YAAYA,UAAU,QAAQ,CAACC,MAAMC,OAAO,CAACF;AAEhE,MAAMG,UAAU,CAACC,MAAeC;IAC9B,IAAID,QAAQ,QAAQC,SAAS,MAAM,OAAO;IAC1C,IAAID,QAAQ,MAAM,OAAO,CAAC;IAC1B,IAAIC,SAAS,MAAM,OAAO;IAC1B,IAAI,OAAOD,SAAS,YAAY,OAAOC,UAAU,UAC/C,OAAOD,OAAOC;IAChB,IAAID,gBAAgBE,QAAQD,iBAAiBC,MAAM;QACjD,OAAOF,KAAKG,OAAO,KAAKF,MAAME,OAAO;IACvC;IACA,OAAOC,OAAOJ,MAAMK,aAAa,CAACD,OAAOH;AAC3C;AAEA,uEAAuE,GACvE,MAAMK,mBAAmB,CAACC,QAAiBC;IACzC,IAAI,CAACb,cAAca,YAAY;QAC7B,OAAOD,WAAWC;IACpB;IAEA,OAAOC,OAAOC,OAAO,CAACF,WAAWG,KAAK,CAAC,CAAC,CAACC,UAAUC,QAAQ;QACzD,OAAQD;YACN,KAAK;gBACH,OAAOL,WAAWM;YACpB,KAAK;gBACH,OAAON,WAAWM;YACpB,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,WAAW;YACpC,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,YAAY;YACrC,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,WAAW;YACpC,KAAK;gBACH,OAAOd,QAAQQ,QAAQM,YAAY;YACrC,KAAK;gBACH,OAAO,AAACA,QAAsBC,QAAQ,CAACP;YACzC,yEAAyE;YACzE,uEAAuE;YACvE,wEAAwE;YACxE,uEAAuE;YACvE,KAAK;gBACH,OAAO,AAACA,WAAWQ,cAAgBF;YACrC,KAAK;gBACH,OAAO,CAAC,AAACA,QAAsBC,QAAQ,CAACP;YAC1C,KAAK;gBACH,OAAO,CAACD,iBAAiBC,QAAQM;YACnC,KAAK;oBAGAL;gBAFH,OAAO,IAAIQ,OACTH,UACCL,sBAAAA,SAAS,CAAC,WAAW,YAArBA,sBAAoC,IACrCS,IAAI,CAACb,OAAOG;YAChB,KAAK;gBACH,kCAAkC;gBAClC,OAAO;YACT;gBACE,MAAM,IAAIW,UAAU,CAAC,kCAAkC,EAAEN,SAAS,CAAC,CAAC;QACxE;IACF;AACF;AAEA;;;;;;;;;;;CAWC,GACD,MAAMO,qBAAqB,CAACC,KAAeC;IACzC,IAAI,OAAOA,SAAS,YAAYA,KAAKC,UAAU,CAAC,MAAM;QACpD,OAAOF,GAAG,CAACC,KAAKE,KAAK,CAAC,GAAG;IAC3B;IACA,IAAI,CAAC5B,cAAc0B,OAAO;QACxB,OAAOA;IACT;IAEA,MAAMX,UAAUD,OAAOC,OAAO,CAACW;IAC/B,IAAIX,QAAQc,MAAM,KAAK,GAAG;QACxB,MAAM,IAAIN,UACR,CAAC,2DAA2D,EAAER,QAAQc,MAAM,EAAE;IAElF;IACA,MAAM,CAACZ,UAAUC,QAAQ,GAAGH,OAAO,CAAC,EAAE;IACtC,MAAMe,WAAW,AAACZ,QAAsBa,GAAG,CAACC,CAAAA,QAC1CR,mBAAmBC,KAAKO;IAG1B,OAAQf;QACN,KAAK;YACH,OAAO,AAACa,QAAQ,CAAC,EAAE,GAAeA,QAAQ,CAAC,EAAE;QAC/C,KAAK;YACH,OAAO,AAACA,QAAQ,CAAC,EAAE,GAAeA,QAAQ,CAAC,EAAE;QAC/C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,KAAK;QAC9C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,IAAI;QAC7C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,KAAK;QAC9C,KAAK;YACH,OAAO1B,QAAQ0B,QAAQ,CAAC,EAAE,EAAEA,QAAQ,CAAC,EAAE,IAAI;QAC7C,KAAK;YACH,OAAOA,QAAQ,CAAC,EAAE,KAAKA,QAAQ,CAAC,EAAE;QACpC;YACE,MAAM,IAAIP,UACR,CAAC,wCAAwC,EAAEN,SAAS,CAAC,CAAC;IAE5D;AACF;AAEA;;;;;;;;;;;;;CAaC,GACD,MAAMgB,WAAW,CAACR,KAAeS;IAC/B,IAAIC,UAAqB;QAACV;KAAI;IAC9B,KAAK,MAAMW,WAAWF,MAAMG,KAAK,CAAC,KAAM;QACtC,MAAMC,OAAkB,EAAE;QAC1B,KAAK,MAAMrC,SAASkC,QAAS;YAC3B,MAAMI,YAAYrC,MAAMC,OAAO,CAACF,SAASA,QAAQ;gBAACA;aAAM;YACxD,KAAK,MAAMuC,WAAWD,UAAW;gBAC/B,IAAIvC,cAAcwC,UAAU;oBAC1BF,KAAKG,IAAI,CAACD,OAAO,CAACJ,QAAQ;gBAC5B;YACF;QACF;QACAD,UAAUG;IACZ;IACA,OAAOH,QAAQO,OAAO,CAACzC,CAAAA,QACrBC,MAAMC,OAAO,CAACF,SAAS;YAACA;eAAUA;SAAM,GAAG;YAACA;SAAM;AAEtD;AAEA,wEAAwE,GACxE,MAAM0C,qBAAqB,IAAIC,IAAI;IAAC;IAAO;IAAQ;CAAO;AAE1D,MAAMC,sBAAsB,CAAChC,YAC3Bb,cAAca,cACdC,OAAOgC,IAAI,CAACjC,WAAWkC,IAAI,CAAC9B,CAAAA,WAAY0B,mBAAmBK,GAAG,CAAC/B;AAEjE,MAAMgC,UAAU,CAACxB,KAAeyB,QAC9BpC,OAAOC,OAAO,CAACmC,OAAOlC,KAAK,CAAC,CAAC,CAACkB,OAAOrB,UAAU;QAC7C,IAAIqB,UAAU,QAAQ;YACpB,OAAO,AAACrB,UAA8BG,KAAK,CAACgB,CAAAA,QAASiB,QAAQxB,KAAKO;QACpE;QACA,IAAIE,UAAU,OAAO;YACnB,OAAO,AAACrB,UAA8BkC,IAAI,CAACf,CAAAA,QAASiB,QAAQxB,KAAKO;QACnE;QACA,IAAIE,UAAU,SAAS;YACrB,OAAOV,mBAAmBC,KAAKZ,eAAe;QAChD;QACA,MAAMsC,aAAalB,SAASR,KAAKS;QACjC,IAAIiB,WAAWtB,MAAM,KAAK,GAAG;YAC3B,OAAOlB,iBAAiBS,WAAWP;QACrC;QACA,4EAA4E;QAC5E,uEAAuE;QACvE,4EAA4E;QAC5E,sEAAsE;QACtE,OAAOgC,oBAAoBhC,aACvBsC,WAAWnC,KAAK,CAACf,CAAAA,QAASU,iBAAiBV,OAAOY,cAClDsC,WAAWJ,IAAI,CAAC9C,CAAAA,QAASU,iBAAiBV,OAAOY;IACvD;AAEF;;;;;;;CAOC,GACD,IAAA,AAAMuC,wBAAN,MAAMA,8BAA8BC;IAGlC,YAAYC,UAAkB,EAAEC,GAAa,CAAE;QAC7C,KAAK,CACH,CAAC,mDAAmD,EAAED,WAAW,UAAU,EAAEE,KAAKC,SAAS,CAACF,MAAM,QAJ7FG,OAAO;QAMd,IAAI,CAACC,IAAI,GAAG;IACd;AACF;AAsCA;;;;;;CAMC,GACD,OAAO,MAAMC,kBAAkB,CAC7BC,OAAmC,CAAC,CAAC;IAErC,MAAMC,cAAc,IAAIC,IACtBjD,OAAOC,OAAO,CAAC8C,MAAM9B,GAAG,CAAC,CAAC,CAAC4B,MAAMK,KAAK,GAAK;YACzCL;YACAK,KAAKjC,GAAG,CAACkC,CAAAA,IAAM,aAAKA;SACrB;IAEH,MAAMC,aAAwD,EAAE;IAChE,IAAIC;IACJ,MAAMC,sBAAsB,IAAIL;IAEhC,MAAMM,cAAc,CAACV;QACnB,IAAI,CAACG,YAAYd,GAAG,CAACW,OAAOG,YAAYQ,GAAG,CAACX,MAAM,EAAE;QACpD,OAAOG,YAAYS,GAAG,CAACZ;IACzB;IAEA;;;;;;;;;;GAUC,GACD,MAAMa,gBAAgB,IAAIT;IAE1B,MAAMU,kBAAkB,CAACd;YACvBa;gBAAAA,qBAAAA,cAAcD,GAAG,CAACZ,iBAAlBa,qBAA2B,EAAE;;IAE/B;;;;;;;;;GASC,GACD,MAAME,eAAe,CACnBf,MACAgB,WACAC;QAEA,KAAK,MAAMC,UAAUJ,gBAAgBd,MAAO;YAC1C,IAAIkB,OAAO9B,IAAI,CAACb,CAAAA,QAASyC,SAAS,CAACzC,MAAM,KAAKd,YAAY;YAC1D,MAAM0D,QAAQT,YAAYV,MAAMoB,IAAI,CAClCtD,CAAAA,MACEA,QAAQmD,WACRC,OAAO7D,KAAK,CAACkB,CAAAA,QAAST,GAAG,CAACS,MAAM,KAAKyC,SAAS,CAACzC,MAAM;YAEzD,IAAI4C,UAAU1D,WAAW;gBACvB,MAAM,IAAIgC,sBACRO,MACA7C,OAAOkE,WAAW,CAACH,OAAO9C,GAAG,CAACG,CAAAA,QAAS;wBAACA;wBAAOyC,SAAS,CAACzC,MAAM;qBAAC;YAEpE;QACF;IACF;IAEA,MAAM+C,SAAS,CAAStB,MAAcuB,IAAYC;QAChDjB,WAAWzB,IAAI,CAAC;YAAEa,YAAYK;YAAMuB;QAAG;QACvC,MAAME,SAAShB,oBAAoBG,GAAG,CAACW;QACvC,IAAIE,WAAWhE,WAAW,OAAOiE,QAAQC,MAAM,CAACF;QAChD,IAAIjB,YAAY/C,WAAW,OAAOiE,QAAQC,MAAM,CAACnB;QACjD,wEAAwE;QACxE,4EAA4E;QAC5E,8EAA8E;QAC9E,IAAI;YACF,OAAOkB,QAAQE,OAAO,CAACJ;QACzB,EAAE,OAAOK,OAAO;YACd,OAAOH,QAAQC,MAAM,CAACE;QACxB;IACF;IAEA,gFAAgF,GAChF,MAAMC,UAAU,CAAChE,KAAeiE;QAC9B,MAAMC,OAAO,aAAKlE;QAClB,IAAIiE,CAAAA,2BAAAA,QAASE,UAAU,KAAIF,QAAQE,UAAU,CAAC,MAAM,KAAK,GAAG;YAC1D,OAAOD,IAAI,CAAC,MAAM;QACpB;QACA,OAAOA;IACT;IAEA,MAAMrC,aAAa,CAACK,OAAkB,CAAA;YACpCoB,MAAM,CAAC7B,QAAuB,CAAC,CAAC,EAAEwC;gBAChC,IAAIG,WAAmC,CAAC;gBACxC,IAAIC,YAAY;gBAChB,IAAIC,aAAaC;gBAEjB,MAAMC,SAAS;oBACbC,MAAKC,IAA4B;wBAC/BN,WAAWM;wBACX,OAAOF;oBACT;oBACAG,MAAKC,KAAa;wBAChBP,YAAYO;wBACZ,OAAOJ;oBACT;oBACAK,OAAMD,KAAa;wBACjBN,aAAaM;wBACb,OAAOJ;oBACT;oBACAM,SAAS,IACPtB,OAAOtB,MAAM,QAAQ;4BACnB,MAAM6C,UAAUnC,YAAYV,MAAM8C,MAAM,CAAChF,CAAAA,MACvCwB,QAAQxB,KAAKyB;4BAEf,MAAMwD,SAAS5F,OAAOC,OAAO,CAAC8E,UAAUc,WAAW,CACjD,CAACC,OAAO,CAAC1E,OAAO2E,UAAU,GACxB;uCAAID;iCAAM,CAACV,IAAI,CACb,CAAC7F,MAAMC,QACLF,QAAQC,IAAI,CAAC6B,MAAM,EAAE5B,KAAK,CAAC4B,MAAM,IAAI2E,YAE3CL;4BAEF,OAAOE,OACJ9E,KAAK,CAACkE,WAAWA,YAAYC,YAC7BhE,GAAG,CAACN,CAAAA,MAAOgE,QAAQhE,KAAKiE;wBAC7B;gBACJ;gBACA,OAAOO;YACT;YAEAa,SAAS,CAAC5D,OAAsBwC,UAC9BT,OAAOtB,MAAM,WAAW;oBACtB,MAAMoD,QAAQ1C,YAAYV,MAAMoB,IAAI,CAACtD,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBACzD,OAAO6D,UAAU3F,YAAY,OAAOqE,QAAQsB,OAAOrB;gBACrD;YAEFsB,gBAAgB,CAAC9D,QAAuB,CAAC,CAAC,GACxC+B,OACEtB,MACA,kBACA,IAAMU,YAAYV,MAAM8C,MAAM,CAAChF,CAAAA,MAAOwB,QAAQxB,KAAKyB,QAAQrB,MAAM;YAGrE,2EAA2E;YAC3E,gDAAgD;YAChDoF,YAAY,CAACC,YACXjC,OAAOtB,MAAM,cAAc;oBACzB,MAAMwD,SAAS9C,YAAYV;oBAC3B,KAAK,MAAMyD,YAAYF,UAAW;wBAChCxC,aAAaf,MAAMyD;wBACnBD,OAAO1E,IAAI,CAAC,aAAK2E;oBACnB;oBACA,OAAO;wBAAEC,eAAeH,UAAUrF,MAAM;oBAAC;gBAC3C;YAEF;;;;;;;;KAQC,GACDyF,WAAW,CAACF,WACVnC,OAAOtB,MAAM,aAAa;wBAGiByD;oBAFzC1C,aAAaf,MAAMyD;oBACnB/C,YAAYV,MAAMlB,IAAI,CAAC,aAAK2E;oBAC5B,OAAO;wBAAEG,cAAc;wBAAMC,UAAU,GAAEJ,eAAAA,QAAQ,CAAC,KAAK,YAAdA,eAAkB;oBAAK;gBAClE;YAEFK,YAAY,CACVvE,OACAwE,aACAhC,UAEAT,OAAOtB,MAAM,cAAc;oBACzB,MAAMuD,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBACtD,IAAIyE,UAAU,CAAC,GAAG;wBAChB,IAAI,EAACjC,2BAAAA,QAASmC,MAAM,GAAE,OAAO;4BAAEC,cAAc;4BAAGC,eAAe;wBAAE;wBACjEb,UAAUzE,IAAI,CAAC,aAAKiF;wBACpB,OAAO;4BAAEI,cAAc;4BAAGC,eAAe;wBAAE;oBAC7C;oBACAb,SAAS,CAACS,MAAM,GAAG,aAAKD;oBACxB,OAAO;wBAAEI,cAAc;wBAAGC,eAAe;oBAAE;gBAC7C;YAEF;;;;;;;;;;;;;;;;;;;;;;;KAuBC,GACDC,WAAW,CACT9E,OACA+E,QAOAvC,UAEAT,OAAOtB,MAAM,aAAa;wBAqBQsE;oBApBhC,MAAMC,YAAY;wBAChB;wBACA;wBACA;wBACA;wBACA;qBACD;oBACD,MAAMC,cAAcrH,OAAOgC,IAAI,CAACmF,QAAQxB,MAAM,CAC5CxF,CAAAA,WAAY,CAACiH,UAAU/G,QAAQ,CAACF;oBAElC,IAAIkH,YAAYtG,MAAM,GAAG,GAAG;wBAC1B,MAAM,IAAIwB,MACR,CAAC,yCAAyC,EAAE8E,YAAYC,IAAI,CAAC,OAAO;oBAExE;oBAEA,uEAAuE;oBACvE,uEAAuE;oBACvE,qEAAqE;oBACrE,6DAA6D;oBAC7D,MAAMC,cAAcvH,OAAOgC,IAAI,EAACmF,uBAAAA,OAAOK,YAAY,YAAnBL,uBAAuB,CAAC,GAAGxB,MAAM,CAC/DvE,CAAAA;4BAAmB+F,cAAgCA;+BAA1C/F,WAAU+F,eAAAA,OAAOM,IAAI,YAAXN,eAAe,CAAC,MAAM/F,WAAU+F,eAAAA,OAAOO,IAAI,YAAXP,eAAe,CAAC;;oBAErE,IAAII,YAAYxG,MAAM,GAAG,GAAG;wBAC1B,MAAM,IAAIwB,MACR,CAAC,2EAA2E,EAAEgF,YAAYD,IAAI,CAAC,OAAO;oBAE1G;oBAEA,2EAA2E,GAC3E,MAAMK,iBAAiB,CAACC;4BACOT,cAIcA,eAkCCA,eAOAA,mBAOAA;wBApD5C,MAAMU,QAAQ7H,OAAOC,OAAO,EAACkH,eAAAA,OAAOO,IAAI,YAAXP,eAAe,CAAC,GAAGxB,MAAM,CACpD,CAAC,CAACvE,MAAM,GAAK,CAACA,MAAMf,QAAQ,CAAC;wBAE/B,MAAMyH,UAAU,aAAKF,MAAS5H,OAAOkE,WAAW,CAAC2D;wBACjD,KAAK,MAAM,CAACE,MAAM5I,MAAM,IAAIa,OAAOC,OAAO,EAACkH,gBAAAA,OAAOO,IAAI,YAAXP,gBAAe,CAAC,GAAI;;4BAC7D,MAAMa,WAAW,kCAAkCC,IAAI,CAACF;4BACxD,IAAIC,aAAa,MAAM;4BACvB,MAAM,GAAG5G,OAAO8G,YAAYC,OAAO,GAAGH;4BAMtC,mEAAmE;4BACnE,MAAMI,aAAa,SAACxD,2BAAAA,QAASyD,YAAY,mBAAI,EAAE,EAAEzG,OAAO,CAAC+D,CAAAA,SACvD3F,OAAOC,OAAO,CAAC0F,QACZA,MAAM,CAAC,CAAC,CAAClD,IAAI,GAAKA,IAAI5B,UAAU,CAAC,GAAGqH,WAAW,CAAC,CAAC,GACjDjH,GAAG,CACF,CAAC,CAACwB,KAAK1C,UAAU,GACf;wCAAC0C,IAAI3B,KAAK,CAACoH,WAAWnH,MAAM,GAAG;wCAAIhB;qCAAU;4BAGrD,IAAIqI,WAAWrH,MAAM,KAAK,GAAG;gCAC3B,MAAM,IAAIwB,MACR,CAAC,iDAAiD,EAAE2F,YAAY;4BAEpE;4BACA,MAAM7G,UAAUyG,OAAO,CAAC1G,MAAM;4BAC9B0G,OAAO,CAAC1G,MAAM,GAAG,AAAChC,CAAAA,MAAMC,OAAO,CAACgC,WAAWA,UAAU,EAAE,AAAD,EAAGJ,GAAG,CAC1DS,CAAAA,UACExC,cAAcwC,YACd0G,WAAWlI,KAAK,CAAC,CAAC,CAACuC,KAAK1C,UAAU,GAChCF,iBAAiB6B,OAAO,CAACe,IAAI,EAAE1C,cAE7B,aAAK2B;oCAAS,CAACyG,OAAO,EAAEhJ;qCACxBuC;wBAEV;wBACA,KAAK,MAAM,CAACN,OAAOjC,MAAM,IAAIa,OAAOC,OAAO,EAACkH,gBAAAA,OAAOmB,KAAK,YAAZnB,gBAAgB,CAAC,GAAI;4BAC/D,MAAM9F,UAAUyG,OAAO,CAAC1G,MAAM;4BAC9B0G,OAAO,CAAC1G,MAAM,GAAG;mCACXhC,MAAMC,OAAO,CAACgC,WAAWA,UAAU,EAAE;gCACzClC;6BACD;wBACH;wBACA,KAAK,MAAM,CAACiC,OAAOjC,MAAM,IAAIa,OAAOC,OAAO,EAACkH,oBAAAA,OAAOoB,SAAS,YAAhBpB,oBAAoB,CAAC,GAAI;4BACnE,MAAM9F,UAAUyG,OAAO,CAAC1G,MAAM;4BAC9B,MAAMoH,QAAQpJ,MAAMC,OAAO,CAACgC,WAAWA,UAAU,EAAE;4BACnD,IAAI,CAACmH,MAAMnI,QAAQ,CAAClB,QAAQ;gCAC1B2I,OAAO,CAAC1G,MAAM,GAAG;uCAAIoH;oCAAOrJ;iCAAM;4BACpC;wBACF;wBACA,KAAK,MAAM,CAACiC,OAAOqH,MAAM,IAAIzI,OAAOC,OAAO,EAACkH,eAAAA,OAAOM,IAAI,YAAXN,eAAe,CAAC,GAAI;4BAC9D,gEAAgE;4BAChE,oDAAoD;4BACpD,MAAM9F,UAAUyG,OAAO,CAAC1G,MAAM;4BAC9B0G,OAAO,CAAC1G,MAAM,GACZ,AAAC,CAAA,OAAOC,YAAY,WAAWA,UAAU,CAAA,IAAMoH;wBACnD;wBACA,OAAOX;oBACT;oBAEA,MAAM1B,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBAEtD,IAAIyE,UAAU,CAAC,GAAG;4BAgBVM;wBAfN,IAAIvC,CAAAA,2BAAAA,QAASmC,MAAM,MAAK,MAAM;4BAC5B,OAAO;gCAAEC,cAAc;gCAAG0B,eAAe;gCAAGzB,eAAe;4BAAE;wBAC/D;wBACA,mEAAmE;wBACnE,sEAAsE;wBACtE,oEAAoE;wBACpE,yCAAyC;wBACzC,MAAM0B,aAAa3I,OAAOkE,WAAW,CACnClE,OAAOC,OAAO,CAACmC,OAAOuD,MAAM,CAC1B,CAAC,CAACvE,OAAOrB,UAAU,GACjB,CAACqB,MAAMP,UAAU,CAAC,QAAQ,CAAC3B,cAAca;wBAG/C,MAAM6I,WAAWjB,eAAe,aAC3BgB,aACCxB,wBAAAA,OAAOK,YAAY,YAAnBL,wBAAuB,CAAC;wBAE9BvD,aAAaf,MAAM+F;wBACnBxC,UAAUzE,IAAI,CAACiH;wBACf,OAAO;4BAAE5B,cAAc;4BAAG0B,eAAe;4BAAGzB,eAAe;wBAAE;oBAC/D;oBAEA,MAAMa,UAAUH,eAAevB,SAAS,CAACS,MAAM;oBAC/CjD,aAAaf,MAAMiF,SAAS1B,SAAS,CAACS,MAAM;oBAC5CT,SAAS,CAACS,MAAM,GAAGiB;oBACnB,OAAO;wBAAEd,cAAc;wBAAG0B,eAAe;wBAAGzB,eAAe;oBAAE;gBAC/D;YAEF;;;;;;;;;;;;KAYC,GACD4B,YAAY,CAACzG,OAAsB+E,SACjChD,OAAOtB,MAAM,cAAc;oBACzB,MAAMwE,cAAcrH,OAAOgC,IAAI,CAACmF,QAAQxB,MAAM,CAC5CxF,CAAAA,WAAYA,aAAa;oBAE3B,IAAIkH,YAAYtG,MAAM,GAAG,GAAG;wBAC1B,MAAM,IAAIwB,MACR,CAAC,0CAA0C,EAAE8E,YAAYC,IAAI,CAAC,OAAO;oBAEzE;oBAEA,MAAMlB,YAAY7C,YAAYV;oBAC9B,IAAI6F,gBAAgB;oBACpBtC,UAAU0C,OAAO,CAAC,CAACnI,KAAKkG;4BAEQM;wBAD9B,IAAI,CAAChF,QAAQxB,KAAKyB,QAAQ;wBAC1B,MAAM0F,UAAU,aAAKnH,MAASwG,eAAAA,OAAOO,IAAI,YAAXP,eAAe,CAAC;wBAC9CvD,aAAaf,MAAMiF,SAASnH;wBAC5ByF,SAAS,CAACS,MAAM,GAAGiB;wBACnBY,iBAAiB;oBACnB;oBACA,OAAO;wBAAE1B,cAAc0B;wBAAeA;oBAAc;gBACtD;YAEF;;;;;;;;;;;;;KAaC,GACDK,kBAAkB,CAChB3G,OACA+E,QAOAvC,UAEAT,OAAOtB,MAAM,oBAAoB;oBAC/B,IAAI+B,CAAAA,2BAAAA,QAASoE,cAAc,MAAK,UAAU;wBACxC,MAAM,IAAIzG,MACR;oBAEJ;oBACA,mEAAmE;oBACnE,wEAAwE;oBACxE,sEAAsE;oBACtE,uEAAuE;oBACvE,wEAAwE;oBACxE,oDAAoD;oBACpD,MAAM6D,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBAEtD,MAAM6G,SAAS,MAAMzG,WAAWK,MAAMqE,SAAS,CAAC9E,OAAO+E,QAAQ;wBAC7DJ,QAAQnC,CAAAA,2BAAAA,QAASmC,MAAM,MAAK;oBAC9B;oBACA,IAAIkC,OAAOjC,YAAY,KAAK,KAAKiC,OAAOhC,aAAa,KAAK,GAAG;wBAC3D,OAAO;oBACT;oBAEA,OAAOJ,UAAU,CAAC,IACdT,SAAS,CAACA,UAAUrF,MAAM,GAAG,EAAE,GAC/BqF,SAAS,CAACS,MAAM;gBACtB;YAEFqC,WAAW,CAAC9G,QACV+B,OAAOtB,MAAM,aAAa;oBACxB,MAAMuD,YAAY7C,YAAYV;oBAC9B,MAAMgE,QAAQT,UAAUU,SAAS,CAACnG,CAAAA,MAAOwB,QAAQxB,KAAKyB;oBACtD,IAAIyE,UAAU,CAAC,GAAG,OAAO;wBAAEsC,cAAc;oBAAE;oBAC3C/C,UAAUgD,MAAM,CAACvC,OAAO;oBACxB,OAAO;wBAAEsC,cAAc;oBAAE;gBAC3B;YAEF;;;;;;KAMC,GACDE,aAAa,CAAChE,MAAgBT,UAC5BT,OAAOtB,MAAM,eAAe;oBAC1B,IAAI+B,CAAAA,2BAAAA,OAAS,CAAC,SAAS,MAAK,MAAM;4BAEflB;wBADjB,MAAMK,SAAS/D,OAAOgC,IAAI,CAACqD;wBAC3B,MAAMiE,YAAW5F,qBAAAA,cAAcD,GAAG,CAACZ,iBAAlBa,qBAA2B,EAAE;wBAC9C,MAAM6F,UAAUD,SAASrH,IAAI,CAC3B4B,CAAAA,YACEA,UAAU9C,MAAM,KAAKgD,OAAOhD,MAAM,IAClC8C,UAAU3D,KAAK,CAAC,CAACkB,OAAOoI,KAAOpI,UAAU2C,MAAM,CAACyF,GAAG;wBAEvD,IAAI,CAACD,SAAS;4BACZ7F,cAAcF,GAAG,CAACX,MAAM;mCAAIyG;gCAAUvF;6BAAO;wBAC/C;oBACF;oBACA,OAAO;wBAAEsB;wBAAMT;oBAAQ;gBACzB;QACJ,CAAA;IAEA;;;;;;;;;;;;;;;GAeC,GACD,MAAM6E,eAAe;QACnB,IAAIC,OAAO;QACX,OAAO;YACLC,iBAAiB,OAAOC;gBACtB,MAAMC,WAAW,IAAI5G,IACnB;uBAAID;iBAAY,CAAC/B,GAAG,CAAC,CAAC,CAAC4B,MAAMK,KAAK,GAAK;wBACrCL;wBACAK,KAAKjC,GAAG,CAACN,CAAAA,MAAQ,aAAKA;qBACvB;gBAEH,IAAI;oBACF,OAAO,MAAMiJ;gBACf,EAAE,OAAOlF,OAAO;oBACd1B,YAAY8G,KAAK;oBACjB,KAAK,MAAM,CAACjH,MAAMK,KAAK,IAAI2G,SAAU7G,YAAYQ,GAAG,CAACX,MAAMK;oBAC3D,MAAMwB;gBACR;YACF;YACAqF,YAAY;gBACVL,OAAO;gBACP,OAAOnF,QAAQE,OAAO;YACxB;YACA,IAAIuF,YAAW;gBACb,OAAO,CAACN;YACV;QACF;IACF;IAEA,OAAO;QACL3G,MAAM,CAACF,MAAMuD;YACXpD,YAAYQ,GAAG,CACbX,MACAuD,UAAUnF,GAAG,CAACN,CAAAA,MAAQ,aAAKA;QAE/B;QACAsJ,MAAMpH,CAAAA,OAAQU,YAAYV,MAAM5B,GAAG,CAACN,CAAAA,MAAQ,aAAKA;QACjDuJ,UAAUxF,CAAAA;YACRrB,UAAUqB;QACZ;QACAyF,QAAQ,CAACC,WAAW1F;YAClBpB,oBAAoBE,GAAG,CAAC4G,WAAW1F;QACrC;QACA,IAAItB,cAAa;YACf,OAAOA;QACT;QACAqG;QACAY,IAAI;YAAE7H;QAAW;IACnB;AACF,EAAE"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@entifix/testing-unit",
-  "version": "0.1.1",
+  "version": "0.1.3",
   "description": "Test doubles for entifix: in-memory ports, driver fakes for Mongo, Redis, RabbitMQ and SQL, MSW handlers and port contract suites.",
   "license": "MIT",
   "repository": {
@@ -55,8 +55,6 @@
   },
   "nx": {
     "tags": [
-      "layer:entifix",
-      "scope:shared",
       "type:testing",
       "tier:5"
     ],
@@ -80,9 +78,9 @@
   "dependencies": {
     "@effect/sql": "0.52.1",
     "@swc/helpers": "0.5.23",
-    "@entifix/transactions": "0.1.1",
-    "@entifix/business": "0.1.1",
-    "@entifix/core": "0.1.1"
+    "@entifix/transactions": "0.1.3",
+    "@entifix/business": "0.1.3",
+    "@entifix/core": "0.1.3"
   },
   "peerDependencies": {
     "@effect/vitest": ">=0.30 <1",
@@ -91,7 +89,7 @@
     "msw": "*",
     "react": "*",
     "vitest": "*",
-    "@entifix/react-controls": "0.1.1"
+    "@entifix/react-controls": "0.1.3"
   },
   "peerDependenciesMeta": {
     "@effect/vitest": {