@openai/codex-security 0.8.1 → 0.8.3
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 +45 -57
- package/_bundled_plugin/.app.json +4 -0
- package/_bundled_plugin/.mcp.json +1 -0
- package/_bundled_plugin/mcp/helpers.mjs.br.part-000 +0 -0
- package/_bundled_plugin/mcp/helpers.mjs.br.part-001 +0 -0
- package/_bundled_plugin/mcp/native/THIRD_PARTY_NOTICES.txt +4 -4
- package/_bundled_plugin/mcp/native/darwin-arm64/unix.node +0 -0
- package/_bundled_plugin/mcp/native/darwin-x64/unix.node +0 -0
- package/_bundled_plugin/mcp/native/linux-arm64-gnu/unix.node +0 -0
- package/_bundled_plugin/mcp/native/linux-arm64-musl/unix.node +0 -0
- package/_bundled_plugin/mcp/native/linux-x64-gnu/unix.node +0 -0
- package/_bundled_plugin/mcp/native/linux-x64-musl/unix.node +0 -0
- 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/permission-profile-preflight.mjs +46 -12
- 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/mcp/server.mjs.br.part-002 +0 -0
- package/_bundled_plugin/references/artifact-storage.md +1 -1
- package/_bundled_plugin/references/core-scan.md +14 -5
- package/_bundled_plugin/references/default-severity-rubric.md +28 -0
- package/_bundled_plugin/references/finding-detail-fields.md +1 -0
- package/_bundled_plugin/references/threat-model.md +1 -0
- package/_bundled_plugin/scripts/deep_scan_workbench.py +23 -112
- package/_bundled_plugin/scripts/finalize_scan_contract.py +167 -153
- package/_bundled_plugin/scripts/finding_preview.py +5 -29
- package/_bundled_plugin/scripts/posix_scan_local_files.py +187 -0
- package/_bundled_plugin/scripts/report_projection.py +87 -136
- package/_bundled_plugin/scripts/validate_scan_contract.py +2 -6
- package/_bundled_plugin/scripts/windows_scan_local_files.py +212 -55
- package/_bundled_plugin/scripts/workbench/retained_coverage.py +8 -24
- package/_bundled_plugin/scripts/workbench/saved_coverage.py +143 -231
- package/_bundled_plugin/scripts/workbench_cli.py +102 -13
- package/_bundled_plugin/scripts/workbench_constants.py +9 -0
- package/_bundled_plugin/scripts/workbench_coverage_receipts.py +0 -17
- package/_bundled_plugin/scripts/workbench_db.py +187 -363
- package/_bundled_plugin/scripts/workbench_finding_workflows.py +86 -4
- package/_bundled_plugin/scripts/workbench_native_indexes.py +17 -21
- package/_bundled_plugin/scripts/workbench_remediation.py +495 -11
- package/_bundled_plugin/scripts/workbench_saved_results.py +0 -66
- package/_bundled_plugin/scripts/workbench_scan_history.py +22 -25
- package/_bundled_plugin/scripts/workbench_scan_start.py +1 -1
- package/_bundled_plugin/scripts/workbench_scan_usage.py +25 -52
- package/_bundled_plugin/scripts/workbench_schema.py +1 -1
- package/_bundled_plugin/scripts/workbench_setup.py +239 -0
- package/_bundled_plugin/scripts/workbench_source_scopes.py +15 -23
- package/_bundled_plugin/scripts/workbench_target.py +120 -35
- package/_bundled_plugin/scripts/workbench_validation.py +1 -9
- package/_bundled_plugin/shared/workbench-history-repairs.json +7 -0
- package/_bundled_plugin/shared/workbench-migrations.json +19 -0
- package/_bundled_plugin/skills/attack-path-analysis/SKILL.md +1 -1
- package/_bundled_plugin/skills/attack-path-analysis/references/severity-policy.md +4 -68
- package/_bundled_plugin/skills/check-skills/SKILL.md +43 -0
- package/_bundled_plugin/skills/check-skills/agents/openai.yaml +4 -0
- package/_bundled_plugin/skills/cloud-findings/SKILL.md +2 -0
- package/_bundled_plugin/skills/fix-finding/SKILL.md +18 -1
- package/_bundled_plugin/skills/publish-findings/SKILL.md +68 -35
- package/_bundled_plugin/skills/publish-findings/references/wiz-import.md +2 -21
- package/_bundled_plugin/skills/resolve-dependency-alert/SKILL.md +18 -0
- package/_bundled_plugin/skills/resolve-dependency-alert/agents/openai.yaml +4 -0
- package/_bundled_plugin/skills/threat-model-visualize/SKILL.md +83 -0
- package/_bundled_plugin/skills/threat-model-visualize/agents/openai.yaml +4 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/context-reference-overview.svg +366 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/context-reference-path.svg +558 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/control-effects.js +85 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/explorer.css +17 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/explorer.html +38 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/explorer.js +372 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/route-paths.js +71 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/source-roles.js +47 -0
- package/_bundled_plugin/skills/threat-model-visualize/assets/svg-layout.js +149 -0
- package/_bundled_plugin/skills/threat-model-visualize/references/context-explorer.md +21 -0
- package/_bundled_plugin/skills/threat-model-visualize/references/view-model.md +49 -0
- package/_bundled_plugin/skills/threat-model-visualize/scripts/build_explorer.py +569 -0
- package/_bundled_plugin/skills/track-findings/SKILL.md +5 -3
- package/_bundled_plugin/skills/triage-finding/references/github-rest-intake.md +22 -68
- package/_bundled_plugin/skills/triage-finding/references/ticket-intake.md +6 -4
- package/dist/api.d.ts +6 -1
- package/dist/api.d.ts.map +1 -1
- package/dist/api.js +414 -163
- package/dist/api.js.map +1 -1
- package/dist/auth.js +7 -2
- package/dist/auth.js.map +1 -1
- package/dist/blackduck-findings.d.ts +8 -0
- package/dist/blackduck-findings.d.ts.map +1 -0
- package/dist/blackduck-findings.js +305 -0
- package/dist/blackduck-findings.js.map +1 -0
- package/dist/bulk-scan-discovery.d.ts.map +1 -1
- package/dist/bulk-scan-discovery.js +51 -36
- package/dist/bulk-scan-discovery.js.map +1 -1
- package/dist/classify-severity-records.d.ts +5 -0
- package/dist/classify-severity-records.d.ts.map +1 -1
- package/dist/classify-severity-records.js +6 -8
- package/dist/classify-severity-records.js.map +1 -1
- package/dist/classify-severity.d.ts +4 -1
- package/dist/classify-severity.d.ts.map +1 -1
- package/dist/classify-severity.js +28 -9
- package/dist/classify-severity.js.map +1 -1
- package/dist/cli.d.ts +3 -0
- package/dist/cli.d.ts.map +1 -1
- package/dist/cli.js +635 -266
- package/dist/cli.js.map +1 -1
- package/dist/codex-prompt.d.ts +2 -0
- package/dist/codex-prompt.d.ts.map +1 -1
- package/dist/codex-prompt.js +6 -0
- package/dist/codex-prompt.js.map +1 -1
- package/dist/component-scan.d.ts.map +1 -1
- package/dist/component-scan.js +6 -5
- package/dist/component-scan.js.map +1 -1
- package/dist/config.d.ts +2 -1
- package/dist/config.d.ts.map +1 -1
- package/dist/config.js +162 -40
- package/dist/config.js.map +1 -1
- package/dist/continuum-findings.d.ts +7 -0
- package/dist/continuum-findings.d.ts.map +1 -0
- package/dist/continuum-findings.js +157 -0
- package/dist/continuum-findings.js.map +1 -0
- package/dist/contract-values.d.ts +28 -0
- package/dist/contract-values.d.ts.map +1 -0
- package/dist/contract-values.js +75 -0
- package/dist/contract-values.js.map +1 -0
- package/dist/contract.d.ts +2 -20
- package/dist/contract.d.ts.map +1 -1
- package/dist/contract.js +58 -669
- package/dist/contract.js.map +1 -1
- package/dist/cost-model.d.ts.map +1 -1
- package/dist/cost-model.js +1 -4
- package/dist/cost-model.js.map +1 -1
- package/dist/cost.d.ts +19 -1
- package/dist/cost.d.ts.map +1 -1
- package/dist/cost.js +2120 -39
- package/dist/cost.js.map +1 -1
- package/dist/custom-validation-prompt.d.ts +1 -1
- package/dist/custom-validation-prompt.d.ts.map +1 -1
- package/dist/custom-validation-prompt.js +5 -0
- package/dist/custom-validation-prompt.js.map +1 -1
- package/dist/custom-validation.d.ts +2 -0
- package/dist/custom-validation.d.ts.map +1 -1
- package/dist/custom-validation.js +6 -2
- package/dist/custom-validation.js.map +1 -1
- package/dist/deduplication/deduplication-prompts.d.ts +4 -4
- 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 +14 -11
- package/dist/deduplication/deduplication-reviewer.d.ts.map +1 -1
- package/dist/deduplication/deduplication-reviewer.js +12 -5
- package/dist/deduplication/deduplication-reviewer.js.map +1 -1
- package/dist/deduplication/deduplication.js.map +1 -1
- package/dist/deduplication/finding-schema.d.ts +19 -1
- package/dist/deduplication/finding-schema.d.ts.map +1 -1
- package/dist/deduplication/finding-schema.js +25 -0
- package/dist/deduplication/finding-schema.js.map +1 -1
- package/dist/deduplication/local.d.ts.map +1 -1
- package/dist/deduplication/local.js +3 -8
- package/dist/deduplication/local.js.map +1 -1
- package/dist/deduplication/records.d.ts +11 -3
- package/dist/deduplication/records.d.ts.map +1 -1
- package/dist/deduplication/records.js +48 -16
- package/dist/deduplication/records.js.map +1 -1
- package/dist/deep-scan.d.ts +11 -0
- package/dist/deep-scan.d.ts.map +1 -1
- package/dist/deep-scan.js +235 -4
- package/dist/deep-scan.js.map +1 -1
- package/dist/default-severity-rubric.d.ts +1 -2
- package/dist/default-severity-rubric.d.ts.map +1 -1
- package/dist/default-severity-rubric.js +2 -66
- package/dist/default-severity-rubric.js.map +1 -1
- package/dist/endor-findings.d.ts.map +1 -1
- package/dist/endor-findings.js +44 -89
- package/dist/endor-findings.js.map +1 -1
- package/dist/errors.js +1 -1
- package/dist/errors.js.map +1 -1
- package/dist/external-findings-import.d.ts.map +1 -1
- package/dist/external-findings-import.js +11 -15
- package/dist/external-findings-import.js.map +1 -1
- package/dist/external-findings-local.d.ts +12 -1
- package/dist/external-findings-local.d.ts.map +1 -1
- package/dist/external-findings-local.js +411 -184
- package/dist/external-findings-local.js.map +1 -1
- package/dist/external-findings-publish.d.ts +15 -1
- package/dist/external-findings-publish.d.ts.map +1 -1
- package/dist/external-findings-publish.js +1238 -226
- package/dist/external-findings-publish.js.map +1 -1
- package/dist/external-findings-read.d.ts +10 -0
- package/dist/external-findings-read.d.ts.map +1 -1
- package/dist/external-findings-read.js +71 -51
- package/dist/external-findings-read.js.map +1 -1
- package/dist/external-findings.d.ts +13 -0
- package/dist/external-findings.d.ts.map +1 -1
- package/dist/external-findings.js +124 -1
- package/dist/external-findings.js.map +1 -1
- package/dist/external-import-contract.d.ts +29 -1
- package/dist/external-import-contract.d.ts.map +1 -1
- package/dist/external-import-contract.js +314 -44
- package/dist/external-import-contract.js.map +1 -1
- package/dist/external-import-models.d.ts +1 -1
- package/dist/external-import-models.d.ts.map +1 -1
- package/dist/external-import-models.js.map +1 -1
- package/dist/finding-normalization.d.ts +1 -1
- package/dist/finding-normalization.d.ts.map +1 -1
- package/dist/finding-normalization.js +46 -11
- package/dist/finding-normalization.js.map +1 -1
- package/dist/finding-retrieval.d.ts +3 -3
- package/dist/finding-retrieval.d.ts.map +1 -1
- package/dist/finding-retrieval.js.map +1 -1
- package/dist/finding-workflow.d.ts +6 -1
- package/dist/finding-workflow.d.ts.map +1 -1
- package/dist/finding-workflow.js +2 -2
- package/dist/finding-workflow.js.map +1 -1
- package/dist/git-remote.d.ts +4 -0
- package/dist/git-remote.d.ts.map +1 -1
- package/dist/git-remote.js +20 -0
- package/dist/git-remote.js.map +1 -1
- package/dist/github-advisories.d.ts +3 -12
- package/dist/github-advisories.d.ts.map +1 -1
- package/dist/github-advisories.js +9 -29
- package/dist/github-advisories.js.map +1 -1
- package/dist/github-dependabot-findings.d.ts.map +1 -1
- package/dist/github-dependabot-findings.js +7 -16
- package/dist/github-dependabot-findings.js.map +1 -1
- package/dist/github-findings.d.ts.map +1 -1
- package/dist/github-findings.js +344 -56
- package/dist/github-findings.js.map +1 -1
- package/dist/github.d.ts +17 -7
- package/dist/github.d.ts.map +1 -1
- package/dist/github.js +43 -30
- package/dist/github.js.map +1 -1
- package/dist/host-protocol.d.ts +7 -2
- package/dist/host-protocol.d.ts.map +1 -1
- package/dist/host-protocol.js +27 -3
- package/dist/host-protocol.js.map +1 -1
- package/dist/host-records-protocol.d.ts +10 -11
- package/dist/host-records-protocol.d.ts.map +1 -1
- package/dist/host-records-protocol.js +69 -9
- package/dist/host-records-protocol.js.map +1 -1
- package/dist/hosted-scan.d.ts +15 -0
- package/dist/hosted-scan.d.ts.map +1 -1
- package/dist/hosted-scan.js +55 -33
- package/dist/hosted-scan.js.map +1 -1
- package/dist/index.d.ts +8 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +7 -0
- package/dist/index.js.map +1 -1
- package/dist/inspector-findings.d.ts +9 -0
- package/dist/inspector-findings.d.ts.map +1 -0
- package/dist/inspector-findings.js +512 -0
- package/dist/inspector-findings.js.map +1 -0
- package/dist/knowledge-base.js +18 -5
- package/dist/knowledge-base.js.map +1 -1
- package/dist/local-git-metadata.d.ts +5 -0
- package/dist/local-git-metadata.d.ts.map +1 -0
- package/dist/local-git-metadata.js +131 -0
- package/dist/local-git-metadata.js.map +1 -0
- package/dist/multiscan.d.ts.map +1 -1
- package/dist/multiscan.js +22 -12
- package/dist/multiscan.js.map +1 -1
- package/dist/opengrep-findings.d.ts.map +1 -1
- package/dist/opengrep-findings.js +34 -20
- package/dist/opengrep-findings.js.map +1 -1
- package/dist/patch-tui.d.ts +1 -1
- package/dist/patch-tui.d.ts.map +1 -1
- package/dist/patch-tui.js +94 -36
- package/dist/patch-tui.js.map +1 -1
- package/dist/private-finding-import.d.ts +246 -0
- package/dist/private-finding-import.d.ts.map +1 -0
- package/dist/private-finding-import.js +387 -0
- package/dist/private-finding-import.js.map +1 -0
- package/dist/project-config.d.ts.map +1 -1
- package/dist/project-config.js +2 -2
- package/dist/project-config.js.map +1 -1
- package/dist/provider-profile.d.ts +10 -2
- package/dist/provider-profile.d.ts.map +1 -1
- package/dist/provider-profile.js +72 -10
- package/dist/provider-profile.js.map +1 -1
- package/dist/publication.js +7 -1
- package/dist/publication.js.map +1 -1
- package/dist/reader-selection.d.ts +13 -0
- package/dist/reader-selection.d.ts.map +1 -0
- package/dist/reader-selection.js +81 -0
- package/dist/reader-selection.js.map +1 -0
- package/dist/record.d.ts +6 -1
- package/dist/record.d.ts.map +1 -1
- package/dist/record.js +53 -2
- package/dist/record.js.map +1 -1
- package/dist/remediation.d.ts +5 -0
- package/dist/remediation.d.ts.map +1 -1
- package/dist/remediation.js +30 -0
- package/dist/remediation.js.map +1 -1
- package/dist/result.d.ts +2 -0
- package/dist/result.d.ts.map +1 -1
- package/dist/result.js +3 -1
- package/dist/result.js.map +1 -1
- package/dist/runtime.d.ts +5 -3
- package/dist/runtime.d.ts.map +1 -1
- package/dist/runtime.js +110 -57
- package/dist/runtime.js.map +1 -1
- package/dist/scan-activity.js +40 -17
- package/dist/scan-activity.js.map +1 -1
- package/dist/scan-comparison.d.ts +1 -1
- package/dist/scan-comparison.d.ts.map +1 -1
- package/dist/scan-comparison.js +11 -13
- package/dist/scan-comparison.js.map +1 -1
- package/dist/scan-dashboard.d.ts +1 -0
- package/dist/scan-dashboard.d.ts.map +1 -1
- package/dist/scan-dashboard.js +37 -48
- package/dist/scan-dashboard.js.map +1 -1
- package/dist/scan-executor.d.ts +2 -0
- package/dist/scan-executor.d.ts.map +1 -1
- package/dist/scan-executor.js.map +1 -1
- package/dist/scan-history-renderer.d.ts.map +1 -1
- package/dist/scan-history-renderer.js +22 -9
- package/dist/scan-history-renderer.js.map +1 -1
- package/dist/scan-logs.d.ts.map +1 -1
- package/dist/scan-logs.js +5 -5
- package/dist/scan-logs.js.map +1 -1
- package/dist/scanner-import.d.ts +48 -3
- package/dist/scanner-import.d.ts.map +1 -1
- package/dist/scanner-import.js +214 -39
- package/dist/scanner-import.js.map +1 -1
- package/dist/scanner-repository-url.d.ts +14 -0
- package/dist/scanner-repository-url.d.ts.map +1 -0
- package/dist/scanner-repository-url.js +67 -0
- package/dist/scanner-repository-url.js.map +1 -0
- package/dist/semgrep-findings.d.ts.map +1 -1
- package/dist/semgrep-findings.js +50 -88
- package/dist/semgrep-findings.js.map +1 -1
- package/dist/semgrep-platform-findings.d.ts +12 -0
- package/dist/semgrep-platform-findings.d.ts.map +1 -0
- package/dist/semgrep-platform-findings.js +198 -0
- package/dist/semgrep-platform-findings.js.map +1 -0
- package/dist/severity-rubric.d.ts +20 -0
- package/dist/severity-rubric.d.ts.map +1 -0
- package/dist/severity-rubric.js +73 -0
- package/dist/severity-rubric.js.map +1 -0
- package/dist/severity-store.js +15 -5
- package/dist/severity-store.js.map +1 -1
- package/dist/snyk-findings.d.ts.map +1 -1
- package/dist/snyk-findings.js +97 -106
- package/dist/snyk-findings.js.map +1 -1
- package/dist/sonar-collector.d.ts +16 -0
- package/dist/sonar-collector.d.ts.map +1 -0
- package/dist/sonar-collector.js +383 -0
- package/dist/sonar-collector.js.map +1 -0
- package/dist/sonar-findings.d.ts +49 -0
- package/dist/sonar-findings.d.ts.map +1 -0
- package/dist/sonar-findings.js +288 -0
- package/dist/sonar-findings.js.map +1 -0
- package/dist/sonar-import.d.ts +111 -0
- package/dist/sonar-import.d.ts.map +1 -0
- package/dist/sonar-import.js +279 -0
- package/dist/sonar-import.js.map +1 -0
- package/dist/suggest-owners.d.ts.map +1 -1
- package/dist/suggest-owners.js +2 -1
- package/dist/suggest-owners.js.map +1 -1
- package/dist/targets.d.ts +3 -0
- package/dist/targets.d.ts.map +1 -1
- package/dist/targets.js +18 -12
- package/dist/targets.js.map +1 -1
- package/dist/terminal-columns.d.ts +4 -0
- package/dist/terminal-columns.d.ts.map +1 -0
- package/dist/terminal-columns.js +19 -0
- package/dist/terminal-columns.js.map +1 -0
- package/dist/validation-records.d.ts +0 -3
- package/dist/validation-records.d.ts.map +1 -1
- package/dist/validation-records.js +0 -16
- package/dist/validation-records.js.map +1 -1
- package/dist/veracode-findings.d.ts +7 -0
- package/dist/veracode-findings.d.ts.map +1 -0
- package/dist/veracode-findings.js +371 -0
- package/dist/veracode-findings.js.map +1 -0
- package/dist/windows-path.d.ts.map +1 -1
- package/dist/windows-path.js +1 -0
- package/dist/windows-path.js.map +1 -1
- package/dist/wiz-csv.d.ts +2 -2
- package/dist/wiz-csv.d.ts.map +1 -1
- package/dist/wiz-csv.js +1 -3
- package/dist/wiz-csv.js.map +1 -1
- package/dist/wiz-findings.d.ts +10 -2
- package/dist/wiz-findings.d.ts.map +1 -1
- package/dist/wiz-findings.js +88 -49
- package/dist/wiz-findings.js.map +1 -1
- package/docs/classify-severity-records.md +1 -1
- package/docs/cli.md +320 -481
- package/docs/dedupe-records.md +27 -4
- package/docs/findings-service.md +21 -8
- package/docs/hosted-scans.md +16 -1
- package/package.json +9 -10
- package/schemas/external-findings.schema.json +12 -1
- package/schemas/hosted-scan-v2.fixture.json +16 -1
- package/_bundled_plugin/scripts/validate_tracking_source.py +0 -82
- package/_bundled_plugin/scripts/workbench_local_dedupe.py +0 -136
- package/dist/deduplication/records-protocol.d.ts +0 -4
- package/dist/deduplication/records-protocol.d.ts.map +0 -1
- package/dist/deduplication/records-protocol.js +0 -35
- package/dist/deduplication/records-protocol.js.map +0 -1
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"deduplication-reviewer.js","sourceRoot":"","sources":["../../src/deduplication/deduplication-reviewer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAGrD,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,eAAe,GAChB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,sBAAsB,EAAmB,MAAM,cAAc,CAAC;AAEvE,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACxE,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1B,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IAC3B,SAAS;IACT,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE;IAC9B,aAAa,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;CACjD,CAAC,CAAC;AACH,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;IAC/B,SAAS;IACT,kBAAkB,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE;IACvC,aAAa,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE;CACnC,CAAC,CAAC;AACH,MAAM,YAAY,GAAG,CAAC,CAAC,kBAAkB,CAAC,UAAU,EAAE;IACpD,UAAU;IACV,cAAc;CACf,CAAC,CAAC;AACH,MAAM,uBAAuB,GAAG,CAAC,CAAC,kBAAkB,CAAC,UAAU,EAAE;IAC/D,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;IAC7D,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;CAClE,CAAC,CAAC;AACH,2EAA2E;AAC3E,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,uBAAuB,CAAC;CACzD,CAAC,CAAC;AAWH,MAAM,UAAU,OAAO,CAAC,GAAsB;IAC5C,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,OAAO,QAAQ,KAAK,GAAG,CAAC,EAAE,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,KAAc,EACd,QAA4B;IAE5B,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM;QAAE,OAAO,MAAM,CAAC;IAC9C,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IACrD,IAAI,OAAO,CAAC,SAAS,KAAK,MAAM,CAAC,kBAAkB;QACjD,MAAM,IAAI,KAAK,CACb,gEAAgE,CACjE,CAAC;IACJ,IACE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,KAAK,MAAM,CAAC,kBAAkB,CAAC,EAC5E,CAAC;QACD,MAAM,IAAI,KAAK,CACb,6DAA6D,CAC9D,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAAc,EACd,QAA4B;IAE5B,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,QAAQ;SACtB,KAAK,CAAC,CAAC,CAAC;SACR,GAAG,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChD,IACE,SAAS,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;QACpC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,EAC/D,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,mBAAmB,CAAC,aAAqB;IAChD,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACvD,iBAAiB,CAAC,KAAK,CAAC;QACxB,uBAAuB;KACxB,CAAC,CACH,CAAC;IACF,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;QAC1E,MAAM,EAAE,aAAa;QACrB,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE;YAC3B,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ;gBAAE,UAAU,CAAC,QAAQ,KAAK,EAAE,CAAC;QAC/D,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAED,MAAM,aAAa;IAEI,MAAM;IACR,aAAa;IACX,aAAa;IAHlC,YACqB,MAAsC,EACxC,aAAa,GAAe,EAAE,EAC5B,aAAa,GAElB,GAAG,EAAE,CAAC,EAAE;sBAJH,MAAM;6BACR,aAAa;6BACX,aAAa;IAG/B,CAAC;IAEM,QAAQ,CAAC,KAAa,EAAE,MAAc;QAC9C,MAAM,QAAQ,GAAG,sBAAsB,CAAC;YACtC,KAAK;YACL,sBAAsB,EAAE,MAAM;YAC9B,GAAG,IAAI,CAAC,aAAa;SACtB,CAAC,CAAC;QACH,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,eAAe,EAAE,CAAC;IACrE,CAAC;IACD,KAAK,CAAC,MAAM,CAAC,QAA4B;QACvC,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC3B,KAAK,EAAE,WAAW;YAClB,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC;YACxD,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;YACzC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,eAAe,CAAC,QAAQ,CAAC,EAAE;YACrE,MAAM,EAAE,mBAAmB,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAChD,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC;SACxD,CAAC,CAAC;IACL,CAAC;CACF;AAED,oEAAoE;AACpE,MAAM,OAAO,0BACX,SAAQ,aAAa;IAGrB,KAAK,CAAC,UAAU,CAAC,QAA4B;QAC3C,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC3B,KAAK,EAAE,aAAa;YACpB,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC;YACxD,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;YACvC,MAAM,EAAE,gBAAgB,CAAC,QAAQ,CAAC;YAClC,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,GAAG,CAAC,CAAC,YAAY,CAAC,YAAY,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;aAC3D;YACD,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,QAAQ,CAAC;SACrD,CAAC,CAAC;IACL,CAAC;CACF;AAED,kFAAkF;AAClF,MAAM,OAAO,qBACX,SAAQ,aAAa;IAGrB,KAAK,CAAC,UAAU,CAAC,QAA4B;QAC3C,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC3B,KAAK,EAAE,aAAa;YACpB,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC;YACxD,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,oBAAoB,CAAC,QAAQ,CAAC,EAAE;YAC1E,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,GAAG,CAAC,CAAC,YAAY,CAAC,uBAAuB,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;aACtE;YACD,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,uBAAuB,CAAC,KAAK,CAAC,KAAK,CAAC;SAC1D,CAAC,CAAC;IACL,CAAC;CACF","sourcesContent":["import { z } from \"zod\";\nimport { requireFinding } from \"./finding-schema.js\";\nimport type { Finding } from \"../models.js\";\nimport type { CodexReviewRunner } from \"./codex-review.js\";\nimport {\n pairReviewPrompt,\n groupingReviewPrompt,\n screeningPrompt,\n} from \"./deduplication-prompts.js\";\nimport { scanModelConfiguration, type JsonObject } from \"../config.js\";\n\nconst rationale = z.string().refine((value) => value.trim().length > 0);\nconst sameSchema = z.object({\n decision: z.literal(\"SAME\"),\n rationale,\n canonicalFindingId: z.string(),\n mergedFinding: z.record(z.string(), z.unknown()),\n});\nconst distinctSchema = z.object({\n decision: z.literal(\"DISTINCT\"),\n rationale,\n canonicalFindingId: z.null().optional(),\n mergedFinding: z.null().optional(),\n});\nconst reviewSchema = z.discriminatedUnion(\"decision\", [\n sameSchema,\n distinctSchema,\n]);\nconst screeningDecisionSchema = z.discriminatedUnion(\"decision\", [\n sameSchema.pick({ decision: true, rationale: true }).strict(),\n distinctSchema.pick({ decision: true, rationale: true }).strict(),\n]);\n// The host assigns exact slot names; finding IDs stay out of model output.\nconst screeningSchema = z.strictObject({\n decisions: z.record(z.string(), screeningDecisionSchema),\n});\n\nexport type ScreeningResult = z.infer<typeof screeningSchema>;\nexport type DuplicateDecision = z.infer<typeof reviewSchema>;\nexport type GroupingDecision = z.infer<typeof screeningDecisionSchema>;\n\nexport interface DeduplicationReviewer {\n screen(findings: readonly Finding[]): Promise<ScreeningResult>;\n reviewPair(findings: readonly Finding[]): Promise<GroupingDecision>;\n}\n\nexport function pairKey(ids: readonly string[]): string {\n return JSON.stringify([...ids].sort());\n}\n\nexport function screeningPairSlot(index: number): string {\n return `pair-${index + 1}`;\n}\n\nexport function validateReview(\n value: unknown,\n findings: readonly Finding[],\n): DuplicateDecision {\n const result = reviewSchema.parse(value);\n if (result.decision !== \"SAME\") return result;\n const finding = requireFinding(result.mergedFinding);\n if (finding.findingId !== result.canonicalFindingId)\n throw new Error(\n \"Every SAME decision requires the canonical finding's identity.\",\n );\n if (\n !findings.some((finding) => finding.findingId === result.canonicalFindingId)\n ) {\n throw new Error(\n \"The canonical finding must belong to the assigned findings.\",\n );\n }\n return result;\n}\n\nexport function validateScreening(\n value: unknown,\n findings: readonly Finding[],\n): ScreeningResult {\n const result = screeningSchema.parse(value);\n const required = findings\n .slice(1)\n .map((_finding, index) => screeningPairSlot(index));\n const submitted = Object.keys(result.decisions);\n if (\n submitted.length !== required.length ||\n required.some((slot) => !Object.hasOwn(result.decisions, slot))\n ) {\n throw new Error(\"Submit exactly the assigned screening pair slots.\");\n }\n return result;\n}\n\nfunction screeningToolSchema(neighborCount: number): object {\n const slots = Object.fromEntries(\n Array.from({ length: neighborCount }, (_value, index) => [\n screeningPairSlot(index),\n screeningDecisionSchema,\n ]),\n );\n return z.toJSONSchema(z.strictObject({ decisions: z.strictObject(slots) }), {\n target: \"openapi-3.0\",\n override: ({ jsonSchema }) => {\n if (jsonSchema.type === \"object\") jsonSchema.required ??= [];\n },\n });\n}\n\nclass CodexReviewer {\n constructor(\n protected readonly runner: Pick<CodexReviewRunner, \"run\">,\n private readonly configuration: JsonObject = {},\n protected readonly sourceContext: (\n findings: readonly Finding[],\n ) => string = () => \"\",\n ) {}\n\n protected settings(model: string, effort: string) {\n const selected = scanModelConfiguration({\n model,\n model_reasoning_effort: effort,\n ...this.configuration,\n });\n return { model: selected.model, effort: selected.reasoningEffort };\n }\n async screen(findings: readonly Finding[]): Promise<ScreeningResult> {\n return await this.runner.run({\n stage: \"screening\",\n findingIds: findings.map((finding) => finding.findingId),\n ...this.settings(\"gpt-5.6-luna\", \"xhigh\"),\n prompt: `${this.sourceContext(findings)}${screeningPrompt(findings)}`,\n schema: screeningToolSchema(findings.length - 1),\n validate: (value) => validateScreening(value, findings),\n });\n }\n}\n\n/** Rich review contract used by host-provided records consumers. */\nexport class CodexDeduplicationReviewer\n extends CodexReviewer\n implements DeduplicationReviewer\n{\n async reviewPair(findings: readonly Finding[]): Promise<DuplicateDecision> {\n return await this.runner.run({\n stage: \"pair-review\",\n findingIds: findings.map((finding) => finding.findingId),\n ...this.settings(\"gpt-5.6-sol\", \"high\"),\n prompt: pairReviewPrompt(findings),\n schema: {\n type: \"object\",\n ...z.toJSONSchema(reviewSchema, { target: \"openapi-3.0\" }),\n },\n validate: (value) => validateReview(value, findings),\n });\n }\n}\n\n/** Saved-scan grouping stores original records and needs only a pair decision. */\nexport class CodexGroupingReviewer\n extends CodexReviewer\n implements DeduplicationReviewer\n{\n async reviewPair(findings: readonly Finding[]): Promise<GroupingDecision> {\n return await this.runner.run({\n stage: \"pair-review\",\n findingIds: findings.map((finding) => finding.findingId),\n ...this.settings(\"gpt-5.6-sol\", \"high\"),\n prompt: `${this.sourceContext(findings)}${groupingReviewPrompt(findings)}`,\n schema: {\n type: \"object\",\n ...z.toJSONSchema(screeningDecisionSchema, { target: \"openapi-3.0\" }),\n },\n validate: (value) => screeningDecisionSchema.parse(value),\n });\n }\n}\n"]}
|
|
1
|
+
{"version":3,"file":"deduplication-reviewer.js","sourceRoot":"","sources":["../../src/deduplication/deduplication-reviewer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EACL,cAAc,EACd,sBAAsB,GAEvB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,eAAe,GAChB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,sBAAsB,EAAmB,MAAM,cAAc,CAAC;AAEvE,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACxE,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1B,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IAC3B,SAAS;IACT,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE;IAC9B,aAAa,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;CACjD,CAAC,CAAC;AACH,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;IAC/B,SAAS;IACT,kBAAkB,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE;IACvC,aAAa,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE;CACnC,CAAC,CAAC;AACH,MAAM,YAAY,GAAG,CAAC,CAAC,kBAAkB,CAAC,UAAU,EAAE;IACpD,UAAU;IACV,cAAc;CACf,CAAC,CAAC;AACH,MAAM,uBAAuB,GAAG,CAAC,CAAC,kBAAkB,CAAC,UAAU,EAAE;IAC/D,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;IAC7D,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;CAClE,CAAC,CAAC;AACH,2EAA2E;AAC3E,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,uBAAuB,CAAC;CACzD,CAAC,CAAC;AAWH,MAAM,UAAU,OAAO,CAAC,GAAsB;IAC5C,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,OAAO,QAAQ,KAAK,GAAG,CAAC,EAAE,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,KAAc,EACd,QAAgD,EAChD,WAAiC;IAEjC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM;QAAE,OAAO,MAAM,CAAC;IAC9C,MAAM,OAAO,GAAG,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,kBAAkB,CAAC;QACzD,CAAC,CAAC,sBAAsB,CAAC,MAAM,CAAC,aAAa,CAAC;QAC9C,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IACzC,IAAI,OAAO,CAAC,SAAS,KAAK,MAAM,CAAC,kBAAkB;QACjD,MAAM,IAAI,KAAK,CACb,gEAAgE,CACjE,CAAC;IACJ,IACE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,KAAK,MAAM,CAAC,kBAAkB,CAAC,EAC5E,CAAC;QACD,MAAM,IAAI,KAAK,CACb,6DAA6D,CAC9D,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAAc,EACd,QAA4B;IAE5B,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,QAAQ;SACtB,KAAK,CAAC,CAAC,CAAC;SACR,GAAG,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChD,IACE,SAAS,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;QACpC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,EAC/D,CAAC;QACD,MAAM,IAAI,KAAK,CACb,qDAAqD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC5E,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,mBAAmB,CAAC,aAAqB;IAChD,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACvD,iBAAiB,CAAC,KAAK,CAAC;QACxB,uBAAuB;KACxB,CAAC,CACH,CAAC;IACF,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;QAC1E,MAAM,EAAE,aAAa;QACrB,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE;YAC3B,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ;gBAAE,UAAU,CAAC,QAAQ,KAAK,EAAE,CAAC;QAC/D,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAED,MAAM,aAAa;IAEI,MAAM;IACR,aAAa;IACX,aAAa;IAHlC,YACqB,MAAsC,EACxC,aAAa,GAAe,EAAE,EAC5B,aAAa,GAAuC,GAAG,EAAE,CAC1E,EAAE;sBAHe,MAAM;6BACR,aAAa;6BACX,aAAa;IAE/B,CAAC;IAEM,QAAQ,CAAC,KAAa,EAAE,MAAc;QAC9C,MAAM,QAAQ,GAAG,sBAAsB,CAAC;YACtC,KAAK;YACL,sBAAsB,EAAE,MAAM;YAC9B,GAAG,IAAI,CAAC,aAAa;SACtB,CAAC,CAAC;QACH,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,eAAe,EAAE,CAAC;IACrE,CAAC;IACD,KAAK,CAAC,MAAM,CAAC,QAAsB;QACjC,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC3B,KAAK,EAAE,WAAW;YAClB,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC;YACxD,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;YACzC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,eAAe,CAAC,QAAQ,CAAC,EAAE;YACrE,MAAM,EAAE,mBAAmB,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAChD,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC;SACxD,CAAC,CAAC;IACL,CAAC;CACF;AAED,oEAAoE;AACpE,MAAM,OAAO,0BACX,SAAQ,aAAwC;IAM7B,WAAW;IAH9B,YACE,MAAsC,EACtC,aAAa,GAAe,EAAE,EACb,WAAiC;QAElD,KAAK,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;2BAFZ,WAAW;IAG9B,CAAC;IAED,KAAK,CAAC,UAAU,CACd,QAAgD;QAEhD,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC3B,KAAK,EAAE,aAAa;YACpB,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC;YACxD,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;YACvC,MAAM,EAAE,gBAAgB,CAAC,QAAQ,CAAC;YAClC,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,GAAG,CAAC,CAAC,YAAY,CAAC,YAAY,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;aAC3D;YACD,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC;SACvE,CAAC,CAAC;IACL,CAAC;CACF;AAED,kFAAkF;AAClF,MAAM,OAAO,qBACX,SAAQ,aAAa;IAGrB,KAAK,CAAC,UAAU,CAAC,QAA4B;QAC3C,OAAO,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC3B,KAAK,EAAE,aAAa;YACpB,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC;YACxD,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,oBAAoB,CAAC,QAAQ,CAAC,EAAE;YAC1E,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,GAAG,CAAC,CAAC,YAAY,CAAC,uBAAuB,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;aACtE;YACD,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,uBAAuB,CAAC,KAAK,CAAC,KAAK,CAAC;SAC1D,CAAC,CAAC;IACL,CAAC;CACF","sourcesContent":["import { z } from \"zod\";\nimport {\n requireFinding,\n requireImportedFinding,\n type ImportedFinding,\n} from \"./finding-schema.js\";\nimport type { Finding } from \"../models.js\";\nimport type { CodexReviewRunner } from \"./codex-review.js\";\nimport {\n pairReviewPrompt,\n groupingReviewPrompt,\n screeningPrompt,\n} from \"./deduplication-prompts.js\";\nimport { scanModelConfiguration, type JsonObject } from \"../config.js\";\n\nconst rationale = z.string().refine((value) => value.trim().length > 0);\nconst sameSchema = z.object({\n decision: z.literal(\"SAME\"),\n rationale,\n canonicalFindingId: z.string(),\n mergedFinding: z.record(z.string(), z.unknown()),\n});\nconst distinctSchema = z.object({\n decision: z.literal(\"DISTINCT\"),\n rationale,\n canonicalFindingId: z.null().optional(),\n mergedFinding: z.null().optional(),\n});\nconst reviewSchema = z.discriminatedUnion(\"decision\", [\n sameSchema,\n distinctSchema,\n]);\nconst screeningDecisionSchema = z.discriminatedUnion(\"decision\", [\n sameSchema.pick({ decision: true, rationale: true }).strict(),\n distinctSchema.pick({ decision: true, rationale: true }).strict(),\n]);\n// The host assigns exact slot names; finding IDs stay out of model output.\nconst screeningSchema = z.strictObject({\n decisions: z.record(z.string(), screeningDecisionSchema),\n});\n\nexport type ScreeningResult = z.infer<typeof screeningSchema>;\nexport type DuplicateDecision = z.infer<typeof reviewSchema>;\nexport type GroupingDecision = z.infer<typeof screeningDecisionSchema>;\n\nexport interface DeduplicationReviewer<T = Finding> {\n screen(findings: readonly T[]): Promise<ScreeningResult>;\n reviewPair(findings: readonly T[]): Promise<GroupingDecision>;\n}\n\nexport function pairKey(ids: readonly string[]): string {\n return JSON.stringify([...ids].sort());\n}\n\nexport function screeningPairSlot(index: number): string {\n return `pair-${index + 1}`;\n}\n\nexport function validateReview(\n value: unknown,\n findings: readonly (Finding | ImportedFinding)[],\n importedIds?: ReadonlySet<string>,\n): DuplicateDecision {\n const result = reviewSchema.parse(value);\n if (result.decision !== \"SAME\") return result;\n const finding = importedIds?.has(result.canonicalFindingId)\n ? requireImportedFinding(result.mergedFinding)\n : requireFinding(result.mergedFinding);\n if (finding.findingId !== result.canonicalFindingId)\n throw new Error(\n \"Every SAME decision requires the canonical finding's identity.\",\n );\n if (\n !findings.some((finding) => finding.findingId === result.canonicalFindingId)\n ) {\n throw new Error(\n \"The canonical finding must belong to the assigned findings.\",\n );\n }\n return result;\n}\n\nexport function validateScreening(\n value: unknown,\n findings: readonly unknown[],\n): ScreeningResult {\n const result = screeningSchema.parse(value);\n const required = findings\n .slice(1)\n .map((_finding, index) => screeningPairSlot(index));\n const submitted = Object.keys(result.decisions);\n if (\n submitted.length !== required.length ||\n required.some((slot) => !Object.hasOwn(result.decisions, slot))\n ) {\n throw new Error(\n `Submit exactly the assigned screening pair slots: ${required.join(\", \")}.`,\n );\n }\n return result;\n}\n\nfunction screeningToolSchema(neighborCount: number): object {\n const slots = Object.fromEntries(\n Array.from({ length: neighborCount }, (_value, index) => [\n screeningPairSlot(index),\n screeningDecisionSchema,\n ]),\n );\n return z.toJSONSchema(z.strictObject({ decisions: z.strictObject(slots) }), {\n target: \"openapi-3.0\",\n override: ({ jsonSchema }) => {\n if (jsonSchema.type === \"object\") jsonSchema.required ??= [];\n },\n });\n}\n\nclass CodexReviewer<T extends Pick<Finding, \"findingId\"> = Finding> {\n constructor(\n protected readonly runner: Pick<CodexReviewRunner, \"run\">,\n private readonly configuration: JsonObject = {},\n protected readonly sourceContext: (findings: readonly T[]) => string = () =>\n \"\",\n ) {}\n\n protected settings(model: string, effort: string) {\n const selected = scanModelConfiguration({\n model,\n model_reasoning_effort: effort,\n ...this.configuration,\n });\n return { model: selected.model, effort: selected.reasoningEffort };\n }\n async screen(findings: readonly T[]): Promise<ScreeningResult> {\n return await this.runner.run({\n stage: \"screening\",\n findingIds: findings.map((finding) => finding.findingId),\n ...this.settings(\"gpt-5.6-luna\", \"xhigh\"),\n prompt: `${this.sourceContext(findings)}${screeningPrompt(findings)}`,\n schema: screeningToolSchema(findings.length - 1),\n validate: (value) => validateScreening(value, findings),\n });\n }\n}\n\n/** Rich review contract used by host-provided records consumers. */\nexport class CodexDeduplicationReviewer\n extends CodexReviewer<Finding | ImportedFinding>\n implements DeduplicationReviewer<Finding | ImportedFinding>\n{\n constructor(\n runner: Pick<CodexReviewRunner, \"run\">,\n configuration: JsonObject = {},\n private readonly importedIds?: ReadonlySet<string>,\n ) {\n super(runner, configuration);\n }\n\n async reviewPair(\n findings: readonly (Finding | ImportedFinding)[],\n ): Promise<DuplicateDecision> {\n return await this.runner.run({\n stage: \"pair-review\",\n findingIds: findings.map((finding) => finding.findingId),\n ...this.settings(\"gpt-5.6-sol\", \"high\"),\n prompt: pairReviewPrompt(findings),\n schema: {\n type: \"object\",\n ...z.toJSONSchema(reviewSchema, { target: \"openapi-3.0\" }),\n },\n validate: (value) => validateReview(value, findings, this.importedIds),\n });\n }\n}\n\n/** Saved-scan grouping stores original records and needs only a pair decision. */\nexport class CodexGroupingReviewer\n extends CodexReviewer\n implements DeduplicationReviewer\n{\n async reviewPair(findings: readonly Finding[]): Promise<GroupingDecision> {\n return await this.runner.run({\n stage: \"pair-review\",\n findingIds: findings.map((finding) => finding.findingId),\n ...this.settings(\"gpt-5.6-sol\", \"high\"),\n prompt: `${this.sourceContext(findings)}${groupingReviewPrompt(findings)}`,\n schema: {\n type: \"object\",\n ...z.toJSONSchema(screeningDecisionSchema, { target: \"openapi-3.0\" }),\n },\n validate: (value) => screeningDecisionSchema.parse(value),\n });\n }\n}\n"]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"deduplication.js","sourceRoot":"","sources":["../../src/deduplication/deduplication.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAG5D,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;AAyBD,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,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,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QACrC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;QACvC,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QACxE,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC1E,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QACrC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;QACvC,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACpE,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACtE,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC9B,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;QACxC,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,IAAI,QAA+C,CAAC;QACpD,IAAI,aAA4C,CAAC;QACjD,KAAK,MAAM,WAAW,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClE,IACE,WAAW,IAAI,YAAY;oBAC3B,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,EAAE,CAAC;oBAChC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAC3B,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,KAAK,KAAK,aAAc,CAAC,QAAQ,CAAC,CACxD,CAAC;oBACF,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAE,GAAG,aAAa,CAAC,KAAK,CAAE,CAAC,EAAE,CAAC;wBAC7D,SAAS;oBACX,CAAC;gBACH,CAAC;gBACD,QAAQ,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;gBACvC,aAAa,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YACxB,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACtE,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;QAE9B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;QAC9C,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAE,EAAE,CAAC;YACjE,IAAI,QAAQ,KAAK,WAAW,IAAI,QAAQ,KAAK,YAAY;gBAAE,SAAS;YACpE,MAAM,MAAM,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC;YAC9D,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAClC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE7B,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACxE,KAAK,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE;YAAE,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5E,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACpC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjE,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;QAC5C,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,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,oEAAoE;QACpE,MAAM,aAAa,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE;YACxD,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,OAAO,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChD,CAAC,CAAC,CAAC;QACH,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAChC,MAAM,eAAe,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,MAAM,cAAc,GAAG,GAAG,CAAC,OAAO,CAChC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,EAC9D,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CACvB,CAAC;QAEF,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,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE,CAAC;YACrD,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,aAAc,CAAC,CAAC;YACrD,MAAM,MAAM,GACV,SAAS,KAAK,SAAS;gBACrB,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;gBACpB,CAAC,CAAC,0BAA0B,CACxB,OAAO,EACP,eAAe,CAAC,GAAG,CAAC,aAAc,CAAE,EACpC,SAAS,EACT,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,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBACzD,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAC9D,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 { SCAN_SEVERITIES } from \"../scan-settings.js\";\nimport { findingGroupRoots } from \"../finding-catalogue.js\";\nimport 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\n/** @internal */\nexport interface ContradictionGroupingMetrics {\n candidateEvaluations: number;\n conflictNeighborChecks: number;\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 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 const leftIndex = indexes.get(left)!;\n const rightIndex = indexes.get(right)!;\n const leftSupport = support.get(leftIndex) ?? new Map<number, number>();\n const rightSupport = support.get(rightIndex) ?? new Map<number, number>();\n leftSupport.set(rightIndex, (leftSupport.get(rightIndex) ?? 0) + 1);\n rightSupport.set(leftIndex, (rightSupport.get(leftIndex) ?? 0) + 1);\n support.set(leftIndex, leftSupport);\n support.set(rightIndex, rightSupport);\n }\n const conflicts = new Map<number, Set<number>>();\n for (const [left, right] of distinctPairs) {\n const leftIndex = indexes.get(left)!;\n const rightIndex = indexes.get(right)!;\n const leftConflicts = conflicts.get(leftIndex) ?? new Set<number>();\n const rightConflicts = conflicts.get(rightIndex) ?? new Set<number>();\n leftConflicts.add(rightIndex);\n rightConflicts.add(leftIndex);\n conflicts.set(leftIndex, leftConflicts);\n conflicts.set(rightIndex, rightConflicts);\n }\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 clusters.keys()) {\n for (const [rightCluster, gain] of support.get(leftCluster) ?? []) {\n if (\n leftCluster >= 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) {\n const index = score.findIndex(\n (value, position) => value !== selectedScore![position],\n );\n if (index === -1 || !(score[index]! > selectedScore[index]!)) {\n continue;\n }\n }\n selected = [leftCluster, rightCluster];\n selectedScore = score;\n }\n }\n if (selected === undefined)\n return [...clusters.values()].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\n const leftSupport = support.get(leftCluster)!;\n leftSupport.delete(rightCluster);\n for (const [neighbor, rightWeight] of support.get(rightCluster)!) {\n if (neighbor === leftCluster || neighbor === rightCluster) continue;\n const weight = (leftSupport.get(neighbor) ?? 0) + rightWeight;\n leftSupport.set(neighbor, weight);\n support.get(neighbor)!.set(leftCluster, weight).delete(rightCluster);\n }\n support.delete(rightCluster);\n\n const mergedConflicts = conflicts.get(leftCluster) ?? new Set<number>();\n for (const id of conflicts.get(rightCluster) ?? []) mergedConflicts.add(id);\n mergedConflicts.delete(leftCluster);\n mergedConflicts.delete(rightCluster);\n for (const neighbor of mergedConflicts) {\n conflicts.get(neighbor)!.add(leftCluster).delete(rightCluster);\n }\n conflicts.set(leftCluster, mergedConflicts);\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 { parents, root } = findingGroupRoots();\n for (const [left, right] of supported) parents.set(root(right), root(left));\n // Preserve finding insertion order for contradiction-grouping ties.\n const membersByRoot = Map.groupBy(findings.keys(), (id) => {\n this.signal?.throwIfAborted();\n return parents.has(id) ? root(id) : undefined;\n });\n membersByRoot.delete(undefined);\n const supportedByRoot = Map.groupBy(supported, ([left]) => root(left));\n const rejectedByRoot = Map.groupBy(\n rejected.filter(([left, right]) => root(left) === root(right)),\n ([left]) => root(left),\n );\n\n const selected = new Set(ids);\n const duplicateGroups: string[][] = [];\n const canonical = new Map<string, string>();\n for (const [componentRoot, members] of membersByRoot) {\n this.signal?.throwIfAborted();\n const conflicts = rejectedByRoot.get(componentRoot!);\n const groups =\n conflicts === undefined\n ? [new Set(members)]\n : contradictionFreeSubgroups(\n members,\n supportedByRoot.get(componentRoot!)!,\n conflicts,\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 SCAN_SEVERITIES.indexOf(findings.get(left)!.severity.level) -\n SCAN_SEVERITIES.indexOf(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"]}
|
|
1
|
+
{"version":3,"file":"deduplication.js","sourceRoot":"","sources":["../../src/deduplication/deduplication.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAG5D,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;AAyBD,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,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,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QACrC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;QACvC,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QACxE,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC1E,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QACrC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;QACvC,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACpE,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACtE,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC9B,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;QACxC,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,IAAI,QAA+C,CAAC;QACpD,IAAI,aAA4C,CAAC;QACjD,KAAK,MAAM,WAAW,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClE,IACE,WAAW,IAAI,YAAY;oBAC3B,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,EAAE,CAAC;oBAChC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAC3B,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,KAAK,KAAK,aAAc,CAAC,QAAQ,CAAC,CACxD,CAAC;oBACF,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAE,GAAG,aAAa,CAAC,KAAK,CAAE,CAAC,EAAE,CAAC;wBAC7D,SAAS;oBACX,CAAC;gBACH,CAAC;gBACD,QAAQ,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;gBACvC,aAAa,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YACxB,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACtE,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;QAE9B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;QAC9C,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAE,EAAE,CAAC;YACjE,IAAI,QAAQ,KAAK,WAAW,IAAI,QAAQ,KAAK,YAAY;gBAAE,SAAS;YACpE,MAAM,MAAM,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC;YAC9D,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAClC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE7B,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACxE,KAAK,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE;YAAE,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5E,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACpC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjE,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;QAC5C,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED,gBAAgB;AAChB,MAAM,OAAO,mBAAmB;IAIX,UAAU;IAGV,QAAQ;IACR,MAAM;IACN,WAAW;IAN9B,YACmB,UAEhB,EACgB,QAAkC,EAClC,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,EAAa,CAAC;QACtC,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,CAAM,GAAG,CAAC,MAAM,CAAC,CAAC;QACjD,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,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,oEAAoE;QACpE,MAAM,aAAa,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE;YACxD,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,OAAO,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChD,CAAC,CAAC,CAAC;QACH,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAChC,MAAM,eAAe,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,MAAM,cAAc,GAAG,GAAG,CAAC,OAAO,CAChC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,EAC9D,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CACvB,CAAC;QAEF,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,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE,CAAC;YACrD,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,aAAc,CAAC,CAAC;YACrD,MAAM,MAAM,GACV,SAAS,KAAK,SAAS;gBACrB,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;gBACpB,CAAC,CAAC,0BAA0B,CACxB,OAAO,EACP,eAAe,CAAC,GAAG,CAAC,aAAc,CAAE,EACpC,SAAS,EACT,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,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBACzD,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAC9D,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 { SCAN_SEVERITIES } from \"../scan-settings.js\";\nimport { findingGroupRoots } from \"../finding-catalogue.js\";\nimport 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\n/** @internal */\nexport interface ContradictionGroupingMetrics {\n candidateEvaluations: number;\n conflictNeighborChecks: number;\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 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 const leftIndex = indexes.get(left)!;\n const rightIndex = indexes.get(right)!;\n const leftSupport = support.get(leftIndex) ?? new Map<number, number>();\n const rightSupport = support.get(rightIndex) ?? new Map<number, number>();\n leftSupport.set(rightIndex, (leftSupport.get(rightIndex) ?? 0) + 1);\n rightSupport.set(leftIndex, (rightSupport.get(leftIndex) ?? 0) + 1);\n support.set(leftIndex, leftSupport);\n support.set(rightIndex, rightSupport);\n }\n const conflicts = new Map<number, Set<number>>();\n for (const [left, right] of distinctPairs) {\n const leftIndex = indexes.get(left)!;\n const rightIndex = indexes.get(right)!;\n const leftConflicts = conflicts.get(leftIndex) ?? new Set<number>();\n const rightConflicts = conflicts.get(rightIndex) ?? new Set<number>();\n leftConflicts.add(rightIndex);\n rightConflicts.add(leftIndex);\n conflicts.set(leftIndex, leftConflicts);\n conflicts.set(rightIndex, rightConflicts);\n }\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 clusters.keys()) {\n for (const [rightCluster, gain] of support.get(leftCluster) ?? []) {\n if (\n leftCluster >= 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) {\n const index = score.findIndex(\n (value, position) => value !== selectedScore![position],\n );\n if (index === -1 || !(score[index]! > selectedScore[index]!)) {\n continue;\n }\n }\n selected = [leftCluster, rightCluster];\n selectedScore = score;\n }\n }\n if (selected === undefined)\n return [...clusters.values()].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\n const leftSupport = support.get(leftCluster)!;\n leftSupport.delete(rightCluster);\n for (const [neighbor, rightWeight] of support.get(rightCluster)!) {\n if (neighbor === leftCluster || neighbor === rightCluster) continue;\n const weight = (leftSupport.get(neighbor) ?? 0) + rightWeight;\n leftSupport.set(neighbor, weight);\n support.get(neighbor)!.set(leftCluster, weight).delete(rightCluster);\n }\n support.delete(rightCluster);\n\n const mergedConflicts = conflicts.get(leftCluster) ?? new Set<number>();\n for (const id of conflicts.get(rightCluster) ?? []) mergedConflicts.add(id);\n mergedConflicts.delete(leftCluster);\n mergedConflicts.delete(rightCluster);\n for (const neighbor of mergedConflicts) {\n conflicts.get(neighbor)!.add(leftCluster).delete(rightCluster);\n }\n conflicts.set(leftCluster, mergedConflicts);\n conflicts.delete(rightCluster);\n }\n}\n\n/** @internal */\nexport class FindingDeduplicator<\n T extends Pick<Finding, \"findingId\" | \"severity\"> = Finding,\n> {\n constructor(\n private readonly candidates: {\n potentialDuplicates(findingId: string): Promise<FindingNeighborhood<T>>;\n },\n private readonly reviewer: DeduplicationReviewer<T>,\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, T>();\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<T[]>(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 { parents, root } = findingGroupRoots();\n for (const [left, right] of supported) parents.set(root(right), root(left));\n // Preserve finding insertion order for contradiction-grouping ties.\n const membersByRoot = Map.groupBy(findings.keys(), (id) => {\n this.signal?.throwIfAborted();\n return parents.has(id) ? root(id) : undefined;\n });\n membersByRoot.delete(undefined);\n const supportedByRoot = Map.groupBy(supported, ([left]) => root(left));\n const rejectedByRoot = Map.groupBy(\n rejected.filter(([left, right]) => root(left) === root(right)),\n ([left]) => root(left),\n );\n\n const selected = new Set(ids);\n const duplicateGroups: string[][] = [];\n const canonical = new Map<string, string>();\n for (const [componentRoot, members] of membersByRoot) {\n this.signal?.throwIfAborted();\n const conflicts = rejectedByRoot.get(componentRoot!);\n const groups =\n conflicts === undefined\n ? [new Set(members)]\n : contradictionFreeSubgroups(\n members,\n supportedByRoot.get(componentRoot!)!,\n conflicts,\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 SCAN_SEVERITIES.indexOf(findings.get(left)!.severity.level) -\n SCAN_SEVERITIES.indexOf(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"]}
|
|
@@ -1,4 +1,22 @@
|
|
|
1
1
|
import type { Finding } from "../models.js";
|
|
2
|
-
|
|
2
|
+
type FindingSchema = {
|
|
3
|
+
type: string;
|
|
4
|
+
properties: Record<string, object> & {
|
|
5
|
+
locations: object;
|
|
6
|
+
};
|
|
7
|
+
required: string[];
|
|
8
|
+
$defs: Record<string, object>;
|
|
9
|
+
};
|
|
10
|
+
declare const scannerFields: readonly ["ruleId", "identity", "taxonomy", "remediation"];
|
|
11
|
+
type ScannerField = (typeof scannerFields)[number];
|
|
12
|
+
export type ImportedFinding = Pick<Finding, "findingId" | "occurrenceId" | "fingerprints" | "title" | "summary" | "severity" | "confidence" | "provenance"> & Partial<Pick<Finding, ScannerField>> & {
|
|
13
|
+
locations: Finding["locations"][number][];
|
|
14
|
+
[extension: string]: unknown;
|
|
15
|
+
};
|
|
16
|
+
export declare function findingSchema(): FindingSchema;
|
|
3
17
|
export declare function requireFinding(value: unknown): Finding;
|
|
18
|
+
/** Imports retain their source evidence even when no scanner classified or located it. */
|
|
19
|
+
export declare function importedFindingSchema(): FindingSchema;
|
|
20
|
+
export declare function requireImportedFinding(value: unknown): ImportedFinding;
|
|
21
|
+
export {};
|
|
4
22
|
//# sourceMappingURL=finding-schema.d.ts.map
|
|
@@ -1 +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;
|
|
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;AAE5C,KAAK,aAAa,GAAG;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG;QAAE,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3D,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/B,CAAC;AAEF,QAAA,MAAM,aAAa,YACjB,QAAQ,EACR,UAAU,EACV,UAAU,EACV,aAAa,CACL,CAAC;AACX,KAAK,YAAY,GAAG,CAAC,OAAO,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC;AACnD,MAAM,MAAM,eAAe,GAAG,IAAI,CAChC,OAAO,EACL,WAAW,GACX,cAAc,GACd,cAAc,GACd,OAAO,GACP,SAAS,GACT,UAAU,GACV,YAAY,GACZ,YAAY,CACf,GACC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,GAAG;IACrC,SAAS,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IAC1C,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;CAC9B,CAAC;AAMJ,wBAAgB,aAAa,IAAI,aAAa,CAe7C;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAStD;AAED,0FAA0F;AAC1F,wBAAgB,qBAAqB,IAAI,aAAa,CAYrD;AAED,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,OAAO,GAAG,eAAe,CAStE"}
|
|
@@ -1,6 +1,13 @@
|
|
|
1
1
|
import { readFileSync } from "node:fs";
|
|
2
2
|
import Ajv2020 from "ajv/dist/2020.js";
|
|
3
|
+
const scannerFields = [
|
|
4
|
+
"ruleId",
|
|
5
|
+
"identity",
|
|
6
|
+
"taxonomy",
|
|
7
|
+
"remediation",
|
|
8
|
+
];
|
|
3
9
|
let schema;
|
|
10
|
+
let importedValidator;
|
|
4
11
|
let validator;
|
|
5
12
|
export function findingSchema() {
|
|
6
13
|
if (schema)
|
|
@@ -17,4 +24,22 @@ export function requireFinding(value) {
|
|
|
17
24
|
throw new Error("Record must satisfy the Finding schema, including provenance.");
|
|
18
25
|
return value;
|
|
19
26
|
}
|
|
27
|
+
/** Imports retain their source evidence even when no scanner classified or located it. */
|
|
28
|
+
export function importedFindingSchema() {
|
|
29
|
+
const native = findingSchema();
|
|
30
|
+
return {
|
|
31
|
+
...native,
|
|
32
|
+
required: native.required.filter((name) => !scannerFields.some((field) => field === name)),
|
|
33
|
+
properties: {
|
|
34
|
+
...native.properties,
|
|
35
|
+
locations: { ...native.properties.locations, minItems: 0 },
|
|
36
|
+
},
|
|
37
|
+
};
|
|
38
|
+
}
|
|
39
|
+
export function requireImportedFinding(value) {
|
|
40
|
+
importedValidator ??= new Ajv2020({ strict: false }).compile(importedFindingSchema());
|
|
41
|
+
if (!importedValidator(value))
|
|
42
|
+
throw new Error("Record must satisfy the imported finding schema, including source provenance.");
|
|
43
|
+
return value;
|
|
44
|
+
}
|
|
20
45
|
//# sourceMappingURL=finding-schema.js.map
|
|
@@ -1 +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;
|
|
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;AAUlE,MAAM,aAAa,GAAG;IACpB,QAAQ;IACR,UAAU;IACV,UAAU;IACV,aAAa;CACL,CAAC;AAkBX,IAAI,MAAiC,CAAC;AACtC,IAAI,iBAAgE,CAAC;AACrE,IAAI,SAAgD,CAAC;AAErD,MAAM,UAAU,aAAa;IAC3B,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CACzB,YAAY,CACV,IAAI,GAAG,CACL,oDAAoD,EACpD,OAAO,IAAI,CAAC,GAAG,CAChB,EACD,MAAM,CACP,CACF,CAAC;IACF,OAAO,CAAC,MAAM,GAAG;QACf,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK;QACrC,KAAK,EAAE,QAAQ,CAAC,KAAK;KACtB,CAAC,CAAC;AACL,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;AAED,0FAA0F;AAC1F,MAAM,UAAU,qBAAqB;IACnC,MAAM,MAAM,GAAG,aAAa,EAAE,CAAC;IAC/B,OAAO;QACL,GAAG,MAAM;QACT,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAC9B,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CACzD;QACD,UAAU,EAAE;YACV,GAAG,MAAM,CAAC,UAAU;YACpB,SAAS,EAAE,EAAE,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC,EAAE;SAC3D;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,KAAc;IACnD,iBAAiB,KAAK,IAAI,OAAO,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAC1D,qBAAqB,EAAE,CACxB,CAAC;IACF,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC;QAC3B,MAAM,IAAI,KAAK,CACb,+EAA+E,CAChF,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\ntype FindingSchema = {\n type: string;\n properties: Record<string, object> & { locations: object };\n required: string[];\n $defs: Record<string, object>;\n};\n\nconst scannerFields = [\n \"ruleId\",\n \"identity\",\n \"taxonomy\",\n \"remediation\",\n] as const;\ntype ScannerField = (typeof scannerFields)[number];\nexport type ImportedFinding = Pick<\n Finding,\n | \"findingId\"\n | \"occurrenceId\"\n | \"fingerprints\"\n | \"title\"\n | \"summary\"\n | \"severity\"\n | \"confidence\"\n | \"provenance\"\n> &\n Partial<Pick<Finding, ScannerField>> & {\n locations: Finding[\"locations\"][number][];\n [extension: string]: unknown;\n };\n\nlet schema: FindingSchema | undefined;\nlet importedValidator: ValidateFunction<ImportedFinding> | undefined;\nlet validator: ValidateFunction<Finding> | undefined;\n\nexport function findingSchema(): FindingSchema {\n if (schema) return schema;\n const document = JSON.parse(\n readFileSync(\n new URL(\n \"../../_bundled_plugin/schemas/findings.schema.json\",\n import.meta.url,\n ),\n \"utf8\",\n ),\n );\n return (schema = {\n ...document.properties.findings.items,\n $defs: document.$defs,\n });\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\n/** Imports retain their source evidence even when no scanner classified or located it. */\nexport function importedFindingSchema(): FindingSchema {\n const native = findingSchema();\n return {\n ...native,\n required: native.required.filter(\n (name) => !scannerFields.some((field) => field === name),\n ),\n properties: {\n ...native.properties,\n locations: { ...native.properties.locations, minItems: 0 },\n },\n };\n}\n\nexport function requireImportedFinding(value: unknown): ImportedFinding {\n importedValidator ??= new Ajv2020({ strict: false }).compile<ImportedFinding>(\n importedFindingSchema(),\n );\n if (!importedValidator(value))\n throw new Error(\n \"Record must satisfy the imported finding schema, including source provenance.\",\n );\n return value;\n}\n"]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"local.d.ts","sourceRoot":"","sources":["../../src/deduplication/local.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,KAAK,EACV,mBAAmB,EACnB,kBAAkB,EACnB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAGL,YAAY,EAEb,MAAM,eAAe,CAAC;AACvB,OAAO,EAKL,KAAK,eAAe,EACrB,MAAM,yBAAyB,CAAC;AAMjC,qEAAqE;AACrE,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC;IACnC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,2FAA2F;IAC3F,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CACjC;AAED,2EAA2E;AAC3E,qBAAa,kBAAkB;IAO3B,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,cAAc;IAC/B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IACxB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAV5B,OAAO,CAAC,OAAO,CAAC,
|
|
1
|
+
{"version":3,"file":"local.d.ts","sourceRoot":"","sources":["../../src/deduplication/local.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,KAAK,EACV,mBAAmB,EACnB,kBAAkB,EACnB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAGL,YAAY,EAEb,MAAM,eAAe,CAAC;AACvB,OAAO,EAKL,KAAK,eAAe,EACrB,MAAM,yBAAyB,CAAC;AAMjC,qEAAqE;AACrE,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC;IACnC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,2FAA2F;IAC3F,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CACjC;AAED,2EAA2E;AAC3E,qBAAa,kBAAkB;IAO3B,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,cAAc;IAC/B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IACxB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAV5B,OAAO,CAAC,OAAO,CAAC,CAAmD;IACnE,OAAO,CAAC,SAAS,CAA8B;IAC/C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA0B;IAEpD,YACmB,WAAW,EAAE,MAAM,CAAC,UAAU,EAC9B,KAAK,EAAE,kBAAkB,EACzB,cAAc,EAAE,MAAM,EACtB,MAAM,CAAC,EAAE,WAAW,YAAA,EACpB,SAAS,GAAE,OAAO,YAA2B,EAC9D,SAAS,CAAC,EAAE,uBAAuB,EA0BpC;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;IAEK,OAAO,CACX,QAAQ,EAAE,SAAS,OAAO,EAAE,EAC5B,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,IAAI,CAAC,CAqCf;IAEK,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAMzE;IAEK,iBAAiB,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAElE;YAEa,OAAO;CAoDtB"}
|
|
@@ -2,7 +2,7 @@ import { environmentEntry } from "../auth.js";
|
|
|
2
2
|
import { abortable, gitProtectionRoots } from "../targets.js";
|
|
3
3
|
import { CodexSecurityError } from "../errors.js";
|
|
4
4
|
import { workflowDigest } from "../finding-workflow.js";
|
|
5
|
-
import {
|
|
5
|
+
import { bundledPluginRoot, workbenchEnvironment, runWorkbench, } from "../runtime.js";
|
|
6
6
|
import { OpenAiFindingEmbedder, EMBEDDING_MODEL, EMBEDDING_DIMENSIONS, EMBEDDINGS_URL, } from "../server/embeddings.js";
|
|
7
7
|
import { retryDelay, waitForRetry } from "./retry.js";
|
|
8
8
|
// Checkpoint bounded batches so a retry keeps completed work without one process per finding.
|
|
@@ -89,14 +89,9 @@ export class LocalDeduplication {
|
|
|
89
89
|
this.signal?.throwIfAborted();
|
|
90
90
|
this.options ??= (async () => {
|
|
91
91
|
const environment = workbenchEnvironment(this.environment);
|
|
92
|
-
const [python, pluginRoot] = await resolveWorkbenchRuntime({
|
|
93
|
-
environment,
|
|
94
|
-
protectedRoot: this.repositoryPath,
|
|
95
|
-
signal: this.signal,
|
|
96
|
-
});
|
|
97
92
|
return {
|
|
98
|
-
|
|
99
|
-
|
|
93
|
+
pluginRoot: await bundledPluginRoot(),
|
|
94
|
+
stateDirectory: environment.CODEX_SECURITY_STATE_DIR,
|
|
100
95
|
environment,
|
|
101
96
|
signal: this.signal,
|
|
102
97
|
protectedRoot: [
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"local.js","sourceRoot":"","sources":["../../src/deduplication/local.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAM9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EACL,uBAAuB,EACvB,oBAAoB,EACpB,YAAY,GAEb,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,qBAAqB,EACrB,eAAe,EACf,oBAAoB,EACpB,cAAc,GAEf,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAEtD,8FAA8F;AAC9F,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAWhC,2EAA2E;AAC3E,MAAM,OAAO,kBAAkB;IAOV,WAAW;IACX,KAAK;IACL,cAAc;IACd,MAAM;IACN,SAAS;IAVpB,OAAO,CAAoC;IAC3C,SAAS,GAA2B,EAAE,CAAC;IAC9B,KAAK,CAAS;IACd,SAAS,CAA0B;IAEpD,YACmB,WAA8B,EAC9B,KAAyB,EACzB,cAAsB,EACtB,MAAoB,EACpB,SAAS,GAAwB,YAAY,EAC9D,SAAmC;2BALlB,WAAW;qBACX,KAAK;8BACL,cAAc;sBACd,MAAM;yBACN,SAAS;QAG1B,MAAM,QAAQ,GACZ,gBAAgB,CAAC,WAAW,EAAE,+BAA+B,CAAC;YAC9D,cAAc,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI;YAC5B,KAAK,EAAE,eAAe;YACtB,UAAU,EAAE,oBAAoB;YAChC,cAAc,EAAE,QAAQ;YACxB,QAAQ,EAAE,IAAI,qBAAqB,CACjC;gBACE,gBAAgB,CAAC,WAAW,EAAE,gBAAgB,CAAC;gBAC/C,gBAAgB,CAAC,WAAW,EAAE,eAAe,CAAC;aAC/C,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAChC,gBAAgB,EAChB,QAAQ,EACR,MAAM,CACP;SACF,CAAC;QACF,2EAA2E;QAC3E,IAAI,CAAC,KAAK,GAAG,cAAc,CAAC;YAC1B,OAAO,EAAE,CAAC;YACV,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK;YAC3B,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU;YACrC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,cAAc;SACzC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,WAAW;QACb,OAAO,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,OAAO,CACX,QAA4B,EAC5B,YAAoB;QAEpB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC;YAChC,MAAM,EAAE,SAAS;YACjB,QAAQ;YACR,kBAAkB,EAAE,YAAY;YAChC,cAAc,EAAE,IAAI,CAAC,cAAc;SACpC,CAAC,CAAC;QACH,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,WAAW,CAA2B,CAAC;QAC/D,MAAM,eAAe,GAAG,MAAM,CAAC,iBAAiB,CAAyB,CAAC;QAC1E,KACE,IAAI,MAAM,GAAG,CAAC,EACd,MAAM,GAAG,eAAe,CAAC,MAAM,EAC/B,MAAM,IAAI,oBAAoB,EAC9B,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CACjC,MAAM,EACN,MAAM,GAAG,oBAAoB,CAC9B,CAAC;YACF,MAAM,UAAU,GAAG,MAAM,SAAS,CAAC,GAAG,EAAE;gBACtC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;gBAC9B,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC9C,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAChB,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,UAAU,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBACpC,MAAM,IAAI,kBAAkB,CAC1B,2DAA2D,CAC5D,CAAC;YACJ,MAAM,IAAI,CAAC,OAAO,CAAC;gBACjB,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;oBACtC,SAAS,EAAE,OAAO,CAAC,SAAS;oBAC5B,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC;oBAC3C,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC;iBAC7B,CAAC,CAAC;aACJ,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,SAAiB;QACzC,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC;YACzB,MAAM,EAAE,WAAW;YACnB,SAAS;YACT,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC,CAAmC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,iBAAiB,CAAC,MAA2B;QACjD,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IAC9E,CAAC;IAEO,KAAK,CAAC,OAAO,CAAC,OAAmD;QACvE,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,KAAK,CAAC,KAAK,IAAI,EAAE;YAC3B,MAAM,WAAW,GAAG,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,MAAM,uBAAuB,CAAC;gBACzD,WAAW;gBACX,aAAa,EAAE,IAAI,CAAC,cAAc;gBAClC,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC;YACH,OAAO;gBACL,MAAM;gBACN,UAAU;gBACV,WAAW;gBACX,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,aAAa,EAAE;oBACb,IAAI,CAAC,cAAc;oBACnB,GAAG,CAAC,MAAM,kBAAkB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC/D,GAAG,CAAC,MAAM,kBAAkB,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;iBAC1D;gBACD,cAAc,EAAE,4CAA4C;aAC7D,CAAC;QACJ,CAAC,CAAC,EAAE,CAAC;QACL,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,CACjC,MAAM,IAAI,CAAC,OAAO,EAClB;YACE,OAAO,CAAC,MAAM,KAAK,WAAW;gBAC5B,CAAC,CAAC,2BAA2B;gBAC7B,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,QAAQ;oBAC3B,CAAC,CAAC,qBAAqB;oBACvB,CAAC,CAAC,cAAc;SACrB,EACD,IAAI,CAAC,SAAS,CAAC;YACb,GAAG,OAAO;YACV,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK;YAC3B,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU;YACrC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe;gBAC5B,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;SAC/C,CAAC,CACH,CAAC;QACF,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,OAAO,GACX,IAAI,KAAK,iBAAiB;gBACxB,CAAC,CAAC,wFAAwF;gBAC1F,CAAC,CAAC,IAAI,KAAK,iBAAiB;oBAC1B,CAAC,CAAC,qIAAqI;oBACvI,CAAC,CAAC,IAAI,KAAK,qBAAqB;wBAC9B,CAAC,CAAC,mFAAmF;wBACrF,CAAC,CAAC,+BAA+B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;YACzD,MAAM,IAAI,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,KAAK,UAAU,gBAAgB,CAC7B,GAAW,EACX,IAAiB;IAEjB,KAAK,IAAI,OAAO,GAAG,CAAC,GAAI,OAAO,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACxC,IACE,OAAO,KAAK,CAAC;gBACb,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAEzD,OAAO,QAAQ,CAAC;YAClB,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACvD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;gBACnC,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;oBACtC,CAAC,CAAC,OAAO,GAAG,IAAI;oBAChB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACxC,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACjE,CAAC;YACD,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QACvD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,YAAY,SAAS,CAAC;gBAAE,MAAM,KAAK,CAAC;QAClE,CAAC;QACD,MAAM,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC;IACtD,CAAC;AACH,CAAC","sourcesContent":["import { environmentEntry } from \"../auth.js\";\nimport { abortable, gitProtectionRoots } from \"../targets.js\";\nimport type { Finding } from \"../models.js\";\nimport type {\n FindingNeighborhood,\n FindingSearchScope,\n} from \"../finding-retrieval.js\";\nimport { CodexSecurityError } from \"../errors.js\";\nimport { workflowDigest } from \"../finding-workflow.js\";\nimport {\n resolveWorkbenchRuntime,\n workbenchEnvironment,\n runWorkbench,\n type WorkbenchCommandOptions,\n} from \"../runtime.js\";\nimport {\n OpenAiFindingEmbedder,\n EMBEDDING_MODEL,\n EMBEDDING_DIMENSIONS,\n EMBEDDINGS_URL,\n type FindingEmbedder,\n} from \"../server/embeddings.js\";\nimport { retryDelay, waitForRetry } from \"./retry.js\";\n\n// Checkpoint bounded batches so a retry keeps completed work without one process per finding.\nconst EMBEDDING_BATCH_SIZE = 64;\n\n/** One vector space and the adapter that produces its embeddings. */\nexport interface FindingEmbeddingBinding {\n readonly embedder: FindingEmbedder;\n readonly model: string;\n readonly dimensions: number;\n /** Identifies the provider/vector space and preprocessing version; exclude credentials. */\n readonly cacheNamespace: string;\n}\n\n/** Direct workbench adapter. Importing it starts no HTTP or MCP server. */\nexport class LocalDeduplication {\n private options?: Promise<WorkbenchCommandOptions>;\n private cacheKeys: Record<string, string> = {};\n private readonly space: string;\n private readonly embedding: FindingEmbeddingBinding;\n\n constructor(\n private readonly environment: NodeJS.ProcessEnv,\n private readonly scope: FindingSearchScope,\n private readonly repositoryPath: string,\n private readonly signal?: AbortSignal,\n private readonly workbench: typeof runWorkbench = runWorkbench,\n embedding?: FindingEmbeddingBinding,\n ) {\n const endpoint =\n environmentEntry(environment, \"CODEX_SECURITY_EMBEDDINGS_URL\") ||\n EMBEDDINGS_URL;\n this.embedding = embedding ?? {\n model: EMBEDDING_MODEL,\n dimensions: EMBEDDING_DIMENSIONS,\n cacheNamespace: endpoint,\n embedder: new OpenAiFindingEmbedder(\n [\n environmentEntry(environment, \"OPENAI_API_KEY\"),\n environmentEntry(environment, \"CODEX_API_KEY\"),\n ].find((value) => value?.trim()),\n embeddingRequest,\n endpoint,\n signal,\n ),\n };\n // The digest keeps endpoint/namespace details out of persisted cache keys.\n this.space = workflowDigest({\n version: 1,\n model: this.embedding.model,\n dimensions: this.embedding.dimensions,\n namespace: this.embedding.cacheNamespace,\n });\n }\n\n get inputDigest(): string {\n return workflowDigest(this.cacheKeys);\n }\n\n async prepare(\n findings: readonly Finding[],\n repositoryId: string,\n ): Promise<void> {\n const result = await this.command({\n action: \"prepare\",\n findings,\n anchorRepositoryId: repositoryId,\n repositoryPath: this.repositoryPath,\n });\n this.cacheKeys = result[\"cacheKeys\"] as Record<string, string>;\n const findingsToEmbed = result[\"findingsToEmbed\"] as unknown as Finding[];\n for (\n let offset = 0;\n offset < findingsToEmbed.length;\n offset += EMBEDDING_BATCH_SIZE\n ) {\n this.signal?.throwIfAborted();\n const batch = findingsToEmbed.slice(\n offset,\n offset + EMBEDDING_BATCH_SIZE,\n );\n const embeddings = await abortable(() => {\n this.signal?.throwIfAborted();\n return this.embedding.embedder.embed(batch);\n }, this.signal);\n this.signal?.throwIfAborted();\n if (embeddings.length !== batch.length)\n throw new CodexSecurityError(\n \"Embedding provider returned an invalid number of vectors.\",\n );\n await this.command({\n action: \"embed\",\n entries: batch.map((finding, index) => ({\n findingId: finding.findingId,\n cacheKey: this.cacheKeys[finding.findingId],\n embedding: embeddings[index],\n })),\n });\n }\n }\n\n async potentialDuplicates(findingId: string): Promise<FindingNeighborhood> {\n return (await this.command({\n action: \"neighbors\",\n findingId,\n cacheKeys: this.cacheKeys,\n })) as unknown as FindingNeighborhood;\n }\n\n async storeDedupeGroups(groups: readonly string[][]): Promise<void> {\n await this.command({ action: \"commit\", groups, cacheKeys: this.cacheKeys });\n }\n\n private async command(payload: { action: string; [key: string]: unknown }) {\n this.signal?.throwIfAborted();\n this.options ??= (async () => {\n const environment = workbenchEnvironment(this.environment);\n const [python, pluginRoot] = await resolveWorkbenchRuntime({\n environment,\n protectedRoot: this.repositoryPath,\n signal: this.signal,\n });\n return {\n python,\n pluginRoot,\n environment,\n signal: this.signal,\n protectedRoot: [\n this.repositoryPath,\n ...(await gitProtectionRoots(this.repositoryPath, this.signal)),\n ...(await gitProtectionRoots(process.cwd(), this.signal)),\n ],\n failureMessage: \"Could not access local deduplication state\",\n };\n })();\n const result = await this.workbench(\n await this.options,\n [\n payload.action === \"neighbors\"\n ? \"find-potential-duplicates\"\n : payload.action === \"commit\"\n ? \"store-dedupe-groups\"\n : \"local-dedupe\",\n ],\n JSON.stringify({\n ...payload,\n scope: this.scope,\n space: this.space,\n model: this.embedding.model,\n dimensions: this.embedding.dimensions,\n ...(this.scope.allRepositories\n ? {}\n : { repositoryId: this.scope.repositoryId }),\n }),\n );\n this.signal?.throwIfAborted();\n const code = result[\"error\"];\n if (code !== undefined) {\n const message =\n code === \"finding_changed\"\n ? \"Findings changed during local deduplication. Retry with a new workflow ID if resuming.\"\n : code === \"target_mismatch\"\n ? \"The scan target does not match the approved local checkout. Use its original checkout or an explicitly configured findings service.\"\n : code === \"finding_not_indexed\"\n ? \"A local finding has no complete document. Reimport its scan before deduplicating.\"\n : `Local deduplication failed: ${String(code)}.`;\n throw new CodexSecurityError(message);\n }\n return result;\n }\n}\n\nasync function embeddingRequest(\n url: string,\n init: RequestInit,\n): Promise<Response> {\n for (let attempt = 1; ; attempt++) {\n init.signal?.throwIfAborted();\n let delay = retryDelay(attempt);\n try {\n const response = await fetch(url, init);\n if (\n attempt === 3 ||\n ![408, 429, 500, 502, 503, 504].includes(response.status)\n )\n return response;\n const retryAfter = response.headers.get(\"Retry-After\");\n if (retryAfter !== null) {\n const seconds = Number(retryAfter);\n const retryAt = Number.isFinite(seconds)\n ? seconds * 1000\n : Date.parse(retryAfter) - Date.now();\n if (Number.isFinite(retryAt)) delay = Math.max(delay, retryAt);\n }\n await response.body?.cancel().catch(() => undefined);\n } catch (error) {\n init.signal?.throwIfAborted();\n if (attempt === 3 || !(error instanceof TypeError)) throw error;\n }\n await waitForRetry(delay, init.signal ?? undefined);\n }\n}\n"]}
|
|
1
|
+
{"version":3,"file":"local.js","sourceRoot":"","sources":["../../src/deduplication/local.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAM9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EACL,iBAAiB,EACjB,oBAAoB,EACpB,YAAY,GAEb,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,qBAAqB,EACrB,eAAe,EACf,oBAAoB,EACpB,cAAc,GAEf,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAEtD,8FAA8F;AAC9F,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAWhC,2EAA2E;AAC3E,MAAM,OAAO,kBAAkB;IAOV,WAAW;IACX,KAAK;IACL,cAAc;IACd,MAAM;IACN,SAAS;IAVpB,OAAO,CAAoD;IAC3D,SAAS,GAA2B,EAAE,CAAC;IAC9B,KAAK,CAAS;IACd,SAAS,CAA0B;IAEpD,YACmB,WAA8B,EAC9B,KAAyB,EACzB,cAAsB,EACtB,MAAoB,EACpB,SAAS,GAAwB,YAAY,EAC9D,SAAmC;2BALlB,WAAW;qBACX,KAAK;8BACL,cAAc;sBACd,MAAM;yBACN,SAAS;QAG1B,MAAM,QAAQ,GACZ,gBAAgB,CAAC,WAAW,EAAE,+BAA+B,CAAC;YAC9D,cAAc,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI;YAC5B,KAAK,EAAE,eAAe;YACtB,UAAU,EAAE,oBAAoB;YAChC,cAAc,EAAE,QAAQ;YACxB,QAAQ,EAAE,IAAI,qBAAqB,CACjC;gBACE,gBAAgB,CAAC,WAAW,EAAE,gBAAgB,CAAC;gBAC/C,gBAAgB,CAAC,WAAW,EAAE,eAAe,CAAC;aAC/C,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAChC,gBAAgB,EAChB,QAAQ,EACR,MAAM,CACP;SACF,CAAC;QACF,2EAA2E;QAC3E,IAAI,CAAC,KAAK,GAAG,cAAc,CAAC;YAC1B,OAAO,EAAE,CAAC;YACV,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK;YAC3B,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU;YACrC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,cAAc;SACzC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,WAAW;QACb,OAAO,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,OAAO,CACX,QAA4B,EAC5B,YAAoB;QAEpB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC;YAChC,MAAM,EAAE,SAAS;YACjB,QAAQ;YACR,kBAAkB,EAAE,YAAY;YAChC,cAAc,EAAE,IAAI,CAAC,cAAc;SACpC,CAAC,CAAC;QACH,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,WAAW,CAA2B,CAAC;QAC/D,MAAM,eAAe,GAAG,MAAM,CAAC,iBAAiB,CAAyB,CAAC;QAC1E,KACE,IAAI,MAAM,GAAG,CAAC,EACd,MAAM,GAAG,eAAe,CAAC,MAAM,EAC/B,MAAM,IAAI,oBAAoB,EAC9B,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CACjC,MAAM,EACN,MAAM,GAAG,oBAAoB,CAC9B,CAAC;YACF,MAAM,UAAU,GAAG,MAAM,SAAS,CAAC,GAAG,EAAE;gBACtC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;gBAC9B,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC9C,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAChB,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,UAAU,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBACpC,MAAM,IAAI,kBAAkB,CAC1B,2DAA2D,CAC5D,CAAC;YACJ,MAAM,IAAI,CAAC,OAAO,CAAC;gBACjB,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;oBACtC,SAAS,EAAE,OAAO,CAAC,SAAS;oBAC5B,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC;oBAC3C,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC;iBAC7B,CAAC,CAAC;aACJ,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,SAAiB;QACzC,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC;YACzB,MAAM,EAAE,WAAW;YACnB,SAAS;YACT,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC,CAAmC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,iBAAiB,CAAC,MAA2B;QACjD,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IAC9E,CAAC;IAEO,KAAK,CAAC,OAAO,CAAC,OAAmD;QACvE,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,KAAK,CAAC,KAAK,IAAI,EAAE;YAC3B,MAAM,WAAW,GAAG,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC3D,OAAO;gBACL,UAAU,EAAE,MAAM,iBAAiB,EAAE;gBACrC,cAAc,EAAE,WAAW,CAAC,wBAAwB;gBACpD,WAAW;gBACX,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,aAAa,EAAE;oBACb,IAAI,CAAC,cAAc;oBACnB,GAAG,CAAC,MAAM,kBAAkB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC/D,GAAG,CAAC,MAAM,kBAAkB,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;iBAC1D;gBACD,cAAc,EAAE,4CAA4C;aAC7D,CAAC;QACJ,CAAC,CAAC,EAAE,CAAC;QACL,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,CACjC,MAAM,IAAI,CAAC,OAAO,EAClB;YACE,OAAO,CAAC,MAAM,KAAK,WAAW;gBAC5B,CAAC,CAAC,2BAA2B;gBAC7B,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,QAAQ;oBAC3B,CAAC,CAAC,qBAAqB;oBACvB,CAAC,CAAC,cAAc;SACrB,EACD,IAAI,CAAC,SAAS,CAAC;YACb,GAAG,OAAO;YACV,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK;YAC3B,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU;YACrC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe;gBAC5B,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;SAC/C,CAAC,CACH,CAAC;QACF,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,OAAO,GACX,IAAI,KAAK,iBAAiB;gBACxB,CAAC,CAAC,wFAAwF;gBAC1F,CAAC,CAAC,IAAI,KAAK,iBAAiB;oBAC1B,CAAC,CAAC,qIAAqI;oBACvI,CAAC,CAAC,IAAI,KAAK,qBAAqB;wBAC9B,CAAC,CAAC,mFAAmF;wBACrF,CAAC,CAAC,+BAA+B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;YACzD,MAAM,IAAI,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,KAAK,UAAU,gBAAgB,CAC7B,GAAW,EACX,IAAiB;IAEjB,KAAK,IAAI,OAAO,GAAG,CAAC,GAAI,OAAO,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACxC,IACE,OAAO,KAAK,CAAC;gBACb,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAEzD,OAAO,QAAQ,CAAC;YAClB,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACvD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;gBACnC,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;oBACtC,CAAC,CAAC,OAAO,GAAG,IAAI;oBAChB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACxC,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACjE,CAAC;YACD,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QACvD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,YAAY,SAAS,CAAC;gBAAE,MAAM,KAAK,CAAC;QAClE,CAAC;QACD,MAAM,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC;IACtD,CAAC;AACH,CAAC","sourcesContent":["import { environmentEntry } from \"../auth.js\";\nimport { abortable, gitProtectionRoots } from \"../targets.js\";\nimport type { Finding } from \"../models.js\";\nimport type {\n FindingNeighborhood,\n FindingSearchScope,\n} from \"../finding-retrieval.js\";\nimport { CodexSecurityError } from \"../errors.js\";\nimport { workflowDigest } from \"../finding-workflow.js\";\nimport {\n bundledPluginRoot,\n workbenchEnvironment,\n runWorkbench,\n type WorkbenchCommandOptions,\n} from \"../runtime.js\";\nimport {\n OpenAiFindingEmbedder,\n EMBEDDING_MODEL,\n EMBEDDING_DIMENSIONS,\n EMBEDDINGS_URL,\n type FindingEmbedder,\n} from \"../server/embeddings.js\";\nimport { retryDelay, waitForRetry } from \"./retry.js\";\n\n// Checkpoint bounded batches so a retry keeps completed work without one process per finding.\nconst EMBEDDING_BATCH_SIZE = 64;\n\n/** One vector space and the adapter that produces its embeddings. */\nexport interface FindingEmbeddingBinding {\n readonly embedder: FindingEmbedder;\n readonly model: string;\n readonly dimensions: number;\n /** Identifies the provider/vector space and preprocessing version; exclude credentials. */\n readonly cacheNamespace: string;\n}\n\n/** Direct workbench adapter. Importing it starts no HTTP or MCP server. */\nexport class LocalDeduplication {\n private options?: Promise<Omit<WorkbenchCommandOptions, \"python\">>;\n private cacheKeys: Record<string, string> = {};\n private readonly space: string;\n private readonly embedding: FindingEmbeddingBinding;\n\n constructor(\n private readonly environment: NodeJS.ProcessEnv,\n private readonly scope: FindingSearchScope,\n private readonly repositoryPath: string,\n private readonly signal?: AbortSignal,\n private readonly workbench: typeof runWorkbench = runWorkbench,\n embedding?: FindingEmbeddingBinding,\n ) {\n const endpoint =\n environmentEntry(environment, \"CODEX_SECURITY_EMBEDDINGS_URL\") ||\n EMBEDDINGS_URL;\n this.embedding = embedding ?? {\n model: EMBEDDING_MODEL,\n dimensions: EMBEDDING_DIMENSIONS,\n cacheNamespace: endpoint,\n embedder: new OpenAiFindingEmbedder(\n [\n environmentEntry(environment, \"OPENAI_API_KEY\"),\n environmentEntry(environment, \"CODEX_API_KEY\"),\n ].find((value) => value?.trim()),\n embeddingRequest,\n endpoint,\n signal,\n ),\n };\n // The digest keeps endpoint/namespace details out of persisted cache keys.\n this.space = workflowDigest({\n version: 1,\n model: this.embedding.model,\n dimensions: this.embedding.dimensions,\n namespace: this.embedding.cacheNamespace,\n });\n }\n\n get inputDigest(): string {\n return workflowDigest(this.cacheKeys);\n }\n\n async prepare(\n findings: readonly Finding[],\n repositoryId: string,\n ): Promise<void> {\n const result = await this.command({\n action: \"prepare\",\n findings,\n anchorRepositoryId: repositoryId,\n repositoryPath: this.repositoryPath,\n });\n this.cacheKeys = result[\"cacheKeys\"] as Record<string, string>;\n const findingsToEmbed = result[\"findingsToEmbed\"] as unknown as Finding[];\n for (\n let offset = 0;\n offset < findingsToEmbed.length;\n offset += EMBEDDING_BATCH_SIZE\n ) {\n this.signal?.throwIfAborted();\n const batch = findingsToEmbed.slice(\n offset,\n offset + EMBEDDING_BATCH_SIZE,\n );\n const embeddings = await abortable(() => {\n this.signal?.throwIfAborted();\n return this.embedding.embedder.embed(batch);\n }, this.signal);\n this.signal?.throwIfAborted();\n if (embeddings.length !== batch.length)\n throw new CodexSecurityError(\n \"Embedding provider returned an invalid number of vectors.\",\n );\n await this.command({\n action: \"embed\",\n entries: batch.map((finding, index) => ({\n findingId: finding.findingId,\n cacheKey: this.cacheKeys[finding.findingId],\n embedding: embeddings[index],\n })),\n });\n }\n }\n\n async potentialDuplicates(findingId: string): Promise<FindingNeighborhood> {\n return (await this.command({\n action: \"neighbors\",\n findingId,\n cacheKeys: this.cacheKeys,\n })) as unknown as FindingNeighborhood;\n }\n\n async storeDedupeGroups(groups: readonly string[][]): Promise<void> {\n await this.command({ action: \"commit\", groups, cacheKeys: this.cacheKeys });\n }\n\n private async command(payload: { action: string; [key: string]: unknown }) {\n this.signal?.throwIfAborted();\n this.options ??= (async () => {\n const environment = workbenchEnvironment(this.environment);\n return {\n pluginRoot: await bundledPluginRoot(),\n stateDirectory: environment.CODEX_SECURITY_STATE_DIR,\n environment,\n signal: this.signal,\n protectedRoot: [\n this.repositoryPath,\n ...(await gitProtectionRoots(this.repositoryPath, this.signal)),\n ...(await gitProtectionRoots(process.cwd(), this.signal)),\n ],\n failureMessage: \"Could not access local deduplication state\",\n };\n })();\n const result = await this.workbench(\n await this.options,\n [\n payload.action === \"neighbors\"\n ? \"find-potential-duplicates\"\n : payload.action === \"commit\"\n ? \"store-dedupe-groups\"\n : \"local-dedupe\",\n ],\n JSON.stringify({\n ...payload,\n scope: this.scope,\n space: this.space,\n model: this.embedding.model,\n dimensions: this.embedding.dimensions,\n ...(this.scope.allRepositories\n ? {}\n : { repositoryId: this.scope.repositoryId }),\n }),\n );\n this.signal?.throwIfAborted();\n const code = result[\"error\"];\n if (code !== undefined) {\n const message =\n code === \"finding_changed\"\n ? \"Findings changed during local deduplication. Retry with a new workflow ID if resuming.\"\n : code === \"target_mismatch\"\n ? \"The scan target does not match the approved local checkout. Use its original checkout or an explicitly configured findings service.\"\n : code === \"finding_not_indexed\"\n ? \"A local finding has no complete document. Reimport its scan before deduplicating.\"\n : `Local deduplication failed: ${String(code)}.`;\n throw new CodexSecurityError(message);\n }\n return result;\n }\n}\n\nasync function embeddingRequest(\n url: string,\n init: RequestInit,\n): Promise<Response> {\n for (let attempt = 1; ; attempt++) {\n init.signal?.throwIfAborted();\n let delay = retryDelay(attempt);\n try {\n const response = await fetch(url, init);\n if (\n attempt === 3 ||\n ![408, 429, 500, 502, 503, 504].includes(response.status)\n )\n return response;\n const retryAfter = response.headers.get(\"Retry-After\");\n if (retryAfter !== null) {\n const seconds = Number(retryAfter);\n const retryAt = Number.isFinite(seconds)\n ? seconds * 1000\n : Date.parse(retryAfter) - Date.now();\n if (Number.isFinite(retryAt)) delay = Math.max(delay, retryAt);\n }\n await response.body?.cancel().catch(() => undefined);\n } catch (error) {\n init.signal?.throwIfAborted();\n if (attempt === 3 || !(error instanceof TypeError)) throw error;\n }\n await waitForRetry(delay, init.signal ?? undefined);\n }\n}\n"]}
|
|
@@ -1,10 +1,12 @@
|
|
|
1
1
|
import { z } from "zod";
|
|
2
|
-
import
|
|
2
|
+
import { type ImportedFinding } from "./finding-schema.js";
|
|
3
|
+
import type { DeduplicationReviewAttribution, DeduplicationReviewRequest, DeduplicationReviewRunner } from "./review.js";
|
|
3
4
|
export declare function recordsReviewAttribution(findingIds: readonly string[] | undefined, references: ReadonlyMap<string, string>, anchors: ReadonlyMap<string, readonly string[]>): DeduplicationReviewAttribution;
|
|
4
5
|
declare const deduplicateRecordsInputSchema: z.ZodObject<{
|
|
5
6
|
version: z.ZodLiteral<1>;
|
|
6
|
-
observations: z.ZodArray<z.ZodObject<{
|
|
7
|
+
observations: z.ZodArray<z.ZodDiscriminatedUnion<[z.ZodObject<{
|
|
7
8
|
id: z.ZodString;
|
|
9
|
+
kind: z.ZodOptional<z.ZodUndefined>;
|
|
8
10
|
finding: z.ZodPipe<z.ZodUnknown, z.ZodTransform<{
|
|
9
11
|
[k: string]: unknown;
|
|
10
12
|
findingId: string;
|
|
@@ -178,7 +180,11 @@ declare const deduplicateRecordsInputSchema: z.ZodObject<{
|
|
|
178
180
|
[k: string]: unknown;
|
|
179
181
|
};
|
|
180
182
|
}, unknown>>;
|
|
181
|
-
}, z.core.$strict
|
|
183
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
184
|
+
id: z.ZodString;
|
|
185
|
+
kind: z.ZodLiteral<"imported">;
|
|
186
|
+
finding: z.ZodPipe<z.ZodUnknown, z.ZodTransform<ImportedFinding, unknown>>;
|
|
187
|
+
}, z.core.$strict>], "kind">>;
|
|
182
188
|
candidateRelationships: z.ZodArray<z.ZodObject<{
|
|
183
189
|
observationId: z.ZodString;
|
|
184
190
|
candidateObservationIds: z.ZodArray<z.ZodString>;
|
|
@@ -205,5 +211,7 @@ export interface DeduplicateRecordsResult {
|
|
|
205
211
|
}
|
|
206
212
|
/** Pure records workflow: no retrieval, local model execution, or persistence. */
|
|
207
213
|
export declare function deduplicateRecords(input: DeduplicateRecordsInput, options: DeduplicateRecordsOptions): Promise<DeduplicateRecordsResult>;
|
|
214
|
+
/** The records transport can check a pending submission before releasing its host. */
|
|
215
|
+
export declare function runRecords(input: DeduplicateRecordsInput, runReview: (request: DeduplicationReviewRequest, validate: (value: unknown) => void) => Promise<unknown>, signal?: AbortSignal): Promise<DeduplicateRecordsResult>;
|
|
208
216
|
export {};
|
|
209
217
|
//# sourceMappingURL=records.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"records.d.ts","sourceRoot":"","sources":["../../src/deduplication/records.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;
|
|
1
|
+
{"version":3,"file":"records.d.ts","sourceRoot":"","sources":["../../src/deduplication/records.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAOxB,OAAO,EAKL,KAAK,eAAe,EACrB,MAAM,qBAAqB,CAAC;AAQ7B,OAAO,KAAK,EACV,8BAA8B,EAC9B,0BAA0B,EAC1B,yBAAyB,EAC1B,MAAM,aAAa,CAAC;AAErB,wBAAgB,wBAAwB,CACtC,UAAU,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EACzC,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EACvC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,GAC9C,8BAA8B,CAqBhC;AAkCD,QAAA,MAAM,6BAA6B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBASjC,CAAC;AAEH,MAAM,WAAW,uBAAwB,SAAQ,CAAC,CAAC,KAAK,CACtD,OAAO,6BAA6B,CACrC;CAAG;AACJ,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,CAMnC;AAED,sFAAsF;AACtF,wBAAsB,UAAU,CAC9B,KAAK,EAAE,uBAAuB,EAC9B,SAAS,EAAE,CACT,OAAO,EAAE,0BAA0B,EACnC,QAAQ,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,KAC/B,OAAO,CAAC,OAAO,CAAC,EACrB,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,wBAAwB,CAAC,CA0InC"}
|
|
@@ -4,7 +4,7 @@ import { DeduplicationReviewError } from "../errors.js";
|
|
|
4
4
|
import { abortable } from "../targets.js";
|
|
5
5
|
import { FindingDeduplicator } from "./deduplication.js";
|
|
6
6
|
import { CodexDeduplicationReviewer } from "./deduplication-reviewer.js";
|
|
7
|
-
import { findingSchema, requireFinding } from "./finding-schema.js";
|
|
7
|
+
import { findingSchema, importedFindingSchema, requireFinding, requireImportedFinding, } from "./finding-schema.js";
|
|
8
8
|
import { sourceReviewInstructions, screeningInstructions, pairReviewInstructions, screeningFindingFormatInstructions, pairFindingFormatInstructions, } from "./deduplication-prompts.js";
|
|
9
9
|
export function recordsReviewAttribution(findingIds, references, anchors) {
|
|
10
10
|
if (!findingIds?.length)
|
|
@@ -26,11 +26,35 @@ export function recordsReviewAttribution(findingIds, references, anchors) {
|
|
|
26
26
|
contextObservationIds: [...participants.difference(anchors)].sort(),
|
|
27
27
|
};
|
|
28
28
|
}
|
|
29
|
+
function reviewFindingSchema(ids, importedIds) {
|
|
30
|
+
const imported = ids.filter((id) => importedIds.has(id));
|
|
31
|
+
if (!imported.length)
|
|
32
|
+
return findingSchema();
|
|
33
|
+
if (imported.length === ids.length)
|
|
34
|
+
return importedFindingSchema();
|
|
35
|
+
const native = findingSchema();
|
|
36
|
+
return {
|
|
37
|
+
...importedFindingSchema(),
|
|
38
|
+
if: { properties: { findingId: { enum: imported } } },
|
|
39
|
+
else: {
|
|
40
|
+
required: native.required,
|
|
41
|
+
properties: { locations: native.properties.locations },
|
|
42
|
+
},
|
|
43
|
+
};
|
|
44
|
+
}
|
|
29
45
|
const id = z.string().min(1);
|
|
30
|
-
const record = z.
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
46
|
+
const record = z.discriminatedUnion("kind", [
|
|
47
|
+
z.strictObject({
|
|
48
|
+
id,
|
|
49
|
+
kind: z.undefined().optional(),
|
|
50
|
+
finding: z.unknown().transform(requireFinding),
|
|
51
|
+
}),
|
|
52
|
+
z.strictObject({
|
|
53
|
+
id,
|
|
54
|
+
kind: z.literal("imported"),
|
|
55
|
+
finding: z.unknown().transform(requireImportedFinding),
|
|
56
|
+
}),
|
|
57
|
+
]);
|
|
34
58
|
const deduplicateRecordsInputSchema = z.strictObject({
|
|
35
59
|
version: z.literal(1),
|
|
36
60
|
observations: z.array(record),
|
|
@@ -41,16 +65,23 @@ const deduplicateRecordsInputSchema = z.strictObject({
|
|
|
41
65
|
});
|
|
42
66
|
/** Pure records workflow: no retrieval, local model execution, or persistence. */
|
|
43
67
|
export async function deduplicateRecords(input, options) {
|
|
44
|
-
options.signal
|
|
68
|
+
return await runRecords(input, (request) => options.reviewRunner.run(request, { signal: options.signal }), options.signal);
|
|
69
|
+
}
|
|
70
|
+
/** The records transport can check a pending submission before releasing its host. */
|
|
71
|
+
export async function runRecords(input, runReview, signal) {
|
|
72
|
+
signal?.throwIfAborted();
|
|
45
73
|
// Snapshot before yielding: a host cannot mutate evidence during the review.
|
|
46
74
|
const data = deduplicateRecordsInputSchema.parse(structuredClone(input));
|
|
47
75
|
const references = new Map();
|
|
48
76
|
const observations = new Map();
|
|
77
|
+
const importedIds = new Set();
|
|
49
78
|
for (const entry of data.observations) {
|
|
50
79
|
if (observations.has(entry.id))
|
|
51
80
|
throw new Error(`Duplicate observation ID: ${entry.id}`);
|
|
52
81
|
// Original finding IDs can repeat across scans; host IDs identify observations.
|
|
53
82
|
const findingId = `csf_${hash("sha256", entry.id).slice(0, 24)}`;
|
|
83
|
+
if (entry.kind === "imported")
|
|
84
|
+
importedIds.add(findingId);
|
|
54
85
|
observations.set(entry.id, { ...entry.finding, findingId });
|
|
55
86
|
references.set(findingId, entry.id);
|
|
56
87
|
}
|
|
@@ -72,12 +103,12 @@ export async function deduplicateRecords(input, options) {
|
|
|
72
103
|
unresolved: [],
|
|
73
104
|
};
|
|
74
105
|
const sourceFindingIds = [...relationships.keys()].map((id) => observations.get(id).findingId);
|
|
75
|
-
const
|
|
106
|
+
const runner = {
|
|
76
107
|
async run({ validate, findingIds, ...review }) {
|
|
77
108
|
try {
|
|
78
109
|
return await abortable(async () => {
|
|
79
|
-
|
|
80
|
-
return validate(await
|
|
110
|
+
signal?.throwIfAborted();
|
|
111
|
+
return validate(await runReview({
|
|
81
112
|
...review,
|
|
82
113
|
requestId: randomUUID(),
|
|
83
114
|
attribution: recordsReviewAttribution(findingIds, references, relationships),
|
|
@@ -90,9 +121,9 @@ export async function deduplicateRecords(input, options) {
|
|
|
90
121
|
? screeningFindingFormatInstructions
|
|
91
122
|
: pairFindingFormatInstructions,
|
|
92
123
|
].join("\n\n"),
|
|
93
|
-
findingSchema: structuredClone(
|
|
94
|
-
},
|
|
95
|
-
},
|
|
124
|
+
findingSchema: structuredClone(reviewFindingSchema(findingIds ?? [], importedIds)),
|
|
125
|
+
}, validate));
|
|
126
|
+
}, signal);
|
|
96
127
|
}
|
|
97
128
|
catch (error) {
|
|
98
129
|
// Records mode discards the batch after any failed review.
|
|
@@ -102,7 +133,8 @@ export async function deduplicateRecords(input, options) {
|
|
|
102
133
|
throw error;
|
|
103
134
|
}
|
|
104
135
|
},
|
|
105
|
-
}
|
|
136
|
+
};
|
|
137
|
+
const reviewer = new CodexDeduplicationReviewer(runner, {}, importedIds);
|
|
106
138
|
const algorithm = new FindingDeduplicator({
|
|
107
139
|
async potentialDuplicates(findingId) {
|
|
108
140
|
const observationId = references.get(findingId);
|
|
@@ -113,15 +145,15 @@ export async function deduplicateRecords(input, options) {
|
|
|
113
145
|
.map((id) => observations.get(id)),
|
|
114
146
|
};
|
|
115
147
|
},
|
|
116
|
-
}, reviewer,
|
|
148
|
+
}, reviewer, signal, 1);
|
|
117
149
|
let groups;
|
|
118
150
|
try {
|
|
119
151
|
const decisions = await algorithm.run(sourceFindingIds);
|
|
120
|
-
|
|
152
|
+
signal?.throwIfAborted();
|
|
121
153
|
groups = decisions.duplicateGroups;
|
|
122
154
|
}
|
|
123
155
|
catch (error) {
|
|
124
|
-
|
|
156
|
+
signal?.throwIfAborted();
|
|
125
157
|
result.status = "unresolved";
|
|
126
158
|
result.unresolved = [...relationships.keys()].map((id) => ({
|
|
127
159
|
observationId: id,
|