@openai/codex-security 0.1.28 → 0.1.30
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +93 -4
- package/_bundled_plugin/examples/completed-scan/report.md +0 -1
- package/_bundled_plugin/mcp/native/win32-arm64/windows.node +0 -0
- package/_bundled_plugin/mcp/native/win32-x64/windows.node +0 -0
- package/_bundled_plugin/mcp/server.mjs.br.part-000 +0 -0
- package/_bundled_plugin/mcp/server.mjs.br.part-001 +0 -0
- package/_bundled_plugin/scripts/finalize_scan_contract.py +2 -0
- package/_bundled_plugin/scripts/generate_in_scope_files.py +12 -2
- package/_bundled_plugin/scripts/generate_rank_input.py +1 -6
- package/_bundled_plugin/scripts/rank_preview.py +8 -7
- package/_bundled_plugin/scripts/report_projection.py +0 -1
- package/_bundled_plugin/scripts/workbench_dashboard.py +24 -3
- package/_bundled_plugin/scripts/workbench_saved_results.py +5 -0
- package/dist/cli-scan-logs-json.d.ts +3 -0
- package/dist/cli-scan-logs-json.d.ts.map +1 -0
- package/dist/cli-scan-logs-json.js +22 -0
- package/dist/cli-scan-logs-json.js.map +1 -0
- package/dist/cli.d.ts +2 -0
- package/dist/cli.d.ts.map +1 -1
- package/dist/cli.js +206 -34
- package/dist/cli.js.map +1 -1
- package/dist/deduplication/codex-review.d.ts +2 -7
- package/dist/deduplication/codex-review.d.ts.map +1 -1
- package/dist/deduplication/codex-review.js +26 -4
- package/dist/deduplication/codex-review.js.map +1 -1
- package/dist/deduplication/deduplication-prompts.d.ts +2 -0
- package/dist/deduplication/deduplication-prompts.d.ts.map +1 -1
- package/dist/deduplication/deduplication-prompts.js +2 -2
- package/dist/deduplication/deduplication-prompts.js.map +1 -1
- package/dist/deduplication/deduplication-reviewer.d.ts.map +1 -1
- package/dist/deduplication/deduplication-reviewer.js +4 -10
- package/dist/deduplication/deduplication-reviewer.js.map +1 -1
- package/dist/deduplication/deduplication.d.ts +12 -1
- package/dist/deduplication/deduplication.d.ts.map +1 -1
- package/dist/deduplication/deduplication.js +41 -7
- package/dist/deduplication/deduplication.js.map +1 -1
- package/dist/deduplication/finding-schema.d.ts +4 -0
- package/dist/deduplication/finding-schema.d.ts.map +1 -0
- package/dist/deduplication/finding-schema.js +14 -0
- package/dist/deduplication/finding-schema.js.map +1 -0
- package/dist/deduplication/records-protocol.d.ts +9 -0
- package/dist/deduplication/records-protocol.d.ts.map +1 -0
- package/dist/deduplication/records-protocol.js +191 -0
- package/dist/deduplication/records-protocol.js.map +1 -0
- package/dist/deduplication/records.d.ts +33 -0
- package/dist/deduplication/records.d.ts.map +1 -0
- package/dist/deduplication/records.js +134 -0
- package/dist/deduplication/records.js.map +1 -0
- package/dist/deduplication/refusal.d.ts +3 -0
- package/dist/deduplication/refusal.d.ts.map +1 -0
- package/dist/deduplication/refusal.js +16 -0
- package/dist/deduplication/refusal.js.map +1 -0
- package/dist/deduplication/review.d.ts +21 -0
- package/dist/deduplication/review.d.ts.map +1 -0
- package/dist/deduplication/review.js +2 -0
- package/dist/deduplication/review.js.map +1 -0
- package/dist/errors.d.ts +1 -1
- package/dist/errors.d.ts.map +1 -1
- package/dist/errors.js.map +1 -1
- package/dist/index.d.ts +4 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +1 -0
- package/dist/index.js.map +1 -1
- package/dist/scan-logs.d.ts.map +1 -1
- package/dist/scan-logs.js +34 -8
- package/dist/scan-logs.js.map +1 -1
- package/dist/server/dashboard/THIRD_PARTY_NOTICES.txt +3 -3
- package/dist/server/dashboard/app.css +1 -1
- package/dist/server/dashboard/app.js +7 -7
- package/dist/server/dashboard-types.d.ts +4 -1
- package/dist/server/dashboard-types.d.ts.map +1 -1
- package/dist/server/dashboard-types.js.map +1 -1
- package/dist/server/dashboard.d.ts.map +1 -1
- package/dist/server/dashboard.js +18 -4
- package/dist/server/dashboard.js.map +1 -1
- package/dist/targets.d.ts.map +1 -1
- package/dist/targets.js +4 -4
- package/dist/targets.js.map +1 -1
- package/docs/dedupe-records.md +305 -0
- package/package.json +14 -13
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"deduplication.js","sourceRoot":"","sources":["../../src/deduplication/deduplication.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EACL,OAAO,EACP,iBAAiB,GAElB,MAAM,6BAA6B,CAAC;AAErC,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAE5C,MAAM,UAAU,wBAAwB,CACtC,WAAW,GAAG,0BAA0B;IAExC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC;QACvD,MAAM,IAAI,kBAAkB,CAC1B,8CAA8C,CAC/C,CAAC;IACJ,OAAO,WAAW,CAAC;AACrB,CAAC;AAID,KAAK,UAAU,SAAS,CACtB,OAAc,EACd,KAAY,EACZ,WAAmB,EACnB,MAAoB;IAEpB,IAAI,OAAuC,CAAC;IAC5C,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;QAClC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,UAAU,GAAG,CAAC,GAAQ;YACzB,IAAI,CAAC;gBACH,MAAM,GAAG,EAAE,CAAC;YACd,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,KAAK,EAAE,KAAK,EAAE,CAAC;YACxB,CAAC;oBAAS,CAAC;gBACT,OAAO,EAAE,CAAC;gBACV,IAAI,EAAE,CAAC;YACT,CAAC;QACH,CAAC;QACD,SAAS,IAAI;YACX,OACE,OAAO,KAAK,SAAS;gBACrB,CAAC,MAAM,EAAE,OAAO;gBAChB,OAAO,GAAG,WAAW,EACrB,CAAC;gBACD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC7C,IAAI,GAAG,KAAK,SAAS;oBAAE,MAAM;gBAC7B,OAAO,EAAE,CAAC;gBACV,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;YACD,yEAAyE;YACzE,kEAAkE;YAClE,IAAI,OAAO,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;QAC/B,CAAC;QACD,IAAI,EAAE,CAAC;IACT,CAAC,CAAC,CAAC;IACH,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,OAAO,CAAC,KAAK,CAAC;AACjD,CAAC;AAQD,MAAM,aAAa,GAAiD;IAClE,QAAQ,EAAE,CAAC;IACX,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,GAAG,EAAE,CAAC;IACN,aAAa,EAAE,CAAC;CACjB,CAAC;AAEF,SAAS,UAAU,CACjB,IAAuB,EACvB,KAAwB;IAExB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAE,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;IACxE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD,SAAS,UAAU,CACjB,OAAyC,EACzC,IAAY,EACZ,KAAa;IAEb,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACnE,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACrE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAClB,SAAmC,EACnC,IAAY,EACZ,KAAa;IAEb,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IAC/D,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IACjE,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACnC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;AACvC,CAAC;AAED,mFAAmF;AACnF,gBAAgB;AAChB,MAAM,UAAU,0BAA0B,CACxC,UAA6B,EAC7B,SAAiD,EACjD,aAAqD,EACrD,MAAoB,EACpB,OAAsC;IAEtC,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CACzD,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CACpE,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS;QACnC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa;QACvC,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAElE,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,IAAI,QAA+C,CAAC;QACpD,IAAI,aAA4C,CAAC;QACjD,KAAK,MAAM,WAAW,IAAI,MAAM,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClE,IACE,WAAW,IAAI,YAAY;oBAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC;oBACzB,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC;oBAE7C,SAAS;gBACX,IAAI,OAAO;oBAAE,OAAO,CAAC,oBAAoB,EAAE,CAAC;gBAC5C,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACjD,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACnD,KAAK,MAAM,KAAK,IAAI,aAAa,IAAI,EAAE,EAAE,CAAC;oBACxC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,YAAY,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,KAAK,CAAC;wBACvD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/D,CAAC;gBACD,KAAK,MAAM,KAAK,IAAI,cAAc,IAAI,EAAE,EAAE,CAAC;oBACzC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,WAAW,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC;wBACrD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC9D,CAAC;gBACD,MAAM,KAAK,GAAG;oBACZ,IAAI,GAAG,YAAY;oBACnB,IAAI;oBACJ,CAAC,YAAY;oBACb,CAAC,WAAW;oBACZ,CAAC,YAAY;iBACd,CAAC;gBACF,IAAI,aAAa,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;oBACpE,QAAQ,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;oBACvC,aAAa,GAAG,KAAK,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YACxB,OAAO,CAAC,GAAG,MAAM,CAAC;iBACf,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,GAAG,QAAQ,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAE;YAC9C,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE5B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC1E,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC5E,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;YAC/B,GAAG,WAAW,CAAC,IAAI,EAAE;YACrB,GAAG,YAAY,CAAC,IAAI,EAAE;SACvB,CAAC,CAAC;QACH,gBAAgB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACtC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjC,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,MAAM,MAAM,GACV,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACvE,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAClC,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YAC/C,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACrC,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE7B,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;YAC9B,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YACrC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;SACvC,CAAC,CAAC;QACH,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACpC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,iBAAiB,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YACnD,iBAAiB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACvC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;;YACrE,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACnC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED,gBAAgB;AAChB,MAAM,OAAO,mBAAmB;IAEX,UAAU;IAGV,QAAQ;IACR,MAAM;IACN,WAAW;IAN9B,YACmB,UAEhB,EACgB,QAA+B,EAC/B,MAAoB,EACpB,WAAW,GAAG,0BAA0B;0BALxC,UAAU;wBAGV,QAAQ;sBACR,MAAM;2BACN,WAAW;IAC3B,CAAC;IAEJ,KAAK,CAAC,GAAG,CAAC,UAA6B;QACrC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC5C,MAAM,aAAa,GAAG,IAAI,KAAK,CAAY,GAAG,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,SAAS,CACb,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE;YAChC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC;QACzE,CAAC,CAAC,EACF,EAAE,EACF,WAAW,EACX,IAAI,CAAC,MAAM,CACZ,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAQlB,CAAC;QACJ,yEAAyE;QACzE,6EAA6E;QAC7E,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,KAAK,MAAM,OAAO,IAAI,YAAY;gBAChC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC3C,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7C,MAAM,IAAI,GAAqB;oBAC7B,YAAY,CAAC,CAAC,CAAE,CAAC,SAAS;oBAC1B,QAAQ,CAAC,SAAS;iBACnB,CAAC;gBACF,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC/D,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC;oBACjB,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,aAAa;aAC1B,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;aACjD,GAAG,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE;YAChC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAC3D,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC7D,MAAM,GAAG,GAAG,OAAO,CAAC;oBAClB,YAAY,CAAC,CAAC,CAAE,CAAC,SAAS;oBAC1B,YAAY,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,SAAS;iBACnC,CAAC,CAAC;gBACH,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBAC9B,IACE,SAAS,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAE,CAAC,QAAQ;oBACvD,UAAU;oBAEV,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;gBACxB,KAAK,CAAC,SAAS,EAAE,CAAC;gBAClB,oEAAoE;gBACpE,kEAAkE;gBAClE,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;oBAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;wBACpB,KAAK,CAAC,QAAQ,GAAG,CACf,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAC5B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CACzC,CACF,CAAC,QAAQ,CAAC;oBACb,CAAC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QACL,MAAM,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAE1D,kDAAkD;QAClD,MAAM,SAAS,GAAuB,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAuB,EAAE,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,KAAK,MAAM;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;;gBACpD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAU,EAAE,CAAC;gBAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBAC1D,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAIV,EAAE,CAAC;QACT,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAuC,CAAC;QAC1E,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9D,MAAM,SAAS,GAAgC;gBAC7C,OAAO,EAAE,EAAE;gBACX,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,EAAE;aACb,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;gBAC9B,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAC7C,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC1C,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,oEAAoE;QACpE,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE;YAC9B,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,SAAS;YAC1B,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,SAAS,IAAI,SAAS,KAAK,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5D,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,eAAe,GAAe,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,MAAM,GACV,SAAS,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC7B,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC,CAAC,0BAA0B,CACxB,SAAS,CAAC,OAAO,EACjB,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,QAAQ,EAClB,IAAI,CAAC,MAAM,CACZ,CAAC;YACR,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAAE,SAAS;gBACnE,YAAY,CAAC,IAAI,CACf,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAC/C,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBACpD,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC7C,CAAC;gBACF,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACnC,KAAK,MAAM,MAAM,IAAI,YAAY;oBAC/B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO;YACL,gBAAgB,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACxE,eAAe;YACf,mBAAmB,EAAE,WAAW;SACjC,CAAC;IACJ,CAAC;CACF","sourcesContent":["import type { Finding } from \"../models.js\";\nimport type { FindingNeighborhood } from \"../finding-retrieval.js\";\nimport { CodexSecurityError } from \"../errors.js\";\nimport {\n pairKey,\n screeningPairSlot,\n type DeduplicationReviewer,\n} from \"./deduplication-reviewer.js\";\n\nexport const DEFAULT_DEDUPE_CONCURRENCY = 8;\n\nexport function deduplicationConcurrency(\n concurrency = DEFAULT_DEDUPE_CONCURRENCY,\n): number {\n if (!Number.isSafeInteger(concurrency) || concurrency < 1)\n throw new CodexSecurityError(\n \"concurrency must be a positive safe integer.\",\n );\n return concurrency;\n}\n\ntype Job = () => Promise<void>;\n\nasync function runQueued(\n pending: Job[],\n ready: Job[],\n concurrency: number,\n signal?: AbortSignal,\n): Promise<void> {\n let failure: { error: unknown } | undefined;\n await new Promise<void>((resolve) => {\n let running = 0;\n async function run(job: Job): Promise<void> {\n try {\n await job();\n } catch (error) {\n failure ??= { error };\n } finally {\n running--;\n pump();\n }\n }\n function pump(): void {\n while (\n failure === undefined &&\n !signal?.aborted &&\n running < concurrency\n ) {\n const job = ready.shift() ?? pending.shift();\n if (job === undefined) break;\n running++;\n void run(job);\n }\n // An active producer can still enqueue work. After failure, drain active\n // jobs so successful reviews can finish saving their checkpoints.\n if (running === 0) resolve();\n }\n pump();\n });\n signal?.throwIfAborted();\n if (failure !== undefined) throw failure.error;\n}\n\nexport interface DeduplicationResult {\n uniqueFindingIds: string[];\n duplicateGroups: string[][];\n deduplicationStatus: \"completed\";\n}\n\nconst severityOrder: Record<Finding[\"severity\"][\"level\"], number> = {\n critical: 0,\n high: 1,\n medium: 2,\n low: 3,\n informational: 4,\n};\n\nfunction scoreAfter(\n left: readonly number[],\n right: readonly number[],\n): boolean {\n for (let index = 0; index < left.length; index++) {\n if (left[index] !== right[index]) return left[index]! > right[index]!;\n }\n return false;\n}\n\n/** @internal */\nexport interface ContradictionGroupingMetrics {\n candidateEvaluations: number;\n conflictNeighborChecks: number;\n}\n\nfunction addSupport(\n support: Map<number, Map<number, number>>,\n left: number,\n right: number,\n): void {\n const leftSupport = support.get(left) ?? new Map<number, number>();\n const rightSupport = support.get(right) ?? new Map<number, number>();\n leftSupport.set(right, (leftSupport.get(right) ?? 0) + 1);\n rightSupport.set(left, (rightSupport.get(left) ?? 0) + 1);\n support.set(left, leftSupport);\n support.set(right, rightSupport);\n}\n\nfunction addConflict(\n conflicts: Map<number, Set<number>>,\n left: number,\n right: number,\n): void {\n const leftConflicts = conflicts.get(left) ?? new Set<number>();\n const rightConflicts = conflicts.get(right) ?? new Set<number>();\n leftConflicts.add(right);\n rightConflicts.add(left);\n conflicts.set(left, leftConflicts);\n conflicts.set(right, rightConflicts);\n}\n\n/** Greedily retain the best-supported legal merges, using input order for ties. */\n/** @internal */\nexport function contradictionFreeSubgroups(\n findingIds: readonly string[],\n samePairs: readonly (readonly [string, string])[],\n distinctPairs: readonly (readonly [string, string])[],\n signal?: AbortSignal,\n metrics?: ContradictionGroupingMetrics,\n): Set<string>[] {\n const indexes = new Map(\n findingIds.map((findingId, index) => [findingId, index]),\n );\n const active = new Set(findingIds.map((_findingId, index) => index));\n const clusters = new Map(\n findingIds.map((findingId, index) => [index, new Set([findingId])]),\n );\n const support = new Map<number, Map<number, number>>();\n for (const [left, right] of samePairs)\n addSupport(support, indexes.get(left)!, indexes.get(right)!);\n const conflicts = new Map<number, Set<number>>();\n for (const [left, right] of distinctPairs)\n addConflict(conflicts, indexes.get(left)!, indexes.get(right)!);\n\n while (true) {\n signal?.throwIfAborted();\n let selected: readonly [number, number] | undefined;\n let selectedScore: readonly number[] | undefined;\n for (const leftCluster of active) {\n for (const [rightCluster, gain] of support.get(leftCluster) ?? []) {\n if (\n leftCluster >= rightCluster ||\n !active.has(rightCluster) ||\n conflicts.get(leftCluster)?.has(rightCluster)\n )\n continue;\n if (metrics) metrics.candidateEvaluations++;\n let newlyBlocked = 0;\n const leftConflicts = conflicts.get(leftCluster);\n const rightConflicts = conflicts.get(rightCluster);\n for (const other of leftConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== rightCluster && !rightConflicts?.has(other))\n newlyBlocked += support.get(rightCluster)?.get(other) ?? 0;\n }\n for (const other of rightConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== leftCluster && !leftConflicts?.has(other))\n newlyBlocked += support.get(leftCluster)?.get(other) ?? 0;\n }\n const score = [\n gain - newlyBlocked,\n gain,\n -newlyBlocked,\n -leftCluster,\n -rightCluster,\n ];\n if (selectedScore === undefined || scoreAfter(score, selectedScore)) {\n selected = [leftCluster, rightCluster];\n selectedScore = score;\n }\n }\n }\n if (selected === undefined)\n return [...active]\n .map((cluster) => clusters.get(cluster)!)\n .filter((members) => members.size > 1);\n const [leftCluster, rightCluster] = selected;\n for (const member of clusters.get(rightCluster)!)\n clusters.get(leftCluster)!.add(member);\n clusters.delete(rightCluster);\n active.delete(rightCluster);\n\n const leftSupport = support.get(leftCluster) ?? new Map<number, number>();\n const rightSupport = support.get(rightCluster) ?? new Map<number, number>();\n const supportNeighbors = new Set([\n ...leftSupport.keys(),\n ...rightSupport.keys(),\n ]);\n supportNeighbors.delete(leftCluster);\n supportNeighbors.delete(rightCluster);\n leftSupport.delete(rightCluster);\n for (const neighbor of supportNeighbors) {\n const weight =\n (leftSupport.get(neighbor) ?? 0) + (rightSupport.get(neighbor) ?? 0);\n leftSupport.set(neighbor, weight);\n const neighborSupport = support.get(neighbor)!;\n neighborSupport.delete(rightCluster);\n neighborSupport.set(leftCluster, weight);\n }\n support.set(leftCluster, leftSupport);\n support.delete(rightCluster);\n\n const mergedConflicts = new Set([\n ...(conflicts.get(leftCluster) ?? []),\n ...(conflicts.get(rightCluster) ?? []),\n ]);\n mergedConflicts.delete(leftCluster);\n mergedConflicts.delete(rightCluster);\n for (const neighbor of mergedConflicts) {\n const neighborConflicts = conflicts.get(neighbor)!;\n neighborConflicts.delete(rightCluster);\n neighborConflicts.add(leftCluster);\n }\n if (mergedConflicts.size > 0) conflicts.set(leftCluster, mergedConflicts);\n else conflicts.delete(leftCluster);\n conflicts.delete(rightCluster);\n }\n}\n\n/** @internal */\nexport class FindingDeduplicator {\n constructor(\n private readonly candidates: {\n potentialDuplicates(findingId: string): Promise<FindingNeighborhood>;\n },\n private readonly reviewer: DeduplicationReviewer,\n private readonly signal?: AbortSignal,\n private readonly concurrency = DEFAULT_DEDUPE_CONCURRENCY,\n ) {}\n\n async run(findingIds: readonly string[]): Promise<DeduplicationResult> {\n this.signal?.throwIfAborted();\n const concurrency = deduplicationConcurrency(this.concurrency);\n const ids = [...new Set(findingIds)];\n const findings = new Map<string, Finding>();\n const neighborhoods = new Array<Finding[]>(ids.length);\n await runQueued(\n ids.map((id, index) => async () => {\n const result = await this.candidates.potentialDuplicates(id);\n this.signal?.throwIfAborted();\n neighborhoods[index] = [result.finding, ...result.potentialDuplicates];\n }),\n [],\n concurrency,\n this.signal,\n );\n const pairs = new Map<\n string,\n {\n ids: [string, string];\n remaining: number;\n rejected: boolean;\n decision?: \"SAME\" | \"DISTINCT\";\n }\n >();\n // Freeze records, insertion order, and the last nominating anchor's pair\n // orientation before reviews run, preserving grouping and checkpoint inputs.\n for (const neighborhood of neighborhoods) {\n this.signal?.throwIfAborted();\n for (const finding of neighborhood)\n findings.set(finding.findingId, finding);\n for (const neighbor of neighborhood.slice(1)) {\n const pair: [string, string] = [\n neighborhood[0]!.findingId,\n neighbor.findingId,\n ];\n const key = pairKey(pair);\n const state = pairs.get(key);\n if (state === undefined) {\n pairs.set(key, { ids: pair, remaining: 1, rejected: false });\n } else {\n state.ids = pair;\n state.remaining++;\n }\n }\n }\n\n const ready: Job[] = [];\n const pending = neighborhoods\n .filter((neighborhood) => neighborhood.length > 1)\n .map((neighborhood) => async () => {\n const screening = await this.reviewer.screen(neighborhood);\n this.signal?.throwIfAborted();\n for (let index = 0; index < neighborhood.length - 1; index++) {\n const key = pairKey([\n neighborhood[0]!.findingId,\n neighborhood[index + 1]!.findingId,\n ]);\n const state = pairs.get(key)!;\n if (\n screening.decisions[screeningPairSlot(index)]!.decision ===\n \"DISTINCT\"\n )\n state.rejected = true;\n state.remaining--;\n // Wait for every screening of this pair: a later DISTINCT veto must\n // prevent verification, including a verification that could fail.\n if (state.remaining === 0 && !state.rejected) {\n ready.push(async () => {\n state.decision = (\n await this.reviewer.reviewPair(\n state.ids.map((id) => findings.get(id)!),\n )\n ).decision;\n });\n }\n }\n });\n await runQueued(pending, ready, concurrency, this.signal);\n\n // Completion order must not change grouping ties.\n const supported: [string, string][] = [];\n const rejected: [string, string][] = [];\n for (const state of pairs.values()) {\n this.signal?.throwIfAborted();\n if (state.decision === \"SAME\") supported.push(state.ids);\n else rejected.push(state.ids);\n }\n\n const adjacent = new Map<string, Set<string>>();\n for (const pair of supported) {\n for (const [left, right] of [pair, [pair[1], pair[0]]] as const) {\n const neighbors = adjacent.get(left) ?? new Set<string>();\n neighbors.add(right);\n adjacent.set(left, neighbors);\n }\n }\n\n const components: {\n members: string[];\n supported: [string, string][];\n rejected: [string, string][];\n }[] = [];\n const componentByFinding = new Map<string, (typeof components)[number]>();\n for (const id of findings.keys()) {\n this.signal?.throwIfAborted();\n if (!adjacent.has(id) || componentByFinding.has(id)) continue;\n const component: (typeof components)[number] = {\n members: [],\n supported: [],\n rejected: [],\n };\n components.push(component);\n const pending = [id];\n while (pending.length > 0) {\n const member = pending.pop()!;\n if (componentByFinding.has(member)) continue;\n componentByFinding.set(member, component);\n pending.push(...adjacent.get(member)!);\n }\n }\n // Preserve finding insertion order for contradiction-grouping ties.\n for (const id of findings.keys())\n componentByFinding.get(id)?.members.push(id);\n for (const pair of supported)\n componentByFinding.get(pair[0])!.supported.push(pair);\n for (const pair of rejected) {\n const component = componentByFinding.get(pair[0]);\n if (component && component === componentByFinding.get(pair[1]))\n component.rejected.push(pair);\n }\n\n const selected = new Set(ids);\n const duplicateGroups: string[][] = [];\n const canonical = new Map<string, string>();\n for (const component of components) {\n this.signal?.throwIfAborted();\n const groups =\n component.rejected.length === 0\n ? [new Set(component.members)]\n : contradictionFreeSubgroups(\n component.members,\n component.supported,\n component.rejected,\n this.signal,\n );\n for (const group of groups) {\n const groupMembers = [...group];\n if (!groupMembers.some((member) => selected.has(member))) continue;\n groupMembers.sort(\n (left, right) =>\n severityOrder[findings.get(left)!.severity.level] -\n severityOrder[findings.get(right)!.severity.level] ||\n (left < right ? -1 : left > right ? 1 : 0),\n );\n duplicateGroups.push(groupMembers);\n for (const member of groupMembers)\n canonical.set(member, groupMembers[0]!);\n }\n }\n return {\n uniqueFindingIds: [...new Set(ids.map((id) => canonical.get(id) ?? id))],\n duplicateGroups,\n deduplicationStatus: \"completed\",\n };\n }\n}\n"]}
|
|
1
|
+
{"version":3,"file":"deduplication.js","sourceRoot":"","sources":["../../src/deduplication/deduplication.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,kBAAkB,EAClB,wBAAwB,GAEzB,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,OAAO,EACP,iBAAiB,GAGlB,MAAM,6BAA6B,CAAC;AAErC,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAE5C,MAAM,UAAU,wBAAwB,CACtC,WAAW,GAAG,0BAA0B;IAExC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC;QACvD,MAAM,IAAI,kBAAkB,CAC1B,8CAA8C,CAC/C,CAAC;IACJ,OAAO,WAAW,CAAC;AACrB,CAAC;AAID,KAAK,UAAU,SAAS,CACtB,OAAc,EACd,KAAY,EACZ,WAAmB,EACnB,MAAoB;IAEpB,IAAI,OAAuC,CAAC;IAC5C,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;QAClC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,UAAU,GAAG,CAAC,GAAQ;YACzB,IAAI,CAAC;gBACH,MAAM,GAAG,EAAE,CAAC;YACd,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,KAAK,EAAE,KAAK,EAAE,CAAC;YACxB,CAAC;oBAAS,CAAC;gBACT,OAAO,EAAE,CAAC;gBACV,IAAI,EAAE,CAAC;YACT,CAAC;QACH,CAAC;QACD,SAAS,IAAI;YACX,OACE,OAAO,KAAK,SAAS;gBACrB,CAAC,MAAM,EAAE,OAAO;gBAChB,OAAO,GAAG,WAAW,EACrB,CAAC;gBACD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC7C,IAAI,GAAG,KAAK,SAAS;oBAAE,MAAM;gBAC7B,OAAO,EAAE,CAAC;gBACV,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;YACD,yEAAyE;YACzE,kEAAkE;YAClE,IAAI,OAAO,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;QAC/B,CAAC;QACD,IAAI,EAAE,CAAC;IACT,CAAC,CAAC,CAAC;IACH,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,OAAO,CAAC,KAAK,CAAC;AACjD,CAAC;AAmBD,MAAM,aAAa,GAAiD;IAClE,QAAQ,EAAE,CAAC;IACX,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,GAAG,EAAE,CAAC;IACN,aAAa,EAAE,CAAC;CACjB,CAAC;AAEF,SAAS,UAAU,CACjB,IAAuB,EACvB,KAAwB;IAExB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAE,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;IACxE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD,SAAS,UAAU,CACjB,OAAyC,EACzC,IAAY,EACZ,KAAa;IAEb,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACnE,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACrE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAClB,SAAmC,EACnC,IAAY,EACZ,KAAa;IAEb,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IAC/D,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IACjE,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACnC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;AACvC,CAAC;AAED,mFAAmF;AACnF,gBAAgB;AAChB,MAAM,UAAU,0BAA0B,CACxC,UAA6B,EAC7B,SAAiD,EACjD,aAAqD,EACrD,MAAoB,EACpB,OAAsC;IAEtC,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CACzD,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CACpE,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS;QACnC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa;QACvC,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAElE,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,IAAI,QAA+C,CAAC;QACpD,IAAI,aAA4C,CAAC;QACjD,KAAK,MAAM,WAAW,IAAI,MAAM,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClE,IACE,WAAW,IAAI,YAAY;oBAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC;oBACzB,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC;oBAE7C,SAAS;gBACX,IAAI,OAAO;oBAAE,OAAO,CAAC,oBAAoB,EAAE,CAAC;gBAC5C,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACjD,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACnD,KAAK,MAAM,KAAK,IAAI,aAAa,IAAI,EAAE,EAAE,CAAC;oBACxC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,YAAY,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,KAAK,CAAC;wBACvD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/D,CAAC;gBACD,KAAK,MAAM,KAAK,IAAI,cAAc,IAAI,EAAE,EAAE,CAAC;oBACzC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,WAAW,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC;wBACrD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC9D,CAAC;gBACD,MAAM,KAAK,GAAG;oBACZ,IAAI,GAAG,YAAY;oBACnB,IAAI;oBACJ,CAAC,YAAY;oBACb,CAAC,WAAW;oBACZ,CAAC,YAAY;iBACd,CAAC;gBACF,IAAI,aAAa,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;oBACpE,QAAQ,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;oBACvC,aAAa,GAAG,KAAK,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YACxB,OAAO,CAAC,GAAG,MAAM,CAAC;iBACf,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,GAAG,QAAQ,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAE;YAC9C,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE5B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC1E,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC5E,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;YAC/B,GAAG,WAAW,CAAC,IAAI,EAAE;YACrB,GAAG,YAAY,CAAC,IAAI,EAAE;SACvB,CAAC,CAAC;QACH,gBAAgB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACtC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjC,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,MAAM,MAAM,GACV,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACvE,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAClC,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YAC/C,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACrC,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE7B,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;YAC9B,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YACrC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;SACvC,CAAC,CAAC;QACH,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACpC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,iBAAiB,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YACnD,iBAAiB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACvC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;;YACrE,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACnC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED,gBAAgB;AAChB,MAAM,OAAO,mBAAmB;IAEX,UAAU;IAGV,QAAQ;IACR,MAAM;IACN,WAAW;IAN9B,YACmB,UAEhB,EACgB,QAA+B,EAC/B,MAAoB,EACpB,WAAW,GAAG,0BAA0B;0BALxC,UAAU;wBAGV,QAAQ;sBACR,MAAM;2BACN,WAAW;IAC3B,CAAC;IAEJ,KAAK,CAAC,GAAG,CAAC,UAA6B;QACrC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAgC,CAAC;QACzD,MAAM,aAAa,GAAG,CAAC,KAAc,EAAE,GAAa,EAAQ,EAAE;YAC5D,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IACE,CAAC,CAAC,KAAK,YAAY,wBAAwB,CAAC;gBAC5C,KAAK,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS;gBAErC,MAAM,KAAK,CAAC;YACd,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE;gBAC5C,QAAQ,EAAE,aAAa;gBACvB,KAAK;gBACL,KAAK;gBACL,UAAU,EAAE,GAAG;gBACf,MAAM;aACP,CAAC,CAAC;QACL,CAAC,CAAC;QACF,MAAM,aAAa,GAAG,IAAI,KAAK,CAAY,GAAG,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,SAAS,CACb,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE;YAChC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC;QACzE,CAAC,CAAC,EACF,EAAE,EACF,WAAW,EACX,IAAI,CAAC,MAAM,CACZ,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAQlB,CAAC;QACJ,yEAAyE;QACzE,6EAA6E;QAC7E,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,KAAK,MAAM,OAAO,IAAI,YAAY;gBAChC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC3C,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7C,MAAM,IAAI,GAAqB;oBAC7B,YAAY,CAAC,CAAC,CAAE,CAAC,SAAS;oBAC1B,QAAQ,CAAC,SAAS;iBACnB,CAAC;gBACF,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC/D,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC;oBACjB,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,aAAa;aAC1B,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;aACjD,GAAG,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE;YAChC,IAAI,SAAsC,CAAC;YAC3C,IAAI,CAAC;gBACH,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACvD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,aAAa,CACX,KAAK,EACL,YAAY,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CACjD,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC7D,MAAM,GAAG,GAAG,OAAO,CAAC;oBAClB,YAAY,CAAC,CAAC,CAAE,CAAC,SAAS;oBAC1B,YAAY,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,SAAS;iBACnC,CAAC,CAAC;gBACH,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBAC9B,IACE,SAAS,KAAK,SAAS;oBACvB,SAAS,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAE,CAAC,QAAQ;wBACrD,UAAU;oBAEZ,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;gBACxB,KAAK,CAAC,SAAS,EAAE,CAAC;gBAClB,qEAAqE;gBACrE,kEAAkE;gBAClE,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;oBAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;wBACpB,IAAI,CAAC;4BACH,KAAK,CAAC,QAAQ,GAAG,CACf,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAC5B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CACzC,CACF,CAAC,QAAQ,CAAC;wBACb,CAAC;wBAAC,OAAO,KAAK,EAAE,CAAC;4BACf,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;wBAClC,CAAC;oBACH,CAAC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QACL,MAAM,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAE1D,kDAAkD;QAClD,MAAM,SAAS,GAAuB,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAuB,EAAE,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,KAAK,MAAM;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;;gBACpD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAU,EAAE,CAAC;gBAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBAC1D,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAIV,EAAE,CAAC;QACT,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAuC,CAAC;QAC1E,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9D,MAAM,SAAS,GAAgC;gBAC7C,OAAO,EAAE,EAAE;gBACX,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,EAAE;aACb,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;gBAC9B,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAC7C,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC1C,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,oEAAoE;QACpE,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE;YAC9B,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,SAAS;YAC1B,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,SAAS,IAAI,SAAS,KAAK,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5D,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,eAAe,GAAe,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,MAAM,GACV,SAAS,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC7B,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC,CAAC,0BAA0B,CACxB,SAAS,CAAC,OAAO,EACjB,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,QAAQ,EAClB,IAAI,CAAC,MAAM,CACZ,CAAC;YACR,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAAE,SAAS;gBACnE,YAAY,CAAC,IAAI,CACf,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAC/C,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBACpD,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC7C,CAAC;gBACF,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACnC,KAAK,MAAM,MAAM,IAAI,YAAY;oBAC/B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO;YACL,gBAAgB,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACxE,eAAe;YACf,mBAAmB,EACjB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,WAAW;YAC7D,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;gBACnB,CAAC,CAAC;oBACE,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;yBAC9B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CACxB,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzC;yBACA,GAAG,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC;iBACjC;gBACH,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;IACJ,CAAC;CACF","sourcesContent":["import type { Finding } from \"../models.js\";\nimport type { FindingNeighborhood } from \"../finding-retrieval.js\";\nimport {\n CodexSecurityError,\n DeduplicationReviewError,\n type DeduplicationReviewStage,\n} from \"../errors.js\";\nimport {\n pairKey,\n screeningPairSlot,\n type DeduplicationReviewer,\n type ScreeningResult,\n} from \"./deduplication-reviewer.js\";\n\nexport const DEFAULT_DEDUPE_CONCURRENCY = 8;\n\nexport function deduplicationConcurrency(\n concurrency = DEFAULT_DEDUPE_CONCURRENCY,\n): number {\n if (!Number.isSafeInteger(concurrency) || concurrency < 1)\n throw new CodexSecurityError(\n \"concurrency must be a positive safe integer.\",\n );\n return concurrency;\n}\n\ntype Job = () => Promise<void>;\n\nasync function runQueued(\n pending: Job[],\n ready: Job[],\n concurrency: number,\n signal?: AbortSignal,\n): Promise<void> {\n let failure: { error: unknown } | undefined;\n await new Promise<void>((resolve) => {\n let running = 0;\n async function run(job: Job): Promise<void> {\n try {\n await job();\n } catch (error) {\n failure ??= { error };\n } finally {\n running--;\n pump();\n }\n }\n function pump(): void {\n while (\n failure === undefined &&\n !signal?.aborted &&\n running < concurrency\n ) {\n const job = ready.shift() ?? pending.shift();\n if (job === undefined) break;\n running++;\n void run(job);\n }\n // An active producer can still enqueue work. After failure, drain active\n // jobs so successful reviews can finish saving their checkpoints.\n if (running === 0) resolve();\n }\n pump();\n });\n signal?.throwIfAborted();\n if (failure !== undefined) throw failure.error;\n}\n\nexport interface DeduplicationRefusal {\n decision: \"NO_DECISION\";\n stage: DeduplicationReviewStage;\n model: string;\n /** For screening, the first finding is the anchor and the rest are its candidates. */\n findingIds: string[];\n reason: string;\n}\n\nexport interface DeduplicationResult {\n uniqueFindingIds: string[];\n duplicateGroups: string[][];\n deduplicationStatus: \"completed\" | \"completed_with_refusals\";\n /** Refused reviews are kept separate without claiming a DISTINCT verdict. */\n refusals?: DeduplicationRefusal[];\n}\n\nconst severityOrder: Record<Finding[\"severity\"][\"level\"], number> = {\n critical: 0,\n high: 1,\n medium: 2,\n low: 3,\n informational: 4,\n};\n\nfunction scoreAfter(\n left: readonly number[],\n right: readonly number[],\n): boolean {\n for (let index = 0; index < left.length; index++) {\n if (left[index] !== right[index]) return left[index]! > right[index]!;\n }\n return false;\n}\n\n/** @internal */\nexport interface ContradictionGroupingMetrics {\n candidateEvaluations: number;\n conflictNeighborChecks: number;\n}\n\nfunction addSupport(\n support: Map<number, Map<number, number>>,\n left: number,\n right: number,\n): void {\n const leftSupport = support.get(left) ?? new Map<number, number>();\n const rightSupport = support.get(right) ?? new Map<number, number>();\n leftSupport.set(right, (leftSupport.get(right) ?? 0) + 1);\n rightSupport.set(left, (rightSupport.get(left) ?? 0) + 1);\n support.set(left, leftSupport);\n support.set(right, rightSupport);\n}\n\nfunction addConflict(\n conflicts: Map<number, Set<number>>,\n left: number,\n right: number,\n): void {\n const leftConflicts = conflicts.get(left) ?? new Set<number>();\n const rightConflicts = conflicts.get(right) ?? new Set<number>();\n leftConflicts.add(right);\n rightConflicts.add(left);\n conflicts.set(left, leftConflicts);\n conflicts.set(right, rightConflicts);\n}\n\n/** Greedily retain the best-supported legal merges, using input order for ties. */\n/** @internal */\nexport function contradictionFreeSubgroups(\n findingIds: readonly string[],\n samePairs: readonly (readonly [string, string])[],\n distinctPairs: readonly (readonly [string, string])[],\n signal?: AbortSignal,\n metrics?: ContradictionGroupingMetrics,\n): Set<string>[] {\n const indexes = new Map(\n findingIds.map((findingId, index) => [findingId, index]),\n );\n const active = new Set(findingIds.map((_findingId, index) => index));\n const clusters = new Map(\n findingIds.map((findingId, index) => [index, new Set([findingId])]),\n );\n const support = new Map<number, Map<number, number>>();\n for (const [left, right] of samePairs)\n addSupport(support, indexes.get(left)!, indexes.get(right)!);\n const conflicts = new Map<number, Set<number>>();\n for (const [left, right] of distinctPairs)\n addConflict(conflicts, indexes.get(left)!, indexes.get(right)!);\n\n while (true) {\n signal?.throwIfAborted();\n let selected: readonly [number, number] | undefined;\n let selectedScore: readonly number[] | undefined;\n for (const leftCluster of active) {\n for (const [rightCluster, gain] of support.get(leftCluster) ?? []) {\n if (\n leftCluster >= rightCluster ||\n !active.has(rightCluster) ||\n conflicts.get(leftCluster)?.has(rightCluster)\n )\n continue;\n if (metrics) metrics.candidateEvaluations++;\n let newlyBlocked = 0;\n const leftConflicts = conflicts.get(leftCluster);\n const rightConflicts = conflicts.get(rightCluster);\n for (const other of leftConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== rightCluster && !rightConflicts?.has(other))\n newlyBlocked += support.get(rightCluster)?.get(other) ?? 0;\n }\n for (const other of rightConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== leftCluster && !leftConflicts?.has(other))\n newlyBlocked += support.get(leftCluster)?.get(other) ?? 0;\n }\n const score = [\n gain - newlyBlocked,\n gain,\n -newlyBlocked,\n -leftCluster,\n -rightCluster,\n ];\n if (selectedScore === undefined || scoreAfter(score, selectedScore)) {\n selected = [leftCluster, rightCluster];\n selectedScore = score;\n }\n }\n }\n if (selected === undefined)\n return [...active]\n .map((cluster) => clusters.get(cluster)!)\n .filter((members) => members.size > 1);\n const [leftCluster, rightCluster] = selected;\n for (const member of clusters.get(rightCluster)!)\n clusters.get(leftCluster)!.add(member);\n clusters.delete(rightCluster);\n active.delete(rightCluster);\n\n const leftSupport = support.get(leftCluster) ?? new Map<number, number>();\n const rightSupport = support.get(rightCluster) ?? new Map<number, number>();\n const supportNeighbors = new Set([\n ...leftSupport.keys(),\n ...rightSupport.keys(),\n ]);\n supportNeighbors.delete(leftCluster);\n supportNeighbors.delete(rightCluster);\n leftSupport.delete(rightCluster);\n for (const neighbor of supportNeighbors) {\n const weight =\n (leftSupport.get(neighbor) ?? 0) + (rightSupport.get(neighbor) ?? 0);\n leftSupport.set(neighbor, weight);\n const neighborSupport = support.get(neighbor)!;\n neighborSupport.delete(rightCluster);\n neighborSupport.set(leftCluster, weight);\n }\n support.set(leftCluster, leftSupport);\n support.delete(rightCluster);\n\n const mergedConflicts = new Set([\n ...(conflicts.get(leftCluster) ?? []),\n ...(conflicts.get(rightCluster) ?? []),\n ]);\n mergedConflicts.delete(leftCluster);\n mergedConflicts.delete(rightCluster);\n for (const neighbor of mergedConflicts) {\n const neighborConflicts = conflicts.get(neighbor)!;\n neighborConflicts.delete(rightCluster);\n neighborConflicts.add(leftCluster);\n }\n if (mergedConflicts.size > 0) conflicts.set(leftCluster, mergedConflicts);\n else conflicts.delete(leftCluster);\n conflicts.delete(rightCluster);\n }\n}\n\n/** @internal */\nexport class FindingDeduplicator {\n constructor(\n private readonly candidates: {\n potentialDuplicates(findingId: string): Promise<FindingNeighborhood>;\n },\n private readonly reviewer: DeduplicationReviewer,\n private readonly signal?: AbortSignal,\n private readonly concurrency = DEFAULT_DEDUPE_CONCURRENCY,\n ) {}\n\n async run(findingIds: readonly string[]): Promise<DeduplicationResult> {\n this.signal?.throwIfAborted();\n const concurrency = deduplicationConcurrency(this.concurrency);\n const ids = [...new Set(findingIds)];\n const findings = new Map<string, Finding>();\n const refusals = new Map<string, DeduplicationRefusal>();\n const recordRefusal = (error: unknown, ids: string[]): void => {\n this.signal?.throwIfAborted();\n if (\n !(error instanceof DeduplicationReviewError) ||\n error.metadata.category !== \"refusal\"\n )\n throw error;\n const { stage, model, reason } = error.metadata;\n refusals.set(JSON.stringify([stage, ...ids]), {\n decision: \"NO_DECISION\",\n stage,\n model,\n findingIds: ids,\n reason,\n });\n };\n const neighborhoods = new Array<Finding[]>(ids.length);\n await runQueued(\n ids.map((id, index) => async () => {\n const result = await this.candidates.potentialDuplicates(id);\n this.signal?.throwIfAborted();\n neighborhoods[index] = [result.finding, ...result.potentialDuplicates];\n }),\n [],\n concurrency,\n this.signal,\n );\n const pairs = new Map<\n string,\n {\n ids: [string, string];\n remaining: number;\n rejected: boolean;\n decision?: \"SAME\" | \"DISTINCT\";\n }\n >();\n // Freeze records, insertion order, and the last nominating anchor's pair\n // orientation before reviews run, preserving grouping and checkpoint inputs.\n for (const neighborhood of neighborhoods) {\n this.signal?.throwIfAborted();\n for (const finding of neighborhood)\n findings.set(finding.findingId, finding);\n for (const neighbor of neighborhood.slice(1)) {\n const pair: [string, string] = [\n neighborhood[0]!.findingId,\n neighbor.findingId,\n ];\n const key = pairKey(pair);\n const state = pairs.get(key);\n if (state === undefined) {\n pairs.set(key, { ids: pair, remaining: 1, rejected: false });\n } else {\n state.ids = pair;\n state.remaining++;\n }\n }\n }\n\n const ready: Job[] = [];\n const pending = neighborhoods\n .filter((neighborhood) => neighborhood.length > 1)\n .map((neighborhood) => async () => {\n let screening: ScreeningResult | undefined;\n try {\n screening = await this.reviewer.screen(neighborhood);\n } catch (error) {\n recordRefusal(\n error,\n neighborhood.map((finding) => finding.findingId),\n );\n }\n this.signal?.throwIfAborted();\n for (let index = 0; index < neighborhood.length - 1; index++) {\n const key = pairKey([\n neighborhood[0]!.findingId,\n neighborhood[index + 1]!.findingId,\n ]);\n const state = pairs.get(key)!;\n if (\n screening === undefined ||\n screening.decisions[screeningPairSlot(index)]!.decision ===\n \"DISTINCT\"\n )\n state.rejected = true;\n state.remaining--;\n // Wait for every screening: a later DISTINCT verdict or refusal must\n // prevent verification, including a verification that could fail.\n if (state.remaining === 0 && !state.rejected) {\n ready.push(async () => {\n try {\n state.decision = (\n await this.reviewer.reviewPair(\n state.ids.map((id) => findings.get(id)!),\n )\n ).decision;\n } catch (error) {\n recordRefusal(error, state.ids);\n }\n });\n }\n }\n });\n await runQueued(pending, ready, concurrency, this.signal);\n\n // Completion order must not change grouping ties.\n const supported: [string, string][] = [];\n const rejected: [string, string][] = [];\n for (const state of pairs.values()) {\n this.signal?.throwIfAborted();\n if (state.decision === \"SAME\") supported.push(state.ids);\n else rejected.push(state.ids);\n }\n\n const adjacent = new Map<string, Set<string>>();\n for (const pair of supported) {\n for (const [left, right] of [pair, [pair[1], pair[0]]] as const) {\n const neighbors = adjacent.get(left) ?? new Set<string>();\n neighbors.add(right);\n adjacent.set(left, neighbors);\n }\n }\n\n const components: {\n members: string[];\n supported: [string, string][];\n rejected: [string, string][];\n }[] = [];\n const componentByFinding = new Map<string, (typeof components)[number]>();\n for (const id of findings.keys()) {\n this.signal?.throwIfAborted();\n if (!adjacent.has(id) || componentByFinding.has(id)) continue;\n const component: (typeof components)[number] = {\n members: [],\n supported: [],\n rejected: [],\n };\n components.push(component);\n const pending = [id];\n while (pending.length > 0) {\n const member = pending.pop()!;\n if (componentByFinding.has(member)) continue;\n componentByFinding.set(member, component);\n pending.push(...adjacent.get(member)!);\n }\n }\n // Preserve finding insertion order for contradiction-grouping ties.\n for (const id of findings.keys())\n componentByFinding.get(id)?.members.push(id);\n for (const pair of supported)\n componentByFinding.get(pair[0])!.supported.push(pair);\n for (const pair of rejected) {\n const component = componentByFinding.get(pair[0]);\n if (component && component === componentByFinding.get(pair[1]))\n component.rejected.push(pair);\n }\n\n const selected = new Set(ids);\n const duplicateGroups: string[][] = [];\n const canonical = new Map<string, string>();\n for (const component of components) {\n this.signal?.throwIfAborted();\n const groups =\n component.rejected.length === 0\n ? [new Set(component.members)]\n : contradictionFreeSubgroups(\n component.members,\n component.supported,\n component.rejected,\n this.signal,\n );\n for (const group of groups) {\n const groupMembers = [...group];\n if (!groupMembers.some((member) => selected.has(member))) continue;\n groupMembers.sort(\n (left, right) =>\n severityOrder[findings.get(left)!.severity.level] -\n severityOrder[findings.get(right)!.severity.level] ||\n (left < right ? -1 : left > right ? 1 : 0),\n );\n duplicateGroups.push(groupMembers);\n for (const member of groupMembers)\n canonical.set(member, groupMembers[0]!);\n }\n }\n return {\n uniqueFindingIds: [...new Set(ids.map((id) => canonical.get(id) ?? id))],\n duplicateGroups,\n deduplicationStatus:\n refusals.size > 0 ? \"completed_with_refusals\" : \"completed\",\n ...(refusals.size > 0\n ? {\n refusals: [...refusals.entries()]\n .sort(([left], [right]) =>\n left < right ? -1 : left > right ? 1 : 0,\n )\n .map(([, refusal]) => refusal),\n }\n : {}),\n };\n }\n}\n"]}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"finding-schema.d.ts","sourceRoot":"","sources":["../../src/deduplication/finding-schema.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAK5C,wBAAgB,aAAa,IAAI,MAAM,CAUtC;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAStD"}
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
import { readFileSync } from "node:fs";
|
|
2
|
+
import Ajv2020 from "ajv/dist/2020.js";
|
|
3
|
+
let schema;
|
|
4
|
+
let validator;
|
|
5
|
+
export function findingSchema() {
|
|
6
|
+
return (schema ??= JSON.parse(readFileSync(new URL("../../_bundled_plugin/schemas/findings.schema.json", import.meta.url), "utf8")).properties.findings.items);
|
|
7
|
+
}
|
|
8
|
+
export function requireFinding(value) {
|
|
9
|
+
validator ??= new Ajv2020({ strict: false }).compile(findingSchema());
|
|
10
|
+
if (!validator(value))
|
|
11
|
+
throw new Error("Record must satisfy the Finding schema, including provenance.");
|
|
12
|
+
return value;
|
|
13
|
+
}
|
|
14
|
+
//# sourceMappingURL=finding-schema.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"finding-schema.js","sourceRoot":"","sources":["../../src/deduplication/finding-schema.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,OAAkC,MAAM,kBAAkB,CAAC;AAGlE,IAAI,MAA0B,CAAC;AAC/B,IAAI,SAAgD,CAAC;AAErD,MAAM,UAAU,aAAa;IAC3B,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAC3B,YAAY,CACV,IAAI,GAAG,CACL,oDAAoD,EACpD,OAAO,IAAI,CAAC,GAAG,CAChB,EACD,MAAM,CACP,CACF,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAc;IAC3C,SAAS,KAAK,IAAI,OAAO,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAClD,aAAa,EAAE,CAChB,CAAC;IACF,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;QACnB,MAAM,IAAI,KAAK,CACb,+DAA+D,CAChE,CAAC;IACJ,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["import { readFileSync } from \"node:fs\";\nimport Ajv2020, { type ValidateFunction } from \"ajv/dist/2020.js\";\nimport type { Finding } from \"../models.js\";\n\nlet schema: object | undefined;\nlet validator: ValidateFunction<Finding> | undefined;\n\nexport function findingSchema(): object {\n return (schema ??= JSON.parse(\n readFileSync(\n new URL(\n \"../../_bundled_plugin/schemas/findings.schema.json\",\n import.meta.url,\n ),\n \"utf8\",\n ),\n ).properties.findings.items);\n}\n\nexport function requireFinding(value: unknown): Finding {\n validator ??= new Ajv2020({ strict: false }).compile<Finding>(\n findingSchema(),\n );\n if (!validator(value))\n throw new Error(\n \"Record must satisfy the Finding schema, including provenance.\",\n );\n return value;\n}\n"]}
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
import { type Readable } from "node:stream";
|
|
2
|
+
type Output = Pick<NodeJS.WriteStream, "write"> & {
|
|
3
|
+
on?(event: "error", listener: (error: Error) => void): unknown;
|
|
4
|
+
off?(event: "error", listener: (error: Error) => void): unknown;
|
|
5
|
+
};
|
|
6
|
+
/** One bidirectional run. Stdout contains JSON-RPC envelopes only. */
|
|
7
|
+
export declare function runRecordsProtocol(input: Readable, output: Output, signal?: AbortSignal): Promise<number>;
|
|
8
|
+
export {};
|
|
9
|
+
//# sourceMappingURL=records-protocol.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"records-protocol.d.ts","sourceRoot":"","sources":["../../src/deduplication/records-protocol.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,QAAQ,EAAY,MAAM,aAAa,CAAC;AAuCtD,KAAK,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG;IAChD,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,OAAO,CAAC;IAC/D,GAAG,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,OAAO,CAAC;CACjE,CAAC;AAEF,sEAAsE;AACtE,wBAAsB,kBAAkB,CACtC,KAAK,EAAE,QAAQ,EACf,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,MAAM,CAAC,CAiJjB"}
|
|
@@ -0,0 +1,191 @@
|
|
|
1
|
+
import { createInterface } from "node:readline";
|
|
2
|
+
import { Writable } from "node:stream";
|
|
3
|
+
import { z } from "incur";
|
|
4
|
+
import { deduplicateRecords } from "./records.js";
|
|
5
|
+
const rpcId = z.union([z.string(), z.number().int()]);
|
|
6
|
+
const request = z
|
|
7
|
+
.object({
|
|
8
|
+
jsonrpc: z.literal("2.0"),
|
|
9
|
+
id: rpcId,
|
|
10
|
+
method: z.literal("run"),
|
|
11
|
+
params: z.unknown(),
|
|
12
|
+
})
|
|
13
|
+
.strict();
|
|
14
|
+
const cancellation = z
|
|
15
|
+
.object({
|
|
16
|
+
jsonrpc: z.literal("2.0"),
|
|
17
|
+
method: z.literal("cancel"),
|
|
18
|
+
params: z.object({ id: rpcId }).strict(),
|
|
19
|
+
})
|
|
20
|
+
.strict();
|
|
21
|
+
const response = z.union([
|
|
22
|
+
z
|
|
23
|
+
.object({ jsonrpc: z.literal("2.0"), id: rpcId, result: z.unknown() })
|
|
24
|
+
.strict()
|
|
25
|
+
.refine((value) => Object.hasOwn(value, "result")),
|
|
26
|
+
z
|
|
27
|
+
.object({
|
|
28
|
+
jsonrpc: z.literal("2.0"),
|
|
29
|
+
id: rpcId,
|
|
30
|
+
error: z
|
|
31
|
+
.object({
|
|
32
|
+
code: z.number().int(),
|
|
33
|
+
message: z.string(),
|
|
34
|
+
data: z.unknown().optional(),
|
|
35
|
+
})
|
|
36
|
+
.strict(),
|
|
37
|
+
})
|
|
38
|
+
.strict(),
|
|
39
|
+
]);
|
|
40
|
+
/** One bidirectional run. Stdout contains JSON-RPC envelopes only. */
|
|
41
|
+
export async function runRecordsProtocol(input, output, signal) {
|
|
42
|
+
const controller = new AbortController();
|
|
43
|
+
let runId;
|
|
44
|
+
let finished = false;
|
|
45
|
+
let pending;
|
|
46
|
+
let complete;
|
|
47
|
+
const completion = new Promise((resolve) => {
|
|
48
|
+
complete = resolve;
|
|
49
|
+
});
|
|
50
|
+
const lines = createInterface({
|
|
51
|
+
input,
|
|
52
|
+
crlfDelay: Infinity,
|
|
53
|
+
terminal: false,
|
|
54
|
+
});
|
|
55
|
+
const send = async (message) => {
|
|
56
|
+
const line = `${JSON.stringify(message)}\n`;
|
|
57
|
+
if (output instanceof Writable) {
|
|
58
|
+
await new Promise((resolve, reject) => output.write(line, (error) => (error ? reject(error) : resolve())));
|
|
59
|
+
}
|
|
60
|
+
else {
|
|
61
|
+
output.write(line);
|
|
62
|
+
}
|
|
63
|
+
};
|
|
64
|
+
const fail = (code, message, canWrite = true) => {
|
|
65
|
+
if (finished)
|
|
66
|
+
return;
|
|
67
|
+
// Stop scheduling before notifying the host; a disconnect cannot become uniqueness.
|
|
68
|
+
finished = true;
|
|
69
|
+
controller.abort(new Error(message));
|
|
70
|
+
pending?.reject(new Error(message));
|
|
71
|
+
pending = undefined;
|
|
72
|
+
const flushed = canWrite
|
|
73
|
+
? send({ jsonrpc: "2.0", id: runId ?? null, error: { code, message } })
|
|
74
|
+
: Promise.resolve();
|
|
75
|
+
void flushed.catch(() => undefined).then(() => complete(2));
|
|
76
|
+
};
|
|
77
|
+
const disconnected = () => fail(-32000, "Host disconnected before the run completed.");
|
|
78
|
+
const inputError = (error) => fail(-32000, error.message);
|
|
79
|
+
const outputError = (error) => fail(-32000, error.message, false);
|
|
80
|
+
const canceled = () => {
|
|
81
|
+
if (finished) {
|
|
82
|
+
// A terminal response may be blocked on a host that stopped reading.
|
|
83
|
+
if (output instanceof Writable)
|
|
84
|
+
output.destroy();
|
|
85
|
+
complete(2);
|
|
86
|
+
}
|
|
87
|
+
else {
|
|
88
|
+
fail(-32800, "Deduplication canceled.");
|
|
89
|
+
}
|
|
90
|
+
};
|
|
91
|
+
input.on("error", inputError);
|
|
92
|
+
input.on("close", disconnected);
|
|
93
|
+
if (output instanceof Writable)
|
|
94
|
+
output.on("close", disconnected);
|
|
95
|
+
lines.on("close", disconnected);
|
|
96
|
+
lines.on("error", inputError);
|
|
97
|
+
output.on?.("error", outputError);
|
|
98
|
+
signal?.addEventListener("abort", canceled, { once: true });
|
|
99
|
+
lines.on("line", (line) => {
|
|
100
|
+
let message;
|
|
101
|
+
try {
|
|
102
|
+
message = JSON.parse(line);
|
|
103
|
+
}
|
|
104
|
+
catch {
|
|
105
|
+
fail(-32700, "Invalid JSON.");
|
|
106
|
+
return;
|
|
107
|
+
}
|
|
108
|
+
const cancel = cancellation.safeParse(message);
|
|
109
|
+
if (cancel.success) {
|
|
110
|
+
if (runId === undefined || cancel.data.params.id !== runId)
|
|
111
|
+
fail(-32600, "Cancellation does not match the active run.");
|
|
112
|
+
else
|
|
113
|
+
canceled();
|
|
114
|
+
return;
|
|
115
|
+
}
|
|
116
|
+
if (finished)
|
|
117
|
+
return;
|
|
118
|
+
const run = request.safeParse(message);
|
|
119
|
+
if (run.success) {
|
|
120
|
+
if (runId !== undefined) {
|
|
121
|
+
fail(-32600, "Only one run request is allowed.");
|
|
122
|
+
return;
|
|
123
|
+
}
|
|
124
|
+
runId = run.data.id;
|
|
125
|
+
void deduplicateRecords(run.data.params, {
|
|
126
|
+
signal: controller.signal,
|
|
127
|
+
reviewRunner: {
|
|
128
|
+
run(review) {
|
|
129
|
+
if (finished)
|
|
130
|
+
return Promise.reject(controller.signal.reason);
|
|
131
|
+
return new Promise((resolve, reject) => {
|
|
132
|
+
pending = { id: review.requestId, resolve, reject };
|
|
133
|
+
void send({
|
|
134
|
+
jsonrpc: "2.0",
|
|
135
|
+
id: review.requestId,
|
|
136
|
+
method: "review.run",
|
|
137
|
+
params: review,
|
|
138
|
+
}).catch(outputError);
|
|
139
|
+
});
|
|
140
|
+
},
|
|
141
|
+
},
|
|
142
|
+
}).then(async (result) => {
|
|
143
|
+
if (finished)
|
|
144
|
+
return;
|
|
145
|
+
finished = true;
|
|
146
|
+
try {
|
|
147
|
+
await send({ jsonrpc: "2.0", id: runId, result });
|
|
148
|
+
complete(result.status === "completed" ? 0 : 1);
|
|
149
|
+
}
|
|
150
|
+
catch {
|
|
151
|
+
complete(2);
|
|
152
|
+
}
|
|
153
|
+
}, (error) => {
|
|
154
|
+
fail(-32602, error instanceof Error ? error.message : "Invalid run parameters.");
|
|
155
|
+
});
|
|
156
|
+
return;
|
|
157
|
+
}
|
|
158
|
+
const reply = response.safeParse(message);
|
|
159
|
+
if (!reply.success || !pending || reply.data.id !== pending.id) {
|
|
160
|
+
fail(-32600, "Malformed, unexpected, or mismatched review response.");
|
|
161
|
+
return;
|
|
162
|
+
}
|
|
163
|
+
const review = pending;
|
|
164
|
+
pending = undefined;
|
|
165
|
+
if ("error" in reply.data)
|
|
166
|
+
review.reject(new Error(reply.data.error.message));
|
|
167
|
+
else
|
|
168
|
+
review.resolve(reply.data.result);
|
|
169
|
+
});
|
|
170
|
+
if (signal?.aborted)
|
|
171
|
+
canceled();
|
|
172
|
+
if (input.readableEnded || input.destroyed)
|
|
173
|
+
disconnected();
|
|
174
|
+
try {
|
|
175
|
+
return await completion;
|
|
176
|
+
}
|
|
177
|
+
finally {
|
|
178
|
+
lines.removeAllListeners("line");
|
|
179
|
+
lines.removeListener("close", disconnected);
|
|
180
|
+
lines.removeListener("error", inputError);
|
|
181
|
+
lines.close();
|
|
182
|
+
input.pause();
|
|
183
|
+
input.removeListener("error", inputError);
|
|
184
|
+
input.removeListener("close", disconnected);
|
|
185
|
+
if (output instanceof Writable)
|
|
186
|
+
output.removeListener("close", disconnected);
|
|
187
|
+
output.off?.("error", outputError);
|
|
188
|
+
signal?.removeEventListener("abort", canceled);
|
|
189
|
+
}
|
|
190
|
+
}
|
|
191
|
+
//# sourceMappingURL=records-protocol.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"records-protocol.js","sourceRoot":"","sources":["../../src/deduplication/records-protocol.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAiB,QAAQ,EAAE,MAAM,aAAa,CAAC;AACtD,OAAO,EAAE,CAAC,EAAE,MAAM,OAAO,CAAC;AAC1B,OAAO,EAAE,kBAAkB,EAAgC,MAAM,cAAc,CAAC;AAEhF,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACtD,MAAM,OAAO,GAAG,CAAC;KACd,MAAM,CAAC;IACN,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;IACzB,EAAE,EAAE,KAAK;IACT,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;IACxB,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE;CACpB,CAAC;KACD,MAAM,EAAE,CAAC;AACZ,MAAM,YAAY,GAAG,CAAC;KACnB,MAAM,CAAC;IACN,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;IACzB,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC3B,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;CACzC,CAAC;KACD,MAAM,EAAE,CAAC;AACZ,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC;IACvB,CAAC;SACE,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;SACrE,MAAM,EAAE;SACR,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;SACE,MAAM,CAAC;QACN,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;QACzB,EAAE,EAAE,KAAK;QACT,KAAK,EAAE,CAAC;aACL,MAAM,CAAC;YACN,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE;YACtB,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;YACnB,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;SAC7B,CAAC;aACD,MAAM,EAAE;KACZ,CAAC;SACD,MAAM,EAAE;CACZ,CAAC,CAAC;AAMH,sEAAsE;AACtE,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAAe,EACf,MAAc,EACd,MAAoB;IAEpB,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;IACzC,IAAI,KAAkC,CAAC;IACvC,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAES,CAAC;IACd,IAAI,QAAiC,CAAC;IACtC,MAAM,UAAU,GAAG,IAAI,OAAO,CAAS,CAAC,OAAO,EAAE,EAAE;QACjD,QAAQ,GAAG,OAAO,CAAC;IACrB,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,eAAe,CAAC;QAC5B,KAAK;QACL,SAAS,EAAE,QAAQ;QACnB,QAAQ,EAAE,KAAK;KAChB,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,KAAK,EAAE,OAAe,EAAE,EAAE;QACrC,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC;QAC5C,IAAI,MAAM,YAAY,QAAQ,EAAE,CAAC;YAC/B,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAC1C,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CACnE,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,OAAe,EAAE,QAAQ,GAAG,IAAI,EAAE,EAAE;QAC9D,IAAI,QAAQ;YAAE,OAAO;QACrB,oFAAoF;QACpF,QAAQ,GAAG,IAAI,CAAC;QAChB,UAAU,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACrC,OAAO,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,OAAO,GAAG,SAAS,CAAC;QACpB,MAAM,OAAO,GAAG,QAAQ;YACtB,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC;YACvE,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QACtB,KAAK,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC;IACF,MAAM,YAAY,GAAG,GAAG,EAAE,CACxB,IAAI,CAAC,CAAC,KAAK,EAAE,6CAA6C,CAAC,CAAC;IAC9D,MAAM,UAAU,GAAG,CAAC,KAAY,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IACjE,MAAM,WAAW,GAAG,CAAC,KAAY,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACzE,MAAM,QAAQ,GAAG,GAAG,EAAE;QACpB,IAAI,QAAQ,EAAE,CAAC;YACb,qEAAqE;YACrE,IAAI,MAAM,YAAY,QAAQ;gBAAE,MAAM,CAAC,OAAO,EAAE,CAAC;YACjD,QAAQ,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,CAAC,KAAK,EAAE,yBAAyB,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC;IACF,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC9B,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAChC,IAAI,MAAM,YAAY,QAAQ;QAAE,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IACjE,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAChC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC9B,MAAM,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAClC,MAAM,EAAE,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QACxB,IAAI,OAAgB,CAAC;QACrB,IAAI,CAAC;YACH,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;YAC9B,OAAO;QACT,CAAC;QACD,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,KAAK;gBACxD,IAAI,CAAC,CAAC,KAAK,EAAE,6CAA6C,CAAC,CAAC;;gBACzD,QAAQ,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QACD,IAAI,QAAQ;YAAE,OAAO;QACrB,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,CAAC,KAAK,EAAE,kCAAkC,CAAC,CAAC;gBACjD,OAAO;YACT,CAAC;YACD,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,KAAK,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAiC,EAAE;gBAClE,MAAM,EAAE,UAAU,CAAC,MAAM;gBACzB,YAAY,EAAE;oBACZ,GAAG,CAAC,MAAM;wBACR,IAAI,QAAQ;4BAAE,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;wBAC9D,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;4BACrC,OAAO,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;4BACpD,KAAK,IAAI,CAAC;gCACR,OAAO,EAAE,KAAK;gCACd,EAAE,EAAE,MAAM,CAAC,SAAS;gCACpB,MAAM,EAAE,YAAY;gCACpB,MAAM,EAAE,MAAM;6BACf,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;wBACxB,CAAC,CAAC,CAAC;oBACL,CAAC;iBACF;aACF,CAAC,CAAC,IAAI,CACL,KAAK,EAAE,MAAM,EAAE,EAAE;gBACf,IAAI,QAAQ;oBAAE,OAAO;gBACrB,QAAQ,GAAG,IAAI,CAAC;gBAChB,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;oBAClD,QAAQ,CAAC,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClD,CAAC;gBAAC,MAAM,CAAC;oBACP,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACd,CAAC;YACH,CAAC,EACD,CAAC,KAAc,EAAE,EAAE;gBACjB,IAAI,CACF,CAAC,KAAK,EACN,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,yBAAyB,CACnE,CAAC;YACJ,CAAC,CACF,CAAC;YACF,OAAO;QACT,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,EAAE,CAAC;YAC/D,IAAI,CAAC,CAAC,KAAK,EAAE,uDAAuD,CAAC,CAAC;YACtE,OAAO;QACT,CAAC;QACD,MAAM,MAAM,GAAG,OAAO,CAAC;QACvB,OAAO,GAAG,SAAS,CAAC;QACpB,IAAI,OAAO,IAAI,KAAK,CAAC,IAAI;YACvB,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;;YAChD,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IACH,IAAI,MAAM,EAAE,OAAO;QAAE,QAAQ,EAAE,CAAC;IAChC,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,SAAS;QAAE,YAAY,EAAE,CAAC;IAC3D,IAAI,CAAC;QACH,OAAO,MAAM,UAAU,CAAC;IAC1B,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACjC,KAAK,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC5C,KAAK,CAAC,cAAc,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAC1C,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,KAAK,CAAC,cAAc,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAC1C,KAAK,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC5C,IAAI,MAAM,YAAY,QAAQ;YAC5B,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACnC,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACjD,CAAC;AACH,CAAC","sourcesContent":["import { createInterface } from \"node:readline\";\nimport { type Readable, Writable } from \"node:stream\";\nimport { z } from \"incur\";\nimport { deduplicateRecords, type DeduplicateRecordsInput } from \"./records.js\";\n\nconst rpcId = z.union([z.string(), z.number().int()]);\nconst request = z\n .object({\n jsonrpc: z.literal(\"2.0\"),\n id: rpcId,\n method: z.literal(\"run\"),\n params: z.unknown(),\n })\n .strict();\nconst cancellation = z\n .object({\n jsonrpc: z.literal(\"2.0\"),\n method: z.literal(\"cancel\"),\n params: z.object({ id: rpcId }).strict(),\n })\n .strict();\nconst response = z.union([\n z\n .object({ jsonrpc: z.literal(\"2.0\"), id: rpcId, result: z.unknown() })\n .strict()\n .refine((value) => Object.hasOwn(value, \"result\")),\n z\n .object({\n jsonrpc: z.literal(\"2.0\"),\n id: rpcId,\n error: z\n .object({\n code: z.number().int(),\n message: z.string(),\n data: z.unknown().optional(),\n })\n .strict(),\n })\n .strict(),\n]);\ntype Output = Pick<NodeJS.WriteStream, \"write\"> & {\n on?(event: \"error\", listener: (error: Error) => void): unknown;\n off?(event: \"error\", listener: (error: Error) => void): unknown;\n};\n\n/** One bidirectional run. Stdout contains JSON-RPC envelopes only. */\nexport async function runRecordsProtocol(\n input: Readable,\n output: Output,\n signal?: AbortSignal,\n): Promise<number> {\n const controller = new AbortController();\n let runId: string | number | undefined;\n let finished = false;\n let pending:\n | { id: string; resolve(value: unknown): void; reject(error: Error): void }\n | undefined;\n let complete!: (code: number) => void;\n const completion = new Promise<number>((resolve) => {\n complete = resolve;\n });\n const lines = createInterface({\n input,\n crlfDelay: Infinity,\n terminal: false,\n });\n const send = async (message: object) => {\n const line = `${JSON.stringify(message)}\\n`;\n if (output instanceof Writable) {\n await new Promise<void>((resolve, reject) =>\n output.write(line, (error) => (error ? reject(error) : resolve())),\n );\n } else {\n output.write(line);\n }\n };\n const fail = (code: number, message: string, canWrite = true) => {\n if (finished) return;\n // Stop scheduling before notifying the host; a disconnect cannot become uniqueness.\n finished = true;\n controller.abort(new Error(message));\n pending?.reject(new Error(message));\n pending = undefined;\n const flushed = canWrite\n ? send({ jsonrpc: \"2.0\", id: runId ?? null, error: { code, message } })\n : Promise.resolve();\n void flushed.catch(() => undefined).then(() => complete(2));\n };\n const disconnected = () =>\n fail(-32000, \"Host disconnected before the run completed.\");\n const inputError = (error: Error) => fail(-32000, error.message);\n const outputError = (error: Error) => fail(-32000, error.message, false);\n const canceled = () => {\n if (finished) {\n // A terminal response may be blocked on a host that stopped reading.\n if (output instanceof Writable) output.destroy();\n complete(2);\n } else {\n fail(-32800, \"Deduplication canceled.\");\n }\n };\n input.on(\"error\", inputError);\n input.on(\"close\", disconnected);\n if (output instanceof Writable) output.on(\"close\", disconnected);\n lines.on(\"close\", disconnected);\n lines.on(\"error\", inputError);\n output.on?.(\"error\", outputError);\n signal?.addEventListener(\"abort\", canceled, { once: true });\n lines.on(\"line\", (line) => {\n let message: unknown;\n try {\n message = JSON.parse(line);\n } catch {\n fail(-32700, \"Invalid JSON.\");\n return;\n }\n const cancel = cancellation.safeParse(message);\n if (cancel.success) {\n if (runId === undefined || cancel.data.params.id !== runId)\n fail(-32600, \"Cancellation does not match the active run.\");\n else canceled();\n return;\n }\n if (finished) return;\n const run = request.safeParse(message);\n if (run.success) {\n if (runId !== undefined) {\n fail(-32600, \"Only one run request is allowed.\");\n return;\n }\n runId = run.data.id;\n void deduplicateRecords(run.data.params as DeduplicateRecordsInput, {\n signal: controller.signal,\n reviewRunner: {\n run(review) {\n if (finished) return Promise.reject(controller.signal.reason);\n return new Promise((resolve, reject) => {\n pending = { id: review.requestId, resolve, reject };\n void send({\n jsonrpc: \"2.0\",\n id: review.requestId,\n method: \"review.run\",\n params: review,\n }).catch(outputError);\n });\n },\n },\n }).then(\n async (result) => {\n if (finished) return;\n finished = true;\n try {\n await send({ jsonrpc: \"2.0\", id: runId, result });\n complete(result.status === \"completed\" ? 0 : 1);\n } catch {\n complete(2);\n }\n },\n (error: unknown) => {\n fail(\n -32602,\n error instanceof Error ? error.message : \"Invalid run parameters.\",\n );\n },\n );\n return;\n }\n const reply = response.safeParse(message);\n if (!reply.success || !pending || reply.data.id !== pending.id) {\n fail(-32600, \"Malformed, unexpected, or mismatched review response.\");\n return;\n }\n const review = pending;\n pending = undefined;\n if (\"error\" in reply.data)\n review.reject(new Error(reply.data.error.message));\n else review.resolve(reply.data.result);\n });\n if (signal?.aborted) canceled();\n if (input.readableEnded || input.destroyed) disconnected();\n try {\n return await completion;\n } finally {\n lines.removeAllListeners(\"line\");\n lines.removeListener(\"close\", disconnected);\n lines.removeListener(\"error\", inputError);\n lines.close();\n input.pause();\n input.removeListener(\"error\", inputError);\n input.removeListener(\"close\", disconnected);\n if (output instanceof Writable)\n output.removeListener(\"close\", disconnected);\n output.off?.(\"error\", outputError);\n signal?.removeEventListener(\"abort\", canceled);\n }\n}\n"]}
|
|
@@ -0,0 +1,33 @@
|
|
|
1
|
+
import type { Finding } from "../models.js";
|
|
2
|
+
import type { DeduplicationReviewRunner } from "./review.js";
|
|
3
|
+
export interface DeduplicateRecordsInput {
|
|
4
|
+
version: 1;
|
|
5
|
+
observations: {
|
|
6
|
+
id: string;
|
|
7
|
+
finding: Finding;
|
|
8
|
+
}[];
|
|
9
|
+
candidateRelationships: {
|
|
10
|
+
observationId: string;
|
|
11
|
+
candidateObservationIds: string[];
|
|
12
|
+
}[];
|
|
13
|
+
}
|
|
14
|
+
export interface DeduplicateRecordsOptions {
|
|
15
|
+
reviewRunner: DeduplicationReviewRunner;
|
|
16
|
+
signal?: AbortSignal;
|
|
17
|
+
}
|
|
18
|
+
export interface DeduplicateRecordsResult {
|
|
19
|
+
version: 1;
|
|
20
|
+
status: "completed" | "unresolved";
|
|
21
|
+
groups: {
|
|
22
|
+
representativeObservationId: string;
|
|
23
|
+
observationIds: string[];
|
|
24
|
+
}[];
|
|
25
|
+
unresolved: {
|
|
26
|
+
observationId: string;
|
|
27
|
+
reason: "review_failed";
|
|
28
|
+
message: string;
|
|
29
|
+
}[];
|
|
30
|
+
}
|
|
31
|
+
/** Pure records workflow: no retrieval, local model execution, or persistence. */
|
|
32
|
+
export declare function deduplicateRecords(input: DeduplicateRecordsInput, options: DeduplicateRecordsOptions): Promise<DeduplicateRecordsResult>;
|
|
33
|
+
//# sourceMappingURL=records.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"records.d.ts","sourceRoot":"","sources":["../../src/deduplication/records.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAa5C,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AAyB7D,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,CAAC,CAAC;IACX,YAAY,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,OAAO,CAAA;KAAE,EAAE,CAAC;IACjD,sBAAsB,EAAE;QACtB,aAAa,EAAE,MAAM,CAAC;QACtB,uBAAuB,EAAE,MAAM,EAAE,CAAC;KACnC,EAAE,CAAC;CACL;AACD,MAAM,WAAW,yBAAyB;IACxC,YAAY,EAAE,yBAAyB,CAAC;IACxC,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AACD,MAAM,WAAW,wBAAwB;IACvC,OAAO,EAAE,CAAC,CAAC;IACX,MAAM,EAAE,WAAW,GAAG,YAAY,CAAC;IACnC,MAAM,EAAE;QACN,2BAA2B,EAAE,MAAM,CAAC;QACpC,cAAc,EAAE,MAAM,EAAE,CAAC;KAC1B,EAAE,CAAC;IACJ,UAAU,EAAE;QACV,aAAa,EAAE,MAAM,CAAC;QACtB,MAAM,EAAE,eAAe,CAAC;QACxB,OAAO,EAAE,MAAM,CAAC;KACjB,EAAE,CAAC;CACL;AAED,kFAAkF;AAClF,wBAAsB,kBAAkB,CACtC,KAAK,EAAE,uBAAuB,EAC9B,OAAO,EAAE,yBAAyB,GACjC,OAAO,CAAC,wBAAwB,CAAC,CAmInC"}
|
|
@@ -0,0 +1,134 @@
|
|
|
1
|
+
import { createHash, randomUUID } from "node:crypto";
|
|
2
|
+
import { z } from "incur";
|
|
3
|
+
import { DeduplicationReviewError } from "../errors.js";
|
|
4
|
+
import { abortable } from "../targets.js";
|
|
5
|
+
import { FindingDeduplicator } from "./deduplication.js";
|
|
6
|
+
import { CodexDeduplicationReviewer } from "./deduplication-reviewer.js";
|
|
7
|
+
import { findingSchema, requireFinding } from "./finding-schema.js";
|
|
8
|
+
import { sourceReviewInstructions, screeningInstructions, pairReviewInstructions, screeningFindingFormatInstructions, pairFindingFormatInstructions, } from "./deduplication-prompts.js";
|
|
9
|
+
const id = z.string().min(1);
|
|
10
|
+
const record = z
|
|
11
|
+
.object({
|
|
12
|
+
id,
|
|
13
|
+
finding: z.unknown().transform((value) => requireFinding(value)),
|
|
14
|
+
})
|
|
15
|
+
.strict();
|
|
16
|
+
const deduplicateRecordsInputSchema = z
|
|
17
|
+
.object({
|
|
18
|
+
version: z.literal(1),
|
|
19
|
+
observations: z.array(record),
|
|
20
|
+
candidateRelationships: z.array(z
|
|
21
|
+
.object({
|
|
22
|
+
observationId: id,
|
|
23
|
+
candidateObservationIds: z.array(id),
|
|
24
|
+
})
|
|
25
|
+
.strict()),
|
|
26
|
+
})
|
|
27
|
+
.strict();
|
|
28
|
+
/** Pure records workflow: no retrieval, local model execution, or persistence. */
|
|
29
|
+
export async function deduplicateRecords(input, options) {
|
|
30
|
+
options.signal?.throwIfAborted();
|
|
31
|
+
// Snapshot before yielding: a host cannot mutate evidence during the review.
|
|
32
|
+
const data = deduplicateRecordsInputSchema.parse(structuredClone(input));
|
|
33
|
+
const references = new Map();
|
|
34
|
+
const observations = new Map();
|
|
35
|
+
for (const entry of data.observations) {
|
|
36
|
+
if (observations.has(entry.id))
|
|
37
|
+
throw new Error(`Duplicate observation ID: ${entry.id}`);
|
|
38
|
+
// Original finding IDs can repeat across scans; host IDs identify observations.
|
|
39
|
+
const findingId = `csf_${createHash("sha256")
|
|
40
|
+
.update(entry.id)
|
|
41
|
+
.digest("hex")
|
|
42
|
+
.slice(0, 24)}`;
|
|
43
|
+
observations.set(entry.id, { ...entry.finding, findingId });
|
|
44
|
+
references.set(findingId, entry.id);
|
|
45
|
+
}
|
|
46
|
+
const relationships = new Map();
|
|
47
|
+
for (const relation of data.candidateRelationships) {
|
|
48
|
+
if (!observations.has(relation.observationId) ||
|
|
49
|
+
relationships.has(relation.observationId))
|
|
50
|
+
throw new Error("Each candidate relationship must name a different supplied observation.");
|
|
51
|
+
if (new Set(relation.candidateObservationIds).size !==
|
|
52
|
+
relation.candidateObservationIds.length ||
|
|
53
|
+
relation.candidateObservationIds.some((id) => id === relation.observationId || !observations.has(id)))
|
|
54
|
+
throw new Error("Candidates must name distinct supplied observations other than the anchor.");
|
|
55
|
+
relationships.set(relation.observationId, relation.candidateObservationIds);
|
|
56
|
+
}
|
|
57
|
+
const result = {
|
|
58
|
+
version: 1,
|
|
59
|
+
status: "completed",
|
|
60
|
+
groups: [],
|
|
61
|
+
unresolved: [],
|
|
62
|
+
};
|
|
63
|
+
const sourceFindings = [...relationships.keys()].map((id) => observations.get(id));
|
|
64
|
+
const reviewer = new CodexDeduplicationReviewer({
|
|
65
|
+
async run({ validate, ...review }) {
|
|
66
|
+
try {
|
|
67
|
+
return await abortable(async () => {
|
|
68
|
+
options.signal?.throwIfAborted();
|
|
69
|
+
return validate(await options.reviewRunner.run({
|
|
70
|
+
...review,
|
|
71
|
+
requestId: randomUUID(),
|
|
72
|
+
trustedInstructions: [
|
|
73
|
+
sourceReviewInstructions,
|
|
74
|
+
review.stage === "screening"
|
|
75
|
+
? screeningInstructions
|
|
76
|
+
: pairReviewInstructions,
|
|
77
|
+
review.stage === "screening"
|
|
78
|
+
? screeningFindingFormatInstructions
|
|
79
|
+
: pairFindingFormatInstructions,
|
|
80
|
+
].join("\n\n"),
|
|
81
|
+
findingSchema: findingSchema(),
|
|
82
|
+
}, { signal: options.signal }));
|
|
83
|
+
}, options.signal);
|
|
84
|
+
}
|
|
85
|
+
catch (error) {
|
|
86
|
+
// Records mode discards the batch after any failed review.
|
|
87
|
+
if (error instanceof DeduplicationReviewError &&
|
|
88
|
+
error.metadata.category === "refusal")
|
|
89
|
+
throw new Error(error.message, { cause: error });
|
|
90
|
+
throw error;
|
|
91
|
+
}
|
|
92
|
+
},
|
|
93
|
+
});
|
|
94
|
+
const algorithm = new FindingDeduplicator({
|
|
95
|
+
async potentialDuplicates(findingId) {
|
|
96
|
+
const observationId = references.get(findingId);
|
|
97
|
+
return {
|
|
98
|
+
finding: observations.get(observationId),
|
|
99
|
+
potentialDuplicates: relationships
|
|
100
|
+
.get(observationId)
|
|
101
|
+
.map((id) => observations.get(id)),
|
|
102
|
+
};
|
|
103
|
+
},
|
|
104
|
+
}, reviewer, options.signal, 1);
|
|
105
|
+
let groups;
|
|
106
|
+
try {
|
|
107
|
+
const decisions = await algorithm.run(sourceFindings.map((finding) => finding.findingId));
|
|
108
|
+
options.signal?.throwIfAborted();
|
|
109
|
+
groups = decisions.duplicateGroups;
|
|
110
|
+
}
|
|
111
|
+
catch (error) {
|
|
112
|
+
options.signal?.throwIfAborted();
|
|
113
|
+
result.status = "unresolved";
|
|
114
|
+
result.unresolved = [...relationships.keys()].map((id) => ({
|
|
115
|
+
observationId: id,
|
|
116
|
+
reason: "review_failed",
|
|
117
|
+
message: error instanceof Error ? error.message : "Review did not complete.",
|
|
118
|
+
}));
|
|
119
|
+
return result;
|
|
120
|
+
}
|
|
121
|
+
const grouped = new Set(groups.flat());
|
|
122
|
+
groups.push(...sourceFindings
|
|
123
|
+
.filter((finding) => !grouped.has(finding.findingId))
|
|
124
|
+
.map((finding) => [finding.findingId]));
|
|
125
|
+
for (const group of groups) {
|
|
126
|
+
const observationIds = group.map((id) => references.get(id));
|
|
127
|
+
result.groups.push({
|
|
128
|
+
representativeObservationId: observationIds[0],
|
|
129
|
+
observationIds,
|
|
130
|
+
});
|
|
131
|
+
}
|
|
132
|
+
return result;
|
|
133
|
+
}
|
|
134
|
+
//# sourceMappingURL=records.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"records.js","sourceRoot":"","sources":["../../src/deduplication/records.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,EAAE,CAAC,EAAE,MAAM,OAAO,CAAC;AAC1B,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AAExD,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE1C,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,0BAA0B,EAAE,MAAM,6BAA6B,CAAC;AACzE,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACpE,OAAO,EACL,wBAAwB,EACxB,qBAAqB,EACrB,sBAAsB,EACtB,kCAAkC,EAClC,6BAA6B,GAC9B,MAAM,4BAA4B,CAAC;AAGpC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7B,MAAM,MAAM,GAAG,CAAC;KACb,MAAM,CAAC;IACN,EAAE;IACF,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;CACjE,CAAC;KACD,MAAM,EAAE,CAAC;AAEZ,MAAM,6BAA6B,GAAuC,CAAC;KACxE,MAAM,CAAC;IACN,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACrB,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAC7B,sBAAsB,EAAE,CAAC,CAAC,KAAK,CAC7B,CAAC;SACE,MAAM,CAAC;QACN,aAAa,EAAE,EAAE;QACjB,uBAAuB,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;KACrC,CAAC;SACD,MAAM,EAAE,CACZ;CACF,CAAC;KACD,MAAM,EAAE,CAAC;AA4BZ,kFAAkF;AAClF,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAA8B,EAC9B,OAAkC;IAElC,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,6EAA6E;IAC7E,MAAM,IAAI,GAAG,6BAA6B,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;IACzE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAmB,CAAC;IAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QACtC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,6BAA6B,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3D,gFAAgF;QAChF,MAAM,SAAS,GAAG,OAAO,UAAU,CAAC,QAAQ,CAAC;aAC1C,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;aAChB,MAAM,CAAC,KAAK,CAAC;aACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QAClB,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;QAC5D,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;IAClD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,sBAAsB,EAAE,CAAC;QACnD,IACE,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC;YACzC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC;YAEzC,MAAM,IAAI,KAAK,CACb,yEAAyE,CAC1E,CAAC;QACJ,IACE,IAAI,GAAG,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC,IAAI;YAC5C,QAAQ,CAAC,uBAAuB,CAAC,MAAM;YACzC,QAAQ,CAAC,uBAAuB,CAAC,IAAI,CACnC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,QAAQ,CAAC,aAAa,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAC/D;YAED,MAAM,IAAI,KAAK,CACb,4EAA4E,CAC7E,CAAC;QACJ,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAE,QAAQ,CAAC,uBAAuB,CAAC,CAAC;IAC9E,CAAC;IACD,MAAM,MAAM,GAA6B;QACvC,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,WAAW;QACnB,MAAM,EAAE,EAAE;QACV,UAAU,EAAE,EAAE;KACf,CAAC;IACF,MAAM,cAAc,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAC1D,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CACtB,CAAC;IACF,MAAM,QAAQ,GAAG,IAAI,0BAA0B,CAAC;QAC9C,KAAK,CAAC,GAAG,CAAI,EAAE,QAAQ,EAAE,GAAG,MAAM,EAAkB;YAClD,IAAI,CAAC;gBACH,OAAO,MAAM,SAAS,CAAC,KAAK,IAAI,EAAE;oBAChC,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;oBACjC,OAAO,QAAQ,CACb,MAAM,OAAO,CAAC,YAAY,CAAC,GAAG,CAC5B;wBACE,GAAG,MAAM;wBACT,SAAS,EAAE,UAAU,EAAE;wBACvB,mBAAmB,EAAE;4BACnB,wBAAwB;4BACxB,MAAM,CAAC,KAAK,KAAK,WAAW;gCAC1B,CAAC,CAAC,qBAAqB;gCACvB,CAAC,CAAC,sBAAsB;4BAC1B,MAAM,CAAC,KAAK,KAAK,WAAW;gCAC1B,CAAC,CAAC,kCAAkC;gCACpC,CAAC,CAAC,6BAA6B;yBAClC,CAAC,IAAI,CAAC,MAAM,CAAC;wBACd,aAAa,EAAE,aAAa,EAAE;qBAC/B,EACD,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAC3B,CACF,CAAC;gBACJ,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,2DAA2D;gBAC3D,IACE,KAAK,YAAY,wBAAwB;oBACzC,KAAK,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS;oBAErC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;gBACnD,MAAM,KAAK,CAAC;YACd,CAAC;QACH,CAAC;KACF,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,mBAAmB,CACvC;QACE,KAAK,CAAC,mBAAmB,CAAC,SAAS;YACjC,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;YACjD,OAAO;gBACL,OAAO,EAAE,YAAY,CAAC,GAAG,CAAC,aAAa,CAAE;gBACzC,mBAAmB,EAAE,aAAa;qBAC/B,GAAG,CAAC,aAAa,CAAE;qBACnB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;aACtC,CAAC;QACJ,CAAC;KACF,EACD,QAAQ,EACR,OAAO,CAAC,MAAM,EACd,CAAC,CACF,CAAC;IACF,IAAI,MAAkB,CAAC;IACvB,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,GAAG,CACnC,cAAc,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CACnD,CAAC;QACF,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QACjC,MAAM,GAAG,SAAS,CAAC,eAAe,CAAC;IACrC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QACjC,MAAM,CAAC,MAAM,GAAG,YAAY,CAAC;QAC7B,MAAM,CAAC,UAAU,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACzD,aAAa,EAAE,EAAE;YACjB,MAAM,EAAE,eAAe;YACvB,OAAO,EACL,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,0BAA0B;SACtE,CAAC,CAAC,CAAC;QACJ,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,MAAM,CAAC,IAAI,CACT,GAAG,cAAc;SACd,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;SACpD,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CACzC,CAAC;IACF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;QAC9D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;YACjB,2BAA2B,EAAE,cAAc,CAAC,CAAC,CAAE;YAC/C,cAAc;SACf,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import { createHash, randomUUID } from \"node:crypto\";\nimport { z } from \"incur\";\nimport { DeduplicationReviewError } from \"../errors.js\";\nimport type { Finding } from \"../models.js\";\nimport { abortable } from \"../targets.js\";\nimport type { CodexReview } from \"./codex-review.js\";\nimport { FindingDeduplicator } from \"./deduplication.js\";\nimport { CodexDeduplicationReviewer } from \"./deduplication-reviewer.js\";\nimport { findingSchema, requireFinding } from \"./finding-schema.js\";\nimport {\n sourceReviewInstructions,\n screeningInstructions,\n pairReviewInstructions,\n screeningFindingFormatInstructions,\n pairFindingFormatInstructions,\n} from \"./deduplication-prompts.js\";\nimport type { DeduplicationReviewRunner } from \"./review.js\";\n\nconst id = z.string().min(1);\nconst record = z\n .object({\n id,\n finding: z.unknown().transform((value) => requireFinding(value)),\n })\n .strict();\n\nconst deduplicateRecordsInputSchema: z.ZodType<DeduplicateRecordsInput> = z\n .object({\n version: z.literal(1),\n observations: z.array(record),\n candidateRelationships: z.array(\n z\n .object({\n observationId: id,\n candidateObservationIds: z.array(id),\n })\n .strict(),\n ),\n })\n .strict();\n\nexport interface DeduplicateRecordsInput {\n version: 1;\n observations: { id: string; finding: Finding }[];\n candidateRelationships: {\n observationId: string;\n candidateObservationIds: string[];\n }[];\n}\nexport interface DeduplicateRecordsOptions {\n reviewRunner: DeduplicationReviewRunner;\n signal?: AbortSignal;\n}\nexport interface DeduplicateRecordsResult {\n version: 1;\n status: \"completed\" | \"unresolved\";\n groups: {\n representativeObservationId: string;\n observationIds: string[];\n }[];\n unresolved: {\n observationId: string;\n reason: \"review_failed\";\n message: string;\n }[];\n}\n\n/** Pure records workflow: no retrieval, local model execution, or persistence. */\nexport async function deduplicateRecords(\n input: DeduplicateRecordsInput,\n options: DeduplicateRecordsOptions,\n): Promise<DeduplicateRecordsResult> {\n options.signal?.throwIfAborted();\n // Snapshot before yielding: a host cannot mutate evidence during the review.\n const data = deduplicateRecordsInputSchema.parse(structuredClone(input));\n const references = new Map<string, string>();\n const observations = new Map<string, Finding>();\n for (const entry of data.observations) {\n if (observations.has(entry.id))\n throw new Error(`Duplicate observation ID: ${entry.id}`);\n // Original finding IDs can repeat across scans; host IDs identify observations.\n const findingId = `csf_${createHash(\"sha256\")\n .update(entry.id)\n .digest(\"hex\")\n .slice(0, 24)}`;\n observations.set(entry.id, { ...entry.finding, findingId });\n references.set(findingId, entry.id);\n }\n const relationships = new Map<string, string[]>();\n for (const relation of data.candidateRelationships) {\n if (\n !observations.has(relation.observationId) ||\n relationships.has(relation.observationId)\n )\n throw new Error(\n \"Each candidate relationship must name a different supplied observation.\",\n );\n if (\n new Set(relation.candidateObservationIds).size !==\n relation.candidateObservationIds.length ||\n relation.candidateObservationIds.some(\n (id) => id === relation.observationId || !observations.has(id),\n )\n )\n throw new Error(\n \"Candidates must name distinct supplied observations other than the anchor.\",\n );\n relationships.set(relation.observationId, relation.candidateObservationIds);\n }\n const result: DeduplicateRecordsResult = {\n version: 1,\n status: \"completed\",\n groups: [],\n unresolved: [],\n };\n const sourceFindings = [...relationships.keys()].map((id) =>\n observations.get(id)!,\n );\n const reviewer = new CodexDeduplicationReviewer({\n async run<T>({ validate, ...review }: CodexReview<T>): Promise<T> {\n try {\n return await abortable(async () => {\n options.signal?.throwIfAborted();\n return validate(\n await options.reviewRunner.run(\n {\n ...review,\n requestId: randomUUID(),\n trustedInstructions: [\n sourceReviewInstructions,\n review.stage === \"screening\"\n ? screeningInstructions\n : pairReviewInstructions,\n review.stage === \"screening\"\n ? screeningFindingFormatInstructions\n : pairFindingFormatInstructions,\n ].join(\"\\n\\n\"),\n findingSchema: findingSchema(),\n },\n { signal: options.signal },\n ),\n );\n }, options.signal);\n } catch (error) {\n // Records mode discards the batch after any failed review.\n if (\n error instanceof DeduplicationReviewError &&\n error.metadata.category === \"refusal\"\n )\n throw new Error(error.message, { cause: error });\n throw error;\n }\n },\n });\n const algorithm = new FindingDeduplicator(\n {\n async potentialDuplicates(findingId) {\n const observationId = references.get(findingId)!;\n return {\n finding: observations.get(observationId)!,\n potentialDuplicates: relationships\n .get(observationId)!\n .map((id) => observations.get(id)!),\n };\n },\n },\n reviewer,\n options.signal,\n 1,\n );\n let groups: string[][];\n try {\n const decisions = await algorithm.run(\n sourceFindings.map((finding) => finding.findingId),\n );\n options.signal?.throwIfAborted();\n groups = decisions.duplicateGroups;\n } catch (error) {\n options.signal?.throwIfAborted();\n result.status = \"unresolved\";\n result.unresolved = [...relationships.keys()].map((id) => ({\n observationId: id,\n reason: \"review_failed\",\n message:\n error instanceof Error ? error.message : \"Review did not complete.\",\n }));\n return result;\n }\n const grouped = new Set(groups.flat());\n groups.push(\n ...sourceFindings\n .filter((finding) => !grouped.has(finding.findingId))\n .map((finding) => [finding.findingId]),\n );\n for (const group of groups) {\n const observationIds = group.map((id) => references.get(id)!);\n result.groups.push({\n representativeObservationId: observationIds[0]!,\n observationIds,\n });\n }\n return result;\n}\n"]}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"refusal.d.ts","sourceRoot":"","sources":["../../src/deduplication/refusal.ts"],"names":[],"mappings":"AAAA,4FAA4F;AAC5F,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,EACf,cAAc,CAAC,EAAE,OAAO,GACvB,OAAO,CAeT"}
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
/** Recognize policy blocks and explicit refusal responses, not ordinary review failures. */
|
|
2
|
+
export function isReviewRefusal(message, codexErrorInfo) {
|
|
3
|
+
if (codexErrorInfo === "cyberPolicy" ||
|
|
4
|
+
codexErrorInfo === "misalignmentPolicyViolation")
|
|
5
|
+
return true;
|
|
6
|
+
return [
|
|
7
|
+
/\bflagged for possible cybersecurity risk\b/iu,
|
|
8
|
+
/\bflagged for potentially high-risk cyber activity\b/iu,
|
|
9
|
+
/\bcyber[_\s-]?policy\b/iu,
|
|
10
|
+
/\b(?:cybersecurity|cyber|content|safety)[ _-]*policy[ _-]*(?:violation|refusal|refused)\b/iu,
|
|
11
|
+
/\b(?:refusal|refused)\b[^\n]*\b(?:cybersecurity|cyber|safety policy)\b/iu,
|
|
12
|
+
/\b(?:cybersecurity|cyber|safety policy)\b[^\n]*\b(?:refusal|refused)\b/iu,
|
|
13
|
+
/^(?:I(?:['’]m| am) sorry[,.:]?\s*(?:but\s+)?|Sorry[,.:]?\s*)?I(?:\s+(?:cannot|can['’]t|won['’]t|am unable to)|['’]m unable to)\s+(?:help|assist|comply)\b/iu,
|
|
14
|
+
].some((pattern) => pattern.test(message.trim()));
|
|
15
|
+
}
|
|
16
|
+
//# sourceMappingURL=refusal.js.map
|