@entifix/testing-unit 0.1.1 → 0.1.2

package/dist/contracts/entity-repository.contract.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"entity-repository.contract.d.ts","sourceRoot":"","sources":["../../src/contracts/entity-repository.contract.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAY,KAAK,MAAM,EAAU,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC;AAM7E;;;;GAIG;AACH,qBACa,cAAe,YAAW,MAAM;;IAK3C,IACI,EAAE,IAAI,QAAQ,CAEjB;IACD,IAAI,EAAE,CAAC,KAAK,EAAE,QAAQ,EAErB;IAED,IACI,IAAI,IAAI,MAAM,GAAG,SAAS,CAE7B;IACD,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAEjC;IAED,IACI,IAAI,IAAI,MAAM,GAAG,SAAS,CAE7B;IACD,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAEjC;CACF;AAED,eAAO,MAAM,kBAAkB,GAC7B,IAAI,QAAQ,EACZ,MAAM,MAAM,EACZ,MAAM,MAAM,KACX,cAMF,CAAC;AAEF,MAAM,WAAW,+BAA+B;IAC9C;;;OAGG;IACH,cAAc,CACZ,IAAI,EAAE,cAAc,EAAE,GACrB,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;CACjD;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,gCAAgC,GAC3C,MAAM,MAAM,EACZ,oBAAoB,+BAA+B,KAClD,IAsMF,CAAC"}
+{"version":3,"file":"entity-repository.contract.d.ts","sourceRoot":"","sources":["../../src/contracts/entity-repository.contract.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAY,KAAK,MAAM,EAAU,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC;AAM7E;;;;GAIG;AACH,qBACa,cAAe,YAAW,MAAM;;IAK3C,IACI,EAAE,IAAI,QAAQ,CAEjB;IACD,IAAI,EAAE,CAAC,KAAK,EAAE,QAAQ,EAErB;IAED,IACI,IAAI,IAAI,MAAM,GAAG,SAAS,CAE7B;IACD,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAEjC;IAED,IACI,IAAI,IAAI,MAAM,GAAG,SAAS,CAE7B;IACD,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAEjC;CACF;AAED,eAAO,MAAM,kBAAkB,GAC7B,IAAI,QAAQ,EACZ,MAAM,MAAM,EACZ,MAAM,MAAM,KACX,cAMF,CAAC;AAEF,MAAM,WAAW,+BAA+B;IAC9C;;;OAGG;IACH,cAAc,CACZ,IAAI,EAAE,cAAc,EAAE,GACrB,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;CACjD;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,gCAAgC,GAC3C,MAAM,MAAM,EACZ,oBAAoB,+BAA+B,KAClD,IAwOF,CAAC"}

package/dist/contracts/entity-repository.contract.js

@@ -98,6 +98,28 @@ export const makeContractWidget = (id, name, size)=>{
         const withRepository = async (use, seed = seeded())=>{
             await use(await makeRepository(seed));
         };
+        it('keeps a record unchanged when a read instance is mutated without a save', async ()=>{
+            await withRepository(async (repository)=>{
+                const read = await runRepository(repository.get('w-1'));
+                read.name = 'Mutated';
+                const again = await runRepository(repository.get('w-1'));
+                expect(again.name).toBe('Alpha');
+                const page = await runRepository(repository.load({}));
+                page.items[0].name = 'Mutated';
+                const reloaded = await runRepository(repository.load({}));
+                expect(reloaded.items[0].name).toBe('Alpha');
+            });
+        });
+        it('keeps a saved record unchanged when the saved instance is mutated afterwards', async ()=>{
+            await withRepository(async (repository)=>{
+                const widget = makeContractWidget('w-9', 'Delta', 40);
+                const returned = await runRepository(repository.save(widget));
+                widget.name = 'Mutated';
+                returned.name = 'Mutated too';
+                const stored = await runRepository(repository.get('w-9'));
+                expect(stored.name).toBe('Delta');
+            });
+        });
         it('loads every stored entity with its total', async ()=>{
             await withRepository(async (repository)=>{
                 const page = await runRepository(repository.load({}));

package/dist/contracts/entity-repository.contract.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/contracts/entity-repository.contract.ts"],"sourcesContent":["import type { EntityRepository } from '@entifix/business';\nimport { accessor, type Entity, entity, type EntityId } from '@entifix/core';\nimport { Exit } from 'effect';\nimport { describe, expect, it } from 'vitest';\n\nimport { runRepository, runRepositoryExit } from '../effect/run.js';\n\n/**\n * The entity every implementation of the contract is exercised against. It is\n * declared here rather than by each caller so the suite controls exactly which\n * fields exist.\n */\n@entity({ key: 'contract-widget' })\nexport class ContractWidget implements Entity {\n  #id?: EntityId;\n  #name?: string;\n  #size?: number;\n\n  @accessor({ type: 'id' })\n  get id(): EntityId {\n    return this.#id;\n  }\n  set id(value: EntityId) {\n    this.#id = value;\n  }\n\n  @accessor({ type: 'string' })\n  get name(): string | undefined {\n    return this.#name;\n  }\n  set name(value: string | undefined) {\n    this.#name = value;\n  }\n\n  @accessor({ type: 'number' })\n  get size(): number | undefined {\n    return this.#size;\n  }\n  set size(value: number | undefined) {\n    this.#size = value;\n  }\n}\n\nexport const makeContractWidget = (\n  id: EntityId,\n  name: string,\n  size: number,\n): ContractWidget => {\n  const widget = new ContractWidget();\n  widget.id = id;\n  widget.name = name;\n  widget.size = size;\n  return widget;\n};\n\nexport interface EntityRepositoryContractOptions {\n  /**\n   * Builds a repository over `seed`. Called fresh for each test, so no state\n   * leaks between them.\n   */\n  makeRepository(\n    seed: ContractWidget[],\n  ): EntityRepository | Promise<EntityRepository>;\n}\n\n/**\n * The behaviour every {@link EntityRepository} must exhibit, regardless of what\n * backs it.\n *\n * Run it against the in-memory fake *and* against each real adapter. That is\n * what stops a fake from drifting into a more forgiving version of the thing it\n * stands in for — the failure mode where a suite is green and production is\n * not. `entifix-ts-testing-integration` will run this same suite against real\n * infrastructure later.\n */\nexport const describeEntityRepositoryContract = (\n  name: string,\n  { makeRepository }: EntityRepositoryContractOptions,\n): void => {\n  describe(`EntityRepository contract: ${name}`, () => {\n    const seeded = () => [\n      makeContractWidget('w-1', 'Alpha', 10),\n      makeContractWidget('w-2', 'Beta', 20),\n      makeContractWidget('w-3', 'Gamma', 30),\n    ];\n\n    const withRepository = async (\n      use: (repository: EntityRepository) => Promise<void>,\n      seed: ContractWidget[] = seeded(),\n    ) => {\n      await use(await makeRepository(seed));\n    };\n\n    it('loads every stored entity with its total', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(repository.load<ContractWidget>({}));\n\n        expect(page.total).toBe(3);\n        expect(page.items.map(item => item.name)).toEqual([\n          'Alpha',\n          'Beta',\n          'Gamma',\n        ]);\n      });\n    });\n\n    it('echoes the request it served on the page', async () => {\n      await withRepository(async repository => {\n        const request = { page: 1, pageSize: 2 };\n        const page = await runRepository(\n          repository.load<ContractWidget>(request),\n        );\n\n        expect(page.request).toEqual(request);\n      });\n    });\n\n    it('pages with a 1-based page number', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({ page: 2, pageSize: 2 }),\n        );\n\n        expect(page.items).toHaveLength(1);\n        expect(page.items[0]?.name).toBe('Gamma');\n        // The total counts matches, not the page.\n        expect(page.total).toBe(3);\n      });\n    });\n\n    it('filters by an equality operator', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            filtering: [{ property: 'name', operator: 'eq', value: 'Beta' }],\n          }),\n        );\n\n        expect(page.items).toHaveLength(1);\n        expect(page.items[0]?.id).toBe('w-2');\n        expect(page.total).toBe(1);\n      });\n    });\n\n    it('filters by a range operator', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            filtering: [\n              { property: 'size', operator: 'between', start: 15, end: 35 },\n            ],\n          }),\n        );\n\n        expect(page.items.map(item => item.id)).toEqual(['w-2', 'w-3']);\n      });\n    });\n\n    it('matches `like` case-insensitively on a substring', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            filtering: [{ property: 'name', operator: 'like', value: 'et' }],\n          }),\n        );\n\n        expect(page.items.map(item => item.id)).toEqual(['w-2']);\n      });\n    });\n\n    it('sorts descending when asked to', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            sorting: [{ 0: { property: 'size', type: 'desc' } }],\n          }),\n        );\n\n        expect(page.items.map(item => item.size)).toEqual([30, 20, 10]);\n      });\n    });\n\n    it('reads a single entity by id', async () => {\n      await withRepository(async repository => {\n        const found = await runRepository(\n          repository.get<ContractWidget>('w-2'),\n        );\n\n        expect(found.id).toBe('w-2');\n        expect(found.name).toBe('Beta');\n      });\n    });\n\n    it('fails rather than resolving undefined for an unknown id', async () => {\n      await withRepository(async repository => {\n        const exit = await runRepositoryExit(\n          repository.get<ContractWidget>('missing'),\n        );\n\n        expect(Exit.isFailure(exit)).toBe(true);\n      });\n    });\n\n    it('mints an id when saving an entity that has none', async () => {\n      await withRepository(async repository => {\n        const created = await runRepository(\n          repository.save<ContractWidget>(\n            makeContractWidget(undefined, 'Delta', 40),\n          ),\n        );\n\n        expect(created.id).toBeDefined();\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.total).toBe(4);\n      });\n    });\n\n    it('overwrites in place when saving an entity that already has an id', async () => {\n      await withRepository(async repository => {\n        await runRepository(\n          repository.save<ContractWidget>(\n            makeContractWidget('w-2', 'Renamed', 25),\n          ),\n        );\n\n        const found = await runRepository(\n          repository.get<ContractWidget>('w-2'),\n        );\n        expect(found.name).toBe('Renamed');\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.total).toBe(3);\n      });\n    });\n\n    it('deletes by id', async () => {\n      await withRepository(async repository => {\n        await runRepository(repository.delete<ContractWidget>('w-1'));\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.items.map(item => item.id)).toEqual(['w-2', 'w-3']);\n      });\n    });\n\n    it('deletes by entity', async () => {\n      await withRepository(async repository => {\n        await runRepository(\n          repository.delete<ContractWidget>(\n            makeContractWidget('w-3', 'Gamma', 30),\n          ),\n        );\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.items.map(item => item.id)).toEqual(['w-1', 'w-2']);\n      });\n    });\n\n    it('treats deleting an unknown id as a no-op', async () => {\n      await withRepository(async repository => {\n        await runRepository(repository.delete<ContractWidget>('missing'));\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.total).toBe(3);\n      });\n    });\n\n    it('loads an empty page from an empty store', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(repository.load<ContractWidget>({}));\n\n        expect(page.items).toEqual([]);\n        expect(page.total).toBe(0);\n      }, []);\n    });\n  });\n};\n"],"names":["accessor","entity","Exit","describe","expect","it","runRepository","runRepositoryExit","key","type","ContractWidget","id","value","name","size","makeContractWidget","widget","describeEntityRepositoryContract","makeRepository","seeded","withRepository","use","seed","repository","page","load","total","toBe","items","map","item","toEqual","request","pageSize","toHaveLength","filtering","property","operator","start","end","sorting","found","get","exit","isFailure","created","save","undefined","toBeDefined","delete"],"mappings":";;;;AACA,SAASA,QAAQ,EAAeC,MAAM,QAAuB,gBAAgB;AAC7E,SAASC,IAAI,QAAQ,SAAS;AAC9B,SAASC,QAAQ,EAAEC,MAAM,EAAEC,EAAE,QAAQ,SAAS;AAE9C,SAASC,aAAa,EAAEC,iBAAiB,QAAQ,mBAAmB;OAOnEN,OAAO;IAAEO,KAAK;AAAkB,YAM9BR,SAAS;IAAES,MAAM;AAAK,YAQtBT,SAAS;IAAES,MAAM;AAAS,YAQ1BT,SAAS;IAAES,MAAM;AAAS;;IApB3B,2DACA,+DACA;AAHK,IAAA,AAAMC,iBAAN,MAAMA;IAKX,IACIC,KAAe;QACjB,OAAO,gCAAA,IAAI,EAAC,KAAA;IACd;IACA,IAAIA,GAAGC,KAAe,EAAE;QACtB,gCAAA,IAAI,EAAC,KAAA,OAAMA;IACb;IAEA,IACIC,OAA2B;QAC7B,OAAO,gCAAA,IAAI,EAAC,OAAA;IACd;IACA,IAAIA,KAAKD,KAAyB,EAAE;QAClC,gCAAA,IAAI,EAAC,OAAA,SAAQA;IACf;IAEA,IACIE,OAA2B;QAC7B,OAAO,gCAAA,IAAI,EAAC,OAAA;IACd;IACA,IAAIA,KAAKF,KAAyB,EAAE;QAClC,gCAAA,IAAI,EAAC,OAAA,SAAQA;IACf;;QA1BA,4BAAA;;mBAAA,KAAA;;QACA,4BAAA;;mBAAA,KAAA;;QACA,4BAAA;;mBAAA,KAAA;;;;AAyBF;4EA5BaF;;;;QAMPC;;;;;QAQAE;;;;;QAQAC;;;;;;AAQN,OAAO,MAAMC,qBAAqB,CAChCJ,IACAE,MACAC;IAEA,MAAME,SAAS,IAAIN;IACnBM,OAAOL,EAAE,GAAGA;IACZK,OAAOH,IAAI,GAAGA;IACdG,OAAOF,IAAI,GAAGA;IACd,OAAOE;AACT,EAAE;AAYF;;;;;;;;;CASC,GACD,OAAO,MAAMC,mCAAmC,CAC9CJ,MACA,EAAEK,cAAc,EAAmC;IAEnDf,SAAS,CAAC,2BAA2B,EAAEU,MAAM,EAAE;QAC7C,MAAMM,SAAS,IAAM;gBACnBJ,mBAAmB,OAAO,SAAS;gBACnCA,mBAAmB,OAAO,QAAQ;gBAClCA,mBAAmB,OAAO,SAAS;aACpC;QAED,MAAMK,iBAAiB,OACrBC,KACAC,OAAyBH,QAAQ;YAEjC,MAAME,IAAI,MAAMH,eAAeI;QACjC;QAEAjB,GAAG,4CAA4C;YAC7C,MAAMe,eAAe,OAAMG;gBACzB,MAAMC,OAAO,MAAMlB,cAAciB,WAAWE,IAAI,CAAiB,CAAC;gBAElErB,OAAOoB,KAAKE,KAAK,EAAEC,IAAI,CAAC;gBACxBvB,OAAOoB,KAAKI,KAAK,CAACC,GAAG,CAACC,CAAAA,OAAQA,KAAKjB,IAAI,GAAGkB,OAAO,CAAC;oBAChD;oBACA;oBACA;iBACD;YACH;QACF;QAEA1B,GAAG,4CAA4C;YAC7C,MAAMe,eAAe,OAAMG;gBACzB,MAAMS,UAAU;oBAAER,MAAM;oBAAGS,UAAU;gBAAE;gBACvC,MAAMT,OAAO,MAAMlB,cACjBiB,WAAWE,IAAI,CAAiBO;gBAGlC5B,OAAOoB,KAAKQ,OAAO,EAAED,OAAO,CAACC;YAC/B;QACF;QAEA3B,GAAG,oCAAoC;YACrC,MAAMe,eAAe,OAAMG;oBAMlBC;gBALP,MAAMA,OAAO,MAAMlB,cACjBiB,WAAWE,IAAI,CAAiB;oBAAED,MAAM;oBAAGS,UAAU;gBAAE;gBAGzD7B,OAAOoB,KAAKI,KAAK,EAAEM,YAAY,CAAC;gBAChC9B,QAAOoB,eAAAA,KAAKI,KAAK,CAAC,EAAE,qBAAbJ,aAAeX,IAAI,EAAEc,IAAI,CAAC;gBACjC,0CAA0C;gBAC1CvB,OAAOoB,KAAKE,KAAK,EAAEC,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,mCAAmC;YACpC,MAAMe,eAAe,OAAMG;oBAQlBC;gBAPP,MAAMA,OAAO,MAAMlB,cACjBiB,WAAWE,IAAI,CAAiB;oBAC9BU,WAAW;wBAAC;4BAAEC,UAAU;4BAAQC,UAAU;4BAAMzB,OAAO;wBAAO;qBAAE;gBAClE;gBAGFR,OAAOoB,KAAKI,KAAK,EAAEM,YAAY,CAAC;gBAChC9B,QAAOoB,eAAAA,KAAKI,KAAK,CAAC,EAAE,qBAAbJ,aAAeb,EAAE,EAAEgB,IAAI,CAAC;gBAC/BvB,OAAOoB,KAAKE,KAAK,EAAEC,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,+BAA+B;YAChC,MAAMe,eAAe,OAAMG;gBACzB,MAAMC,OAAO,MAAMlB,cACjBiB,WAAWE,IAAI,CAAiB;oBAC9BU,WAAW;wBACT;4BAAEC,UAAU;4BAAQC,UAAU;4BAAWC,OAAO;4BAAIC,KAAK;wBAAG;qBAC7D;gBACH;gBAGFnC,OAAOoB,KAAKI,KAAK,CAACC,GAAG,CAACC,CAAAA,OAAQA,KAAKnB,EAAE,GAAGoB,OAAO,CAAC;oBAAC;oBAAO;iBAAM;YAChE;QACF;QAEA1B,GAAG,oDAAoD;YACrD,MAAMe,eAAe,OAAMG;gBACzB,MAAMC,OAAO,MAAMlB,cACjBiB,WAAWE,IAAI,CAAiB;oBAC9BU,WAAW;wBAAC;4BAAEC,UAAU;4BAAQC,UAAU;4BAAQzB,OAAO;wBAAK;qBAAE;gBAClE;gBAGFR,OAAOoB,KAAKI,KAAK,CAACC,GAAG,CAACC,CAAAA,OAAQA,KAAKnB,EAAE,GAAGoB,OAAO,CAAC;oBAAC;iBAAM;YACzD;QACF;QAEA1B,GAAG,kCAAkC;YACnC,MAAMe,eAAe,OAAMG;gBACzB,MAAMC,OAAO,MAAMlB,cACjBiB,WAAWE,IAAI,CAAiB;oBAC9Be,SAAS;wBAAC;4BAAE,GAAG;gCAAEJ,UAAU;gCAAQ3B,MAAM;4BAAO;wBAAE;qBAAE;gBACtD;gBAGFL,OAAOoB,KAAKI,KAAK,CAACC,GAAG,CAACC,CAAAA,OAAQA,KAAKhB,IAAI,GAAGiB,OAAO,CAAC;oBAAC;oBAAI;oBAAI;iBAAG;YAChE;QACF;QAEA1B,GAAG,+BAA+B;YAChC,MAAMe,eAAe,OAAMG;gBACzB,MAAMkB,QAAQ,MAAMnC,cAClBiB,WAAWmB,GAAG,CAAiB;gBAGjCtC,OAAOqC,MAAM9B,EAAE,EAAEgB,IAAI,CAAC;gBACtBvB,OAAOqC,MAAM5B,IAAI,EAAEc,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,2DAA2D;YAC5D,MAAMe,eAAe,OAAMG;gBACzB,MAAMoB,OAAO,MAAMpC,kBACjBgB,WAAWmB,GAAG,CAAiB;gBAGjCtC,OAAOF,KAAK0C,SAAS,CAACD,OAAOhB,IAAI,CAAC;YACpC;QACF;QAEAtB,GAAG,mDAAmD;YACpD,MAAMe,eAAe,OAAMG;gBACzB,MAAMsB,UAAU,MAAMvC,cACpBiB,WAAWuB,IAAI,CACb/B,mBAAmBgC,WAAW,SAAS;gBAI3C3C,OAAOyC,QAAQlC,EAAE,EAAEqC,WAAW;gBAE9B,MAAMxB,OAAO,MAAMlB,cAAciB,WAAWE,IAAI,CAAiB,CAAC;gBAClErB,OAAOoB,KAAKE,KAAK,EAAEC,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,oEAAoE;YACrE,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cACJiB,WAAWuB,IAAI,CACb/B,mBAAmB,OAAO,WAAW;gBAIzC,MAAM0B,QAAQ,MAAMnC,cAClBiB,WAAWmB,GAAG,CAAiB;gBAEjCtC,OAAOqC,MAAM5B,IAAI,EAAEc,IAAI,CAAC;gBAExB,MAAMH,OAAO,MAAMlB,cAAciB,WAAWE,IAAI,CAAiB,CAAC;gBAClErB,OAAOoB,KAAKE,KAAK,EAAEC,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,iBAAiB;YAClB,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cAAciB,WAAW0B,MAAM,CAAiB;gBAEtD,MAAMzB,OAAO,MAAMlB,cAAciB,WAAWE,IAAI,CAAiB,CAAC;gBAClErB,OAAOoB,KAAKI,KAAK,CAACC,GAAG,CAACC,CAAAA,OAAQA,KAAKnB,EAAE,GAAGoB,OAAO,CAAC;oBAAC;oBAAO;iBAAM;YAChE;QACF;QAEA1B,GAAG,qBAAqB;YACtB,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cACJiB,WAAW0B,MAAM,CACflC,mBAAmB,OAAO,SAAS;gBAIvC,MAAMS,OAAO,MAAMlB,cAAciB,WAAWE,IAAI,CAAiB,CAAC;gBAClErB,OAAOoB,KAAKI,KAAK,CAACC,GAAG,CAACC,CAAAA,OAAQA,KAAKnB,EAAE,GAAGoB,OAAO,CAAC;oBAAC;oBAAO;iBAAM;YAChE;QACF;QAEA1B,GAAG,4CAA4C;YAC7C,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cAAciB,WAAW0B,MAAM,CAAiB;gBAEtD,MAAMzB,OAAO,MAAMlB,cAAciB,WAAWE,IAAI,CAAiB,CAAC;gBAClErB,OAAOoB,KAAKE,KAAK,EAAEC,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,2CAA2C;YAC5C,MAAMe,eAAe,OAAMG;gBACzB,MAAMC,OAAO,MAAMlB,cAAciB,WAAWE,IAAI,CAAiB,CAAC;gBAElErB,OAAOoB,KAAKI,KAAK,EAAEG,OAAO,CAAC,EAAE;gBAC7B3B,OAAOoB,KAAKE,KAAK,EAAEC,IAAI,CAAC;YAC1B,GAAG,EAAE;QACP;IACF;AACF,EAAE;SAvQF,AAAajB,mBAAAA,cA4BZ"}
+{"version":3,"sources":["../../src/contracts/entity-repository.contract.ts"],"sourcesContent":["import type { EntityRepository } from '@entifix/business';\nimport { accessor, type Entity, entity, type EntityId } from '@entifix/core';\nimport { Exit } from 'effect';\nimport { describe, expect, it } from 'vitest';\n\nimport { runRepository, runRepositoryExit } from '../effect/run.js';\n\n/**\n * The entity every implementation of the contract is exercised against. It is\n * declared here rather than by each caller so the suite controls exactly which\n * fields exist.\n */\n@entity({ key: 'contract-widget' })\nexport class ContractWidget implements Entity {\n  #id?: EntityId;\n  #name?: string;\n  #size?: number;\n\n  @accessor({ type: 'id' })\n  get id(): EntityId {\n    return this.#id;\n  }\n  set id(value: EntityId) {\n    this.#id = value;\n  }\n\n  @accessor({ type: 'string' })\n  get name(): string | undefined {\n    return this.#name;\n  }\n  set name(value: string | undefined) {\n    this.#name = value;\n  }\n\n  @accessor({ type: 'number' })\n  get size(): number | undefined {\n    return this.#size;\n  }\n  set size(value: number | undefined) {\n    this.#size = value;\n  }\n}\n\nexport const makeContractWidget = (\n  id: EntityId,\n  name: string,\n  size: number,\n): ContractWidget => {\n  const widget = new ContractWidget();\n  widget.id = id;\n  widget.name = name;\n  widget.size = size;\n  return widget;\n};\n\nexport interface EntityRepositoryContractOptions {\n  /**\n   * Builds a repository over `seed`. Called fresh for each test, so no state\n   * leaks between them.\n   */\n  makeRepository(\n    seed: ContractWidget[],\n  ): EntityRepository | Promise<EntityRepository>;\n}\n\n/**\n * The behaviour every {@link EntityRepository} must exhibit, regardless of what\n * backs it.\n *\n * Run it against the in-memory fake *and* against each real adapter. That is\n * what stops a fake from drifting into a more forgiving version of the thing it\n * stands in for — the failure mode where a suite is green and production is\n * not. `entifix-ts-testing-integration` will run this same suite against real\n * infrastructure later.\n */\nexport const describeEntityRepositoryContract = (\n  name: string,\n  { makeRepository }: EntityRepositoryContractOptions,\n): void => {\n  describe(`EntityRepository contract: ${name}`, () => {\n    const seeded = () => [\n      makeContractWidget('w-1', 'Alpha', 10),\n      makeContractWidget('w-2', 'Beta', 20),\n      makeContractWidget('w-3', 'Gamma', 30),\n    ];\n\n    const withRepository = async (\n      use: (repository: EntityRepository) => Promise<void>,\n      seed: ContractWidget[] = seeded(),\n    ) => {\n      await use(await makeRepository(seed));\n    };\n\n    it('keeps a record unchanged when a read instance is mutated without a save', async () => {\n      await withRepository(async repository => {\n        const read = await runRepository(repository.get<ContractWidget>('w-1'));\n        read.name = 'Mutated';\n\n        const again = await runRepository(\n          repository.get<ContractWidget>('w-1'),\n        );\n        expect(again.name).toBe('Alpha');\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        page.items[0]!.name = 'Mutated';\n        const reloaded = await runRepository(\n          repository.load<ContractWidget>({}),\n        );\n        expect(reloaded.items[0]!.name).toBe('Alpha');\n      });\n    });\n\n    it('keeps a saved record unchanged when the saved instance is mutated afterwards', async () => {\n      await withRepository(async repository => {\n        const widget = makeContractWidget('w-9', 'Delta', 40);\n        const returned = await runRepository(repository.save(widget));\n\n        widget.name = 'Mutated';\n        returned.name = 'Mutated too';\n\n        const stored = await runRepository(\n          repository.get<ContractWidget>('w-9'),\n        );\n        expect(stored.name).toBe('Delta');\n      });\n    });\n\n    it('loads every stored entity with its total', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(repository.load<ContractWidget>({}));\n\n        expect(page.total).toBe(3);\n        expect(page.items.map(item => item.name)).toEqual([\n          'Alpha',\n          'Beta',\n          'Gamma',\n        ]);\n      });\n    });\n\n    it('echoes the request it served on the page', async () => {\n      await withRepository(async repository => {\n        const request = { page: 1, pageSize: 2 };\n        const page = await runRepository(\n          repository.load<ContractWidget>(request),\n        );\n\n        expect(page.request).toEqual(request);\n      });\n    });\n\n    it('pages with a 1-based page number', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({ page: 2, pageSize: 2 }),\n        );\n\n        expect(page.items).toHaveLength(1);\n        expect(page.items[0]?.name).toBe('Gamma');\n        // The total counts matches, not the page.\n        expect(page.total).toBe(3);\n      });\n    });\n\n    it('filters by an equality operator', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            filtering: [{ property: 'name', operator: 'eq', value: 'Beta' }],\n          }),\n        );\n\n        expect(page.items).toHaveLength(1);\n        expect(page.items[0]?.id).toBe('w-2');\n        expect(page.total).toBe(1);\n      });\n    });\n\n    it('filters by a range operator', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            filtering: [\n              { property: 'size', operator: 'between', start: 15, end: 35 },\n            ],\n          }),\n        );\n\n        expect(page.items.map(item => item.id)).toEqual(['w-2', 'w-3']);\n      });\n    });\n\n    it('matches `like` case-insensitively on a substring', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            filtering: [{ property: 'name', operator: 'like', value: 'et' }],\n          }),\n        );\n\n        expect(page.items.map(item => item.id)).toEqual(['w-2']);\n      });\n    });\n\n    it('sorts descending when asked to', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(\n          repository.load<ContractWidget>({\n            sorting: [{ 0: { property: 'size', type: 'desc' } }],\n          }),\n        );\n\n        expect(page.items.map(item => item.size)).toEqual([30, 20, 10]);\n      });\n    });\n\n    it('reads a single entity by id', async () => {\n      await withRepository(async repository => {\n        const found = await runRepository(\n          repository.get<ContractWidget>('w-2'),\n        );\n\n        expect(found.id).toBe('w-2');\n        expect(found.name).toBe('Beta');\n      });\n    });\n\n    it('fails rather than resolving undefined for an unknown id', async () => {\n      await withRepository(async repository => {\n        const exit = await runRepositoryExit(\n          repository.get<ContractWidget>('missing'),\n        );\n\n        expect(Exit.isFailure(exit)).toBe(true);\n      });\n    });\n\n    it('mints an id when saving an entity that has none', async () => {\n      await withRepository(async repository => {\n        const created = await runRepository(\n          repository.save<ContractWidget>(\n            makeContractWidget(undefined, 'Delta', 40),\n          ),\n        );\n\n        expect(created.id).toBeDefined();\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.total).toBe(4);\n      });\n    });\n\n    it('overwrites in place when saving an entity that already has an id', async () => {\n      await withRepository(async repository => {\n        await runRepository(\n          repository.save<ContractWidget>(\n            makeContractWidget('w-2', 'Renamed', 25),\n          ),\n        );\n\n        const found = await runRepository(\n          repository.get<ContractWidget>('w-2'),\n        );\n        expect(found.name).toBe('Renamed');\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.total).toBe(3);\n      });\n    });\n\n    it('deletes by id', async () => {\n      await withRepository(async repository => {\n        await runRepository(repository.delete<ContractWidget>('w-1'));\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.items.map(item => item.id)).toEqual(['w-2', 'w-3']);\n      });\n    });\n\n    it('deletes by entity', async () => {\n      await withRepository(async repository => {\n        await runRepository(\n          repository.delete<ContractWidget>(\n            makeContractWidget('w-3', 'Gamma', 30),\n          ),\n        );\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.items.map(item => item.id)).toEqual(['w-1', 'w-2']);\n      });\n    });\n\n    it('treats deleting an unknown id as a no-op', async () => {\n      await withRepository(async repository => {\n        await runRepository(repository.delete<ContractWidget>('missing'));\n\n        const page = await runRepository(repository.load<ContractWidget>({}));\n        expect(page.total).toBe(3);\n      });\n    });\n\n    it('loads an empty page from an empty store', async () => {\n      await withRepository(async repository => {\n        const page = await runRepository(repository.load<ContractWidget>({}));\n\n        expect(page.items).toEqual([]);\n        expect(page.total).toBe(0);\n      }, []);\n    });\n  });\n};\n"],"names":["accessor","entity","Exit","describe","expect","it","runRepository","runRepositoryExit","key","type","ContractWidget","id","value","name","size","makeContractWidget","widget","describeEntityRepositoryContract","makeRepository","seeded","withRepository","use","seed","repository","read","get","again","toBe","page","load","items","reloaded","returned","save","stored","total","map","item","toEqual","request","pageSize","toHaveLength","filtering","property","operator","start","end","sorting","found","exit","isFailure","created","undefined","toBeDefined","delete"],"mappings":";;;;AACA,SAASA,QAAQ,EAAeC,MAAM,QAAuB,gBAAgB;AAC7E,SAASC,IAAI,QAAQ,SAAS;AAC9B,SAASC,QAAQ,EAAEC,MAAM,EAAEC,EAAE,QAAQ,SAAS;AAE9C,SAASC,aAAa,EAAEC,iBAAiB,QAAQ,mBAAmB;OAOnEN,OAAO;IAAEO,KAAK;AAAkB,YAM9BR,SAAS;IAAES,MAAM;AAAK,YAQtBT,SAAS;IAAES,MAAM;AAAS,YAQ1BT,SAAS;IAAES,MAAM;AAAS;;IApB3B,2DACA,+DACA;AAHK,IAAA,AAAMC,iBAAN,MAAMA;IAKX,IACIC,KAAe;QACjB,OAAO,gCAAA,IAAI,EAAC,KAAA;IACd;IACA,IAAIA,GAAGC,KAAe,EAAE;QACtB,gCAAA,IAAI,EAAC,KAAA,OAAMA;IACb;IAEA,IACIC,OAA2B;QAC7B,OAAO,gCAAA,IAAI,EAAC,OAAA;IACd;IACA,IAAIA,KAAKD,KAAyB,EAAE;QAClC,gCAAA,IAAI,EAAC,OAAA,SAAQA;IACf;IAEA,IACIE,OAA2B;QAC7B,OAAO,gCAAA,IAAI,EAAC,OAAA;IACd;IACA,IAAIA,KAAKF,KAAyB,EAAE;QAClC,gCAAA,IAAI,EAAC,OAAA,SAAQA;IACf;;QA1BA,4BAAA;;mBAAA,KAAA;;QACA,4BAAA;;mBAAA,KAAA;;QACA,4BAAA;;mBAAA,KAAA;;;;AAyBF;4EA5BaF;;;;QAMPC;;;;;QAQAE;;;;;QAQAC;;;;;;AAQN,OAAO,MAAMC,qBAAqB,CAChCJ,IACAE,MACAC;IAEA,MAAME,SAAS,IAAIN;IACnBM,OAAOL,EAAE,GAAGA;IACZK,OAAOH,IAAI,GAAGA;IACdG,OAAOF,IAAI,GAAGA;IACd,OAAOE;AACT,EAAE;AAYF;;;;;;;;;CASC,GACD,OAAO,MAAMC,mCAAmC,CAC9CJ,MACA,EAAEK,cAAc,EAAmC;IAEnDf,SAAS,CAAC,2BAA2B,EAAEU,MAAM,EAAE;QAC7C,MAAMM,SAAS,IAAM;gBACnBJ,mBAAmB,OAAO,SAAS;gBACnCA,mBAAmB,OAAO,QAAQ;gBAClCA,mBAAmB,OAAO,SAAS;aACpC;QAED,MAAMK,iBAAiB,OACrBC,KACAC,OAAyBH,QAAQ;YAEjC,MAAME,IAAI,MAAMH,eAAeI;QACjC;QAEAjB,GAAG,2EAA2E;YAC5E,MAAMe,eAAe,OAAMG;gBACzB,MAAMC,OAAO,MAAMlB,cAAciB,WAAWE,GAAG,CAAiB;gBAChED,KAAKX,IAAI,GAAG;gBAEZ,MAAMa,QAAQ,MAAMpB,cAClBiB,WAAWE,GAAG,CAAiB;gBAEjCrB,OAAOsB,MAAMb,IAAI,EAAEc,IAAI,CAAC;gBAExB,MAAMC,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAClED,KAAKE,KAAK,CAAC,EAAE,CAAEjB,IAAI,GAAG;gBACtB,MAAMkB,WAAW,MAAMzB,cACrBiB,WAAWM,IAAI,CAAiB,CAAC;gBAEnCzB,OAAO2B,SAASD,KAAK,CAAC,EAAE,CAAEjB,IAAI,EAAEc,IAAI,CAAC;YACvC;QACF;QAEAtB,GAAG,gFAAgF;YACjF,MAAMe,eAAe,OAAMG;gBACzB,MAAMP,SAASD,mBAAmB,OAAO,SAAS;gBAClD,MAAMiB,WAAW,MAAM1B,cAAciB,WAAWU,IAAI,CAACjB;gBAErDA,OAAOH,IAAI,GAAG;gBACdmB,SAASnB,IAAI,GAAG;gBAEhB,MAAMqB,SAAS,MAAM5B,cACnBiB,WAAWE,GAAG,CAAiB;gBAEjCrB,OAAO8B,OAAOrB,IAAI,EAAEc,IAAI,CAAC;YAC3B;QACF;QAEAtB,GAAG,4CAA4C;YAC7C,MAAMe,eAAe,OAAMG;gBACzB,MAAMK,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAElEzB,OAAOwB,KAAKO,KAAK,EAAER,IAAI,CAAC;gBACxBvB,OAAOwB,KAAKE,KAAK,CAACM,GAAG,CAACC,CAAAA,OAAQA,KAAKxB,IAAI,GAAGyB,OAAO,CAAC;oBAChD;oBACA;oBACA;iBACD;YACH;QACF;QAEAjC,GAAG,4CAA4C;YAC7C,MAAMe,eAAe,OAAMG;gBACzB,MAAMgB,UAAU;oBAAEX,MAAM;oBAAGY,UAAU;gBAAE;gBACvC,MAAMZ,OAAO,MAAMtB,cACjBiB,WAAWM,IAAI,CAAiBU;gBAGlCnC,OAAOwB,KAAKW,OAAO,EAAED,OAAO,CAACC;YAC/B;QACF;QAEAlC,GAAG,oCAAoC;YACrC,MAAMe,eAAe,OAAMG;oBAMlBK;gBALP,MAAMA,OAAO,MAAMtB,cACjBiB,WAAWM,IAAI,CAAiB;oBAAED,MAAM;oBAAGY,UAAU;gBAAE;gBAGzDpC,OAAOwB,KAAKE,KAAK,EAAEW,YAAY,CAAC;gBAChCrC,QAAOwB,eAAAA,KAAKE,KAAK,CAAC,EAAE,qBAAbF,aAAef,IAAI,EAAEc,IAAI,CAAC;gBACjC,0CAA0C;gBAC1CvB,OAAOwB,KAAKO,KAAK,EAAER,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,mCAAmC;YACpC,MAAMe,eAAe,OAAMG;oBAQlBK;gBAPP,MAAMA,OAAO,MAAMtB,cACjBiB,WAAWM,IAAI,CAAiB;oBAC9Ba,WAAW;wBAAC;4BAAEC,UAAU;4BAAQC,UAAU;4BAAMhC,OAAO;wBAAO;qBAAE;gBAClE;gBAGFR,OAAOwB,KAAKE,KAAK,EAAEW,YAAY,CAAC;gBAChCrC,QAAOwB,eAAAA,KAAKE,KAAK,CAAC,EAAE,qBAAbF,aAAejB,EAAE,EAAEgB,IAAI,CAAC;gBAC/BvB,OAAOwB,KAAKO,KAAK,EAAER,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,+BAA+B;YAChC,MAAMe,eAAe,OAAMG;gBACzB,MAAMK,OAAO,MAAMtB,cACjBiB,WAAWM,IAAI,CAAiB;oBAC9Ba,WAAW;wBACT;4BAAEC,UAAU;4BAAQC,UAAU;4BAAWC,OAAO;4BAAIC,KAAK;wBAAG;qBAC7D;gBACH;gBAGF1C,OAAOwB,KAAKE,KAAK,CAACM,GAAG,CAACC,CAAAA,OAAQA,KAAK1B,EAAE,GAAG2B,OAAO,CAAC;oBAAC;oBAAO;iBAAM;YAChE;QACF;QAEAjC,GAAG,oDAAoD;YACrD,MAAMe,eAAe,OAAMG;gBACzB,MAAMK,OAAO,MAAMtB,cACjBiB,WAAWM,IAAI,CAAiB;oBAC9Ba,WAAW;wBAAC;4BAAEC,UAAU;4BAAQC,UAAU;4BAAQhC,OAAO;wBAAK;qBAAE;gBAClE;gBAGFR,OAAOwB,KAAKE,KAAK,CAACM,GAAG,CAACC,CAAAA,OAAQA,KAAK1B,EAAE,GAAG2B,OAAO,CAAC;oBAAC;iBAAM;YACzD;QACF;QAEAjC,GAAG,kCAAkC;YACnC,MAAMe,eAAe,OAAMG;gBACzB,MAAMK,OAAO,MAAMtB,cACjBiB,WAAWM,IAAI,CAAiB;oBAC9BkB,SAAS;wBAAC;4BAAE,GAAG;gCAAEJ,UAAU;gCAAQlC,MAAM;4BAAO;wBAAE;qBAAE;gBACtD;gBAGFL,OAAOwB,KAAKE,KAAK,CAACM,GAAG,CAACC,CAAAA,OAAQA,KAAKvB,IAAI,GAAGwB,OAAO,CAAC;oBAAC;oBAAI;oBAAI;iBAAG;YAChE;QACF;QAEAjC,GAAG,+BAA+B;YAChC,MAAMe,eAAe,OAAMG;gBACzB,MAAMyB,QAAQ,MAAM1C,cAClBiB,WAAWE,GAAG,CAAiB;gBAGjCrB,OAAO4C,MAAMrC,EAAE,EAAEgB,IAAI,CAAC;gBACtBvB,OAAO4C,MAAMnC,IAAI,EAAEc,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,2DAA2D;YAC5D,MAAMe,eAAe,OAAMG;gBACzB,MAAM0B,OAAO,MAAM1C,kBACjBgB,WAAWE,GAAG,CAAiB;gBAGjCrB,OAAOF,KAAKgD,SAAS,CAACD,OAAOtB,IAAI,CAAC;YACpC;QACF;QAEAtB,GAAG,mDAAmD;YACpD,MAAMe,eAAe,OAAMG;gBACzB,MAAM4B,UAAU,MAAM7C,cACpBiB,WAAWU,IAAI,CACblB,mBAAmBqC,WAAW,SAAS;gBAI3ChD,OAAO+C,QAAQxC,EAAE,EAAE0C,WAAW;gBAE9B,MAAMzB,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAClEzB,OAAOwB,KAAKO,KAAK,EAAER,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,oEAAoE;YACrE,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cACJiB,WAAWU,IAAI,CACblB,mBAAmB,OAAO,WAAW;gBAIzC,MAAMiC,QAAQ,MAAM1C,cAClBiB,WAAWE,GAAG,CAAiB;gBAEjCrB,OAAO4C,MAAMnC,IAAI,EAAEc,IAAI,CAAC;gBAExB,MAAMC,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAClEzB,OAAOwB,KAAKO,KAAK,EAAER,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,iBAAiB;YAClB,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cAAciB,WAAW+B,MAAM,CAAiB;gBAEtD,MAAM1B,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAClEzB,OAAOwB,KAAKE,KAAK,CAACM,GAAG,CAACC,CAAAA,OAAQA,KAAK1B,EAAE,GAAG2B,OAAO,CAAC;oBAAC;oBAAO;iBAAM;YAChE;QACF;QAEAjC,GAAG,qBAAqB;YACtB,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cACJiB,WAAW+B,MAAM,CACfvC,mBAAmB,OAAO,SAAS;gBAIvC,MAAMa,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAClEzB,OAAOwB,KAAKE,KAAK,CAACM,GAAG,CAACC,CAAAA,OAAQA,KAAK1B,EAAE,GAAG2B,OAAO,CAAC;oBAAC;oBAAO;iBAAM;YAChE;QACF;QAEAjC,GAAG,4CAA4C;YAC7C,MAAMe,eAAe,OAAMG;gBACzB,MAAMjB,cAAciB,WAAW+B,MAAM,CAAiB;gBAEtD,MAAM1B,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAClEzB,OAAOwB,KAAKO,KAAK,EAAER,IAAI,CAAC;YAC1B;QACF;QAEAtB,GAAG,2CAA2C;YAC5C,MAAMe,eAAe,OAAMG;gBACzB,MAAMK,OAAO,MAAMtB,cAAciB,WAAWM,IAAI,CAAiB,CAAC;gBAElEzB,OAAOwB,KAAKE,KAAK,EAAEQ,OAAO,CAAC,EAAE;gBAC7BlC,OAAOwB,KAAKO,KAAK,EAAER,IAAI,CAAC;YAC1B,GAAG,EAAE;QACP;IACF;AACF,EAAE;SAzSF,AAAajB,mBAAAA,cA4BZ"}

package/dist/contracts/index.d.ts

@@ -1,3 +1,4 @@
 export * from './entity-repository.contract.js';
+export * from './saga-store.contract.js';
 export * from './transaction-ports.contract.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/contracts/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/contracts/index.ts"],"names":[],"mappings":"AAAA,cAAc,iCAAiC,CAAC;AAChD,cAAc,iCAAiC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/contracts/index.ts"],"names":[],"mappings":"AAAA,cAAc,iCAAiC,CAAC;AAChD,cAAc,0BAA0B,CAAC;AACzC,cAAc,iCAAiC,CAAC"}

package/dist/contracts/index.js

@@ -1,4 +1,5 @@
 export * from './entity-repository.contract.js';
+export * from './saga-store.contract.js';
 export * from './transaction-ports.contract.js';
 
 //# sourceMappingURL=index.js.map

package/dist/contracts/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/contracts/index.ts"],"sourcesContent":["export * from './entity-repository.contract.js';\nexport * from './transaction-ports.contract.js';\n"],"names":[],"mappings":"AAAA,cAAc,kCAAkC;AAChD,cAAc,kCAAkC"}
+{"version":3,"sources":["../../src/contracts/index.ts"],"sourcesContent":["export * from './entity-repository.contract.js';\nexport * from './saga-store.contract.js';\nexport * from './transaction-ports.contract.js';\n"],"names":[],"mappings":"AAAA,cAAc,kCAAkC;AAChD,cAAc,2BAA2B;AACzC,cAAc,kCAAkC"}

package/dist/contracts/saga-store.contract.d.ts

@@ -0,0 +1,13 @@
+import type { SagaStore } from '@entifix/transactions';
+/**
+ * What every {@link SagaStore} must guarantee to the saga engine: an instance
+ * that can be started twice without being overwritten, outcomes that append in
+ * arrival order, a compensation flag that lands on one step, and a resume claim
+ * that only ever takes an unfinished instance past its deadline.
+ *
+ * Deliberately not asserted: two concurrent claims producing one winner. That
+ * is a property of the conditional write against a real server, and a contract
+ * run in one process cannot interleave the two.
+ */
+export declare const describeSagaStoreContract: (name: string, makeStore: () => SagaStore | Promise<SagaStore>) => void;
+//# sourceMappingURL=saga-store.contract.d.ts.map

package/dist/contracts/saga-store.contract.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"saga-store.contract.d.ts","sourceRoot":"","sources":["../../src/contracts/saga-store.contract.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAGV,SAAS,EACV,MAAM,uBAAuB,CAAC;AA6B/B;;;;;;;;;GASG;AACH,eAAO,MAAM,yBAAyB,GACpC,MAAM,MAAM,EACZ,WAAW,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,KAC9C,IAiHF,CAAC"}

package/dist/contracts/saga-store.contract.js

@@ -0,0 +1,142 @@
+import { _ as _extends } from "@swc/helpers/_/_extends";
+import { Effect } from 'effect';
+import { describe, expect, it } from 'vitest';
+const run = (effect)=>Effect.runPromise(effect);
+/** A threshold every instance is older than, so no spec waits on a clock. */ const ANY_AGE = -60000;
+/** A threshold no instance just written is older than. */ const AN_HOUR = 3600000;
+const instance = (sagaId, over = {})=>_extends({
+        sagaId,
+        definition: 'contract-flow',
+        state: 'RUNNING',
+        stepIndex: 0,
+        outcomes: [],
+        inputs: {},
+        resumeAttempts: 0,
+        createdAt: new Date().toISOString()
+    }, over);
+const outcome = (stepId)=>({
+        stepId,
+        calls: []
+    });
+/**
+ * What every {@link SagaStore} must guarantee to the saga engine: an instance
+ * that can be started twice without being overwritten, outcomes that append in
+ * arrival order, a compensation flag that lands on one step, and a resume claim
+ * that only ever takes an unfinished instance past its deadline.
+ *
+ * Deliberately not asserted: two concurrent claims producing one winner. That
+ * is a property of the conditional write against a real server, and a contract
+ * run in one process cannot interleave the two.
+ */ export const describeSagaStoreContract = (name, makeStore)=>{
+    describe(`SagaStore contract: ${name}`, ()=>{
+        it('starts an instance and reads it back, stamped', async ()=>{
+            const store = await makeStore();
+            await run(store.start(instance('s-1')));
+            const read = await run(store.get('s-1'));
+            expect(read).toMatchObject({
+                sagaId: 's-1',
+                state: 'RUNNING'
+            });
+            expect(read == null ? void 0 : read.updatedAt).toEqual(expect.any(String));
+        });
+        it('answers undefined for an instance it never started', async ()=>{
+            const store = await makeStore();
+            expect(await run(store.get('absent'))).toBeUndefined();
+        });
+        // A coordinator restarted mid-flight re-enters `start` with an id it
+        // already wrote; what it had recorded must survive that.
+        it('does not overwrite an instance started twice', async ()=>{
+            const store = await makeStore();
+            await run(store.start(instance('s-1')));
+            await run(store.recordOutcome('s-1', outcome('reserve')));
+            await run(store.start(instance('s-1', {
+                stepIndex: 9
+            })));
+            const read = await run(store.get('s-1'));
+            expect(read == null ? void 0 : read.stepIndex).toBe(0);
+            expect(read == null ? void 0 : read.outcomes.map((entry)=>entry.stepId)).toEqual([
+                'reserve'
+            ]);
+        });
+        it('moves the step index and appends outcomes in arrival order', async ()=>{
+            const store = await makeStore();
+            await run(store.start(instance('s-1')));
+            await run(store.beginStep('s-1', 1));
+            await run(store.recordOutcome('s-1', outcome('reserve')));
+            await run(store.recordOutcome('s-1', outcome('charge')));
+            const read = await run(store.get('s-1'));
+            expect(read == null ? void 0 : read.stepIndex).toBe(1);
+            expect(read == null ? void 0 : read.outcomes.map((entry)=>entry.stepId)).toEqual([
+                'reserve',
+                'charge'
+            ]);
+        });
+        it('settles with a state and the error that caused it', async ()=>{
+            const store = await makeStore();
+            await run(store.start(instance('s-1')));
+            await run(store.settle('s-1', 'COMPENSATED', 'charge refused'));
+            expect(await run(store.get('s-1'))).toMatchObject({
+                state: 'COMPENSATED',
+                error: 'charge refused'
+            });
+        });
+        it('flags only the named step compensated', async ()=>{
+            const store = await makeStore();
+            await run(store.start(instance('s-1')));
+            await run(store.recordOutcome('s-1', outcome('reserve')));
+            await run(store.recordOutcome('s-1', outcome('charge')));
+            await run(store.markCompensated('s-1', 'reserve'));
+            const read = await run(store.get('s-1'));
+            expect(read == null ? void 0 : read.outcomes).toEqual([
+                expect.objectContaining({
+                    stepId: 'reserve',
+                    compensated: true
+                }),
+                expect.not.objectContaining({
+                    compensated: true
+                })
+            ]);
+        });
+        // `COMPENSATING` is stuck too: a coordinator that died while unwinding is
+        // the state that leaves holds in place.
+        it('finds unfinished instances past the deadline, and nothing else', async ()=>{
+            const store = await makeStore();
+            await run(store.start(instance('running')));
+            await run(store.start(instance('unwinding', {
+                state: 'COMPENSATING'
+            })));
+            await run(store.start(instance('done', {
+                state: 'COMPLETED'
+            })));
+            const stale = await run(store.findStale(ANY_AGE));
+            expect(stale.map((entry)=>entry.sagaId).sort()).toEqual([
+                'running',
+                'unwinding'
+            ]);
+            expect(await run(store.findStale(AN_HOUR))).toEqual([]);
+        });
+        it('claims a stale instance by counting the attempt', async ()=>{
+            var _this;
+            const store = await makeStore();
+            await run(store.start(instance('s-1')));
+            const claimed = await run(store.claimForResume('s-1', ANY_AGE));
+            expect(claimed).toMatchObject({
+                sagaId: 's-1',
+                resumeAttempts: 1
+            });
+            expect((_this = await run(store.get('s-1'))) == null ? void 0 : _this.resumeAttempts).toBe(1);
+        });
+        it('refuses to claim a settled or a fresh instance', async ()=>{
+            const store = await makeStore();
+            await run(store.start(instance('done', {
+                state: 'COMPLETED'
+            })));
+            await run(store.start(instance('fresh')));
+            expect(await run(store.claimForResume('done', ANY_AGE))).toBeUndefined();
+            expect(await run(store.claimForResume('fresh', AN_HOUR))).toBeUndefined();
+            expect(await run(store.claimForResume('absent', ANY_AGE))).toBeUndefined();
+        });
+    });
+};
+
+//# sourceMappingURL=saga-store.contract.js.map

package/dist/contracts/saga-store.contract.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/contracts/saga-store.contract.ts"],"sourcesContent":["import type {\n  SagaInstance,\n  SagaStepOutcome,\n  SagaStore,\n} from '@entifix/transactions';\nimport { Effect } from 'effect';\nimport { describe, expect, it } from 'vitest';\n\nconst run = <TValue, TError>(effect: Effect.Effect<TValue, TError>) =>\n  Effect.runPromise(effect);\n\n/** A threshold every instance is older than, so no spec waits on a clock. */\nconst ANY_AGE = -60_000;\n/** A threshold no instance just written is older than. */\nconst AN_HOUR = 3_600_000;\n\nconst instance = (\n  sagaId: string,\n  over: Partial<Omit<SagaInstance, 'updatedAt'>> = {},\n): Omit<SagaInstance, 'updatedAt'> => ({\n  sagaId,\n  definition: 'contract-flow',\n  state: 'RUNNING',\n  stepIndex: 0,\n  outcomes: [],\n  inputs: {},\n  resumeAttempts: 0,\n  createdAt: new Date().toISOString(),\n  ...over,\n});\n\nconst outcome = (stepId: string): SagaStepOutcome => ({ stepId, calls: [] });\n\n/**\n * What every {@link SagaStore} must guarantee to the saga engine: an instance\n * that can be started twice without being overwritten, outcomes that append in\n * arrival order, a compensation flag that lands on one step, and a resume claim\n * that only ever takes an unfinished instance past its deadline.\n *\n * Deliberately not asserted: two concurrent claims producing one winner. That\n * is a property of the conditional write against a real server, and a contract\n * run in one process cannot interleave the two.\n */\nexport const describeSagaStoreContract = (\n  name: string,\n  makeStore: () => SagaStore | Promise<SagaStore>,\n): void => {\n  describe(`SagaStore contract: ${name}`, () => {\n    it('starts an instance and reads it back, stamped', async () => {\n      const store = await makeStore();\n\n      await run(store.start(instance('s-1')));\n      const read = await run(store.get('s-1'));\n\n      expect(read).toMatchObject({ sagaId: 's-1', state: 'RUNNING' });\n      expect(read?.updatedAt).toEqual(expect.any(String));\n    });\n\n    it('answers undefined for an instance it never started', async () => {\n      const store = await makeStore();\n\n      expect(await run(store.get('absent'))).toBeUndefined();\n    });\n\n    // A coordinator restarted mid-flight re-enters `start` with an id it\n    // already wrote; what it had recorded must survive that.\n    it('does not overwrite an instance started twice', async () => {\n      const store = await makeStore();\n      await run(store.start(instance('s-1')));\n      await run(store.recordOutcome('s-1', outcome('reserve')));\n\n      await run(store.start(instance('s-1', { stepIndex: 9 })));\n\n      const read = await run(store.get('s-1'));\n      expect(read?.stepIndex).toBe(0);\n      expect(read?.outcomes.map(entry => entry.stepId)).toEqual(['reserve']);\n    });\n\n    it('moves the step index and appends outcomes in arrival order', async () => {\n      const store = await makeStore();\n      await run(store.start(instance('s-1')));\n\n      await run(store.beginStep('s-1', 1));\n      await run(store.recordOutcome('s-1', outcome('reserve')));\n      await run(store.recordOutcome('s-1', outcome('charge')));\n\n      const read = await run(store.get('s-1'));\n      expect(read?.stepIndex).toBe(1);\n      expect(read?.outcomes.map(entry => entry.stepId)).toEqual([\n        'reserve',\n        'charge',\n      ]);\n    });\n\n    it('settles with a state and the error that caused it', async () => {\n      const store = await makeStore();\n      await run(store.start(instance('s-1')));\n\n      await run(store.settle('s-1', 'COMPENSATED', 'charge refused'));\n\n      expect(await run(store.get('s-1'))).toMatchObject({\n        state: 'COMPENSATED',\n        error: 'charge refused',\n      });\n    });\n\n    it('flags only the named step compensated', async () => {\n      const store = await makeStore();\n      await run(store.start(instance('s-1')));\n      await run(store.recordOutcome('s-1', outcome('reserve')));\n      await run(store.recordOutcome('s-1', outcome('charge')));\n\n      await run(store.markCompensated('s-1', 'reserve'));\n\n      const read = await run(store.get('s-1'));\n      expect(read?.outcomes).toEqual([\n        expect.objectContaining({ stepId: 'reserve', compensated: true }),\n        expect.not.objectContaining({ compensated: true }),\n      ]);\n    });\n\n    // `COMPENSATING` is stuck too: a coordinator that died while unwinding is\n    // the state that leaves holds in place.\n    it('finds unfinished instances past the deadline, and nothing else', async () => {\n      const store = await makeStore();\n      await run(store.start(instance('running')));\n      await run(store.start(instance('unwinding', { state: 'COMPENSATING' })));\n      await run(store.start(instance('done', { state: 'COMPLETED' })));\n\n      const stale = await run(store.findStale(ANY_AGE));\n      expect(stale.map(entry => entry.sagaId).sort()).toEqual([\n        'running',\n        'unwinding',\n      ]);\n      expect(await run(store.findStale(AN_HOUR))).toEqual([]);\n    });\n\n    it('claims a stale instance by counting the attempt', async () => {\n      const store = await makeStore();\n      await run(store.start(instance('s-1')));\n\n      const claimed = await run(store.claimForResume('s-1', ANY_AGE));\n\n      expect(claimed).toMatchObject({ sagaId: 's-1', resumeAttempts: 1 });\n      expect((await run(store.get('s-1')))?.resumeAttempts).toBe(1);\n    });\n\n    it('refuses to claim a settled or a fresh instance', async () => {\n      const store = await makeStore();\n      await run(store.start(instance('done', { state: 'COMPLETED' })));\n      await run(store.start(instance('fresh')));\n\n      expect(await run(store.claimForResume('done', ANY_AGE))).toBeUndefined();\n      expect(await run(store.claimForResume('fresh', AN_HOUR))).toBeUndefined();\n      expect(\n        await run(store.claimForResume('absent', ANY_AGE)),\n      ).toBeUndefined();\n    });\n  });\n};\n"],"names":["Effect","describe","expect","it","run","effect","runPromise","ANY_AGE","AN_HOUR","instance","sagaId","over","definition","state","stepIndex","outcomes","inputs","resumeAttempts","createdAt","Date","toISOString","outcome","stepId","calls","describeSagaStoreContract","name","makeStore","store","start","read","get","toMatchObject","updatedAt","toEqual","any","String","toBeUndefined","recordOutcome","toBe","map","entry","beginStep","settle","error","markCompensated","objectContaining","compensated","not","stale","findStale","sort","claimed","claimForResume"],"mappings":";AAKA,SAASA,MAAM,QAAQ,SAAS;AAChC,SAASC,QAAQ,EAAEC,MAAM,EAAEC,EAAE,QAAQ,SAAS;AAE9C,MAAMC,MAAM,CAAiBC,SAC3BL,OAAOM,UAAU,CAACD;AAEpB,2EAA2E,GAC3E,MAAME,UAAU,CAAC;AACjB,wDAAwD,GACxD,MAAMC,UAAU;AAEhB,MAAMC,WAAW,CACfC,QACAC,OAAiD,CAAC,CAAC,GACd;QACrCD;QACAE,YAAY;QACZC,OAAO;QACPC,WAAW;QACXC,UAAU,EAAE;QACZC,QAAQ,CAAC;QACTC,gBAAgB;QAChBC,WAAW,IAAIC,OAAOC,WAAW;OAC9BT;AAGL,MAAMU,UAAU,CAACC,SAAqC,CAAA;QAAEA;QAAQC,OAAO,EAAE;IAAC,CAAA;AAE1E;;;;;;;;;CASC,GACD,OAAO,MAAMC,4BAA4B,CACvCC,MACAC;IAEAzB,SAAS,CAAC,oBAAoB,EAAEwB,MAAM,EAAE;QACtCtB,GAAG,iDAAiD;YAClD,MAAMwB,QAAQ,MAAMD;YAEpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAC/B,MAAMoB,OAAO,MAAMzB,IAAIuB,MAAMG,GAAG,CAAC;YAEjC5B,OAAO2B,MAAME,aAAa,CAAC;gBAAErB,QAAQ;gBAAOG,OAAO;YAAU;YAC7DX,OAAO2B,wBAAAA,KAAMG,SAAS,EAAEC,OAAO,CAAC/B,OAAOgC,GAAG,CAACC;QAC7C;QAEAhC,GAAG,sDAAsD;YACvD,MAAMwB,QAAQ,MAAMD;YAEpBxB,OAAO,MAAME,IAAIuB,MAAMG,GAAG,CAAC,YAAYM,aAAa;QACtD;QAEA,qEAAqE;QACrE,yDAAyD;QACzDjC,GAAG,gDAAgD;YACjD,MAAMwB,QAAQ,MAAMD;YACpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAC/B,MAAML,IAAIuB,MAAMU,aAAa,CAAC,OAAOhB,QAAQ;YAE7C,MAAMjB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS,OAAO;gBAAEK,WAAW;YAAE;YAErD,MAAMe,OAAO,MAAMzB,IAAIuB,MAAMG,GAAG,CAAC;YACjC5B,OAAO2B,wBAAAA,KAAMf,SAAS,EAAEwB,IAAI,CAAC;YAC7BpC,OAAO2B,wBAAAA,KAAMd,QAAQ,CAACwB,GAAG,CAACC,CAAAA,QAASA,MAAMlB,MAAM,GAAGW,OAAO,CAAC;gBAAC;aAAU;QACvE;QAEA9B,GAAG,8DAA8D;YAC/D,MAAMwB,QAAQ,MAAMD;YACpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAE/B,MAAML,IAAIuB,MAAMc,SAAS,CAAC,OAAO;YACjC,MAAMrC,IAAIuB,MAAMU,aAAa,CAAC,OAAOhB,QAAQ;YAC7C,MAAMjB,IAAIuB,MAAMU,aAAa,CAAC,OAAOhB,QAAQ;YAE7C,MAAMQ,OAAO,MAAMzB,IAAIuB,MAAMG,GAAG,CAAC;YACjC5B,OAAO2B,wBAAAA,KAAMf,SAAS,EAAEwB,IAAI,CAAC;YAC7BpC,OAAO2B,wBAAAA,KAAMd,QAAQ,CAACwB,GAAG,CAACC,CAAAA,QAASA,MAAMlB,MAAM,GAAGW,OAAO,CAAC;gBACxD;gBACA;aACD;QACH;QAEA9B,GAAG,qDAAqD;YACtD,MAAMwB,QAAQ,MAAMD;YACpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAE/B,MAAML,IAAIuB,MAAMe,MAAM,CAAC,OAAO,eAAe;YAE7CxC,OAAO,MAAME,IAAIuB,MAAMG,GAAG,CAAC,SAASC,aAAa,CAAC;gBAChDlB,OAAO;gBACP8B,OAAO;YACT;QACF;QAEAxC,GAAG,yCAAyC;YAC1C,MAAMwB,QAAQ,MAAMD;YACpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAC/B,MAAML,IAAIuB,MAAMU,aAAa,CAAC,OAAOhB,QAAQ;YAC7C,MAAMjB,IAAIuB,MAAMU,aAAa,CAAC,OAAOhB,QAAQ;YAE7C,MAAMjB,IAAIuB,MAAMiB,eAAe,CAAC,OAAO;YAEvC,MAAMf,OAAO,MAAMzB,IAAIuB,MAAMG,GAAG,CAAC;YACjC5B,OAAO2B,wBAAAA,KAAMd,QAAQ,EAAEkB,OAAO,CAAC;gBAC7B/B,OAAO2C,gBAAgB,CAAC;oBAAEvB,QAAQ;oBAAWwB,aAAa;gBAAK;gBAC/D5C,OAAO6C,GAAG,CAACF,gBAAgB,CAAC;oBAAEC,aAAa;gBAAK;aACjD;QACH;QAEA,0EAA0E;QAC1E,wCAAwC;QACxC3C,GAAG,kEAAkE;YACnE,MAAMwB,QAAQ,MAAMD;YACpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAC/B,MAAML,IAAIuB,MAAMC,KAAK,CAACnB,SAAS,aAAa;gBAAEI,OAAO;YAAe;YACpE,MAAMT,IAAIuB,MAAMC,KAAK,CAACnB,SAAS,QAAQ;gBAAEI,OAAO;YAAY;YAE5D,MAAMmC,QAAQ,MAAM5C,IAAIuB,MAAMsB,SAAS,CAAC1C;YACxCL,OAAO8C,MAAMT,GAAG,CAACC,CAAAA,QAASA,MAAM9B,MAAM,EAAEwC,IAAI,IAAIjB,OAAO,CAAC;gBACtD;gBACA;aACD;YACD/B,OAAO,MAAME,IAAIuB,MAAMsB,SAAS,CAACzC,WAAWyB,OAAO,CAAC,EAAE;QACxD;QAEA9B,GAAG,mDAAmD;gBAO5C;YANR,MAAMwB,QAAQ,MAAMD;YACpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAE/B,MAAM0C,UAAU,MAAM/C,IAAIuB,MAAMyB,cAAc,CAAC,OAAO7C;YAEtDL,OAAOiD,SAASpB,aAAa,CAAC;gBAAErB,QAAQ;gBAAOO,gBAAgB;YAAE;YACjEf,QAAQ,QAAA,MAAME,IAAIuB,MAAMG,GAAG,CAAC,4BAArB,AAAC,MAA8Bb,cAAc,EAAEqB,IAAI,CAAC;QAC7D;QAEAnC,GAAG,kDAAkD;YACnD,MAAMwB,QAAQ,MAAMD;YACpB,MAAMtB,IAAIuB,MAAMC,KAAK,CAACnB,SAAS,QAAQ;gBAAEI,OAAO;YAAY;YAC5D,MAAMT,IAAIuB,MAAMC,KAAK,CAACnB,SAAS;YAE/BP,OAAO,MAAME,IAAIuB,MAAMyB,cAAc,CAAC,QAAQ7C,WAAW6B,aAAa;YACtElC,OAAO,MAAME,IAAIuB,MAAMyB,cAAc,CAAC,SAAS5C,WAAW4B,aAAa;YACvElC,OACE,MAAME,IAAIuB,MAAMyB,cAAc,CAAC,UAAU7C,WACzC6B,aAAa;QACjB;IACF;AACF,EAAE"}

package/dist/doubles/entity-repository.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"entity-repository.d.ts","sourceRoot":"","sources":["../../src/doubles/entity-repository.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,MAAM,EAQZ,MAAM,eAAe,CAAC;AAwHvB,MAAM,WAAW,wBAAyB,SAAQ,gBAAgB;IAChE,uDAAuD;IACvD,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC;IACzB,4DAA4D;IAC5D,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;CACrC;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,4BAA4B,GACvC,OAAM,MAAM,EAAO,KAClB,wBAoFF,CAAC"}
+{"version":3,"file":"entity-repository.d.ts","sourceRoot":"","sources":["../../src/doubles/entity-repository.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAGL,KAAK,YAAY,EACjB,KAAK,MAAM,EAWZ,MAAM,eAAe,CAAC;AAsJvB,MAAM,WAAW,wBAAyB,SAAQ,gBAAgB;IAChE,uDAAuD;IACvD,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC;IACzB,4DAA4D;IAC5D,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;CACrC;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,4BAA4B,GACvC,OAAM,MAAM,EAAO,KAClB,wBAqGF,CAAC"}

package/dist/doubles/entity-repository.js

@@ -1,5 +1,4 @@
-import { randomUUID } from 'node:crypto';
-import { EntifixConnError } from '@entifix/core';
+import { deserializeSingleEntity, EntifixConnError, extractMetaAccessors, serializeEntity } from '@entifix/core';
 import { Effect } from 'effect';
 /** Escapes a string so `like`/`nlike` match literally, as the Mongo adapter does. */ const escapeRegex = (value)=>value.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
 const isFilterGroup = (node)=>!('property' in node) && (node.operator === 'and' || node.operator === 'or');
@@ -80,6 +79,24 @@ const applySorting = (items, sorting)=>{
         return 0;
     });
 };
+/**
+ * A copy of `entity` that shares no state with it.
+ *
+ * Through the entity's own mapping — serialize, then deserialize — because that
+ * is what a real adapter does to every record on the way in and out: a caller
+ * can never hold the instance the store keeps, and a member the mapping drops
+ * (`hidden`, `readonly`) does not survive a save here either. A class that
+ * declares no accessors has no mapping to go through, so it is copied member by
+ * member instead; plain spec fixtures are the case this keeps working.
+ */ const copyOf = (entity)=>{
+    const entityConstructor = entity.constructor;
+    if (extractMetaAccessors(entityConstructor).length === 0) {
+        return Effect.succeed(Object.assign(Object.create(Object.getPrototypeOf(entity)), entity));
+    }
+    // `undefined` only comes back for `null`/`undefined` input, and
+    // `serializeEntity` always hands over an object.
+    return deserializeSingleEntity(entityConstructor, serializeEntity(entityConstructor, entity));
+};
 /**
  * In-memory {@link EntityRepository}: the default double for anything that
  * depends on persistence.
@@ -107,30 +124,36 @@ const applySorting = (items, sorting)=>{
             const page = (_request_page = request.page) != null ? _request_page : 1;
             const pageSize = (_request_pageSize = request.pageSize) != null ? _request_pageSize : 10;
             const start = (page - 1) * pageSize;
-            return Effect.succeed({
-                items: matched.slice(start, start + pageSize),
-                total: matched.length,
-                request
-            });
+            return Effect.forEach(matched.slice(start, start + pageSize), copyOf).pipe(Effect.map((copies)=>({
+                    items: copies,
+                    total: matched.length,
+                    request
+                })));
         });
     const get = (id)=>guard(()=>{
             const found = items.find((item)=>item.id === id);
             return found === undefined ? Effect.fail(new EntifixConnError('Entity not found', undefined, {
                 id
-            })) : Effect.succeed(found);
+            })) : copyOf(found);
         });
     const save = (entity)=>guard(()=>{
             var _entity_id;
             // A create arrives without an id, so the store mints one — same rule the
-            // Mongo adapter follows.
-            entity.id = (_entity_id = entity.id) != null ? _entity_id : randomUUID();
-            const index = items.findIndex((item)=>item.id === entity.id);
-            if (index === -1) {
-                items.push(entity);
-            } else {
-                items[index] = entity;
-            }
-            return Effect.succeed(entity);
+            // Mongo adapter follows. The Web Crypto global rather than `node:crypto`,
+            // because a browser bundle cannot resolve a `node:` import and an example
+            // with no backend runs this repository in the page.
+            entity.id = (_entity_id = entity.id) != null ? _entity_id : globalThis.crypto.randomUUID();
+            // The store keeps its own copy and hands back another, so neither the
+            // caller's instance nor the returned one can change the record without a
+            // second save — which a real adapter guarantees by construction.
+            return copyOf(entity).pipe(Effect.tap((stored)=>{
+                const index = items.findIndex((item)=>item.id === stored.id);
+                if (index === -1) {
+                    items.push(stored);
+                } else {
+                    items[index] = stored;
+                }
+            }), Effect.flatMap(copyOf));
         });
     const remove = (entityOrId)=>guard(()=>{
             const id = entityOrId != null && typeof entityOrId === 'object' ? entityOrId.id : entityOrId;

package/dist/doubles/entity-repository.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/doubles/entity-repository.ts"],"sourcesContent":["import { randomUUID } from 'node:crypto';\n\nimport type { EntityRepository } from '@entifix/business';\nimport {\n  EntifixConnError,\n  type EntifixError,\n  type Entity,\n  type EntityFilter,\n  type EntityFiltering,\n  type EntityId,\n  type EntityLoadRequest,\n  type EntityPage,\n  type EntitySorting,\n  type FilterGroup,\n} from '@entifix/core';\nimport { Effect } from 'effect';\n\n/** Escapes a string so `like`/`nlike` match literally, as the Mongo adapter does. */\nconst escapeRegex = (value: string): string =>\n  value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n\nconst isFilterGroup = <TEntity extends Entity>(\n  node: EntityFilter<TEntity> | FilterGroup<TEntity>,\n): node is FilterGroup<TEntity> =>\n  !('property' in node) && (node.operator === 'and' || node.operator === 'or');\n\nconst compareValues = (left: unknown, right: unknown): number => {\n  if (left === right) return 0;\n  // Mongo sorts missing values below present ones.\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  }\n  if (left instanceof Date && right instanceof Date) {\n    return left.getTime() - right.getTime();\n  }\n  return String(left).localeCompare(String(right));\n};\n\nconst matchesNode = <TEntity extends Entity>(\n  item: TEntity,\n  node: EntityFilter<TEntity> | FilterGroup<TEntity>,\n): boolean => {\n  if (isFilterGroup(node)) {\n    return node.operator === 'or'\n      ? node.values.some(child => matchesNode(item, child))\n      : node.values.every(child => matchesNode(item, child));\n  }\n\n  const actual = (item as Record<string, unknown>)[String(node.property)];\n\n  switch (node.operator) {\n    case 'eq':\n      return actual === node.value;\n    case 'ne':\n      return actual !== node.value;\n    case 'gt':\n      return compareValues(actual, node.value) > 0;\n    case 'gte':\n      return compareValues(actual, node.value) >= 0;\n    case 'lt':\n      return compareValues(actual, node.value) < 0;\n    case 'lte':\n      return compareValues(actual, node.value) <= 0;\n    case 'in':\n      return node.values.includes(actual as TEntity[keyof TEntity]);\n    case 'nin':\n      return !node.values.includes(actual as TEntity[keyof TEntity]);\n    case 'between':\n      return (\n        compareValues(actual, node.start) >= 0 &&\n        compareValues(actual, node.end) <= 0\n      );\n    case 'nbetween':\n      return !(\n        compareValues(actual, node.start) >= 0 &&\n        compareValues(actual, node.end) <= 0\n      );\n    case 'like':\n      return new RegExp(escapeRegex(node.value), 'i').test(String(actual));\n    case 'nlike':\n      return !new RegExp(escapeRegex(node.value), 'i').test(String(actual));\n    case 'isNull':\n      return actual == null;\n    case 'isNotNull':\n      return actual != null;\n    default: {\n      // Exhaustiveness guard — a new operator must be handled explicitly.\n      const never: never = node;\n      return never;\n    }\n  }\n};\n\nconst applyFiltering = <TEntity extends Entity>(\n  items: TEntity[],\n  filtering?: EntityFiltering<TEntity>[],\n): TEntity[] => {\n  if (!filtering || filtering.length === 0) return items;\n  // Every top-level entry is combined with `and`, matching `translateFiltering`.\n  const nodes = filtering.flatMap(entry =>\n    Array.isArray(entry) ? entry : [entry],\n  );\n  return items.filter(item => nodes.every(node => matchesNode(item, node)));\n};\n\nconst applySorting = <TEntity extends Entity>(\n  items: TEntity[],\n  sorting?: EntitySorting<TEntity>[],\n): TEntity[] => {\n  if (!sorting || sorting.length === 0) return items;\n\n  const entries = sorting.flatMap(record =>\n    Object.keys(record)\n      .map(Number)\n      .sort((left, right) => left - right)\n      .map(priority => record[priority])\n      .filter(entry => entry != null),\n  );\n\n  return [...items].sort((left, right) => {\n    for (const entry of entries) {\n      const property = String(entry.property);\n      const result = compareValues(\n        (left as Record<string, unknown>)[property],\n        (right as Record<string, unknown>)[property],\n      );\n      if (result !== 0) return entry.type === 'desc' ? -result : result;\n    }\n    return 0;\n  });\n};\n\nexport interface InMemoryEntityRepository extends EntityRepository {\n  /** Everything currently stored, in insertion order. */\n  readonly items: Entity[];\n  /** Replaces the contents, discarding whatever was there. */\n  seed(items: Entity[]): void;\n  /**\n   * Makes the next call to any method fail with `error`, so error branches are\n   * reachable without reaching for a mocking library.\n   */\n  failNext(error: EntifixError): void;\n}\n\n/**\n * In-memory {@link EntityRepository}: the default double for anything that\n * depends on persistence.\n *\n * Its semantics deliberately mirror `makeMongoRepository` — same filtering and\n * sorting rules, same 1-based paging with a default page size of 10, same\n * \"entity not found\" failure, same id minting on create — and\n * `describeEntityRepositoryContract` holds both to that shared contract.\n */\nexport const makeInMemoryEntityRepository = (\n  seed: Entity[] = [],\n): InMemoryEntityRepository => {\n  let items = [...seed];\n  let pendingFailure: EntifixError | undefined;\n\n  /** Consumes a queued failure, if one was armed. */\n  const guard = <TValue>(\n    run: () => Effect.Effect<TValue, EntifixError>,\n  ): Effect.Effect<TValue, EntifixError> => {\n    if (pendingFailure !== undefined) {\n      const failure = pendingFailure;\n      pendingFailure = undefined;\n      return Effect.fail(failure);\n    }\n    return run();\n  };\n\n  const load = <TEntity extends Entity>(request: EntityLoadRequest<TEntity>) =>\n    guard(() => {\n      const matched = applySorting(\n        applyFiltering(items as TEntity[], request.filtering),\n        request.sorting,\n      );\n      const page = request.page ?? 1;\n      const pageSize = request.pageSize ?? 10;\n      const start = (page - 1) * pageSize;\n\n      return Effect.succeed({\n        items: matched.slice(start, start + pageSize),\n        total: matched.length,\n        request,\n      } satisfies EntityPage<TEntity>);\n    });\n\n  const get = <TEntity extends Entity>(id: EntityId) =>\n    guard(() => {\n      const found = items.find(item => item.id === id);\n      return found === undefined\n        ? Effect.fail(\n            new EntifixConnError('Entity not found', undefined, { id }),\n          )\n        : Effect.succeed(found as TEntity);\n    });\n\n  const save = <TEntity extends Entity>(entity: TEntity) =>\n    guard(() => {\n      // A create arrives without an id, so the store mints one — same rule the\n      // Mongo adapter follows.\n      entity.id = entity.id ?? randomUUID();\n      const index = items.findIndex(item => item.id === entity.id);\n      if (index === -1) {\n        items.push(entity);\n      } else {\n        items[index] = entity;\n      }\n      return Effect.succeed(entity);\n    });\n\n  const remove = <TEntity extends Entity>(entityOrId: EntityId | TEntity) =>\n    guard(() => {\n      const id =\n        entityOrId != null && typeof entityOrId === 'object'\n          ? entityOrId.id\n          : entityOrId;\n      items = items.filter(item => item.id !== id);\n      return Effect.succeed(undefined);\n    });\n\n  return {\n    load,\n    get,\n    save,\n    delete: remove,\n    get items() {\n      return items;\n    },\n    seed: (next: Entity[]) => {\n      items = [...next];\n    },\n    failNext: (error: EntifixError) => {\n      pendingFailure = error;\n    },\n    // Each method closes over its own state, so nothing is required from the\n    // Effect environment; that is assignable to the interface's channel.\n  } as unknown as InMemoryEntityRepository;\n};\n"],"names":["randomUUID","EntifixConnError","Effect","escapeRegex","value","replace","isFilterGroup","node","operator","compareValues","left","right","Date","getTime","String","localeCompare","matchesNode","item","values","some","child","every","actual","property","includes","start","end","RegExp","test","never","applyFiltering","items","filtering","length","nodes","flatMap","entry","Array","isArray","filter","applySorting","sorting","entries","record","Object","keys","map","Number","sort","priority","result","type","makeInMemoryEntityRepository","seed","pendingFailure","guard","run","undefined","failure","fail","load","request","matched","page","pageSize","succeed","slice","total","get","id","found","find","save","entity","index","findIndex","push","remove","entityOrId","delete","next","failNext","error"],"mappings":"AAAA,SAASA,UAAU,QAAQ,cAAc;AAGzC,SACEC,gBAAgB,QAUX,gBAAgB;AACvB,SAASC,MAAM,QAAQ,SAAS;AAEhC,mFAAmF,GACnF,MAAMC,cAAc,CAACC,QACnBA,MAAMC,OAAO,CAAC,uBAAuB;AAEvC,MAAMC,gBAAgB,CACpBC,OAEA,CAAE,CAAA,cAAcA,IAAG,KAAOA,CAAAA,KAAKC,QAAQ,KAAK,SAASD,KAAKC,QAAQ,KAAK,IAAG;AAE5E,MAAMC,gBAAgB,CAACC,MAAeC;IACpC,IAAID,SAASC,OAAO,OAAO;IAC3B,iDAAiD;IACjD,IAAID,QAAQ,MAAM,OAAO,CAAC;IAC1B,IAAIC,SAAS,MAAM,OAAO;IAC1B,IAAI,OAAOD,SAAS,YAAY,OAAOC,UAAU,UAAU;QACzD,OAAOD,OAAOC;IAChB;IACA,IAAID,gBAAgBE,QAAQD,iBAAiBC,MAAM;QACjD,OAAOF,KAAKG,OAAO,KAAKF,MAAME,OAAO;IACvC;IACA,OAAOC,OAAOJ,MAAMK,aAAa,CAACD,OAAOH;AAC3C;AAEA,MAAMK,cAAc,CAClBC,MACAV;IAEA,IAAID,cAAcC,OAAO;QACvB,OAAOA,KAAKC,QAAQ,KAAK,OACrBD,KAAKW,MAAM,CAACC,IAAI,CAACC,CAAAA,QAASJ,YAAYC,MAAMG,UAC5Cb,KAAKW,MAAM,CAACG,KAAK,CAACD,CAAAA,QAASJ,YAAYC,MAAMG;IACnD;IAEA,MAAME,SAAS,AAACL,IAAgC,CAACH,OAAOP,KAAKgB,QAAQ,EAAE;IAEvE,OAAQhB,KAAKC,QAAQ;QACnB,KAAK;YACH,OAAOc,WAAWf,KAAKH,KAAK;QAC9B,KAAK;YACH,OAAOkB,WAAWf,KAAKH,KAAK;QAC9B,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,IAAI;QAC7C,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,KAAK;QAC9C,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,IAAI;QAC7C,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,KAAK;QAC9C,KAAK;YACH,OAAOG,KAAKW,MAAM,CAACM,QAAQ,CAACF;QAC9B,KAAK;YACH,OAAO,CAACf,KAAKW,MAAM,CAACM,QAAQ,CAACF;QAC/B,KAAK;YACH,OACEb,cAAca,QAAQf,KAAKkB,KAAK,KAAK,KACrChB,cAAca,QAAQf,KAAKmB,GAAG,KAAK;QAEvC,KAAK;YACH,OAAO,CACLjB,CAAAA,cAAca,QAAQf,KAAKkB,KAAK,KAAK,KACrChB,cAAca,QAAQf,KAAKmB,GAAG,KAAK,CAAA;QAEvC,KAAK;YACH,OAAO,IAAIC,OAAOxB,YAAYI,KAAKH,KAAK,GAAG,KAAKwB,IAAI,CAACd,OAAOQ;QAC9D,KAAK;YACH,OAAO,CAAC,IAAIK,OAAOxB,YAAYI,KAAKH,KAAK,GAAG,KAAKwB,IAAI,CAACd,OAAOQ;QAC/D,KAAK;YACH,OAAOA,UAAU;QACnB,KAAK;YACH,OAAOA,UAAU;QACnB;YAAS;gBACP,oEAAoE;gBACpE,MAAMO,QAAetB;gBACrB,OAAOsB;YACT;IACF;AACF;AAEA,MAAMC,iBAAiB,CACrBC,OACAC;IAEA,IAAI,CAACA,aAAaA,UAAUC,MAAM,KAAK,GAAG,OAAOF;IACjD,+EAA+E;IAC/E,MAAMG,QAAQF,UAAUG,OAAO,CAACC,CAAAA,QAC9BC,MAAMC,OAAO,CAACF,SAASA,QAAQ;YAACA;SAAM;IAExC,OAAOL,MAAMQ,MAAM,CAACtB,CAAAA,OAAQiB,MAAMb,KAAK,CAACd,CAAAA,OAAQS,YAAYC,MAAMV;AACpE;AAEA,MAAMiC,eAAe,CACnBT,OACAU;IAEA,IAAI,CAACA,WAAWA,QAAQR,MAAM,KAAK,GAAG,OAAOF;IAE7C,MAAMW,UAAUD,QAAQN,OAAO,CAACQ,CAAAA,SAC9BC,OAAOC,IAAI,CAACF,QACTG,GAAG,CAACC,QACJC,IAAI,CAAC,CAACtC,MAAMC,QAAUD,OAAOC,OAC7BmC,GAAG,CAACG,CAAAA,WAAYN,MAAM,CAACM,SAAS,EAChCV,MAAM,CAACH,CAAAA,QAASA,SAAS;IAG9B,OAAO;WAAIL;KAAM,CAACiB,IAAI,CAAC,CAACtC,MAAMC;QAC5B,KAAK,MAAMyB,SAASM,QAAS;YAC3B,MAAMnB,WAAWT,OAAOsB,MAAMb,QAAQ;YACtC,MAAM2B,SAASzC,cACb,AAACC,IAAgC,CAACa,SAAS,EAC3C,AAACZ,KAAiC,CAACY,SAAS;YAE9C,IAAI2B,WAAW,GAAG,OAAOd,MAAMe,IAAI,KAAK,SAAS,CAACD,SAASA;QAC7D;QACA,OAAO;IACT;AACF;AAcA;;;;;;;;CAQC,GACD,OAAO,MAAME,+BAA+B,CAC1CC,OAAiB,EAAE;IAEnB,IAAItB,QAAQ;WAAIsB;KAAK;IACrB,IAAIC;IAEJ,iDAAiD,GACjD,MAAMC,QAAQ,CACZC;QAEA,IAAIF,mBAAmBG,WAAW;YAChC,MAAMC,UAAUJ;YAChBA,iBAAiBG;YACjB,OAAOvD,OAAOyD,IAAI,CAACD;QACrB;QACA,OAAOF;IACT;IAEA,MAAMI,OAAO,CAAyBC,UACpCN,MAAM;gBAKSM,eACIA;YALjB,MAAMC,UAAUtB,aACdV,eAAeC,OAAoB8B,QAAQ7B,SAAS,GACpD6B,QAAQpB,OAAO;YAEjB,MAAMsB,QAAOF,gBAAAA,QAAQE,IAAI,YAAZF,gBAAgB;YAC7B,MAAMG,YAAWH,oBAAAA,QAAQG,QAAQ,YAAhBH,oBAAoB;YACrC,MAAMpC,QAAQ,AAACsC,CAAAA,OAAO,CAAA,IAAKC;YAE3B,OAAO9D,OAAO+D,OAAO,CAAC;gBACpBlC,OAAO+B,QAAQI,KAAK,CAACzC,OAAOA,QAAQuC;gBACpCG,OAAOL,QAAQ7B,MAAM;gBACrB4B;YACF;QACF;IAEF,MAAMO,MAAM,CAAyBC,KACnCd,MAAM;YACJ,MAAMe,QAAQvC,MAAMwC,IAAI,CAACtD,CAAAA,OAAQA,KAAKoD,EAAE,KAAKA;YAC7C,OAAOC,UAAUb,YACbvD,OAAOyD,IAAI,CACT,IAAI1D,iBAAiB,oBAAoBwD,WAAW;gBAAEY;YAAG,MAE3DnE,OAAO+D,OAAO,CAACK;QACrB;IAEF,MAAME,OAAO,CAAyBC,SACpClB,MAAM;gBAGQkB;YAFZ,yEAAyE;YACzE,yBAAyB;YACzBA,OAAOJ,EAAE,IAAGI,aAAAA,OAAOJ,EAAE,YAATI,aAAazE;YACzB,MAAM0E,QAAQ3C,MAAM4C,SAAS,CAAC1D,CAAAA,OAAQA,KAAKoD,EAAE,KAAKI,OAAOJ,EAAE;YAC3D,IAAIK,UAAU,CAAC,GAAG;gBAChB3C,MAAM6C,IAAI,CAACH;YACb,OAAO;gBACL1C,KAAK,CAAC2C,MAAM,GAAGD;YACjB;YACA,OAAOvE,OAAO+D,OAAO,CAACQ;QACxB;IAEF,MAAMI,SAAS,CAAyBC,aACtCvB,MAAM;YACJ,MAAMc,KACJS,cAAc,QAAQ,OAAOA,eAAe,WACxCA,WAAWT,EAAE,GACbS;YACN/C,QAAQA,MAAMQ,MAAM,CAACtB,CAAAA,OAAQA,KAAKoD,EAAE,KAAKA;YACzC,OAAOnE,OAAO+D,OAAO,CAACR;QACxB;IAEF,OAAO;QACLG;QACAQ;QACAI;QACAO,QAAQF;QACR,IAAI9C,SAAQ;YACV,OAAOA;QACT;QACAsB,MAAM,CAAC2B;YACLjD,QAAQ;mBAAIiD;aAAK;QACnB;QACAC,UAAU,CAACC;YACT5B,iBAAiB4B;QACnB;IAGF;AACF,EAAE"}
+{"version":3,"sources":["../../src/doubles/entity-repository.ts"],"sourcesContent":["import type { EntityRepository } from '@entifix/business';\nimport {\n  deserializeSingleEntity,\n  EntifixConnError,\n  type EntifixError,\n  type Entity,\n  type EntityConstructor,\n  type EntityFilter,\n  type EntityFiltering,\n  type EntityId,\n  type EntityLoadRequest,\n  type EntityPage,\n  type EntitySorting,\n  extractMetaAccessors,\n  type FilterGroup,\n  serializeEntity,\n} from '@entifix/core';\nimport { Effect } from 'effect';\n\n/** Escapes a string so `like`/`nlike` match literally, as the Mongo adapter does. */\nconst escapeRegex = (value: string): string =>\n  value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n\nconst isFilterGroup = <TEntity extends Entity>(\n  node: EntityFilter<TEntity> | FilterGroup<TEntity>,\n): node is FilterGroup<TEntity> =>\n  !('property' in node) && (node.operator === 'and' || node.operator === 'or');\n\nconst compareValues = (left: unknown, right: unknown): number => {\n  if (left === right) return 0;\n  // Mongo sorts missing values below present ones.\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  }\n  if (left instanceof Date && right instanceof Date) {\n    return left.getTime() - right.getTime();\n  }\n  return String(left).localeCompare(String(right));\n};\n\nconst matchesNode = <TEntity extends Entity>(\n  item: TEntity,\n  node: EntityFilter<TEntity> | FilterGroup<TEntity>,\n): boolean => {\n  if (isFilterGroup(node)) {\n    return node.operator === 'or'\n      ? node.values.some(child => matchesNode(item, child))\n      : node.values.every(child => matchesNode(item, child));\n  }\n\n  const actual = (item as Record<string, unknown>)[String(node.property)];\n\n  switch (node.operator) {\n    case 'eq':\n      return actual === node.value;\n    case 'ne':\n      return actual !== node.value;\n    case 'gt':\n      return compareValues(actual, node.value) > 0;\n    case 'gte':\n      return compareValues(actual, node.value) >= 0;\n    case 'lt':\n      return compareValues(actual, node.value) < 0;\n    case 'lte':\n      return compareValues(actual, node.value) <= 0;\n    case 'in':\n      return node.values.includes(actual as TEntity[keyof TEntity]);\n    case 'nin':\n      return !node.values.includes(actual as TEntity[keyof TEntity]);\n    case 'between':\n      return (\n        compareValues(actual, node.start) >= 0 &&\n        compareValues(actual, node.end) <= 0\n      );\n    case 'nbetween':\n      return !(\n        compareValues(actual, node.start) >= 0 &&\n        compareValues(actual, node.end) <= 0\n      );\n    case 'like':\n      return new RegExp(escapeRegex(node.value), 'i').test(String(actual));\n    case 'nlike':\n      return !new RegExp(escapeRegex(node.value), 'i').test(String(actual));\n    case 'isNull':\n      return actual == null;\n    case 'isNotNull':\n      return actual != null;\n    default: {\n      // Exhaustiveness guard — a new operator must be handled explicitly.\n      const never: never = node;\n      return never;\n    }\n  }\n};\n\nconst applyFiltering = <TEntity extends Entity>(\n  items: TEntity[],\n  filtering?: EntityFiltering<TEntity>[],\n): TEntity[] => {\n  if (!filtering || filtering.length === 0) return items;\n  // Every top-level entry is combined with `and`, matching `translateFiltering`.\n  const nodes = filtering.flatMap(entry =>\n    Array.isArray(entry) ? entry : [entry],\n  );\n  return items.filter(item => nodes.every(node => matchesNode(item, node)));\n};\n\nconst applySorting = <TEntity extends Entity>(\n  items: TEntity[],\n  sorting?: EntitySorting<TEntity>[],\n): TEntity[] => {\n  if (!sorting || sorting.length === 0) return items;\n\n  const entries = sorting.flatMap(record =>\n    Object.keys(record)\n      .map(Number)\n      .sort((left, right) => left - right)\n      .map(priority => record[priority])\n      .filter(entry => entry != null),\n  );\n\n  return [...items].sort((left, right) => {\n    for (const entry of entries) {\n      const property = String(entry.property);\n      const result = compareValues(\n        (left as Record<string, unknown>)[property],\n        (right as Record<string, unknown>)[property],\n      );\n      if (result !== 0) return entry.type === 'desc' ? -result : result;\n    }\n    return 0;\n  });\n};\n\n/**\n * A copy of `entity` that shares no state with it.\n *\n * Through the entity's own mapping — serialize, then deserialize — because that\n * is what a real adapter does to every record on the way in and out: a caller\n * can never hold the instance the store keeps, and a member the mapping drops\n * (`hidden`, `readonly`) does not survive a save here either. A class that\n * declares no accessors has no mapping to go through, so it is copied member by\n * member instead; plain spec fixtures are the case this keeps working.\n */\nconst copyOf = <TEntity extends Entity>(\n  entity: TEntity,\n): Effect.Effect<TEntity, EntifixError> => {\n  const entityConstructor = entity.constructor as EntityConstructor<TEntity>;\n  if (extractMetaAccessors(entityConstructor).length === 0) {\n    return Effect.succeed(\n      Object.assign(\n        Object.create(Object.getPrototypeOf(entity) as object) as TEntity,\n        entity,\n      ),\n    );\n  }\n  // `undefined` only comes back for `null`/`undefined` input, and\n  // `serializeEntity` always hands over an object.\n  return deserializeSingleEntity(\n    entityConstructor,\n    serializeEntity(entityConstructor, entity),\n  ) as Effect.Effect<TEntity, EntifixError>;\n};\n\nexport interface InMemoryEntityRepository extends EntityRepository {\n  /** Everything currently stored, in insertion order. */\n  readonly items: Entity[];\n  /** Replaces the contents, discarding whatever was there. */\n  seed(items: Entity[]): void;\n  /**\n   * Makes the next call to any method fail with `error`, so error branches are\n   * reachable without reaching for a mocking library.\n   */\n  failNext(error: EntifixError): void;\n}\n\n/**\n * In-memory {@link EntityRepository}: the default double for anything that\n * depends on persistence.\n *\n * Its semantics deliberately mirror `makeMongoRepository` — same filtering and\n * sorting rules, same 1-based paging with a default page size of 10, same\n * \"entity not found\" failure, same id minting on create — and\n * `describeEntityRepositoryContract` holds both to that shared contract.\n */\nexport const makeInMemoryEntityRepository = (\n  seed: Entity[] = [],\n): InMemoryEntityRepository => {\n  let items = [...seed];\n  let pendingFailure: EntifixError | undefined;\n\n  /** Consumes a queued failure, if one was armed. */\n  const guard = <TValue>(\n    run: () => Effect.Effect<TValue, EntifixError>,\n  ): Effect.Effect<TValue, EntifixError> => {\n    if (pendingFailure !== undefined) {\n      const failure = pendingFailure;\n      pendingFailure = undefined;\n      return Effect.fail(failure);\n    }\n    return run();\n  };\n\n  const load = <TEntity extends Entity>(request: EntityLoadRequest<TEntity>) =>\n    guard(() => {\n      const matched = applySorting(\n        applyFiltering(items as TEntity[], request.filtering),\n        request.sorting,\n      );\n      const page = request.page ?? 1;\n      const pageSize = request.pageSize ?? 10;\n      const start = (page - 1) * pageSize;\n\n      return Effect.forEach(\n        matched.slice(start, start + pageSize),\n        copyOf,\n      ).pipe(\n        Effect.map(\n          copies =>\n            ({\n              items: copies,\n              total: matched.length,\n              request,\n            }) satisfies EntityPage<TEntity>,\n        ),\n      );\n    });\n\n  const get = <TEntity extends Entity>(id: EntityId) =>\n    guard(() => {\n      const found = items.find(item => item.id === id);\n      return found === undefined\n        ? Effect.fail(\n            new EntifixConnError('Entity not found', undefined, { id }),\n          )\n        : copyOf(found as TEntity);\n    });\n\n  const save = <TEntity extends Entity>(entity: TEntity) =>\n    guard(() => {\n      // A create arrives without an id, so the store mints one — same rule the\n      // Mongo adapter follows. The Web Crypto global rather than `node:crypto`,\n      // because a browser bundle cannot resolve a `node:` import and an example\n      // with no backend runs this repository in the page.\n      entity.id = entity.id ?? globalThis.crypto.randomUUID();\n      // The store keeps its own copy and hands back another, so neither the\n      // caller's instance nor the returned one can change the record without a\n      // second save — which a real adapter guarantees by construction.\n      return copyOf(entity).pipe(\n        Effect.tap(stored => {\n          const index = items.findIndex(item => item.id === stored.id);\n          if (index === -1) {\n            items.push(stored);\n          } else {\n            items[index] = stored;\n          }\n        }),\n        Effect.flatMap(copyOf),\n      );\n    });\n\n  const remove = <TEntity extends Entity>(entityOrId: EntityId | TEntity) =>\n    guard(() => {\n      const id =\n        entityOrId != null && typeof entityOrId === 'object'\n          ? entityOrId.id\n          : entityOrId;\n      items = items.filter(item => item.id !== id);\n      return Effect.succeed(undefined);\n    });\n\n  return {\n    load,\n    get,\n    save,\n    delete: remove,\n    get items() {\n      return items;\n    },\n    seed: (next: Entity[]) => {\n      items = [...next];\n    },\n    failNext: (error: EntifixError) => {\n      pendingFailure = error;\n    },\n    // Each method closes over its own state, so nothing is required from the\n    // Effect environment; that is assignable to the interface's channel.\n  } as unknown as InMemoryEntityRepository;\n};\n"],"names":["deserializeSingleEntity","EntifixConnError","extractMetaAccessors","serializeEntity","Effect","escapeRegex","value","replace","isFilterGroup","node","operator","compareValues","left","right","Date","getTime","String","localeCompare","matchesNode","item","values","some","child","every","actual","property","includes","start","end","RegExp","test","never","applyFiltering","items","filtering","length","nodes","flatMap","entry","Array","isArray","filter","applySorting","sorting","entries","record","Object","keys","map","Number","sort","priority","result","type","copyOf","entity","entityConstructor","succeed","assign","create","getPrototypeOf","makeInMemoryEntityRepository","seed","pendingFailure","guard","run","undefined","failure","fail","load","request","matched","page","pageSize","forEach","slice","pipe","copies","total","get","id","found","find","save","globalThis","crypto","randomUUID","tap","stored","index","findIndex","push","remove","entityOrId","delete","next","failNext","error"],"mappings":"AACA,SACEA,uBAAuB,EACvBC,gBAAgB,EAUhBC,oBAAoB,EAEpBC,eAAe,QACV,gBAAgB;AACvB,SAASC,MAAM,QAAQ,SAAS;AAEhC,mFAAmF,GACnF,MAAMC,cAAc,CAACC,QACnBA,MAAMC,OAAO,CAAC,uBAAuB;AAEvC,MAAMC,gBAAgB,CACpBC,OAEA,CAAE,CAAA,cAAcA,IAAG,KAAOA,CAAAA,KAAKC,QAAQ,KAAK,SAASD,KAAKC,QAAQ,KAAK,IAAG;AAE5E,MAAMC,gBAAgB,CAACC,MAAeC;IACpC,IAAID,SAASC,OAAO,OAAO;IAC3B,iDAAiD;IACjD,IAAID,QAAQ,MAAM,OAAO,CAAC;IAC1B,IAAIC,SAAS,MAAM,OAAO;IAC1B,IAAI,OAAOD,SAAS,YAAY,OAAOC,UAAU,UAAU;QACzD,OAAOD,OAAOC;IAChB;IACA,IAAID,gBAAgBE,QAAQD,iBAAiBC,MAAM;QACjD,OAAOF,KAAKG,OAAO,KAAKF,MAAME,OAAO;IACvC;IACA,OAAOC,OAAOJ,MAAMK,aAAa,CAACD,OAAOH;AAC3C;AAEA,MAAMK,cAAc,CAClBC,MACAV;IAEA,IAAID,cAAcC,OAAO;QACvB,OAAOA,KAAKC,QAAQ,KAAK,OACrBD,KAAKW,MAAM,CAACC,IAAI,CAACC,CAAAA,QAASJ,YAAYC,MAAMG,UAC5Cb,KAAKW,MAAM,CAACG,KAAK,CAACD,CAAAA,QAASJ,YAAYC,MAAMG;IACnD;IAEA,MAAME,SAAS,AAACL,IAAgC,CAACH,OAAOP,KAAKgB,QAAQ,EAAE;IAEvE,OAAQhB,KAAKC,QAAQ;QACnB,KAAK;YACH,OAAOc,WAAWf,KAAKH,KAAK;QAC9B,KAAK;YACH,OAAOkB,WAAWf,KAAKH,KAAK;QAC9B,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,IAAI;QAC7C,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,KAAK;QAC9C,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,IAAI;QAC7C,KAAK;YACH,OAAOK,cAAca,QAAQf,KAAKH,KAAK,KAAK;QAC9C,KAAK;YACH,OAAOG,KAAKW,MAAM,CAACM,QAAQ,CAACF;QAC9B,KAAK;YACH,OAAO,CAACf,KAAKW,MAAM,CAACM,QAAQ,CAACF;QAC/B,KAAK;YACH,OACEb,cAAca,QAAQf,KAAKkB,KAAK,KAAK,KACrChB,cAAca,QAAQf,KAAKmB,GAAG,KAAK;QAEvC,KAAK;YACH,OAAO,CACLjB,CAAAA,cAAca,QAAQf,KAAKkB,KAAK,KAAK,KACrChB,cAAca,QAAQf,KAAKmB,GAAG,KAAK,CAAA;QAEvC,KAAK;YACH,OAAO,IAAIC,OAAOxB,YAAYI,KAAKH,KAAK,GAAG,KAAKwB,IAAI,CAACd,OAAOQ;QAC9D,KAAK;YACH,OAAO,CAAC,IAAIK,OAAOxB,YAAYI,KAAKH,KAAK,GAAG,KAAKwB,IAAI,CAACd,OAAOQ;QAC/D,KAAK;YACH,OAAOA,UAAU;QACnB,KAAK;YACH,OAAOA,UAAU;QACnB;YAAS;gBACP,oEAAoE;gBACpE,MAAMO,QAAetB;gBACrB,OAAOsB;YACT;IACF;AACF;AAEA,MAAMC,iBAAiB,CACrBC,OACAC;IAEA,IAAI,CAACA,aAAaA,UAAUC,MAAM,KAAK,GAAG,OAAOF;IACjD,+EAA+E;IAC/E,MAAMG,QAAQF,UAAUG,OAAO,CAACC,CAAAA,QAC9BC,MAAMC,OAAO,CAACF,SAASA,QAAQ;YAACA;SAAM;IAExC,OAAOL,MAAMQ,MAAM,CAACtB,CAAAA,OAAQiB,MAAMb,KAAK,CAACd,CAAAA,OAAQS,YAAYC,MAAMV;AACpE;AAEA,MAAMiC,eAAe,CACnBT,OACAU;IAEA,IAAI,CAACA,WAAWA,QAAQR,MAAM,KAAK,GAAG,OAAOF;IAE7C,MAAMW,UAAUD,QAAQN,OAAO,CAACQ,CAAAA,SAC9BC,OAAOC,IAAI,CAACF,QACTG,GAAG,CAACC,QACJC,IAAI,CAAC,CAACtC,MAAMC,QAAUD,OAAOC,OAC7BmC,GAAG,CAACG,CAAAA,WAAYN,MAAM,CAACM,SAAS,EAChCV,MAAM,CAACH,CAAAA,QAASA,SAAS;IAG9B,OAAO;WAAIL;KAAM,CAACiB,IAAI,CAAC,CAACtC,MAAMC;QAC5B,KAAK,MAAMyB,SAASM,QAAS;YAC3B,MAAMnB,WAAWT,OAAOsB,MAAMb,QAAQ;YACtC,MAAM2B,SAASzC,cACb,AAACC,IAAgC,CAACa,SAAS,EAC3C,AAACZ,KAAiC,CAACY,SAAS;YAE9C,IAAI2B,WAAW,GAAG,OAAOd,MAAMe,IAAI,KAAK,SAAS,CAACD,SAASA;QAC7D;QACA,OAAO;IACT;AACF;AAEA;;;;;;;;;CASC,GACD,MAAME,SAAS,CACbC;IAEA,MAAMC,oBAAoBD,OAAO,WAAW;IAC5C,IAAIrD,qBAAqBsD,mBAAmBrB,MAAM,KAAK,GAAG;QACxD,OAAO/B,OAAOqD,OAAO,CACnBX,OAAOY,MAAM,CACXZ,OAAOa,MAAM,CAACb,OAAOc,cAAc,CAACL,UACpCA;IAGN;IACA,gEAAgE;IAChE,iDAAiD;IACjD,OAAOvD,wBACLwD,mBACArD,gBAAgBqD,mBAAmBD;AAEvC;AAcA;;;;;;;;CAQC,GACD,OAAO,MAAMM,+BAA+B,CAC1CC,OAAiB,EAAE;IAEnB,IAAI7B,QAAQ;WAAI6B;KAAK;IACrB,IAAIC;IAEJ,iDAAiD,GACjD,MAAMC,QAAQ,CACZC;QAEA,IAAIF,mBAAmBG,WAAW;YAChC,MAAMC,UAAUJ;YAChBA,iBAAiBG;YACjB,OAAO9D,OAAOgE,IAAI,CAACD;QACrB;QACA,OAAOF;IACT;IAEA,MAAMI,OAAO,CAAyBC,UACpCN,MAAM;gBAKSM,eACIA;YALjB,MAAMC,UAAU7B,aACdV,eAAeC,OAAoBqC,QAAQpC,SAAS,GACpDoC,QAAQ3B,OAAO;YAEjB,MAAM6B,QAAOF,gBAAAA,QAAQE,IAAI,YAAZF,gBAAgB;YAC7B,MAAMG,YAAWH,oBAAAA,QAAQG,QAAQ,YAAhBH,oBAAoB;YACrC,MAAM3C,QAAQ,AAAC6C,CAAAA,OAAO,CAAA,IAAKC;YAE3B,OAAOrE,OAAOsE,OAAO,CACnBH,QAAQI,KAAK,CAAChD,OAAOA,QAAQ8C,WAC7BnB,QACAsB,IAAI,CACJxE,OAAO4C,GAAG,CACR6B,CAAAA,SACG,CAAA;oBACC5C,OAAO4C;oBACPC,OAAOP,QAAQpC,MAAM;oBACrBmC;gBACF,CAAA;QAGR;IAEF,MAAMS,MAAM,CAAyBC,KACnChB,MAAM;YACJ,MAAMiB,QAAQhD,MAAMiD,IAAI,CAAC/D,CAAAA,OAAQA,KAAK6D,EAAE,KAAKA;YAC7C,OAAOC,UAAUf,YACb9D,OAAOgE,IAAI,CACT,IAAInE,iBAAiB,oBAAoBiE,WAAW;gBAAEc;YAAG,MAE3D1B,OAAO2B;QACb;IAEF,MAAME,OAAO,CAAyB5B,SACpCS,MAAM;gBAKQT;YAJZ,yEAAyE;YACzE,0EAA0E;YAC1E,0EAA0E;YAC1E,oDAAoD;YACpDA,OAAOyB,EAAE,IAAGzB,aAAAA,OAAOyB,EAAE,YAATzB,aAAa6B,WAAWC,MAAM,CAACC,UAAU;YACrD,sEAAsE;YACtE,yEAAyE;YACzE,iEAAiE;YACjE,OAAOhC,OAAOC,QAAQqB,IAAI,CACxBxE,OAAOmF,GAAG,CAACC,CAAAA;gBACT,MAAMC,QAAQxD,MAAMyD,SAAS,CAACvE,CAAAA,OAAQA,KAAK6D,EAAE,KAAKQ,OAAOR,EAAE;gBAC3D,IAAIS,UAAU,CAAC,GAAG;oBAChBxD,MAAM0D,IAAI,CAACH;gBACb,OAAO;oBACLvD,KAAK,CAACwD,MAAM,GAAGD;gBACjB;YACF,IACApF,OAAOiC,OAAO,CAACiB;QAEnB;IAEF,MAAMsC,SAAS,CAAyBC,aACtC7B,MAAM;YACJ,MAAMgB,KACJa,cAAc,QAAQ,OAAOA,eAAe,WACxCA,WAAWb,EAAE,GACba;YACN5D,QAAQA,MAAMQ,MAAM,CAACtB,CAAAA,OAAQA,KAAK6D,EAAE,KAAKA;YACzC,OAAO5E,OAAOqD,OAAO,CAACS;QACxB;IAEF,OAAO;QACLG;QACAU;QACAI;QACAW,QAAQF;QACR,IAAI3D,SAAQ;YACV,OAAOA;QACT;QACA6B,MAAM,CAACiC;YACL9D,QAAQ;mBAAI8D;aAAK;QACnB;QACAC,UAAU,CAACC;YACTlC,iBAAiBkC;QACnB;IAGF;AACF,EAAE"}

package/dist/doubles/transaction-ports.d.ts

@@ -1,5 +1,5 @@
 import { type DomainEvent, type EntifixError } from '@entifix/core';
-import type { EventBus, LockService, SequenceService, TransactionInbox } from '@entifix/transactions';
+import type { EventBus, LockService, SagaInstance, SagaStore, SequenceService, TransactionInbox } from '@entifix/transactions';
 import { Effect } from 'effect';
 export interface InMemoryLockService extends LockService {
     /** Keys currently held, in acquisition order. */
@@ -67,4 +67,15 @@ export declare const makeInMemoryInboxes: () => {
         eventId: string;
     }[];
 };
+export interface InMemorySagaStore extends SagaStore {
+    /** Every instance, as stored — for a spec to assert on state, not calls. */
+    readonly instances: readonly SagaInstance[];
+}
+/**
+ * In-memory {@link SagaStore}, with the Mongo adapter's semantics: `start`
+ * never overwrites, outcomes append, and a resume claim only takes an
+ * unfinished instance whose `updatedAt` is past the deadline — counting the
+ * attempt and re-stamping it, so the next sweep does not find it again.
+ */
+export declare const makeInMemorySagaStore: () => InMemorySagaStore;
 //# sourceMappingURL=transaction-ports.d.ts.map

package/dist/doubles/transaction-ports.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"transaction-ports.d.ts","sourceRoot":"","sources":["../../src/doubles/transaction-ports.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,WAAW,EAEhB,KAAK,YAAY,EAGlB,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EACV,QAAQ,EAER,WAAW,EACX,eAAe,EACf,gBAAgB,EACjB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAEhC,MAAM,WAAW,mBAAoB,SAAQ,WAAW;IACtD,iDAAiD;IACjD,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IACxB,sDAAsD;IACtD,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,MAAM,EAAE,SAAS,GAAG,SAAS,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC5E;;;OAGG;IACH,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC9B;AAED;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,QAAO,mBAsC1C,CAAC;AAEF,MAAM,WAAW,uBAAwB,SAAQ,eAAe;IAC9D,6DAA6D;IAC7D,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CACnD;AAED;;;GAGG;AACH,eAAO,MAAM,2BAA2B,QAAO,uBAc9C,CAAC;AAEF,MAAM,WAAW,iBAAkB,SAAQ,QAAQ;IACjD,uCAAuC;IACvC,QAAQ,CAAC,SAAS,EAAE,WAAW,EAAE,CAAC;IAClC;;;;;OAKG;IACH,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAC/D,wEAAwE;IACxE,eAAe,IAAI,IAAI,CAAC;CACzB;AAED;;;;GAIG;AACH,eAAO,MAAM,qBAAqB,QAAO,iBA4CxC,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,mBAAmB;IAI5B,0DAA0D;oBAC1C,MAAM,KAAG,gBAAgB;qBAS3B,SAAS;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,EAAE;CAOjE,CAAC"}
+{"version":3,"file":"transaction-ports.d.ts","sourceRoot":"","sources":["../../src/doubles/transaction-ports.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,WAAW,EAEhB,KAAK,YAAY,EAGlB,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EACV,QAAQ,EAER,WAAW,EACX,YAAY,EACZ,SAAS,EACT,eAAe,EACf,gBAAgB,EACjB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAEhC,MAAM,WAAW,mBAAoB,SAAQ,WAAW;IACtD,iDAAiD;IACjD,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IACxB,sDAAsD;IACtD,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,MAAM,EAAE,SAAS,GAAG,SAAS,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC5E;;;OAGG;IACH,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC9B;AAED;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,QAAO,mBAsC1C,CAAC;AAEF,MAAM,WAAW,uBAAwB,SAAQ,eAAe;IAC9D,6DAA6D;IAC7D,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CACnD;AAED;;;GAGG;AACH,eAAO,MAAM,2BAA2B,QAAO,uBAc9C,CAAC;AAEF,MAAM,WAAW,iBAAkB,SAAQ,QAAQ;IACjD,uCAAuC;IACvC,QAAQ,CAAC,SAAS,EAAE,WAAW,EAAE,CAAC;IAClC;;;;;OAKG;IACH,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAC/D,wEAAwE;IACxE,eAAe,IAAI,IAAI,CAAC;CACzB;AAED;;;;GAIG;AACH,eAAO,MAAM,qBAAqB,QAAO,iBA4CxC,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,mBAAmB;IAI5B,0DAA0D;oBAC1C,MAAM,KAAG,gBAAgB;qBAS3B,SAAS;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,EAAE;CAOjE,CAAC;AAEF,MAAM,WAAW,iBAAkB,SAAQ,SAAS;IAClD,4EAA4E;IAC5E,QAAQ,CAAC,SAAS,EAAE,SAAS,YAAY,EAAE,CAAC;CAC7C;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,QAAO,iBAwExC,CAAC"}

package/dist/doubles/transaction-ports.js

@@ -1,3 +1,4 @@
+import { _ as _extends } from "@swc/helpers/_/_extends";
 import { EntifixConnError, EntifixLockError, matchesEventPattern } from '@entifix/core';
 import { Effect } from 'effect';
 /**
@@ -141,5 +142,72 @@ import { Effect } from 'effect';
         }
     };
 };
+/**
+ * In-memory {@link SagaStore}, with the Mongo adapter's semantics: `start`
+ * never overwrites, outcomes append, and a resume claim only takes an
+ * unfinished instance whose `updatedAt` is past the deadline — counting the
+ * attempt and re-stamping it, so the next sweep does not find it again.
+ */ export const makeInMemorySagaStore = ()=>{
+    const instances = new Map();
+    const stamp = ()=>new Date().toISOString();
+    const unfinished = (entry)=>entry.state === 'RUNNING' || entry.state === 'COMPENSATING';
+    const pastDeadline = (entry, olderThanMs)=>entry.updatedAt < new Date(Date.now() - olderThanMs).toISOString();
+    const update = (sagaId, change)=>Effect.sync(()=>{
+            const current = instances.get(sagaId);
+            if (current !== undefined) {
+                instances.set(sagaId, _extends({}, change(current), {
+                    updatedAt: stamp()
+                }));
+            }
+        });
+    return {
+        start: (started)=>Effect.sync(()=>{
+                if (!instances.has(started.sagaId)) {
+                    instances.set(started.sagaId, _extends({}, started, {
+                        updatedAt: stamp()
+                    }));
+                }
+            }),
+        beginStep: (sagaId, stepIndex)=>update(sagaId, (entry)=>_extends({}, entry, {
+                    stepIndex
+                })),
+        recordOutcome: (sagaId, outcome)=>update(sagaId, (entry)=>_extends({}, entry, {
+                    outcomes: [
+                        ...entry.outcomes,
+                        outcome
+                    ]
+                })),
+        settle: (sagaId, state, error)=>update(sagaId, (entry)=>_extends({}, entry, {
+                    state,
+                    error
+                })),
+        markCompensated: (sagaId, stepId)=>update(sagaId, (entry)=>_extends({}, entry, {
+                    outcomes: entry.outcomes.map((outcome)=>outcome.stepId === stepId ? _extends({}, outcome, {
+                            compensated: true
+                        }) : outcome)
+                })),
+        get: (sagaId)=>Effect.sync(()=>instances.get(sagaId)),
+        findStale: (olderThanMs)=>Effect.sync(()=>[
+                    ...instances.values()
+                ].filter((entry)=>unfinished(entry) && pastDeadline(entry, olderThanMs))),
+        claimForResume: (sagaId, olderThanMs)=>Effect.sync(()=>{
+                const current = instances.get(sagaId);
+                if (current === undefined || !unfinished(current) || !pastDeadline(current, olderThanMs)) {
+                    return undefined;
+                }
+                const claimed = _extends({}, current, {
+                    resumeAttempts: current.resumeAttempts + 1,
+                    updatedAt: stamp()
+                });
+                instances.set(sagaId, claimed);
+                return claimed;
+            }),
+        get instances () {
+            return [
+                ...instances.values()
+            ];
+        }
+    };
+};
 
 //# sourceMappingURL=transaction-ports.js.map

package/dist/doubles/transaction-ports.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/doubles/transaction-ports.ts"],"sourcesContent":["import {\n  type DomainEvent,\n  EntifixConnError,\n  type EntifixError,\n  EntifixLockError,\n  matchesEventPattern,\n} from '@entifix/core';\nimport type {\n  EventBus,\n  LockHandle,\n  LockService,\n  SequenceService,\n  TransactionInbox,\n} from '@entifix/transactions';\nimport { Effect } from 'effect';\n\nexport interface InMemoryLockService extends LockService {\n  /** Keys currently held, in acquisition order. */\n  readonly held: string[];\n  /** Every acquire/release in the order it happened. */\n  readonly log: ReadonlyArray<{ action: 'acquire' | 'release'; key: string }>;\n  /**\n   * Marks `key` as already taken by someone else, so the next `acquire` fails\n   * with {@link EntifixLockError} — the 409 path of the transaction facade.\n   */\n  contendOn(key: string): void;\n}\n\n/**\n * In-memory {@link LockService}. Acquisition is immediate and uncontended\n * unless {@link InMemoryLockService.contendOn} says otherwise, and `release`\n * only frees a lock whose token matches — the compare-and-delete rule the Redis\n * adapter enforces with a Lua script.\n */\nexport const makeInMemoryLockService = (): InMemoryLockService => {\n  const tokens = new Map<string, string>();\n  const contended = new Set<string>();\n  const log: Array<{ action: 'acquire' | 'release'; key: string }> = [];\n  let counter = 0;\n\n  return {\n    acquire: key =>\n      Effect.suspend(() => {\n        if (contended.has(key) || tokens.has(key)) {\n          return Effect.fail(\n            new EntifixLockError(`Could not acquire lock \"${key}\"`, undefined, {\n              key,\n            }),\n          );\n        }\n        const token = `token-${(counter += 1)}`;\n        tokens.set(key, token);\n        log.push({ action: 'acquire', key });\n        return Effect.succeed({ key, token });\n      }),\n    release: (handle: LockHandle) =>\n      Effect.sync(() => {\n        if (tokens.get(handle.key) === handle.token) {\n          tokens.delete(handle.key);\n          log.push({ action: 'release', key: handle.key });\n        }\n      }),\n    get held() {\n      return [...tokens.keys()];\n    },\n    get log() {\n      return log;\n    },\n    contendOn: key => {\n      contended.add(key);\n    },\n  };\n};\n\nexport interface InMemorySequenceService extends SequenceService {\n  /** The current value of every sequence drawn from so far. */\n  readonly values: Readonly<Record<string, number>>;\n}\n\n/**\n * In-memory {@link SequenceService} — a plain counter per name. Atomicity is\n * what the Redis `INCR` adapter buys; single-threaded JS gives it for free here.\n */\nexport const makeInMemorySequenceService = (): InMemorySequenceService => {\n  const sequences = new Map<string, number>();\n\n  return {\n    next: name =>\n      Effect.sync(() => {\n        const next = (sequences.get(name) ?? 0) + 1;\n        sequences.set(name, next);\n        return next;\n      }),\n    get values() {\n      return Object.fromEntries(sequences);\n    },\n  };\n};\n\nexport interface RecordingEventBus extends EventBus {\n  /** Every event published, in order. */\n  readonly published: DomainEvent[];\n  /**\n   * Pushes an event to the subscribers whose pattern matches it, as a topic\n   * exchange would. Deliberately not \"to all subscribers\": routing is the\n   * broker's job in production, so a double that ignored it would let a\n   * consumer pass its tests while receiving traffic it never bound to.\n   */\n  deliver(event: DomainEvent): Effect.Effect<void, EntifixError>;\n  /** Makes the next `publish` fail, for the broker-unavailable branch. */\n  failNextPublish(): void;\n}\n\n/**\n * In-memory {@link EventBus} that records what was published rather than\n * asserting on it. Prefer reading `bus.published` in a test over a mock's call\n * assertions: the expectation then reads as state, not as a spy protocol.\n */\nexport const makeRecordingEventBus = (): RecordingEventBus => {\n  const published: DomainEvent[] = [];\n  const handlers: Array<{\n    pattern: string;\n    handle: (event: DomainEvent) => Effect.Effect<void, EntifixError>;\n  }> = [];\n  let failNext = false;\n\n  return {\n    publish: event =>\n      Effect.suspend(() => {\n        if (failNext) {\n          failNext = false;\n          return Effect.fail(\n            new EntifixConnError('Event bus unavailable', undefined, {\n              eventId: event.id,\n            }),\n          );\n        }\n        published.push(event);\n        return Effect.void;\n      }),\n    subscribe: (subscription, handle) =>\n      Effect.sync(() => {\n        // Only the pattern is retained: queue durability and the delivery\n        // ceiling are broker facts with no in-memory analogue, and faking them\n        // would assert against the double rather than against a broker.\n        handlers.push({ pattern: subscription.pattern, handle });\n      }),\n    deliver: event =>\n      Effect.forEach(\n        handlers.filter(({ pattern }) =>\n          matchesEventPattern(pattern, event.name),\n        ),\n        ({ handle }) => handle(event),\n        { discard: true },\n      ),\n    get published() {\n      return published;\n    },\n    failNextPublish: () => {\n      failNext = true;\n    },\n  };\n};\n\n/**\n * An in-memory {@link TransactionInbox}, one per consumer, over a shared claim\n * set.\n *\n * Sharing the set across the inboxes one factory hands out is what makes the\n * contract's \"one consumer cannot consume another's claim\" case a real\n * assertion, rather than one the double satisfies by only ever having seen a\n * single consumer.\n */\nexport const makeInMemoryInboxes = () => {\n  const claimed = new Set<string>();\n\n  return {\n    /** An inbox for `consumer`, over the shared claim set. */\n    for: (consumer: string): TransactionInbox => ({\n      claim: eventId =>\n        Effect.sync(() => {\n          const key = JSON.stringify([consumer, eventId]);\n          if (claimed.has(key)) return 'duplicate' as const;\n          claimed.add(key);\n          return 'claimed' as const;\n        }),\n    }),\n    get claims(): readonly { consumer: string; eventId: string }[] {\n      return [...claimed].map(key => {\n        const [consumer, eventId] = JSON.parse(key) as [string, string];\n        return { consumer, eventId };\n      });\n    },\n  };\n};\n"],"names":["EntifixConnError","EntifixLockError","matchesEventPattern","Effect","makeInMemoryLockService","tokens","Map","contended","Set","log","counter","acquire","key","suspend","has","fail","undefined","token","set","push","action","succeed","release","handle","sync","get","delete","held","keys","contendOn","add","makeInMemorySequenceService","sequences","next","name","values","Object","fromEntries","makeRecordingEventBus","published","handlers","failNext","publish","event","eventId","id","void","subscribe","subscription","pattern","deliver","forEach","filter","discard","failNextPublish","makeInMemoryInboxes","claimed","for","consumer","claim","JSON","stringify","claims","map","parse"],"mappings":"AAAA,SAEEA,gBAAgB,EAEhBC,gBAAgB,EAChBC,mBAAmB,QACd,gBAAgB;AAQvB,SAASC,MAAM,QAAQ,SAAS;AAchC;;;;;CAKC,GACD,OAAO,MAAMC,0BAA0B;IACrC,MAAMC,SAAS,IAAIC;IACnB,MAAMC,YAAY,IAAIC;IACtB,MAAMC,MAA6D,EAAE;IACrE,IAAIC,UAAU;IAEd,OAAO;QACLC,SAASC,CAAAA,MACPT,OAAOU,OAAO,CAAC;gBACb,IAAIN,UAAUO,GAAG,CAACF,QAAQP,OAAOS,GAAG,CAACF,MAAM;oBACzC,OAAOT,OAAOY,IAAI,CAChB,IAAId,iBAAiB,CAAC,wBAAwB,EAAEW,IAAI,CAAC,CAAC,EAAEI,WAAW;wBACjEJ;oBACF;gBAEJ;gBACA,MAAMK,QAAQ,CAAC,MAAM,EAAGP,WAAW,GAAI;gBACvCL,OAAOa,GAAG,CAACN,KAAKK;gBAChBR,IAAIU,IAAI,CAAC;oBAAEC,QAAQ;oBAAWR;gBAAI;gBAClC,OAAOT,OAAOkB,OAAO,CAAC;oBAAET;oBAAKK;gBAAM;YACrC;QACFK,SAAS,CAACC,SACRpB,OAAOqB,IAAI,CAAC;gBACV,IAAInB,OAAOoB,GAAG,CAACF,OAAOX,GAAG,MAAMW,OAAON,KAAK,EAAE;oBAC3CZ,OAAOqB,MAAM,CAACH,OAAOX,GAAG;oBACxBH,IAAIU,IAAI,CAAC;wBAAEC,QAAQ;wBAAWR,KAAKW,OAAOX,GAAG;oBAAC;gBAChD;YACF;QACF,IAAIe,QAAO;YACT,OAAO;mBAAItB,OAAOuB,IAAI;aAAG;QAC3B;QACA,IAAInB,OAAM;YACR,OAAOA;QACT;QACAoB,WAAWjB,CAAAA;YACTL,UAAUuB,GAAG,CAAClB;QAChB;IACF;AACF,EAAE;AAOF;;;CAGC,GACD,OAAO,MAAMmB,8BAA8B;IACzC,MAAMC,YAAY,IAAI1B;IAEtB,OAAO;QACL2B,MAAMC,CAAAA,OACJ/B,OAAOqB,IAAI,CAAC;oBACIQ;gBAAd,MAAMC,OAAO,EAACD,iBAAAA,UAAUP,GAAG,CAACS,iBAAdF,iBAAuB,KAAK;gBAC1CA,UAAUd,GAAG,CAACgB,MAAMD;gBACpB,OAAOA;YACT;QACF,IAAIE,UAAS;YACX,OAAOC,OAAOC,WAAW,CAACL;QAC5B;IACF;AACF,EAAE;AAgBF;;;;CAIC,GACD,OAAO,MAAMM,wBAAwB;IACnC,MAAMC,YAA2B,EAAE;IACnC,MAAMC,WAGD,EAAE;IACP,IAAIC,WAAW;IAEf,OAAO;QACLC,SAASC,CAAAA,QACPxC,OAAOU,OAAO,CAAC;gBACb,IAAI4B,UAAU;oBACZA,WAAW;oBACX,OAAOtC,OAAOY,IAAI,CAChB,IAAIf,iBAAiB,yBAAyBgB,WAAW;wBACvD4B,SAASD,MAAME,EAAE;oBACnB;gBAEJ;gBACAN,UAAUpB,IAAI,CAACwB;gBACf,OAAOxC,OAAO2C,IAAI;YACpB;QACFC,WAAW,CAACC,cAAczB,SACxBpB,OAAOqB,IAAI,CAAC;gBACV,kEAAkE;gBAClE,uEAAuE;gBACvE,gEAAgE;gBAChEgB,SAASrB,IAAI,CAAC;oBAAE8B,SAASD,aAAaC,OAAO;oBAAE1B;gBAAO;YACxD;QACF2B,SAASP,CAAAA,QACPxC,OAAOgD,OAAO,CACZX,SAASY,MAAM,CAAC,CAAC,EAAEH,OAAO,EAAE,GAC1B/C,oBAAoB+C,SAASN,MAAMT,IAAI,IAEzC,CAAC,EAAEX,MAAM,EAAE,GAAKA,OAAOoB,QACvB;gBAAEU,SAAS;YAAK;QAEpB,IAAId,aAAY;YACd,OAAOA;QACT;QACAe,iBAAiB;YACfb,WAAW;QACb;IACF;AACF,EAAE;AAEF;;;;;;;;CAQC,GACD,OAAO,MAAMc,sBAAsB;IACjC,MAAMC,UAAU,IAAIhD;IAEpB,OAAO;QACL,wDAAwD,GACxDiD,KAAK,CAACC,WAAwC,CAAA;gBAC5CC,OAAOf,CAAAA,UACLzC,OAAOqB,IAAI,CAAC;wBACV,MAAMZ,MAAMgD,KAAKC,SAAS,CAAC;4BAACH;4BAAUd;yBAAQ;wBAC9C,IAAIY,QAAQ1C,GAAG,CAACF,MAAM,OAAO;wBAC7B4C,QAAQ1B,GAAG,CAAClB;wBACZ,OAAO;oBACT;YACJ,CAAA;QACA,IAAIkD,UAA2D;YAC7D,OAAO;mBAAIN;aAAQ,CAACO,GAAG,CAACnD,CAAAA;gBACtB,MAAM,CAAC8C,UAAUd,QAAQ,GAAGgB,KAAKI,KAAK,CAACpD;gBACvC,OAAO;oBAAE8C;oBAAUd;gBAAQ;YAC7B;QACF;IACF;AACF,EAAE"}
+{"version":3,"sources":["../../src/doubles/transaction-ports.ts"],"sourcesContent":["import {\n  type DomainEvent,\n  EntifixConnError,\n  type EntifixError,\n  EntifixLockError,\n  matchesEventPattern,\n} from '@entifix/core';\nimport type {\n  EventBus,\n  LockHandle,\n  LockService,\n  SagaInstance,\n  SagaStore,\n  SequenceService,\n  TransactionInbox,\n} from '@entifix/transactions';\nimport { Effect } from 'effect';\n\nexport interface InMemoryLockService extends LockService {\n  /** Keys currently held, in acquisition order. */\n  readonly held: string[];\n  /** Every acquire/release in the order it happened. */\n  readonly log: ReadonlyArray<{ action: 'acquire' | 'release'; key: string }>;\n  /**\n   * Marks `key` as already taken by someone else, so the next `acquire` fails\n   * with {@link EntifixLockError} — the 409 path of the transaction facade.\n   */\n  contendOn(key: string): void;\n}\n\n/**\n * In-memory {@link LockService}. Acquisition is immediate and uncontended\n * unless {@link InMemoryLockService.contendOn} says otherwise, and `release`\n * only frees a lock whose token matches — the compare-and-delete rule the Redis\n * adapter enforces with a Lua script.\n */\nexport const makeInMemoryLockService = (): InMemoryLockService => {\n  const tokens = new Map<string, string>();\n  const contended = new Set<string>();\n  const log: Array<{ action: 'acquire' | 'release'; key: string }> = [];\n  let counter = 0;\n\n  return {\n    acquire: key =>\n      Effect.suspend(() => {\n        if (contended.has(key) || tokens.has(key)) {\n          return Effect.fail(\n            new EntifixLockError(`Could not acquire lock \"${key}\"`, undefined, {\n              key,\n            }),\n          );\n        }\n        const token = `token-${(counter += 1)}`;\n        tokens.set(key, token);\n        log.push({ action: 'acquire', key });\n        return Effect.succeed({ key, token });\n      }),\n    release: (handle: LockHandle) =>\n      Effect.sync(() => {\n        if (tokens.get(handle.key) === handle.token) {\n          tokens.delete(handle.key);\n          log.push({ action: 'release', key: handle.key });\n        }\n      }),\n    get held() {\n      return [...tokens.keys()];\n    },\n    get log() {\n      return log;\n    },\n    contendOn: key => {\n      contended.add(key);\n    },\n  };\n};\n\nexport interface InMemorySequenceService extends SequenceService {\n  /** The current value of every sequence drawn from so far. */\n  readonly values: Readonly<Record<string, number>>;\n}\n\n/**\n * In-memory {@link SequenceService} — a plain counter per name. Atomicity is\n * what the Redis `INCR` adapter buys; single-threaded JS gives it for free here.\n */\nexport const makeInMemorySequenceService = (): InMemorySequenceService => {\n  const sequences = new Map<string, number>();\n\n  return {\n    next: name =>\n      Effect.sync(() => {\n        const next = (sequences.get(name) ?? 0) + 1;\n        sequences.set(name, next);\n        return next;\n      }),\n    get values() {\n      return Object.fromEntries(sequences);\n    },\n  };\n};\n\nexport interface RecordingEventBus extends EventBus {\n  /** Every event published, in order. */\n  readonly published: DomainEvent[];\n  /**\n   * Pushes an event to the subscribers whose pattern matches it, as a topic\n   * exchange would. Deliberately not \"to all subscribers\": routing is the\n   * broker's job in production, so a double that ignored it would let a\n   * consumer pass its tests while receiving traffic it never bound to.\n   */\n  deliver(event: DomainEvent): Effect.Effect<void, EntifixError>;\n  /** Makes the next `publish` fail, for the broker-unavailable branch. */\n  failNextPublish(): void;\n}\n\n/**\n * In-memory {@link EventBus} that records what was published rather than\n * asserting on it. Prefer reading `bus.published` in a test over a mock's call\n * assertions: the expectation then reads as state, not as a spy protocol.\n */\nexport const makeRecordingEventBus = (): RecordingEventBus => {\n  const published: DomainEvent[] = [];\n  const handlers: Array<{\n    pattern: string;\n    handle: (event: DomainEvent) => Effect.Effect<void, EntifixError>;\n  }> = [];\n  let failNext = false;\n\n  return {\n    publish: event =>\n      Effect.suspend(() => {\n        if (failNext) {\n          failNext = false;\n          return Effect.fail(\n            new EntifixConnError('Event bus unavailable', undefined, {\n              eventId: event.id,\n            }),\n          );\n        }\n        published.push(event);\n        return Effect.void;\n      }),\n    subscribe: (subscription, handle) =>\n      Effect.sync(() => {\n        // Only the pattern is retained: queue durability and the delivery\n        // ceiling are broker facts with no in-memory analogue, and faking them\n        // would assert against the double rather than against a broker.\n        handlers.push({ pattern: subscription.pattern, handle });\n      }),\n    deliver: event =>\n      Effect.forEach(\n        handlers.filter(({ pattern }) =>\n          matchesEventPattern(pattern, event.name),\n        ),\n        ({ handle }) => handle(event),\n        { discard: true },\n      ),\n    get published() {\n      return published;\n    },\n    failNextPublish: () => {\n      failNext = true;\n    },\n  };\n};\n\n/**\n * An in-memory {@link TransactionInbox}, one per consumer, over a shared claim\n * set.\n *\n * Sharing the set across the inboxes one factory hands out is what makes the\n * contract's \"one consumer cannot consume another's claim\" case a real\n * assertion, rather than one the double satisfies by only ever having seen a\n * single consumer.\n */\nexport const makeInMemoryInboxes = () => {\n  const claimed = new Set<string>();\n\n  return {\n    /** An inbox for `consumer`, over the shared claim set. */\n    for: (consumer: string): TransactionInbox => ({\n      claim: eventId =>\n        Effect.sync(() => {\n          const key = JSON.stringify([consumer, eventId]);\n          if (claimed.has(key)) return 'duplicate' as const;\n          claimed.add(key);\n          return 'claimed' as const;\n        }),\n    }),\n    get claims(): readonly { consumer: string; eventId: string }[] {\n      return [...claimed].map(key => {\n        const [consumer, eventId] = JSON.parse(key) as [string, string];\n        return { consumer, eventId };\n      });\n    },\n  };\n};\n\nexport interface InMemorySagaStore extends SagaStore {\n  /** Every instance, as stored — for a spec to assert on state, not calls. */\n  readonly instances: readonly SagaInstance[];\n}\n\n/**\n * In-memory {@link SagaStore}, with the Mongo adapter's semantics: `start`\n * never overwrites, outcomes append, and a resume claim only takes an\n * unfinished instance whose `updatedAt` is past the deadline — counting the\n * attempt and re-stamping it, so the next sweep does not find it again.\n */\nexport const makeInMemorySagaStore = (): InMemorySagaStore => {\n  const instances = new Map<string, SagaInstance>();\n  const stamp = () => new Date().toISOString();\n  const unfinished = (entry: SagaInstance) =>\n    entry.state === 'RUNNING' || entry.state === 'COMPENSATING';\n  const pastDeadline = (entry: SagaInstance, olderThanMs: number) =>\n    entry.updatedAt < new Date(Date.now() - olderThanMs).toISOString();\n  const update = (\n    sagaId: string,\n    change: (entry: SagaInstance) => SagaInstance,\n  ) =>\n    Effect.sync(() => {\n      const current = instances.get(sagaId);\n      if (current !== undefined) {\n        instances.set(sagaId, { ...change(current), updatedAt: stamp() });\n      }\n    });\n\n  return {\n    start: started =>\n      Effect.sync(() => {\n        if (!instances.has(started.sagaId)) {\n          instances.set(started.sagaId, { ...started, updatedAt: stamp() });\n        }\n      }),\n    beginStep: (sagaId, stepIndex) =>\n      update(sagaId, entry => ({ ...entry, stepIndex })),\n    recordOutcome: (sagaId, outcome) =>\n      update(sagaId, entry => ({\n        ...entry,\n        outcomes: [...entry.outcomes, outcome],\n      })),\n    settle: (sagaId, state, error) =>\n      update(sagaId, entry => ({ ...entry, state, error })),\n    markCompensated: (sagaId, stepId) =>\n      update(sagaId, entry => ({\n        ...entry,\n        outcomes: entry.outcomes.map(outcome =>\n          outcome.stepId === stepId\n            ? { ...outcome, compensated: true }\n            : outcome,\n        ),\n      })),\n    get: sagaId => Effect.sync(() => instances.get(sagaId)),\n    findStale: olderThanMs =>\n      Effect.sync(() =>\n        [...instances.values()].filter(\n          entry => unfinished(entry) && pastDeadline(entry, olderThanMs),\n        ),\n      ),\n    claimForResume: (sagaId, olderThanMs) =>\n      Effect.sync(() => {\n        const current = instances.get(sagaId);\n        if (\n          current === undefined ||\n          !unfinished(current) ||\n          !pastDeadline(current, olderThanMs)\n        ) {\n          return undefined;\n        }\n        const claimed = {\n          ...current,\n          resumeAttempts: current.resumeAttempts + 1,\n          updatedAt: stamp(),\n        };\n        instances.set(sagaId, claimed);\n        return claimed;\n      }),\n    get instances() {\n      return [...instances.values()];\n    },\n  };\n};\n"],"names":["EntifixConnError","EntifixLockError","matchesEventPattern","Effect","makeInMemoryLockService","tokens","Map","contended","Set","log","counter","acquire","key","suspend","has","fail","undefined","token","set","push","action","succeed","release","handle","sync","get","delete","held","keys","contendOn","add","makeInMemorySequenceService","sequences","next","name","values","Object","fromEntries","makeRecordingEventBus","published","handlers","failNext","publish","event","eventId","id","void","subscribe","subscription","pattern","deliver","forEach","filter","discard","failNextPublish","makeInMemoryInboxes","claimed","for","consumer","claim","JSON","stringify","claims","map","parse","makeInMemorySagaStore","instances","stamp","Date","toISOString","unfinished","entry","state","pastDeadline","olderThanMs","updatedAt","now","update","sagaId","change","current","start","started","beginStep","stepIndex","recordOutcome","outcome","outcomes","settle","error","markCompensated","stepId","compensated","findStale","claimForResume","resumeAttempts"],"mappings":";AAAA,SAEEA,gBAAgB,EAEhBC,gBAAgB,EAChBC,mBAAmB,QACd,gBAAgB;AAUvB,SAASC,MAAM,QAAQ,SAAS;AAchC;;;;;CAKC,GACD,OAAO,MAAMC,0BAA0B;IACrC,MAAMC,SAAS,IAAIC;IACnB,MAAMC,YAAY,IAAIC;IACtB,MAAMC,MAA6D,EAAE;IACrE,IAAIC,UAAU;IAEd,OAAO;QACLC,SAASC,CAAAA,MACPT,OAAOU,OAAO,CAAC;gBACb,IAAIN,UAAUO,GAAG,CAACF,QAAQP,OAAOS,GAAG,CAACF,MAAM;oBACzC,OAAOT,OAAOY,IAAI,CAChB,IAAId,iBAAiB,CAAC,wBAAwB,EAAEW,IAAI,CAAC,CAAC,EAAEI,WAAW;wBACjEJ;oBACF;gBAEJ;gBACA,MAAMK,QAAQ,CAAC,MAAM,EAAGP,WAAW,GAAI;gBACvCL,OAAOa,GAAG,CAACN,KAAKK;gBAChBR,IAAIU,IAAI,CAAC;oBAAEC,QAAQ;oBAAWR;gBAAI;gBAClC,OAAOT,OAAOkB,OAAO,CAAC;oBAAET;oBAAKK;gBAAM;YACrC;QACFK,SAAS,CAACC,SACRpB,OAAOqB,IAAI,CAAC;gBACV,IAAInB,OAAOoB,GAAG,CAACF,OAAOX,GAAG,MAAMW,OAAON,KAAK,EAAE;oBAC3CZ,OAAOqB,MAAM,CAACH,OAAOX,GAAG;oBACxBH,IAAIU,IAAI,CAAC;wBAAEC,QAAQ;wBAAWR,KAAKW,OAAOX,GAAG;oBAAC;gBAChD;YACF;QACF,IAAIe,QAAO;YACT,OAAO;mBAAItB,OAAOuB,IAAI;aAAG;QAC3B;QACA,IAAInB,OAAM;YACR,OAAOA;QACT;QACAoB,WAAWjB,CAAAA;YACTL,UAAUuB,GAAG,CAAClB;QAChB;IACF;AACF,EAAE;AAOF;;;CAGC,GACD,OAAO,MAAMmB,8BAA8B;IACzC,MAAMC,YAAY,IAAI1B;IAEtB,OAAO;QACL2B,MAAMC,CAAAA,OACJ/B,OAAOqB,IAAI,CAAC;oBACIQ;gBAAd,MAAMC,OAAO,EAACD,iBAAAA,UAAUP,GAAG,CAACS,iBAAdF,iBAAuB,KAAK;gBAC1CA,UAAUd,GAAG,CAACgB,MAAMD;gBACpB,OAAOA;YACT;QACF,IAAIE,UAAS;YACX,OAAOC,OAAOC,WAAW,CAACL;QAC5B;IACF;AACF,EAAE;AAgBF;;;;CAIC,GACD,OAAO,MAAMM,wBAAwB;IACnC,MAAMC,YAA2B,EAAE;IACnC,MAAMC,WAGD,EAAE;IACP,IAAIC,WAAW;IAEf,OAAO;QACLC,SAASC,CAAAA,QACPxC,OAAOU,OAAO,CAAC;gBACb,IAAI4B,UAAU;oBACZA,WAAW;oBACX,OAAOtC,OAAOY,IAAI,CAChB,IAAIf,iBAAiB,yBAAyBgB,WAAW;wBACvD4B,SAASD,MAAME,EAAE;oBACnB;gBAEJ;gBACAN,UAAUpB,IAAI,CAACwB;gBACf,OAAOxC,OAAO2C,IAAI;YACpB;QACFC,WAAW,CAACC,cAAczB,SACxBpB,OAAOqB,IAAI,CAAC;gBACV,kEAAkE;gBAClE,uEAAuE;gBACvE,gEAAgE;gBAChEgB,SAASrB,IAAI,CAAC;oBAAE8B,SAASD,aAAaC,OAAO;oBAAE1B;gBAAO;YACxD;QACF2B,SAASP,CAAAA,QACPxC,OAAOgD,OAAO,CACZX,SAASY,MAAM,CAAC,CAAC,EAAEH,OAAO,EAAE,GAC1B/C,oBAAoB+C,SAASN,MAAMT,IAAI,IAEzC,CAAC,EAAEX,MAAM,EAAE,GAAKA,OAAOoB,QACvB;gBAAEU,SAAS;YAAK;QAEpB,IAAId,aAAY;YACd,OAAOA;QACT;QACAe,iBAAiB;YACfb,WAAW;QACb;IACF;AACF,EAAE;AAEF;;;;;;;;CAQC,GACD,OAAO,MAAMc,sBAAsB;IACjC,MAAMC,UAAU,IAAIhD;IAEpB,OAAO;QACL,wDAAwD,GACxDiD,KAAK,CAACC,WAAwC,CAAA;gBAC5CC,OAAOf,CAAAA,UACLzC,OAAOqB,IAAI,CAAC;wBACV,MAAMZ,MAAMgD,KAAKC,SAAS,CAAC;4BAACH;4BAAUd;yBAAQ;wBAC9C,IAAIY,QAAQ1C,GAAG,CAACF,MAAM,OAAO;wBAC7B4C,QAAQ1B,GAAG,CAAClB;wBACZ,OAAO;oBACT;YACJ,CAAA;QACA,IAAIkD,UAA2D;YAC7D,OAAO;mBAAIN;aAAQ,CAACO,GAAG,CAACnD,CAAAA;gBACtB,MAAM,CAAC8C,UAAUd,QAAQ,GAAGgB,KAAKI,KAAK,CAACpD;gBACvC,OAAO;oBAAE8C;oBAAUd;gBAAQ;YAC7B;QACF;IACF;AACF,EAAE;AAOF;;;;;CAKC,GACD,OAAO,MAAMqB,wBAAwB;IACnC,MAAMC,YAAY,IAAI5D;IACtB,MAAM6D,QAAQ,IAAM,IAAIC,OAAOC,WAAW;IAC1C,MAAMC,aAAa,CAACC,QAClBA,MAAMC,KAAK,KAAK,aAAaD,MAAMC,KAAK,KAAK;IAC/C,MAAMC,eAAe,CAACF,OAAqBG,cACzCH,MAAMI,SAAS,GAAG,IAAIP,KAAKA,KAAKQ,GAAG,KAAKF,aAAaL,WAAW;IAClE,MAAMQ,SAAS,CACbC,QACAC,SAEA5E,OAAOqB,IAAI,CAAC;YACV,MAAMwD,UAAUd,UAAUzC,GAAG,CAACqD;YAC9B,IAAIE,YAAYhE,WAAW;gBACzBkD,UAAUhD,GAAG,CAAC4D,QAAQ,aAAKC,OAAOC;oBAAUL,WAAWR;;YACzD;QACF;IAEF,OAAO;QACLc,OAAOC,CAAAA,UACL/E,OAAOqB,IAAI,CAAC;gBACV,IAAI,CAAC0C,UAAUpD,GAAG,CAACoE,QAAQJ,MAAM,GAAG;oBAClCZ,UAAUhD,GAAG,CAACgE,QAAQJ,MAAM,EAAE,aAAKI;wBAASP,WAAWR;;gBACzD;YACF;QACFgB,WAAW,CAACL,QAAQM,YAClBP,OAAOC,QAAQP,CAAAA,QAAU,aAAKA;oBAAOa;;QACvCC,eAAe,CAACP,QAAQQ,UACtBT,OAAOC,QAAQP,CAAAA,QAAU,aACpBA;oBACHgB,UAAU;2BAAIhB,MAAMgB,QAAQ;wBAAED;qBAAQ;;QAE1CE,QAAQ,CAACV,QAAQN,OAAOiB,QACtBZ,OAAOC,QAAQP,CAAAA,QAAU,aAAKA;oBAAOC;oBAAOiB;;QAC9CC,iBAAiB,CAACZ,QAAQa,SACxBd,OAAOC,QAAQP,CAAAA,QAAU,aACpBA;oBACHgB,UAAUhB,MAAMgB,QAAQ,CAACxB,GAAG,CAACuB,CAAAA,UAC3BA,QAAQK,MAAM,KAAKA,SACf,aAAKL;4BAASM,aAAa;6BAC3BN;;QAGV7D,KAAKqD,CAAAA,SAAU3E,OAAOqB,IAAI,CAAC,IAAM0C,UAAUzC,GAAG,CAACqD;QAC/Ce,WAAWnB,CAAAA,cACTvE,OAAOqB,IAAI,CAAC,IACV;uBAAI0C,UAAU/B,MAAM;iBAAG,CAACiB,MAAM,CAC5BmB,CAAAA,QAASD,WAAWC,UAAUE,aAAaF,OAAOG;QAGxDoB,gBAAgB,CAAChB,QAAQJ,cACvBvE,OAAOqB,IAAI,CAAC;gBACV,MAAMwD,UAAUd,UAAUzC,GAAG,CAACqD;gBAC9B,IACEE,YAAYhE,aACZ,CAACsD,WAAWU,YACZ,CAACP,aAAaO,SAASN,cACvB;oBACA,OAAO1D;gBACT;gBACA,MAAMwC,UAAU,aACXwB;oBACHe,gBAAgBf,QAAQe,cAAc,GAAG;oBACzCpB,WAAWR;;gBAEbD,UAAUhD,GAAG,CAAC4D,QAAQtB;gBACtB,OAAOA;YACT;QACF,IAAIU,aAAY;YACd,OAAO;mBAAIA,UAAU/B,MAAM;aAAG;QAChC;IACF;AACF,EAAE"}

package/dist/drivers/fake-mongo.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fake-mongo.d.ts","sourceRoot":"","sources":["../../src/drivers/fake-mongo.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,KAAK,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAuMxC,MAAM,WAAW,mBAAmB;IAClC,uEAAuE;IACvE,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;CAChC;AAED,MAAM,WAAW,WAAW;IAC1B,wCAAwC;IACxC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IACtD,6CAA6C;IAC7C,IAAI,CAAC,UAAU,EAAE,MAAM,GAAG,QAAQ,EAAE,CAAC;IACrC;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAC/B;;;OAGG;IACH,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAChD,4EAA4E;IAC5E,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvE;;;;OAIG;IACH,YAAY,IAAI;QACd,eAAe,CAAC,IAAI,EAAE,MAAM,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAChE,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;KAC5B,CAAC;IACF,2EAA2E;IAC3E,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;CACtB;AAED;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,GAC1B,OAAM,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAM,KACpC,WA0dF,CAAC"}
+{"version":3,"file":"fake-mongo.d.ts","sourceRoot":"","sources":["../../src/drivers/fake-mongo.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,KAAK,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAuMxC,MAAM,WAAW,mBAAmB;IAClC,uEAAuE;IACvE,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;CAChC;AAED,MAAM,WAAW,WAAW;IAC1B,wCAAwC;IACxC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IACtD,6CAA6C;IAC7C,IAAI,CAAC,UAAU,EAAE,MAAM,GAAG,QAAQ,EAAE,CAAC;IACrC;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAC/B;;;OAGG;IACH,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAChD,4EAA4E;IAC5E,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvE;;;;OAIG;IACH,YAAY,IAAI;QACd,eAAe,CAAC,IAAI,EAAE,MAAM,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAChE,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;KAC5B,CAAC;IACF,2EAA2E;IAC3E,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;CACtB;AAED;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,GAC1B,OAAM,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAM,KACpC,WAohBF,CAAC"}

package/dist/drivers/fake-mongo.js

@@ -358,13 +358,20 @@ const matches = (doc, query)=>Object.entries(query).every(([field, condition])=>
      * implements is that an absolute-value write loses updates, so a fake that
      * computed the new total from a value it had already read would model the
      * bug rather than the fix.
+     *
+     * `$push` appends, and a `$set` key of the form `field.$[name].member`
+     * applies to every element of `field` that `options.arrayFilters` selects —
+     * the pair a saga store records an outcome with and later flags one
+     * compensated. Both are what keep an array update from being a
+     * read-modify-write, which is the point of using them.
      */ updateOne: (query, update, options)=>record(name, 'updateOne', ()=>{
                     var _update_$setOnInsert;
                     const supported = [
                         '$set',
                         '$addToSet',
                         '$inc',
-                        '$setOnInsert'
+                        '$setOnInsert',
+                        '$push'
                     ];
                     const unsupported = Object.keys(update).filter((operator)=>!supported.includes(operator));
                     if (unsupported.length > 0) {
@@ -381,9 +388,35 @@ const matches = (doc, query)=>Object.entries(query).every(([field, condition])=>
                     if (conflicting.length > 0) {
                         throw new Error(`fake-mongo: updateOne has conflicting paths in $setOnInsert and $inc/$set: ${conflicting.join(', ')}`);
                     }
-                    /** `$set`, `$addToSet` and `$inc`, which apply on both branches. */ const applyOperators = (base)=>{
-                        var _update_$set, _update_$addToSet, _update_$inc;
-                        const updated = _extends({}, base, (_update_$set = update.$set) != null ? _update_$set : {});
+                    /** `$set`, `$addToSet`, `$inc` and `$push`, which apply on both branches. */ const applyOperators = (base)=>{
+                        var _update_$set, _update_$set1, _update_$push, _update_$addToSet, _update_$inc;
+                        const plain = Object.entries((_update_$set = update.$set) != null ? _update_$set : {}).filter(([field])=>!field.includes('.$['));
+                        const updated = _extends({}, base, Object.fromEntries(plain));
+                        for (const [path, value] of Object.entries((_update_$set1 = update.$set) != null ? _update_$set1 : {})){
+                            var _ref;
+                            const filtered = /^([^.]+)\.\$\[([^\]]+)\]\.(.+)$/.exec(path);
+                            if (filtered === null) continue;
+                            const [, field, identifier, member] = filtered;
+                            // The server refuses a filtered position with no filter naming it.
+                            const conditions = ((_ref = options == null ? void 0 : options.arrayFilters) != null ? _ref : []).flatMap((filter)=>Object.entries(filter).filter(([key])=>key.startsWith(`${identifier}.`)).map(([key, condition])=>[
+                                        key.slice(identifier.length + 1),
+                                        condition
+                                    ]));
+                            if (conditions.length === 0) {
+                                throw new Error(`fake-mongo: no array filter found for identifier ${identifier}`);
+                            }
+                            const current = updated[field];
+                            updated[field] = (Array.isArray(current) ? current : []).map((element)=>isPlainObject(element) && conditions.every(([key, condition])=>matchesCondition(element[key], condition)) ? _extends({}, element, {
+                                    [member]: value
+                                }) : element);
+                        }
+                        for (const [field, value] of Object.entries((_update_$push = update.$push) != null ? _update_$push : {})){
+                            const current = updated[field];
+                            updated[field] = [
+                                ...Array.isArray(current) ? current : [],
+                                value
+                            ];
+                        }
                         for (const [field, value] of Object.entries((_update_$addToSet = update.$addToSet) != null ? _update_$addToSet : {})){
                             const current = updated[field];
                             const array = Array.isArray(current) ? current : [];

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.2",
   "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/business": "0.1.2",
+    "@entifix/transactions": "0.1.2",
+    "@entifix/core": "0.1.2"
   },
   "peerDependencies": {
     "@effect/vitest": ">=0.30 <1",
@@ -91,7 +89,7 @@
     "msw": "*",
     "react": "*",
     "vitest": "*",
-    "@entifix/react-controls": "0.1.1"
+    "@entifix/react-controls": "0.1.2"
   },
   "peerDependenciesMeta": {
     "@effect/vitest": {