@openai/codex-security 0.1.25 → 0.1.27

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.
Files changed (197) hide show
  1. package/README.md +616 -34
  2. package/_bundled_plugin/.app.json +0 -5
  3. package/_bundled_plugin/.codex-plugin/plugin.json +1 -1
  4. package/_bundled_plugin/.mcp.json +2 -0
  5. package/_bundled_plugin/mcp/helpers.mjs +24 -0
  6. package/_bundled_plugin/mcp/helpers.mjs.br.part-000 +0 -0
  7. package/_bundled_plugin/mcp/native/COPYRIGHT-library.html +5556 -0
  8. package/_bundled_plugin/mcp/native/THIRD_PARTY_NOTICES.txt +5989 -0
  9. package/_bundled_plugin/mcp/native/darwin-arm64/unix.node +0 -0
  10. package/_bundled_plugin/mcp/native/darwin-x64/unix.node +0 -0
  11. package/_bundled_plugin/mcp/native/licenses/Apache-2.0.txt +73 -0
  12. package/_bundled_plugin/mcp/native/licenses/BSD-2-Clause.txt +9 -0
  13. package/_bundled_plugin/mcp/native/licenses/MIT.txt +9 -0
  14. package/_bundled_plugin/mcp/native/licenses/Unicode-3.0.txt +39 -0
  15. package/_bundled_plugin/mcp/native/linux-arm64-gnu/unix.node +0 -0
  16. package/_bundled_plugin/mcp/native/linux-arm64-musl/unix.node +0 -0
  17. package/_bundled_plugin/mcp/native/linux-x64-gnu/unix.node +0 -0
  18. package/_bundled_plugin/mcp/native/linux-x64-musl/unix.node +0 -0
  19. package/_bundled_plugin/mcp/native/win32-arm64/windows.node +0 -0
  20. package/_bundled_plugin/mcp/native/win32-x64/windows.node +0 -0
  21. package/_bundled_plugin/mcp/server.mjs.br.part-000 +0 -0
  22. package/_bundled_plugin/mcp/server.mjs.br.part-001 +0 -0
  23. package/_bundled_plugin/references/config-preflight.md +4 -2
  24. package/_bundled_plugin/references/core-scan.md +1 -1
  25. package/_bundled_plugin/references/final-report.md +5 -3
  26. package/_bundled_plugin/references/scan-artifacts.md +5 -1
  27. package/_bundled_plugin/references/scan-contract.md +42 -38
  28. package/_bundled_plugin/references/security-guidance.md +7 -1
  29. package/_bundled_plugin/schemas/tools/deep-reducer.schema.json +27 -1
  30. package/_bundled_plugin/scripts/deep_scan_workbench.py +6 -1
  31. package/_bundled_plugin/scripts/finalize_scan_contract.py +2 -5
  32. package/_bundled_plugin/scripts/generate_in_scope_files.py +2 -2
  33. package/_bundled_plugin/scripts/generate_rank_input.py +8 -1
  34. package/_bundled_plugin/scripts/launch_codex_security_mcp +6 -0
  35. package/_bundled_plugin/scripts/launch_codex_security_mcp.cmd +43 -9
  36. package/_bundled_plugin/scripts/rank_preview.py +4 -1
  37. package/_bundled_plugin/scripts/report_projection.py +1 -1
  38. package/_bundled_plugin/scripts/workbench_cli.py +7 -0
  39. package/_bundled_plugin/scripts/workbench_db.py +44 -31
  40. package/_bundled_plugin/scripts/workbench_saved_results.py +41 -22
  41. package/_bundled_plugin/scripts/workbench_scan_history.py +117 -2
  42. package/_bundled_plugin/scripts/workbench_scan_usage.py +7 -6
  43. package/_bundled_plugin/scripts/workbench_schema.py +31 -0
  44. package/_bundled_plugin/scripts/workbench_severity.py +119 -0
  45. package/_bundled_plugin/scripts/workbench_validation.py +4 -0
  46. package/_bundled_plugin/skills/deep-security-scan/SKILL.md +5 -3
  47. package/_bundled_plugin/skills/define-security-policy/SKILL.md +3 -3
  48. package/_bundled_plugin/skills/verify-fix/SKILL.md +5 -1
  49. package/dist/api.d.ts +7 -1
  50. package/dist/api.d.ts.map +1 -1
  51. package/dist/api.js +485 -65
  52. package/dist/api.js.map +1 -1
  53. package/dist/auth.js +10 -0
  54. package/dist/auth.js.map +1 -1
  55. package/dist/classify-scan-severity.d.ts +16 -0
  56. package/dist/classify-scan-severity.d.ts.map +1 -0
  57. package/dist/classify-scan-severity.js +96 -0
  58. package/dist/classify-scan-severity.js.map +1 -0
  59. package/dist/classify-severity.d.ts +38 -0
  60. package/dist/classify-severity.d.ts.map +1 -0
  61. package/dist/classify-severity.js +185 -0
  62. package/dist/classify-severity.js.map +1 -0
  63. package/dist/cli.d.ts +23 -4
  64. package/dist/cli.d.ts.map +1 -1
  65. package/dist/cli.js +1277 -357
  66. package/dist/cli.js.map +1 -1
  67. package/dist/cloud-publish.d.ts.map +1 -1
  68. package/dist/cloud-publish.js +2 -207
  69. package/dist/cloud-publish.js.map +1 -1
  70. package/dist/component-plan.d.ts.map +1 -1
  71. package/dist/component-plan.js +116 -32
  72. package/dist/component-plan.js.map +1 -1
  73. package/dist/config.d.ts +1 -0
  74. package/dist/config.d.ts.map +1 -1
  75. package/dist/config.js +17 -2
  76. package/dist/config.js.map +1 -1
  77. package/dist/contract.d.ts +5 -10
  78. package/dist/contract.d.ts.map +1 -1
  79. package/dist/contract.js.map +1 -1
  80. package/dist/cost-model.d.ts +16 -0
  81. package/dist/cost-model.d.ts.map +1 -1
  82. package/dist/cost-model.js +57 -3
  83. package/dist/cost-model.js.map +1 -1
  84. package/dist/cost.d.ts.map +1 -1
  85. package/dist/cost.js +38 -9
  86. package/dist/cost.js.map +1 -1
  87. package/dist/custom-validation-prompt.js +1 -1
  88. package/dist/custom-validation-prompt.js.map +1 -1
  89. package/dist/deduplication/codex-review.d.ts +6 -1
  90. package/dist/deduplication/codex-review.d.ts.map +1 -1
  91. package/dist/deduplication/codex-review.js +72 -17
  92. package/dist/deduplication/codex-review.js.map +1 -1
  93. package/dist/deduplication/deduplication-reviewer.js +1 -1
  94. package/dist/deduplication/deduplication-reviewer.js.map +1 -1
  95. package/dist/deduplication/deduplication.d.ts +2 -0
  96. package/dist/deduplication/deduplication.d.ts.map +1 -1
  97. package/dist/deduplication/deduplication.js +99 -26
  98. package/dist/deduplication/deduplication.js.map +1 -1
  99. package/dist/deduplication/retry.d.ts +3 -0
  100. package/dist/deduplication/retry.d.ts.map +1 -0
  101. package/dist/deduplication/retry.js +15 -0
  102. package/dist/deduplication/retry.js.map +1 -0
  103. package/dist/deduplication/scan.d.ts +2 -0
  104. package/dist/deduplication/scan.d.ts.map +1 -1
  105. package/dist/deduplication/scan.js +4 -2
  106. package/dist/deduplication/scan.js.map +1 -1
  107. package/dist/feedback.d.ts +20 -0
  108. package/dist/feedback.d.ts.map +1 -0
  109. package/dist/feedback.js +121 -0
  110. package/dist/feedback.js.map +1 -0
  111. package/dist/finding-catalogue.d.ts +11 -0
  112. package/dist/finding-catalogue.d.ts.map +1 -0
  113. package/dist/finding-catalogue.js +150 -0
  114. package/dist/finding-catalogue.js.map +1 -0
  115. package/dist/findings-client.d.ts +7 -1
  116. package/dist/findings-client.d.ts.map +1 -1
  117. package/dist/findings-client.js +55 -10
  118. package/dist/findings-client.js.map +1 -1
  119. package/dist/findings-import.d.ts +44 -0
  120. package/dist/findings-import.d.ts.map +1 -0
  121. package/dist/findings-import.js +302 -0
  122. package/dist/findings-import.js.map +1 -0
  123. package/dist/import-scan.d.ts +27 -0
  124. package/dist/import-scan.d.ts.map +1 -0
  125. package/dist/import-scan.js +236 -0
  126. package/dist/import-scan.js.map +1 -0
  127. package/dist/index.d.ts +8 -0
  128. package/dist/index.d.ts.map +1 -1
  129. package/dist/index.js +4 -0
  130. package/dist/index.js.map +1 -1
  131. package/dist/knowledge-base.d.ts +1 -1
  132. package/dist/knowledge-base.d.ts.map +1 -1
  133. package/dist/knowledge-base.js +2 -2
  134. package/dist/knowledge-base.js.map +1 -1
  135. package/dist/multiscan.d.ts +2 -0
  136. package/dist/multiscan.d.ts.map +1 -1
  137. package/dist/multiscan.js +144 -52
  138. package/dist/multiscan.js.map +1 -1
  139. package/dist/patch-tui.js +1 -1
  140. package/dist/patch-tui.js.map +1 -1
  141. package/dist/publication-events.d.ts.map +1 -1
  142. package/dist/publication-events.js +7 -2
  143. package/dist/publication-events.js.map +1 -1
  144. package/dist/publication-store.d.ts.map +1 -1
  145. package/dist/publication-store.js +9 -4
  146. package/dist/publication-store.js.map +1 -1
  147. package/dist/publication.d.ts +9 -0
  148. package/dist/publication.d.ts.map +1 -1
  149. package/dist/publication.js +45 -5
  150. package/dist/publication.js.map +1 -1
  151. package/dist/publish.d.ts +4 -2
  152. package/dist/publish.d.ts.map +1 -1
  153. package/dist/publish.js +2 -2
  154. package/dist/publish.js.map +1 -1
  155. package/dist/runtime.d.ts +5 -1
  156. package/dist/runtime.d.ts.map +1 -1
  157. package/dist/runtime.js +8 -2
  158. package/dist/runtime.js.map +1 -1
  159. package/dist/scan-comparison.d.ts +42 -37
  160. package/dist/scan-comparison.d.ts.map +1 -1
  161. package/dist/scan-comparison.js +535 -161
  162. package/dist/scan-comparison.js.map +1 -1
  163. package/dist/scan-dashboard.d.ts.map +1 -1
  164. package/dist/scan-dashboard.js +19 -6
  165. package/dist/scan-dashboard.js.map +1 -1
  166. package/dist/scan-history-renderer.d.ts.map +1 -1
  167. package/dist/scan-history-renderer.js +5 -0
  168. package/dist/scan-history-renderer.js.map +1 -1
  169. package/dist/scan-logs.d.ts +29 -0
  170. package/dist/scan-logs.d.ts.map +1 -1
  171. package/dist/scan-logs.js +36 -5
  172. package/dist/scan-logs.js.map +1 -1
  173. package/dist/security-policy-cli.d.ts +39 -0
  174. package/dist/security-policy-cli.d.ts.map +1 -0
  175. package/dist/security-policy-cli.js +193 -0
  176. package/dist/security-policy-cli.js.map +1 -0
  177. package/dist/security-policy.d.ts +80 -0
  178. package/dist/security-policy.d.ts.map +1 -0
  179. package/dist/security-policy.js +672 -0
  180. package/dist/security-policy.js.map +1 -0
  181. package/dist/severity-store.d.ts +2 -0
  182. package/dist/severity-store.d.ts.map +1 -0
  183. package/dist/severity-store.js +111 -0
  184. package/dist/severity-store.js.map +1 -0
  185. package/dist/targets.d.ts +8 -1
  186. package/dist/targets.d.ts.map +1 -1
  187. package/dist/targets.js +243 -14
  188. package/dist/targets.js.map +1 -1
  189. package/dist/thread-source.d.ts +1 -0
  190. package/dist/thread-source.d.ts.map +1 -1
  191. package/dist/thread-source.js +1 -0
  192. package/dist/thread-source.js.map +1 -1
  193. package/dist/version.d.ts +1 -1
  194. package/dist/version.js +1 -1
  195. package/dist/version.js.map +1 -1
  196. package/package.json +10 -6
  197. package/_bundled_plugin/scripts/resolve_security_md.py +0 -158
@@ -1 +1 @@
1
- {"version":3,"file":"deduplication.js","sourceRoot":"","sources":["../../src/deduplication/deduplication.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,OAAO,EACP,iBAAiB,GAElB,MAAM,6BAA6B,CAAC;AAQrC,MAAM,aAAa,GAAiD;IAClE,QAAQ,EAAE,CAAC;IACX,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,GAAG,EAAE,CAAC;IACN,aAAa,EAAE,CAAC;CACjB,CAAC;AAEF,SAAS,UAAU,CACjB,IAAuB,EACvB,KAAwB;IAExB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAE,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;IACxE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD,SAAS,UAAU,CACjB,OAAyC,EACzC,IAAY,EACZ,KAAa;IAEb,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACnE,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACrE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAClB,SAAmC,EACnC,IAAY,EACZ,KAAa;IAEb,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IAC/D,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IACjE,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACnC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;AACvC,CAAC;AAED,mFAAmF;AACnF,gBAAgB;AAChB,MAAM,UAAU,0BAA0B,CACxC,UAA6B,EAC7B,SAAiD,EACjD,aAAqD,EACrD,MAAoB,EACpB,OAAsC;IAEtC,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CACzD,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CACpE,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS;QACnC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa;QACvC,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAElE,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,IAAI,QAA+C,CAAC;QACpD,IAAI,aAA4C,CAAC;QACjD,KAAK,MAAM,WAAW,IAAI,MAAM,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClE,IACE,WAAW,IAAI,YAAY;oBAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC;oBACzB,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC;oBAE7C,SAAS;gBACX,IAAI,OAAO;oBAAE,OAAO,CAAC,oBAAoB,EAAE,CAAC;gBAC5C,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACjD,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACnD,KAAK,MAAM,KAAK,IAAI,aAAa,IAAI,EAAE,EAAE,CAAC;oBACxC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,YAAY,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,KAAK,CAAC;wBACvD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/D,CAAC;gBACD,KAAK,MAAM,KAAK,IAAI,cAAc,IAAI,EAAE,EAAE,CAAC;oBACzC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,WAAW,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC;wBACrD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC9D,CAAC;gBACD,MAAM,KAAK,GAAG;oBACZ,IAAI,GAAG,YAAY;oBACnB,IAAI;oBACJ,CAAC,YAAY;oBACb,CAAC,WAAW;oBACZ,CAAC,YAAY;iBACd,CAAC;gBACF,IAAI,aAAa,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;oBACpE,QAAQ,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;oBACvC,aAAa,GAAG,KAAK,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YACxB,OAAO,CAAC,GAAG,MAAM,CAAC;iBACf,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,GAAG,QAAQ,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAE;YAC9C,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE5B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC1E,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC5E,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;YAC/B,GAAG,WAAW,CAAC,IAAI,EAAE;YACrB,GAAG,YAAY,CAAC,IAAI,EAAE;SACvB,CAAC,CAAC;QACH,gBAAgB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACtC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjC,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,MAAM,MAAM,GACV,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACvE,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAClC,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YAC/C,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACrC,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE7B,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;YAC9B,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YACrC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;SACvC,CAAC,CAAC;QACH,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACpC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,iBAAiB,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YACnD,iBAAiB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACvC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;;YACrE,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACnC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED,gBAAgB;AAChB,MAAM,OAAO,mBAAmB;IAEX;IAGA;IACA;IALnB,YACmB,UAEhB,EACgB,QAA+B,EAC/B,MAAoB;QAJpB,eAAU,GAAV,UAAU,CAE1B;QACgB,aAAQ,GAAR,QAAQ,CAAuB;QAC/B,WAAM,GAAN,MAAM,CAAc;IACpC,CAAC;IAEJ,KAAK,CAAC,GAAG,CAAC,UAA6B;QACrC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA4B,CAAC;QACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA4B,CAAC;QACrD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;YAC7D,MAAM,YAAY,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC;YACrE,KAAK,MAAM,OAAO,IAAI,YAAY;gBAChC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC3C,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YACtC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAC3D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC7D,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAE,CAAC;gBAChE,MAAM,IAAI,GAAqB;oBAC7B,YAAY,CAAC,CAAC,CAAE,CAAC,SAAS;oBAC1B,YAAY,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,SAAS;iBACnC,CAAC;gBACF,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,QAAQ,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;oBACjC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;wBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACnD,CAAC;qBAAM,CAAC;oBACN,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;oBACxB,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAuB,EAAE,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;YACtD,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;gBACpE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAU,EAAE,CAAC;gBAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBAC1D,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAIV,EAAE,CAAC;QACT,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAuC,CAAC;QAC1E,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9D,MAAM,SAAS,GAAgC;gBAC7C,OAAO,EAAE,EAAE;gBACX,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,EAAE;aACb,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;gBAC9B,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAC7C,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC1C,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,oEAAoE;QACpE,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE;YAC9B,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,SAAS;YAC1B,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,SAAS,IAAI,SAAS,KAAK,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5D,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,eAAe,GAAe,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,MAAM,GACV,SAAS,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC7B,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC,CAAC,0BAA0B,CACxB,SAAS,CAAC,OAAO,EACjB,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,QAAQ,EAClB,IAAI,CAAC,MAAM,CACZ,CAAC;YACR,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAAE,SAAS;gBACnE,YAAY,CAAC,IAAI,CACf,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAC/C,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBACpD,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC7C,CAAC;gBACF,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACnC,KAAK,MAAM,MAAM,IAAI,YAAY;oBAC/B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO;YACL,gBAAgB,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACxE,eAAe;YACf,mBAAmB,EAAE,WAAW;SACjC,CAAC;IACJ,CAAC;CACF","sourcesContent":["import type { Finding } from \"../models.js\";\nimport type { FindingNeighborhood } from \"../finding-retrieval.js\";\nimport {\n pairKey,\n screeningPairSlot,\n type DeduplicationReviewer,\n} from \"./deduplication-reviewer.js\";\n\nexport interface DeduplicationResult {\n uniqueFindingIds: string[];\n duplicateGroups: string[][];\n deduplicationStatus: \"completed\";\n}\n\nconst severityOrder: Record<Finding[\"severity\"][\"level\"], number> = {\n critical: 0,\n high: 1,\n medium: 2,\n low: 3,\n informational: 4,\n};\n\nfunction scoreAfter(\n left: readonly number[],\n right: readonly number[],\n): boolean {\n for (let index = 0; index < left.length; index++) {\n if (left[index] !== right[index]) return left[index]! > right[index]!;\n }\n return false;\n}\n\n/** @internal */\nexport interface ContradictionGroupingMetrics {\n candidateEvaluations: number;\n conflictNeighborChecks: number;\n}\n\nfunction addSupport(\n support: Map<number, Map<number, number>>,\n left: number,\n right: number,\n): void {\n const leftSupport = support.get(left) ?? new Map<number, number>();\n const rightSupport = support.get(right) ?? new Map<number, number>();\n leftSupport.set(right, (leftSupport.get(right) ?? 0) + 1);\n rightSupport.set(left, (rightSupport.get(left) ?? 0) + 1);\n support.set(left, leftSupport);\n support.set(right, rightSupport);\n}\n\nfunction addConflict(\n conflicts: Map<number, Set<number>>,\n left: number,\n right: number,\n): void {\n const leftConflicts = conflicts.get(left) ?? new Set<number>();\n const rightConflicts = conflicts.get(right) ?? new Set<number>();\n leftConflicts.add(right);\n rightConflicts.add(left);\n conflicts.set(left, leftConflicts);\n conflicts.set(right, rightConflicts);\n}\n\n/** Greedily retain the best-supported legal merges, using input order for ties. */\n/** @internal */\nexport function contradictionFreeSubgroups(\n findingIds: readonly string[],\n samePairs: readonly (readonly [string, string])[],\n distinctPairs: readonly (readonly [string, string])[],\n signal?: AbortSignal,\n metrics?: ContradictionGroupingMetrics,\n): Set<string>[] {\n const indexes = new Map(\n findingIds.map((findingId, index) => [findingId, index]),\n );\n const active = new Set(findingIds.map((_findingId, index) => index));\n const clusters = new Map(\n findingIds.map((findingId, index) => [index, new Set([findingId])]),\n );\n const support = new Map<number, Map<number, number>>();\n for (const [left, right] of samePairs)\n addSupport(support, indexes.get(left)!, indexes.get(right)!);\n const conflicts = new Map<number, Set<number>>();\n for (const [left, right] of distinctPairs)\n addConflict(conflicts, indexes.get(left)!, indexes.get(right)!);\n\n while (true) {\n signal?.throwIfAborted();\n let selected: readonly [number, number] | undefined;\n let selectedScore: readonly number[] | undefined;\n for (const leftCluster of active) {\n for (const [rightCluster, gain] of support.get(leftCluster) ?? []) {\n if (\n leftCluster >= rightCluster ||\n !active.has(rightCluster) ||\n conflicts.get(leftCluster)?.has(rightCluster)\n )\n continue;\n if (metrics) metrics.candidateEvaluations++;\n let newlyBlocked = 0;\n const leftConflicts = conflicts.get(leftCluster);\n const rightConflicts = conflicts.get(rightCluster);\n for (const other of leftConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== rightCluster && !rightConflicts?.has(other))\n newlyBlocked += support.get(rightCluster)?.get(other) ?? 0;\n }\n for (const other of rightConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== leftCluster && !leftConflicts?.has(other))\n newlyBlocked += support.get(leftCluster)?.get(other) ?? 0;\n }\n const score = [\n gain - newlyBlocked,\n gain,\n -newlyBlocked,\n -leftCluster,\n -rightCluster,\n ];\n if (selectedScore === undefined || scoreAfter(score, selectedScore)) {\n selected = [leftCluster, rightCluster];\n selectedScore = score;\n }\n }\n }\n if (selected === undefined)\n return [...active]\n .map((cluster) => clusters.get(cluster)!)\n .filter((members) => members.size > 1);\n const [leftCluster, rightCluster] = selected;\n for (const member of clusters.get(rightCluster)!)\n clusters.get(leftCluster)!.add(member);\n clusters.delete(rightCluster);\n active.delete(rightCluster);\n\n const leftSupport = support.get(leftCluster) ?? new Map<number, number>();\n const rightSupport = support.get(rightCluster) ?? new Map<number, number>();\n const supportNeighbors = new Set([\n ...leftSupport.keys(),\n ...rightSupport.keys(),\n ]);\n supportNeighbors.delete(leftCluster);\n supportNeighbors.delete(rightCluster);\n leftSupport.delete(rightCluster);\n for (const neighbor of supportNeighbors) {\n const weight =\n (leftSupport.get(neighbor) ?? 0) + (rightSupport.get(neighbor) ?? 0);\n leftSupport.set(neighbor, weight);\n const neighborSupport = support.get(neighbor)!;\n neighborSupport.delete(rightCluster);\n neighborSupport.set(leftCluster, weight);\n }\n support.set(leftCluster, leftSupport);\n support.delete(rightCluster);\n\n const mergedConflicts = new Set([\n ...(conflicts.get(leftCluster) ?? []),\n ...(conflicts.get(rightCluster) ?? []),\n ]);\n mergedConflicts.delete(leftCluster);\n mergedConflicts.delete(rightCluster);\n for (const neighbor of mergedConflicts) {\n const neighborConflicts = conflicts.get(neighbor)!;\n neighborConflicts.delete(rightCluster);\n neighborConflicts.add(leftCluster);\n }\n if (mergedConflicts.size > 0) conflicts.set(leftCluster, mergedConflicts);\n else conflicts.delete(leftCluster);\n conflicts.delete(rightCluster);\n }\n}\n\n/** @internal */\nexport class FindingDeduplicator {\n constructor(\n private readonly candidates: {\n potentialDuplicates(findingId: string): Promise<FindingNeighborhood>;\n },\n private readonly reviewer: DeduplicationReviewer,\n private readonly signal?: AbortSignal,\n ) {}\n\n async run(findingIds: readonly string[]): Promise<DeduplicationResult> {\n this.signal?.throwIfAborted();\n const ids = [...new Set(findingIds)];\n const findings = new Map<string, Finding>();\n const nominated = new Map<string, [string, string]>();\n const rejected = new Map<string, [string, string]>();\n for (const id of ids) {\n this.signal?.throwIfAborted();\n const result = await this.candidates.potentialDuplicates(id);\n const neighborhood = [result.finding, ...result.potentialDuplicates];\n for (const finding of neighborhood)\n findings.set(finding.findingId, finding);\n if (neighborhood.length < 2) continue;\n const screening = await this.reviewer.screen(neighborhood);\n for (let index = 0; index < neighborhood.length - 1; index++) {\n const decision = screening.decisions[screeningPairSlot(index)]!;\n const pair: [string, string] = [\n neighborhood[0]!.findingId,\n neighborhood[index + 1]!.findingId,\n ];\n const key = pairKey(pair);\n if (decision.decision === \"SAME\") {\n if (!rejected.has(key)) nominated.set(key, pair);\n } else {\n rejected.set(key, pair);\n nominated.delete(key);\n }\n }\n }\n\n const supported: [string, string][] = [];\n for (const pair of nominated.values()) {\n this.signal?.throwIfAborted();\n const originals = pair.map((id) => findings.get(id)!);\n if ((await this.reviewer.reviewPair(originals)).decision === \"SAME\") {\n supported.push(pair);\n } else {\n rejected.set(pairKey(pair), pair);\n }\n }\n\n const adjacent = new Map<string, Set<string>>();\n for (const pair of supported) {\n for (const [left, right] of [pair, [pair[1], pair[0]]] as const) {\n const neighbors = adjacent.get(left) ?? new Set<string>();\n neighbors.add(right);\n adjacent.set(left, neighbors);\n }\n }\n\n const components: {\n members: string[];\n supported: [string, string][];\n rejected: [string, string][];\n }[] = [];\n const componentByFinding = new Map<string, (typeof components)[number]>();\n for (const id of findings.keys()) {\n this.signal?.throwIfAborted();\n if (!adjacent.has(id) || componentByFinding.has(id)) continue;\n const component: (typeof components)[number] = {\n members: [],\n supported: [],\n rejected: [],\n };\n components.push(component);\n const pending = [id];\n while (pending.length > 0) {\n const member = pending.pop()!;\n if (componentByFinding.has(member)) continue;\n componentByFinding.set(member, component);\n pending.push(...adjacent.get(member)!);\n }\n }\n // Preserve finding insertion order for contradiction-grouping ties.\n for (const id of findings.keys())\n componentByFinding.get(id)?.members.push(id);\n for (const pair of supported)\n componentByFinding.get(pair[0])!.supported.push(pair);\n for (const pair of rejected.values()) {\n const component = componentByFinding.get(pair[0]);\n if (component && component === componentByFinding.get(pair[1]))\n component.rejected.push(pair);\n }\n\n const selected = new Set(ids);\n const duplicateGroups: string[][] = [];\n const canonical = new Map<string, string>();\n for (const component of components) {\n this.signal?.throwIfAborted();\n const groups =\n component.rejected.length === 0\n ? [new Set(component.members)]\n : contradictionFreeSubgroups(\n component.members,\n component.supported,\n component.rejected,\n this.signal,\n );\n for (const group of groups) {\n const groupMembers = [...group];\n if (!groupMembers.some((member) => selected.has(member))) continue;\n groupMembers.sort(\n (left, right) =>\n severityOrder[findings.get(left)!.severity.level] -\n severityOrder[findings.get(right)!.severity.level] ||\n (left < right ? -1 : left > right ? 1 : 0),\n );\n duplicateGroups.push(groupMembers);\n for (const member of groupMembers)\n canonical.set(member, groupMembers[0]!);\n }\n }\n return {\n uniqueFindingIds: [...new Set(ids.map((id) => canonical.get(id) ?? id))],\n duplicateGroups,\n deduplicationStatus: \"completed\",\n };\n }\n}\n"]}
1
+ {"version":3,"file":"deduplication.js","sourceRoot":"","sources":["../../src/deduplication/deduplication.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EACL,OAAO,EACP,iBAAiB,GAElB,MAAM,6BAA6B,CAAC;AAErC,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAE5C,MAAM,UAAU,wBAAwB,CACtC,WAAW,GAAG,0BAA0B;IAExC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC;QACvD,MAAM,IAAI,kBAAkB,CAC1B,8CAA8C,CAC/C,CAAC;IACJ,OAAO,WAAW,CAAC;AACrB,CAAC;AAID,KAAK,UAAU,SAAS,CACtB,OAAc,EACd,KAAY,EACZ,WAAmB,EACnB,MAAoB;IAEpB,IAAI,OAAuC,CAAC;IAC5C,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;QAClC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,UAAU,GAAG,CAAC,GAAQ;YACzB,IAAI,CAAC;gBACH,MAAM,GAAG,EAAE,CAAC;YACd,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,KAAK,EAAE,KAAK,EAAE,CAAC;YACxB,CAAC;oBAAS,CAAC;gBACT,OAAO,EAAE,CAAC;gBACV,IAAI,EAAE,CAAC;YACT,CAAC;QACH,CAAC;QACD,SAAS,IAAI;YACX,OACE,OAAO,KAAK,SAAS;gBACrB,CAAC,MAAM,EAAE,OAAO;gBAChB,OAAO,GAAG,WAAW,EACrB,CAAC;gBACD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC7C,IAAI,GAAG,KAAK,SAAS;oBAAE,MAAM;gBAC7B,OAAO,EAAE,CAAC;gBACV,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;YACD,yEAAyE;YACzE,kEAAkE;YAClE,IAAI,OAAO,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;QAC/B,CAAC;QACD,IAAI,EAAE,CAAC;IACT,CAAC,CAAC,CAAC;IACH,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,OAAO,CAAC,KAAK,CAAC;AACjD,CAAC;AAQD,MAAM,aAAa,GAAiD;IAClE,QAAQ,EAAE,CAAC;IACX,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,GAAG,EAAE,CAAC;IACN,aAAa,EAAE,CAAC;CACjB,CAAC;AAEF,SAAS,UAAU,CACjB,IAAuB,EACvB,KAAwB;IAExB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAE,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;IACxE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD,SAAS,UAAU,CACjB,OAAyC,EACzC,IAAY,EACZ,KAAa;IAEb,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACnE,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;IACrE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAClB,SAAmC,EACnC,IAAY,EACZ,KAAa;IAEb,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IAC/D,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IACjE,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACnC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;AACvC,CAAC;AAED,mFAAmF;AACnF,gBAAgB;AAChB,MAAM,UAAU,0BAA0B,CACxC,UAA6B,EAC7B,SAAiD,EACjD,aAAqD,EACrD,MAAoB,EACpB,OAAsC;IAEtC,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CACzD,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CACpE,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS;QACnC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa;QACvC,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;IAElE,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,IAAI,QAA+C,CAAC;QACpD,IAAI,aAA4C,CAAC;QACjD,KAAK,MAAM,WAAW,IAAI,MAAM,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClE,IACE,WAAW,IAAI,YAAY;oBAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC;oBACzB,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC;oBAE7C,SAAS;gBACX,IAAI,OAAO;oBAAE,OAAO,CAAC,oBAAoB,EAAE,CAAC;gBAC5C,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACjD,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACnD,KAAK,MAAM,KAAK,IAAI,aAAa,IAAI,EAAE,EAAE,CAAC;oBACxC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,YAAY,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,KAAK,CAAC;wBACvD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/D,CAAC;gBACD,KAAK,MAAM,KAAK,IAAI,cAAc,IAAI,EAAE,EAAE,CAAC;oBACzC,IAAI,OAAO;wBAAE,OAAO,CAAC,sBAAsB,EAAE,CAAC;oBAC9C,IAAI,KAAK,KAAK,WAAW,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC;wBACrD,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC9D,CAAC;gBACD,MAAM,KAAK,GAAG;oBACZ,IAAI,GAAG,YAAY;oBACnB,IAAI;oBACJ,CAAC,YAAY;oBACb,CAAC,WAAW;oBACZ,CAAC,YAAY;iBACd,CAAC;gBACF,IAAI,aAAa,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;oBACpE,QAAQ,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;oBACvC,aAAa,GAAG,KAAK,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YACxB,OAAO,CAAC,GAAG,MAAM,CAAC;iBACf,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,GAAG,QAAQ,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAE;YAC9C,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE5B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC1E,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,GAAG,EAAkB,CAAC;QAC5E,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;YAC/B,GAAG,WAAW,CAAC,IAAI,EAAE;YACrB,GAAG,YAAY,CAAC,IAAI,EAAE;SACvB,CAAC,CAAC;QACH,gBAAgB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACrC,gBAAgB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACtC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACjC,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,MAAM,MAAM,GACV,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACvE,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAClC,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YAC/C,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACrC,eAAe,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE7B,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;YAC9B,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YACrC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;SACvC,CAAC,CAAC;QACH,eAAe,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACpC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACrC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,iBAAiB,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YACnD,iBAAiB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACvC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;;YACrE,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACnC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED,gBAAgB;AAChB,MAAM,OAAO,mBAAmB;IAEX;IAGA;IACA;IACA;IANnB,YACmB,UAEhB,EACgB,QAA+B,EAC/B,MAAoB,EACpB,cAAc,0BAA0B;QALxC,eAAU,GAAV,UAAU,CAE1B;QACgB,aAAQ,GAAR,QAAQ,CAAuB;QAC/B,WAAM,GAAN,MAAM,CAAc;QACpB,gBAAW,GAAX,WAAW,CAA6B;IACxD,CAAC;IAEJ,KAAK,CAAC,GAAG,CAAC,UAA6B;QACrC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC5C,MAAM,aAAa,GAAG,IAAI,KAAK,CAAY,GAAG,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,SAAS,CACb,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE;YAChC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC;QACzE,CAAC,CAAC,EACF,EAAE,EACF,WAAW,EACX,IAAI,CAAC,MAAM,CACZ,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAQlB,CAAC;QACJ,yEAAyE;QACzE,6EAA6E;QAC7E,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,KAAK,MAAM,OAAO,IAAI,YAAY;gBAChC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC3C,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7C,MAAM,IAAI,GAAqB;oBAC7B,YAAY,CAAC,CAAC,CAAE,CAAC,SAAS;oBAC1B,QAAQ,CAAC,SAAS;iBACnB,CAAC;gBACF,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC/D,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC;oBACjB,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAU,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,aAAa;aAC1B,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;aACjD,GAAG,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE;YAChC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAC3D,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC7D,MAAM,GAAG,GAAG,OAAO,CAAC;oBAClB,YAAY,CAAC,CAAC,CAAE,CAAC,SAAS;oBAC1B,YAAY,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,SAAS;iBACnC,CAAC,CAAC;gBACH,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBAC9B,IACE,SAAS,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAE,CAAC,QAAQ;oBACvD,UAAU;oBAEV,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;gBACxB,KAAK,CAAC,SAAS,EAAE,CAAC;gBAClB,oEAAoE;gBACpE,kEAAkE;gBAClE,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;oBAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;wBACpB,KAAK,CAAC,QAAQ,GAAG,CACf,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAC5B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CACzC,CACF,CAAC,QAAQ,CAAC;oBACb,CAAC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QACL,MAAM,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAE1D,kDAAkD;QAClD,MAAM,SAAS,GAAuB,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAuB,EAAE,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,KAAK,MAAM;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;;gBACpD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAU,EAAE,CAAC;gBAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBAC1D,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAIV,EAAE,CAAC;QACT,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAuC,CAAC;QAC1E,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9D,MAAM,SAAS,GAAgC;gBAC7C,OAAO,EAAE,EAAE;gBACX,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,EAAE;aACb,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;gBAC9B,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAC7C,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC1C,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,oEAAoE;QACpE,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE;YAC9B,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,SAAS;YAC1B,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,SAAS,IAAI,SAAS,KAAK,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5D,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,eAAe,GAAe,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YAC9B,MAAM,MAAM,GACV,SAAS,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC7B,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC,CAAC,0BAA0B,CACxB,SAAS,CAAC,OAAO,EACjB,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,QAAQ,EAClB,IAAI,CAAC,MAAM,CACZ,CAAC;YACR,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAAE,SAAS;gBACnE,YAAY,CAAC,IAAI,CACf,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAC/C,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;oBACpD,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC7C,CAAC;gBACF,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACnC,KAAK,MAAM,MAAM,IAAI,YAAY;oBAC/B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO;YACL,gBAAgB,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACxE,eAAe;YACf,mBAAmB,EAAE,WAAW;SACjC,CAAC;IACJ,CAAC;CACF","sourcesContent":["import type { Finding } from \"../models.js\";\nimport type { FindingNeighborhood } from \"../finding-retrieval.js\";\nimport { CodexSecurityError } from \"../errors.js\";\nimport {\n pairKey,\n screeningPairSlot,\n type DeduplicationReviewer,\n} from \"./deduplication-reviewer.js\";\n\nexport const DEFAULT_DEDUPE_CONCURRENCY = 8;\n\nexport function deduplicationConcurrency(\n concurrency = DEFAULT_DEDUPE_CONCURRENCY,\n): number {\n if (!Number.isSafeInteger(concurrency) || concurrency < 1)\n throw new CodexSecurityError(\n \"concurrency must be a positive safe integer.\",\n );\n return concurrency;\n}\n\ntype Job = () => Promise<void>;\n\nasync function runQueued(\n pending: Job[],\n ready: Job[],\n concurrency: number,\n signal?: AbortSignal,\n): Promise<void> {\n let failure: { error: unknown } | undefined;\n await new Promise<void>((resolve) => {\n let running = 0;\n async function run(job: Job): Promise<void> {\n try {\n await job();\n } catch (error) {\n failure ??= { error };\n } finally {\n running--;\n pump();\n }\n }\n function pump(): void {\n while (\n failure === undefined &&\n !signal?.aborted &&\n running < concurrency\n ) {\n const job = ready.shift() ?? pending.shift();\n if (job === undefined) break;\n running++;\n void run(job);\n }\n // An active producer can still enqueue work. After failure, drain active\n // jobs so successful reviews can finish saving their checkpoints.\n if (running === 0) resolve();\n }\n pump();\n });\n signal?.throwIfAborted();\n if (failure !== undefined) throw failure.error;\n}\n\nexport interface DeduplicationResult {\n uniqueFindingIds: string[];\n duplicateGroups: string[][];\n deduplicationStatus: \"completed\";\n}\n\nconst severityOrder: Record<Finding[\"severity\"][\"level\"], number> = {\n critical: 0,\n high: 1,\n medium: 2,\n low: 3,\n informational: 4,\n};\n\nfunction scoreAfter(\n left: readonly number[],\n right: readonly number[],\n): boolean {\n for (let index = 0; index < left.length; index++) {\n if (left[index] !== right[index]) return left[index]! > right[index]!;\n }\n return false;\n}\n\n/** @internal */\nexport interface ContradictionGroupingMetrics {\n candidateEvaluations: number;\n conflictNeighborChecks: number;\n}\n\nfunction addSupport(\n support: Map<number, Map<number, number>>,\n left: number,\n right: number,\n): void {\n const leftSupport = support.get(left) ?? new Map<number, number>();\n const rightSupport = support.get(right) ?? new Map<number, number>();\n leftSupport.set(right, (leftSupport.get(right) ?? 0) + 1);\n rightSupport.set(left, (rightSupport.get(left) ?? 0) + 1);\n support.set(left, leftSupport);\n support.set(right, rightSupport);\n}\n\nfunction addConflict(\n conflicts: Map<number, Set<number>>,\n left: number,\n right: number,\n): void {\n const leftConflicts = conflicts.get(left) ?? new Set<number>();\n const rightConflicts = conflicts.get(right) ?? new Set<number>();\n leftConflicts.add(right);\n rightConflicts.add(left);\n conflicts.set(left, leftConflicts);\n conflicts.set(right, rightConflicts);\n}\n\n/** Greedily retain the best-supported legal merges, using input order for ties. */\n/** @internal */\nexport function contradictionFreeSubgroups(\n findingIds: readonly string[],\n samePairs: readonly (readonly [string, string])[],\n distinctPairs: readonly (readonly [string, string])[],\n signal?: AbortSignal,\n metrics?: ContradictionGroupingMetrics,\n): Set<string>[] {\n const indexes = new Map(\n findingIds.map((findingId, index) => [findingId, index]),\n );\n const active = new Set(findingIds.map((_findingId, index) => index));\n const clusters = new Map(\n findingIds.map((findingId, index) => [index, new Set([findingId])]),\n );\n const support = new Map<number, Map<number, number>>();\n for (const [left, right] of samePairs)\n addSupport(support, indexes.get(left)!, indexes.get(right)!);\n const conflicts = new Map<number, Set<number>>();\n for (const [left, right] of distinctPairs)\n addConflict(conflicts, indexes.get(left)!, indexes.get(right)!);\n\n while (true) {\n signal?.throwIfAborted();\n let selected: readonly [number, number] | undefined;\n let selectedScore: readonly number[] | undefined;\n for (const leftCluster of active) {\n for (const [rightCluster, gain] of support.get(leftCluster) ?? []) {\n if (\n leftCluster >= rightCluster ||\n !active.has(rightCluster) ||\n conflicts.get(leftCluster)?.has(rightCluster)\n )\n continue;\n if (metrics) metrics.candidateEvaluations++;\n let newlyBlocked = 0;\n const leftConflicts = conflicts.get(leftCluster);\n const rightConflicts = conflicts.get(rightCluster);\n for (const other of leftConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== rightCluster && !rightConflicts?.has(other))\n newlyBlocked += support.get(rightCluster)?.get(other) ?? 0;\n }\n for (const other of rightConflicts ?? []) {\n if (metrics) metrics.conflictNeighborChecks++;\n if (other !== leftCluster && !leftConflicts?.has(other))\n newlyBlocked += support.get(leftCluster)?.get(other) ?? 0;\n }\n const score = [\n gain - newlyBlocked,\n gain,\n -newlyBlocked,\n -leftCluster,\n -rightCluster,\n ];\n if (selectedScore === undefined || scoreAfter(score, selectedScore)) {\n selected = [leftCluster, rightCluster];\n selectedScore = score;\n }\n }\n }\n if (selected === undefined)\n return [...active]\n .map((cluster) => clusters.get(cluster)!)\n .filter((members) => members.size > 1);\n const [leftCluster, rightCluster] = selected;\n for (const member of clusters.get(rightCluster)!)\n clusters.get(leftCluster)!.add(member);\n clusters.delete(rightCluster);\n active.delete(rightCluster);\n\n const leftSupport = support.get(leftCluster) ?? new Map<number, number>();\n const rightSupport = support.get(rightCluster) ?? new Map<number, number>();\n const supportNeighbors = new Set([\n ...leftSupport.keys(),\n ...rightSupport.keys(),\n ]);\n supportNeighbors.delete(leftCluster);\n supportNeighbors.delete(rightCluster);\n leftSupport.delete(rightCluster);\n for (const neighbor of supportNeighbors) {\n const weight =\n (leftSupport.get(neighbor) ?? 0) + (rightSupport.get(neighbor) ?? 0);\n leftSupport.set(neighbor, weight);\n const neighborSupport = support.get(neighbor)!;\n neighborSupport.delete(rightCluster);\n neighborSupport.set(leftCluster, weight);\n }\n support.set(leftCluster, leftSupport);\n support.delete(rightCluster);\n\n const mergedConflicts = new Set([\n ...(conflicts.get(leftCluster) ?? []),\n ...(conflicts.get(rightCluster) ?? []),\n ]);\n mergedConflicts.delete(leftCluster);\n mergedConflicts.delete(rightCluster);\n for (const neighbor of mergedConflicts) {\n const neighborConflicts = conflicts.get(neighbor)!;\n neighborConflicts.delete(rightCluster);\n neighborConflicts.add(leftCluster);\n }\n if (mergedConflicts.size > 0) conflicts.set(leftCluster, mergedConflicts);\n else conflicts.delete(leftCluster);\n conflicts.delete(rightCluster);\n }\n}\n\n/** @internal */\nexport class FindingDeduplicator {\n constructor(\n private readonly candidates: {\n potentialDuplicates(findingId: string): Promise<FindingNeighborhood>;\n },\n private readonly reviewer: DeduplicationReviewer,\n private readonly signal?: AbortSignal,\n private readonly concurrency = DEFAULT_DEDUPE_CONCURRENCY,\n ) {}\n\n async run(findingIds: readonly string[]): Promise<DeduplicationResult> {\n this.signal?.throwIfAborted();\n const concurrency = deduplicationConcurrency(this.concurrency);\n const ids = [...new Set(findingIds)];\n const findings = new Map<string, Finding>();\n const neighborhoods = new Array<Finding[]>(ids.length);\n await runQueued(\n ids.map((id, index) => async () => {\n const result = await this.candidates.potentialDuplicates(id);\n this.signal?.throwIfAborted();\n neighborhoods[index] = [result.finding, ...result.potentialDuplicates];\n }),\n [],\n concurrency,\n this.signal,\n );\n const pairs = new Map<\n string,\n {\n ids: [string, string];\n remaining: number;\n rejected: boolean;\n decision?: \"SAME\" | \"DISTINCT\";\n }\n >();\n // Freeze records, insertion order, and the last nominating anchor's pair\n // orientation before reviews run, preserving grouping and checkpoint inputs.\n for (const neighborhood of neighborhoods) {\n this.signal?.throwIfAborted();\n for (const finding of neighborhood)\n findings.set(finding.findingId, finding);\n for (const neighbor of neighborhood.slice(1)) {\n const pair: [string, string] = [\n neighborhood[0]!.findingId,\n neighbor.findingId,\n ];\n const key = pairKey(pair);\n const state = pairs.get(key);\n if (state === undefined) {\n pairs.set(key, { ids: pair, remaining: 1, rejected: false });\n } else {\n state.ids = pair;\n state.remaining++;\n }\n }\n }\n\n const ready: Job[] = [];\n const pending = neighborhoods\n .filter((neighborhood) => neighborhood.length > 1)\n .map((neighborhood) => async () => {\n const screening = await this.reviewer.screen(neighborhood);\n this.signal?.throwIfAborted();\n for (let index = 0; index < neighborhood.length - 1; index++) {\n const key = pairKey([\n neighborhood[0]!.findingId,\n neighborhood[index + 1]!.findingId,\n ]);\n const state = pairs.get(key)!;\n if (\n screening.decisions[screeningPairSlot(index)]!.decision ===\n \"DISTINCT\"\n )\n state.rejected = true;\n state.remaining--;\n // Wait for every screening of this pair: a later DISTINCT veto must\n // prevent verification, including a verification that could fail.\n if (state.remaining === 0 && !state.rejected) {\n ready.push(async () => {\n state.decision = (\n await this.reviewer.reviewPair(\n state.ids.map((id) => findings.get(id)!),\n )\n ).decision;\n });\n }\n }\n });\n await runQueued(pending, ready, concurrency, this.signal);\n\n // Completion order must not change grouping ties.\n const supported: [string, string][] = [];\n const rejected: [string, string][] = [];\n for (const state of pairs.values()) {\n this.signal?.throwIfAborted();\n if (state.decision === \"SAME\") supported.push(state.ids);\n else rejected.push(state.ids);\n }\n\n const adjacent = new Map<string, Set<string>>();\n for (const pair of supported) {\n for (const [left, right] of [pair, [pair[1], pair[0]]] as const) {\n const neighbors = adjacent.get(left) ?? new Set<string>();\n neighbors.add(right);\n adjacent.set(left, neighbors);\n }\n }\n\n const components: {\n members: string[];\n supported: [string, string][];\n rejected: [string, string][];\n }[] = [];\n const componentByFinding = new Map<string, (typeof components)[number]>();\n for (const id of findings.keys()) {\n this.signal?.throwIfAborted();\n if (!adjacent.has(id) || componentByFinding.has(id)) continue;\n const component: (typeof components)[number] = {\n members: [],\n supported: [],\n rejected: [],\n };\n components.push(component);\n const pending = [id];\n while (pending.length > 0) {\n const member = pending.pop()!;\n if (componentByFinding.has(member)) continue;\n componentByFinding.set(member, component);\n pending.push(...adjacent.get(member)!);\n }\n }\n // Preserve finding insertion order for contradiction-grouping ties.\n for (const id of findings.keys())\n componentByFinding.get(id)?.members.push(id);\n for (const pair of supported)\n componentByFinding.get(pair[0])!.supported.push(pair);\n for (const pair of rejected) {\n const component = componentByFinding.get(pair[0]);\n if (component && component === componentByFinding.get(pair[1]))\n component.rejected.push(pair);\n }\n\n const selected = new Set(ids);\n const duplicateGroups: string[][] = [];\n const canonical = new Map<string, string>();\n for (const component of components) {\n this.signal?.throwIfAborted();\n const groups =\n component.rejected.length === 0\n ? [new Set(component.members)]\n : contradictionFreeSubgroups(\n component.members,\n component.supported,\n component.rejected,\n this.signal,\n );\n for (const group of groups) {\n const groupMembers = [...group];\n if (!groupMembers.some((member) => selected.has(member))) continue;\n groupMembers.sort(\n (left, right) =>\n severityOrder[findings.get(left)!.severity.level] -\n severityOrder[findings.get(right)!.severity.level] ||\n (left < right ? -1 : left > right ? 1 : 0),\n );\n duplicateGroups.push(groupMembers);\n for (const member of groupMembers)\n canonical.set(member, groupMembers[0]!);\n }\n }\n return {\n uniqueFindingIds: [...new Set(ids.map((id) => canonical.get(id) ?? id))],\n duplicateGroups,\n deduplicationStatus: \"completed\",\n };\n }\n}\n"]}
@@ -0,0 +1,3 @@
1
+ export declare function retryDelay(attempt: number, random?: () => number): number;
2
+ export declare function waitForRetry(delayMs: number, signal?: AbortSignal): Promise<void>;
3
+ //# sourceMappingURL=retry.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"retry.d.ts","sourceRoot":"","sources":["../../src/deduplication/retry.ts"],"names":[],"mappings":"AAEA,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,eAAc,GAAG,MAAM,CAExE;AAED,wBAAsB,YAAY,CAChC,OAAO,EAAE,MAAM,EACf,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,IAAI,CAAC,CAQf"}
@@ -0,0 +1,15 @@
1
+ import { setTimeout } from "node:timers/promises";
2
+ export function retryDelay(attempt, random = Math.random) {
3
+ return 1_000 * 2 ** (attempt - 1) * (1 + random());
4
+ }
5
+ export async function waitForRetry(delayMs, signal) {
6
+ signal?.throwIfAborted();
7
+ try {
8
+ await setTimeout(delayMs, undefined, { signal });
9
+ }
10
+ catch (error) {
11
+ signal?.throwIfAborted();
12
+ throw error;
13
+ }
14
+ }
15
+ //# sourceMappingURL=retry.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"retry.js","sourceRoot":"","sources":["../../src/deduplication/retry.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAElD,MAAM,UAAU,UAAU,CAAC,OAAe,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM;IAC9D,OAAO,KAAK,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,OAAe,EACf,MAAoB;IAEpB,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,IAAI,CAAC;QACH,MAAM,UAAU,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;IACnD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC","sourcesContent":["import { setTimeout } from \"node:timers/promises\";\n\nexport function retryDelay(attempt: number, random = Math.random): number {\n return 1_000 * 2 ** (attempt - 1) * (1 + random());\n}\n\nexport async function waitForRetry(\n delayMs: number,\n signal?: AbortSignal,\n): Promise<void> {\n signal?.throwIfAborted();\n try {\n await setTimeout(delayMs, undefined, { signal });\n } catch (error) {\n signal?.throwIfAborted();\n throw error;\n }\n}\n"]}
@@ -6,6 +6,8 @@ export interface DeduplicateScanOptions {
6
6
  findingsUrl: string;
7
7
  /** Search all repositories instead of the scan's targetId. Defaults to false. */
8
8
  allRepositories?: boolean;
9
+ /** Shared concurrency limit for deduplication jobs. Defaults to 8. */
10
+ concurrency?: number;
9
11
  signal?: AbortSignal;
10
12
  }
11
13
  export interface DeduplicateScanDirectoryOptions extends DeduplicateScanOptions {
@@ -1 +1 @@
1
- {"version":3,"file":"scan.d.ts","sourceRoot":"","sources":["../../src/deduplication/scan.ts"],"names":[],"mappings":"AAYA,OAAO,EAEL,KAAK,mBAAmB,EACzB,MAAM,oBAAoB,CAAC;AAmB5B,MAAM,WAAW,sBAAsB;IACrC,8EAA8E;IAC9E,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gFAAgF;IAChF,WAAW,EAAE,MAAM,CAAC;IACpB,iFAAiF;IACjF,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,+BACf,SAAQ,sBAAsB;IAC9B,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IACnB,2DAA2D;IAC3D,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,qBAAsB,SAAQ,mBAAmB;IAChE,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,8FAA8F;AAC9F,wBAAsB,eAAe,CACnC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,sBAAsB,GAC9B,OAAO,CAAC,qBAAqB,CAAC,CAEhC;AAED,qFAAqF;AACrF,wBAAsB,wBAAwB,CAC5C,aAAa,EAAE,MAAM,EACrB,OAAO,EAAE,+BAA+B,GACvC,OAAO,CAAC,qBAAqB,CAAC,CAEhC"}
1
+ {"version":3,"file":"scan.d.ts","sourceRoot":"","sources":["../../src/deduplication/scan.ts"],"names":[],"mappings":"AAYA,OAAO,EAGL,KAAK,mBAAmB,EACzB,MAAM,oBAAoB,CAAC;AAmB5B,MAAM,WAAW,sBAAsB;IACrC,8EAA8E;IAC9E,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gFAAgF;IAChF,WAAW,EAAE,MAAM,CAAC;IACpB,iFAAiF;IACjF,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,sEAAsE;IACtE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,+BACf,SAAQ,sBAAsB;IAC9B,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IACnB,2DAA2D;IAC3D,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,qBAAsB,SAAQ,mBAAmB;IAChE,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,8FAA8F;AAC9F,wBAAsB,eAAe,CACnC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,sBAAsB,GAC9B,OAAO,CAAC,qBAAqB,CAAC,CAEhC;AAED,qFAAqF;AACrF,wBAAsB,wBAAwB,CAC5C,aAAa,EAAE,MAAM,EACrB,OAAO,EAAE,+BAA+B,GACvC,OAAO,CAAC,qBAAqB,CAAC,CAEhC"}
@@ -2,7 +2,7 @@ import { loadContractWithScanDirectory } from "../contract.js";
2
2
  import { bundledPluginRoot, codexSecurityStateDirectory, resolvePluginPython, runWorkbench, } from "../runtime.js";
3
3
  import { resolveCompletedScan, } from "../saved-scan.js";
4
4
  import { CodexReviewRunner } from "./codex-review.js";
5
- import { FindingDeduplicator, } from "./deduplication.js";
5
+ import { FindingDeduplicator, deduplicationConcurrency, } from "./deduplication.js";
6
6
  import { CodexDeduplicationReviewer, } from "./deduplication-reviewer.js";
7
7
  import { FindingsClient } from "../findings-client.js";
8
8
  import { FindingWorkflow, workflowDestination, workflowDigest, } from "../finding-workflow.js";
@@ -20,12 +20,14 @@ export async function deduplicateScanDirectory(scanDirectory, options) {
20
20
  /** @internal */
21
21
  export async function deduplicateScanDirectoryInternal(scanDirectory, options, dependencies = {}) {
22
22
  options.signal?.throwIfAborted();
23
+ deduplicationConcurrency(options.concurrency);
23
24
  const repository = await normalizeRepository(options.repository, options.signal);
24
25
  return await deduplicateResolvedScan(scanDirectory, repository, options.expectedScanId, options, dependencies, await bundledPluginRoot(), true);
25
26
  }
26
27
  /** @internal */
27
28
  export async function deduplicateScanInternal(scanId, options, dependencies = {}) {
28
29
  options.signal?.throwIfAborted();
30
+ deduplicationConcurrency(options.concurrency);
29
31
  const environment = dependencies.environment ?? process.env;
30
32
  const pluginRoot = await bundledPluginRoot();
31
33
  const scan = await resolveCompletedScan(scanId, {
@@ -104,7 +106,7 @@ async function deduplicateResolvedScan(selectedDirectory, repositoryPath, expect
104
106
  const deduplicator = new FindingDeduplicator({
105
107
  potentialDuplicates: (findingId) => client.potentialDuplicates(findingId, scope),
106
108
  }, dependencies.reviewer ??
107
- new CodexDeduplicationReviewer(checkpoints ?? runner), options.signal);
109
+ new CodexDeduplicationReviewer(checkpoints ?? runner), options.signal, options.concurrency);
108
110
  const reviewed = await deduplicator.run(contract.findings.findings.map((finding) => finding.findingId));
109
111
  await checkpoints?.assertSourceUnchanged();
110
112
  options.signal?.throwIfAborted();
@@ -1 +1 @@
1
- {"version":3,"file":"scan.js","sourceRoot":"","sources":["../../src/deduplication/scan.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,6BAA6B,EAAE,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EACL,iBAAiB,EACjB,2BAA2B,EAC3B,mBAAmB,EACnB,YAAY,GACb,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,oBAAoB,GAErB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EACL,mBAAmB,GAEpB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,0BAA0B,GAE3B,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,cAAc,EAAwB,MAAM,uBAAuB,CAAC;AAE7E,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,cAAc,GACf,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,2BAA2B,EAAE,MAAM,sBAAsB,CAAC;AACnE,OAAO,EACL,wBAAwB,EACxB,oBAAoB,GACrB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AAwBpD,8FAA8F;AAC9F,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAc,EACd,OAA+B;IAE/B,OAAO,MAAM,uBAAuB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AACxD,CAAC;AAED,qFAAqF;AACrF,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,aAAqB,EACrB,OAAwC;IAExC,OAAO,MAAM,gCAAgC,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;AACxE,CAAC;AASD,gBAAgB;AAChB,MAAM,CAAC,KAAK,UAAU,gCAAgC,CACpD,aAAqB,EACrB,OAAwC,EACxC,eAA4C,EAAE;IAE9C,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,UAAU,GAAG,MAAM,mBAAmB,CAC1C,OAAO,CAAC,UAAU,EAClB,OAAO,CAAC,MAAM,CACf,CAAC;IACF,OAAO,MAAM,uBAAuB,CAClC,aAAa,EACb,UAAU,EACV,OAAO,CAAC,cAAc,EACtB,OAAO,EACP,YAAY,EACZ,MAAM,iBAAiB,EAAE,EACzB,IAAI,CACL,CAAC;AACJ,CAAC;AAED,gBAAgB;AAChB,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,MAAc,EACd,OAA+B,EAC/B,eAA4C,EAAE;IAE9C,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,WAAW,GAAG,YAAY,CAAC,WAAW,IAAI,OAAO,CAAC,GAAG,CAAC;IAC5D,MAAM,UAAU,GAAG,MAAM,iBAAiB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,MAAM,oBAAoB,CAAC,MAAM,EAAE;QAC9C,gBAAgB,EAAE,YAAY,CAAC,gBAAgB,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACxE,YAAY,EACV,YAAY,CAAC,YAAY;YACzB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;gBACd,MAAM,gBAAgB,GAAG;oBACvB,GAAG,WAAW;oBACd,wBAAwB,EAAE,2BAA2B,CAAC,WAAW,CAAC;iBACnE,CAAC;gBACF,OAAO,MAAM,YAAY,CACvB;oBACE,WAAW,EAAE,gBAAgB;oBAC7B,UAAU;oBACV,MAAM,EAAE,MAAM,mBAAmB,CAAC;wBAChC,WAAW,EAAE,gBAAgB;qBAC9B,CAAC;oBACF,MAAM,EAAE,OAAO,CAAC,MAAM;oBACtB,cAAc,EAAE,4CAA4C;iBAC7D,EACD,IAAI,CACL,CAAC;YACJ,CAAC,CAAC;KACL,CAAC,CAAC;IACH,OAAO,MAAM,uBAAuB,CAClC,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,YAAY,CAAW,EAC5B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,YAAY,EACZ,UAAU,EACV,KAAK,CACN,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,uBAAuB,CACpC,iBAAyB,EACzB,cAAsB,EACtB,cAAkC,EAClC,OAA+B,EAC/B,YAAyC,EACzC,UAAkB,EAClB,cAAuB;IAEvB,MAAM,WAAW,GAAG,YAAY,CAAC,WAAW,IAAI,OAAO,CAAC,GAAG,CAAC;IAC5D,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,MAAM,6BAA6B,CACrE,iBAAiB,EACjB;QACE,UAAU;QACV,cAAc;QACd,MAAM,EAAE,OAAO,CAAC,MAAM;KACvB,CACF,CAAC;IACF,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,cAAc,CAC/B,OAAO,CAAC,WAAW,EACnB,OAAO,CAAC,MAAM,EACd,YAAY,CAAC,KAAK,CACnB,CAAC;IACF,MAAM,KAAK,GACT,OAAO,CAAC,eAAe,KAAK,IAAI;QAC9B,CAAC,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE;QAC3B,CAAC,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC/D,MAAM,QAAQ,GACZ,OAAO,CAAC,UAAU,KAAK,SAAS;QAC9B,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,IAAI,eAAe,CACjB,OAAO,CAAC,UAAU,EAClB,WAAW,EACX,YAAY,CAAC,YAAY,KAAK,SAAS;YACrC,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,CACxB,YAAY,CAAC,YAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAC9C,CAAC;IACR,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,QAAQ,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC;QAC/C,MAAM,QAAQ,CAAC,IAAI,CAAC;YAClB,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7C,MAAM;YACN,OAAO,EAAE,aAAa;YACtB,cAAc,EAAE,cAAc,CAAC,QAAQ,CAAC;YACxC,WAAW,EAAE,mBAAmB,CAAC,OAAO,CAAC,WAAW,CAAC;YACrD,KAAK;SACN,CAAC,CAAC;QACH,MAAM,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACtC,MAAM,2BAA2B,CAC/B,aAAa,EACb;YACE,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,cAAc,EAAE,MAAM;YACtB,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,EACD;YACE,WAAW;YACX,KAAK,EAAE,YAAY,CAAC,KAAK;YACzB,YAAY,EACV,YAAY,CAAC,YAAY,KAAK,SAAS;gBACrC,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,CACxB,YAAY,CAAC,YAAa,CAAC,IAAI,EAAE,KAAK,CAAC;SAChD,CACF,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,IAAoC,EAAE;QACxD,MAAM,KAAK,GAAG,CAAC,MAAM,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC;QACrD,IAAI,KAAK,EAAE,YAAY,EAAE,CAAC;YACxB,MAAM,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1D,OAAO,KAAK,CAAC,MAA+B,CAAC;QAC/C,CAAC;QACD,MAAM,MAAM,GACV,YAAY,CAAC,YAAY;YACzB,IAAI,iBAAiB,CACnB,WAAW,EACX,SAAS,EACT,OAAO,CAAC,MAAM,EACd,cAAc,CACf,CAAC;QACJ,MAAM,WAAW,GAAG,QAAQ;YAC1B,CAAC,CAAC,IAAI,wBAAwB,CAC1B,QAAQ,EACR,MAAM,EACN,MAAM,QAAQ,CAAC,cAAc,CAAC,cAAc,CAAC,EAC7C,KAAK,EACL,MAAM,oBAAoB,CAAC,WAAW,CAAC,CACxC;YACH,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,YAAY,GAAG,IAAI,mBAAmB,CAC1C;YACE,mBAAmB,EAAE,CAAC,SAAS,EAAE,EAAE,CACjC,MAAM,CAAC,mBAAmB,CAAC,SAAS,EAAE,KAAK,CAAC;SAC/C,EACD,YAAY,CAAC,QAAQ;YACnB,IAAI,0BAA0B,CAAC,WAAW,IAAI,MAAM,CAAC,EACvD,OAAO,CAAC,MAAM,CACf,CAAC;QACF,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,GAAG,CACrC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAC/D,CAAC;QACF,MAAM,WAAW,EAAE,qBAAqB,EAAE,CAAC;QAC3C,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QACjC,MAAM,MAAM,GAA0B,EAAE,MAAM,EAAE,GAAG,QAAQ,EAAE,CAAC;QAC9D,MAAM,QAAQ,EAAE,aAAa,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC;QAC1E,MAAM,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IACF,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,CAAC;AAC1E,CAAC","sourcesContent":["import { loadContractWithScanDirectory } from \"../contract.js\";\nimport {\n bundledPluginRoot,\n codexSecurityStateDirectory,\n resolvePluginPython,\n runWorkbench,\n} from \"../runtime.js\";\nimport {\n resolveCompletedScan,\n type SavedScanDependencies,\n} from \"../saved-scan.js\";\nimport { CodexReviewRunner } from \"./codex-review.js\";\nimport {\n FindingDeduplicator,\n type DeduplicationResult,\n} from \"./deduplication.js\";\nimport {\n CodexDeduplicationReviewer,\n type DeduplicationReviewer,\n} from \"./deduplication-reviewer.js\";\nimport { FindingsClient, type FindingsRequest } from \"../findings-client.js\";\nimport type { FindingSearchScope } from \"../finding-retrieval.js\";\nimport {\n FindingWorkflow,\n workflowDestination,\n workflowDigest,\n} from \"../finding-workflow.js\";\nimport { publishScanToCustomInternal } from \"../custom-publish.js\";\nimport {\n CheckpointedReviewRunner,\n reviewSettingsDigest,\n} from \"./checkpointed-review.js\";\nimport { normalizeRepository } from \"../targets.js\";\n\nexport interface DeduplicateScanOptions {\n /** Resume the named local findings workflow, including custom publication. */\n workflowId?: string;\n /** Findings API base URL. The scan's findings must already be indexed there. */\n findingsUrl: string;\n /** Search all repositories instead of the scan's targetId. Defaults to false. */\n allRepositories?: boolean;\n signal?: AbortSignal;\n}\n\nexport interface DeduplicateScanDirectoryOptions\n extends DeduplicateScanOptions {\n /** Local repository checkout used to review duplicate candidates. */\n repository: string;\n /** Require the sealed artifacts to belong to this scan. */\n expectedScanId?: string;\n}\n\nexport interface DeduplicateScanResult extends DeduplicationResult {\n scanId: string;\n}\n\n/** Review a saved scan against embedding candidates and persist accepted duplicate groups. */\nexport async function deduplicateScan(\n scanId: string,\n options: DeduplicateScanOptions,\n): Promise<DeduplicateScanResult> {\n return await deduplicateScanInternal(scanId, options);\n}\n\n/** Review a complete, sealed scan directory without resolving local scan history. */\nexport async function deduplicateScanDirectory(\n scanDirectory: string,\n options: DeduplicateScanDirectoryOptions,\n): Promise<DeduplicateScanResult> {\n return await deduplicateScanDirectoryInternal(scanDirectory, options);\n}\n\ntype DeduplicateScanDependencies = Partial<SavedScanDependencies> & {\n environment?: NodeJS.ProcessEnv;\n reviewer?: DeduplicationReviewer;\n reviewRunner?: Pick<CodexReviewRunner, \"run\">;\n fetch?: FindingsRequest;\n};\n\n/** @internal */\nexport async function deduplicateScanDirectoryInternal(\n scanDirectory: string,\n options: DeduplicateScanDirectoryOptions,\n dependencies: DeduplicateScanDependencies = {},\n): Promise<DeduplicateScanResult> {\n options.signal?.throwIfAborted();\n const repository = await normalizeRepository(\n options.repository,\n options.signal,\n );\n return await deduplicateResolvedScan(\n scanDirectory,\n repository,\n options.expectedScanId,\n options,\n dependencies,\n await bundledPluginRoot(),\n true,\n );\n}\n\n/** @internal */\nexport async function deduplicateScanInternal(\n scanId: string,\n options: DeduplicateScanOptions,\n dependencies: DeduplicateScanDependencies = {},\n): Promise<DeduplicateScanResult> {\n options.signal?.throwIfAborted();\n const environment = dependencies.environment ?? process.env;\n const pluginRoot = await bundledPluginRoot();\n const scan = await resolveCompletedScan(scanId, {\n currentDirectory: dependencies.currentDirectory ?? (() => process.cwd()),\n runWorkbench:\n dependencies.runWorkbench ??\n (async (args) => {\n const stateEnvironment = {\n ...environment,\n CODEX_SECURITY_STATE_DIR: codexSecurityStateDirectory(environment),\n };\n return await runWorkbench(\n {\n environment: stateEnvironment,\n pluginRoot,\n python: await resolvePluginPython({\n environment: stateEnvironment,\n }),\n signal: options.signal,\n failureMessage: \"Could not read Codex Security scan history\",\n },\n args,\n );\n }),\n });\n return await deduplicateResolvedScan(\n scan.scanDir,\n scan[\"targetPath\"] as string,\n scan.scanId,\n options,\n dependencies,\n pluginRoot,\n false,\n );\n}\n\nasync function deduplicateResolvedScan(\n selectedDirectory: string,\n repositoryPath: string,\n expectedScanId: string | undefined,\n options: DeduplicateScanOptions,\n dependencies: DeduplicateScanDependencies,\n pluginRoot: string,\n bindRepository: boolean,\n): Promise<DeduplicateScanResult> {\n const environment = dependencies.environment ?? process.env;\n const { contract, scanDirectory } = await loadContractWithScanDirectory(\n selectedDirectory,\n {\n pluginRoot,\n expectedScanId,\n signal: options.signal,\n },\n );\n const scanId = contract.manifest.scan.id;\n const client = new FindingsClient(\n options.findingsUrl,\n options.signal,\n dependencies.fetch,\n );\n const scope: FindingSearchScope =\n options.allRepositories === true\n ? { allRepositories: true }\n : { repositoryId: contract.manifest.scan.target.targetId };\n const workflow =\n options.workflowId === undefined\n ? undefined\n : new FindingWorkflow(\n options.workflowId,\n environment,\n dependencies.runWorkbench === undefined\n ? undefined\n : (_options, args, input) =>\n dependencies.runWorkbench!(args, input),\n );\n if (workflow) {\n await workflow.protectArtifacts(scanDirectory);\n await workflow.bind({\n ...(bindRepository ? { repositoryPath } : {}),\n scanId,\n scanDir: scanDirectory,\n artifactDigest: workflowDigest(contract),\n destination: workflowDestination(options.findingsUrl),\n scope,\n });\n await workflow.complete(\"scan\", null);\n await publishScanToCustomInternal(\n scanDirectory,\n {\n findingsUrl: options.findingsUrl,\n workflowId: options.workflowId,\n expectedScanId: scanId,\n signal: options.signal,\n },\n {\n environment,\n fetch: dependencies.fetch,\n runWorkbench:\n dependencies.runWorkbench === undefined\n ? undefined\n : (_options, args, input) =>\n dependencies.runWorkbench!(args, input),\n },\n );\n }\n const dedupe = async (): Promise<DeduplicateScanResult> => {\n const saved = (await workflow?.get())?.stages.dedupe;\n if (saved?.pendingWrite) {\n await client.storeDedupeGroups(saved.pendingWrite.groups);\n return saved.result as DeduplicateScanResult;\n }\n const runner =\n dependencies.reviewRunner ??\n new CodexReviewRunner(\n environment,\n undefined,\n options.signal,\n repositoryPath,\n );\n const checkpoints = workflow\n ? new CheckpointedReviewRunner(\n workflow,\n runner,\n await workflow.sourceSnapshot(repositoryPath),\n scope,\n await reviewSettingsDigest(environment),\n )\n : undefined;\n const deduplicator = new FindingDeduplicator(\n {\n potentialDuplicates: (findingId) =>\n client.potentialDuplicates(findingId, scope),\n },\n dependencies.reviewer ??\n new CodexDeduplicationReviewer(checkpoints ?? runner),\n options.signal,\n );\n const reviewed = await deduplicator.run(\n contract.findings.findings.map((finding) => finding.findingId),\n );\n await checkpoints?.assertSourceUnchanged();\n options.signal?.throwIfAborted();\n const result: DeduplicateScanResult = { scanId, ...reviewed };\n await workflow?.prepareDedupe(result, { groups: result.duplicateGroups });\n await client.storeDedupeGroups(result.duplicateGroups);\n return result;\n };\n return workflow ? await workflow.run(\"dedupe\", dedupe) : await dedupe();\n}\n"]}
1
+ {"version":3,"file":"scan.js","sourceRoot":"","sources":["../../src/deduplication/scan.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,6BAA6B,EAAE,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EACL,iBAAiB,EACjB,2BAA2B,EAC3B,mBAAmB,EACnB,YAAY,GACb,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,oBAAoB,GAErB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EACL,mBAAmB,EACnB,wBAAwB,GAEzB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,0BAA0B,GAE3B,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,cAAc,EAAwB,MAAM,uBAAuB,CAAC;AAE7E,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,cAAc,GACf,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,2BAA2B,EAAE,MAAM,sBAAsB,CAAC;AACnE,OAAO,EACL,wBAAwB,EACxB,oBAAoB,GACrB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAC;AA0BpD,8FAA8F;AAC9F,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAc,EACd,OAA+B;IAE/B,OAAO,MAAM,uBAAuB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AACxD,CAAC;AAED,qFAAqF;AACrF,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,aAAqB,EACrB,OAAwC;IAExC,OAAO,MAAM,gCAAgC,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;AACxE,CAAC;AASD,gBAAgB;AAChB,MAAM,CAAC,KAAK,UAAU,gCAAgC,CACpD,aAAqB,EACrB,OAAwC,EACxC,eAA4C,EAAE;IAE9C,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,wBAAwB,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC9C,MAAM,UAAU,GAAG,MAAM,mBAAmB,CAC1C,OAAO,CAAC,UAAU,EAClB,OAAO,CAAC,MAAM,CACf,CAAC;IACF,OAAO,MAAM,uBAAuB,CAClC,aAAa,EACb,UAAU,EACV,OAAO,CAAC,cAAc,EACtB,OAAO,EACP,YAAY,EACZ,MAAM,iBAAiB,EAAE,EACzB,IAAI,CACL,CAAC;AACJ,CAAC;AAED,gBAAgB;AAChB,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,MAAc,EACd,OAA+B,EAC/B,eAA4C,EAAE;IAE9C,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,wBAAwB,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC9C,MAAM,WAAW,GAAG,YAAY,CAAC,WAAW,IAAI,OAAO,CAAC,GAAG,CAAC;IAC5D,MAAM,UAAU,GAAG,MAAM,iBAAiB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,MAAM,oBAAoB,CAAC,MAAM,EAAE;QAC9C,gBAAgB,EAAE,YAAY,CAAC,gBAAgB,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACxE,YAAY,EACV,YAAY,CAAC,YAAY;YACzB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;gBACd,MAAM,gBAAgB,GAAG;oBACvB,GAAG,WAAW;oBACd,wBAAwB,EAAE,2BAA2B,CAAC,WAAW,CAAC;iBACnE,CAAC;gBACF,OAAO,MAAM,YAAY,CACvB;oBACE,WAAW,EAAE,gBAAgB;oBAC7B,UAAU;oBACV,MAAM,EAAE,MAAM,mBAAmB,CAAC;wBAChC,WAAW,EAAE,gBAAgB;qBAC9B,CAAC;oBACF,MAAM,EAAE,OAAO,CAAC,MAAM;oBACtB,cAAc,EAAE,4CAA4C;iBAC7D,EACD,IAAI,CACL,CAAC;YACJ,CAAC,CAAC;KACL,CAAC,CAAC;IACH,OAAO,MAAM,uBAAuB,CAClC,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,YAAY,CAAW,EAC5B,IAAI,CAAC,MAAM,EACX,OAAO,EACP,YAAY,EACZ,UAAU,EACV,KAAK,CACN,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,uBAAuB,CACpC,iBAAyB,EACzB,cAAsB,EACtB,cAAkC,EAClC,OAA+B,EAC/B,YAAyC,EACzC,UAAkB,EAClB,cAAuB;IAEvB,MAAM,WAAW,GAAG,YAAY,CAAC,WAAW,IAAI,OAAO,CAAC,GAAG,CAAC;IAC5D,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,MAAM,6BAA6B,CACrE,iBAAiB,EACjB;QACE,UAAU;QACV,cAAc;QACd,MAAM,EAAE,OAAO,CAAC,MAAM;KACvB,CACF,CAAC;IACF,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,cAAc,CAC/B,OAAO,CAAC,WAAW,EACnB,OAAO,CAAC,MAAM,EACd,YAAY,CAAC,KAAK,CACnB,CAAC;IACF,MAAM,KAAK,GACT,OAAO,CAAC,eAAe,KAAK,IAAI;QAC9B,CAAC,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE;QAC3B,CAAC,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC/D,MAAM,QAAQ,GACZ,OAAO,CAAC,UAAU,KAAK,SAAS;QAC9B,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,IAAI,eAAe,CACjB,OAAO,CAAC,UAAU,EAClB,WAAW,EACX,YAAY,CAAC,YAAY,KAAK,SAAS;YACrC,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,CACxB,YAAY,CAAC,YAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAC9C,CAAC;IACR,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,QAAQ,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC;QAC/C,MAAM,QAAQ,CAAC,IAAI,CAAC;YAClB,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7C,MAAM;YACN,OAAO,EAAE,aAAa;YACtB,cAAc,EAAE,cAAc,CAAC,QAAQ,CAAC;YACxC,WAAW,EAAE,mBAAmB,CAAC,OAAO,CAAC,WAAW,CAAC;YACrD,KAAK;SACN,CAAC,CAAC;QACH,MAAM,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACtC,MAAM,2BAA2B,CAC/B,aAAa,EACb;YACE,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,cAAc,EAAE,MAAM;YACtB,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,EACD;YACE,WAAW;YACX,KAAK,EAAE,YAAY,CAAC,KAAK;YACzB,YAAY,EACV,YAAY,CAAC,YAAY,KAAK,SAAS;gBACrC,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,CACxB,YAAY,CAAC,YAAa,CAAC,IAAI,EAAE,KAAK,CAAC;SAChD,CACF,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,IAAoC,EAAE;QACxD,MAAM,KAAK,GAAG,CAAC,MAAM,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC;QACrD,IAAI,KAAK,EAAE,YAAY,EAAE,CAAC;YACxB,MAAM,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1D,OAAO,KAAK,CAAC,MAA+B,CAAC;QAC/C,CAAC;QACD,MAAM,MAAM,GACV,YAAY,CAAC,YAAY;YACzB,IAAI,iBAAiB,CACnB,WAAW,EACX,SAAS,EACT,OAAO,CAAC,MAAM,EACd,cAAc,CACf,CAAC;QACJ,MAAM,WAAW,GAAG,QAAQ;YAC1B,CAAC,CAAC,IAAI,wBAAwB,CAC1B,QAAQ,EACR,MAAM,EACN,MAAM,QAAQ,CAAC,cAAc,CAAC,cAAc,CAAC,EAC7C,KAAK,EACL,MAAM,oBAAoB,CAAC,WAAW,CAAC,CACxC;YACH,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,YAAY,GAAG,IAAI,mBAAmB,CAC1C;YACE,mBAAmB,EAAE,CAAC,SAAS,EAAE,EAAE,CACjC,MAAM,CAAC,mBAAmB,CAAC,SAAS,EAAE,KAAK,CAAC;SAC/C,EACD,YAAY,CAAC,QAAQ;YACnB,IAAI,0BAA0B,CAAC,WAAW,IAAI,MAAM,CAAC,EACvD,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,WAAW,CACpB,CAAC;QACF,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,GAAG,CACrC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAC/D,CAAC;QACF,MAAM,WAAW,EAAE,qBAAqB,EAAE,CAAC;QAC3C,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QACjC,MAAM,MAAM,GAA0B,EAAE,MAAM,EAAE,GAAG,QAAQ,EAAE,CAAC;QAC9D,MAAM,QAAQ,EAAE,aAAa,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC;QAC1E,MAAM,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IACF,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,EAAE,CAAC;AAC1E,CAAC","sourcesContent":["import { loadContractWithScanDirectory } from \"../contract.js\";\nimport {\n bundledPluginRoot,\n codexSecurityStateDirectory,\n resolvePluginPython,\n runWorkbench,\n} from \"../runtime.js\";\nimport {\n resolveCompletedScan,\n type SavedScanDependencies,\n} from \"../saved-scan.js\";\nimport { CodexReviewRunner } from \"./codex-review.js\";\nimport {\n FindingDeduplicator,\n deduplicationConcurrency,\n type DeduplicationResult,\n} from \"./deduplication.js\";\nimport {\n CodexDeduplicationReviewer,\n type DeduplicationReviewer,\n} from \"./deduplication-reviewer.js\";\nimport { FindingsClient, type FindingsRequest } from \"../findings-client.js\";\nimport type { FindingSearchScope } from \"../finding-retrieval.js\";\nimport {\n FindingWorkflow,\n workflowDestination,\n workflowDigest,\n} from \"../finding-workflow.js\";\nimport { publishScanToCustomInternal } from \"../custom-publish.js\";\nimport {\n CheckpointedReviewRunner,\n reviewSettingsDigest,\n} from \"./checkpointed-review.js\";\nimport { normalizeRepository } from \"../targets.js\";\n\nexport interface DeduplicateScanOptions {\n /** Resume the named local findings workflow, including custom publication. */\n workflowId?: string;\n /** Findings API base URL. The scan's findings must already be indexed there. */\n findingsUrl: string;\n /** Search all repositories instead of the scan's targetId. Defaults to false. */\n allRepositories?: boolean;\n /** Shared concurrency limit for deduplication jobs. Defaults to 8. */\n concurrency?: number;\n signal?: AbortSignal;\n}\n\nexport interface DeduplicateScanDirectoryOptions\n extends DeduplicateScanOptions {\n /** Local repository checkout used to review duplicate candidates. */\n repository: string;\n /** Require the sealed artifacts to belong to this scan. */\n expectedScanId?: string;\n}\n\nexport interface DeduplicateScanResult extends DeduplicationResult {\n scanId: string;\n}\n\n/** Review a saved scan against embedding candidates and persist accepted duplicate groups. */\nexport async function deduplicateScan(\n scanId: string,\n options: DeduplicateScanOptions,\n): Promise<DeduplicateScanResult> {\n return await deduplicateScanInternal(scanId, options);\n}\n\n/** Review a complete, sealed scan directory without resolving local scan history. */\nexport async function deduplicateScanDirectory(\n scanDirectory: string,\n options: DeduplicateScanDirectoryOptions,\n): Promise<DeduplicateScanResult> {\n return await deduplicateScanDirectoryInternal(scanDirectory, options);\n}\n\ntype DeduplicateScanDependencies = Partial<SavedScanDependencies> & {\n environment?: NodeJS.ProcessEnv;\n reviewer?: DeduplicationReviewer;\n reviewRunner?: Pick<CodexReviewRunner, \"run\">;\n fetch?: FindingsRequest;\n};\n\n/** @internal */\nexport async function deduplicateScanDirectoryInternal(\n scanDirectory: string,\n options: DeduplicateScanDirectoryOptions,\n dependencies: DeduplicateScanDependencies = {},\n): Promise<DeduplicateScanResult> {\n options.signal?.throwIfAborted();\n deduplicationConcurrency(options.concurrency);\n const repository = await normalizeRepository(\n options.repository,\n options.signal,\n );\n return await deduplicateResolvedScan(\n scanDirectory,\n repository,\n options.expectedScanId,\n options,\n dependencies,\n await bundledPluginRoot(),\n true,\n );\n}\n\n/** @internal */\nexport async function deduplicateScanInternal(\n scanId: string,\n options: DeduplicateScanOptions,\n dependencies: DeduplicateScanDependencies = {},\n): Promise<DeduplicateScanResult> {\n options.signal?.throwIfAborted();\n deduplicationConcurrency(options.concurrency);\n const environment = dependencies.environment ?? process.env;\n const pluginRoot = await bundledPluginRoot();\n const scan = await resolveCompletedScan(scanId, {\n currentDirectory: dependencies.currentDirectory ?? (() => process.cwd()),\n runWorkbench:\n dependencies.runWorkbench ??\n (async (args) => {\n const stateEnvironment = {\n ...environment,\n CODEX_SECURITY_STATE_DIR: codexSecurityStateDirectory(environment),\n };\n return await runWorkbench(\n {\n environment: stateEnvironment,\n pluginRoot,\n python: await resolvePluginPython({\n environment: stateEnvironment,\n }),\n signal: options.signal,\n failureMessage: \"Could not read Codex Security scan history\",\n },\n args,\n );\n }),\n });\n return await deduplicateResolvedScan(\n scan.scanDir,\n scan[\"targetPath\"] as string,\n scan.scanId,\n options,\n dependencies,\n pluginRoot,\n false,\n );\n}\n\nasync function deduplicateResolvedScan(\n selectedDirectory: string,\n repositoryPath: string,\n expectedScanId: string | undefined,\n options: DeduplicateScanOptions,\n dependencies: DeduplicateScanDependencies,\n pluginRoot: string,\n bindRepository: boolean,\n): Promise<DeduplicateScanResult> {\n const environment = dependencies.environment ?? process.env;\n const { contract, scanDirectory } = await loadContractWithScanDirectory(\n selectedDirectory,\n {\n pluginRoot,\n expectedScanId,\n signal: options.signal,\n },\n );\n const scanId = contract.manifest.scan.id;\n const client = new FindingsClient(\n options.findingsUrl,\n options.signal,\n dependencies.fetch,\n );\n const scope: FindingSearchScope =\n options.allRepositories === true\n ? { allRepositories: true }\n : { repositoryId: contract.manifest.scan.target.targetId };\n const workflow =\n options.workflowId === undefined\n ? undefined\n : new FindingWorkflow(\n options.workflowId,\n environment,\n dependencies.runWorkbench === undefined\n ? undefined\n : (_options, args, input) =>\n dependencies.runWorkbench!(args, input),\n );\n if (workflow) {\n await workflow.protectArtifacts(scanDirectory);\n await workflow.bind({\n ...(bindRepository ? { repositoryPath } : {}),\n scanId,\n scanDir: scanDirectory,\n artifactDigest: workflowDigest(contract),\n destination: workflowDestination(options.findingsUrl),\n scope,\n });\n await workflow.complete(\"scan\", null);\n await publishScanToCustomInternal(\n scanDirectory,\n {\n findingsUrl: options.findingsUrl,\n workflowId: options.workflowId,\n expectedScanId: scanId,\n signal: options.signal,\n },\n {\n environment,\n fetch: dependencies.fetch,\n runWorkbench:\n dependencies.runWorkbench === undefined\n ? undefined\n : (_options, args, input) =>\n dependencies.runWorkbench!(args, input),\n },\n );\n }\n const dedupe = async (): Promise<DeduplicateScanResult> => {\n const saved = (await workflow?.get())?.stages.dedupe;\n if (saved?.pendingWrite) {\n await client.storeDedupeGroups(saved.pendingWrite.groups);\n return saved.result as DeduplicateScanResult;\n }\n const runner =\n dependencies.reviewRunner ??\n new CodexReviewRunner(\n environment,\n undefined,\n options.signal,\n repositoryPath,\n );\n const checkpoints = workflow\n ? new CheckpointedReviewRunner(\n workflow,\n runner,\n await workflow.sourceSnapshot(repositoryPath),\n scope,\n await reviewSettingsDigest(environment),\n )\n : undefined;\n const deduplicator = new FindingDeduplicator(\n {\n potentialDuplicates: (findingId) =>\n client.potentialDuplicates(findingId, scope),\n },\n dependencies.reviewer ??\n new CodexDeduplicationReviewer(checkpoints ?? runner),\n options.signal,\n options.concurrency,\n );\n const reviewed = await deduplicator.run(\n contract.findings.findings.map((finding) => finding.findingId),\n );\n await checkpoints?.assertSourceUnchanged();\n options.signal?.throwIfAborted();\n const result: DeduplicateScanResult = { scanId, ...reviewed };\n await workflow?.prepareDedupe(result, { groups: result.duplicateGroups });\n await client.storeDedupeGroups(result.duplicateGroups);\n return result;\n };\n return workflow ? await workflow.run(\"dedupe\", dedupe) : await dedupe();\n}\n"]}
@@ -0,0 +1,20 @@
1
+ import { type ChildProcessWithoutNullStreams, type SpawnOptionsWithoutStdio } from "node:child_process";
2
+ import { type ScanLogSource } from "./scan-logs.js";
3
+ interface FeedbackOptions {
4
+ reason: string;
5
+ includeLogs: boolean;
6
+ scan?: ScanLogSource;
7
+ environment: NodeJS.ProcessEnv;
8
+ workingDirectory: string;
9
+ signal?: AbortSignal;
10
+ }
11
+ type StartCodex = (command: string, args: readonly string[], options: SpawnOptionsWithoutStdio & {
12
+ stdio: ["pipe", "pipe", "pipe"];
13
+ }) => ChildProcessWithoutNullStreams;
14
+ export declare function sendFeedback(options: FeedbackOptions, startCodex?: StartCodex): Promise<{
15
+ feedbackId: string;
16
+ scanId: string | null;
17
+ includedLogs: boolean;
18
+ }>;
19
+ export {};
20
+ //# sourceMappingURL=feedback.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"feedback.d.ts","sourceRoot":"","sources":["../src/feedback.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,8BAA8B,EACnC,KAAK,wBAAwB,EAC9B,MAAM,oBAAoB,CAAC;AAY5B,OAAO,EAAqB,KAAK,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAQvE,UAAU,eAAe;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,OAAO,CAAC;IACrB,IAAI,CAAC,EAAE,aAAa,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC,UAAU,CAAC;IAC/B,gBAAgB,EAAE,MAAM,CAAC;IACzB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,KAAK,UAAU,GAAG,CAChB,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,OAAO,EAAE,wBAAwB,GAAG;IAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,KACpE,8BAA8B,CAAC;AAEpC,wBAAsB,YAAY,CAChC,OAAO,EAAE,eAAe,EACxB,UAAU,GAAE,UAAkB;;;;GAuH/B"}
@@ -0,0 +1,121 @@
1
+ import { spawn, } from "node:child_process";
2
+ import { mkdtemp, rm, writeFile } from "node:fs/promises";
3
+ import { tmpdir } from "node:os";
4
+ import { join } from "node:path";
5
+ import { createInterface } from "node:readline";
6
+ import { readCodexHomeConfig } from "./auth.js";
7
+ import { CodexSecurityError } from "./errors.js";
8
+ import { codexSecurityCredentialHome, executablePathForSpawn, resolveCodexCommand, } from "./runtime.js";
9
+ import { readSavedScanLogs } from "./scan-logs.js";
10
+ import { BUNDLED_PLUGIN_VERSION, CODEX_EXECUTABLE_VERSION, CODEX_SDK_VERSION, VERSION, } from "./version.js";
11
+ export async function sendFeedback(options, startCodex = spawn) {
12
+ const { scan, environment, includeLogs } = options;
13
+ options.signal?.throwIfAborted();
14
+ const codexHome = codexSecurityCredentialHome(environment);
15
+ const config = await readCodexHomeConfig(environment);
16
+ const feedback = config["feedback"];
17
+ if (feedback?.enabled === false) {
18
+ throw new CodexSecurityError("Sending feedback is disabled by configuration.");
19
+ }
20
+ let directory;
21
+ try {
22
+ const extraLogFiles = [];
23
+ if (includeLogs && scan !== undefined) {
24
+ const logs = await readSavedScanLogs(scan, codexHome);
25
+ directory = await mkdtemp(join(tmpdir(), "codex-security-feedback-"));
26
+ const path = join(directory, "scan-logs.json");
27
+ await writeFile(path, JSON.stringify(logs), { mode: 0o600 });
28
+ extraLogFiles.push(path);
29
+ }
30
+ const command = resolveCodexCommand(environment);
31
+ const child = startCodex(executablePathForSpawn(command.command), ["app-server", "--stdio"], {
32
+ cwd: options.workingDirectory,
33
+ env: { ...environment, CODEX_HOME: codexHome },
34
+ stdio: ["pipe", "pipe", "pipe"],
35
+ windowsHide: true,
36
+ signal: options.signal,
37
+ });
38
+ const uploaded = Promise.withResolvers();
39
+ const closed = new Promise((resolve) => {
40
+ child.once("close", () => {
41
+ uploaded.reject(new CodexSecurityError("Codex exited before feedback was uploaded."));
42
+ resolve();
43
+ });
44
+ });
45
+ child.once("error", uploaded.reject);
46
+ child.stdin.on("error", uploaded.reject);
47
+ child.stderr.resume();
48
+ const send = (message) => child.stdin.write(`${JSON.stringify(message)}\n`);
49
+ const lines = createInterface({ input: child.stdout, crlfDelay: Infinity });
50
+ lines.on("line", (line) => {
51
+ try {
52
+ const message = JSON.parse(line);
53
+ if (message.method !== undefined || message.id === undefined)
54
+ return;
55
+ if (message.error)
56
+ throw new CodexSecurityError(message.error.message);
57
+ if (message.id === 1) {
58
+ send({ method: "initialized" });
59
+ send({
60
+ id: 2,
61
+ method: "feedback/upload",
62
+ params: {
63
+ classification: "bug",
64
+ reason: options.reason,
65
+ threadId: scan?.continuationThreadId,
66
+ includeLogs,
67
+ extraLogFiles,
68
+ tags: {
69
+ codex_security_version: VERSION,
70
+ codex_security_plugin_version: BUNDLED_PLUGIN_VERSION,
71
+ codex_security_codex_version: CODEX_EXECUTABLE_VERSION,
72
+ codex_security_sdk_version: CODEX_SDK_VERSION,
73
+ ...(scan === undefined
74
+ ? {}
75
+ : { codex_security_scan_id: scan.scanId }),
76
+ },
77
+ },
78
+ });
79
+ }
80
+ else if (message.id === 2) {
81
+ const feedbackId = message.result?.threadId;
82
+ if (!feedbackId)
83
+ throw new CodexSecurityError("Codex did not return a feedback ID.");
84
+ uploaded.resolve(feedbackId);
85
+ }
86
+ }
87
+ catch (error) {
88
+ uploaded.reject(error);
89
+ }
90
+ });
91
+ try {
92
+ send({
93
+ id: 1,
94
+ method: "initialize",
95
+ params: { clientInfo: { name: "codex-security", version: VERSION } },
96
+ });
97
+ return {
98
+ feedbackId: await uploaded.promise,
99
+ scanId: scan?.scanId ?? null,
100
+ includedLogs: includeLogs,
101
+ };
102
+ }
103
+ finally {
104
+ lines.close();
105
+ child.stdin.end();
106
+ child.kill();
107
+ const timer = setTimeout(() => child.kill("SIGKILL"), 1_000);
108
+ try {
109
+ await closed;
110
+ }
111
+ finally {
112
+ clearTimeout(timer);
113
+ }
114
+ }
115
+ }
116
+ finally {
117
+ if (directory !== undefined)
118
+ await rm(directory, { recursive: true, force: true });
119
+ }
120
+ }
121
+ //# sourceMappingURL=feedback.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"feedback.js","sourceRoot":"","sources":["../src/feedback.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,GAGN,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EACL,2BAA2B,EAC3B,sBAAsB,EACtB,mBAAmB,GACpB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,iBAAiB,EAAsB,MAAM,gBAAgB,CAAC;AACvE,OAAO,EACL,sBAAsB,EACtB,wBAAwB,EACxB,iBAAiB,EACjB,OAAO,GACR,MAAM,cAAc,CAAC;AAiBtB,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,OAAwB,EACxB,aAAyB,KAAK;IAE9B,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;IACnD,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,SAAS,GAAG,2BAA2B,CAAC,WAAW,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,MAAM,mBAAmB,CAAC,WAAW,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAsC,CAAC;IACzE,IAAI,QAAQ,EAAE,OAAO,KAAK,KAAK,EAAE,CAAC;QAChC,MAAM,IAAI,kBAAkB,CAC1B,gDAAgD,CACjD,CAAC;IACJ,CAAC;IAED,IAAI,SAA6B,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,IAAI,WAAW,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,MAAM,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACtD,SAAS,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,0BAA0B,CAAC,CAAC,CAAC;YACtE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC;YAC/C,MAAM,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YAC7D,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;QAED,MAAM,OAAO,GAAG,mBAAmB,CAAC,WAAW,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,UAAU,CACtB,sBAAsB,CAAC,OAAO,CAAC,OAAO,CAAC,EACvC,CAAC,YAAY,EAAE,SAAS,CAAC,EACzB;YACE,GAAG,EAAE,OAAO,CAAC,gBAAgB;YAC7B,GAAG,EAAE,EAAE,GAAG,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE;YAC9C,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;YAC/B,WAAW,EAAE,IAAI;YACjB,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,CACF,CAAC;QACF,MAAM,QAAQ,GAAG,OAAO,CAAC,aAAa,EAAU,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YAC3C,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE;gBACvB,QAAQ,CAAC,MAAM,CACb,IAAI,kBAAkB,CAAC,4CAA4C,CAAC,CACrE,CAAC;gBACF,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QACzC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,CAAC,OAAe,EAAE,EAAE,CAC/B,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC5E,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;YACxB,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAK9B,CAAC;gBACF,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,OAAO,CAAC,EAAE,KAAK,SAAS;oBAAE,OAAO;gBACrE,IAAI,OAAO,CAAC,KAAK;oBAAE,MAAM,IAAI,kBAAkB,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBACvE,IAAI,OAAO,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;oBACrB,IAAI,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,CAAC;oBAChC,IAAI,CAAC;wBACH,EAAE,EAAE,CAAC;wBACL,MAAM,EAAE,iBAAiB;wBACzB,MAAM,EAAE;4BACN,cAAc,EAAE,KAAK;4BACrB,MAAM,EAAE,OAAO,CAAC,MAAM;4BACtB,QAAQ,EAAE,IAAI,EAAE,oBAAoB;4BACpC,WAAW;4BACX,aAAa;4BACb,IAAI,EAAE;gCACJ,sBAAsB,EAAE,OAAO;gCAC/B,6BAA6B,EAAE,sBAAsB;gCACrD,4BAA4B,EAAE,wBAAwB;gCACtD,0BAA0B,EAAE,iBAAiB;gCAC7C,GAAG,CAAC,IAAI,KAAK,SAAS;oCACpB,CAAC,CAAC,EAAE;oCACJ,CAAC,CAAC,EAAE,sBAAsB,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;6BAC7C;yBACF;qBACF,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,OAAO,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;oBAC5B,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;oBAC5C,IAAI,CAAC,UAAU;wBACb,MAAM,IAAI,kBAAkB,CAAC,qCAAqC,CAAC,CAAC;oBACtE,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC,CAAC,CAAC;QACH,IAAI,CAAC;YACH,IAAI,CAAC;gBACH,EAAE,EAAE,CAAC;gBACL,MAAM,EAAE,YAAY;gBACpB,MAAM,EAAE,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE;aACrE,CAAC,CAAC;YACH,OAAO;gBACL,UAAU,EAAE,MAAM,QAAQ,CAAC,OAAO;gBAClC,MAAM,EAAE,IAAI,EAAE,MAAM,IAAI,IAAI;gBAC5B,YAAY,EAAE,WAAW;aAC1B,CAAC;QACJ,CAAC;gBAAS,CAAC;YACT,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAClB,KAAK,CAAC,IAAI,EAAE,CAAC;YACb,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,CAAC;YAC7D,IAAI,CAAC;gBACH,MAAM,MAAM,CAAC;YACf,CAAC;oBAAS,CAAC;gBACT,YAAY,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,IAAI,SAAS,KAAK,SAAS;YACzB,MAAM,EAAE,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC","sourcesContent":["import {\n spawn,\n type ChildProcessWithoutNullStreams,\n type SpawnOptionsWithoutStdio,\n} from \"node:child_process\";\nimport { mkdtemp, rm, writeFile } from \"node:fs/promises\";\nimport { tmpdir } from \"node:os\";\nimport { join } from \"node:path\";\nimport { createInterface } from \"node:readline\";\nimport { readCodexHomeConfig } from \"./auth.js\";\nimport { CodexSecurityError } from \"./errors.js\";\nimport {\n codexSecurityCredentialHome,\n executablePathForSpawn,\n resolveCodexCommand,\n} from \"./runtime.js\";\nimport { readSavedScanLogs, type ScanLogSource } from \"./scan-logs.js\";\nimport {\n BUNDLED_PLUGIN_VERSION,\n CODEX_EXECUTABLE_VERSION,\n CODEX_SDK_VERSION,\n VERSION,\n} from \"./version.js\";\n\ninterface FeedbackOptions {\n reason: string;\n includeLogs: boolean;\n scan?: ScanLogSource;\n environment: NodeJS.ProcessEnv;\n workingDirectory: string;\n signal?: AbortSignal;\n}\n\ntype StartCodex = (\n command: string,\n args: readonly string[],\n options: SpawnOptionsWithoutStdio & { stdio: [\"pipe\", \"pipe\", \"pipe\"] },\n) => ChildProcessWithoutNullStreams;\n\nexport async function sendFeedback(\n options: FeedbackOptions,\n startCodex: StartCodex = spawn,\n) {\n const { scan, environment, includeLogs } = options;\n options.signal?.throwIfAborted();\n const codexHome = codexSecurityCredentialHome(environment);\n const config = await readCodexHomeConfig(environment);\n const feedback = config[\"feedback\"] as { enabled?: boolean } | undefined;\n if (feedback?.enabled === false) {\n throw new CodexSecurityError(\n \"Sending feedback is disabled by configuration.\",\n );\n }\n\n let directory: string | undefined;\n try {\n const extraLogFiles: string[] = [];\n if (includeLogs && scan !== undefined) {\n const logs = await readSavedScanLogs(scan, codexHome);\n directory = await mkdtemp(join(tmpdir(), \"codex-security-feedback-\"));\n const path = join(directory, \"scan-logs.json\");\n await writeFile(path, JSON.stringify(logs), { mode: 0o600 });\n extraLogFiles.push(path);\n }\n\n const command = resolveCodexCommand(environment);\n const child = startCodex(\n executablePathForSpawn(command.command),\n [\"app-server\", \"--stdio\"],\n {\n cwd: options.workingDirectory,\n env: { ...environment, CODEX_HOME: codexHome },\n stdio: [\"pipe\", \"pipe\", \"pipe\"],\n windowsHide: true,\n signal: options.signal,\n },\n );\n const uploaded = Promise.withResolvers<string>();\n const closed = new Promise<void>((resolve) => {\n child.once(\"close\", () => {\n uploaded.reject(\n new CodexSecurityError(\"Codex exited before feedback was uploaded.\"),\n );\n resolve();\n });\n });\n child.once(\"error\", uploaded.reject);\n child.stdin.on(\"error\", uploaded.reject);\n child.stderr.resume();\n const send = (message: object) =>\n child.stdin.write(`${JSON.stringify(message)}\\n`);\n const lines = createInterface({ input: child.stdout, crlfDelay: Infinity });\n lines.on(\"line\", (line) => {\n try {\n const message = JSON.parse(line) as {\n id?: number;\n method?: string;\n error?: { message: string };\n result?: { threadId?: string };\n };\n if (message.method !== undefined || message.id === undefined) return;\n if (message.error) throw new CodexSecurityError(message.error.message);\n if (message.id === 1) {\n send({ method: \"initialized\" });\n send({\n id: 2,\n method: \"feedback/upload\",\n params: {\n classification: \"bug\",\n reason: options.reason,\n threadId: scan?.continuationThreadId,\n includeLogs,\n extraLogFiles,\n tags: {\n codex_security_version: VERSION,\n codex_security_plugin_version: BUNDLED_PLUGIN_VERSION,\n codex_security_codex_version: CODEX_EXECUTABLE_VERSION,\n codex_security_sdk_version: CODEX_SDK_VERSION,\n ...(scan === undefined\n ? {}\n : { codex_security_scan_id: scan.scanId }),\n },\n },\n });\n } else if (message.id === 2) {\n const feedbackId = message.result?.threadId;\n if (!feedbackId)\n throw new CodexSecurityError(\"Codex did not return a feedback ID.\");\n uploaded.resolve(feedbackId);\n }\n } catch (error) {\n uploaded.reject(error);\n }\n });\n try {\n send({\n id: 1,\n method: \"initialize\",\n params: { clientInfo: { name: \"codex-security\", version: VERSION } },\n });\n return {\n feedbackId: await uploaded.promise,\n scanId: scan?.scanId ?? null,\n includedLogs: includeLogs,\n };\n } finally {\n lines.close();\n child.stdin.end();\n child.kill();\n const timer = setTimeout(() => child.kill(\"SIGKILL\"), 1_000);\n try {\n await closed;\n } finally {\n clearTimeout(timer);\n }\n }\n } finally {\n if (directory !== undefined)\n await rm(directory, { recursive: true, force: true });\n }\n}\n"]}
@@ -0,0 +1,11 @@
1
+ export type ComparisonFinding = {
2
+ occurrenceId: string;
3
+ } & Record<string, unknown>;
4
+ export interface CatalogueEntry {
5
+ card: ComparisonFinding;
6
+ occurrences: readonly ComparisonFinding[];
7
+ }
8
+ export declare function groupFindings(findings: readonly ComparisonFinding[], knownFindingGroups?: readonly (readonly string[])[], occurrenceGroups?: readonly (readonly string[])[]): ComparisonFinding[][];
9
+ export declare function findingCatalogue(findings: readonly ComparisonFinding[], knownFindingGroups?: readonly (readonly string[])[]): Map<string, CatalogueEntry>;
10
+ export declare function compactFinding(finding: ComparisonFinding): ComparisonFinding;
11
+ //# sourceMappingURL=finding-catalogue.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"finding-catalogue.d.ts","sourceRoot":"","sources":["../src/finding-catalogue.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,iBAAiB,GAAG;IAAE,YAAY,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,CAC/D,MAAM,EACN,OAAO,CACR,CAAC;AAEF,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,iBAAiB,CAAC;IACxB,WAAW,EAAE,SAAS,iBAAiB,EAAE,CAAC;CAC3C;AAED,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,SAAS,iBAAiB,EAAE,EACtC,kBAAkB,GAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAO,EACvD,gBAAgB,GAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAO,GACpD,iBAAiB,EAAE,EAAE,CAiDvB;AAED,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,SAAS,iBAAiB,EAAE,EACtC,kBAAkB,GAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAO,GACtD,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAqC7B;AAED,wBAAgB,cAAc,CAAC,OAAO,EAAE,iBAAiB,GAAG,iBAAiB,CAoD5E"}
@@ -0,0 +1,150 @@
1
+ export function groupFindings(findings, knownFindingGroups = [], occurrenceGroups = []) {
2
+ const parents = new Map();
3
+ const root = (value) => {
4
+ const path = [];
5
+ let current = value;
6
+ while (parents.has(current)) {
7
+ path.push(current);
8
+ current = parents.get(current);
9
+ }
10
+ for (const item of path)
11
+ parents.set(item, current);
12
+ return current;
13
+ };
14
+ const link = (first, second) => {
15
+ const previous = root(first);
16
+ const current = root(second);
17
+ if (previous !== current)
18
+ parents.set(current, previous);
19
+ };
20
+ for (const [prefix, groups] of [
21
+ ["finding", knownFindingGroups],
22
+ ["occurrence", occurrenceGroups],
23
+ ]) {
24
+ for (const group of groups) {
25
+ const identities = prefix === "finding"
26
+ ? group.filter((identity) => identity.trim().length > 0)
27
+ : group;
28
+ const first = identities[0];
29
+ if (first === undefined)
30
+ continue;
31
+ for (const value of identities.slice(1)) {
32
+ link(`${prefix}:${first}`, `${prefix}:${value}`);
33
+ }
34
+ }
35
+ }
36
+ for (const finding of findings) {
37
+ const findingId = finding["findingId"];
38
+ if (typeof findingId === "string" && findingId.trim().length > 0) {
39
+ link(`finding:${findingId}`, `occurrence:${finding.occurrenceId}`);
40
+ }
41
+ }
42
+ const groups = new Map();
43
+ for (const finding of findings) {
44
+ const key = root(`occurrence:${finding.occurrenceId}`);
45
+ const group = groups.get(key);
46
+ if (group === undefined)
47
+ groups.set(key, [finding]);
48
+ else
49
+ group.push(finding);
50
+ }
51
+ return [...groups.values()];
52
+ }
53
+ export function findingCatalogue(findings, knownFindingGroups = []) {
54
+ return new Map(groupFindings(findings, knownFindingGroups).map((occurrences) => {
55
+ const latest = occurrences.at(-1);
56
+ const card = compactFinding(latest);
57
+ if (occurrences.length > 1) {
58
+ const description = (finding) => {
59
+ const value = { ...compactFinding(finding) };
60
+ delete value["occurrenceId"];
61
+ delete value["findingId"];
62
+ return value;
63
+ };
64
+ const current = description(latest);
65
+ const seen = new Set();
66
+ const aliases = occurrences.slice(0, -1).flatMap((finding) => {
67
+ const value = Object.fromEntries(Object.entries(description(finding)).filter(([field, value]) => JSON.stringify(value) !== JSON.stringify(current[field])));
68
+ if (Object.keys(value).length === 0)
69
+ return [];
70
+ const key = JSON.stringify(value);
71
+ if (seen.has(key))
72
+ return [];
73
+ seen.add(key);
74
+ return [value];
75
+ });
76
+ card["occurrenceCount"] = occurrences.length;
77
+ if (aliases.length > 0)
78
+ card["earlierDescriptions"] = aliases;
79
+ }
80
+ const findingId = occurrences[0]["findingId"];
81
+ if (typeof findingId === "string" && findingId.trim().length > 0) {
82
+ card["issueId"] = findingId;
83
+ }
84
+ return [latest.occurrenceId, { card, occurrences }];
85
+ }));
86
+ }
87
+ export function compactFinding(finding) {
88
+ const rootCause = finding["rootCause"] ?? finding["root_cause"];
89
+ const attackPath = record(finding["attackPath"]);
90
+ const dataFlow = attackPath?.["dataFlow"] ??
91
+ attackPath?.["data_flow"] ??
92
+ attackPath?.["dataflow"];
93
+ const locations = Array.isArray(finding["locations"])
94
+ ? finding["locations"].flatMap((value) => {
95
+ const location = record(value);
96
+ return location === undefined ? [] : [location];
97
+ })
98
+ : [];
99
+ let controls = locations.filter((location) => location["role"] === "root_control");
100
+ if (controls.length === 0) {
101
+ controls = locations.filter((location) => ["expected_control", "concrete_implementation"].includes(String(location["role"])));
102
+ }
103
+ if (controls.length === 0)
104
+ controls = locations.slice(0, 1);
105
+ return {
106
+ occurrenceId: finding.occurrenceId,
107
+ ...present({
108
+ findingId: finding["findingId"],
109
+ title: finding["title"],
110
+ identity: pick(finding["identity"], ["anchor", "instance"]),
111
+ ruleId: finding["ruleId"],
112
+ taxonomy: pick(finding["taxonomy"], ["category", "cwe"]),
113
+ rootCause: (typeof rootCause === "string"
114
+ ? rootCause
115
+ : record(rootCause)?.["summary"]) ?? finding["summary"],
116
+ remediation: finding["remediation"],
117
+ locations: controls.map((location) => pick(location, ["path", "startLine", "endLine", "role"])),
118
+ attackPath: present({
119
+ dataFlow: pick(dataFlow, ["source", "sink"]),
120
+ reachability: pick(attackPath?.["reachability"], [
121
+ "attacker",
122
+ "entrypoint",
123
+ ]),
124
+ }),
125
+ affectedComponent: finding["affectedComponent"],
126
+ boundaryCrossed: finding["boundaryCrossed"],
127
+ }),
128
+ };
129
+ }
130
+ function record(value) {
131
+ return value !== null && typeof value === "object" && !Array.isArray(value)
132
+ ? value
133
+ : undefined;
134
+ }
135
+ function pick(value, fields) {
136
+ if (typeof value === "string")
137
+ return value;
138
+ const object = record(value);
139
+ return object === undefined
140
+ ? undefined
141
+ : present(Object.fromEntries(fields.map((field) => [field, object[field]])));
142
+ }
143
+ function present(value) {
144
+ return Object.fromEntries(Object.entries(value).filter(([, item]) => item !== undefined &&
145
+ item !== null &&
146
+ item !== "" &&
147
+ (!Array.isArray(item) || item.length > 0) &&
148
+ (record(item) === undefined || Object.keys(item).length > 0)));
149
+ }
150
+ //# sourceMappingURL=finding-catalogue.js.map