{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"DM9","name":"Scattered domain decisions","shortDescription":{"text":"Scattered domain decisions"},"helpUri":"https://codehealth.canine.dev/dimensions/DM9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"commands.buildCommandHandlers (cyclomatic 184): commands.buildCommandHandlers has cyclomatic complexity 184 (threshold 15). Most of this is not in the body itself: 5 of the 184 points are its own statements and the rest belongs to 39 function items inside it that branch (a function literal at line 1230, a function literal at line 966, a function literal at line 1752, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e16039f67de89dccb2dce0e55f05ffd0d2028633daae029c16a3ec1b77364e"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy-import-dialog.LegacyImportDialogContent (cyclomatic 152): legacy-import-dialog.LegacyImportDialogContent has cyclomatic complexity 152 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 107 belong to 35 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d64cbb7a1dea1ddb0c054144132a203acb713455a1e7a41d53fec091757d0f3"}},{"ruleId":"D1","level":"warning","message":{"text":"create-task-handler.handleCreateTaskUnderAdmission (cyclomatic 147): create-task-handler.handleCreateTaskUnderAdmission has cyclomatic complexity 147 (threshold 15). Of this number, 124 points are the body\u0027s own statements and 23 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e2145d3152c274e6b49af9221e4367f0375f7988c8addacbb4f07b93e579a2"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-calendar.ActivityCalendar (cyclomatic 139): activity-calendar.ActivityCalendar has cyclomatic complexity 139 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 100 belong to 27 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"346c819c300d672140c745cfd72c8f76a980165d2510f7054ddbf6e89bab4844"}},{"ruleId":"D1","level":"warning","message":{"text":"operation-form.OperationFormContent (cyclomatic 130): operation-form.OperationFormContent has cyclomatic complexity 130 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 80 belong to 17 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b2f415244e7fd0b3c35cc3fe36421c491daa46e30a94d3ccd5316bb9a96bc6"}},{"ruleId":"D1","level":"warning","message":{"text":"add-task-form.AddTaskForm (cyclomatic 123): add-task-form.AddTaskForm has cyclomatic complexity 123 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 106 belong to 22 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c14a4e04137efc70467c2c693fbfd7795dab44b1c2232d183b792f8f6d88dd"}},{"ruleId":"D1","level":"warning","message":{"text":"index.initializeMainProcess (cyclomatic 104): index.initializeMainProcess has cyclomatic complexity 104 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 49 belong to 37 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"639236a6216fa5c2b4512ea5f37d504f4f60ef780185e4a3dd781b5f80c0b982"}},{"ruleId":"D1","level":"warning","message":{"text":"engine-diagnostics-dialog.EngineDiagnosticsDialogHost (cyclomatic 101): engine-diagnostics-dialog.EngineDiagnosticsDialogHost has cyclomatic complexity 101 (threshold 15). Of this number, 81 points are the body\u0027s own statements and 20 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e1a19e4137daf2d020488ca26c18c5315c76d03b351c648ccbabedc0993f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"web-directory-picker-dialog.PickerSession::keyDown (cyclomatic 94): web-directory-picker-dialog.PickerSession::keyDown has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (web-directory-picker-dialog.PickerSession) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eb7aa57473ca596950dc52c650d5279425c5e6e32b8eae012b1d3c554fd971"}},{"ruleId":"D1","level":"warning","message":{"text":"media-tools-section.MediaToolsSection (cyclomatic 92): media-tools-section.MediaToolsSection has cyclomatic complexity 92 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 30 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1abce472405877c92d616974acf0048e39e6b619a0023ead6f3c3477a3c997"}},{"ruleId":"D1","level":"warning","message":{"text":"commands.buildServerCommandHandlers (cyclomatic 90): commands.buildServerCommandHandlers has cyclomatic complexity 90 (threshold 15). Most of this is not in the body itself: 5 of the 90 points are its own statements and the rest belongs to 22 function items inside it that branch (a function literal at line 571, a function literal at line 932, a function literal at line 1105, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7be6cb12c3d18de20b69435829234e4030b0ea92477d8351887fc40c9aa4f7"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaTaskCoordinator.run (cyclomatic 78): MediaTaskCoordinator.run has cyclomatic complexity 78 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 32 belong to 15 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcca0812ea5d519d087d23c19965d55d66287e01462c3ed095c52e006b91145"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager.restore (cyclomatic 76): SessionManager.restore has cyclomatic complexity 76 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d59c8ce2a3cacea8105cfe40da089fe29927250c97762b11f2b111a1ba3cdbf"}},{"ruleId":"D1","level":"warning","message":{"text":"directory-picker.DirectoryPicker (cyclomatic 73): directory-picker.DirectoryPicker has cyclomatic complexity 73 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 30 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"352eb65153079d094a26bc9aa5634138ef516c5da4f64c9f37fd05a674062b97"}},{"ruleId":"D1","level":"warning","message":{"text":"dashboard-grid.DashboardGrid (cyclomatic 71): dashboard-grid.DashboardGrid has cyclomatic complexity 71 (threshold 15). Most of this is not in the body itself: 11 of the 71 points are its own statements and the rest belongs to 24 function literals inside it that branch (lines 1041, 1225, 1162, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"336b41de5a5699a54c47655fd4b6cef78190f8ef23a2cd785d9456cdf706f106"}},{"ruleId":"D1","level":"warning","message":{"text":"trackers-tab.TrackersTab (cyclomatic 70): trackers-tab.TrackersTab has cyclomatic complexity 70 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 51 belong to 13 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fa318fab1479e08a74ecd8741ef4504e9dd6f46917339d95627ea2b015694e"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-call-graph.PluginCallGraph (cyclomatic 70): plugin-call-graph.PluginCallGraph has cyclomatic complexity 70 (threshold 15). Most of this is not in the body itself: 7 of the 70 points are its own statements and the rest belongs to 22 function literals inside it that branch (lines 525, 279, 305, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9a257b35ca4d1e220d4313e3b258e19a11320d2a17825c31a0636c2c61fdce"}},{"ruleId":"D1","level":"warning","message":{"text":"bt-file-verifier.verifyBtFiles (cyclomatic 69): bt-file-verifier.verifyBtFiles has cyclomatic complexity 69 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 41 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"51795231f280936d3fb00816ce0e3e29f10f810e9af9b06386ce6395d0adc5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"source-scanner.scanLegacySource (cyclomatic 65): source-scanner.scanLegacySource has cyclomatic complexity 65 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e618200d8dd138ee038f00161294a046b903cadbdb6b0c1cc915de677187ad6"}},{"ruleId":"D1","level":"warning","message":{"text":"lifetime-transfer-card.LifetimeTransferCard (cyclomatic 65): lifetime-transfer-card.LifetimeTransferCard has cyclomatic complexity 65 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 44 belong to 19 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7002bf3539bdca5a222992b0ee4385ee19516a4c05b3acca8ea6846553dd66"}},{"ruleId":"D1","level":"warning","message":{"text":"web-menu-button.WebMenuButton (cyclomatic 63): web-menu-button.WebMenuButton has cyclomatic complexity 63 (threshold 15). Most of this is not in the body itself: 5 of the 63 points are its own statements and the rest belongs to 23 function items inside it that branch (a function literal at line 195, renderItems, a function literal at line 295, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/web-menu-button.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"83574bdb779ecf3dece28401e636400dbefd43c0dfa63521b55256d4684fae2d"}},{"ruleId":"D1","level":"warning","message":{"text":"State::dispatch (cyclomatic 63): State::dispatch has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"386ad7a15a875689a58a3ca8136fa4d0eea8c36f197f63742cbf9bb2d66a2fab"}},{"ruleId":"D1","level":"warning","message":{"text":"system-protocols-section.SystemProtocolsSection (cyclomatic 62): system-protocols-section.SystemProtocolsSection has cyclomatic complexity 62 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 20 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/system-protocols-section.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f891615764942abd5b14a3084973ef696edb783a574e58f634d70fcb275b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizeRecovery.recover (cyclomatic 61): FinalizeRecovery.recover has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf727e1db0615ced29dcb86a35f0cda7305da11bad07158757d44021362c938"}},{"ruleId":"D1","level":"warning","message":{"text":"create-torrent-form.CreateTorrentForm (cyclomatic 61): create-torrent-form.CreateTorrentForm has cyclomatic complexity 61 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 29 belong to 9 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/create-torrent/create-torrent-form.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a6ee95bf020cfe70704af81acd0e546da474570d18747ac7c28e6dc4b2559d"}},{"ruleId":"D1","level":"warning","message":{"text":"task-list-panel.TaskListPanel (cyclomatic 60): task-list-panel.TaskListPanel has cyclomatic complexity 60 (threshold 15). Most of this is not in the body itself: 6 of the 60 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 248, 187, 285, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-list-panel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4aed8f1a420189cfe50fd11ca5311fe7223d8aaeaa044a2e59e517eac648be"}},{"ruleId":"D1","level":"warning","message":{"text":"Aria2Adapter.addTorrent (cyclomatic 59): Aria2Adapter.addTorrent has cyclomatic complexity 59 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8200b822b12b788bbda7aec79603decd7f89a4ebc6501311c4b30f6822be189"}},{"ruleId":"D1","level":"warning","message":{"text":"web-directory-picker-dialog.PickerSession (cyclomatic 59): web-directory-picker-dialog.PickerSession has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (web-directory-picker-dialog.PickerSession::keyDown) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0e5c9bfaecaf6bba9a1e798a51287e17a24ab989a154e4fff4869063d68f7c"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager.reAddOrMarkErrorFromPair (cyclomatic 58): SessionManager.reAddOrMarkErrorFromPair has cyclomatic complexity 58 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 18 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"424e266b00965410f5c873207fd1f0ca09f4c4846ba68525d547a8f0d3911314"}},{"ruleId":"D1","level":"warning","message":{"text":"BtStorageService.execute (cyclomatic 58): BtStorageService.execute has cyclomatic complexity 58 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e697ea9b8f903f889311c9ac6b3ba254680351ff5f13fd06218501feb84bf0"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-install-dialog.PluginInstallSession (cyclomatic 57): plugin-install-dialog.PluginInstallSession has cyclomatic complexity 57 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 25 belong to 9 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-install-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a48143054d3430f0855c929921efbb40e7a04dd08bf47b447066356d71bdff3"}},{"ruleId":"D1","level":"warning","message":{"text":"nas-auth.registerNasAuth (cyclomatic 57): nas-auth.registerNasAuth has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 2 of the 57 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 86, 176, 194, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/nas-auth.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"943e3f83a6d4685daf8f28a8ed0484839d387a2808fa059858240e1b13189461"}},{"ruleId":"D1","level":"warning","message":{"text":"swap-magnet-metadata-for-bt.swapMagnetMetadataForBtUnderMutation (cyclomatic 56): swap-magnet-metadata-for-bt.swapMagnetMetadataForBtUnderMutation has cyclomatic complexity 56 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e50490b1656f012684340a6c5ff46d5334ac7e1d5ea90ee4f46d0a92aaa00b7"}},{"ruleId":"D1","level":"warning","message":{"text":"app.createApp (cyclomatic 56): app.createApp has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 11 of the 56 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 274, dispatchCommand, a function literal at line 387, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/app.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7ef93abaa5c217e76fa8c5db9e8ec2e5d26a227114b2798b3ae0fbf4a74bce"}},{"ruleId":"D1","level":"warning","message":{"text":"Aria2Adapter.createDownload (cyclomatic 55): Aria2Adapter.createDownload has cyclomatic complexity 55 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efca0db7d23b7f820316a8d06da30b3a19530500043918d4a9b81b89f4b1504"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyHttpActivationService.reconcile (cyclomatic 55): LegacyHttpActivationService.reconcile has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1f765ffe09f2e399a86cd8bb96df957f2e921aba96b370c5e4bd7509e0b392"}},{"ruleId":"D1","level":"warning","message":{"text":"index.main (cyclomatic 54): index.main has cyclomatic complexity 54 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (index.main::handlePolledTasks, index.main::startServer) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dbf841afed85e6728ee39918bf96e26073fc4409262f5deee126800bbb3693"}},{"ruleId":"D1","level":"warning","message":{"text":"tasks-tile.TaskRow (cyclomatic 53): tasks-tile.TaskRow has cyclomatic complexity 53 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de65aa83a4f66e0e695fa0e560ce46152d5ff32bdae5fa1d615b04c8c290a64"}},{"ruleId":"D1","level":"warning","message":{"text":"create-selection-store.createSelectionStore (cyclomatic 53): create-selection-store.createSelectionStore has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 1 of the 53 points is its own statement and the rest belongs to one function literal inside it that branches (line 32). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/selection/create-selection-store.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"372a7cb8acb7c8518bc09e357e9a0ae4ebd0b59f79b37c87b0209feeb2e34db2"}},{"ruleId":"D1","level":"warning","message":{"text":"aria2-session-identity-recovery.recoverAria2SessionIdentity (cyclomatic 52): aria2-session-identity-recovery.recoverAria2SessionIdentity has cyclomatic complexity 52 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 11 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-session-identity-recovery.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dc7418bd2e5adc4b5660423124e101bf140066e6ce9bdba2b605cec7ea7a36"}},{"ruleId":"D1","level":"warning","message":{"text":"use-pair-request-prompts.usePairRequestPrompts (cyclomatic 51): use-pair-request-prompts.usePairRequestPrompts has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 202, 373, 156, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b63326b7ee3a562164624e8a98bccde26bed4772fe2e62993f30a9b0c67878"}},{"ruleId":"D1","level":"warning","message":{"text":"ReconnectSession.onReconnectResponse (cyclomatic 49): ReconnectSession.onReconnectResponse has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/reconnect-session.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f3688b344f6d27c6d6afac18678a6a5c5149d17ca19719fb9ccc85efa7df4f"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletedTaskStartupGuard.prepare (cyclomatic 49): CompletedTaskStartupGuard.prepare has cyclomatic complexity 49 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 31 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0048a5fd27a65bf5e3acf79707e259407f4363d996f97ac8d362da8172fde390"}},{"ruleId":"D1","level":"warning","message":{"text":"torrent-creator.registerTorrentCreator (cyclomatic 49): torrent-creator.registerTorrentCreator has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to 15 function items inside it that branch (readResult, authorize, reap, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/routes/torrent-creator.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8035fbe25f79aa25f09ec30df746fcd57fda00d6566ebf2e6a8919cabe011ce"}},{"ruleId":"D1","level":"warning","message":{"text":"remove-task.removeTaskUnderMutation (cyclomatic 48): remove-task.removeTaskUnderMutation has cyclomatic complexity 48 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/remove-task.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"43234f6de079478e0a4131c3d4a07f859665914e9ab28520b852b8244d476ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginHttpClient.fetch (cyclomatic 47): PluginHttpClient.fetch has cyclomatic complexity 47 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/network/plugin-http-client.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"99575551eeed3466fd36b0461d6c34db4f5e8e59c9c0aaf05a4a31af4b11c654"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyBtActivationService.reconcile (cyclomatic 46): LegacyBtActivationService.reconcile has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c520d0f17f71db33727522447cebf9ef59e06175e81cd8614e5a29132eb31a"}},{"ruleId":"D1","level":"warning","message":{"text":"SegmentDownloader.run (cyclomatic 45): SegmentDownloader.run has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 4 of the 45 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 425, a function literal at line 349, a function literal at line 303, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/download/segment-downloader.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5db8989b21d90db37ffee4dc54172244baebc5f4d2bcdeefde164478b644b2"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.bootstrapBridgeForServer (cyclomatic 44): bootstrap.bootstrapBridgeForServer has cyclomatic complexity 44 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 15 belong to 8 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8214a9741972474e5ed4bb6911609992798c6c012f67ab6704e8b4552c3340"}},{"ruleId":"D1","level":"warning","message":{"text":"index.migrate (cyclomatic 44): index.migrate has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/migrations/index.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"048ecd68bd94ff98503b37fa15d635eb3217c6b43ebcc94628deb99b5326d2df"}},{"ruleId":"D1","level":"warning","message":{"text":"CapabilityBridge.dispatchCall (cyclomatic 44): CapabilityBridge.dispatchCall has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"104b45b8271a94fac4c97fac0127cf0e2aac09497c0d0473aff3d6beb6995d74"}},{"ruleId":"D1","level":"warning","message":{"text":"create-torrent.torrentCreatorHandlers (cyclomatic 44): create-torrent.torrentCreatorHandlers has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to 6 function items inside it that branch (a function literal at line 145, a function literal at line 88, a function literal at line 106, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/create-torrent.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6656bb56efb08ae7a75a70829db43817c96552e1c267e3ec25fb0876995c7337"}},{"ruleId":"D1","level":"warning","message":{"text":"session-parser.resolveLegacyRequestSettings (cyclomatic 43): session-parser.resolveLegacyRequestSettings has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b712fbfce08225e2c801e31be8c6e12b4919230c4cfcaa33f913fa455ed50"}},{"ruleId":"D1","level":"warning","message":{"text":"url-textarea.UrlTextarea (cyclomatic 43): url-textarea.UrlTextarea has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 8 of the 43 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 151, a function literal at line 89, a function literal at line 225, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-textarea.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fab9a4a738c8a3ab5e210448f6717aa2de4ceafa959451bd8c315082dc44c41"}},{"ruleId":"D1","level":"warning","message":{"text":"nas-dialog.NasDialogForm (cyclomatic 42): nas-dialog.NasDialogForm has cyclomatic complexity 42 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 24 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa92c5715b77342f1be2921f8f731285b6cc08e8c12551ec938a4c8d7358297"}},{"ruleId":"D1","level":"warning","message":{"text":"file-routes.registerNasFileRoutes (cyclomatic 42): file-routes.registerNasFileRoutes has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to 8 function items inside it that branch (a function literal at line 219, a function literal at line 196, output, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b468169680643db3de111f763deecd83b6c23edb25d834e74adc558df78fc9c"}},{"ruleId":"D1","level":"warning","message":{"text":"download-source.analyzeDownloadSource (cyclomatic 42): download-source.analyzeDownloadSource has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/download-source.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"942521b7dfaae6a756315072400bf925cd160b773507ff96a67705167fb8a200"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineSupervisor.doStart (cyclomatic 41): EngineSupervisor.doStart has cyclomatic complexity 41 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb68aab6291e28e9421d411389f02630b10d1c8b2aa0ca29e9cc82acf7bfe30"}},{"ruleId":"D1","level":"warning","message":{"text":"verified-install.extractVerifiedTar (cyclomatic 41): verified-install.extractVerifiedTar has cyclomatic complexity 41 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c4657364357ac7b86d680a237bf3d258651d92d737ecf7d7a90bf48800f27d"}},{"ruleId":"D1","level":"warning","message":{"text":"downloads-page.DownloadsPage (cyclomatic 41): downloads-page.DownloadsPage has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 9 of the 41 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 230, 316, 217, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-page.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9475d19c791b9cf17d659355229d1b2e7e8c087e70aed7b71d54b5bc5db28d94"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-detail-page.PluginDetailPage (cyclomatic 41): plugin-detail-page.PluginDetailPage has cyclomatic complexity 41 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8e9e785506e51ab3097561acd427c2eae009823a8eae9b3c150cc308c9d02c"}},{"ruleId":"D1","level":"warning","message":{"text":"app-deep-link.parseAppDeepLink (cyclomatic 41): app-deep-link.parseAppDeepLink has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/app-deep-link.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e77a5885a75209c84a451097e8864dd35dff86b44c3b0c437833572701e30b7"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationService.prepare (cyclomatic 40): OperationService.prepare has cyclomatic complexity 40 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7279dedd5aabd3fef816a6ae32d89c681009e9ab7020d0a76b17fba7f2536512"}},{"ruleId":"D1","level":"warning","message":{"text":"DurableFinalizeRuntime.commit (cyclomatic 40): DurableFinalizeRuntime.commit has cyclomatic complexity 40 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/durable-finalize-runtime.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c824933c7641b639612e015d5feee6e9e7f3130891f049563007eb78665dce6d"}},{"ruleId":"D1","level":"warning","message":{"text":"task-actions-menu.TaskActionsMenu (cyclomatic 40): task-actions-menu.TaskActionsMenu has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (task-actions-menu.TaskActionsMenu::handleShortcut) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"043f04e22a505a403daa9dab6865cf97ed1dd872b467cd077f546fc76e611307"}},{"ruleId":"D1","level":"warning","message":{"text":"http-request-context.resolveLegacyHttpRequestContext (cyclomatic 39): http-request-context.resolveLegacyHttpRequestContext has cyclomatic complexity 39 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-request-context.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0504403eb135bc2d90d8788b4f609c44a9a18647f684a4d38deebefdd07e07fb"}},{"ruleId":"D1","level":"warning","message":{"text":"parse.parseManifest (cyclomatic 39): parse.parseManifest has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/manifest/parse.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef71defe6410098f5a9acc61dde3aaac5fd8c6bfac6714dae8f6d63d49bd86a"}},{"ruleId":"D1","level":"warning","message":{"text":"use-selectable-list.useSelectableList.onKeyDown (cyclomatic 39): use-selectable-list.useSelectableList.onKeyDown has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/hooks/use-selectable-list.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0442e1c6449e8169dbcb5971d8a25874a07a316865fdc44e09d2c6819f17d7bc"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketBridgeServer.constructor (cyclomatic 38): WebSocketBridgeServer.constructor has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 744, 667, 828, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a548ea3ff83402f09387b4735ecee246894b6c59fdcd354dedc3d25ef24a83"}},{"ruleId":"D1","level":"warning","message":{"text":"motrix-menu-button.ElectronMotrixMenuButton (cyclomatic 38): motrix-menu-button.ElectronMotrixMenuButton has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 7 of the 38 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 326, a function literal at line 378, a function literal at line 240, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a9d6175213b55d69fccee5e56a886329edc77ea18543d3c0ca4e865bacc2db"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy-fresh-download.LegacyFreshDownload (cyclomatic 38): legacy-fresh-download.LegacyFreshDownload has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 15 of the 38 points are its own statements and the rest belongs to 7 function items inside it that branch (cancelActivation, activate, prepare, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-fresh-download.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fec3ec35832678ef34b1595f48be9a7abbde1461ae72a9de93b43955b657d9"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-journal-repository.validateIntents (cyclomatic 37): finalize-journal-repository.validateIntents has cyclomatic complexity 37 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a54456b577770c00e301b2319f7ea044ec49f569dc16a7659346db24d306a85"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-input-group.PluginInputGroup (cyclomatic 37): plugin-input-group.PluginInputGroup has cyclomatic complexity 37 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 17 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-input-group.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ef323f4b1572f099ac5135aa0df77eef2567689fed69ccd31ee2939348dc17"}},{"ruleId":"D1","level":"warning","message":{"text":"verified-install.extractVerifiedFfmpeg (cyclomatic 36): verified-install.extractVerifiedFfmpeg has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 4 of the 36 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 551, 576, 527, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3481fc1f4707d9e3fcb69fb1ca8b7f8d4cd9f101e5b81ae978b8daf12bc9e3"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpCapabilityHost.request (cyclomatic 36): HttpCapabilityHost.request has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a85ddac66567a19473e7af1a3332d1e73c1867a1d1b6ceca996d75dc48603"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackerManager.performSyncAndCurate (cyclomatic 36): TrackerManager.performSyncAndCurate has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 12 of the 36 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 325, fetchKind, a function literal at line 439, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e283d3a8d03254535ed58724b4c7cb507fc074c60fd7dcb01dc838ccb3b52416"}},{"ruleId":"D1","level":"warning","message":{"text":"general-dialog.GeneralDialog (cyclomatic 36): general-dialog.GeneralDialog has cyclomatic complexity 36 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 20 belong to 9 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1608dfbca7e22ce885a790498f07de9cf6bd1b48259dde3e8cc89d6f142d9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"directory-preferences-section.DirectoryPreferencesSection (cyclomatic 36): directory-preferences-section.DirectoryPreferencesSection has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 9 of the 36 points are its own statements and the rest belongs to 5 function items inside it that branch (addFavorite, a function literal at line 160, a function literal at line 104, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e244022f0162c71c48bfce9eedf3afbcbb8c4a378df4846796861bbffcc5b85"}},{"ruleId":"D1","level":"warning","message":{"text":"operation-fields.OperationFields::renderField (cyclomatic 36): operation-fields.OperationFields::renderField has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-fields.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8723dbf94cbf1f8633394a6735897ed49898b685f59aadda4c27891238a4b7ed"}},{"ruleId":"D1","level":"warning","message":{"text":"log-redact.redactValue (cyclomatic 36): log-redact.redactValue has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f45f218b4a57c0985d14227e282d3e906e8b9b54bb373f841feb3ef143d90f"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginHost.doActivate (cyclomatic 35): PluginHost.doActivate has cyclomatic complexity 35 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 11 belong to 5 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3ccce68b9de131bd69116fb5ebb0102a2e74423fc2d49c3646057bd763cfaa"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletedEngineTaskCleanup.complete (cyclomatic 34): CompletedEngineTaskCleanup.complete has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 8 of the 34 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 206, 274). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completed-engine-task-cleanup.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a69c7c63db9f445bc319ae4169b8bac8447fe7d1cf328567d8e0ccd5f61af1"}},{"ruleId":"D1","level":"warning","message":{"text":"package-manager.classifyCliInstall (cyclomatic 34): package-manager.classifyCliInstall has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffc0298c50e0ee4710582e83e26f94dc9daa0b03e25ba7ca4f9b4b2158e9fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"appearance-dialog.AppearanceDialog (cyclomatic 34): appearance-dialog.AppearanceDialog has cyclomatic complexity 34 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 16 belong to 10 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaa5931bf15af107ea3333ea2536b0f2e476bf47916675a334613336fdb6cee"}},{"ruleId":"D1","level":"warning","message":{"text":"lifecycle (cyclomatic 34): lifecycle has cyclomatic complexity 34 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f55d74c247f972adde14795fc4a5ec105748df4833c4bdfc55a4fd2ccf4a74"}},{"ruleId":"D1","level":"warning","message":{"text":"moext-reader.extractLoadedMoext (cyclomatic 33): moext-reader.extractLoadedMoext has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 5 of the 33 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 293, 368, 390, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/moext-reader.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"618f98dfdfa8c018bbe6f24fc868855f0d222cb53840fbedb60d83c4e11b3068"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-task.finalizeTaskSerialized (cyclomatic 33): finalize-task.finalizeTaskSerialized has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1100c7154db7fc0efbe8c2d66c25660c4662f9109298bb61dd9aa98f86fb6337"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-diagnostics-page.PluginDiagnosticsPage (cyclomatic 33): plugin-diagnostics-page.PluginDiagnosticsPage has cyclomatic complexity 33 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e979868a5a1d6096016747bfcf1fff2d76b4ec527549d562abd8d3ae1ccd897"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker-sync-details.TrackerSyncDetails (cyclomatic 33): tracker-sync-details.TrackerSyncDetails has cyclomatic complexity 33 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 13 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/tracker-sync-details.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad31ae1e3d5ed49b51428390342b92e46c5d06848a16fecbb6dccd50386d647e"}},{"ruleId":"D1","level":"warning","message":{"text":"transfer-tile.TransferTile (cyclomatic 32): transfer-tile.TransferTile has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2d9582d5cbf064427267daa81b9a657b4bde20b96bd0b58b8960db1fc4bd21"}},{"ruleId":"D1","level":"warning","message":{"text":"use-task-actions.useTaskActions.onRetry (cyclomatic 32): use-task-actions.useTaskActions.onRetry has cyclomatic complexity 32 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ca03c90b98b1aac559b83284dddff12809e9f47013d9f9e2e5d5c2a384b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"network-dialog.NetworkDialog (cyclomatic 32): network-dialog.NetworkDialog has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 12 of the 32 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 135, 119, 121, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b430af675c1f5be80ca093e8d0ade693b4db961915aa43c3efe7a32ff1c57f"}},{"ruleId":"D1","level":"warning","message":{"text":"window-chrome.WindowChrome (cyclomatic 32): window-chrome.WindowChrome has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/window-chrome.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7935c9c4a3e0c24b5c1a437d1740fbda4366b5338aa9f5a040da2bb908f2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"marquee-overlay.MarqueeOverlay (cyclomatic 32): marquee-overlay.MarqueeOverlay has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 133, 78, 164, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e2a3713d54818d4c9a93792d56e6441bd0b10822f2088b4b7e5f77aaa4d94b"}},{"ruleId":"D1","level":"warning","message":{"text":"settings-validation.settingsValidationError.\u003Creturned closure\u003E (cyclomatic 32): settings-validation.settingsValidationError.\u003Creturned closure\u003E has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/settings-validation.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e728b4359216339c0935eec5a201a272b6193e3826a491cd0e0a16fd8178d92"}},{"ruleId":"D1","level":"warning","message":{"text":"index.main::startServer (cyclomatic 32): index.main::startServer has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (index.main, index.main::handlePolledTasks) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc650b828dd3a73f49d6c57359702ca0f9afc344d05b19ce7c5695888b54702e"}},{"ruleId":"D1","level":"warning","message":{"text":"applyPendingSettings (cyclomatic 32): applyPendingSettings has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 10 belong to 7 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb74617c80ec1724b2ecf12f866c73ba589d3f88150d0515eef355bee58f242a"}},{"ruleId":"D1","level":"warning","message":{"text":"task-cookies.prepareAria2TaskCookies (cyclomatic 31): task-cookies.prepareAria2TaskCookies has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/task-cookies.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fcd3a7d3b2c3c49b330b4a67c8629248de694e4f76a054b22de698e3d96fcc"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineSupervisor.diagnose (cyclomatic 31): EngineSupervisor.diagnose has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca38604b42c17a89ffea1b2b20ab2eb693ebad8f70e789dc739f27f73263750"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyImportService.scanPreview (cyclomatic 31): LegacyImportService.scanPreview has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37bb105560ed305816e771b29934a03374794d1489dc9bd8348b129c214635a"}},{"ruleId":"D1","level":"warning","message":{"text":"hls-parser.parseHlsMedia (cyclomatic 31): hls-parser.parseHlsMedia has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/hls-parser.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"538a3c57a48c4391161d61bd2bec40a86389aa807abce1abb89eaeb13d5338bd"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationFiles.pick (cyclomatic 31): OperationFiles.pick has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d3c26af4a61e357f4d3bacad0c06b81dca47d9e0ff76bafecbd19c152b9926"}},{"ruleId":"D1","level":"warning","message":{"text":"RendererSupervisor.tick (cyclomatic 31): RendererSupervisor.tick has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"570527f4be7b0dc76f9d59fc5c23e810480aaf45d25a3e9f08ed00d5d21b2490"}},{"ruleId":"D1","level":"warning","message":{"text":"advanced-dialog.AdvancedDialog (cyclomatic 31): advanced-dialog.AdvancedDialog has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 8 of the 31 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 355, 125, 318, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3f2e0799c94099b9f8adde902a017abba4296691399f9105abe13cc9dd301e"}},{"ruleId":"D1","level":"warning","message":{"text":"use-pending-magnet-selection.usePendingMagnetSelection (cyclomatic 31): use-pending-magnet-selection.usePendingMagnetSelection has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 61, 28, 98, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task-dialog/use-pending-magnet-selection.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c6bc578d18c6b2e39bc3ec76806290c5de104c4820d64cada2063c4395e8bb"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizeRecovery.recoverRenameFile (cyclomatic 30): FinalizeRecovery.recoverRenameFile has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7006851e63bcf813aaa216e443cc5f3547fef96e84331a881177fb8f46726bff"}},{"ruleId":"D1","level":"warning","message":{"text":"quick-js-worker.injectPluginApi (cyclomatic 30): quick-js-worker.injectPluginApi has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 1664, 1593, 1637, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c8b17e80188d50854f728b04b953c2283c86040e401042cec9fb327fbdfb6c"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginInstaller.stage (cyclomatic 30): PluginInstaller.stage has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0487fe7602af04aaa71e1c892c9fb447a1e9a1da6e608ade659ae3132b848244"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handlePolledTasks (cyclomatic 30): index.handlePolledTasks has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"5401d9b94df578c38716dc3d5e14f96936cc9593acb0fa940e09bbccb9bdceb9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.startEngineAndRestore (cyclomatic 30): index.startEngineAndRestore has cyclomatic complexity 30 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 15 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"125b9b313bd2ab55d5f52d7d7fdeee22bb07fcd9b834007390724aeac39723c4"}},{"ruleId":"D1","level":"warning","message":{"text":"nat-tile.ElectronNatTile (cyclomatic 30): nat-tile.ElectronNatTile has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/nat-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"628757a370edc0fc0822b268711ca4b5122749068925e33fe368ce36528cfce2"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerDirectoryService.list (cyclomatic 30): ServerDirectoryService.list has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2e5e02ff244ac5c48220f4c2958fe56ef79f5e3d4f2c03b56b4de694a66b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"startAccountAuthority (cyclomatic 30): startAccountAuthority has cyclomatic complexity 30 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 12 belong to 20 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dde477ad77917f3c621f9f72820b6475602e2d89f707f1bccd388a068689b9"}},{"ruleId":"D1","level":"warning","message":{"text":"verified-install.installVerifiedFfmpeg (cyclomatic 29): verified-install.installVerifiedFfmpeg has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8c068cb0c0a1e7b32adcacbd29284c7d379e598cbe5400a6a57cdc1b4bc544"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizeRecovery.recoverReserved (cyclomatic 29): FinalizeRecovery.recoverReserved has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"488f67db8a065e64f7b6519b55e6da79609b20128eb34b63806207ac6f5d609d"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizeCommitter.commitPrepared (cyclomatic 29): FinalizeCommitter.commitPrepared has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"839dd07747abae8502c5fb8ae993c6b5d8e0e7571ffb8911b0e6209299d22eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"delivery-materializer.materializeCandidate (cyclomatic 29): delivery-materializer.materializeCandidate has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-materializer.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe45a9e63ce7de4cd983b91fe59ac93a30fcdadf5e9fa3ca97ceeccdc32daf20"}},{"ruleId":"D1","level":"warning","message":{"text":"re-add-task.buildDirectReAddParams (cyclomatic 29): re-add-task.buildDirectReAddParams has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d385c9ae560052361866cc93e029952f7608a932a55166a808d80bcde89989"}},{"ruleId":"D1","level":"warning","message":{"text":"ffmpeg-probe-electron.makeElectronFfmpegProbe.\u003Creturned closure\u003E (cyclomatic 29): ffmpeg-probe-electron.makeElectronFfmpegProbe.\u003Creturned closure\u003E has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-probe-electron.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4164cad92176da3c96f0d9986d678f84ad957e100e5376108db53fa3fa737d15"}},{"ruleId":"D1","level":"warning","message":{"text":"tile-segmented-control.ForwardedTileSegmentedControl (cyclomatic 29): tile-segmented-control.ForwardedTileSegmentedControl has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (handleKeyDown, adjacentEnabledValue, requestValueChange, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/tile-segmented-control.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fd541812318e3ead17735bf6484c4d2eadf362114208e7d4943d564436c1c6"}},{"ruleId":"D1","level":"warning","message":{"text":"bt-storage-dialog.BtStorageDialog (cyclomatic 29): bt-storage-dialog.BtStorageDialog has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/bt-storage-dialog.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c1e7602f4187f658c0b665f23c85a32d44058fe082081d421f9cd3c3225db6"}},{"ruleId":"D1","level":"warning","message":{"text":"task-inspector-drawer.TaskInspectorDrawer (cyclomatic 29): task-inspector-drawer.TaskInspectorDrawer has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-inspector-drawer.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"004387f73d311eabeccd6973f7578e5a447d366a1097ec0a209f1a3a665ef892"}},{"ruleId":"D1","level":"warning","message":{"text":"directory-preferences-dialog.OpenDirectoryPreferencesDialog (cyclomatic 29): directory-preferences-dialog.OpenDirectoryPreferencesDialog has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 7 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (keyDown, save, close, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f50a848c0b0f9b1181614280123fd1c565420e6f480b01605d6892b7124ab26"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationFiles.execution::dispatch (cyclomatic 28): OperationFiles.execution::dispatch has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccb040b1bb6e85086fb2fec0b684f36629702902060931ff1be9561600d0124"}},{"ruleId":"D1","level":"warning","message":{"text":"command-runner.createCommandRunner.\u003Creturned closure\u003E (cyclomatic 28): command-runner.createCommandRunner.\u003Creturned closure\u003E has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 125, 180, 199, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/process/command-runner.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"51361ab0f42b1a92c01c9cc2c8116c3587e32877be6c5d8d4ba39669fa5da62e"}},{"ruleId":"D1","level":"warning","message":{"text":"re-add-task.reAddTaskUnderMutation (cyclomatic 28): re-add-task.reAddTaskUnderMutation has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2ba6bbc09576ce76f12e184543aa16ddf33b05afe4f622e08def9591902204"}},{"ruleId":"D1","level":"warning","message":{"text":"index.bootstrapBridge (cyclomatic 28): index.bootstrapBridge has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 9 of the 28 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 963, a function literal at line 569, a function literal at line 852, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da1b126a1ddd448c205c4d7e9ae4430e4038cdb543c1945def980857990177b"}},{"ruleId":"D1","level":"warning","message":{"text":"appimage-integration.installSelfIntegration (cyclomatic 28): appimage-integration.installSelfIntegration has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4093fc10f74cb0698d6b6b64921a5030edf634c1eba9b1c99dce815038340b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ffmpeg-fetch-electron.fetchFfmpegAsset (cyclomatic 28): ffmpeg-fetch-electron.fetchFfmpegAsset has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 9 of the 28 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 83, 41, 61, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-fetch-electron.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b571d17bdca2af0dd815b87ee01cf4dfc40b28532402e350bf5db776b6538915"}},{"ruleId":"D1","level":"warning","message":{"text":"speed-sparkline.SpeedSparkline (cyclomatic 28): speed-sparkline.SpeedSparkline has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 50, 118, 62, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/speed-sparkline.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"66acf48b35e3d7b38216510ab75a98c5b9161d38a2955ca9bab79b7ffb9c6ca2"}},{"ruleId":"D1","level":"warning","message":{"text":"url-editor.UrlEditor (cyclomatic 28): url-editor.UrlEditor has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 60, 94, 97, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-editor.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4c5b6389496bbcfa5772c79c318c2b40b891fe671a52c9f71ea23ac092759"}},{"ruleId":"D1","level":"warning","message":{"text":"task-inspector-activity.cloneDataOnlyValue (cyclomatic 28): task-inspector-activity.cloneDataOnlyValue has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-inspector-activity.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"923d7cc322c623ab9312139d2b30eb8dcd7bc4f3e39a8d25bae8125b844ac512"}},{"ruleId":"D1","level":"warning","message":{"text":"source-scanner.readLegacyFile (cyclomatic 27): source-scanner.readLegacyFile has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2781ca52dd9e2d1cf641d1fd6f48e48d2440438c339c5ed632d39db2fac7fd1c"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyBtActivationService.prepare (cyclomatic 27): LegacyBtActivationService.prepare has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1a8fc7e33e359f537cf5ac265e06f9baf29c58891b1a7d7d66c2a683eb1b76"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-task.finalizeBtAfterRename (cyclomatic 27): finalize-task.finalizeBtAfterRename has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"72124501d2448d175ed6cd133779ae2efea3c207b14802e551210af07224321b"}},{"ruleId":"D1","level":"warning","message":{"text":"desktop-import.registerLegacyImportIpc (cyclomatic 27): desktop-import.registerLegacyImportIpc has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 234, a function literal at line 284, a function literal at line 124, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9b85c0a64c2e89514f7221e85f878050059fb9c19aa00795d38078541845ce"}},{"ruleId":"D1","level":"warning","message":{"text":"bt-peer-geo-section.BtPeerGeoSection (cyclomatic 27): bt-peer-geo-section.BtPeerGeoSection has cyclomatic complexity 27 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bt-peer-geo-section.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"14753edf2c10103d31a9f3f71ee5e9cfc72a0a3e70e71517c502feea41dcf868"}},{"ruleId":"D1","level":"warning","message":{"text":"bit-torrent-dialog.BitTorrentDialog (cyclomatic 27): bit-torrent-dialog.BitTorrentDialog has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 97, 135, 150, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14cd15c012fc4f6654d24668ab96c7aca8d711096960239dd01895fb2832f03"}},{"ruleId":"D1","level":"warning","message":{"text":"lifecycle (cyclomatic 27): lifecycle has cyclomatic complexity 27 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d9dca2b214a08d1083178afe36e796a6b693de8c1becf08a0c26401a2e4d69"}},{"ruleId":"D1","level":"warning","message":{"text":"account-authority.accountFromSnapshot (cyclomatic 26): account-authority.accountFromSnapshot has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b087d3048093ce04755f8c785c7d23b24e1a8c46e3d404bd8099cf32a3a4f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginRegistry.scanInto (cyclomatic 26): PluginRegistry.scanInto has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"15be41c7610595133a3d257f4a276861f4ad3c12b1218277aafeaa4b1a4cc779"}},{"ruleId":"D1","level":"warning","message":{"text":"task-save-directory.restoreTaskSaveDirectory (cyclomatic 26): task-save-directory.restoreTaskSaveDirectory has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-save-directory.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74e4ba619ca036a28e3002fae72ad2bb99568870131efd6d0ecadbb189b1dc8"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager.mergeTaskFromPair (cyclomatic 26): SessionManager.mergeTaskFromPair has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc6e185706be2c8e433f328307e3cf81044d4713b470df2e390f4ed11e37148"}},{"ruleId":"D1","level":"warning","message":{"text":"downloads-more-menu.DownloadsMoreMenu (cyclomatic 26): downloads-more-menu.DownloadsMoreMenu has cyclomatic complexity 26 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 9 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-more-menu.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e951f10d40c22e3d6ab04953e08261a5bf306a66a33cc51573205b84392e661"}},{"ruleId":"D1","level":"warning","message":{"text":"task-inspector-action-bar.TaskInspectorActionBar (cyclomatic 26): task-inspector-action-bar.TaskInspectorActionBar has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6866765929a7be12b963fb5f25940d83f14704b5c3b16b0d4d4aae909da75354"}},{"ruleId":"D1","level":"warning","message":{"text":"speed-limit-section.SpeedLimitSection (cyclomatic 26): speed-limit-section.SpeedLimitSection has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (fillFromPeak, a function literal at line 140, a function literal at line 431, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/speed-limit-section.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad36cdb1518630ebec8b027f442c568e3c9a18c91aefcaf3724c04d30eadca2"}},{"ruleId":"D1","level":"warning","message":{"text":"cli-tool-section.CliToolSection (cyclomatic 26): cli-tool-section.CliToolSection has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/cli-tool-section.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b889ff68376423b3239452e2d69b9edaf77384f7276a37b853613a7fcb2bf66"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskInspectorActivityService.recordSample (cyclomatic 25): TaskInspectorActivityService.recordSample has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a80fac8f40abd571dabc2b7884dedb038a05237aec2df39ded4769ee95f75b"}},{"ruleId":"D1","level":"warning","message":{"text":"aria2-legacy-http.requestMatches (cyclomatic 25): aria2-legacy-http.requestMatches has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: aria2-legacy-http.pinLegacyHttpOptions (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-legacy-http.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"20760288d7171e333d63aecd4f205c477f7c958cdcf59a6a20be8b1a4840fd81"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyImportService.runBatches (cyclomatic 25): LegacyImportService.runBatches has cyclomatic complexity 25 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"146a00b405c648dee2573f256abbc74a91bc9ce659f2d0dbceedb9248d31c398"}},{"ruleId":"D1","level":"warning","message":{"text":"http-cookies.parseSetCookie (cyclomatic 25): http-cookies.parseSetCookie has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"be151b462a6368ff85426eabd01a970fd798df0a805ab3322ffd2b8a3c21e765"}},{"ruleId":"D1","level":"warning","message":{"text":"move-tasks.moveBatch (cyclomatic 25): move-tasks.moveBatch has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (move, a function literal at line 37). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/move-tasks.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d142197f2d83673adaa2d0048b773429ec2f94556753ec8c6f7b264b1e2f8d"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletedEngineTaskCleanup.observe (cyclomatic 25): CompletedEngineTaskCleanup.observe has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completed-engine-task-cleanup.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3fc3de907049b5e05cbb011006f5a4c42bd694a38f5bb813c422344b427e1b"}},{"ruleId":"D1","level":"warning","message":{"text":"desktop-import.prepareFreshDownload (cyclomatic 25): desktop-import.prepareFreshDownload has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b8aa68e60b4bf195b8275cd3987c9bdbfe38fba502d28352cbb28a85661a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"overview-tab.OverviewTab (cyclomatic 25): overview-tab.OverviewTab has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/overview-tab.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"351ac042319b356098ce9fc5c654147be1abd6eb161c4c5ef75e184cd8a4331d"}},{"ruleId":"D1","level":"warning","message":{"text":"import-task-selection.ImportTaskSelection (cyclomatic 25): import-task-selection.ImportTaskSelection has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 6 function items inside it that branch (renderRow, a function literal at line 74, a function literal at line 150, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-task-selection.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b24287dcceda90f33a9d5151f79da689fa04f41a96582bcae1b2fb5022b950"}},{"ruleId":"D1","level":"warning","message":{"text":"use-engine-display-status.useEngineDisplayStatus (cyclomatic 25): use-engine-display-status.useEngineDisplayStatus has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 77, 61, 136, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-display-status.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b6c50185266750f6739ef38d636926cf70456da66796cc15304d739851a74d"}},{"ruleId":"D1","level":"warning","message":{"text":"operator-auth.registerOperatorAuth (cyclomatic 25): operator-auth.registerOperatorAuth has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 232, 286, 317, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/operator-auth.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f40211a793e0faeb9222a637d359fc585e45ada26ffd4aba52b6ffb1f2ad7a6"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapIPCCodec.validateResponse (cyclomatic 25): BootstrapIPCCodec.validateResponse has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/Sources/SafariNativeIPC/BootstrapIPCCodec.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d491e40f5a642c227d4f83c771b192ffeb189e3aebe51b4a6b01e650664edf7"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsManager.persistUpdate (cyclomatic 24): SettingsManager.persistUpdate has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5301b9b1441a5ee845057094e610c2f6ea4c032e9d0b35c396dbf4b5241d7489"}},{"ruleId":"D1","level":"warning","message":{"text":"verified-install.download (cyclomatic 24): verified-install.download has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc83a1d24d26b8987ac61e82ffe00b83ecb323bfa9c9fe3e557d681ada3be32a"}},{"ruleId":"D1","level":"warning","message":{"text":"FullCrossPluginInvoker.execute (cyclomatic 24): FullCrossPluginInvoker.execute has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/cross-plugin-invoker.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25a73f5d82f2634a01c9f18516283705f074caab3d27ccb41b9ffb6f4c0af68"}},{"ruleId":"D1","level":"warning","message":{"text":"CapabilityBridge.onMessage (cyclomatic 24): CapabilityBridge.onMessage has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65b17cd45ab178da6bbdcc6a876a430c8c17784e9cbd60b3bb5c1cea63dada8"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-committer.assertRenameFileJournal (cyclomatic 24): finalize-committer.assertRenameFileJournal has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"091f9cbaf93bedb0664c93d42d4712294ea8be3a3590553819f7945d30acd674"}},{"ruleId":"D1","level":"warning","message":{"text":"quick-js-worker.port.on(\u0022message\u0022) (cyclomatic 24): quick-js-worker.port.on(\u0022message\u0022) has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82c402794bfdba142798d69c1ddff0ae67a32fc0ac3526c692cca52f4eb4c46"}},{"ruleId":"D1","level":"warning","message":{"text":"MotrixNatManager.checkDiagnostics (cyclomatic 24): MotrixNatManager.checkDiagnostics has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/nat/motrix-nat-manager.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd5e7cc633979db7a27d1920627b30fb776ba28111b2bb88205cdeb9ad9305"}},{"ruleId":"D1","level":"warning","message":{"text":"portable-relocation.blockUnavailablePortableTasks (cyclomatic 24): portable-relocation.blockUnavailablePortableTasks has cyclomatic complexity 24 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/portable-relocation.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63225e26dc3e2a795fbaa6a2207b748de1962e156e334978c0ff041cce56874"}},{"ruleId":"D1","level":"warning","message":{"text":"notifications-page.NotificationsPage (cyclomatic 24): notifications-page.NotificationsPage has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 212, runAction, a function literal at line 284, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553f72b57307cc3b292360708b01e4cfcd1f60e3db71a353febb07b6bdaa4d5"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-call-graph-edge.PluginCallGraphEdge (cyclomatic 24): plugin-call-graph-edge.PluginCallGraphEdge has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-edge.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0a615b0985324a1881fa37718fa54f9c66e2689399ef812560df41df7de8b6"}},{"ruleId":"D1","level":"warning","message":{"text":"appimage-integration-section.AppImageIntegrationSection (cyclomatic 24): appimage-integration-section.AppImageIntegrationSection has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1469c9290a26208b2ba30690c5a4554a9cf1987aa8d4bef79d74a91c5179b41b"}},{"ruleId":"D1","level":"warning","message":{"text":"integration-dialog.IntegrationDialog (cyclomatic 24): integration-dialog.IntegrationDialog has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/integration-dialog.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a3c28cf0b7244b0a13863a5fe1b213c5b03db7cf5f74b4c63f367b0a696f72"}},{"ruleId":"D1","level":"warning","message":{"text":"inspector-drawer.InspectorDrawer (cyclomatic 24): inspector-drawer.InspectorDrawer has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 87, a function literal at line 169, selectHeight, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/inspector-drawer.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7afa3ed9600151ff35326602e4aa1a3046a0e956521cd708e9568e2462ea2f"}},{"ruleId":"D1","level":"warning","message":{"text":"NasFileRemover.perform (cyclomatic 24): NasFileRemover.perform has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-remover.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a42ce9ef478d8cd84801d1416fb4de9b82b2a2aade4e1a0e6d50600d6f211c"}},{"ruleId":"D1","level":"warning","message":{"text":"validators.validateHistoryEventInput (cyclomatic 23): validators.validateHistoryEventInput has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/validators.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f974e116181bd7a4edb5d506ae50939ba723a31f97c83d5c03e69e0235fce"}},{"ruleId":"D1","level":"warning","message":{"text":"FfmpegService.run (cyclomatic 23): FfmpegService.run has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 4 function items inside it that branch (acceptLine, a function literal at line 130, a function literal at line 158, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/ffmpeg-service.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"489d30e1ca0e46529c525c903378cbd20a5b506954388157945ddad824bd24fe"}},{"ruleId":"D1","level":"warning","message":{"text":"session-parser.parseLegacySession::flush (cyclomatic 23): session-parser.parseLegacySession::flush has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3b84698c1526968d1fe2b3638373da58b63f55583e1bba98b8cb2a6377726b"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyImportService.authorizeMetadataAdmission (cyclomatic 23): LegacyImportService.authorizeMetadataAdmission has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (current, unchanged). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a2187257caaf24fbcb8ed29fbab51baffa276b836f50799efb065eca970fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationService.run (cyclomatic 23): OperationService.run has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c75ecbf6c018f39cb32bba9c29e1129a63cd84fc423a556177bcd1004e47b4"}},{"ruleId":"D1","level":"warning","message":{"text":"MagnetTracker.submitUnderAdmission (cyclomatic 23): MagnetTracker.submitUnderAdmission has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e7be3380374b0542073f33b73d625a3ce97e49321b7176fe72a12fcebd3b3b"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskRecoveryServiceImpl.recover (cyclomatic 23): TaskRecoveryServiceImpl.recover has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 217, recover). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7df925cc0224ba989cbd2d4f9caa1a18a058bd1dc1c783d640c5288172fad5"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackerSyncer.fetch (cyclomatic 23): TrackerSyncer.fetch has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 95). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-syncer.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef3ad9a884dd3e20302ed37eebeb195003b00418e63dd66e92a4950d4dfa335"}},{"ruleId":"D1","level":"warning","message":{"text":"compact-limit-input.CompactLimitInput (cyclomatic 23): compact-limit-input.CompactLimitInput has cyclomatic complexity 23 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/compact-limit-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c41a75245901baaef3f51d8dd207dd3051210120eacd9b33b293daf71915fa"}},{"ruleId":"D1","level":"warning","message":{"text":"toolbar-search.ToolbarSearch (cyclomatic 23): toolbar-search.ToolbarSearch has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 88, a function literal at line 136, collapseIfIdle, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/toolbar/toolbar-search.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9af48963dd592ff73a2cf23e1a7331899af99f90203917198967f91f900ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"semver.compareSemver (cyclomatic 23): semver.compareSemver has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/semver.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e97480867fb44351b18297c088ef1cbb64fd690d3d86d68b8cabc6bea8db2d"}},{"ruleId":"D1","level":"warning","message":{"text":"aria2-tuning.recommendFileAllocation (cyclomatic 22): aria2-tuning.recommendFileAllocation has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-tuning.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3677b78ffb9780057c99a9f3e89dad2541a6b50f3ecdc71d7aecbeeb6fea003d"}},{"ruleId":"D1","level":"warning","message":{"text":"i18n-resolve.walkContributes (cyclomatic 22): i18n-resolve.walkContributes has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 112, 85, 99). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/manifest/i18n-resolve.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75a74896e18162c04f9c757ede2f28b1941483e8f7ba213fc50781d34ab4141"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizeArtifactOperations.prepareFileRename (cyclomatic 22): NativeFinalizeArtifactOperations.prepareFileRename has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83d8c20683db81d66afec6655e3f5cfb7b4fa6ac9b1fb468d5ba23cfee78c3b"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginInstaller.commit (cyclomatic 22): PluginInstaller.commit has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 483, 639). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"409609be462a0f3c72b35efd59077f5f9abbc6f643284c50df025a4f7965f3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"CliToolService.#probe (cyclomatic 22): CliToolService.#probe has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e394050253fb9a7f4a294895cd2104bfce68cb69cc42cd345a0cb67c8a4b49"}},{"ruleId":"D1","level":"warning","message":{"text":"commands.registerCommandHandlers (cyclomatic 22): commands.registerCommandHandlers has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"1496bdab47d701b64da5f795f51b5372f85f7980221bc7ddda6747ffbe680fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"services.createElectronPlatformServices (cyclomatic 22): services.createElectronPlatformServices has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/services.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ef9debdd05e9fbdc4b847664bb5e4229e1c842032020ace98c05d35133e4ab"}},{"ruleId":"D1","level":"warning","message":{"text":"builtin-update-dialog.BuiltinUpdateDialog (cyclomatic 22): builtin-update-dialog.BuiltinUpdateDialog has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 49, confirm, cancel, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/builtin-update-dialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"067d2b2224a3d46625faac2f86e0c576e97d340eba583321a82a7744ee0154fe"}},{"ruleId":"D1","level":"warning","message":{"text":"chart.ChartTooltipContent (cyclomatic 22): chart.ChartTooltipContent has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 199, 146). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/chart.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"001884b4016605bc49ead6b3fe9a35aed2b54b086396f7bfbf364c80cbba603f"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectoryPickerController.commitListing (cyclomatic 22): DirectoryPickerController.commitListing has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6508d292df3147b7ccb9bb50cb612e47feeac58a10eb5862bbd597b51fb1a1d4"}},{"ruleId":"D1","level":"warning","message":{"text":"use-transfer-stats.useTransferStats (cyclomatic 22): use-transfer-stats.useTransferStats has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 75, 192, 101, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-transfer-stats.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0fdb6e126a7e52a09973b4c5567b1482dd7b7aac291955da1cb951c60d4f16"}},{"ruleId":"D1","level":"warning","message":{"text":"json-schema-to-zod.jsonSchemaToZod (cyclomatic 22): json-schema-to-zod.jsonSchemaToZod has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/json-schema-to-zod.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b066e6f548336b5d6e10095a390a3daf9bb1b68041d527b8ebea2a96936225"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpWsTransport.connectSocket (cyclomatic 22): HttpWsTransport.connectSocket has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 334, renew, a function literal at line 328, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"99424771f766cdd57683a5bf3ba5bea5e6c1e239a67d675e77e9c716e89fc344"}},{"ruleId":"D1","level":"warning","message":{"text":"SynologyTaskFiles.outputIdentity (cyclomatic 22): SynologyTaskFiles.outputIdentity has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/task-files.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a7fb0d179f9e2813107a1a88bdf3d0bcd6a568983f34cb43032f5e9c700100"}},{"ruleId":"D1","level":"warning","message":{"text":"motrix_native_host::probe::read_response_body (cyclomatic 22): motrix_native_host::probe::read_response_body has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/probe.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b688cccfce58dcd8b2d4ad1dc85aeca2d1804edd5f2a7365d933a958cd4b77"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-extension-config.parsePublicUrl (cyclomatic 21): remote-extension-config.parsePublicUrl has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"117b0f8f05fbd476a95fdd97764c641517ff4af82d47d7bf76ce60eca966c3bb"}},{"ruleId":"D1","level":"warning","message":{"text":"PairSession.onPairHello (cyclomatic 21): PairSession.onPairHello has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2999ef90ce9d7f0228a6e5dbc6b0fbaf124f1df552770d9478e45e2648738d91"}},{"ruleId":"D1","level":"warning","message":{"text":"merge-engine-task.mergeEngineTask (cyclomatic 21): merge-engine-task.mergeEngineTask has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: merge-engine-task.hasEngineTaskDelta (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/merge-engine-task.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfcdfa732cec2253685cb1ee69c71f986529d0798edacf45add53635e8481f7"}},{"ruleId":"D1","level":"warning","message":{"text":"MagnetTracker.retryMetadataUnderMutation (cyclomatic 21): MagnetTracker.retryMetadataUnderMutation has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25e2f88b93f456661a42512310c8540da872ad676010c74ac02a6f8e8c80ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker-snapshots.mergeSourceSnapshots (cyclomatic 21): tracker-snapshots.mergeSourceSnapshots has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-snapshots.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e0bb2faff940861e5be34070ba5eeba58d5d366bc6cf61d3fef366e763c185"}},{"ruleId":"D1","level":"warning","message":{"text":"CliToolService.#verifyInstall (cyclomatic 21): CliToolService.#verifyInstall has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"752bb4b0a86f5c9bbd762f74298eefc844db2cb4f4ec6965d2646188fccbd817"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-calendar-model.selectActivityGeometry (cyclomatic 21): activity-calendar-model.selectActivityGeometry has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7438a354b2e4a9f6031b61e33b5e7e07019a56a75e2b30683f3a2085bf25a5bf"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-chart-model.buildActivityChartModel (cyclomatic 21): activity-chart-model.buildActivityChartModel has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/activity-chart-model.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"de39bf1f30dc2f4ede74cd0c083bdb7f5b7cc865ca19c27d355a25e2502390d1"}},{"ruleId":"D1","level":"warning","message":{"text":"use-directory-preferences-draft.useRevisionedDirectoryDraft.save (cyclomatic 21): use-directory-preferences-draft.useRevisionedDirectoryDraft.save has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/use-directory-preferences-draft.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e885171a82b0e10055e81d88eea110efe6c317b593bb26022a3e720915a3b9"}},{"ruleId":"D1","level":"warning","message":{"text":"use-polled-query.usePolledQuery (cyclomatic 21): use-polled-query.usePolledQuery has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 109, 90, 82, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-polled-query.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c4bfa0c94859a72d2a214d7f0564e8c96f8208619c926974d97842922242bd"}},{"ruleId":"D1","level":"warning","message":{"text":"server-process-ownership-authority.readExactBinding (cyclomatic 21): server-process-ownership-authority.readExactBinding has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-process-ownership-authority.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5866df11e0bb8d9d3ac0d72044c5b5bbd057e06febd555bb0c73addcbbfdc9bb"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-hooks.isBoundedJsonValue (cyclomatic 21): plugin-hooks.isBoundedJsonValue has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce22f81a35c9b609593e1cf055f98ce4a0b41391afa75446099c21ad106a771"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-extension-config.parseRemoteExtensionConfig (cyclomatic 20): remote-extension-config.parseRemoteExtensionConfig has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc55bc48925f8cabe89d89db9a4a697c8b4752cfceffccc662f53b24e1736fc"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-extension-admission-policy.parseForwarded (cyclomatic 20): remote-extension-admission-policy.parseForwarded has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2091e16fa2f02c8c3adad94523ae5402950f9f97d0930b287f13ce33bcdf2089"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskInspectorActivityService.selectOrdinaryCandidate (cyclomatic 20): TaskInspectorActivityService.selectOrdinaryCandidate has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a752f6eeb786aa1b38a53dfd5df237ed0fd95e19a8bc3fd70183198852abc6"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge-data-dir-lock.createOwnedFile (cyclomatic 20): bridge-data-dir-lock.createOwnedFile has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06ad04ad9b7b89d5c601bf7e071ee11e1911288e6ef137706b7ef962a1f918e"}},{"ruleId":"D1","level":"warning","message":{"text":"extension-identity-resolver.normalizeExtensionIdentity (cyclomatic 20): extension-identity-resolver.normalizeExtensionIdentity has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-identity-resolver.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3babc5a4257c688672a0a4214352b50ac43b3757e05e2599a4664f2fc5b47489"}},{"ruleId":"D1","level":"warning","message":{"text":"Aria2ProcessOutput.emitLine (cyclomatic 20): Aria2ProcessOutput.emitLine has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-output.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66c3cd53652aee113c32cf7fa698687b5810522a02193c84fda9910cc2d0eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskInspectorActivityRuntime.deliverRecoveredAnchor (cyclomatic 20): TaskInspectorActivityRuntime.deliverRecoveredAnchor has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 790). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"edee8d39fec7023a28875ef99706d3ee3610f74b5e5e0d262ac06c39c1597550"}},{"ruleId":"D1","level":"warning","message":{"text":"CookieJar.cookieHeader (cyclomatic 20): CookieJar.cookieHeader has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac837da57316e0437776b1e6fd5d59e481b8dd880a12ec239984bd6673269cb"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginRegistry.applyOverlay (cyclomatic 20): PluginRegistry.applyOverlay has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e743295910641820c4e68aae8ee8ac196eb096d768a97f0cd8b1e6b7b3bd04"}},{"ruleId":"D1","level":"warning","message":{"text":"registry-fetcher.fetchVerifiedPackageBytes (cyclomatic 20): registry-fetcher.fetchVerifiedPackageBytes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-fetcher.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f8471fa655784b5c1646def2a6eb12c3735756d4224a95be3775827d174497"}},{"ruleId":"D1","level":"warning","message":{"text":"aria2-proxy-routing.normalizeProxyUrl (cyclomatic 20): aria2-proxy-routing.normalizeProxyUrl has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5df7b142b1cae311eac77b58f8088e650739e5256d86491b93de193a267c66"}},{"ruleId":"D1","level":"warning","message":{"text":"system-proxy.parseProxyEnvironment (cyclomatic 20): system-proxy.parseProxyEnvironment has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/system-proxy.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db01a296ded06113eda4215c1459e9d31ff1568eb8bf3c8b73a14e13ac86d18"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectResourceValidatorService.verify (cyclomatic 20): DirectResourceValidatorService.verify has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a8474e38bba24e328cb1e628a6a4474cc79614165419d42b88f2b545ef1385"}},{"ruleId":"D1","level":"warning","message":{"text":"MagnetTracker.doCleanupCacheEntry (cyclomatic 20): MagnetTracker.doCleanupCacheEntry has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4c81e1874978478c843555d97bd07b235df65800e63100806aff716b90f725"}},{"ruleId":"D1","level":"warning","message":{"text":"create-torrent.createTorrent (cyclomatic 20): create-torrent.createTorrent has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/create-torrent.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0603b437f203e4af7945d832a1c75fd8e13c054f6eea04a86dd94e6ec7e54623"}},{"ruleId":"D1","level":"warning","message":{"text":"appimage-native-host.binaryHash (cyclomatic 20): appimage-native-host.binaryHash has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee742b371480b92473c3bc92213efcf38f28dc408a4174722ef6d94373d0595"}},{"ruleId":"D1","level":"warning","message":{"text":"task-actions-menu.TaskActionsMenu::handleShortcut (cyclomatic 20): task-actions-menu.TaskActionsMenu::handleShortcut has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (task-actions-menu.TaskActionsMenu) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cc82192e492d8afa1562caee3951ce8ebc1c84193ddef55858589ad3a47e1f"}},{"ruleId":"D1","level":"warning","message":{"text":"task-column-header.TaskColumnHeader (cyclomatic 20): task-column-header.TaskColumnHeader has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 82, 150, 112, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-column-header.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"224bf741912a43e1d0d6ef06c89d271f98e3680d3f40fe19083a734de6fb77d1"}},{"ruleId":"D1","level":"warning","message":{"text":"notifications-page.NotificationRow (cyclomatic 20): notifications-page.NotificationRow has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"861e8b5294df87c0e5c690091ec5626bdb01d845bf22d9ece77fc8bbd5f20afa"}},{"ruleId":"D1","level":"warning","message":{"text":"app-update-section.AppUpdateSection (cyclomatic 20): app-update-section.AppUpdateSection has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/app-update-section.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"25deb971049b72dd2b37d51a3d14e0919a6da26db5b8bc10bb9ac7bb28275a20"}},{"ruleId":"D1","level":"warning","message":{"text":"curl.tokenize (cyclomatic 20): curl.tokenize has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-interpreters/curl.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"19256384cc7f4e1a40fc5a563a5983b316d725a977d6f1469ab4ce44c9c61bcd"}},{"ruleId":"D1","level":"warning","message":{"text":"use-menu-command.useMenuCommand.\u003Creturned closure\u003E (cyclomatic 20): use-menu-command.useMenuCommand.\u003Creturned closure\u003E has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/use-menu-command.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b2f759a8038b6c1edf39260301b64f4efff6d45d87ec47eddfb6351990c0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"use-task-speed-history.useTaskSpeedHistory (cyclomatic 20): use-task-speed-history.useTaskSpeedHistory has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 97, 61, 74, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-speed-history.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"19db37b4bf0e50576e119b40fc8b8cc9375b836760c0e17e9038c0ecb4174927"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpWsTransport.invoke (cyclomatic 20): HttpWsTransport.invoke has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eb5f69fbe4f2f18efe829e289c2a2dd3a2b0e0538290348073c1459cf542a1"}},{"ruleId":"D1","level":"warning","message":{"text":"routes.registerFnosRoutes (cyclomatic 20): routes.registerFnosRoutes has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 34, 60, 25). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/fnos/routes.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23903daed23dc2e59e5765db20e4a28a13fd01f0fc0e775bce889234605ac86"}},{"ruleId":"D1","level":"warning","message":{"text":"log-redact.redactError (cyclomatic 20): log-redact.redactError has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b42355be2f10ee2afb86f76f572dc23229df9940efe499b1e6aca376537f471"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-extension-admission-policy.resolveForwardedSource (cyclomatic 19): remote-extension-admission-policy.resolveForwardedSource has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: remote-extension-admission-policy.normalizeVerifiedOrigin (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b101ceed1ea720b16f1ebd9eb1d978fabcabb7eb95df60e3c0ddadf8505108"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskInspectorActivityStore.applyCheckpoint (cyclomatic 19): TaskInspectorActivityStore.applyCheckpoint has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f81aa4cf0c27aaaffdd8c71da5fd540a9249736268ab9ea601e0fd10b20376"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketBridgeServer.resolveExtensionMbp1Route (cyclomatic 19): WebSocketBridgeServer.resolveExtensionMbp1Route has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39bc151bc1f8ef38bfd8b79f3c1293953df471ec8164ef43ece6581e0958181"}},{"ruleId":"D1","level":"warning","message":{"text":"GeoIPDownloader.download (cyclomatic 19): GeoIPDownloader.download has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-downloader.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5857be06442a25485b9c41a823b01695c4434c35b7f36afa3325427f4541461"}},{"ruleId":"D1","level":"warning","message":{"text":"FfmpegCapabilityHost.run (cyclomatic 19): FfmpegCapabilityHost.run has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 6 function items inside it that branch (abort, a function literal at line 411, a function literal at line 441, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2378c3b1c89fd4dc039789a0eb57da0529a3129ebfcaa39f5691dc861d740270"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-removal-safety.selectRemovalSurvivor (cyclomatic 19): finalize-removal-safety.selectRemovalSurvivor has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-removal-safety.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf5e75ead23a6332d7df547d4302fa3616e195043fe128d190db090fa4f5eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizeArtifactOperations.removeIsolated (cyclomatic 19): NativeFinalizeArtifactOperations.removeIsolated has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a0ee2643438e1d7c9ed2e1d8bdd5423acf687dec649207d4f04272c2744e2d"}},{"ruleId":"D1","level":"warning","message":{"text":"aria2-proxy-routing.parseAria2ProxyUrl (cyclomatic 19): aria2-proxy-routing.parseAria2ProxyUrl has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccaffcfa624d7d8a5ebe4048cfd4f36d5b5b4e0d49b6f1dda4148d76c73942b"}},{"ruleId":"D1","level":"warning","message":{"text":"bt-duplicate-policy.inspectBtDuplicate (cyclomatic 19): bt-duplicate-policy.inspectBtDuplicate has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-duplicate-policy.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"89697a985b6cc8f39c4f713009155f0f2e74aaeb00b1feb6ce5d774bcdd7a482"}},{"ruleId":"D1","level":"warning","message":{"text":"index.syncNativeMessagingManifests (cyclomatic 19): index.syncNativeMessagingManifests has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4703f0041fefb9344d35e4b0a09dc273e8439a99dfef565a7a4f6364766e83"}},{"ruleId":"D1","level":"warning","message":{"text":"MenuManager.executeApplicationMenuItem (cyclomatic 19): MenuManager.executeApplicationMenuItem has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/menu-manager.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"241dac271cce55f338cac4c672d00d8e75e815ccbe9c77c41220e0a27bdb344d"}},{"ruleId":"D1","level":"warning","message":{"text":"files-tab.FilesTab (cyclomatic 19): files-tab.FilesTab has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/files-tab.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"950f312449b0fa4d44d13d6bed19daaf6db9da8ccd2c5a952081d56162d80a77"}},{"ruleId":"D1","level":"warning","message":{"text":"inline-consent-panel.InlineConsentPanel (cyclomatic 19): inline-consent-panel.InlineConsentPanel has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/inline-consent-panel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d13d853b4b8e355abc25719dff3a666d97fdb4c6758ab86f0b5ac1b89c219b5"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy-section.ProxySection (cyclomatic 19): proxy-section.ProxySection has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (handleImportFromSystem, a function literal at line 344, a function literal at line 74, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/proxy-section.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17036c1a6d68c2235e5e2a26904c3e38869940ccc6c37de8bb435e77f1b0efb"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebar.SidebarProvider (cyclomatic 19): sidebar.SidebarProvider has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 103, 73, 82, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/sidebar.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3c82b0607a5c663a2ccef56721b3656e947ba2b6b828ef4d95416735c12990"}},{"ruleId":"D1","level":"warning","message":{"text":"use-transport-mirror.useTransportMirror (cyclomatic 19): use-transport-mirror.useTransportMirror has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 140, 113, 207, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-transport-mirror.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc7a4419c7e8a8e188cd12e4c8034bab4d0ccff14d84b212021a1e54fa46ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"file-routes.nasFileRange (cyclomatic 19): file-routes.nasFileRange has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7716162223b72879341bff226af009b0a79e8f2d7d97e0d271e9cc9e2ec68fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"operator-extension-pairing.runExtensionPairingTerminal (cyclomatic 19): operator-extension-pairing.runExtensionPairingTerminal has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-extension-pairing.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e7e25c901c89d2158ccd9fffaf19743f38fbe78faa82c634d165d88391dc19"}},{"ruleId":"D1","level":"warning","message":{"text":"log-redact.limitVerboseValue (cyclomatic 19): log-redact.limitVerboseValue has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"972b42f4514c1c15fe714e579d5aba1fc6244dbf04dd48f8eabd153a356d37e8"}},{"ruleId":"D1","level":"warning","message":{"text":"loadAuthorityKey (cyclomatic 19): loadAuthorityKey has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0525907fe00b3969c2e0ee1244ae498ceb74d70a3efe0fc28a7bfba4fabe3672"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-extension-route-policy.evaluateRemoteExtensionRoute (cyclomatic 18): remote-extension-route-policy.evaluateRemoteExtensionRoute has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-route-policy.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bb5200aafdda2019a8c597f0cf612cc389fa0434f0783e9077e1f979aa72ec"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskInspectorActivityService.closeAtExactTerminalTransition (cyclomatic 18): TaskInspectorActivityService.closeAtExactTerminalTransition has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9b04453f7d49f66b65b217c119c6a139ea6276d99f1d1f525ea62c978a9077"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyHttpActivationService.sourceContext (cyclomatic 18): LegacyHttpActivationService.sourceContext has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c90a4b8f28f0910fed8c06e752ad1e4944f1f7bddd543c5b9496e98df1e1f92"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyHttpActivationService.verifyPayload (cyclomatic 18): LegacyHttpActivationService.verifyPayload has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf774166ed11fda2c063a3d36d8ac608bf54cdb259d6417dbf3cea48eb57e71"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyHttpActivationService.retainedContentDigest (cyclomatic 18): LegacyHttpActivationService.retainedContentDigest has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"38194e7d0d0d52b3939a810b36002595ace2800b4f536847ddb5f36667c405ae"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyImportService.commitAdmission (cyclomatic 18): LegacyImportService.commitAdmission has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a242ad32f1a8d6f4fc4697dd0e28aa7221d32359d6cb53a3175bd8520504f50d"}},{"ruleId":"D1","level":"warning","message":{"text":"CapabilityBridge.dispatchFfmpeg (cyclomatic 18): CapabilityBridge.dispatchFfmpeg has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb0eaffc10c29be1d87f8fefce987a44666614dc8d5ba1dfaf37964c0f4c548"}},{"ruleId":"D1","level":"warning","message":{"text":"CapabilityBridge.applyHookEffects (cyclomatic 18): CapabilityBridge.applyHookEffects has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"cada3e80fb8f2a4e9bca21a1a4376072558c17bc758068e1dc3d2c9d79caa8a7"}},{"ruleId":"D1","level":"warning","message":{"text":"magnet-cleanup-quarantine.isTaskRow (cyclomatic 18): magnet-cleanup-quarantine.isTaskRow has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-cleanup-quarantine.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde5ee2fc9c97f1e4c37a3e1a0558d470719335b5a0d0b6833b3e25d42b1eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-task.finalizeBt (cyclomatic 18): finalize-task.finalizeBt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87f1d3b90551011ed59db34a32d2dd5f6262f9e9352c594b27ffbc729130f45"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-task.finalizeBtInPlace (cyclomatic 18): finalize-task.finalizeBtInPlace has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f243511069a62cc82d406335108c421dafdc6ea25c2759375693afcc65136b0"}},{"ruleId":"D1","level":"warning","message":{"text":"MagnetTracker.deferCleanup (cyclomatic 18): MagnetTracker.deferCleanup has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"136fb84b724eb251237c02b26807f053054b0bdbda059d7cb390fc166be35bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"magnet-tracker.isSafeSwapCleanupArtifactPath (cyclomatic 18): magnet-tracker.isSafeSwapCleanupArtifactPath has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f1ae91900d020876c540149aafb747f72e2df5e11dd882a0744705e0964fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionShutdownController.execute (cyclomatic 18): CompletionShutdownController.execute has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completion-shutdown-controller.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dfcc6f26549ae0906b47df227eab4c4175559a7d3cb93c1a202dcdce7e6d96"}},{"ruleId":"D1","level":"warning","message":{"text":"get-task-files.createGetTaskFilesHandler.getTaskFiles (cyclomatic 18): get-task-files.createGetTaskFilesHandler.getTaskFiles has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/get-task-files.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fc78925505add20308b48455518a967f14eafcf12977c01e21af38b223c6c5"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskRecoveryServiceImpl.applyAction (cyclomatic 18): TaskRecoveryServiceImpl.applyAction has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aec14e3138f93607537dbc7de24b249b1300d7618854141249a3ec3807eed87"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackerProber.probeUdp (cyclomatic 18): TrackerProber.probeUdp has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 150, 130, 125, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-prober.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"948dd101cd14167c0e99ad18a005781050d183ec1dcb56569a6032b53a9d18b2"}},{"ruleId":"D1","level":"warning","message":{"text":"AppImageNativeHost.install (cyclomatic 18): AppImageNativeHost.install has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1784c151c26c6d4af20dcfaa666651dbd638853626782d1d76d66154ead5e619"}},{"ruleId":"D1","level":"warning","message":{"text":"tasks-tile.TasksTile (cyclomatic 18): tasks-tile.TasksTile has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b255ffa086d7d51cbd6c7242465dd08a444b79c6b659b7eb95f359b53ce390"}},{"ruleId":"D1","level":"warning","message":{"text":"task-row.TaskRowBase (cyclomatic 18): task-row.TaskRowBase has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-row.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8931efd161e983c9f1d1cddbab97d67372d13ed9f2362a35c93a9baf61dc8e"}},{"ruleId":"D1","level":"warning","message":{"text":"drop-zone.DropZone (cyclomatic 18): drop-zone.DropZone has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (selectNasTorrent, a function literal at line 36, a function literal at line 101, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/drop-zone.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b55b324c755b8c8b267087350d8965ad97efd799c515624032bcd35f31cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"file-list.FileList (cyclomatic 18): file-list.FileList has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 130, toggleSelectAll, toggleFile, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/file-list/file-list.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb2f1013d7a624c17fc700fb95abc50e527f40cc26d4265f0d88f9aa5de3540"}},{"ruleId":"D1","level":"warning","message":{"text":"use-notification-toasts.useNotificationToasts (cyclomatic 18): use-notification-toasts.useNotificationToasts has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 169, 130, 162). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-notification-toasts.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"126ea2f831178d978d6b24629bf2d112e191a09b0fdf278651b7502e1a244c19"}},{"ruleId":"D1","level":"warning","message":{"text":"use-task-files.useTaskFiles (cyclomatic 18): use-task-files.useTaskFiles has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 48, 77, 95, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-files.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"633d8e8a1d6f59682d601a699d4496e976c9b0992d99b85cff1918b0c71f17b2"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpWsTransport.ensureSocket (cyclomatic 18): HttpWsTransport.ensureSocket has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ddb3406e54238cdb780709c5b957fe10ea4d9c16f63a0c624167bd0e9c2ab4"}},{"ruleId":"D1","level":"warning","message":{"text":"log-redact.limitVerboseError (cyclomatic 18): log-redact.limitVerboseError has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd737b2f3a7d8752c8bdd10d18fd070bdfaff9deb5a95f790f88210173563cb"}},{"ruleId":"D1","level":"warning","message":{"text":"task-inspector-activity.findTaskSpeedUpdate (cyclomatic 18): task-inspector-activity.findTaskSpeedUpdate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-inspector-activity.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7588d2824febbdc4fb459540f8bb86a8035f19103301805cc8e98b3de3817100"}},{"ruleId":"D1","level":"warning","message":{"text":"runtimeEnvironment (cyclomatic 18): runtimeEnvironment has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1894558601cabee1531901a30cc9bbf446ec3fb1f7e03639e001dd971c5a6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"authority-lifecycle.main (cyclomatic 17): authority-lifecycle.main has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/authority-lifecycle.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e5ae84faaff7c9d594b9bb5c79923aa72be9f7548a04ee9df26527a741a7de"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskInspectorActivityStore.applyTransition (cyclomatic 17): TaskInspectorActivityStore.applyTransition has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0edea6ef01c77eed433fab5634955e94b6f5a929381179969485ba6f6a30f0"}},{"ruleId":"D1","level":"warning","message":{"text":"HlsDashPipeline.dispatch (cyclomatic 17): HlsDashPipeline.dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/pipelines/hls-dash-pipeline.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3340ab81feeb667353620919dd1cf16c8ea7fdbac4c9ff669eddaafe008416c8"}},{"ruleId":"D1","level":"warning","message":{"text":"BridgeReceiver.dispatchAdapted (cyclomatic 17): BridgeReceiver.dispatchAdapted has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/bridge-receiver.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb4d384dfa4e3805cf8fcbd45807ee40eb749bd33540c0d7e9b67ff68ab011f"}},{"ruleId":"D1","level":"warning","message":{"text":"FileExtensionPairingProjectionStore.saveChecked (cyclomatic 17): FileExtensionPairingProjectionStore.saveChecked has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/file-extension-pairing-projection-store.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf2ad58de360235b377e99b98e30940d043a4d132f2512917ba997ce6fe1f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Aria2PauseState.reconcile (cyclomatic 17): Aria2PauseState.reconcile has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-pause-state.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"85258271d05bcaf2610e56b872835d654ef80226ad1522eb0bec4cd3d40d0431"}},{"ruleId":"D1","level":"warning","message":{"text":"Aria2ConfigBuilder.buildArgs (cyclomatic 17): Aria2ConfigBuilder.buildArgs has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-config-builder.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07af5dca7d4672fa46d3277a30a6265d1f005ebfc2b39d303288332ec2de437"}},{"ruleId":"D1","level":"warning","message":{"text":"verified-release.verifyFfmpegRelease (cyclomatic 17): verified-release.verifyFfmpegRelease has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-release.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aac9dc65249b66f1498b78d32e004765915f402d440c8403715f5bab78f89cd"}},{"ruleId":"D1","level":"warning","message":{"text":"fs-sandbox.resolveDeepInsideSandbox (cyclomatic 17): fs-sandbox.resolveDeepInsideSandbox has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-sandbox.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f670071040a6dff38181867d9db5de8479f0fb251fad499fe829d1a77f37b2be"}},{"ruleId":"D1","level":"warning","message":{"text":"command-graph.readSnapshot (cyclomatic 17): command-graph.readSnapshot has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/command-graph.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5c34fab8a78946f894664a29f3981196b6fca2472764c5fff0a4a290207fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginHost.activate (cyclomatic 17): PluginHost.activate has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc249eb4c3a62dd9943279caead3597b1a28abe2e3e80bffb86e37bc61c0ef7"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizeArtifactOperations.publishReserved (cyclomatic 17): NativeFinalizeArtifactOperations.publishReserved has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b3ffeab20892c37dd860ecfec924ebf0e8d739ab99575d801d5ab4352179b8"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizeArtifactOperations.removeKnown (cyclomatic 17): NativeFinalizeArtifactOperations.removeKnown has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"464b248582be80675b523df46c5528dd0b1564f70c8ca8c10f7f26ad5c5b70a9"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectRecoveryPlanner.plan (cyclomatic 17): DirectRecoveryPlanner.plan has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/direct-recovery-planner.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe4844733c0de9e569ff2cdf79d38e827c7e43350fd0dc347f902d01e1c231b"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-journal-repository.transitionAllowed (cyclomatic 17): finalize-journal-repository.transitionAllowed has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bd4ece7ff5dd61cda428190214463a08ca33bff91b87a6f878fb64254afe62"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectResourceValidatorService.verifyLegacyContent::verifyRange (cyclomatic 17): DirectResourceValidatorService.verifyLegacyContent::verifyRange has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"986a525858ee64afe9e111a4d910c73713bbf2ef66b61928a9bf0813f44b3c1a"}},{"ruleId":"D1","level":"warning","message":{"text":"direct-resource-validator.redirectRequestUrl (cyclomatic 17): direct-resource-validator.redirectRequestUrl has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c1cc1238a975a01482047fcf27fc0437029ba891d5c9a7bea7ce9cad8c4e5"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlitePostDeliveryRepository.admissionRejection (cyclomatic 17): SqlitePostDeliveryRepository.admissionRejection has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72df3596b77a810865d9994e6013460dbd1ff4446ffda070cc33937e19c129"}},{"ruleId":"D1","level":"warning","message":{"text":"create-task-handler.createAdmittedTask (cyclomatic 17): create-task-handler.createAdmittedTask has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe650caa73cf0983b50a5e0e9c22d47333141b144b25844f46f4706870710f2"}},{"ruleId":"D1","level":"warning","message":{"text":"safari-bootstrap-registration.registerSafariBootstrap (cyclomatic 17): safari-bootstrap-registration.registerSafariBootstrap has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/safari-bootstrap-registration.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"524cac790f9a22eea82d6b2b9b9c5ca4cb7f6dd55ad0e3e47c233080d1701cd3"}},{"ruleId":"D1","level":"warning","message":{"text":"BridgeManager.stopCurrent (cyclomatic 17): BridgeManager.stopCurrent has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/bridge-manager.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a18e90530da034155fbee0cd82fc61587cc99bc1cf193e3c7990e17fdd10cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"RendererSupervisor.created (cyclomatic 17): RendererSupervisor.created has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 7 function items inside it that branch (onInPageNavigation, onNavigation, onLoadFailure, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3216cbb24c30e36d0b366c33aa042174ccc879dd67f6c321ded66db8724886c1"}},{"ruleId":"D1","level":"warning","message":{"text":"completion-shutdown.setupCompletionShutdown (cyclomatic 17): completion-shutdown.setupCompletionShutdown has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 58, 76, 48, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/completion-shutdown.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef10eb493074de31f8e869020ee7bad12c83065924015667b67e11117af14baa"}},{"ruleId":"D1","level":"warning","message":{"text":"engine-tile.EngineTile (cyclomatic 17): engine-tile.EngineTile has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/engine-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f62666b00669e526116f83b70d2c95a342aafd9af05c018d1109214b8930f78"}},{"ruleId":"D1","level":"warning","message":{"text":"use-plugin-install.usePluginInstall.startInstall (cyclomatic 17): use-plugin-install.usePluginInstall.startInstall has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a735be927799de094b1063c7bca8fd013a055feb931a187e1cf7ef947e1281"}},{"ruleId":"D1","level":"warning","message":{"text":"trusted-extensions-section.TrustedExtensionsSection (cyclomatic 17): trusted-extensions-section.TrustedExtensionsSection has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 187, handleAdd, a function literal at line 110, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"485fe1f42729d8badeb80374a16ae22c53d919f62501254a2ae13bc8db48e6b0"}},{"ruleId":"D1","level":"warning","message":{"text":"browser-extensions-section.BrowserExtensionsSection (cyclomatic 17): browser-extensions-section.BrowserExtensionsSection has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 136, 65, 176). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d939bb02e13352a471562b65a74254405c022e1cc1f9a4d84cb2d858115aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"add-task-dialog-host.AddTaskDialogHost (cyclomatic 17): add-task-dialog-host.AddTaskDialogHost has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 118, 52, 91, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task-dialog/add-task-dialog-host.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7b23f2de73b9455a942edb1aedf3f90411bb55edfc6809bff607750db649d8"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectoryPickerController.start (cyclomatic 17): DirectoryPickerController.start has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4989ce73ff25a505533813842123bdbebc893886a3518fc4356a3442bb118ec4"}},{"ruleId":"D1","level":"warning","message":{"text":"use-task-inspector-activity.useTaskInspectorActivity (cyclomatic 17): use-task-inspector-activity.useTaskInspectorActivity has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 147, 134, 93, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-inspector-activity.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"871d069b91ffebb4763545d3c1d1cb3a35e1698cb6e9a036cb054820d2f5f7e5"}},{"ruleId":"D1","level":"warning","message":{"text":"nas.synologyFileAction (cyclomatic 17): nas.synologyFileAction has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/platform/nas.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a193ab7ceacb438a16bd803c1799e5696fe146e49afaa53fcbdbd6bc82b737d"}},{"ruleId":"D1","level":"warning","message":{"text":"match.matchesAccelerator (cyclomatic 17): match.matchesAccelerator has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shortcuts/match.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c14b7a0c66224f3d17bb205c07025d4ac29a22cf4aca13d9229455358db283"}},{"ruleId":"D1","level":"warning","message":{"text":"NasSettingsStore.save (cyclomatic 17): NasSettingsStore.save has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (operation). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/settings-store.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"316df161a2ff3a7809ea12e11cf23fe72692fb9a30117e41104d91a2cadfc1ec"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.synologySettingsHandlers (cyclomatic 17): settings.synologySettingsHandlers has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 98, a function literal at line 85, identity, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/settings.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a414bf033511ce1c91511831afa4e981075d056d0f8d45371a80043408c5fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.main::handlePolledTasks (cyclomatic 17): index.main::handlePolledTasks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (index.main, index.main::startServer) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e322033b0b23d27dfaceb1e67c5c763575ef189bed3bdc453f592ebceb354020"}},{"ruleId":"D1","level":"warning","message":{"text":"operator-admin.parseCommand (cyclomatic 17): operator-admin.parseCommand has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e25b5fec5375de63b1aeb26bd1f785b11f6b7844675b054e18fc5e521293348"}},{"ruleId":"D1","level":"warning","message":{"text":"log-redact.redactExtraEngineOptions (cyclomatic 17): log-redact.redactExtraEngineOptions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"395f426ce8f72ddf6165d90d68992dfb6844f84316a3aa5f878e0b5da642e58b"}},{"ruleId":"D1","level":"warning","message":{"text":"motrix_finalize_fs::platform::unix::reserved::reserve_exfat_target (cyclomatic 17): motrix_finalize_fs::platform::unix::reserved::reserve_exfat_target has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/reserved.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"384a7fea976aba54fc4bf5a8246170a3f6ad3c1e650aec5805fadb88b77cc1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"motrix_native_host::flatpak_companion::installation::install_companion (cyclomatic 17): motrix_native_host::flatpak_companion::installation::install_companion has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/installation.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"13eda0306829a4f1930cd51f451733ff4f8f8a01a871f775f7a41eee9e8bc58a"}},{"ruleId":"D1","level":"warning","message":{"text":"motrix_native_host::flatpak_companion::installation::uninstall_companion (cyclomatic 17): motrix_native_host::flatpak_companion::installation::uninstall_companion has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/installation.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da50466fd01c9382a6eda1f40bbbec0bb82c9202542b0d1e26987d77e7c3714"}},{"ruleId":"D1","level":"warning","message":{"text":"credential-store.reconcile (cyclomatic 16): credential-store.reconcile has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1f257794654b6b832475879e7288691f777463107bae3c8b160ab2b73dd711"}},{"ruleId":"D1","level":"warning","message":{"text":"file-extension-pairing-projection-store.recoverExtensionPairingProjectionWriterLock (cyclomatic 16): file-extension-pairing-projection-store.recoverExtensionPairingProjectionWriterLock has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 63). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/file-extension-pairing-projection-store.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"939414cc62eca77f2d4cdaede07e4e5b06dd0bd80315d1c6c44fad70938d86c8"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketBridgeServer.adoptAuthenticatedSession (cyclomatic 16): WebSocketBridgeServer.adoptAuthenticatedSession has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"99946689187c1849a98d96e4b82297adb19afe57ef3d24583286ff881c221745"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginSecurityService.fetchPolicy::download (cyclomatic 16): PluginSecurityService.fetchPolicy::download has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/security/security-service.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"527147501546beb17b86b64cb96c2241c9501d2825f0d6ce2d6770a34d5d518d"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizeFilesystemAdapter.sendRequest (cyclomatic 16): NativeFinalizeFilesystemAdapter.sendRequest has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cdabb8404db2548fb9d01fb1ad9575d1fbe2fea60548bc30b7534306513c15"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationFiles.cleanup (cyclomatic 16): OperationFiles.cleanup has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"978ada1b69a59c240a4294a10f65f26c7a6f1c688087bde967ab57c7245fb4a4"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizeRecovery.cleanup (cyclomatic 16): FinalizeRecovery.cleanup has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc33528f522b38dd755f39b4fe1896b92e4d0bae71bd9fcb8b149f089a7820f"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizeRecovery.restorePrepared (cyclomatic 16): FinalizeRecovery.restorePrepared has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f176b27df7bae880ccb2cf0e22a1131cd6e452f67cba45de7081987891e86331"}},{"ruleId":"D1","level":"warning","message":{"text":"FinalizeCommitter.publish (cyclomatic 16): FinalizeCommitter.publish has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c520769561dc24bb165cab36db91bab42c5836afde0b1d502c205815fa5846"}},{"ruleId":"D1","level":"warning","message":{"text":"PostDeliveryScheduler.execute (cyclomatic 16): PostDeliveryScheduler.execute has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef2dace2340d67bc47a297f31184e75d271b2fdc443a0027da2d5066e827198"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-journal-repository.parseRecord (cyclomatic 16): finalize-journal-repository.parseRecord has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc983773cfb1da594d987f2aaa0069a181cd16f5f382871e1e3d9f94e06caab"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectResourceValidatorService.requestFollowingRedirects (cyclomatic 16): DirectResourceValidatorService.requestFollowingRedirects has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1396455f8b41f6bafad37682b0a49cb812dad7b90678d18b0f2bbdb7adb43a6"}},{"ruleId":"D1","level":"warning","message":{"text":"MotrixDatabase.commitTerminalHookBoundary (cyclomatic 16): MotrixDatabase.commitTerminalHookBoundary has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 823). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a9af0f4ebd82eead73c851a33cff71f2b06d641d0eb620ce8659e7674b6dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"MagnetTracker.primeFromDatabase (cyclomatic 16): MagnetTracker.primeFromDatabase has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c51884e5bb98b429e9f66276dc6a0f67af23e508dc85670bda858545c850de"}},{"ruleId":"D1","level":"warning","message":{"text":"MagnetSelectionTimeout.refresh (cyclomatic 16): MagnetSelectionTimeout.refresh has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-selection-timeout.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dfc60fe5d615bc1c5d98040c285d3c40e00a22f464b374647f1388db22e2e2"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackerManager.init (cyclomatic 16): TrackerManager.init has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"84082e81e6ed38258780b1c1ac43c9ba558a6a6af0a23988256f479d4c3e0dcb"}},{"ruleId":"D1","level":"warning","message":{"text":"index.makeResolveToMux.\u003Creturned closure\u003E (cyclomatic 16): index.makeResolveToMux.\u003Creturned closure\u003E has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7305786097356f408be8e2e548e25dcd508d1250a2b2ab8c52dcc514a1608868"}},{"ruleId":"D1","level":"warning","message":{"text":"package-manager.managerBinDirectory (cyclomatic 16): package-manager.managerBinDirectory has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6fbdc8695ec878633b8af9e9fd2c237fd7dd77ac27fe89dca40514741f78ee"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowManager.recreate (cyclomatic 16): WindowManager.recreate has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2b1f3cb7d16818111ed1bda61801740a28c88dcb57f28e62318d66ddb50550"}},{"ruleId":"D1","level":"warning","message":{"text":"appimage-integration.inspectSystemIntegration (cyclomatic 16): appimage-integration.inspectSystemIntegration has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a12a880bd873cc3455334f692d33e9dc8c7793d18b535807610206216bfaf76"}},{"ruleId":"D1","level":"warning","message":{"text":"portable-relocation.relocatePortableProfile (cyclomatic 16): portable-relocation.relocatePortableProfile has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/portable-relocation.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d8cbc35e80ae0b3a8e7cb6551f054ca24b73d909d3443dc089ce2078c4e9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"tray.setupTray.createTray (cyclomatic 16): tray.setupTray.createTray has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c054550462daddbbae2fc9b32669a39605f38da455f0b5a56bf71acbbde980a3"}},{"ruleId":"D1","level":"warning","message":{"text":"app-layout.AppLayout (cyclomatic 16): app-layout.AppLayout has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layouts/app-layout.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"24beedb1cdb8e217c0ac6a6e0782029da3afe17d9ee006faf1d2f2f24e4becd4"}},{"ruleId":"D1","level":"warning","message":{"text":"dashboard-tile-frame.DashboardTileFrame (cyclomatic 16): dashboard-tile-frame.DashboardTileFrame has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 216, 179, 205). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8298742168c5f2796bee632a44bd9587a2adc24eda8f68b4f9a633e746541d66"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-calendar-model.activityMonthLabels (cyclomatic 16): activity-calendar-model.activityMonthLabels has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: activity-calendar-model.moveActivityActiveIndex (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce451fc4e210ad37b2dd98133a1b949bbe30b2159289544026dca9d2c00b6b1"}},{"ruleId":"D1","level":"warning","message":{"text":"use-app-update.useAppUpdate (cyclomatic 16): use-app-update.useAppUpdate has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 50, 59, 29, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/use-app-update.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"76273ba55ca4b9d6dc7d66e6f66dfb1fc0cd45dddf448a25053670aa794da10b"}},{"ruleId":"D1","level":"warning","message":{"text":"app-update-section.UpdateActionButton (cyclomatic 16): app-update-section.UpdateActionButton has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/app-update-section.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2748429b745aeb2c473cb7833b7e5466ddd610b8c4e3178936b9edb7ad1b839c"}},{"ruleId":"D1","level":"warning","message":{"text":"resize-handle.ResizeHandle (cyclomatic 16): resize-handle.ResizeHandle has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 79, 59, 46, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/resize-handle.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6881865271a1658d657427a2e9671a8027b8a01de55ab27572f00270370f533a"}},{"ruleId":"D1","level":"warning","message":{"text":"operator-unlock-gate.WebGate (cyclomatic 16): operator-unlock-gate.WebGate has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/operator-unlock-gate.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"73622dba302752b28f20b8a4998afa7608eedece516dfa17599c049261b69785"}},{"ruleId":"D1","level":"warning","message":{"text":"operation-form.OperationForm (cyclomatic 16): operation-form.OperationForm has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd80b88a61cb7a0cb7cd65df6af27e949af02ec542b026f7cfbf73edd97083"}},{"ruleId":"D1","level":"warning","message":{"text":"operator-auth.refreshOperatorSession (cyclomatic 16): operator-auth.refreshOperatorSession has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a80974df3544a01f7c2e1e19edc6b3b4d6366589d9e2c9464a7e386cf13e05"}},{"ruleId":"D1","level":"warning","message":{"text":"prepareApplicationOwnership (cyclomatic 16): prepareApplicationOwnership has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/authority-lifecycle.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca13aee90c95606d32b9459a628175c4586aafd53ce33a47aab1db6d9baa44f6"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.buildCommandHandlers (cognitive 253): commands.buildCommandHandlers has cognitive complexity 253 (threshold 15). Drivers by points: if/else 85 (139 pts), ternaries 26 (53 pts), boolean chains 34, error handling 14 (22 pts), loops 3, match/switch 2 (nesting depth added 89). Most of this is not in the body itself: 4 of the 253 points are its own statements and the rest belongs to 39 function items inside it that branch (a function literal at line 966, a function literal at line 1230, a function literal at line 1823, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3da05a4543ac6621153b0c3c6abf2c0745cc51ff929539b94decce7b6d2787"}},{"ruleId":"D2","level":"warning","message":{"text":"create-task-handler.handleCreateTaskUnderAdmission (cognitive 200): create-task-handler.handleCreateTaskUnderAdmission has cognitive complexity 200 (threshold 15). Drivers by points: if/else 61 (111 pts), ternaries 36 (76 pts), boolean chains 24, error handling 10 (19 pts), loops 1 (nesting depth added 99). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (create-task-handler.handleCreateTaskUnderAdmission::createReservedTask) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9c2313291b8ae3187bff772b826f4c06d20b4135c420f71daf04a8fa4bebd8"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy-import-dialog.LegacyImportDialogContent (cognitive 152): legacy-import-dialog.LegacyImportDialogContent has cognitive complexity 152 (threshold 15). Drivers by points: if/else 53 (61 pts), boolean chains 53, ternaries 22 (34 pts), error handling 4 (nesting depth added 20). Of this number, 37 points are the body\u0027s own statements and 115 belong to 35 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21bbe45aeb29578be6d3b2cb5a63e9114a32e111b81fc7a8cf70903ea91b8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"add-task-form.AddTaskForm (cognitive 148): add-task-form.AddTaskForm has cognitive complexity 148 (threshold 15). Drivers by points: if/else 60 (81 pts), boolean chains 30, ternaries 15 (24 pts), error handling 7 (10 pts), loops 2 (3 pts) (nesting depth added 34). Most of this is not in the body itself: 12 of the 148 points are its own statements and the rest belongs to 22 function literals inside it that branch (lines 539, 429, 213, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70469c4fed15dd6963f91c5bde6885e9f43ab65983857a1e06022e32d2a316a"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.buildServerCommandHandlers (cognitive 147): commands.buildServerCommandHandlers has cognitive complexity 147 (threshold 15). Drivers by points: if/else 45 (83 pts), ternaries 13 (34 pts), boolean chains 17, error handling 6 (12 pts), loops 1 (nesting depth added 65). Most of this is not in the body itself: 4 of the 147 points are its own statements and the rest belongs to 22 function items inside it that branch (a function literal at line 571, a function literal at line 932, a function literal at line 1105, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a2c97bb2bc24b2144b5ca978f9c431e7b0443d6604d4d0b6fcd6d45f6dbf9e"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager.restore (cognitive 144): SessionManager.restore has cognitive complexity 144 (threshold 15). Drivers by points: if/else 43 (112 pts), boolean chains 19, loops 7 (12 pts), ternaries 1 (nesting depth added 74). Of this number, 142 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"408d25dbc4f00e115b9f0194bd8c751120d090d78076b9c5ee5452dd6599aa24"}},{"ruleId":"D2","level":"warning","message":{"text":"activity-calendar.ActivityCalendar (cognitive 140): activity-calendar.ActivityCalendar has cognitive complexity 140 (threshold 15). Drivers by points: if/else 56 (62 pts), ternaries 33 (41 pts), boolean chains 37 (nesting depth added 14). Of this number, 41 points are the body\u0027s own statements and 99 belong to 27 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0b3c36bd9295993153809ed136bdbe1900277465797e43723128e3533a01e"}},{"ruleId":"D2","level":"warning","message":{"text":"operation-form.OperationFormContent (cognitive 117): operation-form.OperationFormContent has cognitive complexity 117 (threshold 15). Drivers by points: if/else 46 (59 pts), boolean chains 46, ternaries 5, error handling 4, loops 2 (3 pts) (nesting depth added 14). Of this number, 36 points are the body\u0027s own statements and 81 belong to 17 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6d06a62bd18dee7b334cb6b9f8c5abda1e94185f12a886100d1d030c4a3d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"web-directory-picker-dialog.PickerSession::keyDown (cognitive 113): web-directory-picker-dialog.PickerSession::keyDown has cognitive complexity 113 (threshold 15). Drivers by points: if/else 36 (57 pts), boolean chains 29, ternaries 9 (25 pts), loops 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (web-directory-picker-dialog.PickerSession) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8e5e1ac2a1f9c1f549d46521ecc68fba043bd38daa124921794c011c759427"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager.reAddOrMarkErrorFromPair (cognitive 106): SessionManager.reAddOrMarkErrorFromPair has cognitive complexity 106 (threshold 15). Drivers by points: ternaries 22 (60 pts), if/else 14 (28 pts), boolean chains 14, error handling 2 (4 pts) (nesting depth added 54). Of this number, 70 points are the body\u0027s own statements and 36 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e215a5943975b3742fc4d91e84d4f6fb9aeb54f1c20bd7b2b58160805578c251"}},{"ruleId":"D2","level":"warning","message":{"text":"media-tools-section.MediaToolsSection (cognitive 101): media-tools-section.MediaToolsSection has cognitive complexity 101 (threshold 15). Drivers by points: ternaries 27 (43 pts), boolean chains 37, if/else 12 (19 pts), error handling 2 (nesting depth added 23). Of this number, 55 points are the body\u0027s own statements and 46 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"986addfbdc88c86824cd1f07d840205b970c49af36df3ed830d00cbeba2ce4ee"}},{"ruleId":"D2","level":"warning","message":{"text":"engine-diagnostics-dialog.EngineDiagnosticsDialogHost (cognitive 100): engine-diagnostics-dialog.EngineDiagnosticsDialogHost has cognitive complexity 100 (threshold 15). Drivers by points: ternaries 31 (59 pts), boolean chains 31, if/else 7 (8 pts), error handling 2 (nesting depth added 29). Of this number, 75 points are the body\u0027s own statements and 25 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd6a17cb848ef06f5053276f05415b6cac8286a461a93d07fec348ad8a5411b"}},{"ruleId":"D2","level":"warning","message":{"text":"bt-file-verifier.verifyBtFiles (cognitive 97): bt-file-verifier.verifyBtFiles has cognitive complexity 97 (threshold 15). Drivers by points: if/else 35 (63 pts), boolean chains 15, loops 8 (13 pts), error handling 2 (3 pts), ternaries 3 (nesting depth added 34). Of this number, 38 points are the body\u0027s own statements and 59 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b71f546ca68cd3445f3402cdcfd07163c064aeb41cc8c161a18e0f6d190573f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.initializeMainProcess (cognitive 96): index.initializeMainProcess has cognitive complexity 96 (threshold 15). Drivers by points: if/else 56 (63 pts), boolean chains 20, ternaries 8 (10 pts), error handling 2 (3 pts) (nesting depth added 10). Of this number, 58 points are the body\u0027s own statements and 38 belong to 37 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c77c9888b929e804148caea94b8c3dc397581e165dc6799e38afdf7abd60fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"remove-task.removeTaskUnderMutation (cognitive 94): remove-task.removeTaskUnderMutation has cognitive complexity 94 (threshold 15). Drivers by points: if/else 30 (62 pts), boolean chains 10, error handling 3 (10 pts), ternaries 4 (9 pts), loops 1 (3 pts) (nesting depth added 46). Of this number, 75 points are the body\u0027s own statements and 19 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/remove-task.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab3a2f92bc76584353366aaab0fd069e922ec8f99d1d6523e392541c4fdaee2"}},{"ruleId":"D2","level":"warning","message":{"text":"source-scanner.scanLegacySource (cognitive 91): source-scanner.scanLegacySource has cognitive complexity 91 (threshold 15). Drivers by points: if/else 23 (55 pts), boolean chains 20, ternaries 5 (11 pts), loops 3, error handling 1 (2 pts) (nesting depth added 39). Of this number, 90 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc16b059e39ea7692d45909781e16b5418f7032fbfa363ff3c6116c885d79ba"}},{"ruleId":"D2","level":"warning","message":{"text":"transfer-tile.TransferTile (cognitive 91): transfer-tile.TransferTile has cognitive complexity 91 (threshold 15). Drivers by points: ternaries 22 (80 pts), boolean chains 6, if/else 4 (5 pts) (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576736af2987cb80c15c18f1c94a02df8b1b238caddaf95e3ce3cf8584ec530"}},{"ruleId":"D2","level":"warning","message":{"text":"aria2-session-identity-recovery.recoverAria2SessionIdentity (cognitive 86): aria2-session-identity-recovery.recoverAria2SessionIdentity has cognitive complexity 86 (threshold 15). Drivers by points: if/else 24 (47 pts), loops 8 (12 pts), ternaries 6 (10 pts), boolean chains 9, error handling 4 (8 pts) (nesting depth added 35). Of this number, 72 points are the body\u0027s own statements and 14 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-session-identity-recovery.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f767a5c94ac9c95579de5e61769d28a4144f7407ee81a163300cb6077c1678"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaTaskCoordinator.run (cognitive 86): MediaTaskCoordinator.run has cognitive complexity 86 (threshold 15). Drivers by points: if/else 37 (47 pts), ternaries 15 (17 pts), boolean chains 16, error handling 4 (5 pts), loops 1 (nesting depth added 13). Of this number, 56 points are the body\u0027s own statements and 30 belong to 15 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"928258953b76faad9c1eebf132529cbb04e916a23495d1f3fe2a1ecbacace28a"}},{"ruleId":"D2","level":"warning","message":{"text":"State::dispatch (cognitive 84): State::dispatch has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (53 pts), match/switch 14 (28 pts), boolean chains 3 (nesting depth added 40). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efcc385d097265255333755bd7ea1e83e9453d0760d02191af3152721ee4d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.handlePolledTasks (cognitive 83): index.handlePolledTasks has cognitive complexity 83 (threshold 15). Drivers by points: if/else 22 (63 pts), error handling 2 (9 pts), boolean chains 5, ternaries 1 (5 pts), loops 1 (nesting depth added 52). Of this number, 66 points are the body\u0027s own statements and 17 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4e2f34d0060277aec1fe22b6916b95dacaac348e7282bcbdb782db9c9f2ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"trackers-tab.TrackersTab (cognitive 81): trackers-tab.TrackersTab has cognitive complexity 81 (threshold 15). Drivers by points: if/else 29 (35 pts), ternaries 12 (24 pts), boolean chains 16, error handling 4, loops 2 (nesting depth added 18). Of this number, 23 points are the body\u0027s own statements and 58 belong to 13 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4ede6116aadcf929ebdf0187a3a2f01787b1e412780cdf539314619020c8de"}},{"ruleId":"D2","level":"warning","message":{"text":"FinalizeRecovery.recover (cognitive 77): FinalizeRecovery.recover has cognitive complexity 77 (threshold 15). Drivers by points: if/else 34 (56 pts), boolean chains 15, ternaries 5 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"13892729f68cd77bd7f37201f82c8a7d39224cef90c353542d7138021a76cf3c"}},{"ruleId":"D2","level":"warning","message":{"text":"swap-magnet-metadata-for-bt.swapMagnetMetadataForBtUnderMutation (cognitive 76): swap-magnet-metadata-for-bt.swapMagnetMetadataForBtUnderMutation has cognitive complexity 76 (threshold 15). Drivers by points: error handling 16 (34 pts), if/else 17 (25 pts), boolean chains 9, ternaries 7 (8 pts) (nesting depth added 27). Of this number, 62 points are the body\u0027s own statements and 14 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb062f801abdd998e18510952deebac4d74fbddcc6ccfdd5acf3319093084f8"}},{"ruleId":"D2","level":"warning","message":{"text":"dashboard-grid.DashboardGrid (cognitive 76): dashboard-grid.DashboardGrid has cognitive complexity 76 (threshold 15). Drivers by points: if/else 31 (38 pts), ternaries 18 (20 pts), boolean chains 16, error handling 1, loops 1 (nesting depth added 9). Most of this is not in the body itself: 11 of the 76 points are its own statements and the rest belongs to 24 function literals inside it that branch (lines 1041, 1124, 1162, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"424ef6f2649619ef201fff339e2a52f28979ee0072110a39b293dff4a961a244"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginHttpClient.fetch (cognitive 75): PluginHttpClient.fetch has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 13, ternaries 4 (8 pts), error handling 2 (3 pts), loops 1 (nesting depth added 32). Of this number, 65 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/network/plugin-http-client.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cad0a8587376fb96e697c3385c1cd574e6fbed58c924fbc7591ad3af599d56"}},{"ruleId":"D2","level":"warning","message":{"text":"session-parser.resolveLegacyRequestSettings (cognitive 72): session-parser.resolveLegacyRequestSettings has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (50 pts), boolean chains 11, loops 5 (8 pts), ternaries 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9920ae362063b7bd0a539e16e1031a00608a7f2091063bc45a081c1a619f325"}},{"ruleId":"D2","level":"warning","message":{"text":"hls-parser.parseHlsMedia (cognitive 72): hls-parser.parseHlsMedia has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (43 pts), ternaries 8 (23 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/hls-parser.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"425f1c2f8aaa58fc01dd3bf5afe3f91f161c0b9ed1ef56b8f1db8349fcd93af2"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyHttpActivationService.reconcile (cognitive 69): LegacyHttpActivationService.reconcile has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (51 pts), boolean chains 15, error handling 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"16231ac06a51209680b0f71902d59c017b882c3d4d0a0fc8b5e7c79dfa03f675"}},{"ruleId":"D2","level":"warning","message":{"text":"create-selection-store.createSelectionStore (cognitive 69): create-selection-store.createSelectionStore has cognitive complexity 69 (threshold 15). Drivers by points: if/else 36 (48 pts), loops 7 (9 pts), ternaries 7, boolean chains 5 (nesting depth added 14). None of this is in the body itself: all 69 points belong to one function literal inside it that branches (line 32). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/selection/create-selection-store.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b589eb099321686399e6504f5ff4f56f11c982ac0d214bac345738f40c9032a"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletedTaskStartupGuard.prepare (cognitive 66): CompletedTaskStartupGuard.prepare has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (40 pts), boolean chains 12, error handling 4 (8 pts), ternaries 4, loops 2 (nesting depth added 23). Most of this is not in the body itself: 14 of the 66 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 239, 202, 232, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cee0c3560bfefb2fd9940a3657bb0409aada9515cfa093ddf2caa9ef7b470d7"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpCapabilityHost.request (cognitive 66): HttpCapabilityHost.request has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (41 pts), ternaries 4 (13 pts), boolean chains 6, error handling 2 (4 pts), loops 2 (nesting depth added 32). Of this number, 65 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"462dbbc141cff548a3de470b4e908142b188d4dbda2f03ee7665c36ef21122ec"}},{"ruleId":"D2","level":"warning","message":{"text":"operation-fields.OperationFields::renderField (cognitive 66): operation-fields.OperationFields::renderField has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 12 (46 pts), boolean chains 17, if/else 3 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-fields.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"529a12ea982a80433213f509b244c42414bef3c8a1dd5e46eb23d2fee2e3c5ac"}},{"ruleId":"D2","level":"warning","message":{"text":"web-menu-button.WebMenuButton (cognitive 65): web-menu-button.WebMenuButton has cognitive complexity 65 (threshold 15). Drivers by points: if/else 33 (39 pts), boolean chains 14, ternaries 6 (8 pts), error handling 1 (2 pts), loops 2 (nesting depth added 9). Most of this is not in the body itself: 4 of the 65 points are its own statements and the rest belongs to 23 function items inside it that branch (renderItems, a function literal at line 438, a function literal at line 295, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/web-menu-button.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"291ee2f68e28169c09495603d51f9a58596a99c1503ba2dcee45b6c8c28323b0"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-call-graph.PluginCallGraph (cognitive 64): plugin-call-graph.PluginCallGraph has cognitive complexity 64 (threshold 15). Drivers by points: boolean chains 29, if/else 25 (29 pts), ternaries 4, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 4 of the 64 points are its own statements and the rest belongs to 22 function literals inside it that branch (lines 525, 279, 305, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5496f602327604ddda0ed0049f82b0ece60a8ce1ade8cd429e998bfbb85be05e"}},{"ruleId":"D2","level":"warning","message":{"text":"Aria2Adapter.createDownload (cognitive 63): Aria2Adapter.createDownload has cognitive complexity 63 (threshold 15). Drivers by points: if/else 36 (46 pts), boolean chains 14, loops 1 (2 pts), ternaries 1 (nesting depth added 11). Of this number, 62 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afda43110021339fb1982139bd463c2d7e2c428e86a64e037ba39bdb208a506"}},{"ruleId":"D2","level":"warning","message":{"text":"nas-auth.registerNasAuth (cognitive 59): nas-auth.registerNasAuth has cognitive complexity 59 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 14, ternaries 8 (14 pts), loops 1 (nesting depth added 14). Most of this is not in the body itself: 1 of the 59 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 86, 176, 194, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/nas-auth.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"52722d63aa6cb0a1bb6ff5e798db646e229b97e37cf3e36080cba319f765e7c9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.main (cognitive 59): index.main has cognitive complexity 59 (threshold 15). Drivers by points: if/else 80 (103 pts), ternaries 28 (33 pts), boolean chains 28, error handling 10 (13 pts), loops 1 (nesting depth added 31). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 2 other methods here (index.main::handlePolledTasks, index.main::startServer) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e040212dcff499703f0dedeef773e864b96407ac7e32b8f7c76166351396c8"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.parseManifest (cognitive 58): parse.parseManifest has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 8, loops 5 (8 pts), error handling 1, ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/manifest/parse.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e417a161d6b6d300dd25c0f5549134786be1a6bb356923a4dc4576de592e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"BtStorageService.execute (cognitive 58): BtStorageService.execute has cognitive complexity 58 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 12, error handling 5 (7 pts), ternaries 3, loops 1 (nesting depth added 6). Of this number, 51 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c2c3fb555b8b0422c27abe67cdbda141a5a6dfb0f28e6666137a7f56b5ca2e"}},{"ruleId":"D2","level":"warning","message":{"text":"tasks-tile.TaskRow (cognitive 56): tasks-tile.TaskRow has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 18 (33 pts), boolean chains 15, if/else 6, match/switch 1 (2 pts) (nesting depth added 16). Of this number, 54 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"016eecdb0c316d5b564b330b8c5708250170bd1988102fc933158f9d639697e4"}},{"ruleId":"D2","level":"warning","message":{"text":"create-torrent-form.CreateTorrentForm (cognitive 56): create-torrent-form.CreateTorrentForm has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 21, ternaries 14 (18 pts), if/else 12 (14 pts), error handling 3 (nesting depth added 6). Of this number, 26 points are the body\u0027s own statements and 30 belong to 9 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/create-torrent/create-torrent-form.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb6349509fcf109d1411aa64190a0f283287110d092ec2289ffb0574305f85b"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentDownloader.run (cognitive 55): SegmentDownloader.run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (34 pts), ternaries 5 (8 pts), loops 6 (7 pts), boolean chains 5, error handling 1 (nesting depth added 14). Most of this is not in the body itself: 3 of the 55 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 425, a function literal at line 303, a function literal at line 323, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/download/segment-downloader.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aa408789e818223270ae1e61ca9836706c6dadeaed282187dc2e6fbae7107d"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineSupervisor.doStart (cognitive 54): EngineSupervisor.doStart has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (32 pts), ternaries 3 (9 pts), error handling 4 (7 pts), boolean chains 6 (nesting depth added 16). Of this number, 51 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a699ef9c13e3a9d438d621338e3062a5ce4065487f80968e6c75d2e6a2acfd4f"}},{"ruleId":"D2","level":"warning","message":{"text":"use-selectable-list.useSelectableList.onKeyDown (cognitive 53): use-selectable-list.useSelectableList.onKeyDown has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 10, ternaries 3 (9 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/hooks/use-selectable-list.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d32ce2254f76deffe8ad0d0dcde913d7500c4bfb1032aa1f0925cd19d44496"}},{"ruleId":"D2","level":"warning","message":{"text":"app.createApp (cognitive 53): app.createApp has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (26 pts), ternaries 9 (15 pts), boolean chains 10, error handling 2 (nesting depth added 11). Most of this is not in the body itself: 14 of the 53 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 274, dispatchCommand, a function literal at line 387, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/app.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3285d4ec11f290a0fc49a146eb9b7251bf1969e65346a37fb79abd90459e6f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Aria2Adapter.addTorrent (cognitive 52): Aria2Adapter.addTorrent has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29 (39 pts), boolean chains 10, loops 1 (2 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc0031b3499804514728ebdfc1397397b66c2b7c89472c7e67c81b1f8671d03"}},{"ruleId":"D2","level":"warning","message":{"text":"lifetime-transfer-card.LifetimeTransferCard (cognitive 52): lifetime-transfer-card.LifetimeTransferCard has cognitive complexity 52 (threshold 15). Drivers by points: boolean chains 25, ternaries 14 (15 pts), if/else 11 (12 pts) (nesting depth added 2). Most of this is not in the body itself: 15 of the 52 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 161, a function literal at line 220, a function literal at line 367, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caadd2ffc5e47e566c7928ac99f8df2a4a6f02f909ed67204aa0b241c24075c"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-install-dialog.PluginInstallSession (cognitive 52): plugin-install-dialog.PluginInstallSession has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 21, ternaries 6 (8 pts) (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 28 belong to 9 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-install-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd24113e27f0e63cd3ae9cc57cd591f1af7189f1498651d6c76d799bd49de14"}},{"ruleId":"D2","level":"warning","message":{"text":"ReconnectSession.onReconnectResponse (cognitive 51): ReconnectSession.onReconnectResponse has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 9, error handling 4 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/reconnect-session.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"182c751a3058f362d109626acedeb957b4d2d53915243d05a53aeda07bb0a2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"verified-install.installVerifiedFfmpeg (cognitive 51): verified-install.installVerifiedFfmpeg has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 5 (20 pts), if/else 13 (19 pts), boolean chains 8, error handling 2, loops 1 (2 pts) (nesting depth added 22). Of this number, 50 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f79054541fce1775e80d8b0440835c6caa5e3a999bd252291f1867cf9c7c18"}},{"ruleId":"D2","level":"warning","message":{"text":"verified-install.extractVerifiedTar (cognitive 50): verified-install.extractVerifiedTar has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 8, loops 4 (7 pts) (nesting depth added 23). Of this number, 39 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cb8a6b600bb20f2e4177512d781e8726e059269d2c2dea9f091ceccf3e367a"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyBtActivationService.reconcile (cognitive 50): LegacyBtActivationService.reconcile has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 12, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c906f71deb89d21969482fb6c2245a29e91dfee3287798ccce963e9cc63b1d8"}},{"ruleId":"D2","level":"warning","message":{"text":"RendererSupervisor.tick (cognitive 50): RendererSupervisor.tick has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 8, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0109ccd6ec322daea02cec3cb796bd6da0a41458eaf6a71a21065513e81463d"}},{"ruleId":"D2","level":"warning","message":{"text":"web-directory-picker-dialog.PickerSession (cognitive 50): web-directory-picker-dialog.PickerSession has cognitive complexity 50 (threshold 15). Drivers by points: if/else 60 (84 pts), boolean chains 75, ternaries 29 (50 pts), loops 1 (2 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (web-directory-picker-dialog.PickerSession::keyDown) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3607eef0315648035582a38ce517e0606710ebff6589b84f79d1e804b5f88a84"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyImportService.runBatches (cognitive 49): LegacyImportService.runBatches has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 7 (14 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 26). Of this number, 34 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24dd8743fb04e8a6960e97db653542904b17496c2e56e39649e24f10cc159ec"}},{"ruleId":"D2","level":"warning","message":{"text":"nat-tile.ElectronNatTile (cognitive 49): nat-tile.ElectronNatTile has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 19 (42 pts), boolean chains 7 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/nat-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"78971dd992edd8f413b74aae04f026ad1f3348187dc8ac62fe2e4b52aa57c904"}},{"ruleId":"D2","level":"warning","message":{"text":"use-task-actions.useTaskActions.onRetry (cognitive 49): use-task-actions.useTaskActions.onRetry has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 11, loops 2 (6 pts), error handling 2 (4 pts), ternaries 2 (nesting depth added 20). Of this number, 41 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5240f693c0503aff379e64c9ef6d650444184e548c9bf8df5261f7a66252d11d"}},{"ruleId":"D2","level":"warning","message":{"text":"url-textarea.UrlTextarea (cognitive 49): url-textarea.UrlTextarea has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 9, ternaries 4 (6 pts), loops 2 (3 pts) (nesting depth added 12). Most of this is not in the body itself: 7 of the 49 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 151, a function literal at line 89, a function literal at line 225, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-textarea.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a0fbe7b320b1f0ee743349bc2dd14a96ad348aba12bc3ddb1992ca1103f492"}},{"ruleId":"D2","level":"warning","message":{"text":"use-pair-request-prompts.usePairRequestPrompts (cognitive 49): use-pair-request-prompts.usePairRequestPrompts has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 9, loops 4 (6 pts), ternaries 3 (4 pts), error handling 3 (nesting depth added 9). None of this is in the body itself: all 49 points belong to 11 function literals inside it that branch (lines 373, 202, 156, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f5216fdf7006fee458a0e7fc4c245dbeebf7daa48d004e5ab4352df392963b"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.bootstrapBridgeForServer (cognitive 46): bootstrap.bootstrapBridgeForServer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 10 (11 pts), boolean chains 9, loops 4, error handling 1 (nesting depth added 5). Of this number, 27 points are the body\u0027s own statements and 19 belong to 8 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ef3842f44a3ef21cad6ead455c6fc1f1a8456f104a3630b1edfbbbd01c6da6"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketBridgeServer.constructor (cognitive 46): WebSocketBridgeServer.constructor has cognitive complexity 46 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 10, ternaries 1 (2 pts), error handling 1 (nesting depth added 9). None of this is in the body itself: all 46 points belong to 6 function literals inside it that branch (lines 744, 667, 828, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5755eae64a2db883c88b562c19ff0220e542600a1b529819d6f8193eca881d"}},{"ruleId":"D2","level":"warning","message":{"text":"MagnetTracker.deferCleanup (cognitive 46): MagnetTracker.deferCleanup has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (30 pts), ternaries 4 (12 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 28). Of this number, 23 points are the body\u0027s own statements and 23 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"18402b6be772da5b199f8f823cbe3eb052c228eada44aeb30fc815f1f91f8559"}},{"ruleId":"D2","level":"warning","message":{"text":"download-source.analyzeDownloadSource (cognitive 46): download-source.analyzeDownloadSource has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 12, ternaries 3 (4 pts), error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/download-source.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbf41275b8e0a5afb7ca33fb6c5cf671bdecf2703dc6b6a597f612e3ed5f0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_native_host::probe::read_response_body (cognitive 46): motrix_native_host::probe::read_response_body has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 6 (19 pts), loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/probe.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cf4278849a83bd9cddef9bfd1aad311115a7d3f3aecf1e3bc114050940f1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"StaleSchemaError.constructor (cognitive 45): StaleSchemaError.constructor has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 9 (45 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/migrations/index.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12f8da1a9844101edbe46e2c9bc159111435487fd70efa27898c662a79dcc51"}},{"ruleId":"D2","level":"warning","message":{"text":"create-torrent.torrentCreatorHandlers (cognitive 45): create-torrent.torrentCreatorHandlers has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 11, loops 1 (3 pts), ternaries 2, error handling 1 (nesting depth added 10). None of this is in the body itself: all 45 points belong to 6 function items inside it that branch (a function literal at line 145, a function literal at line 106, a function literal at line 88, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/create-torrent.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"59413b652c5ca97bb07f21af3d62edabd222b3983b568ee60505ae711483a353"}},{"ruleId":"D2","level":"warning","message":{"text":"app-deep-link.parseAppDeepLink (cognitive 45): app-deep-link.parseAppDeepLink has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (21 pts), ternaries 8 (16 pts), boolean chains 6, error handling 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/app-deep-link.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6724c0f8c02e188c78d73ac9b0f6c4b604b505491ec868d24d78bb2db7fedcf4"}},{"ruleId":"D2","level":"warning","message":{"text":"task-cookies.prepareAria2TaskCookies (cognitive 44): task-cookies.prepareAria2TaskCookies has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 6, loops 4 (6 pts), ternaries 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/task-cookies.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e5f145e562ebd9c24d569d5a97cde45aef2f20ce0c75f1721b3b32fbf9a8a6"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginRegistry.scanInto (cognitive 44): PluginRegistry.scanInto has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 7 (15 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"5576f6a92a66c10d1f4207acc126fd144cf351904e55dd67c0f189eaceda3918"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilityBridge.dispatchCall (cognitive 44): CapabilityBridge.dispatchCall has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 4 (14 pts), boolean chains 6, error handling 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"85213ebf893bc3000b0f008784d7df880ecc5aa20cc1ec0e07dda61e3a0de7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"torrent-creator.registerTorrentCreator (cognitive 44): torrent-creator.registerTorrentCreator has cognitive complexity 44 (threshold 15). Drivers by points: if/else 27 (29 pts), boolean chains 11, loops 3, error handling 1 (nesting depth added 2). None of this is in the body itself: all 44 points belong to 15 function items inside it that branch (readResult, authorize, reap, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/routes/torrent-creator.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"641c2fbab2f64929e61094035f07658c879fd0979aff60f7d948c05e68aa9042"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyImportService.scanPreview (cognitive 42): LegacyImportService.scanPreview has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 5 (8 pts), boolean chains 4, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"240347cc8f9d443b251eeea159e13ca437e25ea5c380ac9727b353d9a0035e81"}},{"ruleId":"D2","level":"warning","message":{"text":"http-cookies.parseSetCookie (cognitive 42): http-cookies.parseSetCookie has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), ternaries 3 (7 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"81227fa925456a48d724185c507be8a67472c07457ce108ec25ded7b2c7e56b4"}},{"ruleId":"D2","level":"warning","message":{"text":"quick-js-worker.port.on(\u0022message\u0022) (cognitive 42): quick-js-worker.port.on(\u0022message\u0022) has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 2, match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ca521b42aa4404a3c4513704e24df938bfcad49d65b95bbcdacb65ddd25d12"}},{"ruleId":"D2","level":"warning","message":{"text":"nas-dialog.NasDialogForm (cognitive 42): nas-dialog.NasDialogForm has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 17, ternaries 2 (3 pts), error handling 2 (nesting depth added 5). Most of this is not in the body itself: 15 of the 42 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 131, a function literal at line 190, a function literal at line 229, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a346c2adcd8b357c81f854b7f0ce23675c6fa5386677c6c860f46f7062f9f5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"lifecycle (cognitive 42): lifecycle has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 7, loops 3 (6 pts), error handling 3, ternaries 1 (2 pts) (nesting depth added 11). Of this number, 31 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff29a27038036f162d0bca34a45e2f0800edadc79e2f0038bbd146ea771812"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationFiles.execution::dispatch (cognitive 41): OperationFiles.execution::dispatch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 7, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"75488e8a89f1a91fb7d90481e9adc50fe250dd91dae9a9d8144e3700876fb45b"}},{"ruleId":"D2","level":"warning","message":{"text":"log-redact.redactValue (cognitive 41): log-redact.redactValue has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (28 pts), boolean chains 5, error handling 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"939e0055b4b6a53eb29d2ac82e06b3191c54e9e3d51c46bf5f7e1e22c39448b1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.migrate (cognitive 40): index.migrate has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 9, ternaries 4 (9 pts), loops 1 (nesting depth added 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/migrations/index.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e463a4a8976e37992e5f3840971863bac5af65c0a71fcfc38c903d27e9fc87c"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationService.prepare (cognitive 40): OperationService.prepare has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 9, loops 3 (6 pts), error handling 1, ternaries 1 (nesting depth added 12). Of this number, 37 points are the body\u0027s own statements and 3 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fe312745a502e2394f1044a5a720de8999f1904864e5fd98a0045655940c87"}},{"ruleId":"D2","level":"warning","message":{"text":"downloads-page.DownloadsPage (cognitive 40): downloads-page.DownloadsPage has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17, boolean chains 14, ternaries 7 (9 pts) (nesting depth added 2). Most of this is not in the body itself: 9 of the 40 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 230, 316, 119, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-page.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0d53a4b5011dfd81fbcd0c0aaf0984e408e9e792beb455e247d73a92ed0630"}},{"ruleId":"D2","level":"warning","message":{"text":"curl.tokenize (cognitive 40): curl.tokenize has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-interpreters/curl.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"938cd151a273622dbd6986a96086d9e53ba796e82b5049f8e87be3ae2e70e339"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerDirectoryService.list (cognitive 40): ServerDirectoryService.list has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 9, ternaries 5 (7 pts), error handling 3 (5 pts), loops 1 (nesting depth added 14). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6b704a8501610259bb3baf330a13a94b1d9029a5c7d878a1d14acd64515126"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilityBridge.onMessage (cognitive 39): CapabilityBridge.onMessage has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 13). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e005c2bb4d6dbfe540c92826a21304d0d53082c901ce982ae046ba54778504"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletedEngineTaskCleanup.complete (cognitive 39): CompletedEngineTaskCleanup.complete has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 12). Most of this is not in the body itself: 13 of the 39 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 274, 206). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completed-engine-task-cleanup.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c21130843ca36fd06afc7e09987d89313618137502d27c2cc96f534b4a3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"portable-relocation.blockUnavailablePortableTasks (cognitive 39): portable-relocation.blockUnavailablePortableTasks has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 5 (11 pts), loops 5 (8 pts), boolean chains 6 (nesting depth added 16). Of this number, 23 points are the body\u0027s own statements and 16 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/portable-relocation.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c72cd903a21df3a85db8db42086bb67e98e64b2a0ebdbcb2d7429e2122667bd"}},{"ruleId":"D2","level":"warning","message":{"text":"downloads-more-menu.DownloadsMoreMenu (cognitive 39): downloads-more-menu.DownloadsMoreMenu has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 8 (23 pts), boolean chains 8, if/else 7, error handling 1 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 9 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-more-menu.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa08faad9617eebf3246e7fd1031f9baca59801b6d82fdd460432571de8c150"}},{"ruleId":"D2","level":"warning","message":{"text":"directory-picker.DirectoryPicker (cognitive 39): directory-picker.DirectoryPicker has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 28, if/else 20 (24 pts), ternaries 12 (24 pts), error handling 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (directory-picker.DirectoryPicker::handlePick) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb431b7f2397df3438a527e93f9969f2ce7571dd61ad2c1d5e61211a1ce55741"}},{"ruleId":"D2","level":"warning","message":{"text":"file-routes.registerNasFileRoutes (cognitive 39): file-routes.registerNasFileRoutes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 11, error handling 4, loops 2, ternaries 2 (nesting depth added 3). None of this is in the body itself: all 39 points belong to 8 function items inside it that branch (a function literal at line 240, a function literal at line 196, a function literal at line 148, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efd1081d6fb40f0389a468793307a5f5ca4b511406b7c604202448ba68bc321"}},{"ruleId":"D2","level":"warning","message":{"text":"CookieJar.cookieHeader (cognitive 38): CookieJar.cookieHeader has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1, loops 1 (nesting depth added 17). Of this number, 34 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6127e9fff594d0b69d5a89584e4b04fe7e6ced8dc3b3feb50220f183bd12444f"}},{"ruleId":"D2","level":"warning","message":{"text":"settings-validation.settingsValidationError.\u003Creturned closure\u003E (cognitive 38): settings-validation.settingsValidationError.\u003Creturned closure\u003E has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 11, ternaries 3 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/settings-validation.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b3c9e9b394de168fa197b4886c5d2d62f6ce86d0b7dd16a2dd3bc5a7263810"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-hooks.isBoundedJsonValue (cognitive 38): plugin-hooks.isBoundedJsonValue has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee711098ace5e70941965fe7b2116ca7236f2a68321ca378dfbd287adcf654f0"}},{"ruleId":"D2","level":"warning","message":{"text":"semver.compareSemver (cognitive 38): semver.compareSemver has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 5 (14 pts), boolean chains 3, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/semver.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8096833865bfb533b6cd460cd894ba4498dd62cc41d313ab3853d716fcd750a9"}},{"ruleId":"D2","level":"warning","message":{"text":"FinalizeCommitter.commitPrepared (cognitive 37): FinalizeCommitter.commitPrepared has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 6, ternaries 3 (4 pts), error handling 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8def1065f6ba2df96e69f56a31a0554a39e3218dcc9d5401d984e9a43e321f"}},{"ruleId":"D2","level":"warning","message":{"text":"directory-preferences-section.DirectoryPreferencesSection (cognitive 37): directory-preferences-section.DirectoryPreferencesSection has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 15, ternaries 7 (11 pts), if/else 8 (10 pts), error handling 1 (nesting depth added 6). Most of this is not in the body itself: 8 of the 37 points are its own statements and the rest belongs to 5 function items inside it that branch (addFavorite, a function literal at line 104, a function literal at line 160, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abdb69541dd14107fea3cae250ef0993b839c239a5f709e2e3b0bb508cd2b49"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy-fresh-download.LegacyFreshDownload (cognitive 37): legacy-fresh-download.LegacyFreshDownload has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 10 (14 pts), boolean chains 10, if/else 9 (10 pts), error handling 3 (nesting depth added 5). Most of this is not in the body itself: 10 of the 37 points are its own statements and the rest belongs to 7 function items inside it that branch (cancelActivation, prepare, activate, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-fresh-download.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f3af03c73151688c1b96cf7fe2e00f179748c678fea541f3029223489eed50"}},{"ruleId":"D2","level":"warning","message":{"text":"verified-install.download (cognitive 36): verified-install.download has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 5, error handling 2 (4 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2569bca220d15125b4f807c19dbf696bea0c7fef391e450fa86fde51cfbd1b"}},{"ruleId":"D2","level":"warning","message":{"text":"http-request-context.resolveLegacyHttpRequestContext (cognitive 36): http-request-context.resolveLegacyHttpRequestContext has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 13, error handling 2, loops 1, ternaries 1 (nesting depth added 3). Of this number, 24 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-request-context.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b9f5c4b65fc6735fc5bdfb6f5acf5f8d0e7a9ecdef1df2b0078b6e4132206d"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationFiles.pick (cognitive 36): OperationFiles.pick has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6, ternaries 4, error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd490a4d0d00a03bf6871c5c8d0a5205f7cb7cfbab127b27a0be071e6d249f9"}},{"ruleId":"D2","level":"warning","message":{"text":"task-save-directory.restoreTaskSaveDirectory (cognitive 36): task-save-directory.restoreTaskSaveDirectory has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 9, loops 2 (4 pts), ternaries 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-save-directory.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e13a8431ae79e8dba4fcdb61ba2fb161869af4873d9ff279b0684da80cbc07"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackerSyncer.fetch (cognitive 36): TrackerSyncer.fetch has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 5 (9 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 17). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to one function literal inside it that branches (line 95). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-syncer.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"faadc531c9b96de8b8050a9aa18d1686e4e550aec17703bcfe01818447dae442"}},{"ruleId":"D2","level":"warning","message":{"text":"activity-calendar-model.selectActivityGeometry (cognitive 36): activity-calendar-model.selectActivityGeometry has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (11 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d4e60a403b3ac09a810388eff5a1275bc44c0ccc97619ba8afb1f838af6652"}},{"ruleId":"D2","level":"warning","message":{"text":"task-list-panel.TaskListPanel (cognitive 36): task-list-panel.TaskListPanel has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 14, ternaries 4 (nesting depth added 1). Most of this is not in the body itself: 5 of the 36 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 248, 220, 187, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-list-panel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eba376d049901a23d140c72ed82a8aa1df15432ebdb575cf582b7915455190"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-detail-page.PluginDetailPage (cognitive 36): plugin-detail-page.PluginDetailPage has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 19, ternaries 8 (9 pts), if/else 5 (8 pts) (nesting depth added 4). Of this number, 31 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b2d99de015751f1eb24ea90119981b96ac1fb0d69fbf91abe284c5d64b2b57"}},{"ruleId":"D2","level":"warning","message":{"text":"index.main::startServer (cognitive 36): index.main::startServer has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (22 pts), error handling 6 (7 pts), boolean chains 6, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 2 other methods here (index.main, index.main::handlePolledTasks) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5240e2fc3c5291e577b58052595a665afb6ff54e4a3ea6e8c9439d362f3593"}},{"ruleId":"D2","level":"warning","message":{"text":"quick-js-worker.injectPluginApi (cognitive 35): quick-js-worker.injectPluginApi has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 9 (12 pts), error handling 4 (5 pts), loops 4, boolean chains 1 (nesting depth added 6). Most of this is not in the body itself: 8 of the 35 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 1664, 1593, 1637, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca3b46d8caf31c073eb4b7f635c558e0ea1a385fcc7ba118d737793c450e2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"move-tasks.moveBatch (cognitive 35): move-tasks.moveBatch has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6 (10 pts), boolean chains 7, loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 13). Most of this is not in the body itself: 13 of the 35 points are its own statements and the rest belongs to 2 function items inside it that branch (move, a function literal at line 37). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/move-tasks.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2ad0485cc012610beb16f847d269d7ebc3c6f752441786aaaa9f6f412fff26"}},{"ruleId":"D2","level":"warning","message":{"text":"index.bootstrapBridge (cognitive 35): index.bootstrapBridge has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 5 (9 pts), error handling 4 (6 pts), loops 6, boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 9 of the 35 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 963, a function literal at line 569, a function literal at line 852, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2781e8f87b48b3e84ca3e73083fd759c2143876fbb63e10592a4736b5b22201"}},{"ruleId":"D2","level":"warning","message":{"text":"url-editor.UrlEditor (cognitive 35): url-editor.UrlEditor has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 8 (12 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 35 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 60, 94, 109, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-editor.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad9aea780ec743aade68688a39877ea7f6efdcd450001a6eb9eada2e6fbc73a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.main::handlePolledTasks (cognitive 35): index.main::handlePolledTasks has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), error handling 1 (3 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (index.main, index.main::startServer) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c8be3f28cf394d66781606e28196980a45e13470b87efb06067cae15c4a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginRegistry.applyOverlay (cognitive 34): PluginRegistry.applyOverlay has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 5 (9 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d556303858cac9d972b39154cc49e3754c868919a3b26e78a1cee71c2630901"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginInstaller.stage (cognitive 34): PluginInstaller.stage has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9, error handling 5 (7 pts), ternaries 4 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeba49dd39244a8e623149d9cf02eaaeaf8aeb92e98af51d76c6cfb27b4c09c"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-task.finalizeTaskSerialized (cognitive 34): finalize-task.finalizeTaskSerialized has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9ccafd80ae2e367749d3ae125d8b4eabcc001145b4faf17993d37ce5e8ddcc"}},{"ruleId":"D2","level":"warning","message":{"text":"general-dialog.GeneralDialog (cognitive 34): general-dialog.GeneralDialog has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 15, ternaries 8 (10 pts), if/else 7 (8 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 12 of the 34 points are its own statements and the rest belongs to 9 function items inside it that branch (notificationRow, a function literal at line 221, a function literal at line 73, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0ec672714148e780e7b46164f6571b44585491147aafde4af41f69040a2035"}},{"ruleId":"D2","level":"warning","message":{"text":"command-graph.readSnapshot (cognitive 33): command-graph.readSnapshot has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/command-graph.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"30260a24a69b0a7befe5cfcdd30d1836e3eac5831aabd05ac68b99f1598c0852"}},{"ruleId":"D2","level":"warning","message":{"text":"moext-reader.extractLoadedMoext (cognitive 33): moext-reader.extractLoadedMoext has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, boolean chains 6, ternaries 2, error handling 1. Most of this is not in the body itself: 4 of the 33 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 293, 368, 390, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/moext-reader.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d75c5e7cee05dc087164d793aa009cc4c90c7f3b5356e26c14145f73fb4e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationFiles.cleanup (cognitive 33): OperationFiles.cleanup has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 4 (10 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e000bdb3375549e909ba96169208a4847ce6f4fd59bdc8a76d71afdbc2652ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FinalizeRecovery.recoverReserved (cognitive 33): FinalizeRecovery.recoverReserved has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 7, ternaries 2 (nesting depth added 6). Of this number, 26 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2dedb4cb95a5f96aa27c4d1c62957713740824a2e0965a2f5ea92daf98d78f"}},{"ruleId":"D2","level":"warning","message":{"text":"portable-relocation.relocatePortableDatabase (cognitive 33): portable-relocation.relocatePortableDatabase has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 21). None of this is in the body itself: all 33 points belong to one function literal inside it that branches (line 229). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/portable-relocation.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca0c17618bb74122e9dd1c1dc9a9f342263192b1d489fb15535a96ad6ea5c54"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-task.finalizeBtAfterRename (cognitive 33): finalize-task.finalizeBtAfterRename has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 11 (13 pts), error handling 6 (10 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 7). Of this number, 31 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2f75fb431ba1eb6e1ff2385734958988c046dc365e511b7a13d21639c5d91f"}},{"ruleId":"D2","level":"warning","message":{"text":"SynologyTaskFiles.outputIdentity (cognitive 33): SynologyTaskFiles.outputIdentity has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 10 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/task-files.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb37357755b60ad3958e1780a07101b4959cb3b681c2f14604d012388e01515d"}},{"ruleId":"D2","level":"warning","message":{"text":"lifecycle (cognitive 33): lifecycle has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 4, error handling 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"532ce2ed462dfbfda176ecfc8942f44156a90f1ed079c9d81f9f25b8166e3976"}},{"ruleId":"D2","level":"warning","message":{"text":"startAccountAuthority (cognitive 33): startAccountAuthority has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, ternaries 2 (4 pts), error handling 3, loops 2 (3 pts) (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 13 belong to 20 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"75745507b8ce27e6b8ecbcb99e82f06e0fb76e751010ad2f481ff4b17e29661f"}},{"ruleId":"D2","level":"warning","message":{"text":"session-parser.parseLegacySession::flush (cognitive 32): session-parser.parseLegacySession::flush has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, ternaries 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (session-parser.parseLegacySession) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4187c569f7a231ff4f8951e0e54dc1aa56ce49695a85f8d5ac19ccee883fa87"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginHost.doActivate (cognitive 32): PluginHost.doActivate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 6, error handling 2, ternaries 1 (nesting depth added 5). Of this number, 29 points are the body\u0027s own statements and 3 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fb14f1466331422faec60c0670a3f40a9b854528ad1e953e79b0f462a8a76b"}},{"ruleId":"D2","level":"warning","message":{"text":"DurableFinalizeRuntime.commit (cognitive 32): DurableFinalizeRuntime.commit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 10, ternaries 4 (5 pts), error handling 2 (3 pts) (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 13 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/durable-finalize-runtime.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dc7370b43126cf47a7b0cba9dc3354e9b08c85c9043efabaf3e12efefccff3"}},{"ruleId":"D2","level":"warning","message":{"text":"create-torrent.createTorrent (cognitive 32): create-torrent.createTorrent has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/create-torrent.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91caaa6a3d9286844ce8b55c37bfe855d54b89f87f33e6ef9969af648341405"}},{"ruleId":"D2","level":"warning","message":{"text":"package-manager.classifyCliInstall (cognitive 32): package-manager.classifyCliInstall has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 10, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b6e0df025967461fb06e2b09aadfcdb1d9a5cc8f62bbcab3ba3ec05cb1326d"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-input-group.PluginInputGroup (cognitive 32): plugin-input-group.PluginInputGroup has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 16, if/else 10 (11 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 3). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 71, triggerCheck, a function literal at line 92, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-input-group.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"232ca7354de0ac140dd3f673170de97dc7c90aaa51a37e3a02daa6f790986e32"}},{"ruleId":"D2","level":"warning","message":{"text":"HlsDashPipeline.dispatch (cognitive 31): HlsDashPipeline.dispatch has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 8 (18 pts), error handling 4 (7 pts), if/else 4 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/pipelines/hls-dash-pipeline.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"301576047a01030c988d8febb50edf48e557291d6fb3c66e4a48c457c1220432"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsManager.persistUpdate (cognitive 31): SettingsManager.persistUpdate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (24 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75aca3136bb59f9d6838fadf5ffb7e30779f6a3604de9ae2d387cecddcedc90"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineSupervisor.diagnose (cognitive 31): EngineSupervisor.diagnose has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 10 (17 pts), boolean chains 10, error handling 1 (2 pts), if/else 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"73daae4c74e1b07fa7abf7fb4d948fe2aeb59fe99b8413f345429f322618b8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"window-chrome.WindowChrome (cognitive 31): window-chrome.WindowChrome has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 17, ternaries 9 (13 pts), if/else 1 (nesting depth added 4). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/window-chrome.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"666444017a04134c5e3b1a2154dc829ecf6722d956a623987da81abfbaf92f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"task-inspector-activity.cloneDataOnlyValue (cognitive 31): task-inspector-activity.cloneDataOnlyValue has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 7, loops 2 (3 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-inspector-activity.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a286fc0bd962e0e72a6a2c8650bd4cdc79e7909b1cca5e0c1447f0d7ceefde06"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_finalize_fs::platform::windows::metadata::directory_names (cognitive 31): motrix_finalize_fs::platform::windows::metadata::directory_names has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/windows/metadata.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e5479ade4c9933b49eee2921a5e867cfc78c0365a1673e6a89c0aa16112902"}},{"ruleId":"D2","level":"warning","message":{"text":"BridgeReceiver.dispatchAdapted (cognitive 30): BridgeReceiver.dispatchAdapted has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 5 (14 pts), if/else 8 (13 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/bridge-receiver.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8546d32f9e19a85ce546123dcdccf3e997554ae063a084ab43b8a2a98625b1"}},{"ruleId":"D2","level":"warning","message":{"text":"FullCrossPluginInvoker.execute (cognitive 30): FullCrossPluginInvoker.execute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (18 pts), error handling 4 (5 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/cross-plugin-invoker.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67aa8eab4a09bdd3344b86cad0f88e6a81aad451b034f2f2d26b5569123cfca"}},{"ruleId":"D2","level":"warning","message":{"text":"FinalizeRecovery.recoverRenameFile (cognitive 30): FinalizeRecovery.recoverRenameFile has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 10, ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d26d19fd30f4ecffcc24a4a9195ae7bbcf02f2c7a644b4a7be5c3d82661d29"}},{"ruleId":"D2","level":"warning","message":{"text":"re-add-task.reAddTaskUnderMutation (cognitive 30): re-add-task.reAddTaskUnderMutation has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 4 (5 pts), ternaries 4 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4996b2e252a96dfea036a9f514e7ff9cc1a1f06a21fe57c02f2da86c776c4e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ffmpeg-probe-electron.makeElectronFfmpegProbe.\u003Creturned closure\u003E (cognitive 30): ffmpeg-probe-electron.makeElectronFfmpegProbe.\u003Creturned closure\u003E has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7, error handling 5 (7 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-probe-electron.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab189411587a1cc4dc9c8221891835320f98e10203862099a7222f379a67a717"}},{"ruleId":"D2","level":"warning","message":{"text":"desktop-import.prepareFreshDownload (cognitive 30): desktop-import.prepareFreshDownload has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c41d92a9ec10d21996dff19c5c33a7eccd064b85154434514e938f426810ea4"}},{"ruleId":"D2","level":"warning","message":{"text":"task-actions-menu.TaskActionsMenu (cognitive 30): task-actions-menu.TaskActionsMenu has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 36, if/else 22 (26 pts), ternaries 9 (13 pts), error handling 1, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (task-actions-menu.TaskActionsMenu::handleShortcut) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74fb7ee65e09903d7cc21d6712d99f0e7b15b69e3879a2f03b4e82276a98ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"activity-chart-model.buildActivityChartModel (cognitive 30): activity-chart-model.buildActivityChartModel has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 6 (9 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/activity-chart-model.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a72575c7d02381bf48e5682dc2d796a95d881371eec451cc03e28e05e3f53a2"}},{"ruleId":"D2","level":"warning","message":{"text":"marquee-overlay.MarqueeOverlay (cognitive 30): marquee-overlay.MarqueeOverlay has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 8, ternaries 1 (nesting depth added 1). None of this is in the body itself: all 30 points belong to 11 function literals inside it that branch (lines 133, 164, 78, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7572b87f6415e1532695a905a0edf184b312cf7bff4129ce5e3f3f41f7a830ce"}},{"ruleId":"D2","level":"warning","message":{"text":"operator-auth.registerOperatorAuth (cognitive 30): operator-auth.registerOperatorAuth has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 7, error handling 1 (3 pts), ternaries 3 (nesting depth added 7). None of this is in the body itself: all 30 points belong to 4 function literals inside it that branch (lines 232, 286, 317, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/operator-auth.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24e26daea5017c5585dd0173ff5af4279ca489409f6df38120a90c17069d23e"}},{"ruleId":"D2","level":"warning","message":{"text":"aria2-tuning.recommendFileAllocation (cognitive 29): aria2-tuning.recommendFileAllocation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-tuning.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d163097792f1975ec091e03be7c5e6aa27b76e84268988970f1984d14507db"}},{"ruleId":"D2","level":"warning","message":{"text":"chain-merge.mergeChain (cognitive 29): chain-merge.mergeChain has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 16). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/chain-merge.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7965746a2263ca0027bbabc6a91ed27bf416e436fcd3dfbf6201547765ad1710"}},{"ruleId":"D2","level":"warning","message":{"text":"appearance-dialog.AppearanceDialog (cognitive 29): appearance-dialog.AppearanceDialog has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 11 (12 pts), ternaries 3 (nesting depth added 1). Most of this is not in the body itself: 14 of the 29 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 219, 139, 110, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b8783ba0f4b8b3f25315eb6535c2f2162d37ef1c48fc72b02f04f4a560799c"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge-data-dir-lock.createOwnedFile (cognitive 28): bridge-data-dir-lock.createOwnedFile has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 5 (9 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"7969d7cea954389ad40e03695bab6c4d2628e5b352304770d3abcbecc5bd70c2"}},{"ruleId":"D2","level":"warning","message":{"text":"FfmpegService.run (cognitive 28): FfmpegService.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 5). None of this is in the body itself: all 28 points belong to 4 function items inside it that branch (a function literal at line 130, acceptLine, a function literal at line 158, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/ffmpeg-service.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"041f39235e8044c3e69089bcca53ae88f5fff94658b5eff548f55a2ad23753b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginInstaller.commit (cognitive 28): PluginInstaller.commit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 7). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 483, 639). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b5e38bc6a9315841d0eb0249b5187af5bba763069ce7b9c088e9bce787a23f"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-journal-repository.validateIntents (cognitive 28): finalize-journal-repository.validateIntents has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 9, ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6a0f36eb924b7ed5f747823b5bec13702440927218a84b8eb16a9f0b40dc05"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectResourceValidatorService.requestFollowingRedirects (cognitive 28): DirectResourceValidatorService.requestFollowingRedirects has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837719710d98a561e101127124644440327c73c972218a09d23965e64f43521"}},{"ruleId":"D2","level":"warning","message":{"text":"re-add-task.buildDirectReAddParams (cognitive 28): re-add-task.buildDirectReAddParams has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 7 (8 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5303b29f2d26aab0536079e778fa87fdc96503575b0d9d6ce64bb474c7a5c8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ffmpeg-fetch-electron.fetchFfmpegAsset (cognitive 28): ffmpeg-fetch-electron.fetchFfmpegAsset has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, error handling 3 (4 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 4). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 83, 22, 41, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-fetch-electron.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"88615e905970b785ef00daf4f7fa3685254855ad8c71a18ebddb4900a895e3f8"}},{"ruleId":"D2","level":"warning","message":{"text":"desktop-import.registerLegacyImportIpc (cognitive 28): desktop-import.registerLegacyImportIpc has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12, boolean chains 8, ternaries 4 (6 pts), error handling 1, loops 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 13 function items inside it that branch (a function literal at line 234, a function literal at line 284, a function literal at line 124, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c8d614ccaf6a8c97e0c30a415d508f072786a8ae360ab2cdd97397375363ba"}},{"ruleId":"D2","level":"warning","message":{"text":"advanced-dialog.AdvancedDialog (cognitive 28): advanced-dialog.AdvancedDialog has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (10 pts), ternaries 5 (6 pts) (nesting depth added 2). Most of this is not in the body itself: 5 of the 28 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 169, 355, 376, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef233edd2315e055b5fa5b7ac14e151dbfd4c249a3b4b1ff02902b498e641bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker-sync-details.TrackerSyncDetails (cognitive 28): tracker-sync-details.TrackerSyncDetails has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 10 (14 pts), boolean chains 12, error handling 1, if/else 1 (nesting depth added 4). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 70, a function literal at line 196, a function literal at line 55, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/tracker-sync-details.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"24076d0e100c813830faf9214910dad26ca5f8039d114553364a04ca8bf2912b"}},{"ruleId":"D2","level":"warning","message":{"text":"use-pending-magnet-selection.usePendingMagnetSelection (cognitive 28): use-pending-magnet-selection.usePendingMagnetSelection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 10, ternaries 3 (nesting depth added 1). None of this is in the body itself: all 28 points belong to 10 function literals inside it that branch (lines 61, 28, 50, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task-dialog/use-pending-magnet-selection.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fbb2fb1a66e90970572bfb319895efe1cab280745b87eeb1c78b66571b8f81"}},{"ruleId":"D2","level":"warning","message":{"text":"import-task-selection.ImportTaskSelection (cognitive 28): import-task-selection.ImportTaskSelection has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (9 pts), ternaries 4 (6 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 6 function items inside it that branch (renderRow, a function literal at line 74, a function literal at line 150, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-task-selection.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa670978ab667c34639eb5f688520a178291ce82ba9116bd060b7373e6e66b9"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_native_host::probe::decode_chunked (cognitive 28): motrix_native_host::probe::decode_chunked has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/probe.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58e8bd0b667123213d39c13e4d974499833768f8d72f76e419895a9b70264c0"}},{"ruleId":"D2","level":"warning","message":{"text":"PostDeliveryScheduler.runBatch (cognitive 27): PostDeliveryScheduler.runBatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03c2d6eab544291f31d3d751147ad8e60b8209cc7213f5b2e51957968b179e6"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager.mergeTaskFromPair (cognitive 27): SessionManager.mergeTaskFromPair has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, ternaries 6 (8 pts), if/else 4 (5 pts) (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aee0e7ed297bbb5712afc321f3713c88ec7f034fd280365cf2db07d2de64a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"MagnetTracker.submitUnderAdmission (cognitive 27): MagnetTracker.submitUnderAdmission has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), error handling 3, boolean chains 2, ternaries 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 12 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"5804c270163af653c7816626f999a2f202ad5bcfde31224ba3107fa33fc52e57"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskRecoveryServiceImpl.recover (cognitive 27): TaskRecoveryServiceImpl.recover has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, loops 4 (5 pts), ternaries 3 (5 pts), error handling 2 (4 pts) (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"701d3be30c384d0deeb8d8c5ecc19c5dad1024116cf5fdeecf44e1c8b2e8b8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackerManager.performSyncAndCurate (cognitive 27): TrackerManager.performSyncAndCurate has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, ternaries 9 (10 pts), if/else 4 (5 pts), loops 1 (nesting depth added 2). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to 8 function items inside it that branch (fetchKind, a function literal at line 325, a function literal at line 439, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"920362fcb8e5e26ef51e16d420d2c4a8a0a84a5d6a34cefbe982e8e645a81a10"}},{"ruleId":"D2","level":"warning","message":{"text":"AppImageNativeHost.install (cognitive 27): AppImageNativeHost.install has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (4 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9fe57af393aea3375a8e0455fe673439134289ff3105f054f4915e72de1f71"}},{"ruleId":"D2","level":"warning","message":{"text":"appimage-integration.installSelfIntegration (cognitive 27): appimage-integration.installSelfIntegration has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, ternaries 3, error handling 2 (nesting depth added 2). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bbe5e977faa042fb8af44b61559c64cb956f0870fb32ec0fb40a2682f3c4a9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.startEngineAndRestore (cognitive 27): index.startEngineAndRestore has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 5, error handling 4, loops 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 11 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7341b769abeaeb2b37333b47ee12b9e99606cb4ff0e276bd7321d756dfb6a5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"system-protocols-section.SystemProtocolsSection (cognitive 27): system-protocols-section.SystemProtocolsSection has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 21, if/else 15 (17 pts), ternaries 7 (12 pts), error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (system-protocols-section.SystemProtocolsSection::handleOpenSystemSettings) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/system-protocols-section.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd562b17b0ca5139f690841eac676ac14650d8e344271a23c06870959a6786d6"}},{"ruleId":"D2","level":"warning","message":{"text":"integration-dialog.IntegrationDialog (cognitive 27): integration-dialog.IntegrationDialog has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (10 pts), ternaries 3 (5 pts) (nesting depth added 3). Most of this is not in the body itself: 13 of the 27 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 97, 84, 136). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/integration-dialog.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"844f871da8abb94431f302e0f63e9898774afc2a523c219e7b8ef16759314a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"advanced-panel.DenseField (cognitive 27): advanced-panel.DenseField has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 15). None of this is in the body itself: all 27 points belong to 2 function literals inside it that branch (lines 349, 391). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/advanced-panel.tsx"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd8ea3603ef037c0fb98ac418cf9009b70147e64c7273c65b4bf7137dd07298"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix-menu-button.ElectronMotrixMenuButton (cognitive 27): motrix-menu-button.ElectronMotrixMenuButton has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, boolean chains 7, ternaries 5. Most of this is not in the body itself: 5 of the 27 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 326, a function literal at line 310, a function literal at line 240, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a844b16730927729f16cf95c6c73ba90d39d5c6644761bd674a9898948aa6769"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-extension-admission-policy.parseForwarded (cognitive 26): remote-extension-admission-policy.parseForwarded has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e934442cf488344dc161114e3ce6af52ae8ca7e146898b9de875903b478f412"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskInspectorActivityService.recordSample (cognitive 26): TaskInspectorActivityService.recordSample has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9, ternaries 3 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"da883359d375a246aa083971d492006538a4a8b43f47c97a3b327b9050a495f2"}},{"ruleId":"D2","level":"warning","message":{"text":"aria2-legacy-http.requestMatches (cognitive 26): aria2-legacy-http.requestMatches has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 2, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-legacy-http.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ebadde00427828ef2efb9ab7bae11fb21cf404dd58b6fe70c9bcee1e6193e1"}},{"ruleId":"D2","level":"warning","message":{"text":"verified-install.extractVerifiedFfmpeg (cognitive 26): verified-install.extractVerifiedFfmpeg has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 12, loops 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 576, 551, 527, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f8716ad8a02fc83207f94781382251787864dfb0a821e9abbe13d232add2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"fs-sandbox.resolveDeepInsideSandbox (cognitive 26): fs-sandbox.resolveDeepInsideSandbox has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 4 (6 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-sandbox.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50d0b6f02da1e7884481e2615bc8e38a8e02ea0f6eaf6673b13b023ec2adfc0"}},{"ruleId":"D2","level":"warning","message":{"text":"bit-torrent-dialog.BitTorrentDialog (cognitive 26): bit-torrent-dialog.BitTorrentDialog has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10, boolean chains 8, if/else 7 (8 pts) (nesting depth added 1). Most of this is not in the body itself: 7 of the 26 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 150, 97, 135, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7ff81de0adfe607ffc1e0298f8f05b6028489db9e28e034e45e971de723b85"}},{"ruleId":"D2","level":"warning","message":{"text":"log-redact.headerNames (cognitive 26): log-redact.headerNames has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (6 pts), error handling 2 (5 pts), loops 1 (nesting depth added 13). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c07cca9377575641885cc4b8b77fd0b283b062d6a9b17d15a9241fad4cc8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"log-redact.redactError (cognitive 26): log-redact.redactError has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 6 (8 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"009d755c7d09856d28a4b5b3fca49b83cff82217337126afb4250c2853f7e2ae"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapIPCCodec.validateResponse (cognitive 26): BootstrapIPCCodec.validateResponse has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 19, if/else 5 (7 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/Sources/SafariNativeIPC/BootstrapIPCCodec.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9321070e6353aecc4fe7be00886fb9d56c5d9d7bdf26523f14bb2d796a35bb"}},{"ruleId":"D2","level":"warning","message":{"text":"registry-fetcher.fetchVerifiedPackageBytes (cognitive 25): registry-fetcher.fetchVerifiedPackageBytes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, ternaries 1 (3 pts), error handling 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-fetcher.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ac5bcbb7d3ed459d1f74f5eff16e639c51dc18a7c35000f24e2645bae0f784"}},{"ruleId":"D2","level":"warning","message":{"text":"MagnetTracker.retryMetadataUnderMutation (cognitive 25): MagnetTracker.retryMetadataUnderMutation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"81580f180d7d4e5b55fee0a37cabc875878891d7e63252360edc8e6c511399e9"}},{"ruleId":"D2","level":"warning","message":{"text":"MotrixNatManager.checkDiagnostics (cognitive 25): MotrixNatManager.checkDiagnostics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/nat/motrix-nat-manager.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9745f42f167166b8d9e6693be7bd24d2f2cfa5c630d6c0b5312f0b5879f9611"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-diagnostics-page.PluginDiagnosticsPage (cognitive 25): plugin-diagnostics-page.PluginDiagnosticsPage has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, if/else 9, ternaries 4. Of this number, 20 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"231872286f66e644d9da2ff98c83b5c4f0c818b5b1c46e6dc6356f4c60f7dc7a"}},{"ruleId":"D2","level":"warning","message":{"text":"use-directory-preferences-draft.useRevisionedDirectoryDraft.save (cognitive 25): use-directory-preferences-draft.useRevisionedDirectoryDraft.save has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 4, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/use-directory-preferences-draft.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1a89c2f08833992f7e8644e996b317d1b3fa62b75c172c55ce9634929635e"}},{"ruleId":"D2","level":"warning","message":{"text":"json-schema-to-zod.jsonSchemaToZod (cognitive 25): json-schema-to-zod.jsonSchemaToZod has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/json-schema-to-zod.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c941dfa5500e992bb08f5a5a4513a554d6b8f44c3adb69613389a6c9a2cd369c"}},{"ruleId":"D2","level":"warning","message":{"text":"prepareApplicationOwnership (cognitive 25): prepareApplicationOwnership has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/authority-lifecycle.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3676403269db3fe23ee425c1f9b23b8ecf7187cf2c325344ae227602a111dfe1"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyBtActivationService.prepare (cognitive 24): LegacyBtActivationService.prepare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 8, loops 1 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a96c348cbcaf122fcffdb737287fa82cb5b5c30c35b49af937f6298baefdf0d"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-task.finalizeBt (cognitive 24): finalize-task.finalizeBt has cognitive complexity 24 (threshold 15). Drivers by points: error handling 6 (11 pts), if/else 9 (10 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a7dda3f5b5f29ffc300a1185b8b049b4d0b0b9fee3295ccd37dc37d0246e68"}},{"ruleId":"D2","level":"warning","message":{"text":"MagnetTracker.doCleanupCacheEntry (cognitive 24): MagnetTracker.doCleanupCacheEntry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, error handling 1, ternaries 1 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ef6455c546606371e25413acfba063ba253d27eab7e9efb0e13df5d422c1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskRecoveryServiceImpl.applyAction (cognitive 24): TaskRecoveryServiceImpl.applyAction has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce7848124aa8f56bd7b56b3eb629097945dec00940016b7a0d1b30c6deb85f7"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackerProber.probe (cognitive 24): TrackerProber.probe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 42, 27). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-prober.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6c7f427a18c6bd18cb41bce8d680a7c6406e153470108e7de541adbed37d10"}},{"ruleId":"D2","level":"warning","message":{"text":"linux-default-apps.resolveInstalledDesktopIds (cognitive 24): linux-default-apps.resolveInstalledDesktopIds has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/linux-default-apps.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"472b303d65debd057d730bca00405bade588a29b4def7d84cb46eacc842e8f33"}},{"ruleId":"D2","level":"warning","message":{"text":"task-inspector-drawer.TaskInspectorDrawer (cognitive 24): task-inspector-drawer.TaskInspectorDrawer has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 18, ternaries 4 (5 pts), if/else 1 (nesting depth added 1). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-inspector-drawer.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536f3b13f33de38c622867657326dc765fa46ea80b8068c2e53491bda3239e6"}},{"ruleId":"D2","level":"warning","message":{"text":"compact-limit-input.CompactLimitInput (cognitive 24): compact-limit-input.CompactLimitInput has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 14 (16 pts), boolean chains 6, if/else 2 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/compact-limit-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f74f78fcdafff01f3de6b6bb933e491c267b931c7798a416b79341f4a176f3"}},{"ruleId":"D2","level":"warning","message":{"text":"network-dialog.NetworkDialog (cognitive 24): network-dialog.NetworkDialog has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (10 pts) (nesting depth added 1). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 135, 163, 121, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3638ea1f466b711a04686b52400fa97dd68e4722bcd5fb383f3a9cbd2cd701"}},{"ruleId":"D2","level":"warning","message":{"text":"toolbar-search.ToolbarSearch (cognitive 24): toolbar-search.ToolbarSearch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 4 (6 pts) (nesting depth added 4). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 136, a function literal at line 88, collapseIfIdle, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/toolbar/toolbar-search.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2ef18041ddc3b7b2cc71edffe89fd56cfc0db470e1d93e1190b475bd08d650"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryPickerController.start (cognitive 24): DirectoryPickerController.start has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4f1c94e70590f4e9a05616349ab6b25140afa26d6fcd7dca96c37fda372dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"NasFileRemover.perform (cognitive 24): NasFileRemover.perform has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, ternaries 2 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-remover.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f0aae3e2bdff00c35ebabf8ebf3627199b50121ca258043692d7b79fc856a6"}},{"ruleId":"D2","level":"warning","message":{"text":"credential-store.reconcile (cognitive 23): credential-store.reconcile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaae29d37dc3260d2e23c025ed8340ad66f5839a24f5cf4c26c9bf9035734f74"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketBridgeServer.resolveExtensionMbp1Route (cognitive 23): WebSocketBridgeServer.resolveExtensionMbp1Route has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5, boolean chains 3, error handling 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bc513dbfeb2fee97c94e270c054c70b340b1cecb0c3a01fee8991c03fbf1ed"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-removal-safety.selectRemovalSurvivor (cognitive 23): finalize-removal-safety.selectRemovalSurvivor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-removal-safety.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bc419cb1cc31538384fb2fd3884b959cdcfb052755967cd9f3a2a5a84658f1"}},{"ruleId":"D2","level":"warning","message":{"text":"system-proxy.parseElectronProxyChain (cognitive 23): system-proxy.parseElectronProxyChain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (9 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/system-proxy.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5fe6001bcaa0ff2af604eb66d29cce3d200b1e01ecc203b66b064ac0c8fcaf"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectResourceValidatorService.verifyLegacyContent::verifyRange (cognitive 23): DirectResourceValidatorService.verifyLegacyContent::verifyRange has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fbb1db75849ebb7107dc0a779ff67c26848331589c947a87fbb87065f238b6"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-task.finalizeBtInPlace (cognitive 23): finalize-task.finalizeBtInPlace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (8 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de525bf2830ed1d7a603aa41379e3338b0f71f134ea355c7d5b5cb4db160cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"appimage-integration.parseExecValue (cognitive 23): appimage-integration.parseExecValue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6281f0dbeeb42d2db35bb67173d0f3626fca14e88c927911595671f129fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"services.createElectronPlatformServices (cognitive 23): services.createElectronPlatformServices has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 4 (6 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/services.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8307330f5079a497ceda9f86ec0c25a64e13c7b0736864ade834602b634819a7"}},{"ruleId":"D2","level":"warning","message":{"text":"overview-tab.OverviewTab (cognitive 23): overview-tab.OverviewTab has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/overview-tab.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05d1cbf25e9b3d76ffd80f292f0ffcd2c242f141a1073e874fc586efe440743"}},{"ruleId":"D2","level":"warning","message":{"text":"notifications-page.NotificationsPage (cognitive 23): notifications-page.NotificationsPage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, error handling 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 212, runAction, a function literal at line 284, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c8165cecfe5f2a8525e6c7196d73da3f628ca800c5b8b0e3f211ab069db0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin-update-dialog.BuiltinUpdateDialog (cognitive 23): builtin-update-dialog.BuiltinUpdateDialog has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7, ternaries 4 (7 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 4). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 6 function items inside it that branch (cancel, a function literal at line 49, confirm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/builtin-update-dialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"519ce82fe51fab198613554f413412f53d4f7f43c90ad706790aa472c93245c0"}},{"ruleId":"D2","level":"warning","message":{"text":"appimage-integration-section.AppImageIntegrationSection (cognitive 23): appimage-integration-section.AppImageIntegrationSection has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, ternaries 4 (7 pts), if/else 3, error handling 1 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7417c8b04e28dcd40ef787a04e4f0a0eba168956656cbfaa7151bcc1d404a70"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix-menu-button.MenuTree (cognitive 23): motrix-menu-button.MenuTree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5936cf544ee0ae2dd92da6fabdf6fe5c05a6dc1f4d33a243092127d844c8efd"}},{"ruleId":"D2","level":"warning","message":{"text":"directory-preferences-dialog.OpenDirectoryPreferencesDialog (cognitive 23): directory-preferences-dialog.OpenDirectoryPreferencesDialog has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 10. Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (keyDown, save, a function literal at line 73, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7ecb5e3f24af1cd0e30e361faf88ddb8b557dd9ab706defe7a414ae111faf7"}},{"ruleId":"D2","level":"warning","message":{"text":"use-polled-query.usePolledQuery (cognitive 23): use-polled-query.usePolledQuery has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). None of this is in the body itself: all 23 points belong to 5 function literals inside it that branch (lines 109, 90, 82, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-polled-query.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f773b58437f1bda20ac86de479861bc007d0b1ceabe348161784e8bfa12624d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerDirectoryService.locations (cognitive 23): ServerDirectoryService.locations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts), boolean chains 2, error handling 2 (nesting depth added 9). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6372149326a99e911e475f860b1dd2c721f19ae003d1f7fd420d7ed3205bb2a"}},{"ruleId":"D2","level":"warning","message":{"text":"applyPendingSettings (cognitive 23): applyPendingSettings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, error handling 2 (3 pts), loops 1 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 6 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac911314b1cdc4722a3384fb80ec3181d521d6fc902118a4ae93eb37ee68fddf"}},{"ruleId":"D2","level":"warning","message":{"text":"package-flatpak-companion.parseArgs (cognitive 22): package-flatpak-companion.parseArgs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/package-flatpak-companion.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afe899f498ffb0c97165912349ed312e3ae318ebe107691bfc103f863e6d43b"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge-data-dir-lock.recoverExistingLock (cognitive 22): bridge-data-dir-lock.recoverExistingLock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 4 (9 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5414dd14ed90db1f8b0c47ce370f523ccc8d443702ee91053faab3d1238b0485"}},{"ruleId":"D2","level":"warning","message":{"text":"verified-install.findLegacyRelease (cognitive 22): verified-install.findLegacyRelease has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc17db0a36c98a07832b58f480d847f733531c1ce24ff18dddc04642725d59"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginRegistry.setHostLanguageTransaction (cognitive 22): PluginRegistry.setHostLanguageTransaction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"096acedd069761777b467d0f5ca4dbcf2c60fba973dde6c092c0521cdb96c027"}},{"ruleId":"D2","level":"warning","message":{"text":"FinalizeRecovery.restorePrepared (cognitive 22): FinalizeRecovery.restorePrepared has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f7aeae5615d16b702054af53abe3348ddd19d852e814f62897583800a78f03"}},{"ruleId":"D2","level":"warning","message":{"text":"command-runner.createCommandRunner.\u003Creturned closure\u003E (cognitive 22): command-runner.createCommandRunner.\u003Creturned closure\u003E has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 8, error handling 4 (6 pts) (nesting depth added 2). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 180, 199, 125, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/process/command-runner.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"905b59037662870cafe056b54a867c7c0fa38ddd2cb8492a20eadb92a8b75dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"portable-relocation.relocatePortableProfile (cognitive 22): portable-relocation.relocatePortableProfile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/portable-relocation.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a779569add0238e93a1b29a7395452a9d35ae7c2bf22998149e6c6576eef046"}},{"ruleId":"D2","level":"warning","message":{"text":"bt-storage-dialog.BtStorageDialog (cognitive 22): bt-storage-dialog.BtStorageDialog has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, ternaries 5 (6 pts), if/else 3, error handling 1 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/bt-storage-dialog.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf3168f5998564d00b5e925e84542d608306de76da34660527bff312999b96e"}},{"ruleId":"D2","level":"warning","message":{"text":"task-actions-menu.TaskActionsMenu::handleShortcut (cognitive 22): task-actions-menu.TaskActionsMenu::handleShortcut has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (task-actions-menu.TaskActionsMenu) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"17819c4c0c4324d746b92b490d3022aafeffbccf0cf4524f6b66135ae2cba97b"}},{"ruleId":"D2","level":"warning","message":{"text":"bt-peer-geo-section.BtPeerGeoSection (cognitive 22): bt-peer-geo-section.BtPeerGeoSection has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, ternaries 5 (6 pts), if/else 4 (5 pts), error handling 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bt-peer-geo-section.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3969cd74bf3db0224d0042a83999b9b5ac3e9332c0043f25dd9c385d5fadb8"}},{"ruleId":"D2","level":"warning","message":{"text":"inspector-drawer.InspectorDrawer (cognitive 22): inspector-drawer.InspectorDrawer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 4, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 87, a function literal at line 169, selectHeight, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/inspector-drawer.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5635eadac5f56843c486de2dcf13798c85c891aed2febf69c3b98b354407dea5"}},{"ruleId":"D2","level":"warning","message":{"text":"chart.ChartTooltipContent (cognitive 22): chart.ChartTooltipContent has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, ternaries 6 (9 pts), if/else 4 (nesting depth added 3). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 199, 146). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/chart.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cfc2507231be17225d196c5896187602eb072a1ef4f8131bed381949e24058"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpWsTransport.invoke (cognitive 22): HttpWsTransport.invoke has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (7 pts), boolean chains 5, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c222ee912eda2a63ecc3abd5f1e5f76c6a945caa2b06714f4ba3127d66db452a"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpWsTransport.connectSocket (cognitive 22): HttpWsTransport.connectSocket has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), error handling 4 (5 pts), boolean chains 1, loops 1 (nesting depth added 2). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 334, renew, a function literal at line 328, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe08bd547613386f49f79047bc1513c5b92c77c489e6397a077dfa15c146278"}},{"ruleId":"D2","level":"warning","message":{"text":"server-process-ownership-authority.readExactBinding (cognitive 22): server-process-ownership-authority.readExactBinding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 6, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-process-ownership-authority.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"398f673138a67923e6a9881bcdf0ff01f5c375edb00007f4b32bc415708fd54b"}},{"ruleId":"D2","level":"warning","message":{"text":"NasRecoveryAccess.authorizeResume (cognitive 22): NasRecoveryAccess.authorizeResume has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/recovery-access.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b823f80a32c41c00bb9efafadd915e8dd5d003ea83651c2dcd034af9da3eae9d"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_finalize_fs::platform::unix::copy::copy_file_contents (cognitive 22): motrix_finalize_fs::platform::unix::copy::copy_file_contents has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"af55809451861cfc12e3537df560861bb7cf444b1a18d4c9274c33e2ea4dc351"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_finalize_fs::platform::unix::remove::remove_directory_snapshot (cognitive 22): motrix_finalize_fs::platform::unix::remove::remove_directory_snapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/remove.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"51da7421d08e0aab8e7c963fdef0421bd1d8707d7701d864483985b107698841"}},{"ruleId":"D2","level":"warning","message":{"text":"loadAuthorityKey (cognitive 22): loadAuthorityKey has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 3 (5 pts), boolean chains 3 (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b6db95f5194c7cfe3a2bba47a7b4ef1931bdec11e7ca817814b66aa95295a7"}},{"ruleId":"D2","level":"warning","message":{"text":"account-authority.accountFromSnapshot (cognitive 21): account-authority.accountFromSnapshot has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 9, ternaries 2 (3 pts) (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca13c776bdbb7be528e9b9639da4bd62ea9175a3fcd31743eb873c6daacdf075"}},{"ruleId":"D2","level":"warning","message":{"text":"validators.validateHistoryEventInput (cognitive 21): validators.validateHistoryEventInput has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/validators.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc812d1450534c3804b2fe9827d103aec042f82d0d0abaaf3d2cc2b26fe1e33"}},{"ruleId":"D2","level":"warning","message":{"text":"Aria2Adapter.removeDownloadResults (cognitive 21): Aria2Adapter.removeDownloadResults has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (9 pts), ternaries 2 (6 pts), boolean chains 2, error handling 1 (2 pts), if/else 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"827b7b095674ef13f93e18c7fd759504e3e45f4aad9a2030e4605aad3f258ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"FfmpegCapabilityHost.run (cognitive 21): FfmpegCapabilityHost.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, error handling 2, ternaries 2, loops 1 (nesting depth added 2). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (abort, a function literal at line 411, a function literal at line 441, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e6d1782540b05814a3e5273d82b9f4ff347a71746528d229c9c5c212e9b4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilityBridge.dispatchFfmpeg (cognitive 21): CapabilityBridge.dispatchFfmpeg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fdfb0eedf727f07fa704673119276c4d7957917c46f38a04ee24e726eb9555"}},{"ruleId":"D2","level":"warning","message":{"text":"session-manager.resolveCurrentAria2Rows (cognitive 21): session-manager.resolveCurrentAria2Rows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40eb09af0297bd246d37ad77818adba068ed545d35ed3d5bc0a63f75b22c05a"}},{"ruleId":"D2","level":"warning","message":{"text":"MagnetTracker.primeFromDatabase (cognitive 21): MagnetTracker.primeFromDatabase has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, ternaries 2 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e48a11990681838cac907b3051bcfe0f14c5fb086ee16ee774da2de58801fe"}},{"ruleId":"D2","level":"warning","message":{"text":"create-task-handler.createAdmittedTask (cognitive 21): create-task-handler.createAdmittedTask has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea701220e6eb24ff12debcf853bc04dd9e3b9add5c65ea27edba1226595b80c8"}},{"ruleId":"D2","level":"warning","message":{"text":"create-task-handler.handleCreateTaskUnderAdmission::createReservedTask (cognitive 21): create-task-handler.handleCreateTaskUnderAdmission::createReservedTask has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 4 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (create-task-handler.handleCreateTaskUnderAdmission) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5915a1ddd029c429e897896526b91ca6c9fcc66132c059b6be112de9a96f2c4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.makeResolveToMux.\u003Creturned closure\u003E (cognitive 21): index.makeResolveToMux.\u003Creturned closure\u003E has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 2 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 9). Of this number, 14 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb5c7ff86a88e07dd107991a02ddd29905fd753f5772f38ca182aec0d18fc87"}},{"ruleId":"D2","level":"warning","message":{"text":"CliToolService.#probe (cognitive 21): CliToolService.#probe has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 7, if/else 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba763833e0311a184751446aa54bcf14adb96af1509275b6f99849fa914dd325"}},{"ruleId":"D2","level":"warning","message":{"text":"tile-segmented-control.ForwardedTileSegmentedControl (cognitive 21): tile-segmented-control.ForwardedTileSegmentedControl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 4, loops 1, match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (adjacentEnabledValue, requestValueChange, a function literal at line 136, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/tile-segmented-control.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"40309b2225fd0f59b51fe8a1ab34db9228944dbbb1e2a5438b14c1c7aa66f358"}},{"ruleId":"D2","level":"warning","message":{"text":"import-run-content.ImportRunResult (cognitive 21): import-run-content.ImportRunResult has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 7 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-run-content.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e13be4bb0089e69ef5e47dcf8531455d6dcb3e272b6b4254b3ca32b3c36def"}},{"ruleId":"D2","level":"warning","message":{"text":"use-task-speed-history.useTaskSpeedHistory (cognitive 21): use-task-speed-history.useTaskSpeedHistory has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 97, 61, 120, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-speed-history.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcda9487a746815a188aed88c89f429e6c7a6c5e62b4fc643dd2c05d5f73309a"}},{"ruleId":"D2","level":"warning","message":{"text":"use-transfer-stats.useTransferStats (cognitive 21): use-transfer-stats.useTransferStats has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 2). None of this is in the body itself: all 21 points belong to 9 function literals inside it that branch (lines 75, 192, 145, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-transfer-stats.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eee3e163e18b4366a22fa54d4a06568958d5aa56a5ff3af303e71d3cbb8529"}},{"ruleId":"D2","level":"warning","message":{"text":"SynologyFiles.policy (cognitive 21): SynologyFiles.policy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 8). None of this is in the body itself: all 21 points belong to 3 function literals inside it that branch (lines 208, 217, 252). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/files.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d814c2b53e10f29604554325d32f2a8e32f583e3346094d3a8e6023140b9ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"operator-admin.listPendingRequests (cognitive 21): operator-admin.listPendingRequests has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0f1a553f16e526ca576468374bec6cf75d48de0e327c9703003f5f23082ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"log-redact.redactExtraEngineOptions (cognitive 21): log-redact.redactExtraEngineOptions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (6 pts), error handling 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4ececb08e8a476bb47166fd91e181f2a19f5418f6a472c60b1f482980ad5b3"}},{"ruleId":"D2","level":"warning","message":{"text":"log-redact.limitVerboseError (cognitive 21): log-redact.limitVerboseError has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 6 (8 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fedad8af9518651d91387f85c11f6c1fafd1d609cc745042e7bde34697f10c2"}},{"ruleId":"D2","level":"warning","message":{"text":"log-redact.limitVerboseValue (cognitive 21): log-redact.limitVerboseValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, error handling 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"0300c03f85815a8374e58bedc30ed60c2d5e424964d473c3a7eef6aa258ddc1c"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_finalize_fs::platform::unix::copy::copy_directory_contents (cognitive 21): motrix_finalize_fs::platform::unix::copy::copy_directory_contents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34866bd58106c07437022f7e8c0eee680d4855f6b7efd61cbf5a07d1cb07eb0"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-extension-config.parsePublicUrl (cognitive 20): remote-extension-config.parsePublicUrl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 2, error handling 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2adf5e0936701bed08d3b6057da100280814f1ea0db3b858038ae9556d14291"}},{"ruleId":"D2","level":"warning","message":{"text":"Aria2ProcessOutput.emitLine (cognitive 20): Aria2ProcessOutput.emitLine has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (11 pts), if/else 6, boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-output.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea77f7a7fa6edebaa21caf7d82e358592489781ff4857dc74a4e2cf5c3faafee"}},{"ruleId":"D2","level":"warning","message":{"text":"completed-task-startup-guard.parseSessionRunIntent (cognitive 20): completed-task-startup-guard.parseSessionRunIntent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4395311a9c7de698c2d41329955ebbf8de2d40a005e8b879a93928e96ce1c931"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineSupervisor.recover (cognitive 20): EngineSupervisor.recover has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"7864bc74f24bb9e80b9744684b73029af3b67f259280450d8a8f2b54bbf4cc79"}},{"ruleId":"D2","level":"warning","message":{"text":"GeoIPDownloader.download (cognitive 20): GeoIPDownloader.download has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 4, ternaries 3, boolean chains 1, loops 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-downloader.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"03179e20eef3ec60fff0bb462c392b546c625fd7868c9c501151971b90c9db5b"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilityBridge.applyHookEffects (cognitive 20): CapabilityBridge.applyHookEffects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 2 (3 pts), loops 2 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf562f062fa9ff7a97a91dd13749a3a8b627ec1a72b17b8ea390479d3d72585"}},{"ruleId":"D2","level":"warning","message":{"text":"system-proxy.parseProxyEnvironment (cognitive 20): system-proxy.parseProxyEnvironment has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 3, if/else 3, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/system-proxy.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"225d16d60853c95169f9e3f65fdbfbc7f61132a9c1df380337e21960dbc68b65"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectResourceValidatorService.verify (cognitive 20): DirectResourceValidatorService.verify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cc9469b1c47b33bc76927f9fb6dd125239b0644f7d2946299f31f2b85995c3"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackerManager.init (cognitive 20): TrackerManager.init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f967084abf3c448d40760348ac9eba3cf9fd8ca461cfcff5f6aa2320c1d2ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"BridgeManager.stopCurrent (cognitive 20): BridgeManager.stopCurrent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 2 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/bridge-manager.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad76c52734b6cf787d0e6a72fb088a6034fd6bd31cb526dc02de6dc24a59c08c"}},{"ruleId":"D2","level":"warning","message":{"text":"package-manager.managerBinDirectory (cognitive 20): package-manager.managerBinDirectory has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (6 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de62390d65e778fb4454483f5c0e4baf21f342d209d9a7271dc35a78b50e7af"}},{"ruleId":"D2","level":"warning","message":{"text":"CliToolService.#verifyInstall (cognitive 20): CliToolService.#verifyInstall has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), ternaries 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd1f4f66fdca85ea21112963c3da6174d2f1fca6c0668058140bb2777b25156"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.registerCommandHandlers (cognitive 20): commands.registerCommandHandlers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (4 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). Of this number, 10 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f5647e0414411c83f5be7b3dc05f79d43ab443fdfb70ea25096508eddc1087"}},{"ruleId":"D2","level":"warning","message":{"text":"dashboard-tile-frame.DashboardTileFrame (cognitive 20): dashboard-tile-frame.DashboardTileFrame has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 8, if/else 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 216, 179, 205). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d3de2b1cf2908f05e8abe4fade7d7034b7b269705a62a16d226a1b4ca09e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"task-row.TaskRowBase (cognitive 20): task-row.TaskRowBase has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (15 pts), boolean chains 5 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-row.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23c31540b77e4817fc342eefde2614ba203ff107ef8f44dc786b96d5fca69a6"}},{"ruleId":"D2","level":"warning","message":{"text":"speed-limit-section.SpeedLimitSection (cognitive 20): speed-limit-section.SpeedLimitSection has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 5, ternaries 5, error handling 1. Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 6 function items inside it that branch (fillFromPeak, a function literal at line 140, a function literal at line 201, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/speed-limit-section.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a11320480010ded4b558522e01c30b43862f0ff0562594e75644452852fa4c"}},{"ruleId":"D2","level":"warning","message":{"text":"trusted-extensions-section.TrustedExtensionsSection (cognitive 20): trusted-extensions-section.TrustedExtensionsSection has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 6, if/else 2, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 187, handleAdd, a function literal at line 110, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"32088d7a58991b7d3904291fd36214159708f394d2dc20bc2939af84b6d2b4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli-tool-section.CliToolSection (cognitive 20): cli-tool-section.CliToolSection has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, ternaries 4, if/else 1. Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/cli-tool-section.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab4c134ae889ea686d245a986c0a8f40833f10aff45f4e04720a5dc6cca3a4c"}},{"ruleId":"D2","level":"warning","message":{"text":"use-engine-display-status.useEngineDisplayStatus (cognitive 20): use-engine-display-status.useEngineDisplayStatus has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 77, 61, 136, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-display-status.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bac76a1d40f9dab5a450903f505ac043d9a77ad4c304431f09898ef3c5df36a"}},{"ruleId":"D2","level":"warning","message":{"text":"operator-extension-pairing.runExtensionPairingTerminal (cognitive 20): operator-extension-pairing.runExtensionPairingTerminal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-extension-pairing.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3734c6304611aaa7377e2fd6a0014489900ac038e634f5de8e765b1c952b85c6"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_finalize_fs::platform::unix::reserved::reserve_exfat_target (cognitive 20): motrix_finalize_fs::platform::unix::reserved::reserve_exfat_target has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/reserved.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"275a669faba958126e98f1be8559bb147cd7a330fa28274222dc09d1d39a8c16"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-extension-admission-policy.resolveForwardedSource (cognitive 19): remote-extension-admission-policy.resolveForwardedSource has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"541d8992a06f5321d26b359e9fbb97ad0f2bfeb4c58108bd09d4ca1c43f46b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"build.parseArgs (cognitive 19): build.parseArgs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/build.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa23490f54bc1dac870eae8ed321e63f2e5afb92eaf4b27b47e426cb6a376d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"SubmitDownloadAdapter.adapt (cognitive 19): SubmitDownloadAdapter.adapt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 4 (6 pts), boolean chains 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/submit-download-adapter.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f63c6255af3b3dc91242131a8172e6e755ccc5dbe921e68352fde2ceaddee9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionPairingProjectionService.reconcileCommitted (cognitive 19): ExtensionPairingProjectionService.reconcileCommitted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 7). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 377). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3643bdb635520cd86a44c858932e656a09767f9c7d0d9aa8b87d8b4c08a5f50a"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskInspectorActivityRuntime.deliverRecoveredAnchor (cognitive 19): TaskInspectorActivityRuntime.deliverRecoveredAnchor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 790). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fca7b6450fbb0203e2979da19fd19b96b5892cc3e2cdf179bd74e8657e7a5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"source-scanner.readLegacyFile (cognitive 19): source-scanner.readLegacyFile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa066e9ce889ad2f8d4350395a8b5862adbd7a853e69d87f24a5c23c7c47d54"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyImportService.authorizeMetadataAdmission (cognitive 19): LegacyImportService.authorizeMetadataAdmission has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, error handling 1, loops 1 (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5244fe4c9336faf87166d294534c462485051293b3fae1e15b539d5ebe246b5"}},{"ruleId":"D2","level":"warning","message":{"text":"http.buildResponse (cognitive 19): http.buildResponse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (5 pts), error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab28314472583d2037dc49d51f5e9af56c5e871414b85f3c71e7ab7ce991c07a"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginSecurityService.fetchPolicy::download (cognitive 19): PluginSecurityService.fetchPolicy::download has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (7 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/security/security-service.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f85ceb100feaa9d1b8e2653084690ea6995afd2791da95fe6d3d3f015c32d6"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizeArtifactOperations.prepareFileRename (cognitive 19): NativeFinalizeArtifactOperations.prepareFileRename has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, loops 1 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf493cccd9243218bca629bfcea9723ab262484ba9569e168ad6e6cf47df1a16"}},{"ruleId":"D2","level":"warning","message":{"text":"HookOrchestrator.runBeforeFinalize (cognitive 19): HookOrchestrator.runBeforeFinalize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1 (2 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd84ef9b70a8bca00c7c3672774b07615464551d955bb3cc981efe24ad3a780"}},{"ruleId":"D2","level":"warning","message":{"text":"quick-js-worker.handleHookEnter (cognitive 19): quick-js-worker.handleHookEnter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 484, 419, 399, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be7f99a11e12721cb1ab14e3a14ae4e4f9180cd7df185d904bfafd96dfb4204"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationService.run (cognitive 19): OperationService.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 3, ternaries 2 (3 pts), loops 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 5 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f89877d739cd977f4d4d333b6c406dd69eb70a50d9d87923b85326592063098"}},{"ruleId":"D2","level":"warning","message":{"text":"delivery-materializer.materializeCandidate (cognitive 19): delivery-materializer.materializeCandidate has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, ternaries 8, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-materializer.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4b5703d561f489ecf27b8b4693cbf69d32c2588abdd037cba40c0235a8c06b"}},{"ruleId":"D2","level":"warning","message":{"text":"queries.buildContributionIndex (cognitive 19): queries.buildContributionIndex has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/queries.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcae7ef4cbc50d1c1188e5051ce2074987936554763d44c32b7e72b6f1909b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"direct-resource-validator.redirectRequestUrl (cognitive 19): direct-resource-validator.redirectRequestUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbcb4679b8525db612d5c9f3ea89e384d73cef2001d0b4ee2dff64d3ad73042"}},{"ruleId":"D2","level":"warning","message":{"text":"MotrixDatabase.commitTerminalHookBoundary (cognitive 19): MotrixDatabase.commitTerminalHookBoundary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, ternaries 1 (nesting depth added 5). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 823). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"09271a15936ed6a6b2673ccdbd5db45e6b6a9a17a4ad59d7801a1d4929882387"}},{"ruleId":"D2","level":"warning","message":{"text":"re-add-task.reAddBt (cognitive 19): re-add-task.reAddBt has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (15 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd1cfd20f35a6707c66aeb276439d51772faa74f8d04ddeca37be65ec37d36c"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletedEngineTaskCleanup.observe (cognitive 19): CompletedEngineTaskCleanup.observe has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 6, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completed-engine-task-cleanup.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff68640f69b7278c7f970832ddb9c318b6f470ff9c994078e2b3d371c344723f"}},{"ruleId":"D2","level":"warning","message":{"text":"get-task-files.createGetTaskFilesHandler.getTaskFiles (cognitive 19): get-task-files.createGetTaskFilesHandler.getTaskFiles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, loops 3 (5 pts), boolean chains 4, ternaries 2, error handling 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/get-task-files.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142cef228719eba523268b3252ba9cdb1f0d2e0fdf6059c0cc2845f0d53380e"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackerProber.probeUdp (cognitive 19): TrackerProber.probeUdp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, error handling 3, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 130, 150, 125, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-prober.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24b41bd9813514eca029ecbe3fefeab0b472c15dcd224ab29285ecaa21de80a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeMessagingInstaller.syncManifests (cognitive 19): NativeMessagingInstaller.syncManifests has cognitive complexity 19 (threshold 15). Drivers by points: error handling 2 (6 pts), loops 3 (6 pts), if/else 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/native-messaging-installer.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f4d3b3fb43fd1040ff3fa54401f34b40536747b0297aea1a779fc18a0f0da4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.syncNativeMessagingManifests (cognitive 19): index.syncNativeMessagingManifests has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 3 (5 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"315e66937ccbb0f3ad02cbbdec8ec63fad64644e121f6f87d4f1b5cad3815fa2"}},{"ruleId":"D2","level":"warning","message":{"text":"launcher.setupLauncher (cognitive 19): launcher.setupLauncher has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 5). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 130). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/launcher.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b886a6d7b8991bdf6d4a681dee7af50134f1aaf36d1494158f8bcb670d686588"}},{"ruleId":"D2","level":"warning","message":{"text":"completion-shutdown.setupCompletionShutdown (cognitive 19): completion-shutdown.setupCompletionShutdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6 (nesting depth added 3). None of this is in the body itself: all 19 points belong to 7 function literals inside it that branch (lines 58, 76, 48, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/completion-shutdown.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e35acca4c223a391c5143a48f79523576ee7393a53458959744f2bbd6aa6131"}},{"ruleId":"D2","level":"warning","message":{"text":"download-progress.getDownloadProgressValue (cognitive 19): download-progress.getDownloadProgressValue has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/download-progress.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e042990285bf625df01c388578a10a00cf399360dac8c0be3780e1e088e7615d"}},{"ruleId":"D2","level":"warning","message":{"text":"speed-sparkline.SpeedSparkline (cognitive 19): speed-sparkline.SpeedSparkline has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9, boolean chains 7, if/else 3. Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 50, 118, 62, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/speed-sparkline.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d841bd0195bec57b390a6eb59036089511aec1a8eb313afacf608578f06068"}},{"ruleId":"D2","level":"warning","message":{"text":"engine-badge.EngineBadge (cognitive 19): engine-badge.EngineBadge has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (16 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/engine-badge.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"604c0726f55580ee76a8c2371f61e14a9b6c6ec01c65313f1158577b31d5d873"}},{"ruleId":"D2","level":"warning","message":{"text":"notifications-page.NotificationRow (cognitive 19): notifications-page.NotificationRow has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c11508361c829dc993a6f8cf01d4388831dc74f9f10f6536154558f11d570e"}},{"ruleId":"D2","level":"warning","message":{"text":"use-plugin-install.usePluginInstall.startInstall (cognitive 19): use-plugin-install.usePluginInstall.startInstall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"344a87970b9d33785b5e6c80d27967da820d622fa1c643ded7e09c86491c22cf"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-call-graph-edge.PluginCallGraphEdge (cognitive 19): plugin-call-graph-edge.PluginCallGraphEdge has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 8, if/else 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-edge.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fcfb52958bd2f76db646c966ce1b4038f40ef92f3d0e5f412286eb31f7c25b"}},{"ruleId":"D2","level":"warning","message":{"text":"drop-zone.DropZone (cognitive 19): drop-zone.DropZone has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, error handling 2 (3 pts), loops 2, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (selectNasTorrent, a function literal at line 36, a function literal at line 101, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/drop-zone.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff3a557ed39a4e437c33f0146ae422e0011ec4b20b082ef6163107344b35dd0"}},{"ruleId":"D2","level":"warning","message":{"text":"file-list.FileList (cognitive 19): file-list.FileList has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 6, ternaries 2. Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 130, toggleSelectAll, toggleFile, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/file-list/file-list.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2b74fc28d5a8019ecc325dce14ed9bcda9ea6091b0bdaab2dbf486ea0bb968"}},{"ruleId":"D2","level":"warning","message":{"text":"operator-auth.refreshOperatorSession (cognitive 19): operator-auth.refreshOperatorSession has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2239bfd529cd435021b954cc7f87071ee792e024326ae625f2b6166242fed2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_native_host::flatpak_companion::installation::uninstall_companion (cognitive 19): motrix_native_host::flatpak_companion::installation::uninstall_companion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/installation.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ed508d2e92ee25dfc6f8c2c7c5ea44769f38b1a9cba31f933d043040910560"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-extension-config.parseRemoteExtensionConfig (cognitive 18): remote-extension-config.parseRemoteExtensionConfig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, ternaries 4, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"09754f97eec4cd36051464a88dd777908b74d7ae76242ae0d8dba36c033772ea"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-extension-route-policy.evaluateRemoteExtensionRoute (cognitive 18): remote-extension-route-policy.evaluateRemoteExtensionRoute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-route-policy.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3541f6c4f15149e2b27033203179e82d2c21f273fc4bad95640faf2c9b6c2c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"compaction.compactTaskTransferSamples (cognitive 18): compaction.compactTaskTransferSamples has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/compaction.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"536747a0af689b084d7fc75fd44209862e9b75bfe521c1e43db790325720dc5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskInspectorActivityService.closeAtExactTerminalTransition (cognitive 18): TaskInspectorActivityService.closeAtExactTerminalTransition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed64a9dffc2bb646a1e10bf8c84bb9d7919748ae8f87228476c11f1832a1070"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge-data-dir-lock.acquireBridgeDataDirLock (cognitive 18): bridge-data-dir-lock.acquireBridgeDataDirLock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 4 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f3f73dbd2bdc78476d2a7c5369dd51da18af40c43ed8a37db777348c734ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge-data-dir-lock.resumeInterruptedRecovery (cognitive 18): bridge-data-dir-lock.resumeInterruptedRecovery has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"5216923845c250eb0c003c5497d6760ee3b648302822428c60c744e637bb5292"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRpcProtocol.handleMessage (cognitive 18): JsonRpcProtocol.handleMessage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (3 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/json-rpc-protocol.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4e239a5b1ae38ddeed97d36bffbffa3ba4ec813f0783b788665aa6d8c33b98"}},{"ruleId":"D2","level":"warning","message":{"text":"completed-task-startup-guard.readRunIntent (cognitive 18): completed-task-startup-guard.readRunIntent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (3 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"298e78e974f69e6bb7054dd4410b0056599b61cc6c0433004a7d1a835bee7345"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyImportService.commitAdmission (cognitive 18): LegacyImportService.commitAdmission has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2, error handling 1, loops 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd80b30cbe419608a8041f77ba2977a79c8c0674f1d323b9c8de671244b67ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"hls-parser.parseHlsMaster (cognitive 18): hls-parser.parseHlsMaster has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3, boolean chains 2, loops 2 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/hls-parser.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baebc8be3d9ef89de5e1df73e8b6c0f46266a7a08f56f1395074bf7895551cb"}},{"ruleId":"D2","level":"warning","message":{"text":"command-graph.snapshotCandidates (cognitive 18): command-graph.snapshotCandidates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (2 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/command-graph.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"992249428eedbb00a56848bcdf0ce1ffd9d96c44a283e4b348716b2d125a65c3"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizeArtifactOperations.removeIsolated (cognitive 18): NativeFinalizeArtifactOperations.removeIsolated has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad37180d8d1d004295ceb5c3da7c05516e51820ddcde2068acaae85d61d319f"}},{"ruleId":"D2","level":"warning","message":{"text":"PostDeliveryScheduler.execute (cognitive 18): PostDeliveryScheduler.execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (7 pts), error handling 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fa5fbad8742b2524cb1ec1b9252b05661a6d07ea5a6a4dbda50b985079130f"}},{"ruleId":"D2","level":"warning","message":{"text":"update-scan.scanForUpdates (cognitive 18): update-scan.scanForUpdates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/update-scan.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e68f2820a4d0fd18463f2e64e8e86653536d60a7e7a4790ee4d635c1621f5e5"}},{"ruleId":"D2","level":"warning","message":{"text":"merge-engine-task.mergeEngineTask (cognitive 18): merge-engine-task.mergeEngineTask has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, ternaries 5 (6 pts), if/else 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/merge-engine-task.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b6d5f678fdc1994eab890d7aeb1ac703a621d7fbead89c85f964140e999f62"}},{"ruleId":"D2","level":"warning","message":{"text":"re-add-task.reAddTask (cognitive 18): re-add-task.reAddTask has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25dcd1670518d1270e53afbacd0566c85d8f0ba45d247fbb71902b3b9573e36"}},{"ruleId":"D2","level":"warning","message":{"text":"shell-environment.resolveExecutable (cognitive 18): shell-environment.resolveExecutable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/shell-environment.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"02935729d38629e696d956cf4b22379cec06d50d4e09f5714b10973548aa943b"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowManager.recreate (cognitive 18): WindowManager.recreate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (nesting depth added 4). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 259). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"047bfb6def3e15a02e37c203f2219e9d96daf2dd7e620891f47a4c45d932cc7f"}},{"ruleId":"D2","level":"warning","message":{"text":"MenuManager.walkAndUpdate (cognitive 18): MenuManager.walkAndUpdate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/menu-manager.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae761142e430ceca13a834b1adab49a38ff1d08b79ff79cc0063387dce1b5553"}},{"ruleId":"D2","level":"warning","message":{"text":"files-tab.FilesTab (cognitive 18): files-tab.FilesTab has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 8 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/files-tab.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6debcfffcaa4ed2fca0b21b0fc1123ebefa60fb391df5c132527194288ec71d6"}},{"ruleId":"D2","level":"warning","message":{"text":"task-column-header.TaskColumnHeader (cognitive 18): task-column-header.TaskColumnHeader has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 6, boolean chains 4 (nesting depth added 1). None of this is in the body itself: all 18 points belong to 4 function literals inside it that branch (lines 82, 150, 112, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-column-header.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db727f6b3a07425368c58b65a21508cb0d8ef827c2c24066ddf625a1dfa3b24"}},{"ruleId":"D2","level":"warning","message":{"text":"system-protocols-section.SystemProtocolsSection::handleOpenSystemSettings (cognitive 18): system-protocols-section.SystemProtocolsSection::handleOpenSystemSettings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (7 pts), boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (system-protocols-section.SystemProtocolsSection) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/system-protocols-section.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa014e2afa98b3d066e11d6938efd95eba35f7225186925aad6223353adc86"}},{"ruleId":"D2","level":"warning","message":{"text":"operation-form.OperationForm (cognitive 18): operation-form.OperationForm has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, ternaries 4 (7 pts), if/else 3 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dbc789b273f8d5eaa38e20525fb86baa650e61adebaf9deea4e7c8ef8f287d"}},{"ruleId":"D2","level":"warning","message":{"text":"use-notification-toasts.useNotificationToasts (cognitive 18): use-notification-toasts.useNotificationToasts has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 6, boolean chains 4, error handling 1 (nesting depth added 2). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 169, 130, 162). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-notification-toasts.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e7d79623d729a4bdad3ccb73cfb1721c56b154e87bc9162400e46e2a8aa189"}},{"ruleId":"D2","level":"warning","message":{"text":"file-routes.nasFileRange (cognitive 18): file-routes.nasFileRange has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 3 (4 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"344fd2a07a49ee3e8b7652369b19a3636f484b3d597e60144fb4618106fb5db6"}},{"ruleId":"D2","level":"warning","message":{"text":"routes.registerFnosRoutes (cognitive 18): routes.registerFnosRoutes has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 6, error handling 3, ternaries 2. None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 34, 60, 25). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/fnos/routes.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4069d01828efdd188884309b502cb26f67db44925d335b0664c8895e61c83f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"NasSettingsStore.snapshot (cognitive 18): NasSettingsStore.snapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 2 (3 pts), ternaries 2 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/settings-store.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7477efa247870cdd2aae740f20f70da324eb57206e824277460191abd885bb84"}},{"ruleId":"D2","level":"warning","message":{"text":"operator-admin.runOperatorAdmin (cognitive 18): operator-admin.runOperatorAdmin has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 6 (7 pts), boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa54ded34b217d672d6a6893eb24742dd404c930424869d22461d2926c27dc5b"}},{"ruleId":"D2","level":"warning","message":{"text":"task-inspector-activity.findTaskSpeedUpdate (cognitive 18): task-inspector-activity.findTaskSpeedUpdate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-inspector-activity.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4992f38364b3b15f3dee2393506e8468151e3b94b1e26e572575a0ea2cc04"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_finalize_fs::platform::unix::remove::isolate_opened_for_removal (cognitive 18): motrix_finalize_fs::platform::unix::remove::isolate_opened_for_removal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/remove.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4498d4f76cae7b647a9e5a91bdd1a7ba5f66e6d6b1b0ca30097606470795db4"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_finalize_fs::platform::unix::remove::remove_with_survivor (cognitive 18): motrix_finalize_fs::platform::unix::remove::remove_with_survivor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/remove.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"626cbcbff19edc96f2f8833ece46e6a176a7e18a1e121519eb4e7cf036085569"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_native_host::flatpak_companion::installation::install_companion (cognitive 18): motrix_native_host::flatpak_companion::installation::install_companion has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (6 pts), loops 3 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/installation.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ea20506560da52ff97530844242fd65be30588a75946081641423d8be0988f"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteExtensionSurfacePolicy.evaluate (cognitive 17): RemoteExtensionSurfacePolicy.evaluate has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-surface-policy.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a01be4dc6d81224372b0bf097083f5d68898ae8ce6754d34e7b8e88f0e46d59"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskInspectorActivityService.selectOrdinaryCandidate (cognitive 17): TaskInspectorActivityService.selectOrdinaryCandidate has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (6 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ce24a3c10594a07e2568fc0d70a11c132e67ca501c64ee9acedcdd9695a2c6"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskInspectorActivityStore.applyCheckpoint (cognitive 17): TaskInspectorActivityStore.applyCheckpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa3fe9f37b810dd9dae672891196fe08a935adf6f2b58ce68f30eb4d4127ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"PairSession.onPairHello (cognitive 17): PairSession.onPairHello has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, error handling 3, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1298c6ff33be90e2b876d0c4c2288aa164aeb6d81285148fda38a27355d342"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyHttpActivationService.sourceContext (cognitive 17): LegacyHttpActivationService.sourceContext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fefa2abfeeab6d9c2be3b22a429bbb85aefdf485987862dfa9d6f563fede1a0"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyHttpActivationService.noConflicts (cognitive 17): LegacyHttpActivationService.noConflicts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"52078833f89ab23d5424277125d022519cfb129de326b9fed3202777075832ff"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandInvokeAudit.cleanupRotations (cognitive 17): CommandInvokeAudit.cleanupRotations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/invoke-audit.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2771bcd33462e03633819fe66df6451be52af19cfe80029cc00c4676a87192b9"}},{"ruleId":"D2","level":"warning","message":{"text":"CapabilityBridge.handleStaged (cognitive 17): CapabilityBridge.handleStaged has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee17c0e8f40d5e4592d48420662b462a12a8a1be3ac7d19b16386e5e2015e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-committer.assertRenameFileJournal (cognitive 17): finalize-committer.assertRenameFileJournal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bb3a276c19efcfb3263a1bdb5d6778fbca5976e35e189c5095cbc389557fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationService.catalog (cognitive 17): OperationService.catalog has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (11 pts), boolean chains 4, if/else 2 (nesting depth added 6). None of this is in the body itself: all 17 points belong to 4 function literals inside it that branch (lines 119, 115, 121, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93e43b9a29231c6da3f0099bc5f95b534491e4457e14c60dd47aa17e2e6a585"}},{"ruleId":"D2","level":"warning","message":{"text":"aria2-proxy-routing.decideAria2ProxyRoute (cognitive 17): aria2-proxy-routing.decideAria2ProxyRoute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1c136a3347e34eaabde36367adce2f99c13b0abae2bdb44ff9916b4720706"}},{"ruleId":"D2","level":"warning","message":{"text":"clear-stopped-tasks.clearStoppedTasks (cognitive 17): clear-stopped-tasks.clearStoppedTasks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (2 pts), loops 1 (2 pts), ternaries 2, boolean chains 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/clear-stopped-tasks.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5f5e13b13876f7ef0733a87d289318d2b4a4a246d2ee67043a765442666f03"}},{"ruleId":"D2","level":"warning","message":{"text":"task-recovery-service.determineAction (cognitive 17): task-recovery-service.determineAction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5d4d57042727c05b01f82a1f68846d02dbc0cff2c02a9976b3bd035cb59442"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker-selector.collectSourceUrls (cognitive 17): tracker-selector.collectSourceUrls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-selector.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54936c93d7a31919c25498d7ef609c23c39d08adf5ebe8393aecfab743bc328"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker-selector.selectTrackers (cognitive 17): tracker-selector.selectTrackers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3, ternaries 3, boolean chains 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-selector.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19b34db2c481a862fdf1da54e48eb55443e64b32f04a133806111d2d62e9034"}},{"ruleId":"D2","level":"warning","message":{"text":"AppImageNativeHost.disable (cognitive 17): AppImageNativeHost.disable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00867d8828dc626bd5095da8fbf362a26d9499e270b95e83fab0afae3e0726d"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowManager.createBrowserWindow (cognitive 17): WindowManager.createBrowserWindow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7 (nesting depth added 2). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 574, a function literal at line 555, preventUntrustedNavigation). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"734333d320c0c54a6c98538540f9bf11f8637f3bbf97a3e559331ca76849d19e"}},{"ruleId":"D2","level":"warning","message":{"text":"appimage-integration.removeDesktopIdFromMimeApps (cognitive 17): appimage-integration.removeDesktopIdFromMimeApps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"628d0bf4be06ed22f72922e8035544a18bafe84aae6cbc9c5995a025772788aa"}},{"ruleId":"D2","level":"warning","message":{"text":"os-bridge.createOsNotificationBridge.handleClick (cognitive 17): os-bridge.createOsNotificationBridge.handleClick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"193efeff9942f9f8a555e57a9ad97531fcf6857f533e484103adb33f8f68ed97"}},{"ruleId":"D2","level":"warning","message":{"text":"tray.setupTray.createTray (cognitive 17): tray.setupTray.createTray has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 151, 130, 142, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a876a0159f6095087589fbd23d6558e4e134b6a5b71958bd5da826ade519d5"}},{"ruleId":"D2","level":"warning","message":{"text":"engine-tile.EngineTile (cognitive 17): engine-tile.EngineTile has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 4, if/else 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/engine-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39addf7c728486a0ce9caea747f06578a0d33529b19f1a8ab96cee68953cac3"}},{"ruleId":"D2","level":"warning","message":{"text":"tasks-tile.TasksTile (cognitive 17): tasks-tile.TasksTile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c653f6194d00092ea47c0e04156dec39a1056f2b42b0ace5dd2883ac90c5625d"}},{"ruleId":"D2","level":"warning","message":{"text":"task-inspector-action-bar.TaskInspectorActionBar (cognitive 17): task-inspector-action-bar.TaskInspectorActionBar has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, ternaries 2, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0418838154e10f1fd8ef44eecb0df3965feb1f3a7d2aedf5504b822dd3f29a0"}},{"ruleId":"D2","level":"warning","message":{"text":"registry-install-action.RegistryInstallSession (cognitive 17): registry-install-action.RegistryInstallSession has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 3 (nesting depth added 6). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 37). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/registry-install-action.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c367f3ebaf90fb56d77fefdb595c96972a5bb61bd2e0d4c33f2af270a4350bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"app-update-section.UpdateActionButton (cognitive 17): app-update-section.UpdateActionButton has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 5, if/else 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/app-update-section.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7951317217cc31686067e820a75300d42f38a61b554af6605bda38e92c023b"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.startCubicGlassRenderer.draw (cognitive 17): renderer.startCubicGlassRenderer.draw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/renderer.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dec63f97698c4ceb02560c8d017f48832e77aba60e654520b8f8c2512b4d904"}},{"ruleId":"D2","level":"warning","message":{"text":"directory-picker.DirectoryPicker::handlePick (cognitive 17): directory-picker.DirectoryPicker::handlePick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 3 (6 pts), boolean chains 4, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (directory-picker.DirectoryPicker) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"865d527288ce6efbe0e893147343d3cd5596445ee04b28f028fc28d22d98dc9b"}},{"ruleId":"D2","level":"warning","message":{"text":"use-task-files.useTaskFiles (cognitive 17): use-task-files.useTaskFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, error handling 1, ternaries 1. None of this is in the body itself: all 17 points belong to 8 function literals inside it that branch (lines 48, 77, 95, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-files.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4298dc37d64e052e7d37f15964dc8925cc6d9ebcb97f12197fa708009db903fd"}},{"ruleId":"D2","level":"warning","message":{"text":"match.matchesAccelerator (cognitive 17): match.matchesAccelerator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shortcuts/match.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaf20d2c58dd4bcd072d54af8b36621681ac1556a807ce46d87909d36c7b753"}},{"ruleId":"D2","level":"warning","message":{"text":"motrix_native_host::resolve::poll_launched_endpoint (cognitive 17): motrix_native_host::resolve::poll_launched_endpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/resolve.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ac3edb39c42d160a27641cf0705fd5f18e44ab5ed4b3c4f2cd4b51edc1db7b"}},{"ruleId":"D2","level":"warning","message":{"text":"readLicenseDirectory (cognitive 17): readLicenseDirectory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (4 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 4). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (walk, a function literal at line 212, a function literal at line 204, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/package-flatpak-companion.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"12059b8a23c03c926b8dece42efb91b5c6328a4529f4dad1bd1b6a254b6e43b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Aria2ConfigBuilder.buildArgs (cognitive 16): Aria2ConfigBuilder.buildArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, ternaries 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-config-builder.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113c6df76ebfa931d9feb00305946ebb020117ee99e3d0d7d7710cafffc2a22"}},{"ruleId":"D2","level":"warning","message":{"text":"session-parser.parseLegacySession (cognitive 16): session-parser.parseLegacySession has cognitive complexity 16 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 8, loops 4, ternaries 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (session-parser.parseLegacySession::flush) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb1b86bc38ea876e6a71e23375ffaa8fe9068acfa54606fbe5b279c09f7a13"}},{"ruleId":"D2","level":"warning","message":{"text":"dash-parser.expandTimeline (cognitive 16): dash-parser.expandTimeline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/dash-parser.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8144cdf87703371209a0c110ea8d1738335f8aa9e21865a830f92e7dd79c8d80"}},{"ruleId":"D2","level":"warning","message":{"text":"FinalizeRecovery.restore (cognitive 16): FinalizeRecovery.restore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd75a1ff239a0e41ffdbb298bc188fd49231142e927cf2b55abdc1f58fe9f0b0"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizeArtifactOperations.removeKnown (cognitive 16): NativeFinalizeArtifactOperations.removeKnown has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7671778cd9f5f72bb8e44681f99466804c25a2bff1c8de854b0c1648d1a429"}},{"ruleId":"D2","level":"warning","message":{"text":"quick-js-worker.jsValueToVmHandle (cognitive 16): quick-js-worker.jsValueToVmHandle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a35b3430f2147fa929889903c017a0f73f87e110a9214341100b04a95c23b93"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectRecoveryPlanner.plan (cognitive 16): DirectRecoveryPlanner.plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 1, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/direct-recovery-planner.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa801836409cd2149ef3a57f8fb60e50238830838865b9927b2c99f3eba48b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"MagnetTracker.getFileSelection (cognitive 16): MagnetTracker.getFileSelection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2abe79c5d31a338eeb352f8c8de50fd8d10c236cd849cca21ee056e699e328"}},{"ruleId":"D2","level":"warning","message":{"text":"windows-desktop-startup-recovery.recoverDefaultWindowsDesktopBridgeResidue (cognitive 16): windows-desktop-startup-recovery.recoverDefaultWindowsDesktopBridgeResidue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/windows-desktop-startup-recovery.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced5eede7e4a4941f8c525cbd10792c1871b3d2ee44575c444c122eafe465ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"appimage-integration.runStartupIntegration (cognitive 16): appimage-integration.runStartupIntegration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (16 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc710cfd71c813db96a89bc9a1b6ee852aae721a999a4c7523297a1c1b96f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"MenuManager.normalizeElectronSeparators (cognitive 16): MenuManager.normalizeElectronSeparators has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/menu-manager.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b596e7bffb2f665341caf1dcae1a159f2d00cc01e2a554a360e1e030617605"}},{"ruleId":"D2","level":"warning","message":{"text":"tray.setupTray.onSettingsChanged (cognitive 16): tray.setupTray.onSettingsChanged has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9bc81109c92b9526708466ac492c4a510feb4764ef19087fd66b78e6a5e5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"activity-calendar-model.activityMonthLabels (cognitive 16): activity-calendar-model.activityMonthLabels has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc24a078c8f82e9c77caaa55e5ba82d614b6988c74a6daa4833e9bd4b23bb151"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-extensions-section.BrowserExtensionsSection (cognitive 16): browser-extensions-section.BrowserExtensionsSection has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 7 (nesting depth added 4). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 136, 65, 176). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fcce6be2fbeb4f0245be7eaca34ffb77c621e30821cc901be9794092e621cc"}},{"ruleId":"D2","level":"warning","message":{"text":"add-task-dialog-host.AddTaskDialogHost (cognitive 16): add-task-dialog-host.AddTaskDialogHost has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 1. Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 52, 75, 91, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task-dialog/add-task-dialog-host.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5895357048dbac8df44843f879673bbdb7ef38ae0a9b70837f3f4e6d17d2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"blur-highlight.splitHighlightedText (cognitive 16): blur-highlight.splitHighlightedText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (5 pts), ternaries 3 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/blur-highlight.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc13dbfcc85bd9264dcd7ac9faa8dacf196a3b9fe2a9862e12c15122b6bb0b25"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebar.SidebarProvider (cognitive 16): sidebar.SidebarProvider has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, ternaries 4. Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 103, 73, 82, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/sidebar.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce28104dee3de75f78bcc5b6829fb788f39ea48b6e3db55f95064bb9b8a8e478"}},{"ruleId":"D2","level":"warning","message":{"text":"use-operation-state.useOperationState (cognitive 16): use-operation-state.useOperationState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 3, error handling 1 (2 pts) (nesting depth added 4). None of this is in the body itself: all 16 points belong to 4 function literals inside it that branch (lines 28, 24, 61, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/use-operation-state.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7f2d13c8c18e8ab7f90b4b867ba558dacf6857d3bf9031dcac514394ff6e66"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryPickerController.commitListing (cognitive 16): DirectoryPickerController.commitListing has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 6, ternaries 4. Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37a7a56ae637329ee8f9356f0b72547eb007a8c9c49b72a0b12441e794c8ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"use-transport-mirror.useTransportMirror (cognitive 16): use-transport-mirror.useTransportMirror has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 2, loops 2, error handling 1, ternaries 1 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 6 function literals inside it that branch (lines 140, 113, 207, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-transport-mirror.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b29d875e49b693a5c714ad248f78eea5248a47dd26e87ba847175f442f837a"}},{"ruleId":"D2","level":"warning","message":{"text":"use-task-inspector-activity.useTaskInspectorActivity (cognitive 16): use-task-inspector-activity.useTaskInspectorActivity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, ternaries 2. Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 147, 134, 93, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-inspector-activity.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d68618e5c357c70ebb2baf94d729c5d816b0730e5684393441fb1734c312ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpWsTransport.ensureSocket (cognitive 16): HttpWsTransport.ensureSocket has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 238, 257). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"11569d2d8e60f626843cedb65672b901cda0994f48a85839d891c8c89d0e7fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"runtimeEnvironment (cognitive 16): runtimeEnvironment has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (4 pts), other 3, loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"04532f1f0f22c7347429f16e14b51038d390293db7dc08041663918f9c662472"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.main: FunctionTooLong \u2014 main runs 1642 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1542 over it, 16.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eacd1c7e7fc94ca04b54c48501be17d518edcc0258ec1f276e749d18163945"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.buildCommandHandlers: FunctionTooLong \u2014 buildCommandHandlers runs 1188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1088 over it, 11.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e765f4574e4e6e19bbf859808e6bec9730f1bac9c0bd2f7edd08fe79f7099378"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.initializeMainProcess: FunctionTooLong \u2014 initializeMainProcess runs 1187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1087 over it, 11.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa151dc38064f87501d4eb658f4e48264c149810b79337dd02e764f459441cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: web-directory-picker-dialog.PickerSession: FunctionTooLong \u2014 PickerSession runs 930 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 830 over it, 9.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f2f824f0d64b80fff3bf3ec92246ec64d45d60f1f80f8107527b65180390ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: legacy-import-dialog.LegacyImportDialogContent: FunctionTooLong \u2014 LegacyImportDialogContent runs 769 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 669 over it, 7.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d51e795414a1ced8eb232bc3e9dc9cab02d3fbc866d6d1bf1e703055473a97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: activity-calendar.ActivityCalendar: FunctionTooLong \u2014 ActivityCalendar runs 769 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 669 over it, 7.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4111e65c633656b263a50125be1a5d23911e025bc53274f2c5ee3b602a8d5d68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.buildServerCommandHandlers: FunctionTooLong \u2014 buildServerCommandHandlers runs 751 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 651 over it, 7.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3d201ba6fb0de600ff65835a7847b1de38e2e5ea6ee0b058385fc0b3511edf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bit-torrent-dialog.BitTorrentDialog: FunctionTooLong \u2014 BitTorrentDialog runs 687 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 587 over it, 6.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ce13c309e167cae6beebd521ea18cd92760995b45c46aa2bb488a8df08293"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dashboard-grid.DashboardGrid: FunctionTooLong \u2014 DashboardGrid runs 636 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 536 over it, 6.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a328b55443b3ed592840a7630a837a2650ebec6e00c5b418ca84a0fafa86f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lifetime-transfer-card.LifetimeTransferCard: FunctionTooLong \u2014 LifetimeTransferCard runs 583 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 483 over it, 5.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7669e3a95218f95039529f67c67fbcffdba71932d34ac3c73711e0f5d20c91f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: add-task-form.AddTaskForm: FunctionTooLong \u2014 AddTaskForm runs 581 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 481 over it, 5.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc5d86f803b0feddac4a5a074aba3d73d4358e6edeb4fba1cf8dd72ae5e8803"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: media-tools-section.MediaToolsSection: FunctionTooLong \u2014 MediaToolsSection runs 540 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 440 over it, 5.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52b92bbe182999a0f4fc7cf63012640402f84ab6323e2e054cb657d0c5aec40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: engine-diagnostics-dialog.EngineDiagnosticsDialogHost: FunctionTooLong \u2014 EngineDiagnosticsDialogHost runs 510 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 410 over it, 5.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1293b6c2b44b49f8f26213c65fa3e51c802891c0b03f9c3de1b9bd26dc4b6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: swap-magnet-metadata-for-bt.swapMagnetMetadataForBtUnderMutation: FunctionTooLong \u2014 swapMagnetMetadataForBtUnderMutation runs 500 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 400 over it, 5.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0eb85ccc3ccdfef4cb70e7dce31407f9c897eb6172c7b535975821bf13917e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operation-form.OperationFormContent: FunctionTooLong \u2014 OperationFormContent runs 476 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 376 over it, 4.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6878be8e09c6fa243a16de3269c10b8119b7b737360ce8543ab9f0dab6313a17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: main/index.ts: FileTooLong \u2014 2343 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1843 over it, 4.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfa75cd6db0b2c11b21c629899d61f722bbb19d01f74b9f2181e019fe69317e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: appearance-dialog.AppearanceDialog: FunctionTooLong \u2014 AppearanceDialog runs 453 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 353 over it, 4.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0106e1d2a0f6b0414d428cdbb630112d2ee8e37d213a18b11cdbc8a3964350d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.bootstrapBridge: FunctionTooLong \u2014 bootstrapBridge runs 432 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 332 over it, 4.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e0b07efe05beb7a4855f6e2d0e8ae0b1675f6b39add6467be8933225067061"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MediaTaskCoordinator.run: MethodTooLong \u2014 run runs 428 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 328 over it, 4.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9ea2a6aae9977d83d3c250cce6112de163ca6d33fa1416af24f6f879d9ee23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: network-dialog.NetworkDialog: FunctionTooLong \u2014 NetworkDialog runs 424 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 324 over it, 4.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"466e1766bdaf778e50503a710b1a4e8e8756f9de9f1bb23ddc734967acb8371f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: task-actions-menu.TaskActionsMenu: FunctionTooLong \u2014 TaskActionsMenu runs 422 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 322 over it, 4.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a14c80b1799c9e36e6f22b22de4c35c774471c169cc970e729d9e5b7100af6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: advanced-dialog.AdvancedDialog: FunctionTooLong \u2014 AdvancedDialog runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d54bf593fd56534ca2669117a814abce301072454c17b5dfc2e513146a7d7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-call-graph.PluginCallGraph: FunctionTooLong \u2014 PluginCallGraph runs 392 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 292 over it, 3.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ee1ea3d6cfdb9355c530c7f683b9183ff79d54c8e387734a6f4c767b9c9321"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: speed-limit-section.SpeedLimitSection: FunctionTooLong \u2014 SpeedLimitSection runs 390 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 290 over it, 3.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/speed-limit-section.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbf4f024f66f737b3e498e03c6865d5215d293664c0deb0d558fb6ae6afcb6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nas-dialog.NasDialogForm: FunctionTooLong \u2014 NasDialogForm runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8334a89d5d73ff893b31044b37d53a7e1b2054b1efeb7ab86444ee78268591c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proxy-section.ProxySection: FunctionTooLong \u2014 ProxySection runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/proxy-section.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b1ce0d80989554312a871995f7012f830e91e83147485614e0d06db106f3e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: create-torrent-form.CreateTorrentForm: FunctionTooLong \u2014 CreateTorrentForm runs 376 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 276 over it, 3.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/create-torrent/create-torrent-form.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fb47cad245e5cecaafea2ea4e071361e7a8f0d3ed7ae577f537e44a7df99fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/index.ts: FileTooLong \u2014 1872 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: main (227-2424). The bar is 500 significant lines; this is 1372 over it, 3.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acad8986eab299b3b3884b709b7b025f5d2078633c77932ebe93dbcfbed8ab5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.dispatch: MethodTooLong \u2014 dispatch runs 354 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 254 over it, 3.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6c08f7571a3851ad7b33c7797678989a5fed84669a6375e809d54f27eccd6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: general-dialog.GeneralDialog: FunctionTooLong \u2014 GeneralDialog runs 354 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 254 over it, 3.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e15cb845d261426952355aa7f18ccdab916d5c764344dfc98f01746458af4bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-detail-page.PluginDetailPage: FunctionTooLong \u2014 PluginDetailPage runs 350 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 250 over it, 3.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcba5168804226b05fe9d8106e2de88480e52dbbc52159b3ef801039e3a1944"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: web-menu-button.WebMenuButton: FunctionTooLong \u2014 WebMenuButton runs 341 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 241 over it, 3.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/web-menu-button.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf02e2f6eb167baa5ac0d09ed3a1f0b9b2f6f232794f494b297619ff64f27a3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: quick-js-worker.injectPluginApi: FunctionTooLong \u2014 injectPluginApi runs 337 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 237 over it, 3.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba83430523a8d510eccce89d52ee58c4e2f3d2fd505e61516ec00830c1717634"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-task-actions.useTaskActions: FunctionTooLong \u2014 useTaskActions runs 335 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 235 over it, 3.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c014766f457af3599c3d821a09c3496010827e7f71a4c5bd0a0dcc96ed6c82a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/web-socket-bridge-server.ts: FileTooLong \u2014 1668 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: WebSocketBridgeServer (557-2593). The bar is 500 significant lines; this is 1168 over it, 3.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49cc01411eec011d0511402ad3850193f146ad21d279e12a8f9934fed8566c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionManager: ClassTooLong \u2014 1313 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 913 over it, 3.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cbde8f8b99d46392daa1919f17f5b7346be673d715c253dffb44b55fc36e1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: trackers-tab.TrackersTab: FunctionTooLong \u2014 TrackersTab runs 328 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e81364a9df5921f4aeeffcf6d815580b61214333323893cd0a18dac52577ec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MagnetTracker: ClassTooLong \u2014 1290 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 400 significant lines; this is 890 over it, 3.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a041bfa6cd1ac0829fb97a0ba927f6adb02aa6d7cf282ec1768dc81362b3d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ipc/commands.ts: FileTooLong \u2014 1569 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: buildCommandHandlers (314-2024). The bar is 500 significant lines; this is 1069 over it, 3.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc47903e6dc4271d474c7c608b8d306bc40c889223038752d51bd411eea4348"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-diagnostics-page.PluginDiagnosticsPage: FunctionTooLong \u2014 PluginDiagnosticsPage runs 313 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 213 over it, 3.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41e62840e68e1b9375a5c0b7656bd80f4db718ceee120a2f45564df8e1787dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/session-manager.ts: FileTooLong \u2014 1542 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: SessionManager (245-2232). The bar is 500 significant lines; this is 1042 over it, 3.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95802f262a23ba2be0fca560a3e1fac622b4362200391816105046c03295b06"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebSocketBridgeServer: ClassTooLong \u2014 1224 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 824 over it, 3.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abcbdbb90fc4d2e65caab27d9619d27f4d5848c3b5d1e8fa085f61ca233e065"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: torrent/magnet-tracker.ts: FileTooLong \u2014 1513 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: MagnetTracker (198-2134). The bar is 500 significant lines; this is 1013 over it, 3.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ef58151973e630df651419e2f359ddf809268f8d491ac384d0536e63894df1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/capability-bridge.ts: FileTooLong \u2014 1480 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 980 over it, 2.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c060309e7bdfd41c8b0946b02937eb2f5e1fd58c5f82c50983751e51223d6c05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tracker-sync-details.TrackerSyncDetails: FunctionTooLong \u2014 TrackerSyncDetails runs 285 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 185 over it, 2.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/tracker-sync-details.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d7b558e1c524d6ac50f818da3b4f3b9c32ddf6d23d1832084c6ea3edd505d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/quick-js-worker.ts: FileTooLong \u2014 1411 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 911 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd826a43f335f2d998e0a5aee6a3204e4d39c8a358147fedc1522468b64db649"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: directory-picker.DirectoryPicker: FunctionTooLong \u2014 DirectoryPicker runs 277 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"859eb723d0602fbd4ce41e8a3463bc50845332205180f7227bee6cdf369ed29d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap.bootstrapBridgeForServer: FunctionTooLong \u2014 bootstrapBridgeForServer runs 271 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 171 over it, 2.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"879d561f8f7f8e91a70c2ab63bbf5b4558ef7556cccf1511bdd59b6c216ffe6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/dashboard-grid.tsx: FileTooLong \u2014 1320 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 820 over it, 2.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"927aee45cdf465f76a49c61c6d04816a3f1a406b29a7246eb27ef825a176401e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionManager.restore: MethodTooLong \u2014 restore runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d75f4bf760a3496f957c4497faf2d25df88cea4a4e8669cdd88138d6a57c61"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SqlitePostDeliveryRepository: ClassTooLong \u2014 1045 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 645 over it, 2.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1930368b3a09836a22e5176680188511749cbfd116ec939024a4c48dbab98b0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: task-list-panel.TaskListPanel: FunctionTooLong \u2014 TaskListPanel runs 257 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-list-panel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eccce5614511729bc44d8d550a08a56af651a2bd2e983d2531381eae74c92ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tasks-tile.TaskRow: FunctionTooLong \u2014 TaskRow runs 244 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f100f603fc21abdd6e51fff5f48e0a9531b5d85d57eb1ce40957992f417df59e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/direct-resource-validator.ts: FileTooLong \u2014 1190 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 690 over it, 2.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e932158b727e84935f90062bc8581587c37feb3e091b40ab66bf520a7a8d4381"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: system-protocols-section.SystemProtocolsSection: FunctionTooLong \u2014 SystemProtocolsSection runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/system-protocols-section.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f59ee7c87e529b5077f38b5d197829c03f63e15cfec5d0e7a7bb92a94fb10b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: downloads-page.DownloadsPage: FunctionTooLong \u2014 DownloadsPage runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-page.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0785af1c5155dfc458c5034fbc226214d4044658c05073e99c9129d88784ee91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginHost.doActivate: MethodTooLong \u2014 doActivate runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a33946d26470b1ead4ed6eb14d83febc923e7f0257baeb87b2ce75ef5a037f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/post-delivery-repository.ts: FileTooLong \u2014 1168 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: SqlitePostDeliveryRepository (117-1406). The bar is 500 significant lines; this is 668 over it, 2.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9144b981eb45d1202117e4ed2edb3e57a09395064323b6917178a6ae65e2d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: renderer.startCubicGlassRenderer: FunctionTooLong \u2014 startCubicGlassRenderer runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/renderer.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a144dedfa871bcd680b327e5dd0e1ac90aa803379f6128b8f8ab48f08a8e08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web-directory-picker/web-directory-picker-dialog.tsx: FileTooLong \u2014 1141 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: PickerSession (135-1187). The bar is 500 significant lines; this is 641 over it, 2.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86347336710262410dd25e4bd439b924c6e8571abfe3d96162105a43152984f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/motrix-database.ts: FileTooLong \u2014 1140 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: MotrixDatabase (230-1396). The bar is 500 significant lines; this is 640 over it, 2.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af5a52d20e9a6be71e2d557f0d8b5623562dbfdee652d83d262d22ea2a1f49"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: create-selection-store.createSelectionStore: FunctionTooLong \u2014 createSelectionStore runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/selection/create-selection-store.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6208e00105ee88a0e92cac6aff580b5b8290f7f8096060956269361bb4622a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operation-fields.OperationFields: FunctionTooLong \u2014 OperationFields runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-fields.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c765b46e0554f3fe8ecfd7b5e5c3b051b75fd1564d51e63478349fb9b5635f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginHost: ClassTooLong \u2014 870 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 470 over it, 2.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"572e81323481f33fff65765b5ba544f7c301bc427872effec79e3fa4b9962f4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: legacy-fresh-download.LegacyFreshDownload: FunctionTooLong \u2014 LegacyFreshDownload runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-fresh-download.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"511afd17fc60216c1be4c0063bddf90b9b0aa8012ae4e0286eff46f48bdc485d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SegmentDownloader.run: MethodTooLong \u2014 run runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/download/segment-downloader.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20543a2e89421dbaa3a6a1f940771edd97e1a8ec6817b6395f652b1adaef913"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LegacyHttpActivationService.reconcile: MethodTooLong \u2014 reconcile runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb1e1652a19e213d371266e5b38f11c093fc349820f1d3ab98045017dcbae75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Aria2RpcClient: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-rpc-client.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60213ca7074a8e3767f5b45b52cc924d3943f9ac2391de6c03a5dd24bb43b7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/create-task-handler.ts: FileTooLong \u2014 1056 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: handleCreateTaskUnderAdmission (393-1353). The bar is 500 significant lines; this is 556 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4838ed0427e36297e9e9c69f8f8d7ca0a6bb334df52267802b4c1168b1c25976"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: integration-dialog.IntegrationDialog: FunctionTooLong \u2014 IntegrationDialog runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/integration-dialog.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc53b641b9d29f45b6282ce689379f441f98c7af6695db744fb386576ce0d47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: performance-section.PerformanceSection: FunctionTooLong \u2014 PerformanceSection runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/performance-section.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"18371f725a3977b890ea3ccfebe77fb63d4c3637a34560abe421d6b4de5dae7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Aria2Adapter: ClassTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 400 significant lines; this is 439 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3c506dca4f3bc60a8c9318508f3899b56a4e6ca6dc35487069dfc241ba642d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-pair-request-prompts.usePairRequestPrompts: FunctionTooLong \u2014 usePairRequestPrompts runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa6ac2521655fbcc872d0bbad5e241734f20396806266593767d5c2025b26ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actions/finalize-task.ts: FileTooLong \u2014 1042 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 542 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36adc87ec89bac91cc3c15418cd309d8344ed88cb25e67783690e61e55356c62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: marquee-overlay.MarqueeOverlay: FunctionTooLong \u2014 MarqueeOverlay runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce4b22c4b646499f2dbc54f2ba1dcc76f72fa1b43a3423738957f2c206c73cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/plugin-host.ts: FileTooLong \u2014 1039 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: PluginHost (157-1453). The bar is 500 significant lines; this is 539 over it, 2.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6968fac9c3b66dc5b67f85e26c71d65493188837660d0e1add79b5a7c6e66c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bt-file-verifier.verifyBtFiles: FunctionTooLong \u2014 verifyBtFiles runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"677703194839113186e1c8c0e58c8fdc811ed379d36f7b3e9338a57327b8c105"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verified-install.installVerifiedFfmpeg: FunctionTooLong \u2014 installVerifiedFfmpeg runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f50b213bb77857aa490295becff671481e67664f8f92cf377cc988cc13a6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bt-peer-geo-section.BtPeerGeoSection: FunctionTooLong \u2014 BtPeerGeoSection runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bt-peer-geo-section.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"024327921288e1beac36fb7c0c20b78e346d0091d83eb66d015a5f6c0869d53d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionManager.reAddOrMarkErrorFromPair: MethodTooLong \u2014 reAddOrMarkErrorFromPair runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adaff1244ba559694322fc2dce40685fb56c965362004593396a15a91c31092"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: directory-preferences-section.DirectoryPreferencesSection: FunctionTooLong \u2014 DirectoryPreferencesSection runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e481d7be1b1d53f144a2b4cd3521db79db2b11d69a3c9dfc4bb5fb7606f6f80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-install-dialog.PluginInstallSession: FunctionTooLong \u2014 PluginInstallSession runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-install-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8483d6b30e1167992bd763a7f5c1a858d63dd32f589721227818c34c0817a82d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Aria2Adapter: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. Most of these members implement engine-adapter.EngineAdapter (50 of 61 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8892dfa9d3b5a2b034858ac2d481090fff90089f2258a57e1dc8ee9ae7058803"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: task-inspector-drawer.TaskInspectorDrawer: FunctionTooLong \u2014 TaskInspectorDrawer runs 203 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-inspector-drawer.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27da271e1606ff5075e7f0aa1a4e6bddca6a941fd5225dfefbd2364ad1cfd05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: url-textarea.UrlTextarea: FunctionTooLong \u2014 UrlTextarea runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-textarea.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6f08fa186864f5b2e8523e39120931fab18a73513ca02c024831740e1aad0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-selectable-list.useSelectableList: FunctionTooLong \u2014 useSelectableList runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/hooks/use-selectable-list.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b15b100f6f979457f74f52f806e732a438bffe31a5468908b0dfbf5ac34b25c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LegacyHttpActivationService: ClassTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 388 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"417e190ba0a4c3e413dd4382236e5cf1cebc5f775b9621ab004d55f63843b4b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: source-scanner.scanLegacySource: FunctionTooLong \u2014 scanLegacySource runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc405012a072a71f563d22d3dbd221dfaa51ab25e9c52cca04fcf0d11a4670"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: activity/activity-calendar.tsx: FileTooLong \u2014 977 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: ActivityCalendar (264-1226). The bar is 500 significant lines; this is 477 over it, 1.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3305a331c704f7af202d2425b1aa6a186087acf1f51ba97f18077e3f47cb50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aria2/aria2-adapter.ts: FileTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: Aria2Adapter (148-1402). The bar is 500 significant lines; this is 476 over it, 1.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"366fab6d97f8329881be57187a9f9dcc83344fce50797b6e9bc65270667f9fa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ffmpeg/verified-install.ts: FileTooLong \u2014 971 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 471 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a57614e97aa2b25fb2d60eba0a06e4d9837c41cacd9f5a4b186774c039f2233"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrackerManager.performSyncAndCurate: MethodTooLong \u2014 performSyncAndCurate runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"38af3e4aeaa23137c21a272cea017403228c97448e2753e3747a7a61ac77e937"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tray.setupTray: FunctionTooLong \u2014 setupTray runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aa4ec8e1a89b3f51fd770cfd0a3c9891eb2c4d895a8d9d6fcc8cdc3fc66f1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LegacyImportService: ClassTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 369 over it, 1.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c02834914a851b236e50078a05217c14e5f3dd16ec3cd7582990875ae19d48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dashboard-tile-frame.DashboardTileFrame: FunctionTooLong \u2014 DashboardTileFrame runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d5d224722ef00a72e28f9837c9ec468831c01312e47a41195d8f1199caaa96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queries.buildServerQueryHandlers: FunctionTooLong \u2014 buildServerQueryHandlers runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/queries.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d7539a371ca8780faad8e385dc2c7e32bf0942303f3ab55e6726d10f9d1aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ipc/commands.ts: FileTooLong \u2014 958 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: buildServerCommandHandlers (224-1260). The bar is 500 significant lines; this is 458 over it, 1.92\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8c356929d28c50d67abf89a8196738fe567f2653d315e1d08d4f94450f93a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nat-tile.ElectronNatTile: FunctionTooLong \u2014 ElectronNatTile runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/nat-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bfb73ebe0a6351d09eedad028a4a9afde1f916779e585e9a722d17d756d9ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: torrent-creator.registerTorrentCreator: FunctionTooLong \u2014 registerTorrentCreator runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/routes/torrent-creator.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d4837c2cc1d9630149d0b5e384f4403fa270565eac5e273c8cc59a2ec79230"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.startEngineAndRestore: FunctionTooLong \u2014 startEngineAndRestore runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"906f446cf324ef7f96315933aba748e644c8aec5c3b8781e4577628bf555bff3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: protocol-manager.createProtocolManager: FunctionTooLong \u2014 createProtocolManager runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"19414c4d448a8fce7782f7c41e3fa18583e8b95ee9f5aec40cb0625653e3bab2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli-tool-section.CliToolSection: FunctionTooLong \u2014 CliToolSection runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/cli-tool-section.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d433b31e1ff1488e8a1ca24b809325317ff484c087cbbad48aecaf665abefb31"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MotrixDatabase: ClassTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 353 over it, 1.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d19131cd08323f26a0b43dd6cd14d347b154cda9429981a01a40f575331e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: aria2-session-identity-recovery.recoverAria2SessionIdentity: FunctionTooLong \u2014 recoverAria2SessionIdentity runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-session-identity-recovery.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f435012cb4d601f8b0ff3c1ff63c0680e7da39043a457fb8ecc6aa9d543dd499"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: engine-tuning-section.EngineTuningSection: FunctionTooLong \u2014 EngineTuningSection runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/engine-tuning-section.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fd96ce1f0146a642ec614ed87128c1d08ae678823bfc931e0feb5ae04c647c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: desktop-import.registerLegacyImportIpc: FunctionTooLong \u2014 registerLegacyImportIpc runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27cceab98c75fa358aa6091e900e8dbba8c722f4695e97274a09623be77c70d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebSocketBridgeServer.constructor: MethodTooLong \u2014 constructor runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"426a739b7a43a30664bde4de90873e5f13060229acb95c3786aee21656570a85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EngineSupervisor.doStart: MethodTooLong \u2014 doStart runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"021c52b4eb5912624e7d700e558daf2ab23a5a4f54b1e8fdd7d98037ed271a5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: motrix-menu-button.ElectronMotrixMenuButton: FunctionTooLong \u2014 ElectronMotrixMenuButton runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d41eb7bee30d81e222d8850016eae606271df1e6844e6cd4bae268d60530b95"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: overview-tab.OverviewTab: FunctionTooLong \u2014 OverviewTab runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/overview-tab.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"df47e27478b42350568b0a249484468b14ceb270dd2490d43c4f6b223bb60c19"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskInspectorActivityService: ClassTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 309 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acd134bf366e3ac3278522930cf549532001dce407a9c5f75e3d46a765dbee6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FinalizeRecovery.recover: MethodTooLong \u2014 recover runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddedf3d4fd5e9ebfd0345a551884e8d2b6e155fd594944a188363cd77041a23e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: remove-task.removeTaskUnderMutation: FunctionTooLong \u2014 removeTaskUnderMutation runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/remove-task.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ea8e4a49ce0d8f8ea1b4d23240d51484f3df3bd58533c101be14afe3b0b17e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queries.buildQueryHandlers: FunctionTooLong \u2014 buildQueryHandlers runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/queries.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"379c7afc266a95a0c7a966eaed60d6f65d2702fc74dca5f2c1726ddb913ccf4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: legacy-import/legacy-import-dialog.tsx: FileTooLong \u2014 875 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: LegacyImportDialogContent (122-1021). The bar is 500 significant lines; this is 375 over it, 1.75\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa266c76d0f3a61277952e24e0a4a694a6aba380c1ce980c1f242b4d2775ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MotrixDatabase.prepareStatements: MethodTooLong \u2014 prepareStatements runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d1804aae98fb06f95b721eb4da973829fa1f028b341b146eaf460222fda248"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: trusted-extensions-section.TrustedExtensionsSection: FunctionTooLong \u2014 TrustedExtensionsSection runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a4c7e58730de5923bf1019ed6c445f9c6f80cada002dd7c0ce6051b46a7ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PluginHost: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8ab4ff1d1afb5c7f155c87a5858231efeb294aa7b4eaca7abb460312ea0ffc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: import-task-selection.ImportTaskSelection: FunctionTooLong \u2014 ImportTaskSelection runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-task-selection.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f06af49901f35146c4471a49efcbc27d7c14d227a5816f1749ff51c02ab3c76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: finalize-task.finalizeBtAfterRename: FunctionTooLong \u2014 finalizeBtAfterRename runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f16410a777213f092d356f69e6db93c8cefc8665529406a15c4a33df52b7d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bt-storage-dialog.BtStorageDialog: FunctionTooLong \u2014 BtStorageDialog runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/bt-storage-dialog.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ba868688afad99491fd9ab64ac488d27066b4b82a6621ccb53d70480d6cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EngineSupervisor: ClassTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 285 over it, 1.71\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"25887b83ca743c478165f952641dd7b096b2458a2196f0ffc6cb46a7d8f800d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/media-task-coordinator.ts: FileTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: EMIT_THROTTLE_MS (167-1172). The bar is 500 significant lines; this is 355 over it, 1.71\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1239eeddf724bd0592eb2afcb32fe0d7629db7a02907c4f2353475b5d78c68c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: legacy-import/http-activation-service.ts: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: LegacyHttpActivationService (66-1060). The bar is 500 significant lines; this is 347 over it, 1.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a4e15e923074d802384d0d5666759484a8f6e2dff5c70bd4565f87618b4681"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginHttpClient.fetch: MethodTooLong \u2014 fetch runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/network/plugin-http-client.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c68a71b106181e42754737019748cb26e5cf28bd09cd5ba5726d7c4a212635f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-input-group.PluginInputGroup: FunctionTooLong \u2014 PluginInputGroup runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-input-group.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"776db6655f1e78aea0da5d7a2053f94cc1d82563eef4c0bd999659057e06986e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebSocketBridgeServer: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"918cee932d0bfedb544a277a73a5e414d6932be5850fbb03c3670b7495f4d9cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqlitePostDeliveryRepository: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cdfa7acba9887f7eaf239974b65ee63b3852c10404cb515800d358ae0454c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector-activity/task-inspector-activity-service.ts: FileTooLong \u2014 833 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: TaskInspectorActivityService (154-1089). The bar is 500 significant lines; this is 333 over it, 1.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4335357c6ecc4382ae2bf7cddd0e51dcb7edb52969d34fe78d7281637818a198"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: legacy-import/import-service.ts: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: LegacyImportService (61-1029). The bar is 500 significant lines; this is 325 over it, 1.65\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f056e5ec74193b7d59a7679f65cd8bd7e0a3624f12084bbaf8906e203a4e4f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: platform/appimage-integration.ts: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5255d9d74edb91ea2055e595ac1072f7fa682475e2853cb5ccfe4baf46088854"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Aria2Adapter.addTorrent: MethodTooLong \u2014 addTorrent runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f2bc4c251be9d1ec7dd5da3832ee26d52e09e1dde16da89fe7f2b1418da8b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: downloads-dialog.DownloadsDialog: FunctionTooLong \u2014 DownloadsDialog runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/downloads-dialog.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aead7f805c7003fe6ac840a90f556e13c3f84c0f8837101bbfb84d6c9465e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FullCrossPluginInvoker.execute: MethodTooLong \u2014 execute runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/cross-plugin-invoker.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c690c9b838328777970d35309afc3ec8a8c8f60a9d40b78bfbeb3c22439b6dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DurableFinalizeRuntime.commit: MethodTooLong \u2014 commit runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/durable-finalize-runtime.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a434419059e7b2c7b80580c01aaf8bd52797c2d04a3a5b010e8caf704d940cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReconnectSession.onReconnectResponse: MethodTooLong \u2014 onReconnectResponse runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/reconnect-session.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3c728e92fa58656e8c504e38f02eaa15659b75f7367993427061949688d92a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MagnetTracker: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6628b4fae9cff705bd679cf123e9ee016d93edee6c4af0e7b7f552859db8aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-call-graph-inspector.PluginCallGraphInspector: FunctionTooLong \u2014 PluginCallGraphInspector runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-inspector.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e91879dab96207b1143ece75af819fa42d57668e5a85f8f9255e5f25aa6920"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginInstaller.stage: MethodTooLong \u2014 stage runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b0f4bd1c779ce6c7aba371f0880c26c6b1acc96a4f028ac790e02c2d34fcf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-plugin-install.usePluginInstall: FunctionTooLong \u2014 usePluginInstall runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9580cfdbee60d2aaee8cf2f76e788010dc5e689e1b211d9606c393eda56778"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: add-task/add-task-form.tsx: FileTooLong \u2014 786 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: AddTaskForm (153-895). The bar is 500 significant lines; this is 286 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c4a7ea80d59623368e3ee3bbb58fd336298d47be10cc7812f285d654df790"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FinalizeRecovery: ClassTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 224 over it, 1.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee368e58e32de2e4484466de14f827120baf5d7ebea5317eaa6007139c1b0768"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MagnetTracker.retryMetadataUnderMutation: MethodTooLong \u2014 retryMetadataUnderMutation runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f47877dc007ba73063c849a565601e7e331a441a57ac18ada6b635b8677841"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CapabilityBridge: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddab2d569cdcc13e580359eeb5286522b5106c92f6a6f88f421b5db6572da77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FinalizeCommitter.commitPrepared: MethodTooLong \u2014 commitPrepared runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3e711e98572936018711e70a7195bb893c503695819e13a93a1b51f8507cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cards/bit-torrent-dialog.tsx: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: BitTorrentDialog (87-856). The bar is 500 significant lines; this is 264 over it, 1.53\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8dfa23cad9b9b1a891e0487c281da73ef87d226d7ea89aaf03e05c32c64911"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/credential-store.ts: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 263 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3d59b40d0f0616f02af631662f82ef7d1d3350452b0f1c59c41a42000fc29b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/engine-supervisor.ts: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: EngineSupervisor (91-1116). The bar is 500 significant lines; this is 263 over it, 1.53\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1dabfb3d33f2afa1856eb87a8d7450eb207ffa348230830f38464fd65c95cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.migrate: FunctionTooLong \u2014 migrate runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/migrations/index.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8f505904c0c022b47e4a0e9ef7697e62ccd4dbb1bba4856d2ebc8cb5f784be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: task-inspector-action-bar.TaskInspectorActionBar: FunctionTooLong \u2014 TaskInspectorActionBar runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac5ab93c63ceb8bc0e9bb5551492dfd014567ca18d7bdf3ada3aa5947136829"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: moext-reader.extractLoadedMoext: FunctionTooLong \u2014 extractLoadedMoext runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/moext-reader.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bf921f98199b59d34cfcf33359dacdf2f19b927d6cf2c1a122e9f3adf7976b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: renderer-recovery-runtime.createRendererRecoveryRuntime: FunctionTooLong \u2014 createRendererRecoveryRuntime runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-recovery-runtime.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6022442b6c0ec56b9d0c40a8c7dae8c842a27aa7ec837f7d5931115e49d36d53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionManager: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"623735ca9c26980af2897a1b84fd3c694b3a8fea863f823c4ffa267ed64bc2f0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OperationService: ClassTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 200 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c587a0ffd6684f633f1352f797b1a0b384c4a94e4c28a6207366aa7be7008723"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: inline-consent-panel.InlineConsentPanel: FunctionTooLong \u2014 InlineConsentPanel runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/inline-consent-panel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e043d9d17859877e52060a27e99c23eb0ef753c19a73bfdb4d88a431f7c01"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TrackerManager: ClassTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 194 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3299443598cd4302fe5fc3c762a88fcf4cca14802d65de11c4926b33bff45388"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Aria2Adapter.createDownload: MethodTooLong \u2014 createDownload runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3edcb7198e77b9f53e3e599faa8f7309c16f0204136b1a7190110841038c12"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeFinalizeArtifactOperations: ClassTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 188 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2904c1b2b74b8e08a5333388bd60dba856a325578d2872d7e2599583ab1267"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tasks-tile.TasksTile: FunctionTooLong \u2014 TasksTile runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40ea1300a99082b5c526843767e3bcc23cbfe27ac0f9da1feb2a302020c7354"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskInspectorActivityRuntime: ClassTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 181 over it, 1.45\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc30513be865a76a8c7afb6d70c2bb1d17861e64654c67115214b8167718fc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: create-torrent.torrentCreatorHandlers: FunctionTooLong \u2014 torrentCreatorHandlers runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/create-torrent.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cf9906fbd06fa61416c5f0032f75513522d8bcdf81f684eec5d381a22c52ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: inspector-drawer.InspectorDrawer: FunctionTooLong \u2014 InspectorDrawer runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/inspector-drawer.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5911b55a7667b6004fb76f0231b492da196e0592948113089152d47ea3e1429"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/index.ts: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: bootstrapBridge (412-1109). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cef0341fc699f90115edd63866e15fa21b5b073d47948e2ab09d0852560d38"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationFiles.execution: MethodTooLong \u2014 execution runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1f1ad04949a3a659e9a73f70054a64cd3e238194a343652b9dcaec0d838bb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugins-page.PluginsPage: FunctionTooLong \u2014 PluginsPage runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugins-page.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48db4e4b3a6a56214a56af14861b098a9bbe918af917969d64c300e9b43debc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/log-redact.ts: FileTooLong \u2014 715 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 215 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21852107f0d038bb4badca2eba7631c4f20bca81fd5e08043175003d3a9bf7dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: notifications-page.NotificationsPage: FunctionTooLong \u2014 NotificationsPage runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24c141459c606aa24c6c3650ab98bb285a7ec55d07d5ba8c9d30668f4316696"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HttpCapabilityHost.request: MethodTooLong \u2014 request runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bde06851489395dabf7736bacc986d808c4cd452d72e4affd3200ff6636d88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-log-tab.PluginLogTab: FunctionTooLong \u2014 PluginLogTab runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-log-tab.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b305d2526c446445d71e53b630ad10957c0433ba230fb45823867e622071b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginRegistry: ClassTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 164 over it, 1.41\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c346c4f7efcf67ed1ca406f1da53989c860eebc5b2366d1518f49ca6dc2e66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin/plugin-registry.ts: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: PluginRegistry (148-969). The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11845c07d90f9f7708ab1563ab0dea9b604f759e9ecca0f1915f5889eab4d507"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MotrixDatabase: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d9f691e241d6029dd15bf0326c304d851fb980e5b576973412f6cf7dc7ef79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-directory-preferences-draft.useRevisionedDirectoryDraft: FunctionTooLong \u2014 useRevisionedDirectoryDraft runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/use-directory-preferences-draft.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b402c027203f76d678f033fe872300edbd1738f3f4295ff4748172b1402d123"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: task-column-header.TaskColumnHeader: FunctionTooLong \u2014 TaskColumnHeader runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-column-header.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"351e115ba8fefd2ef9e7834a6cd059ed2ab0c8b80b5ed5fe66ebe8bb0bf10a47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: transfer-tile.TransferTile: FunctionTooLong \u2014 TransferTile runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9a4a39c1a4e1f327da9fb3d73df1e3ec17d5328c2344b2319b0d433a1cc6c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationService.run: MethodTooLong \u2014 run runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c86498582ae2984e031bf5773885db1a9948baa87f50a31f3c2b2930d59b8bb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OperationFiles: ClassTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 144 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9adfcf307556890e9cfd9deae6582c7911f14c1bae877f2b7335085c12019cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operator-auth.registerOperatorAuth: FunctionTooLong \u2014 registerOperatorAuth runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/operator-auth.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"619e7b47f277a71e82bfc5f12f9a69eb7923cdafb945900f1cfd5052017597f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: finalize/finalize-recovery.ts: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: FinalizeRecovery (46-881). The bar is 500 significant lines; this is 179 over it, 1.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be01fa107673f227f3c04b1ca74b8f641a9b44bf4ffada5d224d782d3f5ede00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: finalize/native-artifact-operations.ts: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: NativeFinalizeArtifactOperations (40-799). The bar is 500 significant lines; this is 178 over it, 1.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fbba092116d88e6dbafba825d71cd4a5b4d17bc138d55a216e7763c931294a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskInspectorActivityStore.applyCheckpoint: MethodTooLong \u2014 applyCheckpoint runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"273c3a956ca28ea71df42de7f1027be66a5690362b2e23d1aa8f45f9b724b825"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: url-editor.UrlEditor: FunctionTooLong \u2014 UrlEditor runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-editor.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"746f7faa79911a68f4c691d5f6d94d8d6a31ad81c5de503ed70b2de6a7a51450"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: client-gateway.listenNasClientGateway: FunctionTooLong \u2014 listenNasClientGateway runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/client-gateway.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c368c7f4a016c54a529a36b5af7f03e244060b97310d2d4b3abcab43fb42dc2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/bridge-data-dir-lock.ts: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb74b6b4553d6109afb1841e4d7bdcd935d0ea7d0b6a7dac094ab6da4cc386c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: torrent/swap-magnet-metadata-for-bt.ts: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: swapMagnetMetadataForBtUnderMutation (128-829). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9760886b02a3fb0ca33823207571763f3a69077957c521feed76c38c20c9b5c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector-activity/task-inspector-activity-runtime.ts: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: TaskInspectorActivityRuntime (123-972). The bar is 500 significant lines; this is 167 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad70facecca1cfdb834a68d55793e5f14b5050e65e9804315a0d5e71a946a76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: downloads-more-menu.DownloadsMoreMenu: FunctionTooLong \u2014 DownloadsMoreMenu runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-more-menu.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5ecf4876c2b632bcce2305b0abc1d98ba061fd58a06bb97cd9e19363c998d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operations/operation-service.ts: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: OperationService (68-804). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"280f1abc8c50d05d69edace217ea5d78913b02c448399804bbb4f3f5f00e3352"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tracker/tracker-manager.ts: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: TrackerManager (79-837). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d79be5c8e350102741c76dc7420fe092fc13f6632bdf88480418f6a1570431"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector-activity/task-inspector-activity-store.ts: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: TaskInspectorActivityStore (189-809). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a49da9decf4b66fe37d8b7128a41c82b21ded39b93041d571c293f7f25d421"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/operator-admin.ts: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc2b976bc266612ac51bdfe57d881e6efd8d68c97e90137ccad0bc58ddafa17"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PairSession: ClassTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 123 over it, 1.31\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae592831be791c1a751e3a6cc97ef3ef8327e8c36acfd3b6f423dbe3bce1480"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RendererSupervisor: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0092a3918a825f21cccff7daf870cdbb3da39dedf747c26dbc1d654a5a2a0ba7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WindowManager: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd132f948a1e44b335c8b38a834d51f93d4bb87d7284ffce5e8ff82fd02d0ab3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginInstaller.commit: MethodTooLong \u2014 commit runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ec2ab2dba0be575db6bf5d55e689e11f002fad72fc758348438784917c670"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: finalize-task.finalizeBt: FunctionTooLong \u2014 finalizeBt runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c950e08749f9c1e7c3485abe3c8182747fbe984ac2c51f670dfa5c15873aaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: add-task-dialog-host.AddTaskDialogHost: FunctionTooLong \u2014 AddTaskDialogHost runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task-dialog/add-task-dialog-host.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef8cd2bc7c1632ae3d1c1fd548ce2253a0bda458083f5983369294f039c66dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-cli-tool.useCliTool: FunctionTooLong \u2014 useCliTool runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-cli-tool.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4f3f17617bc74a3858643eab5c2a01aa9e21b267f346083640de508e3526f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mbp1/pair-session.ts: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: PairSession (250-1159). The bar is 500 significant lines; this is 148 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5004334abf0ef590fd8e87fad46d179734f3c01bbe42cbcce7b94ba0d805fd7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LegacyBtActivationService.reconcile: MethodTooLong \u2014 reconcile runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"847ecb386c5e5938fd8efc504ff08a9c3eee9ad84c05893934f2bc7200a1f5df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: speed-limit-tile.SpeedLimitTile: FunctionTooLong \u2014 SpeedLimitTile runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/speed-limit-tile.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e0e5763603390dd4fdeba9cb4bf9124af90cad0d61e3894561d45d7e45d3e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationService.prepare: MethodTooLong \u2014 prepare runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f40c696b84cf23f5631c2bd1c38d61d691d45e125dee5a20f3fc30bf6328a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: about-dialog.AboutDialog: FunctionTooLong \u2014 AboutDialog runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/about-dialog.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"329d1e2d3885fff6272385f185c1ba06faa9227543f031157151d2b8af5b20ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector/lifetime-transfer-card.tsx: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: LifetimeTransferCard (58-712). The bar is 500 significant lines; this is 136 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cda6fac61bb742333e643058d82338115b88ae48acedbf14c996515d23741b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine-diagnostics/engine-diagnostics-dialog.tsx: FileTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: EngineDiagnosticsDialogHost (140-717). The bar is 500 significant lines; this is 135 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b638b2e93ac925264bf01c7e34b2b3cb42c8fbdc9fdfe1f7455943d5430bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tracker-source-combobox.TrackerSourceCombobox: FunctionTooLong \u2014 TrackerSourceCombobox runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/tracker-source-combobox.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b8afcb037a3d7ca8e74ff9181da987f35b5134255b29f6aa83e68a66648617"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HookOrchestrator.runBeforeCreateHttp: MethodTooLong \u2014 runBeforeCreateHttp runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fdbea47c8926235bb61bb9d9018495c4c591670f8c10d2068af86b05b11b38"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DirectoryPickerController: ClassTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 101 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f654fabaf53573c0147e4d98f7f7eba05e383beb2fb58fa14a115aa791cb4cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/extension-pairing-projection.ts: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af83be479cc261fc6c0926dfd9e3514a5b186e11d38d98ee8965ffaf82682d4d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RendererSupervisor: ClassTooLong \u2014 500 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 100 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7118ca1520f29c238c784dd92f22a8ce394b7631ba0d39cdf342a0610f593b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostDeliveryScheduler.execute: MethodTooLong \u2014 execute runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"942bfa4fa6b983290fc0e094ca4b51cfdda53809ecb19dcaa30f74f8d86928ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: finalize/finalize-committer.ts: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cb40a65a77e0bceaffc1bfd7c19c1312ee532c5a4238e00c74ab68596673ff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskInspectorActivityStore: ClassTooLong \u2014 496 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 96 over it, 1.24\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffdadbb46107415699bd9e062d167528ef6ba9f6e1f5de77b4c0f41f12bcc2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: quick-js-worker.handleHookEnter: FunctionTooLong \u2014 handleHookEnter runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0ebdd49d333ccbf9a78cef05397bbff0506485147c507c9b57e35553df681a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EngineSupervisor: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9344c720dc3516b122a027f1ceb3bd455ab384e3b4adaa956329190d7bbc74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cubic-glass-motion-lab.CubicGlassMotionLab: FunctionTooLong \u2014 CubicGlassMotionLab runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/cubic-glass-motion-lab.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"390869d26aac941c4d869088c97c40a29c601829028b6dd05a01940256440f03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: virtual-list.VirtualListInner: FunctionTooLong \u2014 VirtualListInner runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/virtual-list/virtual-list.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79d3b077bc6b5fed1726911714b3cc81484fd46fddfd94d948b2f35bc51a727"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: download-source.analyzeDownloadSource: FunctionTooLong \u2014 analyzeDownloadSource runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/download-source.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28596faf083ecf2e2909675958ab35d729fc238f1286bac9300337125fe0916"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: finalize/filesystem-adapter.ts: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: NativeFinalizeFilesystemAdapter (181-781). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4074781f780c0f1b5f78476892bcde078ffa9b12157005e55469d9a9101b01e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HookOrchestrator.runBeforeFinalize: MethodTooLong \u2014 runBeforeFinalize runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"393035e31a67242cb8d0a146938d586ba9422cf9f3d9307387aa0a225f1a5b8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dashboard-page.DashboardPage: FunctionTooLong \u2014 DashboardPage runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/dashboard-page.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3366877b12d49b8de64fbb56a4228286e0d89cdb29f93c235c9002fbccc8e44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: effective-tracker-panel.EffectiveTrackerPanel: FunctionTooLong \u2014 EffectiveTrackerPanel runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/effective-tracker-panel.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f180ac231e68f48a05f3daae138ee804f8ff2bbbc8c51e33072624746dd95b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: integration/media-tools-section.tsx: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: MediaToolsSection (76-706). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ce5f7b51d1ed41493ec8a1bffbbf6c6a0b54334a93d3a42e2e918d6f043886"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: speed-sparkline.SpeedSparkline: FunctionTooLong \u2014 SpeedSparkline runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/speed-sparkline.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5458b890356033ddadded7f7cfadb8ceac60f80b9e07296469045eb93ae95443"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: task-row.TaskRowBase: FunctionTooLong \u2014 TaskRowBase runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-row.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9342e14dbb7be99f9f6d13521c689f0643d855847b1940fc3ea53280f62e13b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: install/plugin-installer.ts: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: PluginInstaller (235-851). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f734a10436c2e68a75c7edd7006f07808afb78517422d67340ac3aaebe66caf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/sidebar.tsx: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a523fd223c169ead41c6849a0c15dd913fc2f41585fbcd657a2796cabc7b608"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WindowManager: ClassTooLong \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 75 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9f3880f784062c055f76019323a3226de9d341ce772f0e98cb90486b6d153"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LegacyBtActivationService: ClassTooLong \u2014 474 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 74 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1964ca4b6207eb42a052a9b5391f2cd84f1314b3fe91d936167065d0422629"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operations/operation-files.ts: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: OperationFiles (54-736). The bar is 500 significant lines; this is 91 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e64345ceaf60b7133d44339e7dbb99ffea854a1114ccb22fac01076cb301b86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: toolbar-search.ToolbarSearch: FunctionTooLong \u2014 ToolbarSearch runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/toolbar/toolbar-search.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a2c2527e72a8dce2c9e08913effb1c1de6dedd8f4aabe8a9c07cddb4d84c47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: window-chrome.WindowChrome: FunctionTooLong \u2014 WindowChrome runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/window-chrome.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f69b7534c6a908a81ee3fa15631421eafb35c69c9fd7583a81984f99c35619"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: browser-extensions-section.BrowserExtensionsSection: FunctionTooLong \u2014 BrowserExtensionsSection runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bfa99c6c49eed4aaa30bebad88e184782a76c9e4316655e55afbbe4dcc6935"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-transfer-stats.useTransferStats: FunctionTooLong \u2014 useTransferStats runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-transfer-stats.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"107c9592d5873aefb4ad32c8696bca28d3a08174e5a6e2892df1a426d6b8912f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: builtin-update-dialog.BuiltinUpdateDialog: FunctionTooLong \u2014 BuiltinUpdateDialog runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/builtin-update-dialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa57ddbe301abbcc33aac1ab36ce2dbbe8f9cd87866f0bc4c674331be9ffbcd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TrackerManager: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5157fb462936c9012440faaf2333a044cf98b69de0f5134003feef091bbcf2f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubmitDownloadAdapter.adapt: MethodTooLong \u2014 adapt runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/submit-download-adapter.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82716b448d9ae30998ba3d6e42843a66bc90ca442afb3970a15294cfeac1b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: re-add-task.reAddTaskUnderMutation: FunctionTooLong \u2014 reAddTaskUnderMutation runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e209ae78432df2bccb47d3fa7c40308d5c4281fd6719ac61a3eead9e9011d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web-directory-picker/directory-picker-controller.ts: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: DirectoryPickerController (89-717). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2b21279674195272de1719098036e2d3397d05377d27326e6a7f97b6e0536f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ffmpeg-fetch-electron.fetchFfmpegAsset: FunctionTooLong \u2014 fetchFfmpegAsset runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-fetch-electron.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"523191ec37c819d3744e12829d604836d5dd123cedb99378a1251b15030f41c1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeFinalizeFilesystemAdapter: ClassTooLong \u2014 457 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 57 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1eedfd29607371cbd02c6a877fb14db6cbda2c4efece2e51dcaca35d0391bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: call-graph/plugin-call-graph.tsx: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: PluginCallGraph (221-723). The bar is 500 significant lines; this is 71 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fc1a26d81a2897e07be65cb79951198ecdc019a1a40567f300f6c457c8d3ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: command-runner.createCommandRunner.\u003Creturned closure\u003E: FunctionTooLong \u2014 createCommandRunner.\u003Creturned closure\u003E runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/process/command-runner.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcd35b08330d1a50a60aef1b8e9ac3c6a6ea610a8c23d13bb028f6653202df6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: shared.contributeSharedMenubar: FunctionTooLong \u2014 contributeSharedMenubar runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/contributions/shared.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a741b7dc4749244607a2464962b38546374ac65173500f23dc3edc40a72ca51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: window/renderer-supervisor.ts: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: RendererSupervisor (78-732). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"510e78d4f4af14381770a7bbbceb56de525011512dfe62ab3c7753b8d70c226f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tiles/tasks-tile.tsx: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a673f0b42b6d1b2bffb1faaae250166af5762652e4de2c3765c91ff9681d8e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PairSession.onPairHello: MethodTooLong \u2014 onPairHello runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b196f6022df46c1a9c8de3c8cabb5e0f62cd507c6f5a387c54a382a37057d55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hls-parser.parseHlsMedia: FunctionTooLong \u2014 parseHlsMedia runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/hls-parser.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a9c19cb838c131c94df51f3b9cc718d8a18721481caeab61d3c853a65d8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginSecurityService.fetchPolicy: MethodTooLong \u2014 fetchPolicy runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/security/security-service.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d673da910c765d7ca30f82fb4909889019429682ae6d389329443bb617ee53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-engine-display-status.useEngineDisplayStatus: FunctionTooLong \u2014 useEngineDisplayStatus runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-display-status.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"860d8f82020f6b1e2d8c47f3a67a3e347b4562b5e8c18b1a5d8418415e459e63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: filter-search-command.FilterSearchCommand: FunctionTooLong \u2014 FilterSearchCommand runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/filter-search-command.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"464a73813c8d29eaef6c44743aa28cf3939db479ae265f2e8c2a5c9f97fb3b5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugin-operations/operation-form.tsx: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: OperationFormContent (103-683). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d881891a083097cb5d8a11ccf29438ecec485fb2add4ab463a7591eb209d3232"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bridge/remote-extension-admission-policy.ts: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6042eabc1d03600d7d82fe273b07182132a08296e35e665e11373ccff2505309"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verified-install.extractVerifiedFfmpeg: FunctionTooLong \u2014 extractVerifiedFfmpeg runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f22fa436c284b3b4b7c0b91a3106d4bd1b04eed5e82ed15b9fa183f48d6f96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.handlePolledTasks: FunctionTooLong \u2014 handlePolledTasks runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"4873d6bc787d0e2607c27148bb9c5e9c6656b2ed54632f2c981c30df77f8ed97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: speed-limit-badge.SpeedLimitBadge: FunctionTooLong \u2014 SpeedLimitBadge runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/speed-limit-badge.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eaa1bf00f9721f00faba3108a963389e0ec6d84eaca32bade566e6ff8f1db2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin-call-graph-toolbar.PluginCallGraphToolbar: FunctionTooLong \u2014 PluginCallGraphToolbar runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-toolbar.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac78b064a19980c186ef9e61428932f14ff9b677bf074debcc088b0975264184"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskInspectorActivityStore.applyTransition: MethodTooLong \u2014 applyTransition runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e2841f46603365c55571def6f6610cda6a1b61eaff30ba2e09d101f94cf86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LegacyImportService.graph: MethodTooLong \u2014 graph runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f89fc64a9be499d71e0d6bf39c110aac4ad063713446edf91d438a87419f1f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: session-parser.resolveLegacyRequestSettings: FunctionTooLong \u2014 resolveLegacyRequestSettings runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0586cee55681d727783584b1a6ca5157cf5073a0b2a167b621ed39eb894636c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionManager.mergeTaskFromPair: MethodTooLong \u2014 mergeTaskFromPair runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0cc68265e6fad5b800b2948096adbfd592d2cdfdb6c522d9b9d2bd8ab2c27a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tray-speedometer.createSpeedometer: FunctionTooLong \u2014 createSpeedometer runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray-speedometer.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d003ff3f402dc23e791ad078d91bfdcbd7572a52f88fb1461ff7aa8de00a1da2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: registry-detail-panel.RegistryDetailPanel: FunctionTooLong \u2014 RegistryDetailPanel runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/registry-detail-panel.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"da47d5d6dcc90ffd87a51e9e7ae29fb31bfdd9c59a488bf55a7a5fd42ced4b23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/settings-manager.ts: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: SettingsManager (179-831). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f4a12024d355b44fe4c0e903da7f5389156ab4af0a56adf3d4d34583d2bafe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LegacyImportService: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c2f18d03ff1b78fc9240abef119438baa8527ef9894ecadba72e1261848a43"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DirectoryPickerController: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5b951208f85b78965a92b5a8c94289fe0f39eb7d5c7290a8eb76c667a03351"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginInstaller: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 40 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c91fad518f471c7e24a19f827e0b97dcadfd86a25bb92292caa8fa8d0efcfd6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: State: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 2 blocks, lines 10-587. The bar is 400 significant lines; this is 40 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8e5de05abb4391b9c58b824fba744eeea98e684ced547fc6c1f578f30c9dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MagnetTracker.deferCleanup: MethodTooLong \u2014 deferCleanup runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef80451e42b5498a74557dcd57ba86b3b4146f8f39ae3927f215ef932096b3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: notifications-page.NotificationRow: FunctionTooLong \u2014 NotificationRow runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"15addd697a7cf9040be8a748d0f7380b9f3602d28721a8c0e2d1859aaaaa7ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: appimage-integration-section.AppImageIntegrationSection: FunctionTooLong \u2014 AppImageIntegrationSection runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ab45f05228ed81f9f9291a8296753d18ea162d89374bc0b7201d7963be8f2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cards/appearance-dialog.tsx: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: AppearanceDialog (98-617). The bar is 500 significant lines; this is 42 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd172a032f640224d137b8f82b396b08a4bbd130e4a684266bf25c83c58366b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: engine-tile.EngineTile: FunctionTooLong \u2014 EngineTile runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/engine-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4aadc91ecfa34ba7115cb07881d47d3916b70e703b4ec9ec74eb263b657874"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schemas/plugin-hooks.ts: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e8ec038934a4313cd81e69b133591db1198281370bf4e53e390a088f4b5ad7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: drop-zone.DropZone: FunctionTooLong \u2014 DropZone runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/drop-zone.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e75267ea26ec20763c8412e7d96ce9969724228167f3fecffda3c68399cf4d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: active-tile.ActiveTile: FunctionTooLong \u2014 ActiveTile runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/active-tile.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff0444d4b597c1290d79444f7a0ae351e905c256cb7f0f52fbb7025da0c7331"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskInspectorActivityService: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"845ebb8a30751ca95e9dafe0190843720577278b761a6f668ef6f0f3000adfc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parse.parseManifest: FunctionTooLong \u2014 parseManifest runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/manifest/parse.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c340d019de2ad2624733d898b2ecf5a26a3b0243417f8d1b1236eb63287b742"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: advanced-panel.ExtraHeadersFields: FunctionTooLong \u2014 ExtraHeadersFields runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/advanced-panel.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0330eea4be59b3a894a0585caea5fc1cd8abab8aff36ab93ce5adcdff8ec11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-plugin-metadata.usePluginMetadata: FunctionTooLong \u2014 usePluginMetadata runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-metadata.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b797e30c8fec4f1ab379052af5108edbc2a71b252617113d09068fd58cfad7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: update-channel-setting.UpdateChannelSetting: FunctionTooLong \u2014 UpdateChannelSetting runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/update-channel-setting.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6f67870e65e15486c81edcfd75e9e9cc664ff6755456dee6ec7a2cd30659ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/hook-orchestrator.ts: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: HookOrchestrator (165-735). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bb280db2776058a30576722dbc62cd13bd9afdb65b429ec4c9f6c7242c1058"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: http-request-context.resolveLegacyHttpRequestContext: FunctionTooLong \u2014 resolveLegacyHttpRequestContext runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-request-context.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ac77749260ae6cf523c5dc0bff002a232ba51d6a20e862969013ab82728e13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: downloads/task-actions-menu.tsx: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: TaskActionsMenu (106-611). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7684ffe77537228434e56742d24d82d1d84110c0e0ccbba35c0ffb39f76d9c5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LegacyBtActivationService.prepare: MethodTooLong \u2014 prepare runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e045fdb1de43bc0cb58991c699c08829afc73eee49dd9b8a1553b9e9f05c13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tracker-selector.selectTrackers: FunctionTooLong \u2014 selectTrackers runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-selector.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6847faf45c6a2972b93003187543773289f7fb33ba8f3285bd901c9ad0872209"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: directory-preferences-dialog.OpenDirectoryPreferencesDialog: FunctionTooLong \u2014 OpenDirectoryPreferencesDialog runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"17eff300df168271d4a1bbcf756977b23c1e1209413ee059084d5cae64e7b658"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actions/re-add-task.ts: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87345b3d955f6bc4acf6240dd0dd84c0ad95bdd53a26b4e46216c3830364811b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: window/window-manager.ts: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: WindowManager (60-786). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"423488b880d19245d0d83c1c9a8e2b9d55883e730088adfbe6f5ad29547f88ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskInspectorActivityRuntime: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"190b73654f63f7fa53c2f2ff3b5de99a73af64fc56d3a59acc606d06899c5bc2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeFinalizeFilesystemAdapter: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f583737b4fdcb4013a66d82863b226627a46b664c45eaedd9c926d28bf8d8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: legacy-import/bt-activation-service.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: LegacyBtActivationService (46-648). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8210ddb934e0bfb6aeb45ace499d5d3a57356661cd005412f593908abc9e838"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/cli-tool-service.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: CliToolService (172-662). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8754cbad1ef7b17ea73e4b3b42c2bfc838ce54023122aa7908a28d3da520b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: delivery-materializer.materializeCandidate: FunctionTooLong \u2014 materializeCandidate runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-materializer.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f2b269ef9b56b18782a4b1cdf73087ca534fa88ca14d5a9c33461583960c6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: finalize-task.finalizeTaskSerialized: FunctionTooLong \u2014 finalizeTaskSerialized runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1759afd2d5707b6504e061f25d754d96571ee4094facbc3d907d498415db189"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CliToolService.#probe: MethodTooLong \u2014 #probe runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b94d522598fc746c48743ff324f4b93e8952b2bde9d22f049d51442a43d05dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: activity-tab.ActivityTabContent: FunctionTooLong \u2014 ActivityTabContent runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/activity-tab.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe954bf25a9e595c6e487b3d88b5885a20cf9f7fc87f965a408ba4e868eeccc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-app-update.useAppUpdate: FunctionTooLong \u2014 useAppUpdate runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/use-app-update.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bccc13a68453fa6d96c44e3354c13af99f98dbc4d85d7446e2c0309df3f7c0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FfmpegCapabilityHost.run: MethodTooLong \u2014 run runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"242904d21b590f417892f7f9844e12b38d59eabd8f2012b304ad4208ed0b8855"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: re-add-task.buildDirectReAddParams: FunctionTooLong \u2014 buildDirectReAddParams runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d311a6486d40aa32e490fd1f9b204ae622890d5e8b159c7554880f7a2bb0139"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cards/network-dialog.tsx: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: NetworkDialog (96-587). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b6776948207a985838ac453141c188e4d9d19712a109bfde31f41992c91d24"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SettingsManager: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 6 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f079b9221afa74a84ef3d2c00b5ac36b0958c3afddde9dc8f36a451bb271f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostDeliveryScheduler: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"637e0ac1fb549979747323b70c687f0398ddb13967e6269e7986d765a8685f21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lifecycle.lifecycle: FunctionTooLong \u2014 lifecycle runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"97750227787600543b1db80005cbf4d99f7272ca2e66fdefacfec49ccbdd8b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cubic-glass-gradient.CubicGlassGradient: FunctionTooLong \u2014 CubicGlassGradient runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/cubic-glass-gradient.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3840df49232a551dbacde7348f602e3d77c49bbeb39694dac8c4fe25c75e54c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): packages/native-host/src/flatpak_companion/secure_fs.rs:193-227 | packages/native-host/src/flatpak_companion/secure_fs.rs:232-263 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/secure_fs.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a6b0efcda98c47eb7694a9751d7b7497ca41603451dced965107cabb582495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): packages/native-host/src/broker_protocol.rs:158-181 | packages/native-host/src/protocol.rs:128-145 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/broker_protocol.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df920afd4d64c9b56032d86dcc85ef9bb121b9c85918c9c295156e383b9716b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): packages/finalize-fs/src/platform/unix/publish.rs:20-34 | packages/finalize-fs/src/platform/unix/reserved.rs:131-144 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/publish.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5830685e6252621e31817e1d6e9ee1d56479327a5984b77226d885f05cef0e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/finalize-fs/src/platform/unix/metadata.rs:66-80 | packages/finalize-fs/src/platform/unix/metadata.rs:82-88 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/metadata.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"42434d76080d71c31eda4e5318100d287d0abc9c85d08103dde6ede021d103f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): packages/native-host/src/appimage_config.rs:51-56 | packages/native-host/src/flatpak_companion/allowlist.rs:42-44 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/appimage_config.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c373ac77bf04f9ee5dd76edb23d74572ba77885b209fd69a8e81bcde8c3c840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201315 lines \u00D7 3): packages/finalize-fs/src/state.rs:215-229 | packages/finalize-fs/src/state.rs:398-412 | packages/finalize-fs/src/state.rs:546-549 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/state.rs:215\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da24a8ffcdd07e5431c9a6c7f382b5d846ad9d0e2d6ac6fbdf14834624e8e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/finalize-fs/src/state.rs:277-290 | packages/finalize-fs/src/state.rs:336-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/state.rs:277\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"791469063401c1c1eb6dc1d98dd8c26955ed23b7610eb9af1c69c358bad62916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 3): packages/finalize-fs/src/platform/unix/copy.rs:127-139 | packages/finalize-fs/src/platform/unix/copy.rs:202-210 | packages/finalize-fs/src/platform/unix/operations.rs:119-127 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/platform/unix/copy.rs:127\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1916e022dc146f05c9a3a318c467f056490a12b405c8466fe852b673c8e86696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/finalize-fs/src/platform/unix/copy.rs:33-45 | packages/finalize-fs/src/platform/unix/digest.rs:24-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/platform/unix/copy.rs:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74ca63af90380e05be60bb318f850234e8d8614b0ae6d3707a192f71bdded3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/finalize-fs/src/platform/unix/copy.rs:86-96 | packages/finalize-fs/src/platform/unix/copy.rs:98-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060packages/finalize-fs/src/platform/unix/copy.rs:96\u0060 calls \u0060from_raw_fd\u0060, \u0060ensure_same_entry\u0060, \u0060as_raw_fd\u0060 and \u0060packages/finalize-fs/src/platform/unix/copy.rs:85\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c13d839670e370f3ec87aa0aac4ebd5411d775169551eab542a012db8c41e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/finalize-fs/src/platform/unix/copy.rs:91-101 | packages/finalize-fs/src/platform/unix/copy.rs:117-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/platform/unix/copy.rs:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d92ac58f0b8e82d638dff463c95721f870eb93deddf23bc71e4788ab8a69eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/native-host/src/flatpak_companion/secure_fs.rs:194-203 | packages/native-host/src/flatpak_companion/secure_fs.rs:233-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/secure_fs.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"410710541bafbf530f9d9b0c96bbd356c4ac4ff63d56812a460c0c1e7c31820b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/finalize-fs/src/state.rs:82-90 | packages/finalize-fs/src/state.rs:205-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/state.rs:82\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bde6743a636b1e022377015ff8e6d2f1c81601f23622152972a5c5fd886c74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/native-host/src/flatpak_companion/secure_fs.rs:206-214 | packages/native-host/src/flatpak_companion/secure_fs.rs:248-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/native-host/src/flatpak_companion/secure_fs.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/secure_fs.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"399a092ba418df8c65931eadd8159ef82c71dbd0f343fa75de5b776b2b469a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/finalize-fs/src/platform/unix/copy.rs:101-108 | packages/finalize-fs/src/platform/unix/copy.rs:189-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/platform/unix/copy.rs:101\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a32b11f2c1372d6a9947ba2706e8310bfd6cc1740c1a7d2b36a19d8a8ccd66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/finalize-fs/src/platform/unix/copy.rs:189-196 | packages/finalize-fs/src/platform/unix/operations.rs:31-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/platform/unix/copy.rs:189\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/copy.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c95b0c440f46dcea76f686d421bbb689f032028303b509433eb62ef294ed74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/finalize-fs/src/platform/unix/rename.rs:121-128 | packages/finalize-fs/src/platform/unsupported.rs:41-48 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/finalize-fs/src/platform/unix/rename.rs:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/rename.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"19acccb7fbb7b4b1fc698a14a0a9cd352cb607b080f61763eb0a16b5def9a1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/native-host/src/flatpak_companion/secure_fs.rs:99-108 | packages/native-host/src/flatpak_companion/secure_fs.rs:301-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/native-host/src/flatpak_companion/secure_fs.rs:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/flatpak_companion/secure_fs.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"340bdd57cc289108cf70cf32674439b906017b43ba5b5fb1cd0f38e55032e073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/finalize-fs/src/platform/unix/reserved.rs:33-37 | packages/finalize-fs/src/platform/unix/reserved.rs:207-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/reserved.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"26216f51c1de413f696ee5e42a567aa91dda251c97c1b063a53421af94b1f6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/fnos_publication.py:63-69 | scripts/synology_publication.py:188-194 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/fnos_publication.py:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fnos_publication.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"443e6b129218ec22c6b37116f6be454347a49de44bc0a5f433277b8c75f50f69"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/application-menu.spec.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbd5b62b0a32b92894534d2f20bc905aa110c1ddcc1399e0c79eddd7cec2045"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/application-menu.spec.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b8eaf9846dbdc4ea4bb4afc1ee745b2def5c6b27b26cf150ba4f8794ca6938"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/download-progress.spec.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc531358c4e80a3702132a7bc0e8b972741d34c97d7f7a7df7a0256786342b7d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/hidden-window-startup.spec.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fbc1c78adbd43a8cab9ece2e7fa8642ae0d991c62c6331860dd39235de273a"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/legacy-bt-activation.spec.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc7d6c57e00de47c2feb4ecb1d841b2197cfe820813ceb235e32a9d8930d9b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/legacy-http-activation.spec.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c23e2311394c7726936df4ae7eb165aebbc865878a44c35e7d89cc6f4181d0"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/media-settings.spec.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ff2f1a6c9bfe29553f6ccda904bd563404b25fb88c6e1402a0e47f3443a9ed"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/renderer-recovery-soak.spec.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702985c9a10a4c883a38e89033f9c23913d79baddfc8d10a0ae71f8167eb1e1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/renderer-recovery.spec.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2eab3ecf39b79e734765d004d4f084a92b9cdaf5249b825cc917bb97da2c46"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/task-http-resume.spec.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b8a70fec3247054509e16abd2fd2869a183408e86d33055985eabbd697d9c7"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/window-chrome/window-chrome.native.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b4e8b447fa0e68de0392e596bd0bdd1407aa675edb2cf088b43a5eb5bbf2e2"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/appimage-cold-launch.spec.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1908d1a9cd2c88887e5e8ef5d144280fca0a738a934b7bb71f68db5b7e422b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/appimage-cold-launch.spec.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd2573e7f43660f3268237df6565e480ce3b135eec30fa4fbf73324ba6affec"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/native-messaging-registration.spec.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b8797de08553380855eed08142f1a52fd8d1689b5fade2ec90329d737378c4"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): installs motrix-example-bilibili-resolver from GH and rewrites a URL: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/community-plugin-install.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e05f99b6cff9572af414df92bf521a52d5dac3030eb8e15f20a30bf21109c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: keeps the operation visible but unavailable for a disabled plugin: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.test.tsx"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"284f22de61edaa6241eb52a191d47ef2396bd7e5d0dbd4fff75a95e10039bc39"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: removes listeners on unmount: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-modifier-keys.test.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"55062c6d0c5f0c76b6e3402cde28a4330d58670d6b69ddff0762ffd147d85a6f"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): can unregister repeatedly when manifests are already absent: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/native-messaging-installer.test.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a484ece7cd1d5bbafb0b7e5329ad02ce685f93cd9c03790087c521d7fab29d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: skips updateApp when handler is undefined: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/applier.test.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"576d7a995b1e8a784c6e3df996b52936054951157b5693f4fa7e09709fc1778a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: is a no-op when not running: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-manager.test.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb026d898c836b7274c2fa1b2dd54c9fc4ff61b68c9eab56ee84c530df52bc8e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: is a no-op when not running: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-manager.test.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7ce8110c001b87f05a62152f7ced5e754811cbf2f7ead40db34251b50501b4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ignores notifications with no matching handler: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-rpc-client.test.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"e436710c6599eedbb16b0f6ad73ec86f094e7d0e0c9b3e2b1b30d654a308572c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: positive time ends seeding even when ratio is unlimited: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/seeding-policy.integration.test.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde5934286e31bd88d6bb0fdae043d6a62011fdca292d70ef9c8eb1dbe8a6a51"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: restoreInflight: no-op: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/bridge-receiver.test.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f73e55a3aeb8c66d85a0656108c32b7b3ce3b251e511ea32404b20c9dc4723c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: restricts a PairSession handle to paired or aborted outcomes: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.test.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"371d33b3246a76a752ab745c277dfb049933cce675324579726c24bc9f7789b8"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): an early app link survives renderer startup and a released main window: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/app-deep-links.spec.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e056893e50cc8be52fdc05847345bf38fbf9ed94d0c3a5b9dee1c569ffaed0"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): quits when the disclaimer is declined: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/disclaimer.spec.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5de690f26363242f10bad81aa4e8b3b89eec8cfcd3647b242cac2b7c419e31"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: a second launch restores a minimized main window: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/window-reopen.spec.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ba4fca52e7f845ea155a0645b9829b01ea6353cc5aa30de6fa4476a60976aa"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: cancel invokes downloader.cancel during download phase: This test starts work it did not wait for (\u0060startPromise\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 10))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.test.ts"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecd5e2c4b1d942f5379414373f398d67211b9cb4a35f10eb0d439f9b88b760d"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: getActiveSegmentGids returns the running downloaders active gids: This test starts work it did not wait for (\u0060startPromise\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 10))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.test.ts"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0fad225e83f54bd62ca78f33300163c76d23857953872f703f03039613deee"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: http.get outside the manifest hostPermissions fails with host_not_permitted: This test starts work it did not wait for (\u0060scoped\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 5))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.dispatch.test.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4796c5ef82a19d292407519ca4dab148953b670a1d80e19293d85d8cf80111"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps manually configured tools usable: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/plugin/verified-ffmpeg-server.test.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9264e9ebdd2e0c02985a73da206c7c679e948dbc84c401b5c124f0235260d2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: routes task lifecycle events once to each of %i eligible sessions: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.test.ts"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"d597150ee3d294d7c0d4b9b019fe3e2af339b04098f86bd1eb62db210d14a56f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: device-code: settle/expire push is re-emitted on the server EventBus: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.test.ts"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76c6b4e7c6b5cfefffa283f7e3daa3ed6fcfc791ce6bf537e4dc0ede63cc096"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: unsubscribes the update listener when the dialog unmounts: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/about-dialog.test.tsx"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dacd131071d4fec1878d7adb02cbf2cad6bd9535a652b9cf6b11fb8990f8ba"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: shows the plugin restart reminder only after a successful FFmpeg save (%s): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/integration-dialog.test.tsx"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"006f5aff964943126b6313cab4a917cd8094e84e22ef2d17bf9d94899e37b502"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancels both stages when navigating away: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-call-graph-preload.test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d274a560f627ccca37975871ed3535e826c7fa8964199fc391bcfdbfa88b4ad"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reports partial and whole-command failures from global actions: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.test.tsx"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2289a5d93c093b807cafd79b421c39536eaa89c43bb5f9e44fa4fe29f0f2c3f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: shows edit controls and dispatches numeric span actions: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-tile-frame.test.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2615464947baf8d7522dd37dc7d208b5b5849de1647abead38b2fb996a6e19f3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: retains preload disposers per callback and channel without passing callbacks back across the bridge: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/electron.test.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5389306aefb3ce10faf2979757042f2a76b5f0a7aab44392915291b0f966764"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps completion toasts silent on %s / %s / focused=%s: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-notification-toasts.test.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eacddfebd3f1f88f6c59dde4b3f1355efaae3de630d717b466e5c5cf5c2928f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: stops periodic work while hidden and resynchronizes on foreground: This test sets up 3 test doubles (for example \u0060vi.spyOn\u0060) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-list.test.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"63386b810825e1c480f826ba05c8c0f9aea53940c1d2119a4b290e5c626faabd"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: honors system reduction and renders stage actions without an animation delay: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-motion.test.tsx"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb7c973f9f078dd777441cf15ff50452a7956a2ba4dcde7dcdef5241faa35a2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reports picker activity and ignores a result after its form unmounts: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.test.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a45d75bf3099556857329d8c73073f97f56e94285011ad23143c2f4bf9db1c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: updates drag geometry without a React update commit: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.test.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"812266c9508b0a1c58896172c7e7c609dea80e913d53f2e4f2693f299f0c1ece"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not create a GPU context after unmounting %s: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/cubic-glass-gradient.test.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"277652c08a65c63b30a08bd411d2f7c6c80c496d06dfabe0710509d0fcf6a63c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: ignores an in-flight renderer load rejection once shutdown starts: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 3 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.test.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4e7e7ce8f4ebe5a6857f05c87d267076b79a1089a5813a9ba9788a4b9a9226"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: blocks navigation and redirects outside the trusted renderer URL: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.test.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"90671215ea0c6d6bc582e6dc735401ae9ee09afe3873be93783abcbd3c0c41e3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: hides macOS traffic lights after attaching the main-window preview: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.test.ts"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd0f4cabda80a986df28511418b6d2dc754d486e4bad36f6f28f6faa00d074f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not enable Liquid Glass for the add-task window: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.test.ts"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"43338547f2b65f89721c62f39c57272538b79f1c06f87abbff5381868e64eeb4"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: stops converting main-window close into hide after update quit starts: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.test.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"1062f97d9f3a726fb510692ea97bbd654877955f7bb647c639c9aa892034b1d0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: ignores rejected loads from superseded navigation but reports the current failure: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 4 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.test.ts"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5d343ed293d388282336a54f60a98cdab007029e208167e4cb79fd63cae66f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: accepts only the dev runner shutdown message: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/quit/termination-signals.test.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bed3b172be97ee35e22553cbcb92f155d35569d4572d1edcf155de5804782a2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens add-task window with magnet in links prefill: This test sets up 7 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b3f6e5dbeb370d1b8251b9f791b2e3992592e6c43251e8d1c42a3393f6600e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens add-task window with url prefill for http(s)/ftp: This test sets up 7 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df3e5d1568a577b79014662881661ed587a242c09117b979cc6f4026a1fef7f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: decodes motrix://new-task?uri=\u003Chttp-url\u003E and opens add-task: This test sets up 7 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac04e70ede5beba999585f5b3988eb0a93b05fa9eae11a6ec02f3ea023c2772"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: decodes motrix://new-task?uri=\u003Cmagnet\u003E into links prefill: This test sets up 7 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bdce972d487d3f010a88a1e6761dd71cf0511d78b0cf956c450216979fd741"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: shows window for bare motrix:// URL: This test sets up 8 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"701e7abcde4980a0bfe498cdc682d470371d1336c167fb7e32498d307c65ecd3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: routes motrix://plugins/\u003Cid\u003E to the plugin detail navigation: This test sets up 8 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a2a8316d038f7d131c372d6203e159f4c88709c07afab2beb4002467155671"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rejects malformed plugin deeplink ids and shows the window: This test sets up 8 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b25097b8c14648a5a7a92ccb5cd7aac1d3f7dc1588deba97b5a006a9fd56a8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: delivers parsed torrent \u002B meta to add-task window: This test sets up 7 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"0591c8e26cc1371b2db202262345327f18fa917d1c63e27131418c6f59691add"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: ignores non-torrent files: This test sets up 7 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"389fb832c4cd03531cdd25f0672a4fa293d95b36f53d9e6208082e51de92820b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: queues multiple torrents and serves one at a time: This test sets up 7 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.test.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e7544804dd69e59505264d0943f4fb464213bcd2f1659319530c14fb36f718"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: applies all four channel choices without restarting (foreground=%s): This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/desktop-delivery.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a4f781fe86ad24f9d696472d28fdda48c01eeb1ef5665246fafcc77f29b585"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: subscribes to Events.NotificationAdded: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6347b5e5d526662940991f39cf17d97a7f0979ffa6e60d203882edb6d464a1ef"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens all downloads when a %s task becomes %s before the click: This test sets up 6 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 7 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6452b2802fc52176c1c5521ee3453835dded7a76738af989a45318be3d0dda37"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rechecks task availability after an asynchronous reveal failure: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d33d4902e511a3d0fd6ecbfd9faafe64696c9092eeefd7b07271aca1995ee49"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rechecks task availability after recreating the main window: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e72f2ee1a0235d456016a1a650bb1985e9f5c88bec24dd7768fb9f5b25f6e2a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reveals a completed task without showing the %s main window: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbbf08519a22efbf8078ff933dd7e922974714e1c72e5d11921944878bf7937"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens the main window before navigating for %s: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb13903aeeb643f61e7e1c2b251bd0615243f5a55766e10675fbdf46a243771d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens the main window without revealing or navigating when taskId is null: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"198a0dd03fb9307cb7aaaf6acb6e1e79e59d0ab04dd6db5d39744d67cbba62ba"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: waits for the reveal result before deciding to open the task: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3a7a8c365a423b7011ce9d5a45b8d79f4bc5ad7ededca698a2c3ceede24b47"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: ignores clicks after disposal: This test sets up 4 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cf00f64db92a0e75e6b8e820c51accf5c4f102f8955b460fb6b56afd64b5ec"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not reopen the app if disposed while revealing: This test sets up 5 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"8246264957a8010fbe24db24f6cc7597b8ac042eb991c863d4f9d86f11c2bc7a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: uses Notification.isSupported() and \u0060new Notification()\u0060 when not overridden: This test sets up 6 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.test.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c7ad8ef2f11ee283ac46e8ca6c5963489c34047350435a09477ee900eb813f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: bridges lifecycle hooks and NAT events through the app EventBus: This test sets up 6 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 8 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/nat/nat-manager-factory.test.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5039eb0461af76034ddf093bf07b68423f0af70318afd0357fbbd7a59fc97cd1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: CloseCurrentWindow preserves a %s main window on cancel: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"847b6fd58b34625356e3ecd2738c91d30e28c43540d02253c62d6ac173c8c13e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: CloseCurrentWindow emits NavigateTo when navigateMainTo is set: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"880b70f7cd092028bc289467875dbfc47502e328571390194d7bf13010cb58b3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: CloseCurrentWindow does not emit NavigateTo without navigateMainTo: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"08251316fd56560ad726c7f1bfb0ac5538261cf4e8da58f7ecbff1574c5ae3ff"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: registers sender-aware and ordinary IPC wrappers: This test sets up 6 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 16 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34779449e4b668fc9b9c8eb56aff8239e4bf4b139dd0e978680adbfd2f16b6e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: retries an explicitly submitted magnet preference even when already saved: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b3510e4eb4322828f24f17b7882cbe6e4eacf72b5926faab96e32e66f4ce1e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not invoke proxyApplier when proxy unchanged: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ac845ab538ee2d0f1682a02fc05fb553eddc924aea75f0ae2129a84344601e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reasserts every proxy scope when proxy fields changed: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ae2fd0003d319cf0cc58bbbb0f6876135c62866325fa1b18f05a9bb318d764"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: hot-applies a changed default save directory: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cb28fe7d71a8777c3e90982bf7ab9ae2bf4aad87072088d7813fe4117a353b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: saves restart-required settings and publishes a reminder without restarting: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"498de7c9a442e663329abef225e4899c8b63fa183d95bac4975a28cf729dc964"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: hot-applies runtime engine settings without a restart reminder: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bc6e327fe327b1f311e1d59c8a5786dc74e8a2492dff5229cd58d7602943c2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: calls trackerManager.applySourcesChange when sourcesEnabled changes: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4330bb68e5a5aab79d87318947e2a43786c9ad2e4a8e9d6ffc88d414589ad0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: calls trackerManager.applyBlacklistChange when blacklistEnabled changes: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4152d6cd216b0a653f6bdc1b275f830b907698dc1d19c5b4fec18105d01673"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: calls both apply* methods when both toggle in one patch: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd882e4dfd1d799d07973c7d7c2e275de9ad29a401a9b492dd0b502275a15e4f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not call apply* methods when tracker toggles unchanged: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f548059a502de519362cdb7e523f435f8f78f0db1dbd800b72dd8b75420a52ad"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: calls bridgeManager.restart when bridge.fixedPort changes: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e308564b0a1b9a3bed53a88a3b75de75dcb1630996e9ddb305ae2eb808be51"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not call bridgeManager.restart when bridge.fixedPort is unchanged: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"094a2685868e8598f9c6b0a96baaf88f1350c3b30e544decbad1ae128dfc33eb"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reconfigures the updater after the persisted channel changes: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf199a4dc02d789064ddaf480bab1e305a9f32a5fc7f56fa0548a6c58b2a1912"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: looks up isPrivate from motrixDatabase and forwards to syncBtTracker: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2e49e7f51527ccc95d7b4eb6ec84c997e440e1556d6c9d6c13275a122a633e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: blocks public supplementation when private metadata is unknown: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.test.ts"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f875485c3670561663cec8f5afaf4cc26d5b44d4a3b77e206530d58b721182"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rejects $label before invoking the Activity reader: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/queries.test.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"23abd08f86ebb73c2b36a993a4e0df27d4751ee3d1bd96288b10b55ae13520df"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens the destination folder while the %s output is still missing: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/reveal-in-folder.test.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ff988222fad25d0b611f9ced09364c45981b10ba02f2e7bdb62387411f4ebd"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: normalizes a task-owned Windows path: %s: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/reveal-in-folder.test.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ee10151ab3546f316cc30979a3ece588649e3c0b045e8fb2621e13f8836255"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: happy path: changeOption -\u003E getTaskFiles -\u003E replaceTaskFiles -\u003E set -\u003E emit: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/set-selected-files.test.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"23faebb9ec7f11f6fc74e6a9a24b951cc53b5d7d823a63240c4a68fe20c1a066"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: emits a stable update followed by determinate download progress: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/core/development-update-simulator.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"18104ab60f4377e4f22f81fdca0426670037040fd1a7d91b47ed1dac9c403abf"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens About before checking for updates: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/commands/definitions/app.commands.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"728bbb5aab4003092f885e3d3d730585e87dbab7d62abe79a712c1a8920ff6d9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: still opens About but skips the check when updates are %s: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/commands/definitions/app.commands.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aad69916cc0db2bf6f89d1a9804f92d7b976dbcda2ab694e7e6e00a34ab3ca"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: requests a renderer confirmation before clearing records: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/commands/definitions/task.commands.test.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2217e57752d9ca25861f9624882149e2e5379705e8e947a4745a74f4305f329a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: uses the current directory through the registered submit handler without restarting: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/bootstrap-lifecycle.test.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a96f733c73fcc66fd2fd4103bbf5ce37787e982406fbb9c3f04839c400114"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: delivers every task lifecycle event once to each eligible profile: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/bootstrap-lifecycle.test.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0b165a41d795aa45b58efd4f33666e933b57a0850143a3b9e3682e816c90a0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: redacts child bindings and keeps the returned child protected: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/logger.test.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcfbf90c8e20053cd6d0ca91f873ac85147c3cf1d8d3b46138231ddf31dd4bc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: records MetadataReady-to-Downloading after durability and before publication: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.test.ts"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4241074d7bda2000df5266eb2405c48185086418393cbcc23505ea77696293a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: routes FTP to the FTP task type and skips HTTP plugins and probes: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.test.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a3965c7cd630a8416bc0ec66b3970990011d20a3d9da14f5a3dabc2dda850c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: dispatches a download in an existing volume root without trying to create it: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.test.ts"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b7bd2bdf341b79fc173f960a3f999eb8c71750481f149c0e3a4a32ddf929d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: records submission before the first update and completion between rename and durable completion: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.test.ts"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e77aaabc1f26f11931f09f63ca1c4ef132ba0f25b09d675819de53170abf78"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not invoke a post-Hook directly for a preserved output conflict: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 3 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.test.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b582a42a54d3ae24d8873833cb52c334347928f7d460b77a242842db4eb556a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: delivers the occurrence to every registered consumer: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/occurrences/occurrence-dispatcher.test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc699cb52d75e27b05c06c901be49a2082cdde28a297d060a03c50866869ee32"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: renames only the indexed payload and reseeds through the restored final name: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.test.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00f994188ed9688aaf4dc20697ae5442a94e82496775ae2c30ceb4e39f3ab64"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: skips cleanup entirely when getTaskFiles returns no unselected files: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.test.ts"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"500f8a058adca88173d98b8c79bb9af396df360c60cdbc6e8b069f3edc26d1d0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: forces one immediate flush after the fan-out settles: This test sets up 14 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/pause-all-tasks.test.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"91440b255aba0684686943fe22e1c04b3ba341debd76a47897355a443b3acf0f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not force a flush when no task was eligible: This test sets up 14 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/pause-all-tasks.test.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5fdeaeca985bce7e861cbb74fcf4afe5f88b6564e85c5fe157ebb9eedb5de1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: threads errorDetailKey/errorDetailParams from the committed task into recordTransition: This test sets up 9 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"725d00c6c9a15377aeaf46fbad45d3b7d6a2cdb7cf3471291823c3f3d28db098"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: records the accepted transition when polling publishes the same generation first: This test sets up 11 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"62170274e4cab2cbadb3c8367f2b3361f2db5d03a1f5321a915462e0a16716b5"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rejects a stale transition after the public task switches engine generation: This test sets up 11 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"171f1a10f380aece13a009d2006ddd2e3eabd7545f4166fad171108757824512"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: commit into Error writes exactly one occurrence row atomically and dispatches it: This test sets up 11 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6c181b108836f2963487762c965b18ef903a56646d713c4d61e5698ffaad5d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: same-status re-commit (Error\u2192Error) writes no occurrence: This test sets up 11 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"44501959ec68c0c49780db5983791a3f72a373167aefdced7a31acecc7cc414a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a terminal-to-non-terminal transition (re-add) rides the trailing window: This test sets up 10 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e21fbeb63d3997e3d89b22f7c1007813f89fa0e0521fb475aeb70d8709b964f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: re-terminating inside one window still notifies the bridge twice: This test sets up 8 test doubles (for example \u0060vi.fn\u0060) against 6 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727a8519b8b9134a1403ee684c3ab7d212924ee4adafae336179bf3dcb1f0b6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: restores preview piece priority for a lost video-only BT task: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.test.ts"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"0568908ecea9891523ce4866abbc398d7f829c62ea24f31f6909d652d2873a81"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not pause Downloading HTTP task on re-add: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.test.ts"},"region":{"startLine":3178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a57bb56998099670eac0c1ba6a233e1be7c4477d7110f050d321aefdc322a69"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: discovers an inactive registry candidate and activates it on Hook demand: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.test.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17391d1d09a13618a54e093f636c5f9ea5a9fcf4b948e2c125a0a5032af6ad1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: disposes RPC producers and local subscribers idempotently: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.test.ts"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a37f2299e8ff57874170cfa8cc551ca4147df5b9ac6028a6f320cf8d730c82"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: falls back to the system resolver and retries the task once: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/dns-fallback-consumer.test.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ca8ffef8893d16f884a44ee2b3e202bcfcb7bcf3e1c6c34853de5eff72b9dc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reads settings only after the startup gate resolves: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/default-save-dir.test.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98e4032fd315d6aa32e2cba3e9bb4ec25db6ac65fc6be7d81c4498cbf7049cd"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: removes a message listener by identity and leaves the others attached: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/envelope-message-stream.test.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"478dab22f4f0db08e596969c8b36f131f85eb2c05d82eed50165a3b2a54b0ccf"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: supports the two close listeners the reader and writer each register: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 3 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/envelope-message-stream.test.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ccf740d909f33226408a4ac7d3320e817408784adf48a3a27dd4595ab4ef60"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8ae7171d263d9044ba08082946cf66cf8719ce1d3170cd191c5423d0a493dd9"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"165e5e37f2157c5cb5f8dbb0e07c8f9cf66f730c10d9e3b2a3cd6203dc30a159"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/ipc/commands.ts: src/main/ipc/commands.ts changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 184 in commands.buildCommandHandlers at line 314. 24 of those changes were fix/bug commits, and the other 29 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/ipc/commands.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94f33aac9598619128e83d1de1afd2c345eed1d0580aa035e8747ec595a1e2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server/index.ts: src/server/index.ts changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 175 in index.main at line 227. 28 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a42129fc5c892bf074e9a0f9ce098ce64a6d833235de6663a769e9cb92af19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/index.ts: src/main/index.ts changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in index.initializeMainProcess at line 1662. 41 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01f7e33ea8ea1b19932c1b20ee23624099b85b01529b8ffcd8758c77ec4518f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server/ipc/commands.ts: src/server/ipc/commands.ts changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in commands.buildServerCommandHandlers at line 224. 18 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/ipc/commands.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b957a07afc30f1ead00b5c788f421ce3985e995314ff3b6bdee6f769e2d3f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/create-task-handler.ts: src/core/task/create-task-handler.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 147 in create-task-handler.handleCreateTaskUnderAdmission at line 393. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/create-task-handler.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"698a8bbc1163c34c8be03334134de4f39734339399e50efbe18d7c3c982b3c21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/add-task/add-task-form.tsx: src/renderer/components/add-task/add-task-form.tsx changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in add-task-form.AddTaskForm at line 153. 12 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/add-task/add-task-form.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dce5c9582532fa00fa4a22a35b7ccb9296acf8537ea8b976063cda4247349a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/verify-flatpak-packaging.mjs: scripts/verify-flatpak-packaging.mjs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in verify-flatpak-packaging.verifyFlatpakPackaging at line 118. 14 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/verify-flatpak-packaging.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-flatpak-packaging.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e40538aab3a0984d040a0b4e2d0b27b64e549f5c2598af11d301d45f1cd2a59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/session/session-manager.ts: src/core/session/session-manager.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in SessionManager.restore at line 793. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/session/session-manager.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"854497230fbaf34d4077cf3d76fa3bb94016cfec8df4844f39ed9b7e89157c9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/engine/aria2/aria2-adapter.ts: src/core/engine/aria2/aria2-adapter.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Aria2Adapter.addTorrent at line 882. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/aria2/aria2-adapter.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e639d3ba7ea173a435c91d6d802bea16084553fde3398674419f6770ec829ab0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/task-actions-menu.tsx: src/renderer/routes/downloads/task-actions-menu.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in task-actions-menu.TaskActionsMenu at line 106. 5 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/task-actions-menu.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"53348880056e41d222d76a2dde493c7788ca178c687e7ee1437d24275d70f579"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx: src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 210 in web-directory-picker-dialog.PickerSession at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d73cecaa7196eb9100d7a90eb7a11ceb5430d80759dbc842ac3d9e5ee34bd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/media-tools-section.tsx: src/renderer/routes/settings/cards/integration/media-tools-section.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in media-tools-section.MediaToolsSection at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/media-tools-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e2c540aeb20f10d87ff63e5de0294b980f7b57d896ca23cb232619622f3cda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server/http/app.ts: src/server/http/app.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in app.createApp at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/http/app.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/app.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8372dada65993f5a465be55af55c0f74e71d9df30483157587dfd777a5bfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/appearance-dialog.tsx: src/renderer/routes/settings/cards/appearance-dialog.tsx changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in appearance-dialog.AppearanceDialog at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/appearance-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9287a4ed07e5227600d0b26404f10e78e8cf7a04020868e0a43bb3c5b2f8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/engine/engine-supervisor.ts: src/core/engine/engine-supervisor.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in EngineSupervisor.doStart at line 434. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/engine-supervisor.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ed62c94d1cf71889bcbdb1502b3426724d2d04c74a3bfc24418d7613d27946"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/finalize-fs/src/state.rs: packages/finalize-fs/src/state.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in State::dispatch at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/state.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c7fcd062f7cbeb3682b027fe8b1a18ade25bad0c17a31f1bd19c072e8dbed0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/features/legacy-import/legacy-import-dialog.tsx: src/renderer/features/legacy-import/legacy-import-dialog.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 152 in legacy-import-dialog.LegacyImportDialogContent at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/features/legacy-import/legacy-import-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca797223e6c93ac9a0b572868141a1caa37bd3221fae7ea7419e7a77a5d4d682"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/desktop-kit/directory-picker.tsx: src/renderer/components/desktop-kit/directory-picker.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in directory-picker.DirectoryPicker at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/desktop-kit/directory-picker.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f69e601c23c9c33159efed7c67acae7dd173a75fb933ea4260551f14cd6cf3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/media-task-coordinator.ts: src/core/task/media-task-coordinator.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in MediaTaskCoordinator.run at line 237. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/media-task-coordinator.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6756bcbc75e7a06a0e885b499f166dd48aa8a824cdb791dfbc950dc028c7e49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/bridge/index.ts: src/main/bridge/index.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in index.bootstrapBridge at line 412. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/bridge/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"112f623577d9e4c040d83197f24601497c22f38de688f07b4cff1a52a91d95e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/actions/finalize-task.ts: src/core/task/actions/finalize-task.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in finalize-task.finalizeTaskSerialized at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/actions/finalize-task.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb35f2d4cc536039e92617fcc8c8a708da52f3ec8a57459a6793a8e8ed7f608"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/smoke-server-image.mjs: scripts/smoke-server-image.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in smoke-server-image.smokeServerImage at line 928. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/smoke-server-image.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff698e28364551e0e57c286ed8f8350918bc1e8bccd96ef9b3904c49898bb20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/downloads-page.tsx: src/renderer/routes/downloads/downloads-page.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in downloads-page.DownloadsPage at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/downloads-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-page.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7502a07949fbee83b66e10752222271fcca01b7b665298dfffc588ae10ee9adb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/task-inspector-drawer.tsx: src/renderer/routes/downloads/task-inspector-drawer.tsx changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in task-inspector-drawer.TaskInspectorDrawer at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/task-inspector-drawer.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-inspector-drawer.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffb5a83d5b29ebd3ca0daa31a08b4b50936a06f8f27cf575b15ae5785d79edb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/actions/re-add-task.ts: src/core/task/actions/re-add-task.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in re-add-task.buildDirectReAddParams at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/actions/re-add-task.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b622cbe436a6b34ef25c02382ecaf1f8bcdc60dd953f186bc120bf42b0bd2d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/general-dialog.tsx: src/renderer/routes/settings/cards/general-dialog.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in general-dialog.GeneralDialog at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/general-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3165dd68471841d6fbcfafe6dcf1517ff20abcff1ba52d3226ab7586dd0b26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/components/dashboard-grid.tsx: src/renderer/routes/dashboard/components/dashboard-grid.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in dashboard-grid.DashboardGrid at line 849. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/components/dashboard-grid.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78123ec85c6c6b848563da3d570c5c4cc5d1a8cc81737ec34b4f9aa95b8acd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/host/plugin-host.ts: src/core/plugin/host/plugin-host.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in PluginHost.doActivate at line 458. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/host/plugin-host.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c681b32f56dac14fd47894bcc80e1182a1d8717ce8d661e61147706e1b189971"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx: src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in engine-diagnostics-dialog.EngineDiagnosticsDialogHost at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb9f6c6a0ed58f51c26db38015070a1c6a8685bbea4fd92832b75b616d42201"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server/bridge/bootstrap.ts: src/server/bridge/bootstrap.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in bootstrap.bootstrapBridgeForServer at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/bridge/bootstrap.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc20a0e25b6f13254e5dc135c720847213450c6c74948fd5ece3fc84303b8cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/torrent/swap-magnet-metadata-for-bt.ts: src/core/torrent/swap-magnet-metadata-for-bt.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in swap-magnet-metadata-for-bt.swapMagnetMetadataForBtUnderMutation at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/torrent/swap-magnet-metadata-for-bt.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2834f589049b0e78072c4b0ccbb5a21c0ef9d2c8db98913308fa2ff17fd218"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/bridge/web-socket-bridge-server.ts: src/core/bridge/web-socket-bridge-server.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in WebSocketBridgeServer.constructor at line 607. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/bridge/web-socket-bridge-server.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d79e011bf70debda2fcd31c7a08ba3a301ec76f7945530ddf6776e5699055f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/features/application-menu/web-menu-button.tsx: src/renderer/features/application-menu/web-menu-button.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in web-menu-button.WebMenuButton at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/features/application-menu/web-menu-button.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/web-menu-button.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f0872962b7d233d9f74eede84d48b3bcf33c6f2e46efbac2f518aa4291f282"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/advanced-dialog.tsx: src/renderer/routes/settings/cards/advanced-dialog.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in advanced-dialog.AdvancedDialog at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/advanced-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f2180ced1f2615e0b3f3f860ca071d8e6f6007f120629aa6e1ce4bbc4feb64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/finalize/finalize-recovery.ts: src/core/plugin/finalize/finalize-recovery.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in FinalizeRecovery.recover at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/finalize/finalize-recovery.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dbb679c1da38641d31af1d9963ef46e98fce29a049552739d0845ca9382168"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/session/durable-finalize-runtime.ts: src/core/session/durable-finalize-runtime.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in DurableFinalizeRuntime.commit at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/session/durable-finalize-runtime.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/durable-finalize-runtime.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f61c942d6efda07485f5c2e566f3ef1441c4c49beb164dd95d4c4f8920832d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/task-list-panel.tsx: src/renderer/routes/downloads/task-list-panel.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in task-list-panel.TaskListPanel at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/task-list-panel.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-list-panel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c3c6ff968f0df431193514f1fd332dff760d278e87182d3ffde06594e48897"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/window-chrome/window-chrome.tsx: src/renderer/components/window-chrome/window-chrome.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in window-chrome.WindowChrome at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/window-chrome/window-chrome.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/window-chrome.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ceaf4e3e26791e91166db771b7d87b5d25aef011d04f0bbb742e4f2058ffb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/plugins/plugin-install-dialog.tsx: src/renderer/routes/plugins/plugin-install-dialog.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in plugin-install-dialog.PluginInstallSession at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/plugins/plugin-install-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-install-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2208903cef0025a602d589fecbfa4f1531bb6dba110b7ea2a322e50f02613c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/actions/remove-task.ts: src/core/task/actions/remove-task.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in remove-task.removeTaskUnderMutation at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/actions/remove-task.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/remove-task.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"240c1d069223083095cb720f5a914988b612786d2ece4dba22fa59b5875a2cfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/integration-dialog.tsx: src/renderer/routes/settings/cards/integration/integration-dialog.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in integration-dialog.IntegrationDialog at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/integration-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/integration-dialog.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9817f3675025ae6302cf41134a7ea4f9a386b16ad3819d41e07a7ef96dc367a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/plugins/plugin-detail-page.tsx: src/renderer/routes/plugins/plugin-detail-page.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in plugin-detail-page.PluginDetailPage at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/plugins/plugin-detail-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f086b231a25b4f9d6ff7ac3a48a4bf7ee87061e8bd688eb79aa1529df8d98cb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/window/window-manager.ts: src/main/window/window-manager.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WindowManager.recreate at line 238. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/window/window-manager.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de466584395e7b92fba00695bf3abd699bece474e9bf7786c915b5323fcd0c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/tiles/tasks-tile.tsx: src/renderer/routes/dashboard/tiles/tasks-tile.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in tasks-tile.TaskRow at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/tiles/tasks-tile.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd23ecbe736410aa4f4a0fd6ba9d6570b4de82386c6dbc3f027a2ea36fd423a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx: src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in task-inspector-action-bar.TaskInspectorActionBar at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d541d267501d3161b3a0e1c943217a403b6cabb91c14884e36ed1071a07545e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/engine/aria2/aria2-session-identity-recovery.ts: src/core/engine/aria2/aria2-session-identity-recovery.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in aria2-session-identity-recovery.recoverAria2SessionIdentity at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/aria2/aria2-session-identity-recovery.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-session-identity-recovery.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80a3e2a460ff6f83998045aa04680dda4bf3c542d30407933394fde0c77073e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/host/capability-bridge.ts: src/core/plugin/host/capability-bridge.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in CapabilityBridge.dispatchCall at line 615. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/host/capability-bridge.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"858c24182bd5e86eb994a24e107724e8d870ddebf028d63ce3e6b521cd875cab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/inspector/overview-tab.tsx: src/renderer/routes/downloads/inspector/overview-tab.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in overview-tab.OverviewTab at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/inspector/overview-tab.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/overview-tab.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5786f54ba5fe9a039b6145a52ba6ac7acb59995bc7e21b805c94041dc0464fd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layouts/app-layout.tsx: src/renderer/layouts/app-layout.tsx changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in app-layout.AppLayout at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/layouts/app-layout.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layouts/app-layout.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c2666cd1a38ee7a7d54bf1de63a3daaad9ad373a8536986add44bab73125a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/network-dialog.tsx: src/renderer/routes/settings/cards/network-dialog.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in network-dialog.NetworkDialog at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/network-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"748e3dde2c10350c89afe74babdf4a2fb9f226cc49c071a3584fe708255b8e03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/inspector/trackers-tab.tsx: src/renderer/routes/downloads/inspector/trackers-tab.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in trackers-tab.TrackersTab at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/inspector/trackers-tab.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b8438972fc2bbd9549447cc31995e39423a639b03ca866f66a19de2083d6b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/activity/activity-calendar.tsx: src/renderer/routes/dashboard/activity/activity-calendar.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in activity-calendar.ActivityCalendar at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/activity/activity-calendar.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2b616c8744a8d8ebf0cb76a2133bed33cebbfea8355eae185a0a0b0fa143f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/speed-limit-section.tsx: src/renderer/routes/settings/cards/speed-limit-section.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in speed-limit-section.SpeedLimitSection at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/speed-limit-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/speed-limit-section.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfe04cdea4247961d36215a8d45ae4e658f376174ab12bb0e926d208b340604"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/features/plugin-operations/operation-form.tsx: src/renderer/features/plugin-operations/operation-form.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 130 in operation-form.OperationFormContent at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/features/plugin-operations/operation-form.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec49a0b620132502c46e498460caa2d8c818dcdb3bb7dc0e5ac9a674addb24cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/tiles/transfer-tile.tsx: src/renderer/routes/dashboard/tiles/transfer-tile.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in transfer-tile.TransferTile at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/tiles/transfer-tile.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff5cb038092e40e971bd0248366c1a541a1f11d9a64a825b47bae5e92a1e28d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/inspector/use-task-actions.ts: src/renderer/routes/downloads/inspector/use-task-actions.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in use-task-actions.useTaskActions.onRetry at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/inspector/use-task-actions.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"11637cb2f9d630a60cf69bc2238de2709e2d98207f3721783e89cace245af84a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/direct-resource-validator.ts: src/core/task/direct-resource-validator.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in DirectResourceValidatorService.verifyLegacyContent at line 559. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/direct-resource-validator.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d189d5849d82c908194164bafc5ffb053a30ee4bcdd364a50dedc322a79059f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/system-protocols-section.tsx: src/renderer/routes/settings/cards/integration/system-protocols-section.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in system-protocols-section.SystemProtocolsSection at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/system-protocols-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/system-protocols-section.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cdda01cc5a741041d5ecec7ef95d48da2f944a720c6417014a1de40e11afa6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/engine/aria2/aria2-config-builder.ts: src/core/engine/aria2/aria2-config-builder.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Aria2ConfigBuilder.buildArgs at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/aria2/aria2-config-builder.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-config-builder.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f2c396a85983840c4f7b50400c87f99c2c98921503bee3372ecfa7ce6add7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/merge-engine-task.ts: src/core/task/merge-engine-task.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in merge-engine-task.mergeEngineTask at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/merge-engine-task.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/merge-engine-task.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da6da1ad36792d702e743f18297eecee36df89415bae8039db0fb43016c7a44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/torrent/magnet-tracker.ts: src/core/torrent/magnet-tracker.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MagnetTracker.submitUnderAdmission at line 438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/torrent/magnet-tracker.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c10135953db1fd30d77ce56cbe551712e034620dec37d8128ea0eeaa51e579"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/session/finalize-journal-repository.ts: src/core/session/finalize-journal-repository.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in finalize-journal-repository.validateIntents at line 487. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/session/finalize-journal-repository.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dcd3e8cd5800b20fa4e4910dad8e1de676421ba1d076618c0043e46f0dec43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/settings/settings-manager.ts: src/core/settings/settings-manager.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SettingsManager.persistUpdate at line 600. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/settings/settings-manager.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d638bffe742fe1fd6c99dc6432f7817728bc93da7de4490dfe16b5608147dc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/bit-torrent-dialog.tsx: src/renderer/routes/settings/cards/bit-torrent-dialog.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in bit-torrent-dialog.BitTorrentDialog at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/bit-torrent-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebc6a14daa0594d965bf4f1e9365c6bb50d23eec93738ce4e0a403388453ff6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/install/plugin-installer.ts: src/core/plugin/install/plugin-installer.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in PluginInstaller.stage at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/install/plugin-installer.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"734bb22a11ad0a831e26a000acf6e90a1918a7254d3d246648994009960fd09b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/verify-server-package.mjs: scripts/verify-server-package.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in verify-server-package.verifyServerPackage at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/verify-server-package.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-server-package.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5767d006a533e4901d73af635159f429289a8856c7305c688066b1730ea600"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx: src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in use-pair-request-prompts.usePairRequestPrompts at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"02988a40758b692a73f1f77bad21659aeefa98d57438949f3b899f5380d397f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/task-column-header.tsx: src/renderer/routes/downloads/task-column-header.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in task-column-header.TaskColumnHeader at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/task-column-header.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-column-header.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fea21ba1d7ccea277beb2fcfc93bbf14acb89f52961efc9c9ce944b83ca5b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/legacy-import/source-scanner.ts: src/core/legacy-import/source-scanner.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in source-scanner.scanLegacySource at line 288. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/legacy-import/source-scanner.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b20bde42c3b060e53fee0abec5b2f089752124073549d983348d72ff1567507"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx: src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in lifetime-transfer-card.LifetimeTransferCard at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0582ef3f5f0bd37e9b5e99b38ca9e890575531ef485746b94edf1221bba82e30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/window-chrome/motrix-menu-button.tsx: src/renderer/components/window-chrome/motrix-menu-button.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in motrix-menu-button.ElectronMotrixMenuButton at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/window-chrome/motrix-menu-button.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4172645c3608d96a96ffd64787eb16487340b2463705f7d88b819d75434f04ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/tiles/nat-tile.tsx: src/renderer/routes/dashboard/tiles/nat-tile.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in nat-tile.ElectronNatTile at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/tiles/nat-tile.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/nat-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9453a079a038d4f23a2e1464747e4ec3d6ea7b30a51d3ec8cbdc84c8d446dcdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/finalize/finalize-committer.ts: src/core/plugin/finalize/finalize-committer.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in FinalizeCommitter.commitPrepared at line 276. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/finalize/finalize-committer.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e6ca9210ce529209e6b807e3d9eadc1fa43b4cbae30dc3158f5c419ddc1a32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/proxy-section.tsx: src/renderer/routes/settings/cards/proxy-section.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in proxy-section.ProxySection at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/proxy-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/proxy-section.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"087c5bd6c4af625c6200b69e228684edfc1cb0f2d8f23c0fd28a2a288fafc08f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/task-recovery-service.ts: src/core/task/task-recovery-service.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in TaskRecoveryServiceImpl.recover at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/task-recovery-service.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"69191fecda2d33d7fd4d8ae519d2073924f7684cad8b31a899bd84d206a35500"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/finalize/filesystem-adapter.ts: src/core/plugin/finalize/filesystem-adapter.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NativeFinalizeFilesystemAdapter.sendRequest at line 640. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/finalize/filesystem-adapter.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02853a86e3d77c147abaf41d38b955f2fbbf2a5a25a66da1360044de7dd249b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/verify-electron-package.mjs: scripts/verify-electron-package.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in verify-electron-package.verifyElectronPackage at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/verify-electron-package.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-electron-package.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e263c07d499b546181c1c76687fa6505e049f6a690a74756e7986d3d82bb6536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/add-task-dialog/add-task-dialog-host.tsx: src/renderer/components/add-task-dialog/add-task-dialog-host.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in add-task-dialog-host.AddTaskDialogHost at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/add-task-dialog/add-task-dialog-host.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task-dialog/add-task-dialog-host.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cd663b288aab21c227d2c57efcea634c421e7f09f055b3f039d16749ee51e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx: src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in browser-extensions-section.BrowserExtensionsSection at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec64b9c1f246a27b38a0de0ad0e5d4a32cea3caaa5351b4b93325a293844ea4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/finalize/native-artifact-operations.ts: src/core/plugin/finalize/native-artifact-operations.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NativeFinalizeArtifactOperations.removeKnown at line 632. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/finalize/native-artifact-operations.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f44331c599a5c62abf3ce67f99c0e6ce23329171a3a2dd5bcc4dba9c5b4be10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server/http/operator-auth.ts: src/server/http/operator-auth.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in operator-auth.registerOperatorAuth at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/http/operator-auth.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/operator-auth.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34bc495693619c2a948f9888003015f066a6041e5bd1f3d4f593fb942fd2a1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/file-list/file-list.tsx: src/renderer/components/file-list/file-list.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in file-list.FileList at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/file-list/file-list.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/file-list/file-list.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"caae90df2862482269d7de0f6b0e67faf66545dd6dc8d2377e92960925942418"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/task-row.tsx: src/renderer/routes/downloads/task-row.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in task-row.TaskRowBase at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/task-row.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-row.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4011ab931f9803ccee8793bb38d5f3a7016f8f3554b1ee7330a539ed0ec7756"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/tracker/tracker-manager.ts: src/core/tracker/tracker-manager.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in TrackerManager.performSyncAndCurate at line 301. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/tracker/tracker-manager.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c182c82946a3f122781e25c2da63a4311614028cfddae8d0b08db17c2231d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/app-update-section.tsx: src/renderer/routes/settings/cards/app-update-section.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in app-update-section.AppUpdateSection at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/app-update-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/app-update-section.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1f4f11c23aff05e17f871e851d96755f66d155d2fe6f10d3871de85d2ae0b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/legacy-import/session-parser.ts: src/core/legacy-import/session-parser.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in session-parser.parseLegacySession at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/legacy-import/session-parser.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9f11252ca111271cae534d522b508def86afc3afc94b4f28e09a3a9f8865b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/assemble-release-artifacts.mjs: scripts/assemble-release-artifacts.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in assemble-release-artifacts.assembleReleaseArtifacts at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/assemble-release-artifacts.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c30a0b7934479a7c5374b8bfd583ae44eefbe93cb7af94e16dad2f7faba50a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/bt-peer-geo-section.tsx: src/renderer/routes/settings/cards/bt-peer-geo-section.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in bt-peer-geo-section.BtPeerGeoSection at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/bt-peer-geo-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bt-peer-geo-section.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ce78a01ca776c6384fda8fd8584190bfa50f3bb1a5c33aec5093b622c34e35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/download/segment-downloader.ts: src/core/download/segment-downloader.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in SegmentDownloader.run at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/download/segment-downloader.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/download/segment-downloader.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaa105c2491efe04cfd72cfc0236b8166128231961fdf01ca2196a571d6f9a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/downloads/inspector/files-tab.tsx: src/renderer/routes/downloads/inspector/files-tab.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in files-tab.FilesTab at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/inspector/files-tab.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/files-tab.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"04157b5cb11c196c267a84fb9ab1033813c21112cb849966e4be799fcd3b9fd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/plugin-registry.ts: src/core/plugin/plugin-registry.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in PluginRegistry.scanInto at line 503. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/plugin-registry.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cf183802ac4033297f662f01353bdf2f988a17a29c5527f0d0a08fde150d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/platform/tray.ts: src/main/platform/tray.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in tray.setupTray.createTray at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/platform/tray.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1814201bf9b65ab7591bb42293a7e78f85946b09d97f6e888637303a647ec0fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/legacy-import/import-service.ts: src/core/legacy-import/import-service.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in LegacyImportService.scanPreview at line 182. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/legacy-import/import-service.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2b0d2fae0e7bcf67b4ae350d80b978b68a29460c0a4e3c2c449ff0b9414b4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/host/quick-js-worker.ts: src/core/plugin/host/quick-js-worker.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in quick-js-worker.injectPluginApi at line 1536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/host/quick-js-worker.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfbf807245a85160271db88c28247ad38f1f357f8872e1ac9575caa9b3ac2e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/task/bt-storage-service.ts: src/core/task/bt-storage-service.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in BtStorageService.execute at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/bt-storage-service.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2866e2584719776913248ca8b5494392edf902e08c44b79fa29b24382bcc8006"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/compact-limit-input.tsx: src/renderer/routes/settings/cards/compact-limit-input.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in compact-limit-input.CompactLimitInput at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/compact-limit-input.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/compact-limit-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd989630e4cab02037838b731b961189ee63576004566b9d2740af99f830ca7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/features/legacy-import/legacy-fresh-download.tsx: src/renderer/features/legacy-import/legacy-fresh-download.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in legacy-fresh-download.LegacyFreshDownload at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/features/legacy-import/legacy-fresh-download.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-fresh-download.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ed55d413a5826684840f2b20682035cc7ba38a822437ead57d1c5fcb392887"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/plugins/components/plugin-input-group.tsx: src/renderer/routes/plugins/components/plugin-input-group.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in plugin-input-group.PluginInputGroup at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/plugins/components/plugin-input-group.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-input-group.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dbf7d1eaf876604e4afa9c4fca27cd928b8d32989d3e1d379503d63ac59c63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/features/directory-preferences/directory-preferences-section.tsx: src/renderer/features/directory-preferences/directory-preferences-section.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in directory-preferences-section.DirectoryPreferencesSection at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/features/directory-preferences/directory-preferences-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0492f86648d16e2fa07e3f6f2c1bfcb7c1a50d54e1451988bedb55a95d589d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/capabilities/http.ts: src/core/plugin/capabilities/http.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in HttpCapabilityHost.request at line 397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/capabilities/http.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e76a05c27078d68248e587d40e9a5264309a0e03e46331c4651f1725f56d05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/plugins/hooks/use-plugin-install.ts: src/renderer/routes/plugins/hooks/use-plugin-install.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in use-plugin-install.usePluginInstall.startInstall at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/plugins/hooks/use-plugin-install.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd62ca52b1649e0d7641bf14dfe31a4f8a2a5f36b3cba09f5270a65d3898f2f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx: src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in trusted-extensions-section.TrustedExtensionsSection at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b234510fd01c3c25dfbe670de68f13ad6fe49f4a0009a10a92b5560d4397fe9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/engine/aria2/completed-task-startup-guard.ts: src/core/engine/aria2/completed-task-startup-guard.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in CompletedTaskStartupGuard.prepare at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/aria2/completed-task-startup-guard.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"153758102036d6013ab0b4be4107ad3242ebcf9810fb93299e4ee6e499d48a46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/bridge/mbp1/reconnect-session.ts: src/core/bridge/mbp1/reconnect-session.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ReconnectSession.onReconnectResponse at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/bridge/mbp1/reconnect-session.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/reconnect-session.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c836fd322eabfd5e5c366de38d9e1be25f0ddd1b91c00416143174783a60ac7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/verify-update-artifacts.mjs: scripts/verify-update-artifacts.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in verify-update-artifacts.verifyUpdateArtifacts at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/verify-update-artifacts.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-update-artifacts.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa9a496d365d48cef26232ad87a09dbaa1da51a497d243de2a98ee755ded6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/notifications/notifications-page.tsx: src/renderer/routes/notifications/notifications-page.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in notifications-page.NotificationsPage at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/notifications/notifications-page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f39d3c87a00e73939d7810f3202692b13605d3f0b5a71803361b72457f00fab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/lib/transport/http-ws.ts: src/renderer/lib/transport/http-ws.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in HttpWsTransport.connectSocket at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/lib/transport/http-ws.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c157bb8bc0e72928e153fc87b767bc9277c3d1f1940cfd96eaba43c3646c8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/platform/services.ts: src/main/platform/services.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in services.createElectronPlatformServices at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/platform/services.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/services.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f8a9d6e015405fec4fd87189608b7fef8319e809913efe3969e5042990f26f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/plugins/components/builtin-update-dialog.tsx: src/renderer/routes/plugins/components/builtin-update-dialog.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in builtin-update-dialog.BuiltinUpdateDialog at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/plugins/components/builtin-update-dialog.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/builtin-update-dialog.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"334497cb5d500da7f3692cb5013e88099cc2e5500d91bdc98089bad2c25a3ec4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/tiles/engine-tile.tsx: src/renderer/routes/dashboard/tiles/engine-tile.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in engine-tile.EngineTile at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/tiles/engine-tile.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/engine-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"26663491b420ef028f6bd5a9e11a9d5c5cae8c30a08e29f1b1e0e9efed65cd9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/legacy-import/desktop-import.ts: src/main/legacy-import/desktop-import.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in desktop-import.registerLegacyImportIpc at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/legacy-import/desktop-import.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd67f29dd038ca5321e171343ef1d01f408e15479d2e34a3edaf45a2e093bcec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/cli-tool-section.tsx: src/renderer/routes/settings/cards/integration/cli-tool-section.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in cli-tool-section.CliToolSection at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/cli-tool-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/cli-tool-section.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d45418424b78576a10cd696071676ca3e5cf8ec40dc81eab863888105e83984"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/menu/menu-manager.ts: src/main/menu/menu-manager.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MenuManager.executeApplicationMenuItem at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/menu/menu-manager.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/menu-manager.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"133c3c1d2995e864e9cf82833e57fbe4c2ac854724e62296fce07729e837f95d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/add-task/drop-zone.tsx: src/renderer/components/add-task/drop-zone.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in drop-zone.DropZone at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/add-task/drop-zone.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/drop-zone.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"785fb53954198094a29e8e3c0a8ab04b9da232a2b12bd8af38c7f769368457f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/hooks/use-notification-toasts.ts: src/renderer/hooks/use-notification-toasts.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in use-notification-toasts.useNotificationToasts at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/hooks/use-notification-toasts.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-notification-toasts.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"402d3d4feaa20db1fa24c86eaa63114764cc7f79ef0751f5bcbfa3bfea5a1734"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/commands/cross-plugin-invoker.ts: src/core/plugin/commands/cross-plugin-invoker.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in FullCrossPluginInvoker.execute at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/commands/cross-plugin-invoker.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/cross-plugin-invoker.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcd29db53b83ecdc94b44f453dbfbfa5bcab2a956e570bdf6c0e37e1232cd25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/lib/operator-auth.ts: src/renderer/lib/operator-auth.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in operator-auth.refreshOperatorSession at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/lib/operator-auth.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"96df9277ca950b04dc12292e0327cf8c4560e0504fa75ae8a34598a2024073db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx: src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dashboard-tile-frame.DashboardTileFrame at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cb0a3dd0c6a195603be29aca93b492fc9e236fcae109af7354a2c779aa8cb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.tsx: src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in marquee-overlay.MarqueeOverlay at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/marquee-selection/marquee-overlay.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8d4f6d070a116d9dd11ab8337934afca30fd2d0c0db8828f48e0785bc96c6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/dashboard/activity/activity-calendar-model.ts: src/renderer/routes/dashboard/activity/activity-calendar-model.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in activity-calendar-model.selectActivityGeometry at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/dashboard/activity/activity-calendar-model.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"22549fff35dce39ab6739b1c488a8ca7fafb09140fea140ab9edd1b4c1f6c90f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/ffmpeg/verified-install.ts: src/core/ffmpeg/verified-install.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in verified-install.installVerifiedFfmpeg at line 978. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/ffmpeg/verified-install.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3534ceed05792e55fe278709443ed818f59fa6b77e97d2f4343c1dfbbe1d6af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/plugin/ffmpeg-probe-electron.ts: src/main/plugin/ffmpeg-probe-electron.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ffmpeg-probe-electron.makeElectronFfmpegProbe.\u003Creturned closure\u003E at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/plugin/ffmpeg-probe-electron.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-probe-electron.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"719e0422e3c5eb7c7b9dd694bd341e470a78895bebf05fd1f7363d3270fcf04f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/plugin/capabilities/ffmpeg.ts: src/core/plugin/capabilities/ffmpeg.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FfmpegCapabilityHost.run at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/capabilities/ffmpeg.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d0b717c7ef9f3d16053389c132f8b0407a2cd7074aeb8b0a7abe383e5b5843"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/tracker/tracker-prober.ts: src/core/tracker/tracker-prober.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TrackerProber.probeUdp at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/tracker/tracker-prober.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-prober.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fb73c66f9a697b4cd41f537a6bb933a1804065b43e03cd673c6441b41af0df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/components/operator-unlock-gate.tsx: src/renderer/components/operator-unlock-gate.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in operator-unlock-gate.WebGate at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/operator-unlock-gate.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/operator-unlock-gate.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44a8dada90b5949b74e112e46de382435be268c6c9601c5036afe4b93a128f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/use-app-update.ts: src/renderer/routes/settings/cards/use-app-update.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in use-app-update.useAppUpdate at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/use-app-update.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/use-app-update.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aa26a11f1b77dc39d65f278d644fa6998d2183afc3e7af96a957114d5508cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx: src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in appimage-integration-section.AppImageIntegrationSection at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed54ac3d97698538789e4bda4baad9a5886188c1b7945d5cf57e8fba4259f0fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/tracker/tracker-syncer.ts: src/core/tracker/tracker-syncer.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in TrackerSyncer.fetch at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/tracker/tracker-syncer.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-syncer.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ed6e3fcc409bf496f9111aae5712f17de95435035e4aa83d3e6d0ecf4d6568"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/bridge/mbp1/pair-session.ts: src/core/bridge/mbp1/pair-session.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PairSession.onPairHello at line 417. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/bridge/mbp1/pair-session.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e5c1d5345c69ab8f5f6984d23f8af9b80091963ad6c135e9210b9f386967f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/release-snap-build-set.mjs: scripts/release-snap-build-set.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in release-snap-build-set.releaseSnapBuildSet at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/release-snap-build-set.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"859c4f35b003e4171d219ebc630718b4187edced7bb17e4da43a183b16ec5c81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/server/bridge/remote-extension-config.ts: src/server/bridge/remote-extension-config.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in remote-extension-config.parseRemoteExtensionConfig at line 350. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/bridge/remote-extension-config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dfd628ba8c4cde25cc90930fed48aaccef29d40ca8975fa0ffd8ca931e0261"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/routes/plugins/components/inline-consent-panel.tsx: src/renderer/routes/plugins/components/inline-consent-panel.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in inline-consent-panel.InlineConsentPanel at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/plugins/components/inline-consent-panel.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/inline-consent-panel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da0a35edb50c4b2b4498aa572a93a9c7432e64748cbd75c3af05703f12211c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/hooks/use-task-files.ts: src/renderer/hooks/use-task-files.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in use-task-files.useTaskFiles at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/hooks/use-task-files.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-files.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce0a50ecc37f268f0336d3a71fc061b16d66215a66cc10124635d37bca1cb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ensure-electron-runtime.mjs: scripts/ensure-electron-runtime.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ensure-electron-runtime.ensureElectronRuntime at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- scripts/ensure-electron-runtime.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ensure-electron-runtime.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9da510615170654d463463af9599e6379568e91f6bada43ab6f9bc4deeeda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/finalize-fs/src/platform/unix/reserved.rs: packages/finalize-fs/src/platform/unix/reserved.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in motrix_finalize_fs::platform::unix::reserved::reserve_exfat_target at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/platform/unix/reserved.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/reserved.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f3bd0f5d672d706fd6211eb6d90e68d90788012440813b1180880ad9003f7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/bridge-receiver/pipelines/hls-dash-pipeline.ts: src/core/bridge-receiver/pipelines/hls-dash-pipeline.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in HlsDashPipeline.dispatch at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/bridge-receiver/pipelines/hls-dash-pipeline.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/pipelines/hls-dash-pipeline.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd7114883b4e9b505eb7fd62dcfefeb6d70616198e08167b44b25a026cec20e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/protocol.rs: packages/finalize-fs/src/protocol.rs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is motrix_finalize_fs::protocol::read_frame at line 274), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): stabilize Windows suffix renames and recover quarantines (#2512)\u201D; \u201Cfix(downloads): avoid hashing ordinary windows finalization (#2406)\u201D; \u201Cfix(finalize): support cross-platform publication and storage recovery (#2339)\u201D; \u201Cfix(finalize): bound rename retries and report durable completion (#2265)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/protocol.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/protocol.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b9112f5b6c83069db491ecb5bd2894a85cf109b9c89f7e8aba7e38965752ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/engine/aria2/aria2-rpc-client.ts: src/core/engine/aria2/aria2-rpc-client.ts changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Aria2RpcClient.unpause at line 198), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): continue retained http tasks through the engine (#2489)\u201D; \u201Cfix(torrent): support large tasks and streamline detail updates (#2453)\u201D; \u201Cfix: unblock task creation, resume retried downloads, explain long paths (#2194)\u201D; \u201Cfix: stabilize linux ci and improve scrollbar contrast (#2180)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/aria2/aria2-rpc-client.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-rpc-client.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d06fac0d79dd9a581668c21dc25db3d54f00b3870fea115c86d4e729fa2862f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/shared/external-urls.ts: src/shared/external-urls.ts changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is external-urls.getFfmpegManualUrl at line 58), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(server): complete media tools and settings controls (#2497)\u201D; \u201Cfix(updater): serialize installs and guard cross-volume updates (#2433)\u201D; \u201Cfix(ffmpeg): polish verified installation and settings (#2302)\u201D; \u201Cfix(linux): replace login startup switches with manual guidance (#2261)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/shared/external-urls.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/external-urls.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fa17ec1a7d72b2af9c9257a7cba6b10a6b02a25038f5a6fabab49cca167a48"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/platform/windows/mod.rs: packages/finalize-fs/src/platform/windows/mod.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is motrix_finalize_fs::platform::windows::split_absolute_root at line 258), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): stabilize Windows suffix renames and recover quarantines (#2512)\u201D; \u201Cfix(finalize): allow exfat directory roots without file ids (#2330)\u201D; \u201Cfix(finalize): bound rename retries and report durable completion (#2265)\u201D; \u201Cfix(finalize): harden artifact publication across filesystems (#2192)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/platform/windows/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/windows/mod.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0b04b3080bc1fc1046c1c6e89d271d06598ac17737c6ea4cf50a1dd0159e03"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/bridge-receiver/submit-download-adapter.ts: src/core/bridge-receiver/submit-download-adapter.ts changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is SubmitDownloadAdapter.adapt at line 98), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bridge): sanitize browser cookies before engine dispatch (#2469)\u201D; \u201Cfix(bridge): isolate browser extension installations (#2468)\u201D; \u201Cfix(bridge): preserve browser download filenames (#2155)\u201D; \u201Cfix(downloads): validate sources and stabilize url entry (#2154)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/bridge-receiver/submit-download-adapter.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/submit-download-adapter.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcf7d6de01895a6fc2a4f415f18461fd467b15589ea44dfac60202f9af6594e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/engine/aria2/aria2-process-manager.ts: src/core/engine/aria2/aria2-process-manager.ts changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is Aria2ProcessManager.inspectPort at line 277), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): preserve production download diagnostics (#2361)\u201D; \u201Cfix(aria2): harden WebSocket RPC and upgrade engine (#2032)\u201D; \u201Cfix(download): preserve filenames for proxied redirect downloads (#2013)\u201D; \u201Cfix: resolve beta blockers in downloads, RPC, NAT, and proxy (#2002)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/aria2/aria2-process-manager.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-manager.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33aa671411f9d92e24630666099441ed1a2f495fd293d281027e7e13d48a751"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/shared/schemas/engine-settings.ts: src/shared/schemas/engine-settings.ts changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is engine-settings.controlFreeString at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(settings): raise concurrent download limit to 200 (#2460)\u201D; \u201Cfix(settings): clarify validation and connection feedback (#2126)\u201D; \u201Cfix(bt): isolate web seed failures and extend magnet timeout (#2088)\u201D; \u201Cfix(download): preserve filenames for proxied redirect downloads (#2013)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/shared/schemas/engine-settings.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/engine-settings.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f146634d418940b61d7ae300e1b0dda6aeadbe07a56c467ce9cc6e298a38b250"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/components/desktop-kit/panel/panel-shell.tsx: src/renderer/components/desktop-kit/panel/panel-shell.tsx changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is panel-shell.PanelShell at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): keep list rows reachable under the inspector drawer (#2288)\u201D; \u201Cfix(panels): restrict toolbar dragging to compact headers (#2281)\u201D; \u201Cfix(ui): adjust panel header spacing\u201D; \u201Cfix(downloads): refine list, inspector, and menu interactions (#2149)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/desktop-kit/panel/panel-shell.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/panel/panel-shell.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee63f4227633efd0aac603ce563fbfe079afd3769871a300b8e47fb2a89b4776"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/platform/mod.rs: packages/finalize-fs/src/platform/mod.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is motrix_finalize_fs::platform::open_root_for_selection at line 108), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): stabilize Windows suffix renames and recover quarantines (#2512)\u201D; \u201Cfix(finalize): support cross-platform publication and storage recovery (#2339)\u201D; \u201Cfix(finalize): publish completed files safely on NFS (#2179)\u201D; \u201Cfix(finalize): support smb shares and recover failed journals (#2132)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/platform/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce23718ae71545dad1c977cd1ec8e0f541ad4b0a776031f30f0c026dd9d5ffa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/windows/add-task-window.tsx: src/renderer/windows/add-task-window.tsx changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is add-task-window.AddTaskWindow at line 19), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(window): preserve hidden main when cancelling new tasks (#2495)\u201D; \u201Cfix: stabilize browser bridge and FFmpeg media workflow (#2019)\u201D; \u201Cfix(bt): prevent duplicate torrent tasks and path conflicts (#1939)\u201D; \u201Cfix: persist settings and align desktop window controls (#1906)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/windows/add-task-window.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/windows/add-task-window.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e957339adaa677617fc4977816067fc574aa1eda44d834f2646a45b91c870041"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/platform/unix/mod.rs: packages/finalize-fs/src/platform/unix/mod.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is motrix_finalize_fs::platform::unix::open_root at line 75), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): support cross-platform publication and storage recovery (#2339)\u201D; \u201Cfix: stabilize linux ci and improve scrollbar contrast (#2180)\u201D; \u201Cfix(finalize): publish completed files safely on NFS (#2179)\u201D; \u201Cfix(task): repair terminal recovery and large artifact finalization (#2080)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/platform/unix/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd29603f57c972ba00933218ebedbb87dfc5116b06450b8ff788f9332494d8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/engine/aria2/translate.ts: src/core/engine/aria2/translate.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is translate.translateStatus at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(torrent): support large tasks and streamline detail updates (#2453)\u201D; \u201Cfix(engine): open windows paths past MAX_PATH (#2195)\u201D; \u201Cfix: unblock task creation, resume retried downloads, explain long paths (#2194)\u201D; \u201Cfix(bt): persist magnet file metadata (#1937)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/engine/aria2/translate.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/translate.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4843c5caa4805c88f8c1e253bdc1358ed7fdee0f44fd732662899d30f0fcfcd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/ipc/commands/reveal-in-folder.ts: src/main/ipc/commands/reveal-in-folder.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is reveal-in-folder.createRevealInFolderHandler.\u003Creturned closure\u003E at line 46), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): normalize windows task output paths (#2395)\u201D; \u201Cfix(downloads): stabilize task controls and completion display (#2100)\u201D; \u201Cfix(bt): prevent duplicate torrent tasks and path conflicts (#1939)\u201D; \u201Cfix(security): harden supply-chain trust boundaries (#1846)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/ipc/commands/reveal-in-folder.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/reveal-in-folder.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3c60b7e93adecc3e19e0e9f11146225ea447c373ba6036d38eb5d0546df10c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/launcher.ts: src/main/launcher.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is launcher.setupLauncher at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(window): preserve visibility on repeated login launches (#2348)\u201D; \u201Cfix(window): preserve startup activation and restore minimized windows (#2325)\u201D; \u201Cfix(protocol): restore safe motrix deep links and retire mo (#2300)\u201D; \u201Cfix(bridge): restore Windows desktop startup (#2066)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/launcher.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/launcher.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2438c6d3f515e7c19b863f15a378426428873e16b1a1ea22ba56177a4f5a472"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/components/desktop-kit/virtual-list/virtual-list.tsx: src/renderer/components/desktop-kit/virtual-list/virtual-list.tsx changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is virtual-list.VirtualListInner at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): keep scrollbar below the column header (#2323)\u201D; \u201Cfix(downloads): keep list rows reachable under the inspector drawer (#2288)\u201D; \u201Cfix(downloads): refine list, inspector, and menu interactions (#2149)\u201D; \u201Cfix(downloads): stabilize task controls and completion display (#2100)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/components/desktop-kit/virtual-list/virtual-list.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/virtual-list/virtual-list.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e887326ad889c660b982a761a0f2ead3a2b925ce335ce31310fc05ab46b65a65"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/platform/windows/metadata.rs: packages/finalize-fs/src/platform/windows/metadata.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is motrix_finalize_fs::platform::windows::metadata::directory_names at line 296), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): stabilize Windows suffix renames and recover quarantines (#2512)\u201D; \u201Cfix(finalize): allow exfat directory roots without file ids (#2330)\u201D; \u201Cfix(finalize): bound rename retries and report durable completion (#2265)\u201D; \u201Cfix(finalize): support smb shares and recover failed journals (#2132)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/platform/windows/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/windows/metadata.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8769f8076f6b06240eb0e1f0a6a41e1fadc9169f83ae3935ae1969f933af3359"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/routes/downloads/columns.ts: src/renderer/routes/downloads/columns.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is columns.clampColumnWidth at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): clarify active task connection counts (#2480)\u201D; \u201Cfix(downloads): restore checkboxes for touch-friendly selection (#2381)\u201D; \u201Cfix(ui): polish dashboard metrics, tray speeds and download labels (#2175)\u201D; \u201Cfix(downloads): refine list, inspector, and menu interactions (#2149)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/columns.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/columns.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"213574ad62ddfa9765df023f53728018ad10fa8540bbc1e21b899f66e7cb9f97"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/window/platform-options.ts: src/main/window/platform-options.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is platform-options.buildPlatformOptions at line 25), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(window): align startup themes and fullscreen chrome (#2057)\u201D; \u201Cfix: persist settings and align desktop window controls (#1906)\u201D; \u201Cfix: sync and align window controls (#1894)\u201D; \u201Cfix: improve window controls and refresh dependencies (#1886)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/window/platform-options.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/platform-options.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85fa4a60dee06643f6c68f85b79d8173c1f93772a940cbf440ad53d2a24a078"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/shared/schemas/proxy-settings.ts: src/shared/schemas/proxy-settings.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is proxy-settings.isProxyHost at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plugins): apply dedicated proxy scope to plugin networking (#2360)\u201D; \u201Cfix(settings): clarify validation and connection feedback (#2126)\u201D; \u201Cfix(download): preserve filenames for proxied redirect downloads (#2013)\u201D; \u201Cfix: resolve beta blockers in downloads, RPC, NAT, and proxy (#2002)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/shared/schemas/proxy-settings.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/proxy-settings.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb83d0ebb1ce6f094e696bfaae192a0b27cf9421a8285c0ee627ad8115bac3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/shared/schemas/direct-replay-recipe.ts: src/shared/schemas/direct-replay-recipe.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is direct-replay-recipe.directReplayV1Schema at line 69), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): continue retained http tasks through the engine (#2489)\u201D; \u201Cfix(task): validate http resume metadata and report failures (#2430)\u201D; \u201Cfix(bridge): submit task cookies with aria2 motrix.13 (#2073)\u201D; \u201Cfix(download): preserve filenames for proxied redirect downloads (#2013)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/shared/schemas/direct-replay-recipe.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/direct-replay-recipe.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f380e2ce06d8993b502a63dd48640c51cadf6b06f0b56534ffd834bfd6f94f59"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/bridge-receiver/pipelines/direct-pipeline.ts: src/core/bridge-receiver/pipelines/direct-pipeline.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is DirectPipeline.dispatch at line 34), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bridge): sanitize browser cookies before engine dispatch (#2469)\u201D; \u201Cfix(bridge): preserve browser download filenames (#2155)\u201D; \u201Cfix(bridge): submit task cookies with aria2 motrix.13 (#2073)\u201D; \u201Cfix: address desktop onboarding, bridge, and installer issues (#2062)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/bridge-receiver/pipelines/direct-pipeline.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/pipelines/direct-pipeline.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc41c0d4299043662a910adb6586f166f75cfaad55a368ea827a34a468708764"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/error.rs: packages/finalize-fs/src/error.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is motrix_finalize_fs::error::classify_error at line 3), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): support cross-platform publication and storage recovery (#2339)\u201D; \u201Cfix(finalize): bound rename retries and report durable completion (#2265)\u201D; \u201Cfix(finalize): publish completed files safely on NFS (#2179)\u201D; \u201Cfix(finalize): support smb shares and recover failed journals (#2132)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/error.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad285650023026cdaf8efc2a2fbad9c5909c130707bbacf0992ca232624386"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/platform/unix/rename.rs: packages/finalize-fs/src/platform/unix/rename.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is motrix_finalize_fs::platform::unix::rename::rename_opened_no_replace at line 10), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): bound rename retries and report durable completion (#2265)\u201D; \u201Cfix(finalize): harden artifact publication across filesystems (#2192)\u201D; \u201Cfix(finalize): publish completed files safely on NFS (#2179)\u201D; \u201Cfix(task): repair terminal recovery and large artifact finalization (#2080)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/platform/unix/rename.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/rename.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb1469b5508683948b97b15aede94e24117004678a3fb9370741970256e512f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/server/http/events.ts: src/server/http/events.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is events.bindEventBroadcaster.broadcast at line 30), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(server): complete media tools and settings controls (#2497)\u201D; \u201Cfix(server): allow terminal extension pairing without web url (#2400)\u201D; \u201Cfix(web): recover task updates and preserve magnet file selection (#2167)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/http/events.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/events.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c224db24de0f9f2223703b228508743b7bb1bf9e4d96f111976479146205df1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/test-utils/aria2.ts: src/test-utils/aria2.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is aria2.waitForRpc at line 198), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): upgrade aria2 for durable task cookies (#2074)\u201D; \u201Cfix(bridge): submit task cookies with aria2 motrix.13 (#2073)\u201D; \u201Cfix(aria2): harden WebSocket RPC and upgrade engine (#2032)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/test-utils/aria2.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test-utils/aria2.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9b90aad62d50bf8ecf06c92ab9c82d7a0d7475216661549a4200f8c7286431"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/main/core/update-manager.ts: src/main/core/update-manager.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is UpdateManager.consumeUpdaterEvent at line 242), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(server): complete media tools and settings controls (#2497)\u201D; \u201Cfix(updater): serialize installs and guard cross-volume updates (#2433)\u201D; \u201Cfix(updater): make update flow reliable (#1890)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/main/core/update-manager.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/core/update-manager.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeabe98340a697e11454a75b0d5d41a20c854121ff1a55d659a3c98ac2c5786"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/plugin/capabilities/ffmpeg-detect.ts: src/core/plugin/capabilities/ffmpeg-detect.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ffmpeg-detect.probeBinary at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ffmpeg): verify legacy macos binaries against signed releases (#2496)\u201D; \u201Cfix(ffmpeg): polish verified installation and settings (#2302)\u201D; \u201Cfix: stabilize browser bridge and FFmpeg media workflow (#2019)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/capabilities/ffmpeg-detect.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg-detect.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf4430ffc70a23ded706039a0fad367364e8148ef9ee3a9a52e7d54b53f470"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/lib/transport/electron.ts: src/renderer/lib/transport/electron.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ElectronTransport.invoke at line 26), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: use uuid v7 for browser-safe request and task ids (#2446)\u201D; \u201Cfix(plugins): preserve diagnostics and dispose bridge subscriptions (#2380)\u201D; \u201Cfix(downloads): explain file opening failures (#2370)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/lib/transport/electron.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/electron.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41405a2475b984c539b5a6caa9ccd23c36eef172380bc0c9b289f7d35d1b6b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/routes/downloads/empty-tasks.tsx: src/renderer/routes/downloads/empty-tasks.tsx changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is empty-tasks.EmptyTasks at line 38), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): restrict glass to macos and defer empty animations (#2442)\u201D; \u201Cfix(settings): synchronize saved preferences without websocket (#2204)\u201D; \u201Cfix: resolve beta blockers in downloads, RPC, NAT, and proxy (#2002)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/empty-tasks.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/empty-tasks.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9542d0d154e52c766b417859a806a710bdd64c33da58dc4f9f64e7a6cdad8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/preload/preload.ts: src/preload/preload.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is preload.assertEventChannel at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plugins): preserve diagnostics and dispose bridge subscriptions (#2380)\u201D; \u201Cfix(window): refine Windows caption controls (#1935)\u201D; \u201Cfix(security): harden supply-chain trust boundaries (#1846)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/preload/preload.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preload/preload.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d052ed3c2f01577183e6b3e27a8d60822d4829d73d7748e6570a4edcd775ce4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/plugin/install/github-fetcher.ts: src/core/plugin/install/github-fetcher.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is github-fetcher.downloadGithubMoext at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plugins): apply dedicated proxy scope to plugin networking (#2360)\u201D; \u201Cfix(download): preserve filenames for proxied redirect downloads (#2013)\u201D; \u201Cfix(security): harden supply-chain trust boundaries (#1846)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/install/github-fetcher.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/github-fetcher.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2381ce502e385395a1dc2b54993274a94abe13cc91cc54e6ae1b5b3c174c8c7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/server/plugin/install-service.ts: src/server/plugin/install-service.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ServerPluginInstallService.materialize at line 107), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(plugins): apply dedicated proxy scope to plugin networking (#2360)\u201D; \u201Cfix(download): preserve filenames for proxied redirect downloads (#2013)\u201D; \u201Cfix(security): harden supply-chain trust boundaries (#1846)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/server/plugin/install-service.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/plugin/install-service.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d399ecf054a493fdfb2c9d4dd8989cd888938cf575a6d9aadb82513a004f6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/task/direct-replay-recipe.ts: src/core/task/direct-replay-recipe.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is direct-replay-recipe.buildDirectReplayRecipe at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): continue retained http tasks through the engine (#2489)\u201D; \u201Cfix(bridge): submit task cookies with aria2 motrix.13 (#2073)\u201D; \u201Cfix(download): preserve filenames for proxied redirect downloads (#2013)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/task/direct-replay-recipe.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-replay-recipe.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d260f7d637ec28a78c64316165aa8ffd3aeaa1c8303b343103587c9c6cfd405a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/routes/downloads/task-column-values.ts: src/renderer/routes/downloads/task-column-values.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is task-column-values.isTaskSpeedApplicable at line 8), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): clarify active task connection counts (#2480)\u201D; \u201Cfix(downloads): distinguish unavailable task metrics (#2275)\u201D; \u201Cfix(media): calculate progress across the full segment plan (#2158)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/routes/downloads/task-column-values.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-column-values.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"de173f1a5226d242a0688646413e386e2b64dffc6b60e2bb173999dc2d899a86"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/plugin/finalize/artifact-identity.ts: src/core/plugin/finalize/artifact-identity.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is artifact-identity.artifactIdentityEquals at line 391), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): avoid hashing ordinary windows finalization (#2406)\u201D; \u201Cfix(finalize): support smb shares and recover failed journals (#2132)\u201D; \u201Cfix(task): repair terminal recovery and large artifact finalization (#2080)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/finalize/artifact-identity.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/artifact-identity.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba1a20ce137f2444f3947ce91f3703865d9e759531605c51f77c72f8efbb8a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/plugin/finalize/hook-plan.ts: src/core/plugin/finalize/hook-plan.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is hook-plan.isOrdinarySuffixRemoval at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(downloads): avoid hashing ordinary windows finalization (#2406)\u201D; \u201Cfix(finalize): support cross-platform publication and storage recovery (#2339)\u201D; \u201Cfix(task): recover interrupted download finalization (#2115)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/core/plugin/finalize/hook-plan.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/hook-plan.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce741b1933c0f9c6333b8b319908078d4dd3e488a8dad27adaf61079c1fa7212"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/hooks/use-engine-restart-required-toast.ts: src/renderer/hooks/use-engine-restart-required-toast.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is use-engine-restart-required-toast.useEngineRestartRequiredToast at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(renderer): stabilize engine restart reminder subscriptions (#2385)\u201D; \u201Cfix(settings): synchronize saved preferences without websocket (#2204)\u201D; \u201Cfix: resolve beta blockers in downloads, RPC, NAT, and proxy (#2002)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- src/renderer/hooks/use-engine-restart-required-toast.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-restart-required-toast.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0e4e452557757ea0464ab5c2179608c47aa2b4e6798a61497bf0f39f6fe131"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/finalize-fs/src/platform/windows/copy.rs: packages/finalize-fs/src/platform/windows/copy.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is motrix_finalize_fs::platform::windows::copy::materialize at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(finalize): harden artifact publication across filesystems (#2192)\u201D; \u201Cfix(finalize): support smb shares and recover failed journals (#2132)\u201D; \u201Cfix(task): repair terminal recovery and large artifact finalization (#2080)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 00:31:54 \u002B08:00\u0027 --until=\u00272026-11-10 00:31:54 \u002B08:00\u0027 --full-history --no-merges -- packages/finalize-fs/src/platform/windows/copy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/windows/copy.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe72104ee678bf68380c6372cbe71c37f547505b546a4f48ba392b58e690c40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Task 22: wire settingsManager.snapshot()?.plugins?.[pluginId] ?? {} \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c064e117dea79f91d2365bbbdd88d07f7c8537a0c746074850f80c5846f298de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Plan F: derive from manifest contributes.configuration schema \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dc6e9d3d17e6d1fdca0aa554d99861cc43e8bde9b8068293c7dc7080e9e4a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // converges. TODO(follow-up): also reconcile immediately when the setting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c2d41863e5de40a23a4d9aad0bed0cd07d7cd34a2f97f33ed73bae7aa73903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u2500\u2500 11. TODO: chain failure \u2192 no DB write (requires HookOrchestrator T12) \u2500 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.phase.test.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e64dcd2bd8caf2f69d818c8cd22d11368d446b1c99ae9fc99e9491646f85cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Plan G): proper Uint8Array marshaling via QuickJS typed-array API. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14f4a4daf436e942440f04b5a560bc9bbffc41c49f1724a78fdb20d4fe822d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Plan C): implement streaming reader protocol via opId round-trips. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"da795df960db9264eacfda0e144ead089592a7d79f70d7ec5a92c7726c6341f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Plan C): bridge will return {opId} once context wiring is done. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"957e4dcd5b985bb57578e4b17f0042902d9aa60cc8e2ea0814057f3569d8182c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Plan C): upgrade to AsyncIterable progress if needed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6453513ce3e3d07b8bd86dfa924f1e5d0942692df8e5b7438791614959dabf"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060package.json\u0060 makes this repository a deployable product (line 20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set up resolveToMux to return a mux pair\u0022 repeats the code it sits on: 4 of its 5 words (set, resolve, mux, return) are already in \u0060const resolveToMux = vi.fn(async (_url: string) =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/bridge-receiver.test.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaba5bb4b95c1d6fd1e9cb77f4f25fec769e90349c3ac73b7ec7dcd7013bed8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022An audio media playlist\u0022 repeats the code it sits on: 3 of its 3 words (audio, media, playlist) are already in \u0060const AUDIO_MEDIA = \u0060#EXTM3U\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/pipelines/hls-dash-pipeline.test.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5d36997ed376ea8f52f90284ed77ef38bd7e26d77455cc816c841e30fb6cf7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 SegmentList (with mediaRange \u002B Initialization) \u2500\u2500\u0022 repeats the code it sits on: 5 of its 5 words (segment, list, media, range, initialization) are already in \u0060const SEGLIST_MPD = \u0060\u003C?xml version=\u00221.0\u0022?\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/dash-parser.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aa8048d5b5dc8e0fc5b7b1d2d9cb02e70e0dabfed6375ef2fda369ddb65ce4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 No video representations \u2500\u2500\u0022 repeats the code it sits on: 3 of its 3 words (no, video, representations) are already in \u0060const NO_VIDEO_MPD = \u0060\u003C?xml version=\u00221.0\u0022?\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/dash-parser.test.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff3aaedf02c9f9618413f8dc34770623a53df87466baf8eb7e7425705a7ed6e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022VOD with fMP4 via EXT-X-MAP\u0022 repeats the code it sits on: 4 of its 4 words (vod, mp, ext, map) are already in \u0060const MEDIA_VOD_FMP4 = \u0060#EXTM3U\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/hls-parser.test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"82efec5b79589f27cd966ff20df7367f6a0dd2e3d0cd78b5650d0fdc58efbd43"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Call getKey twice with the same URI\u0022 repeats the code it sits on: 4 of its 5 words (call, get, key, uri) are already in \u0060const result1 = await decryptor.getKey(uri)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/segment-decryptor.test.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d85150c779740c9a670f781c2083ca220b1e5111fb3c918771b188ef1dbe1b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 6 comments in this file only repeat the code they sit on (lines 74, 86, 193, 217, 234, 240), for example \u0022Max-Age overrides Expires\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.test.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"713a1a51753e29a87531f6f8e46a1ba65ccf9998e9a28fd4d156a6d64d7433d0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022AppError.code = ErrorCode.PluginRuntimeFault = \u0027PLUGIN_RUNTIME_FAULT\u0027\u0022 repeats the code it sits on: 5 of its 6 words (error, code, plugin, runtime, fault) are already in \u0060expect(resp.error.code).toBe(\u0027PLUGIN_RUNTIME_FAULT\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.phase.test.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de8cfaf4290fc5b63ce7852b8e0780fd12758a03daebea4ee5e847f3ca277a0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022sourceUrlEquals\u0022 repeats the code it sits on: 3 of its 3 words (source, url, equals) are already in \u0060it(\u0027sourceUrlEquals compares exact url strings\u0027, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/source-resolver.test.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0a737a3857badfc458d3d027646cd85c474558359d35fc1a8426c823454798"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get-Volume output format: FileSystemType DriveType SizeRemaining\u0022 repeats the code it sits on: 9 of its 10 words (get, volume, format, file, system, type, drive, size, remaining) are already in \u0060const volumeOut = await exec(\u0027powershell\u0027, [\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/probe/disk-probe-win32.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d41890326cfeee7f43ea8cf010cbe48d3b5aa11db96265b2f804551d3b751c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022First: poll detects Downloading -\u003E Error.\u0022 repeats the code it sits on: 4 of its 5 words (first, poll, downloading, error) are already in \u0060const first = await commitPolledTerminalTransition(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.test.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd3e5723a47255e3d444d20ff8a68451a593e51820038c8971340a1f8f0ef6b"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 5.0/10. The most over is \u0060(repository root)\u0060 (248811 LoC, 2645 module-visible types across 161 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e1ebad58e2866fcbada2f91ab1905a0b4f2e5badda8b209b94c1b41a787d538"},"properties":{"commitSha":"0217d3b275eaf4bc43b956883a917922217d91dc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e21bb7c31badc98a1304334d878c6588ebb8df4681dab6eb6351ffda3071e157"},"properties":{"commitSha":"46c887749de497bda0f02d8ff266038bdd8ae9b4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1da0fa7743e95d875dbbec0e38ec0fef805290190e0448538fcaa3be551294b"},"properties":{"commitSha":"0217d3b275eaf4bc43b956883a917922217d91dc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6a503b8b7bb50dc9ce5c8286ad7af5f09d01cebdf4a906b04cdb3ba9c4c5f91"},"properties":{"commitSha":"0217d3b275eaf4bc43b956883a917922217d91dc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"223922b61ef87b4a176911a9c6d5de1aeed042950f827a47aa257fdba3c7b479"},"properties":{"commitSha":"46c887749de497bda0f02d8ff266038bdd8ae9b4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70f254184396f5ddb513a22a4b370b6aea7bfc34f28bce375d5f5983ace7e670"},"properties":{"commitSha":"0217d3b275eaf4bc43b956883a917922217d91dc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95ea29201e0d3f3087e3374fe573c2e31def1bc67ffdfdbc7eacc28f3fdd4219"},"properties":{"commitSha":"46c887749de497bda0f02d8ff266038bdd8ae9b4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47380fdafa5d49b8501d612b3ad722b15503a95d87ee215210d44b11596dbaa5"},"properties":{"commitSha":"0217d3b275eaf4bc43b956883a917922217d91dc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e61f0da8c704f21670ad971400e3b69cd7f390ddf997e2c660a9412defb20ca1"},"properties":{"commitSha":"bdd5e56c2a9ea92ec6da71dd9ec2e98c8f932cfa"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0c74ed0f32f0300f12dc062aa920f448722892a0a02fbac6295d130abd8f47d"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d597b4f53389db40b9f868bbb0f72b85f13cf611c02d016ba72af15eb471e5cb"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"311fdca035dcb3e5f6c00db3367a8dc115ab7b8f4a316f080ff037cf6fa04b8c"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff572456232ca6ff708a31d778a0d626f756d6ec844fa6d1379c1e03d2fd54d3"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90686aa0043d63443811a960123af78ebc65f07ce69421a97924f88868786900"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"668e8319680528509d20afd3c1ba986fe9cfee0c7da9e9383e485473edc11564"},"taxa":[{"id":"CWE-1321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2384ae348cac17b09e2cbdfe0c5e209508113ce9d828d77f72a1e3ab38839d59"},"taxa":[{"id":"CWE-1321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5d25704ba8aa26e3214d6d4e990a61584527763d45484e5eda81101e32687a9"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd4b63eb00615a16a3634f65abe89789f45fec0310836d05a1bcb51a40d93105"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2760077c42de7fa2b1c786434999d50178fe7209fb70ccd76a686d6428af0bc9"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfee83c5250cf298bee17451264d1d46d3fed8d6d93e92cab25ce3e286f64d9d"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ca7c6a2e79d288975cd55db0c7e875199c32c35503fc1e65b45e5ef685d90bb"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe3d7fc666aa85aecedb0a01517662eaf59171d80248da632226bdc5f63f972d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51a244c585e42905f4439cc452a55d6570fbd549bfe24c237fcab43d71e808bb"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15d6b2080f07e14ff2d4325c8894765d34d184702550265edf924a10c096a6e4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ac294cf7771ebc67a6219b8fa972c41ae78c5e9494a134740add16bfac79ccf"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e842e1bf4a1e326790720a1dc61460032e55ebf083527b173f7b292d605db02"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8498c1615df231e6916bc137df82e57ec9827c1063aa34985906a17d0f31b535"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"072d57ada905bc9d872a8ed6c7cb6f07b5a9fe6d69612cdc5c598f7e6a8429a2"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2456f43396dcb286ac01dee13ae89910e0336ed443a9f295fe9890bc040cd06"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2adfb671f0c070da270b65767142e7664d640a667ae98be350ec88e1bb0039a0"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04a952146d087cb172fdf6f55a1d5081548f07830efe4a7273c89f121268e92d"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f63b6a6c106616af589e7ee164c491ae6bca132f0872ad5825ad15e54ea77b7b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"790027910c8c521ff2df36ea394b59cffe570a9f34798754f66eb7f61a014983"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9106cf147028515078d21968ad8606d73fc26ea0820791b8a79e1b2c4af122b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cf469eb8d41426bb6a888744d92ca72fbf8e8685d62ab8e2eb2e8a7407c6179"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"004bd757ade60fd0c8181686abeea1db9d63a47598fba20426731025511f02ef"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a2cd4781afc37e2c763a7b022d7dbf081e9a3757a49e73707d82ca5469b29b9"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e860ebc848d4174323a1f1b5ae5ee419eaa837f69512f6551fecd4bda589fd6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7416935a6422fc483a9d078b005a9eedff9a8c515faceb2244694ac36ed997d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aba0a5f9d81dcf4896e494d210c001422baf3b6e05570f49948409a078381f28"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5fea4f0caab9bf0764412e6b62f61d3345655bf209835276e2c07a51764433a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cac32911c32dc72f69011689e65575476dbf863836d5f8fcc004918bda67d982"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44a5d6861daf75427dde4cc0941d44445db069c0aabf3a635091df8946191b34"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bf344d1a3894cce5e25f260968630ab4ed59ace04bff36a7ec5a3fb0aec71a0"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb2696e2b6a1d8f8257cd9666674eddcc3ed2beab46b258198bec78aba9b237e"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c32775dc91fe60319e4bc74e4a99ba667073c6d82be44808978af75b79e46263"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54f50c2bc964039425493c90db28bb7dca68ad2c37a570ff7cf6237fd1b42392"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fac696bae9ea163fcd9d123a62716cd3be4c6cffb3b5267662216698c391996a"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ad950bd4750efcaf4787760e498a6ff2d673d002f81e8a017586835a83b2a87"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b13b3d362f31d0bc60043596996194ffe092b10002e64d8a9f247340ef154db"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bff93e96f3d1f14f0e5b70b764b2ad953d7fdb2973b670ff173049d343720cf4"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b02feeb98d24cbeecf57bef807e3e2bc37eaa1813e622b6f922811d2f20b046"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d4ca5de4222b1ef62d302f564d6cff120a58690f98138a75ba5e1ea25630550"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7dec808e644696cd58890cf634928c1479f74d6037a1a16730c5445d8dac9de1"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc086bba00b5f298929367cb5c5fd39c0507e6dae89686cc3f69997e49a41f9d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d762c439a4f9309c775efbf49e5d53d5cad1db901ec90229aeb9b4103336209e"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e0a1c96af31ceae8cf8f6fb6aecfb573ccb145dd3054e889d92f6428266ada2"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"efa850cff1f2217eca0dfe76c64e2e0886614b6ab7457b88b49c226c75b42823"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"903eed16808f8918ee8bb7786dae9415d6728a32c0e3fa61849ff64d8e149c72"},"taxa":[{"id":"CWE-444","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"592e441883ec67ed1cbef779d47dd95547c4f0e9481cb3cc7a8480d1d3f89a72"},"taxa":[{"id":"CWE-444","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b3a445e13a92685d308145cdf7eed611362dada908404992a93365353bd8796"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3bac0b956cc7625db5ffaa04443fc36030c2af44043a6f2dfd365abaf694f40"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f0e25f5043cf62eebe19b8bc6c5720079d3f23e4fd644df5f6587f0c96e9743"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcb32ba14f6d4f43187777545d256b34e3bbb721312e9efe07f03ffa0ad9618b"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75dc020e0eb1d114f0beb713f1e8b7df0439833c2e1080ba2f95edb6c01b87f1"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a861b1ab2fd6ac5a0cbbd2d1eaeca38914dcada77f7a5d62bbdd015efb9e974e"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97320539b2f4beb399d2501c9b5b75263d6df167d884e802292fa8907d63e208"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d4c60e7711abd8e081be65e2957bbab6f699f0998bffb8780098e01812ffef3"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf109603d3ba06ccbc70e17caafbc5404e762f7bb10dd903a9c474143303ca36"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f93ce9d1496f67b45782c372e23a0af814447ef7f69bd31dedae0f16d566a1c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/cubic-glass-gradient.tsx"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b298df09dc48e5c4f17ebebccf5ec88e4b33d8cff416f65036fa16d347b52847"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/panel/panel-shell.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f929a64cc96acaaa18b0731b119b71038e963adcaf2501f760d319d62df199"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/operator-unlock-gate.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"716655639989a04113508685b99c183e2071e41496dbfe9ce4a30bb6658852ed"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/settings-kit/plugin-config-field.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e640cdc9bdb74dc5d078c34c84027a8cb790b091691c472d80094247375f24"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CPasswordInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/settings-kit/plugin-config-field.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f9cee4a3d4bbec85ae01405b31cf2ef8ededeb5c38f494f5122dee85e60669"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CNumberInput\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/settings-kit/plugin-config-field.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"86424fe356703e10d659734f6ad1b6b51a29bf35f1db73e358108842d9bf10ef"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CInput\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/settings-kit/plugin-config-field.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c71689921905659b61ebd4aefd6b84c732a8d70e3f7db1c240103990752d42"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSlider\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf721ae0677abfe4430d0b1119946f2075bc341feb3d612571403d631ac610f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc4dbb39189f40c8234e387085ea6a43e7cb73084d7f247c854a0883c1c31d4"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CInputGroupTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-input-group.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"775437df7caefb7e135d3993bb239fa0fe1183f5b3aa4adf92a0cebc434d5bb8"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d621a447215da826c6e82976f9c3da846ddf1eb7a3617a7248f0d82fb2b746a3"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba16a0ce5ce696ec2fff6839fb4ec28184e1ba1eb7dacb056d5fe9a6bb64cacc"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9a95262a88b06e8d812e16796c9ab4f093e6983fb98a2fb817b2c80e275510"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/downloads-dialog.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9661a53ffcb7a9fe42197c35ee940cd03933abf76c4df6cedbd8635404a3d96f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffd9e7023efce5fc151153a677f8581fc1b4cc2f099fa2ed411c04afd4d44c9"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/integration-dialog.tsx"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"af904c6370c999f5fad4f113bf560f0cce1ec68271145b5ae970854ac6554b7a"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"120deab83d88a1889cccb45683e581b93fbd84445f6ae759a0afadd8a1eec22c"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b15a8d963a848d033ceee7c5a4b3b535edaf6bde13114447a5abfffa1cb258"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cb48117a6c5637d776fd2fcf97b96dfbeb0aacbc41a9edfe9f490fdfcf7a31"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CComboboxChipsInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/tracker-source-combobox.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81a64027d510f22fdf43fb5a1139ddaa6b20318e9aa6fcccbaf0f23c0928381"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/tracker-source-combobox.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52c662dbf49a4057917b7b5be7b9d3277305d6c92e6e9484dacb1dd4c7802fd"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003COnboardingLanguageSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/windows/onboarding-window.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"590a19904b4faa56d29e4ccff4a8a8feb04d15df9810f7b5a1964adcd1cfab57"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/inspector-drawer.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"640e412fd851060ecf19190621430f96af0b3a96b633695e50ebc42e7f11c8a2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/input.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17f3a1824fab2d54d990580a537b1619e162e592e1d2f07fbf96f78fd3bc610"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/native-select.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a13e3cb8bae02965f224c1a443dbd61065d6c3fe63bf4a1078cf9ecc13435"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/textarea.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4de81e041e553c7abadfcd662f151a4febe4ab56dc565d9bf5c825c91603785"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-list-panel.tsx"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"702caadc51c415fb37bb18995a45235a608a4e32d3f45eab3ab6ae9be37009e5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.drawer-slide-in\u0060 moves (\u0060animation: drawer-slide-in-from-bottom 300ms cubic-bezier(0.32, 0.72, 0, 1)\n    both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/styles/globals.css"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cf53599dc7055ff0289442d87b03ba5635ad751543c1eb68530c0491189bb6"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: EngineAdapter (35 required operations): \u0060EngineAdapter\u0060 declares 35 required operations: \u0060setTaskBtTracker\u0060, \u0060connect\u0060, \u0060disconnect\u0060, \u0060getCapabilities\u0060, \u0060getFeatureReport\u0060, \u0060createDownload\u0060, \u0060pauseTask\u0060, \u0060resumeTask\u0060, \u0060removeTask\u0060, \u0060forceRemoveTask\u0060, \u0060getEngineTaskOptions\u0060, \u0060pauseAll\u0060, \u0060resumeAll\u0060, \u0060changePosition\u0060, \u0060getTaskStatus\u0060, \u0060getTaskFiles\u0060, \u0060changeOption\u0060, \u0060getTaskPieces\u0060, \u0060getTaskPeers\u0060, \u0060getGlobalStats\u0060, \u0060addTorrent\u0060, \u0060getTaskBtTracker\u0060, \u0060removeDownloadResult\u0060, \u0060removeDownloadResults\u0060, \u0060getUploadLength\u0060, \u0060listActiveAndWaiting\u0060, \u0060listWaitingTaskIds\u0060, \u0060listStopped\u0060, \u0060getHistoryCount\u0060, \u0060searchHistory\u0060, \u0060exportSession\u0060, \u0060requeueFromHistory\u0060, \u0060onBtDownloadComplete\u0060, \u0060onDownloadComplete\u0060, \u0060onDownloadError\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-adapter.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2f5100afb1604ff3ea9abb3576aa27e14aa69fa77220ce3aca9f0d75868cb9"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: CapabilityHost (16 required operations): \u0060CapabilityHost\u0060 declares 16 required operations: \u0060createLog\u0060, \u0060getTail\u0060, \u0060clearLog\u0060, \u0060setLogVerbose\u0060, \u0060isLogVerbose\u0060, \u0060getLogState\u0060, \u0060subscribeLog\u0060, \u0060appSnapshot\u0060, \u0060i18nSnapshot\u0060, \u0060setLocale\u0060, \u0060onLocaleChange\u0060, \u0060flush\u0060, \u0060fsTaskFor\u0060, \u0060fsStorageFor\u0060, \u0060configFor\u0060, \u0060cookieJarFor\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/interface.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1479c973adfe5a16119b2312bd85843a83f595bcbc0e83f2c500f128c5d4823b"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SelectionState (16 required operations): \u0060SelectionState\u0060 declares 16 required operations: \u0060select\u0060, \u0060toggle\u0060, \u0060rangeSelect\u0060, \u0060selectAll\u0060, \u0060clearSelection\u0060, \u0060setItems\u0060, \u0060marqueeSelect\u0060, \u0060marqueeEnd\u0060, \u0060moveFocus\u0060, \u0060focusedSelect\u0060, \u0060shiftMoveFocus\u0060, \u0060focus\u0060, \u0060extendSelection\u0060, \u0060moveSelection\u0060, \u0060isSelected\u0060, \u0060selectedCount\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/selection/types.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"147cf219494f4a910fe7415437663eab3fdd3d47195130774e788c2de0bb9ef8"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"f752dd15898fccdc608d05155968edf642fa48c42db0afcd2530b1d59fa962f1"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [digest, identity] decided in 2 places: src.core.legacy-import.source-scanner.LegacySnapshotFile\u0027s [digest, identity] are judged in src.core.legacy-import.bt-activation-service.LegacyBtActivationService, src.core.legacy-import.source-scanner \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f80115a1d3aa311ee9e8414e751f474d916a651f9ce22eb0cb923f7a21109246"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [identity, root] decided in 3 places: src.core.legacy-import.source-scanner.LegacySource\u0027s [identity, root] are judged in src.core.legacy-import.bt-activation-service.LegacyBtActivationService, src.core.legacy-import.http-activation-service.LegacyHttpActivationService, src.core.legacy-import.import-service.LegacyImportService \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b6bb20c1e9e384e2a1a97814c000316019557b28d293dc0bf0b7364558264032"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [code, details] decided in 2 places: src.core.plugin.finalize.filesystem-adapter.FinalizeFsError\u0027s [code, details] are judged in src.core.plugin.finalize.finalize-committer.FinalizeCommitter, src.core.plugin.finalize.finalize-recovery-errors \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9074f09dc1b5e4d92c7706220aa72508fc5025bb73d7eb58ba942b3916bbde08"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [downloadBytes, uploadBytes] decided in 3 places: src.core.stats.transfer-stats-store.TransferDelta\u0027s [downloadBytes, uploadBytes] are judged in src.core.stats.transfer-stats-service.TransferStatsService, src.core.stats.transfer-stats-store, src.core.stats.transfer-stats-store.TransferStatsStore \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5abb19d5121cfba60a94a53297939dc324789f03ea20ab3a07d2b2d83663f6b5"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [endAt, startAt] decided in 2 places: src.renderer.routes.downloads.inspector.activity-chart-model.ActivityPauseBand\u0027s [endAt, startAt] are judged in src.renderer.routes.downloads.inspector.activity-chart-model, src.renderer.routes.downloads.inspector.lifetime-transfer-card \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2fd93b41336700f4b64f7f4fefd6ed6422bf777983f2812a8e1166087104dba6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060has\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/metadata.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"60efd9fe2f5e46f36039c29fa1d8e87adfd78ea4783e8c6a85c4f0782a4d654f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060set\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/metadata.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb014ce5217dc1c7da461899990f9c1f614248610df2f9527ce18ffa84c24594"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060handleStaged\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fee8d4f01c9fefff33a02fff64c215cca970fb0cb5a1b57b8d6fbb3e9c00feb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return true;\u0060 also returns \u0060true\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af01f017afef3721f255d791a8cb65034fc0d90927cfaf9a78e9a51d8515200"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return null;\u0060 also returns \u0060null\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/native-messaging-installer.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c0ed9d49edf374a9f96f08e8e90b2039f0d5b2cc649bea5ec3b0db43fdffef"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return \u0027query\u0027;\u0060 also returns \u0060\u0027query\u0027\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f568a3642abc29f83931f4c7f17b53251ae55984011022dd63030372e6c6eb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Markup wires an event to an empty handler: \u0060onKeyDown\u0060 is wired to an arrow whose body is empty \u2014 the markup attaches a listener that does nothing. Implement the handler, or remove the attribute that wires it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-row.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"29055fe3c3d5e8ed0a75f49ec33d12ef8c841d95915c49ecc38dd6f6614c3028"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/application-menu.spec.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f49288ab1b91f647873b5359c38530990f09e4c33e3151d505c49d782eadaf9"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/application-menu.spec.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6709273d3e86ad0ba985b686d0082c98705710e1125953bab9e0f44eb0cf8b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/appimage-cold-launch.spec.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76a9ba6d5717ccc1345fdffcb83ede6067d73ec6da4e58cdd1afebb30992e94"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/appimage-cold-launch.spec.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d705c2baffd561897743ef0a1d6e66f5e288d1de47cba94f74b928e2c39106bc"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/native-messaging-registration.spec.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d986f12747f5670b53b32bc2a83cf7e4e4fc7ed8c9fba1bfe7eb64020e611e55"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/download-progress.spec.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4b12d3046068762e5af05bd7dd20cebfe71cbc6f73f45ed85db05ce643fc9"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/hidden-window-startup.spec.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11b5e7f656d88ad9707400000293538db55fd11ffdfd417ca6f0f7a9116d04a"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/legacy-bt-activation.spec.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993f17d9989359d2f768b5fed3107db1a8ce6407d7fb5780b09b8a341af3613"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/legacy-http-activation.spec.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"64364dbe0244ac1139cc45bc767e6bf92026a2a330231899beee0b4aa5cb636c"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/media-settings.spec.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"249d0662e9118050f50e466f902eb247fa469de236b4f35faff865897a30f559"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/renderer-recovery-soak.spec.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"403fc78c4d1e38de8bef7508db81d19f74a3751f84d9840966a15bea6a827be0"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/renderer-recovery.spec.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3398d41e56970abe10ef8fbabc7f36333190f04ec777819dd6965b0a9e415d"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/task-http-resume.spec.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d9394560e862ba2a4691cdece9fd8f76cd0b33b7ab8f30d709c78e31c07ca1"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/window-chrome/window-chrome.native.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39d575cf13e3ee2106a396105f8e55323cef5cec5401ec1cef5562a9303844"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060unsubscribeLocale\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef9c67d499c077dc096b637c011a02c4ca96aa61c79e264f09ddf609ca481de"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060unsubscribeSecurity\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3ef2dd49552f5e616de9c2b0160fc62970881c49bb546bda17fbd4c0c357f3"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060emit\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-observability.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b65d165047f0fa8c6905eaf923ad7bd295ff2ebd6422cf3dda1c75b55ebe880"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-task-retry.integration.test.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d01a179725a7910bbc85aa3f294166b141b70e3d248924d8926c161e3c5088"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060schedule\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/renderer.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83678eb8be889da1dbde8df87fa3a02b8e88e0b910e1d6cdbe0e293af283785"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060init\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/i18n-resources.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf716ac337569746f7a2b23e87cec6229bd006106538640eda453458948fb7d"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/community-plugin-install.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eb944305189a130893d60502883b8cdbe2915eadb6881825e902f7a87fe66d"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README.md names Electron 44, but the manifest declares \u0060electron\u0060 45.2.3. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85864071a30ab325207b0475304e4f6aa1b79c8e2996b50e4173a6d35a328ea"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/production-builds.md names Electron 44, but the manifest declares \u0060electron\u0060 45.2.3. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/production-builds.md"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adb8372d0e3e3329a522007e4add65aece32398e528fc5857473e47473bc56a"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060src/{renderer,preload}/**\u0060 removes 2581 test(s) in 296 file(s) (e.g. \u0060src/preload/preload.test.ts\u0060, \u0060src/renderer/components/byte-unit-sync.test.tsx\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vitest.config.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbb71c208484e885a4426c7fe64bcfc5e7b4da73093ee54337e9e68a4f64912"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 3/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060packages/finalize-fs\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/renderer/routes/dashboard/components/tile-error-boundary.tsx\u0060 reports through \u0060console.*\u0060 at line 45 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/tile-error-boundary.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc250995906bc1edacbedffb66643d10c9e98291e22fed28abe104cc344cb5a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/renderer/lib/notification-text.ts\u0060 reports through \u0060console.*\u0060 at line 21 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/notification-text.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ece309d15ba6196c3a7ace81e6406a8038dce0774f9d8fb7ea562f303188ec"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060src/core/plugin/capabilities/commands.ts\u0060 reports through \u0060console.*\u0060 at line 138 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/commands.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5641394ff1ace5ee407a9debbb34e164bc9c472243b87399cccc54620514d72e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/safari-bootstrap/test-integration.mjs\u0060 reports through \u0060console.*\u0060 at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/test-integration.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7807dcb52509b9899ad9151c1dbc791047a53a979ba51fd3f8919a9f48347bc0"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetchImpl(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/github-fetcher.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c06ea299dbc9b53f2a9e9d80d615d6b37b706ecaeadc402ffee327b8360a7b9"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetchImpl(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/github-fetcher.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"62775d1b6cf9c63e2bef795f2a2c5ba7901aeba99b0f1f25e12a5994c7d2cb76"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetchImpl(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/url-fetcher.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c5328679d5716b035c70fc30b9ad600c096f518b19507547db9b1785c228d9"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetchImpl(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-fetcher.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53b669c87c765aac46893a89dfe0cadd40d9fa61b7d33ca0cb7f3627ff86f4b"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetcher(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"879d8ff36edac2c449f21b0b57d6b0879d24c794d2cc9c6814a057c18a397fb9"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-http-client.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a20ad9d2bfce86121fe75fab0e32b7c13b62c1069c3f8a858fb407dbc85c0a"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-http-client.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e32be2540a736825c0ab3a6ee0665d15c371fb80c99dbfe1c205abd9cc9f4c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060buildNativeHost\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/build.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fcae814ea588ca9e31271b2e6d655f234983e397fe317cf440688c87a722fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060gzipSync\u0060 in \u0060packageFlatpakCompanion\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/package-flatpak-companion.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f2ae7e0c18ac3813313053d92a6384e1e305b2e11129c8309992d7206d7dab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060inflateRawSync\u0060 in \u0060inspectEmbeddedBlockmap\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/appimage-artifact.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fa8db3fc59d155abdf1c944bab35776230934e5efabf95018036fdb39d209f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readLockFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-engine.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3979a77ccb716f4745741e5cd668b196bba437b3bfe175e4c290ca17af57c36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060sign\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sign-macos.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8decac947d337fd3247e3ace5f661b80b915fbacfbc012b0d8a1e10d0be00fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060sign\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sign-macos.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af5ac981422c8a0979502008f800a715b1835af54dcaab799ef89c781eafd80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060sign\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sign-macos.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d03d94577b48c94bff08162cf49a884ccffd9ea028562890da4dc4fe143c165"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060replacePayload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-synology-package.mjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de841f1a09d30bd4a2c5d862718ed7cd6c3b1759c75ea703ee2946a1d30f806"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060verifyLegacyMacFfmpeg\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1ff77ed6cc93c02557ba421dbb79ae565d8812b5aa8ecd838598a9e91a496c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installVerifiedFfmpeg\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca17f267b197fffd8c8435f130da37eb99c5060762fc9f9823a5dc9c5b6d4f2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installVerifiedFfmpeg\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbde84d4fbbfa826b7e1298db417411c97ca8f667ac497a610f88aba9871dffc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060spawnTestBridge\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/test-helpers.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d795c6bbe4b297be4cd9a72f3cec3bfc5cd0f6f7b10633ef4c3257e1f4beb80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060spawnTestBridge\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/test-helpers.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"274c5a8de6d76bdefd6da86aa5182bc2daac529af84f50204317eedd53e11c93"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060create\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/secret-store-libsodium.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4f47ff1dfc7e0bb7f880e0937de7b84ee3dc747203967de0234afc06099400"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060create\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/secret-store-libsodium.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaa168c76daf32fa6b77b143889c38a2a724c17d7480368d1e2a70fdfc4c8b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060create\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/secret-store-libsodium.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1223f7372d042dea661267568e5715717f156b01804867564c2c7936709c8dd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060reAddOrMarkErrorFromPair\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfc3ed0e7b0a2675e77ea2dae41bffe892b0eab6f5708b9ef0742f24ffed943"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060reAddOrMarkErrorFromPair\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66477e396b56f52ef750d8148c9cbfc3e21f7907fb0cfe90c4e8b6e69095040"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (100 clone groups): 100 duplicated blocks under src/ have copies in at least two of the sibling directories core, main, preload, renderer, server, shared \u2014 71 of them are reported below, and 29 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 100 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 100 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 100 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7619708069058bd97ec178cca024a1926a5077347c87844688f9a62749ba868"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (33 clone groups): 33 duplicated blocks under src/renderer/ have copies in at least two of the sibling directories components, features, hooks, routes \u2014 11 of them are reported below, and 22 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 33 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 33 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 33 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf891ac39b18ef98fe40e3290c12880c1db4f0f063c4c814e395bc6d543429"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 14 sibling directories (25 clone groups): 25 duplicated blocks under src/core/ have copies in at least two of the sibling directories activity, bridge, bridge-receiver, engine, ffmpeg, geoip (\u002B8 more sibling(s) not listed) \u2014 8 of them are reported below, and 17 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 25 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 25 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 25 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/runtime/plugin-hook-runtime.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6785302b44e814bd6ceab62e1e50ce5db71023a12974acf8da33db939b689023"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (11 clone groups): 11 duplicated blocks under src/renderer/routes/ have copies in at least two of the sibling directories dashboard, downloads, plugins, settings, trackers \u2014 5 of them are reported below, and 6 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 11 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-tracker-dialog.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5214062aab8f6d26cbd2169af217fc4431d7c1223919cd0c4e2203680d11a4fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (7 clone groups): 7 duplicated blocks under the repository root have copies in at least two of the sibling directories packages, packaging, scripts, src \u2014 5 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/build.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee8ca3a19a9a696be86e04ddc9a3c2f7c49d4811bbde5c7940d07974dd0678"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (457 matched lines \u00D7 2 locations): scripts/stage-electron-app.mjs:45 \u00B7 scripts/stage-server-app.mjs:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 2738 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e10773959bf874dc6211bea44ce3ab8c7c55f686c8450e021e7d4d73c17053"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (247 matched lines \u00D7 2 locations): src/main/ipc/commands.ts:965 \u00B7 src/server/ipc/commands.ts:569 \u2014 the two spans are one implementation copied and then locally edited \u2014 1236 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6daba16212ff549fdf9d0a9d7c712bc39929b0de298da7dbeb2fd6ff6ff9ba6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (182 matched lines \u00D7 2 locations): src/renderer/routes/settings/cards/advanced-dialog.tsx:140 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:103 \u2014 the two spans are one implementation copied and then locally edited \u2014 758 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"302f6dea3c2c13f99b633b70eabc15b164f1a3139902664214629da3a91ac5b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (163 matched lines \u00D7 2 locations): scripts/verify-electron-package.mjs:109 \u00B7 scripts/verify-server-package.mjs:56 \u2014 the two spans are one implementation copied and then locally edited \u2014 996 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-electron-package.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c64f7760d6ed7adb219026f7abfeec7c1ab84525c42edcfe04c698367b99bac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (158 matched lines \u00D7 2 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:129 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:142 \u2014 the two spans are one implementation copied and then locally edited \u2014 680 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a14409b6069395e18f19506383cec4dc05aefbf0d442f62d9fec47e4fb9e94a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (141 matched lines \u00D7 2 locations): src/renderer/routes/settings/cards/appearance-dialog.tsx:420 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:315 \u2014 the two spans are one implementation copied and then locally edited \u2014 575 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"783dbadaa47fdddfa37c4bd4404c42304eed5c6de6644dca5dfd50f2babde7cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (131 matched lines \u00D7 2 locations): src/shared/lib/log-redact.ts:455 \u00B7 src/shared/lib/log-redact.ts:780 \u2014 the two spans are one implementation copied and then locally edited \u2014 642 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8d8163ff831923decfe02cfcf83d0a7e9713b2f99740c0c9219f92cbdf7417"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (123 matched lines \u00D7 2 locations): src/renderer/routes/settings/cards/downloads-dialog.tsx:89 \u00B7 src/renderer/routes/settings/cards/general-dialog.tsx:217 \u2014 the two spans are one implementation copied and then locally edited \u2014 531 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/downloads-dialog.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec850b1c44e37d91b84e7a0ef6501192f5920086840aa89578fee27a1023200"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (110 matched lines \u00D7 2 locations): scripts/prepare-snap-project.mjs:65 \u00B7 scripts/verify-snap-artifact.mjs:109 \u2014 the two spans are one implementation copied and then locally edited \u2014 670 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-snap-project.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3370f391aef29ab73bbd49d49c4e04d11270cd93ca8fd615dac9662f5b7d0410"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (105 identical lines \u00D7 2 files): src/main/plugin/capability-host.ts:1 \u00B7 src/server/plugin/capability-host.ts:1 \u2014 these 2 files are line-for-line copies of one another \u2014 105 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/capability-host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9d3a0da6bc5e859fa758570c7919da86fb26447e3b6a1cfdba311593c4ffc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (99 matched lines \u00D7 2 locations): src/renderer/routes/trackers/components/blacklist-tracker-panel.tsx:18 \u00B7 src/renderer/routes/trackers/components/effective-tracker-panel.tsx:38 \u2014 the two spans are one implementation copied and then locally edited \u2014 604 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/blacklist-tracker-panel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66aff05b32fa68ac3accd90e657f0e9666558b221bf9c01657c35430090d248"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (97 matched lines \u00D7 2 locations): src/core/plugin/capabilities/metadata.ts:66 \u00B7 src/core/plugin/capabilities/storage.ts:76 \u2014 the two spans are one implementation copied and then locally edited \u2014 538 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/metadata.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"389e5f8e5e276b01e4bba122d19148c2e546f3b189c0c7cc8be9d7b4383e3c63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (93 lines \u00D7 2 locations): packaging/fnos/app/lifecycle.mjs:64 \u00B7 packaging/synology/app/lifecycle.mjs:224 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e552b383697fffc42c268bf8c1622fe17de40c275aa1bfa18a32c1e02afbd607"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (89 matched lines \u00D7 2 locations): scripts/assemble-release-artifacts.mjs:472 \u00B7 scripts/verify-update-artifacts.mjs:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 622 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d697438c89c63e9b1ae7778f67bd20767ca17081dcf1138cc896a5084b24fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (82 matched lines \u00D7 2 locations): src/main/bridge/index.ts:550 \u00B7 src/server/bridge/bootstrap.ts:276 \u2014 the two spans are one implementation copied and then locally edited \u2014 532 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"7859b3e710f21c51009570d9a8758a312c30e9060b5a51f1b359993572eb1182"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (78 lines \u00D7 2 locations): src/main/ipc/commands.ts:834 \u00B7 src/server/ipc/commands.ts:724 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e1ecdb651a58f39e7cec966b0a722719b779e8a9b3f6797a1e8642d3c8ace7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (78 matched lines \u00D7 2 locations): src/renderer/components/ui/autocomplete.tsx:18 \u00B7 src/renderer/components/ui/combobox.tsx:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 310 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/autocomplete.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"872dc14109c9c1581b7816488ec7c0dd5dea85cc7ed3ad6ec4759a307dd593e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 2 locations): packaging/fnos/app/lifecycle.mjs:185 \u00B7 packaging/synology/app/lifecycle.mjs:365 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973a7260229e1e94590944c29da9a19f0f3f32fde09282288305c864e3ccc2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (61 matched lines \u00D7 2 locations): src/core/task/actions/finalize-task.ts:344 \u00B7 src/core/task/actions/finalize-task.ts:624 \u2014 the two spans are one implementation copied and then locally edited \u2014 309 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d396e85f6fda6d266138922a737fb778ff07f6a0d4a8ee9f706fa52b78b57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (60 matched lines \u00D7 2 locations): src/main/index.ts:329 \u00B7 src/server/index.ts:376 \u2014 the two spans are one implementation copied and then locally edited \u2014 400 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feb2e2ee68c45cddd5e6e0993e938c35d55f691813ed7c826e52295d7ff68f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (54 matched lines \u00D7 2 locations): src/core/plugin/hooks/hook-orchestrator.ts:225 \u00B7 src/core/plugin/hooks/hook-orchestrator.ts:391 \u2014 the two spans are one implementation copied and then locally edited \u2014 343 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f21f944a404ca9d5ed92b1b36cb6cf8ac5d5e3e5a379b699bfe56b297a0a70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2 locations): src/renderer/routes/plugins/hooks/use-plugin-graph.ts:60 \u00B7 src/renderer/routes/plugins/hooks/use-plugin-metadata.ts:70 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-graph.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"916cb3c6241571deffd82d12678902b4a2bb87d541c061d571c88eb97bfcd567"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): src/main/index.ts:2561 \u00B7 src/server/index.ts:1028 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6841d59fcd0560ba68071afbee6ae25e4743cf866804ed433dcd8beca061f80f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): src/renderer/routes/settings/cards/advanced-dialog.tsx:166 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:216 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c229902badb185ca1d23ee5290c9a7a854fde988dc12cf118b0e6f1a76759ade"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): src/main/plugin/dev-watcher.ts:23 \u00B7 src/server/plugin/dev-watcher.ts:15 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/dev-watcher.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3503e1cc48bfd71be73e883ac1033d1b03ceee0b3e8b69b39e3c8b7fb842edd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): src/main/ipc/commands.ts:1973 \u00B7 src/server/ipc/commands.ts:1195 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b471187a13a066e2397c75d528c05e8c074e5f99015c63019ffd49c2927e34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): src/main/ipc/queries.ts:306 \u00B7 src/server/ipc/queries.ts:351 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/queries.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8699f9ca904915bfea2e6483a3a71096d99823f1ec79c50cf9c3781f06e669"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): src/renderer/routes/settings/cards/network-dialog.tsx:378 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:439 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d933003b8fbef362da7e8edefc4ce3ca0acfa114707a1c8e4eacb596495577a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): src/main/ipc/commands.ts:1722 \u00B7 src/server/ipc/commands.ts:1075 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bf4117f9c3ea9f5a1ea4d981c3b98264b5e1907e62b716ed50a9f579ec1911"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): scripts/electron-package-utils.mjs:31 \u00B7 scripts/server-package-utils.mjs:47 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3086b2a893489651c8c920ed8a367921b2c2bbf88fe1be9bf0702a345a9d39c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx:832 \u00B7 src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx:867 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61b338b2b2c370675673cd87e8ea90518d8b82f4c7029fe471426b32169f3a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): src/core/plugin/finalize/finalize-committer.ts:637 \u00B7 src/core/plugin/finalize/finalize-recovery.ts:839 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2966268ea36062739f5dbae99ea9168a76837a81402838352aaee9165c07364d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): src/renderer/routes/plugins/hooks/use-plugin-detail.ts:19 \u00B7 src/renderer/routes/plugins/hooks/use-plugins.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 175 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-detail.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"533b18122379b63295c46c2fb2e220699d090e3a87f1a22585069d855cb26b09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 3 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:144 \u00B7 src/renderer/routes/settings/cards/integration/integration-dialog.tsx:130 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:157 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a81be8c3d19f526ce65fdafda6c83a2839c0f5fe8cdadb372405b9c2e8f42f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): scripts/prepare-fnos-project.mjs:136 \u00B7 scripts/prepare-synology-project.mjs:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 211 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-fnos-project.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d519a56a8229dc05163fd1a80aa222a0fc8b294a8be067bf850c9b0dc49cc6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:343 \u00B7 src/core/legacy-import/http-activation-service.ts:627 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1425cfe0428801940b77ec9a17d11012b9fe36511b2022ccab6caf43de91d5d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): src/renderer/components/byte-unit-sync.tsx:22 \u00B7 src/renderer/components/reduced-motion-sync.tsx:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 184 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/byte-unit-sync.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f1aef595208f3a6aedfc2202f3e3170008f469a43954f3d3211baf8706ee0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): src/renderer/routes/plugins/hooks/use-plugin-graph.ts:22 \u00B7 src/renderer/routes/plugins/hooks/use-plugin-metadata.ts:30 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-graph.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e1309ec62cb9d538f34026b229c53eda484e7f6e23fd42000930e4c71c6453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): src/server/operator-admin-locales.ts:12 \u00B7 src/shared/i18n-resources.ts:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 275 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin-locales.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"204ebc76fb4d69fea6a8dce476ead4c02d94ee08c50ea6d362a38fead3a16593"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): src/main/legacy-import/desktop-import.ts:113 \u00B7 src/main/legacy-import/desktop-import.ts:161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ed21ced300ef3b6f6e4fe123b1f0bd18acde0cc2af27c44f6b1516ad01f1c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 4 locations): src/renderer/routes/settings/cards/advanced-dialog.tsx:533 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:585 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:824 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:555 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0a3cccdd24e85eabd039b382e2c06b87ea570f540c72e6b9dce6ec117d1a1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): src/main/index.ts:2733 \u00B7 src/server/index.ts:2180 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cc40274664a38f1f7716ea75f179d6d11b0dd89c2a71dbf8252a24de01db85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): src/main/ipc/commands.ts:1784 \u00B7 src/server/ipc/commands.ts:1118 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98b2b7b4b9d8f32dbd1f8ad6b716311e11eb45ed87fd0488e468cca2d6bd187"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): src/main/ipc/commands.ts:511 \u00B7 src/server/ipc/commands.ts:393 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93523e173bf0ce9d1ed26f68bd648fde2369bb6fb75670a73c8e12d01b19386"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/core/bridge/web-socket-bridge-server.ts:1795 \u00B7 src/core/bridge/web-socket-bridge-server.ts:1896 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecf19c9a6a5998db502d75da62ab0de47eaaaaca8180af0dfb0841e74f4ceee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (28 matched lines \u00D7 2 locations): src/core/task/actions/pause-task.ts:20 \u00B7 src/core/task/actions/resume-task.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 166 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/pause-task.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c989b81649012b8d9ba594c1aa226a9536769930bdb1947f5b31a2f8068a429"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/core/task/direct-resource-validator.ts:383 \u00B7 src/core/task/direct-resource-validator.ts:425 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf659116f8c792c56c0eee6eb3a9b64b39f16f6d0ec7b80c4d0ae6b51b825506"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:415 \u00B7 src/core/legacy-import/http-activation-service.ts:699 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed647b8338494739fd7e3796a9082e6b83332854623d08200d582336f0f07f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/main/bridge/pairing-dialog-controller.ts:54 \u00B7 src/server/bridge/extension-pairing-prompt-adapter.ts:78 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/pairing-dialog-controller.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d838e69a8193f1fb7a7dae40f43665bc76378bcc8b7b7c0ebe92d185f3ce1ba9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/main/index.ts:1627 \u00B7 src/server/index.ts:2007 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d9268c57200604033d3c165d248799aa682a71d9f50afdc573a0c3d24b1c88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/main/plugin/verified-ffmpeg-electron.ts:30 \u00B7 src/server/plugin/verified-ffmpeg-server.ts:20 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/verified-ffmpeg-electron.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25a4778b1cd9ec49e81180bf4fae5041dc68fc53f32d91630a0874a0a849024"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx:355 \u00B7 src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx:387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"691dfd523823adda930581555843e792a742be8f047af6541975d1615aa813a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): vite.renderer.config.ts:25 \u00B7 vite.renderer.web.config.ts:35 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vite.renderer.config.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4414a8a6d9007d244b2b5a338d7dc1af08dd5d8d2bfed847cb592cefeb88b680"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/core/bridge/web-socket-bridge-server.ts:1989 \u00B7 src/core/bridge/web-socket-bridge-server.ts:2166 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e0acb947a6badc964cfd766333f4367c77f910249472d5843b0733c4700ed2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/core/torrent/swap-magnet-metadata-for-bt.ts:626 \u00B7 src/core/torrent/swap-magnet-metadata-for-bt.ts:724 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f650d0720d9438f0f18c491c01b07f1c652d090375cafeeaa07e1adc82fabcc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/main/ipc/commands.ts:371 \u00B7 src/server/ipc/commands.ts:290 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a26cf5082e8a67f5e06eb49dd64c238549ecf70ec67b00cfa858e85587e5e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/main/ipc/commands.ts:1860 \u00B7 src/server/ipc/commands.ts:1164 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdd5bce6b7cfeb2315d6bd73cbc3ccd40583679c6da93bee79f8eda61989c1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/release-snap-build-set.mjs:286 \u00B7 scripts/verify-snap-store-channel.mjs:326 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25d64b338d593927af2a1726bad1bf427b0cfdabe6e772cea0a861d7ff77e28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/core/bridge/bridge-data-dir-lock.ts:810 \u00B7 src/core/bridge/bridge-data-dir-lock.ts:847 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f46004bbe6fdc24117726686994f95a17b1191d9fbee1a21550311ba721790f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/main/ipc/commands.ts:483 \u00B7 src/server/ipc/commands.ts:361 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6428a09337c655b8262fffecffe1a823fc4f1b3d8275afc30deb2cf4676caf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/core/plugin/grants/grants-manager.ts:162 \u00B7 src/core/plugin/install/plugin-installer.ts:809 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/grants/grants-manager.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8548c93c38071d592c940bc4a8fdee8a454cf8cdb8f1863e78e7bb755ad5991b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/main/index.ts:1249 \u00B7 src/server/index.ts:1769 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb306a33b8fb1604ae23eb5d6296556d2f6002b6883b3d72339a54b3800046e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/renderer/components/desktop-kit/sidebar/app-sidebar.tsx:76 \u00B7 src/renderer/components/desktop-kit/sidebar/app-sidebar.tsx:108 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/app-sidebar.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"26000b355c466bb459affd8de6e8989e4deb658324cd9a01ed44fe887098843d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/renderer/routes/plugins/components/about-section.tsx:15 \u00B7 src/renderer/routes/plugins/components/overview-section.tsx:61 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/about-section.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b917d5b0c3ff332301b354840c960fac863f7b404b03b4d985fe64d99f4830"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): src/core/plugin/finalize/native-artifact-operations.ts:339 \u00B7 src/core/plugin/finalize/native-artifact-operations.ts:403 \u2014 the two spans are one implementation copied and then locally edited \u2014 179 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd6a56483b895f2a95bf74740f21d0938d75cb5c897efc97c9b3f880d9cf1f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): src/renderer/features/legacy-import/legacy-fresh-download.tsx:81 \u00B7 src/renderer/features/legacy-import/legacy-fresh-download.tsx:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-fresh-download.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d744b5ebd9e286adca8a31f60ba1b2c0bab7d14abbeb3fa25b15b1e387a0c55d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/renderer/routes/dashboard/components/dashboard-grid.tsx:1196 \u00B7 src/renderer/routes/dashboard/components/dashboard-grid.tsx:1269 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed7e8cf32f88e9c6059b9618b06fff7c58505679f41aa5f9ce2e864a9c870b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): src/server/bridge/remote-extension-admission-policy.ts:396 \u00B7 src/server/bridge/remote-extension-host-policy.ts:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f73355433baa1353c5546d581bd6df81cbaec1dff62dd452347ebb23b711be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/core/bridge/mbp1/pair-session.ts:294 \u00B7 src/core/bridge/mbp1/reconnect-session.ts:160 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea88f14943c8bd708110248efb68ac9164f8fe0ac064a87fe17de4218791409f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/renderer/routes/dashboard/components/dashboard-grid.tsx:325 \u00B7 src/renderer/routes/dashboard/components/dashboard-grid.tsx:354 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea77db326f7563cb0f2d485e29113a59b776a6bee398e066dc5e9d35c7fd4f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): vite.server.config.ts:6 \u00B7 vite.worker.config.ts:6 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vite.server.config.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4eaff3041c5dfadad149432f0b556ae3bffe2cd3a87fc994c8c743ab7297e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): scripts/smoke-server-package.mjs:294 \u00B7 scripts/verify-electron-package.mjs:249 \u00B7 scripts/verify-server-package.mjs:155 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-package.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6672ef6e5948ebc24338c83a2c6bef36843f122fcd51a0a6716400a520725818"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): src/core/session/session-manager.ts:447 \u00B7 src/core/session/session-manager.ts:491 \u2014 the two spans are one implementation copied and then locally edited \u2014 129 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d2892b12ffe6c99c8c6c7b2f895ec5f0b464e6a3fdcea42e0395d17f678d96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/core/torrent/magnet-tracker.ts:643 \u00B7 src/core/torrent/magnet-tracker.ts:874 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee3f591690b34b9803d75cabca6cbb94629f5c96563e121ac79e10804b5a81d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/main/index.ts:2373 \u00B7 src/server/index.ts:942 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294ddda217542d485c6f5246c5bbb635e4689ace8910118d0ddd8135a992036"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/renderer/routes/settings/cards/network-dialog.tsx:324 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:515 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b291a7355288148dea60ca60d86ee9c094612e4abbc470a592e05869c092f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): src/server/bridge/remote-extension-host-policy.ts:104 \u00B7 src/server/bridge/remote-extension-route-policy.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-host-policy.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"abea88ea595e230ff5083b23a0bab31178c548ace7a03f8608cfcb929299355a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/audit-server-runtime.mjs:154 \u00B7 scripts/stage-server-app.mjs:110 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb8afbe86852a74215075b02d3340fb8b354a1af2e17d6e511b726bfdf4012e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): src/core/bridge/extension-identity-resolver.ts:155 \u00B7 src/core/bridge/pairing-prompt-controller.ts:177 \u2014 the two spans are one implementation copied and then locally edited \u2014 103 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-identity-resolver.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0f7dc47417f9e526ac3e75ca7554e3dfdc0d504892f6bf8b11df64ba4cab3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): src/core/bridge/extension-pairing-projection.ts:285 \u00B7 src/core/bridge/extension-pairing-projection.ts:325 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"268058ad80664c77d4254490341ba3a9e152958033da0af891bed5b61ddebef3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/core/plugin/install/moext-reader.ts:323 \u00B7 src/core/plugin/install/moext-reader.ts:514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/moext-reader.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6744771f6bc7000bda8e2a0831bbd2edd46822dfd7764734591f319ee02e0c70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/core/torrent/magnet-tracker.ts:1564 \u00B7 src/core/torrent/magnet-tracker.ts:1586 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"edce5b4695acc66ecde967abfef3e1bcc6b7f3b0305355b82ee982d8aa491128"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/main/index.ts:2221 \u00B7 src/server/index.ts:712 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1e53606321cf01b532d889dcc7dc11b5136220dab9bec1776c7e1a83e58c32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/main/ipc/queries.ts:235 \u00B7 src/server/ipc/queries.ts:220 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/queries.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac6e1fdfb2e175251c8d6b68f21e44c0880b6aa30dde1a2079d393a13ade226"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:333 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:497 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:546 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:592 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"38827a94a100623b154a38546ae3fa921f0ff19a3129a9323fffd593a868294f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4 locations): src/renderer/routes/settings/cards/engine-tuning-section.tsx:161 \u00B7 src/renderer/routes/settings/cards/engine-tuning-section.tsx:200 \u00B7 src/renderer/routes/settings/cards/engine-tuning-section.tsx:236 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:224 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/engine-tuning-section.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2706aabb4e33712fc8cda8cf354253983cfde604cb8ecce2dd33a9d16ec71612"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/renderer/routes/settings/cards/speed-limit-section.tsx:382 \u00B7 src/renderer/routes/settings/cards/speed-limit-section.tsx:405 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/speed-limit-section.tsx"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"88943a1cc635a90edde633fea870db4d1cf9042fc027c3457684ea6637026fad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/native-host/build.mjs:55 \u00B7 packages/native-host/package-flatpak-companion.mjs:45 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/build.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc0b8280016c1c9cb7f59844434d254b0bf4ef59e3b002ad496224de875b914"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): scripts/smoke-server-image.mjs:546 \u00B7 scripts/smoke-server-package.mjs:294 \u00B7 scripts/verify-electron-package.mjs:249 \u00B7 scripts/verify-server-package.mjs:155 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"15effbd2d8487b31802440c927552661655c8e898dae909c7a7000341e16f35a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/core/plugin/configuration-schema.ts:6 \u00B7 src/main/ipc/commands.ts:1763 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/configuration-schema.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecb3c1a7099737fd4558f13547e99b6c55f2dbfa7df438fe7a6348d57e45cc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/core/plugin/host/capability-bridge.ts:2281 \u00B7 src/core/plugin/host/quick-js-worker.ts:1390 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f795eb13c25a86bd6820f2a4b4d8957847005cf8b91dffba94359701744249"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/main/bridge/pairing-dialog-controller.ts:142 \u00B7 src/server/bridge/extension-pairing-prompt-adapter.ts:263 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/pairing-dialog-controller.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fcc9f15a4a207636b905df4b84863b0c5ac9f2cbd8f9f66df685a5a063c324"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/main/index.ts:1583 \u00B7 src/server/index.ts:1979 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966232f405720d07dc740a2698e94276a54785d73a3b9caa57aace4b8506230"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/main/index.ts:1935 \u00B7 src/main/index.ts:1958 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"601bdf838029f9069124faa3a2127a771be9beb4a8c01b7ec9d799d9553c2c60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/renderer/features/application-menu/desktop-menu-actions.tsx:33 \u00B7 src/renderer/features/application-menu/web-menu-button.tsx:172 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/desktop-menu-actions.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aa69d1fb8f5ba2a0915c1ffc3486a7f4b89430de5bd1b9ed55da25e764187b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/renderer/routes/dashboard/layout/dashboard-registry.ts:265 \u00B7 src/renderer/routes/dashboard/layout/dashboard-registry.ts:306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/layout/dashboard-registry.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"699568b83257f74c333a6a4aab59826e1165568d96cf8a7ee571942d13ef63da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/renderer/routes/plugins/plugin-detail-page.tsx:378 \u00B7 src/renderer/routes/plugins/plugin-detail-page.tsx:432 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.tsx"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2198188a3fbff0e3430211a8041a9079b2c232d44259f8346d5c090c830a337"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/renderer/routes/plugins/plugin-diagnostics-page.tsx:380 \u00B7 src/renderer/routes/plugins/plugin-diagnostics-page.tsx:435 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f132009945b498aeb192c73b061f0efc0bb98d2539fa3c33a772850773e4ba0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:820 \u00B7 src/renderer/routes/settings/cards/downloads-dialog.tsx:204 \u00B7 src/renderer/routes/settings/cards/general-dialog.tsx:426 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"7026f5bc663f922dbe93363d8fc1b6ecbb4fcd0bacf5d86b8f677432b0da6022"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/core/bridge/credential-store.ts:693 \u00B7 src/core/bridge/credential-store.ts:728 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35e6b39b3c0681b170d919dd13548d37134d2c2c829b541c772ee1f7683f237"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/core/bridge/mbp1/envelope.ts:100 \u00B7 src/core/bridge/mbp1/envelope.ts:181 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/envelope.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"22497f8d9dfcdb9a532fb7b6ec54c90e09964dcb580f317fc3af04b7e17c262c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/core/legacy-import/import-service.ts:290 \u00B7 src/core/legacy-import/import-service.ts:413 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aab98bb4833414c4c19075065561c5b1b2a35108fdc2321c377075929e2c25b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 7 locations): src/core/plugin/host/quick-js-worker.ts:1471 \u00B7 src/core/plugin/host/quick-js-worker.ts:1692 \u00B7 src/core/plugin/host/quick-js-worker.ts:1839 \u00B7 src/core/plugin/host/quick-js-worker.ts:1896 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"add6ca3ca72d3d7606ffe57e39d1d678b417d8d9c37d56e693111ad990b4217f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/main/index.ts:887 \u00B7 src/server/index.ts:299 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed2d042c63f2faa0574d2b5c45562309353e177197a0d330647055406939178"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/renderer/components/ui/dialog.tsx:79 \u00B7 src/renderer/components/ui/sheet.tsx:80 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/dialog.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"556cdbebe86cd4732c7874b3d6ed14aa575416008b291f274a2387cf94ba7fea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/renderer/features/directory-preferences/directory-preferences-dialog.tsx:122 \u00B7 src/renderer/routes/settings/cards/nas-dialog.tsx:515 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9d421baecd3c5596e3063032da99ee67b393d53d2966ff645c547e914ae8b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/renderer/routes/downloads/inspector/multi-selection-summary.tsx:15 \u00B7 src/renderer/routes/downloads/inspector/overview-tab.tsx:38 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/multi-selection-summary.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae314a545f7e6fdf55c7e570387fa3df53804e5c37e33a24913b95a617738da9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx:243 \u00B7 src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx:261 \u00B7 src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx:279 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c8b509ba09e310464aa0f1f15a971ce82609cea89c5b243f98c487bed4a61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/renderer/routes/downloads/inspector/task-tracker-dialog.tsx:69 \u00B7 src/renderer/routes/plugins/components/builtin-update-dialog.tsx:157 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-tracker-dialog.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"645f6c4f3ed4f24c94f40221cd83b2b93d4a9e01f33d5281c3f8b17c9ca9910e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/renderer/routes/settings/cards/appearance-dialog.tsx:253 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:387 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1192f02c5fb25d658c12cc438b574a9a6d7725a7130b972184c1ae2c23ec9ce8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:441 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:512 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:561 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:643 \u2014 all 4 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfeabbba1c8809cd1d16c022e962d699397d665b599f9956da835647c713dc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/renderer/routes/settings/cards/integration/media-tools-section.tsx:655 \u00B7 src/renderer/routes/settings/cards/integration/media-tools-section.tsx:684 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c2889cb391f8d3373afba0ebc62bd05d39dbe58c24645a90269dbdf9008c0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/audit-server-runtime.mjs:26 \u00B7 scripts/stage-server-app.mjs:48 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c3c5ea0f83d892596c5f658095d35c04dd35598aff29ab776103b307cae1fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/electron-package-utils.mjs:139 \u00B7 scripts/server-package-utils.mjs:304 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d47a319cc56fc2318eaee069b52ed96a819e8fd24da2a0ce1d18e186969780"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/smoke-synology-package.mjs:580 \u00B7 scripts/smoke-synology-package.mjs:653 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-synology-package.mjs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb512ab57b9124f34364d7d92fd31cc62f73f808a80f89a1507bbbd9f3d06840"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:508 \u00B7 src/core/legacy-import/http-activation-service.ts:805 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cc873630a4fc8e07cd3c5cc1a54393f9b41ffd4882c8de8c0231a11a10197c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/plugin/install/moext-reader.ts:440 \u00B7 src/core/plugin/install/moext-reader.ts:558 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/moext-reader.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"3683bc77a203f39e3ba4651979b7e6e68c8c4436af725f1c397e6486a3b6fb89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/proxy/aria2-proxy-routing.ts:23 \u00B7 src/core/proxy/aria2-proxy-routing.ts:122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"77355b76aa7a41629bb617cb007ad038f940ea0b94dae9efa5d8151a5ca7b48f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/proxy/aria2-proxy-routing.ts:264 \u00B7 src/core/task/direct-resource-validator.ts:1611 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a739e76ab572c7088df8c7676249a116eb55051db7ac8b062546b19ccc6d57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): src/main/platform/linux-default-apps.ts:211 \u00B7 src/main/platform/linux-default-apps.ts:261 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/linux-default-apps.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"615cc0e5bddd24b8dc4adb83fcce2b8eec02e2468fa4325bb5769ac0cbe1cc2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/renderer/components/ui/select.tsx:169 \u00B7 src/renderer/components/ui/select.tsx:187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/select.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d1640a6aa3897018d417aa71fa89e85f0a9d1941443e994214c5e9e57ac06a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/renderer/features/legacy-import/legacy-import-dialog.tsx:253 \u00B7 src/renderer/features/legacy-import/legacy-import-dialog.tsx:454 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c95ef4714f73412e32d64574973dbb10b9576285fac1f8b7b5b02fffc9199a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/renderer/routes/plugins/components/call-graph/plugin-call-graph-toolbar.tsx:105 \u00B7 src/renderer/routes/plugins/components/call-graph/plugin-call-graph-toolbar.tsx:127 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-toolbar.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1956d3e9bca0ae94a976352786daac7c76f7886fabe45e99759615faf6106e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:282 \u00B7 src/renderer/routes/settings/cards/bt-peer-geo-section.tsx:243 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d59d06a7cac886c91f109b815205cc487e60185bce188f71a317294165b0f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): src/server/bridge/server-process-ownership-authority.ts:322 \u00B7 src/server/bridge/server-process-ownership-authority.ts:395 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-process-ownership-authority.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1136cd083249ca871759f15855f43c1f9a197f618404782072ec2044009759"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/release-snap-build-set.mjs:89 \u00B7 scripts/verify-snap-store-channel.mjs:225 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf786b44d2e7147f0955e8ca89af8b671a78fde869396a137f05c3c7c03dac7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/server-package-utils.mjs:322 \u00B7 scripts/stage-electron-app.mjs:343 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ce939eb4b8b73fdd141a7ccadae863dcca965c8eb735b7bbca644f03e34c1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/core/torrent/magnet-tracker.ts:1670 \u00B7 src/core/torrent/magnet-tracker.ts:1911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe00040f084715c3bab3f4ec5bbaed0f588521abe0f1bc8997203ba5470209f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/main/bridge/bridge-manager.ts:28 \u00B7 src/server/bridge/manager.ts:85 \u2014 the two spans are one implementation copied and then locally edited \u2014 99 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/bridge-manager.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"00794a1ab5bcf631c9331477e9748d1e73401d2f8d133401fff31eaae2436c85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/main/bridge/pairing-dialog-controller.ts:91 \u00B7 src/server/bridge/extension-pairing-prompt-adapter.ts:230 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/pairing-dialog-controller.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c98a6f35c563d2e3e994e5679db21617370f714aae795a9cb8e776d5ea0e01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/main/index.ts:1356 \u00B7 src/server/index.ts:1859 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2559ba8b80b0988b577306eef0eeaa830307eae618661a3244118c40b0b7a80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/main/index.ts:2118 \u00B7 src/server/index.ts:625 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6182ad4b60df8906b4d5c8363c5b8642f9f2b9e352b502525aa256bba5d6e67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/main/index.ts:2799 \u00B7 src/server/index.ts:2168 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2799}}}],"partialFingerprints":{"codehealthFindingId/v1":"6346a31b2ca3f27594c8224468330d2343287fd981a4d873c3fdadd815d78203"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/main/index.ts:3052 \u00B7 src/server/index.ts:1391 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":3052}}}],"partialFingerprints":{"codehealthFindingId/v1":"939f360dad2112a15f99f3f36fd2b00bbdaf2b569dfe50462e9447aabcfbd9c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/main/ipc/commands.ts:1688 \u00B7 src/server/ipc/commands.ts:1055 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"84229c88ab3365f99f47abcf5a009b881f0039b532a67de63430c2f2f180a548"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/main/plugin/ffmpeg-probe-electron.ts:133 \u00B7 src/main/plugin/ffmpeg-probe-electron.ts:184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-probe-electron.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"041b0adafaa7288118d982f2eff09587632b42ef5ea4abfc636dff38c95da48d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/renderer/routes/plugins/hooks/use-plugin-detail.ts:86 \u00B7 src/renderer/routes/plugins/hooks/use-plugin-metadata.ts:174 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-detail.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4464b028b6eb55641dbc57d2954ef11fc024f461315f7c733507d05e657128fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): src/renderer/routes/settings/cards/advanced-dialog.tsx:302 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:201 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:407 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:476 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"72490509cbb9484418a34e5c6814a9a746ee3b087a720a70683d15ecd889d230"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/container-platform-metadata.mjs:55 \u00B7 scripts/verify-container-publication.mjs:29 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-platform-metadata.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2982a280c40897d21fd6bbdc032525c723b3c7b6ed89d9451f3e9e27ee0479b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): scripts/smoke-fnos-package.mjs:361 \u00B7 scripts/smoke-synology-package.mjs:689 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-fnos-package.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8b2551f93ce918003f6163b1ff65e7d34141e5211252fc57f319128768c364"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/smoke-server-image.mjs:830 \u00B7 scripts/smoke-server-image.mjs:1235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bc34709095f6454ca55490b5f3071f27bfb29fc1ed48105f2120ceb8cb06aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/verify-snap-artifact.mjs:484 \u00B7 scripts/verify-snap-store-channel.mjs:343 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-snap-artifact.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba347aa6e60b5894267090b128ee972ae9c448ce943259efe928850e969621f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): src/core/bridge/pairing-prompt-controller.ts:196 \u00B7 src/server/bridge/remote-extension-admission-policy.ts:404 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf53bd36924893365cfecd078d1badf6804d8ee2506d630c028c98fd71e54b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/bridge/web-socket-bridge-server.ts:855 \u00B7 src/core/bridge/web-socket-bridge-server.ts:875 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c04102c860c29f7ddeae616e12d3b0cc2d452af10ff105cb8e3eb4a744b01e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/bridge/web-socket-bridge-server.ts:2133 \u00B7 src/core/bridge/web-socket-bridge-server.ts:2284 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b772866e24d59d6d28f733471f2c8413294b9b876f1092094b2cb4e2c49deacc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:67 \u00B7 src/core/legacy-import/http-activation-service.ts:99 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8e43581902999d95d112e8a144c0d8e2b531a5b179574e353c541e16a54f24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/legacy-import/http-activation-service.ts:707 \u00B7 src/core/legacy-import/import-service.ts:970 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c998b649f6d72b1f9c282a1bc2f04a0315d243eb18cabae53ce4e767dbc267d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/plugin/commands/schema-cache.ts:78 \u00B7 src/core/plugin/commands/schema-cache.ts:94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/schema-cache.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15db117b47217197c59173c637c76cdbbd875801817e5cf1f790b8980e17644"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/plugin/finalize/filesystem-adapter.ts:466 \u00B7 src/core/plugin/finalize/filesystem-adapter.ts:560 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8645d2128afed96adaf824835b4f43bd76917bb24a0921915f6d7435c71a130e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): src/core/plugin/finalize/native-artifact-operations.ts:557 \u00B7 src/core/plugin/finalize/native-artifact-operations.ts:658 \u2014 the two spans are one implementation copied and then locally edited \u2014 108 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5543e96f8c91c87993ffdff524e22f1ff785293ac558ee8eabaf50d62b8256"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): src/main/bridge/index.ts:1015 \u00B7 src/server/bridge/manager.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"f417f4cde01f0b344591cca6efb08aaea5550a67a98b784c4de1900a3b24780d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/main/index.ts:1297 \u00B7 src/server/index.ts:1834 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee1b83c25038be1c5f95145db5cebe030cf81a5c69b64038afb848818bb154e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/main/ipc/commands.ts:680 \u00B7 src/server/ipc/commands.ts:440 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b95f9d2ccaee8a6c9f37b19e5decdf357b94ab07a4bc90d389851a5707b595"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/main/ipc/commands.ts:738 \u00B7 src/main/ipc/commands.ts:756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"6698da59e6db52da2368bd55c901619a4b4cf1b3c22452c0608b4dfd842b1ddd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7 locations): src/renderer/components/ui/autocomplete.tsx:139 \u00B7 src/renderer/components/ui/autocomplete.tsx:165 \u00B7 src/renderer/components/ui/avatar.tsx:20 \u00B7 src/renderer/components/ui/combobox.tsx:177 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/autocomplete.tsx"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"419dfd36b5f23e7755c6fb481707b292b62fce50413b280c927fb146b281cdce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/renderer/routes/plugins/components/call-graph/plugin-call-graph-inspector.tsx:163 \u00B7 src/renderer/routes/plugins/components/call-graph/plugin-call-graph-inspector.tsx:240 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-inspector.tsx"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec055f1f13516783eecc41864b8cad42b49a833bca68e5fdcce2397d32b7796"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/renderer/routes/settings/cards/appearance-dialog.tsx:371 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:568 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbf73a3144097470677bbf46ac69ecc772e441589cba9bc58aca47534506426"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:315 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:755 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba27cc87c48dcc0bfe1adedcb92ddca24cd7fe305b3cff2ea8f04ff84a2ec445"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): src/renderer/routes/settings/cards/nas-dialog.tsx:369 \u00B7 src/renderer/routes/settings/cards/nas-dialog.tsx:434 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:271 \u00B7 src/renderer/routes/settings/cards/network-dialog.tsx:318 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c3fa67b4b068aa5915073370303267b513e5d4c4a607708f33456260e7ed4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/server/plugin/plugins-dir.ts:19 \u00B7 src/server/runtime-directories.ts:30 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/plugin/plugins-dir.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e89cb583c41481166ec15ebed59788c45dedf122f8d81ce4700c596cd475ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packaging/fnos/app/lifecycle.mjs:166 \u00B7 packaging/synology/app/lifecycle.mjs:349 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"afec57ed5730e75cb1532b30f0ecf7652e6013e67e29c4571d4a3b670de71d53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): scripts/container-platform-metadata.mjs:165 \u00B7 scripts/verify-container-publication.mjs:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-platform-metadata.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ede1c78137dea8cb32fc3badf95a0b6b6c08a5be35bc1acebc47f5d53977ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/smoke-electron-package.mjs:110 \u00B7 scripts/smoke-server-package.mjs:35 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-electron-package.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbe5905805971dadc2d88d4b0a73ba14535dec7607628e7bce4fe25953989c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/bridge/extension-pairing-projection.ts:727 \u00B7 src/core/bridge/file-extension-pairing-projection-store.ts:336 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"6932714461c9b459abe6e0c90639a5bcc32bc39765b4745a79ef29f965e809b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:479 \u00B7 src/core/legacy-import/http-activation-service.ts:778 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dd5c6ea8ed0a60e9d40e8203b94763048752c85f5bf36d2ca09898198e3744"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:602 \u00B7 src/core/legacy-import/http-activation-service.ts:987 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac128b9cb0714b4b5b262119368cb054506bb03392b48fbfa0a1ca915a7678d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/legacy-import/http-activation-service.ts:525 \u00B7 src/core/legacy-import/http-activation-service.ts:948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66dc6b27681792f28b3e43eba7bb308d98e6a999a33a540b3db9fbbc67dae12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/core/plugin/capabilities/fs-sandbox.ts:49 \u00B7 src/core/plugin/capabilities/fs-sandbox.ts:85 \u00B7 src/core/plugin/capabilities/fs-sandbox.ts:118 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-sandbox.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"90135776a43975c6dd0bff5589f34c79e98e5eeb4fcc74d4e00ade26fba78a14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/plugin/finalize/finalize-recovery.ts:582 \u00B7 src/core/plugin/finalize/finalize-recovery.ts:656 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"654a3548dcb54e07aabee76c8a3f66c2fc0637bf062e15cb9ac7e24fcf74a7a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/plugin/hooks/ctx-update.ts:52 \u00B7 src/core/plugin/hooks/ctx-update.ts:75 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/ctx-update.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcb5a4c401bf288b36457ca4d79c33d05d0bf197cbe9e736cb6813ca0db9c39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/main/bridge/native-messaging-installer.ts:325 \u00B7 src/main/bridge/native-messaging-installer.ts:400 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/native-messaging-installer.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"382fcfe4ab412024f9c40236de7a4e6ebc3625d1d8787708669784aafe2ec1ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/main/index.ts:2267 \u00B7 src/server/index.ts:1677 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3afae35ab02539ae18f9fe4e3af96cdb4157f69e406d0c47e438318094b3a0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/main/index.ts:3103 \u00B7 src/server/index.ts:1435 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cdf6ce9df6ce33882c54a277990ab0983a924c533e1d24f584425f03e73424"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/main/ipc/commands.ts:703 \u00B7 src/main/ipc/commands.ts:1172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef514f757dc3c23c3868f9eeb54ffc35ced04437031d6da824dbac52bace333"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/main/ipc/commands.ts:790 \u00B7 src/server/ipc/commands.ts:545 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8ed0b099c366e279baa00af73f43f00115e97214447a52f6bc13a8aeec6c37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/main/platform/windows-default-apps.ts:82 \u00B7 src/main/platform/windows-default-apps.ts:105 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/windows-default-apps.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b2f9fe5bfbc9dcb4efec189450cb9cbf6e8076b693bbe00019e59d8bdda3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/components/add-task/advanced-panel.tsx:271 \u00B7 src/renderer/components/add-task/advanced-panel.tsx:285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/advanced-panel.tsx"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafa8d4784dcabe178747e90a53db37d5a21ae3fd3341703b7b2152427578abb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/components/desktop-kit/selection/create-selection-store.ts:120 \u00B7 src/renderer/components/desktop-kit/selection/create-selection-store.ts:137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/selection/create-selection-store.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae08c3b6ae371952cd320a8f28abaf39d7068ada4ea7cb0792d58ffab13bc66b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 11 locations): src/renderer/components/ui/alert.tsx:31 \u00B7 src/renderer/components/ui/avatar.tsx:64 \u00B7 src/renderer/components/ui/card.tsx:25 \u00B7 src/renderer/components/ui/card.tsx:45 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 copies are spread across 8 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/alert.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"50152a20c6ab663303f414ead77c224cf83ac68de576f83ed9614432b17326ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 12 locations): src/renderer/components/ui/alert.tsx:36 \u00B7 src/renderer/components/ui/avatar.tsx:69 \u00B7 src/renderer/components/ui/card.tsx:4 \u00B7 src/renderer/components/ui/card.tsx:30 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 copies are spread across 8 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/alert.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c915b0f5d6efa80e086c9ab593aa25db66197ca523177a562c2855c7b09ab9d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/features/directory-preferences/directory-preferences-section.tsx:243 \u00B7 src/renderer/features/directory-preferences/directory-preferences-section.tsx:280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee33f4622d18187f951b4df9b9fba48a2432a8af5250ae9e87788bca69265cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/renderer/features/plugin-operations/operation-form.tsx:48 \u00B7 src/renderer/features/plugin-operations/operation-form.tsx:477 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ce91b3d835c39b5605e2fdb01f5aad1fb9587c980fccfa9dd1673b197f8bd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx:650 \u00B7 src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx:1014 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad11fdf69951cb53dd1b5dabd00c04c8ac8fde463ecb7cb020c1781938cc8c53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/routes/dashboard/layout/dashboard-layout.ts:226 \u00B7 src/renderer/routes/dashboard/layout/dashboard-layout.ts:247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/layout/dashboard-layout.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdb249e0c88e165e0e0938ad4f6217a1794fba9a765ed367dd717e56152a1d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/routes/downloads/inspector/trackers-tab.tsx:251 \u00B7 src/renderer/routes/downloads/inspector/trackers-tab.tsx:279 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ee7f113045db731a354f7249b63d72d100a957b23b7d51c2bc4cecb9e7f5c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/routes/downloads/inspector/use-task-actions.ts:119 \u00B7 src/renderer/routes/downloads/inspector/use-task-actions.ts:133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c67929827a698351dfa4a324c6b01b2b189299a251f0963722516d81352feb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/renderer/routes/plugins/components/builtin-update-dialog.tsx:164 \u00B7 src/renderer/routes/plugins/plugin-install-dialog.tsx:331 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/builtin-update-dialog.tsx"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d74434bcb18eab92de51f1d375954da64882f9184cf66daea49dd625cae750"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7 locations): src/renderer/routes/plugins/components/plugin-log-tab.tsx:87 \u00B7 src/renderer/routes/settings/cards/engine-tuning-section.tsx:164 \u00B7 src/renderer/routes/settings/cards/engine-tuning-section.tsx:203 \u00B7 src/renderer/routes/settings/cards/engine-tuning-section.tsx:239 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 5 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-log-tab.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"409b6517b4423cd5f43254246e181b18302d6cf5f11b8b6f881eded6c53007a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx:129 \u00B7 src/renderer/routes/settings/cards/integration/trusted-extensions-section.tsx:180 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8cde51afcd672db4fd1ed1d14f70a83ac9d0b02e8fbfca47b0d9458a9f7a4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/server/bridge/server-extension-mbp1-runtime.ts:148 \u00B7 src/server/bridge/server-extension-mbp1-runtime.ts:208 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-extension-mbp1-runtime.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3767a33349b2f072ae977503f248d6f851aba17074f0961efdf0f88d1a0bee6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/shared/schemas/plugin-hooks.ts:647 \u00B7 src/shared/schemas/plugin-hooks.ts:668 \u00B7 src/shared/schemas/plugin-hooks.ts:689 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f639abacfc19fdfe31c13d9cad15c24f7db3eb66253bc8c2f0ce9e5d3429d10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/native-host/build.mjs:190 \u00B7 packages/native-host/package-flatpak-companion.mjs:376 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/build.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f575dff473d6ea40a00ebf01680164266c640a87127021018ab7eb74910ef267"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): scripts/fetch-engine.mjs:344 \u00B7 scripts/fetch-engine.mjs:428 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-engine.mjs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c76fad5164886010f0a3567c762d48d21e82252522e996dca89a7fdf268b84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/prepare-flatpak-project.mjs:192 \u00B7 scripts/verify-flatpak-packaging.mjs:635 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-flatpak-project.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1bc0edcf2511389f03026b4c68880805b522e79dc972a1aae4d42d86719409"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/prepare-synology-project.mjs:127 \u00B7 scripts/verify-synology-package.mjs:159 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-synology-project.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c499a3d41327784056712890abb79fd8c7f5faeefe517313a1ae188180420027"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/engine/aria2/aria2-tuning.ts:101 \u00B7 src/core/engine/aria2/aria2-tuning.ts:127 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-tuning.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"978b66626603893fda620a1d5779271bbd90c22bd43bf2a498ac632d0b59346a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/inspector-activity/task-inspector-activity-store.ts:485 \u00B7 src/core/inspector-activity/task-inspector-activity-store.ts:623 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dc4ee8b7edefbd5843894b763cfacf646fc980c85da61d3441d5eff52789be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/plugin/capabilities/fs-sandbox.ts:22 \u00B7 src/core/plugin/capabilities/fs-sandbox.ts:64 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-sandbox.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd553b85c83dd91af0f988c5e35c8842e944ac08aefda58d554a292402953b11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/core/plugin/finalize/artifact-identity.ts:391 \u00B7 src/core/plugin/finalize/artifact-identity.ts:419 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/artifact-identity.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaee2515e53b7239f709db700aff5627e81a3f6a5c3cbf26fcd6276e00d0942"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/core/plugin/post/delivery-retention.ts:317 \u00B7 src/core/plugin/post/delivery-scheduler.ts:582 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-retention.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c8264acfa2f2548ab1bc011c0299c55f51cb32cdb1e376150acdab4e0ad737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/session/motrix-database.ts:992 \u00B7 src/main/index.ts:1169 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5340b2d0f882791a55cfc0098d004cd01ed711088e1fd95129fbe457d0be3df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): src/core/torrent/magnet-tracker.ts:1435 \u00B7 src/core/torrent/magnet-tracker.ts:1565 \u00B7 src/core/torrent/magnet-tracker.ts:1587 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"422b1fbcf4dca63b742b97e2158606201fbd5b86cd05ac7e6bdc3eaed1d29618"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/torrent/magnet-tracker.ts:1653 \u00B7 src/core/torrent/magnet-tracker.ts:1893 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c09dacb9bce68707e13bc15bbe1e4bd46c8b20955dc743e283a91e8ac7abf8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/main/bridge/snap-environment.ts:25 \u00B7 src/main/bridge/snap-environment.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/snap-environment.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dae79daeb74b190c83374572df300a584dd512acd056208f2ef448935e67878"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/main/ipc/commands.ts:805 \u00B7 src/server/ipc/commands.ts:530 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a7f52e933b6a3ef75db5fd46d90372d7de2b02b126c14a64522121001f4601"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/main/platform/appimage-integration-host.ts:195 \u00B7 src/main/platform/appimage-integration-host.ts:212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration-host.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d23977fc6eb6441917d15f7b331f2e3395f10cb6862cf04a293fceae0bd73d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/main/platform/tray-icon.ts:102 \u00B7 src/main/platform/tray-icon.ts:141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray-icon.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4034bfbae76f023466ce04ea46234ae2a52186a7408581c2edf87088b0a4a161"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/renderer/components/add-task/drop-zone.tsx:36 \u00B7 src/renderer/hooks/use-window-torrent-drop.ts:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/drop-zone.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"876b807dac123254b2ab700d800e5c1f8176a3ad22a255b63a2c03136dd4b683"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/renderer/components/desktop-kit/cubic-glass/renderer.ts:253 \u00B7 src/renderer/routes/dashboard/activity/activity-calendar.tsx:443 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/renderer.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8fc9882a9472a04d64c811c4dd1977a97ad48096435c0d8cd5a601a211bf17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/renderer/features/legacy-import/legacy-fresh-download.tsx:254 \u00B7 src/renderer/features/legacy-import/legacy-import-dialog.tsx:983 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-fresh-download.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9adcd431f39a8f4ff43484cf5650454478403c587528c40c043cc8a6e1311d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/renderer/hooks/use-geoip-status.ts:19 \u00B7 src/renderer/hooks/use-global-stats.ts:12 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-geoip-status.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52264720ff0a7f0598b235edc2604be3a8fc5a69c62338105a0c23f280b99be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/renderer/hooks/use-task-activity.ts:431 \u00B7 src/renderer/hooks/use-task-list.ts:412 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-activity.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"984420c786728b7c59d2374912b1dafaed960145f75cd430ed0af85284b25119"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/renderer/routes/plugins/components/access-section.tsx:42 \u00B7 src/renderer/routes/plugins/components/plugin-permission-list.tsx:35 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/access-section.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a819b1829bae92e51b2b24809674e9925bfb8f8a230bf40cdbed07c9ea2ada"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/renderer/routes/settings/cards/appearance-dialog.tsx:481 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:556 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0fc3bb0d77c055309d1dbeec121c760126d4a174022b864c1b2c6b9c9b436d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:219 \u00B7 src/renderer/routes/settings/cards/bt-peer-geo-section.tsx:256 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"550d44eabc74e70ae64159d60d3e5a735762a304837277940270dfeb87f7f659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:412 \u00B7 src/renderer/routes/settings/cards/bit-torrent-dialog.tsx:482 \u00B7 src/renderer/routes/settings/cards/proxy-section.tsx:334 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e494e16c4d1b7747d9aaf43effbab6a846eb7e6b4d666e6b3d9f25e60c8a5702"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/finalize-fs/build.mjs:23 \u00B7 scripts/audit-server-runtime.mjs:280 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/build.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f76b51bff6a87354dccf663dced404ff5587e6f523a38b14c1c62a59a007a42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packaging/fnos/cmd/account-authority.mjs:111 \u00B7 packaging/synology/app/lifecycle.mjs:36 \u00B7 src/server/platform/nas/pairing-file.ts:23 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cccd2d99c50a679ad30424f39d2a17ebc201ae8b94bd3c4fe66c0a057e2049"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packaging/synology/app/lifecycle.mjs:22 \u00B7 src/server/platform/nas/settings-store.ts:24 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb415d237cd7b9319e848a92b70dead851925216ed386d60c2eafdd039ee440d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/container-platform-metadata.mjs:202 \u00B7 scripts/verify-container-publication.mjs:75 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-platform-metadata.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7b02a5b1157cbd7276a4597628c6091ad2241e1f598002ae4a6f561918a1eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/measure-desktop-memory.mjs:49 \u00B7 scripts/measure-desktop-navigation.mjs:53 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure-desktop-memory.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbac72787f6fc7c8d6cedff3673a7c1f39d5cb804e8db7d5c206da1682282874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/prepare-fnos-project.mjs:118 \u00B7 scripts/prepare-synology-project.mjs:49 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-fnos-project.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"060efac5e1046c0fd6c5d3ca0c568fa71e9a4f4d462bf761886c7cde54387c7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/verify-appimage-artifact.mjs:170 \u00B7 scripts/verify-appimage-artifact.mjs:184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-appimage-artifact.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c97974d01829fa31caab15b34125bc261aab6791074b0db10518fcad1293729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/verify-remote-extension-compatibility.mjs:9 \u00B7 scripts/verify-remote-extension-threat-evidence.mjs:17 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-remote-extension-compatibility.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b58e92e63cd4f9486b61a48fa72f565fc9bafcc9f5a4ca6f89494e6bff746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/bridge/bridge-data-dir-lock.ts:939 \u00B7 src/core/bridge/file-extension-pairing-projection-store.ts:402 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"2761c53af48355fb36675fbc732ddf8429a75bada5957ca89e84d4666e16d4e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/core/bridge/extension-pairing-projection.ts:575 \u00B7 src/core/bridge/pairing-service.ts:167 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9c2bc3ea8944d2785f39c1437d455b4317762dfebcd1946a3e5dccb4c3b6e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/core/bridge/web-socket-message-stream.ts:82 \u00B7 src/core/bridge/web-socket-message-stream.ts:134 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-message-stream.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b9fd0aa0424e765a28c1944e54f8aa7b35b40e23d56bcddd536a3eafc92eea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/core/plugin/finalize/filesystem-adapter.ts:315 \u00B7 src/core/plugin/finalize/filesystem-adapter.ts:478 \u00B7 src/core/plugin/finalize/filesystem-adapter.ts:506 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2721da523a896e0c3032465976df33c7da7a737d3b9cd48ea7e14150617418c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/plugin/finalize/finalize-recovery.ts:279 \u00B7 src/core/plugin/finalize/finalize-recovery.ts:756 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"743aaaae82ba3c1b0b9c211d95a09fcf7c2a222e4b2502ea19a8ef091079e22a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/plugin/finalize/finalize-recovery.ts:607 \u00B7 src/core/plugin/finalize/finalize-recovery.ts:727 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09222939d97ec4b44376e991bba62eac2c2f93b5387a4e8e1cf70e010650a48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/plugin/install/moext-reader.ts:138 \u00B7 src/core/plugin/install/moext-reader.ts:484 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/moext-reader.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbce8c53243bf65443daa38dc8674d6300be1a7679bab36d986d41b367575cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/plugin/security/security-service.ts:319 \u00B7 src/server/app-update-service.ts:35 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/security/security-service.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe77db5ac9242b3db4b7e3f6ae10b98506d947eac2c38bc42aad4cc28031d90f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/core/task/actions/finalize-task.ts:420 \u00B7 src/core/task/actions/finalize-task.ts:735 \u00B7 src/core/task/actions/finalize-task.ts:750 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"681bebb572ca00c10fa08b01158f0d95f37c33b5fde118f6df12940261a7cdde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/core/task/media-task-coordinator.ts:844 \u00B7 src/core/task/media-task-coordinator.ts:923 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41ee27d5b09b78d06ee5292832da608d6185fe7ba953c47eb4b5ab7755e7d90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/main/bridge/index.ts:1064 \u00B7 src/server/bridge/bootstrap.ts:443 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd00d81cea5eed755c419fb846f805e8fbec0692b6aba29f71edfb8c739881a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/main/commands/definitions/app.commands.ts:6 \u00B7 src/main/commands/definitions/navigation.commands.ts:6 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/commands/definitions/app.commands.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"90907a07903e20754efe7b6da774afa1a3c426d7207d43b679bb321eeba6f802"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/main/index.ts:1087 \u00B7 src/server/index.ts:1183 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1bde931bd92554ef9e198239451b938e0797f001721b4b54f9b02ef06762a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/main/index.ts:2169 \u00B7 src/server/index.ts:660 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea14461c00a69d8f781408fd8bd74cb98baa319dbd81240979b7eead9bd25a8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/main/index.ts:2355 \u00B7 src/server/index.ts:908 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"957660e40ab2377db4350ab72739dd61f02a0efb479894f64ea61f65193ce8e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/main/ipc/commands.ts:571 \u00B7 src/server/plugin/install-service.ts:31 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc95512e4722bc3c0440636a2e172159b07b964ccc22ba4af6725bf24f9e36c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/main/ipc/commands.ts:2034 \u00B7 src/server/index.ts:1453 \u2014 the two spans are one implementation copied and then locally edited \u2014 106 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2d062ea3d8cb7874012b58ad4c021404827fd146b352a69ed24863c84592b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/main/ipc/queries.ts:157 \u00B7 src/server/ipc/queries.ts:246 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/queries.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c962032e81262ba4aac16733512a1622e0c7c7a18163362dd215153ac418d3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/renderer/components/language-sync.tsx:86 \u00B7 src/renderer/routes/downloads/downloads-more-menu.tsx:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/language-sync.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"18402c36505dd0204a9fb8940508b680bcf2a7fd80316b5a431a3cf0705db303"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): src/renderer/components/settings-kit/plugin-config-field.tsx:46 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:273 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:408 \u00B7 src/renderer/routes/settings/cards/appearance-dialog.tsx:449 \u00B7 \u002B2 more site(s) not listed \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/settings-kit/plugin-config-field.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d175d6d54311780a0beff1cb0c60566278fac07ff8a2e83b1faef53346c0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/renderer/features/legacy-import/legacy-import-dialog.tsx:89 \u00B7 src/renderer/routes/migration/migration-page.tsx:9 \u00B7 src/renderer/routes/settings/cards/nas-dialog.tsx:98 \u2014 the 3 copies are spread across 3 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8b15f8133b5e2f6cf35f7fd13e7c33ef910631670493e07b5ebdc8dc0178cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/renderer/features/legacy-import/legacy-import-dialog.tsx:520 \u00B7 src/renderer/features/legacy-import/legacy-import-dialog.tsx:999 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e12c96cff931bdc3f9f6574adf5e68b2f30090ee7f0cf23b28050ec8f51210"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/renderer/lib/directory-preferences.ts:169 \u00B7 src/renderer/lib/directory-preferences.ts:354 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/directory-preferences.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb739f79808d5befebb06c11917ba0548d27991899f39f8d15c7eb0b846a669"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/renderer/routes/plugins/plugin-diagnostics-page.tsx:181 \u00B7 src/renderer/routes/plugins/plugin-diagnostics-page.tsx:199 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"acae73016ef687f0a3e0c385f457d203ad537ceae6928831555b093ff5647e03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/renderer/routes/settings/cards/integration/media-tools-section.tsx:248 \u00B7 src/renderer/routes/settings/cards/integration/media-tools-section.tsx:287 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc46ef5765efe486ce0767b3acf509384849c2fd40e6fbb023a83e9a16ef03d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/renderer/routes/settings/cards/speed-limit-section.tsx:204 \u00B7 src/renderer/routes/settings/cards/speed-limit-section.tsx:543 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/speed-limit-section.tsx"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b41892e5e890a752115904134ec8f72722529bcd9a408257443aa1226e06e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/server/download-path-policy.ts:107 \u00B7 src/server/plugin/plugins-dir.ts:22 \u00B7 src/server/runtime-directories.ts:33 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/download-path-policy.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5330ce66a37fccd91c761fdce9a494b5efa0b522f7aae77ac11475f459a0549"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/shared/schemas/directory-preferences.ts:22 \u00B7 src/shared/schemas/nas-settings.ts:54 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/directory-preferences.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ad85df32ea344bac42aa23efd2fae9acb990edd52ca701f29a118f4de50fe8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/shared/schemas/plugin-hooks.ts:370 \u00B7 src/shared/schemas/plugin-hooks.ts:385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b0f8b02ced6d69210877903395bfe239492446f87bc9771acdfedf689101e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/assemble-release-artifacts.mjs:286 \u00B7 scripts/verify-update-artifacts.mjs:157 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e669f463ad91e16d23d3e3f7f8cbfa83b710b25d748b5fa57fb8d5760e58c6c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/electron-package-utils.mjs:178 \u00B7 scripts/server-package-utils.mjs:494 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e3a0c08fa0f16909f262a7dbe91160876239beb187a35af06cf596667a15d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/fetch-builtins.mjs:410 \u00B7 scripts/fetch-builtins.mjs:421 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-builtins.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e0902ec15415a13ed5e4a637e66e2a284afa1b65d038b82214cdf6f0b9864e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scripts/fetch-builtins.mjs:360 \u00B7 src/core/tracker/tracker-syncer.ts:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-builtins.mjs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde3331e9b5f5b2918235bd42117e127a54b6b5c01976a0cd1c186a96b9139ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/measure-server-images.mjs:178 \u00B7 scripts/smoke-server-package.mjs:291 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure-server-images.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"524d5e1fafd14f523adfe60a5085431e7ce6b893c27f892360ee19e2b757980e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/measure-server-images.mjs:258 \u00B7 scripts/verify-server-package.mjs:588 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure-server-images.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1384594fdbb733c4f3242a471ae56507f26adc303a353e919fff07630dd8e83a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scripts/release-signing-input.mjs:333 \u00B7 scripts/release-signing-input.mjs:404 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa3dc4e24c96d7ce9c78101affe47161e300f30c313500b57e565f0c0c96ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scripts/run-remote-extension-release-soak.mjs:474 \u00B7 scripts/run-remote-extension-soak.mjs:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/run-remote-extension-release-soak.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"809de4761aba2781748b7e8fee2a95e4b7f13af621361dc631011a1804656232"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/core/bridge/bridge-data-dir-lock.ts:911 \u00B7 src/core/bridge/extension-pairing-projection.ts:875 \u00B7 src/core/bridge/file-extension-pairing-projection-store.ts:424 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b9a53b3fda748960d905f4d7b2c8656ae9bb85e90ce956d53d5845ca35d22f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/bridge/credential-store.ts:598 \u00B7 src/core/bridge/credential-store.ts:633 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc72b0f2b6efca552823cd2fe3d3116ffdcd576cb28bd8f2bb0f142dea72d7d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/bridge/mbp1/envelope-message-stream.ts:189 \u00B7 src/core/bridge/mbp1/envelope-message-stream.ts:211 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/envelope-message-stream.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e886840600b33c65de4ad4d33a43b86365e2b1ebeb00bf4f6f0b173eaf1906"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/ffmpeg/verified-install.ts:166 \u00B7 src/core/ffmpeg/verified-install.ts:203 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"64098e1833b73e2cd0dc017b9cbf607b8212b04ba35cdebee81b9b0cb08d700b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:50 \u00B7 src/core/legacy-import/http-activation-service.ts:79 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f3d54b60fb4a5d5954d78d247e0ff254ec35cded5384095c52dfa86dc1f271"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:396 \u00B7 src/core/legacy-import/http-activation-service.ts:679 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e28dccae48b84950e3ac0f2132bc445b423236f6ffe0c0f268acfb8fb7891d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/plugin/host/capability-bridge.ts:828 \u00B7 src/core/plugin/host/capability-bridge.ts:854 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f701993b4767e580709565e836825f80cb3a26c6cb4ce6ed5a34454cbf4380eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/plugin/network/plugin-http-client.ts:132 \u00B7 src/core/task/direct-resource-validator.ts:214 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/network/plugin-http-client.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a03b4b787960ff10862a98258d84479a8e8bae3a33146834b8520f86b78407"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/task/actions/finalize-task.ts:152 \u00B7 src/core/task/task-recovery-service.ts:163 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d343765fa51d6ac81d3879d1a7a46d86891453e484c41222775cf9b7808c378"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/task/create-task-handler.ts:400 \u00B7 src/core/task/source-admission.ts:69 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82046d5fa56a34e924620f1ba0c7c319882445ddafd73a57610080a22f2ce2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/main/index.ts:1279 \u00B7 src/main/index.ts:1473 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8ef23c4436fb573c3d0be2bae36e642f98005285cbb8367c3a31a7dbf2b23b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/main/index.ts:1372 \u00B7 src/server/index.ts:1319 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eab98bcd25791f79530d8439d20eb11565723c35dbbc27b34fd01e4b91fe562"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/main/index.ts:1609 \u00B7 src/server/index.ts:1996 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4a7f71506cfa58225fd9666eaca4c35789f731c53a038e421da47a6c6bb7c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/main/index.ts:1689 \u00B7 src/server/index.ts:537 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c08e4970d145a50e4b65645d41ae5d499c7a67442a9d7cc8a3c2efe4fb9523"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/renderer/components/language-sync.tsx:76 \u00B7 src/renderer/components/theme-sync.tsx:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/language-sync.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77f22130cdcd8db1012f944787c58bc4512839636ad1535b9f9e8fb6d8b8376"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/renderer/features/directory-preferences/directory-preferences-dialog.tsx:46 \u00B7 src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx:302 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2840fe517e1f84085d3704a8ae4942d383258a91473b525eac429fdcb761e803"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/renderer/lib/directory-preferences.ts:39 \u00B7 src/server/platform/synology/api.ts:167 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/directory-preferences.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa6b50a978ea21e52a7f5e6e03b242e8b1a1f91c36a8e9333b41b4adc0a52f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/renderer/routes/dashboard/components/dashboard-grid.tsx:741 \u00B7 src/renderer/routes/dashboard/components/dashboard-tile-frame.tsx:250 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f928133c938f00c62080a60e111c8aa8654cac964593a0718de5d441cd9e51b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/renderer/routes/settings/cards/bt-peer-geo-section.tsx:180 \u00B7 src/renderer/routes/settings/cards/performance-section.tsx:131 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bt-peer-geo-section.tsx"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179500455f900d11fa57c02220db6de5b53fd8489659710bd8d8744b5704f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/shared/schemas/downloads-settings.ts:118 \u00B7 src/shared/schemas/general-settings.ts:43 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/downloads-settings.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52a24f8dd209050bc04eb1be45840da98f4557e7c2515e550806fa658eb5ac6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): vite.renderer.web.config.ts:34 \u00B7 vitest.config.ts:8 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vite.renderer.web.config.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f064b03a71af5a813d95e1fe55c3bbd472430333c77a54c0346fc14fab7057d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/fetch-engine.mjs:569 \u00B7 scripts/postinstall.mjs:106 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-engine.mjs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04857c7fd1b19167ca71a45a265de981b2470e0a9ca502a5049a96b781745f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): scripts/measure-server-images.mjs:197 \u00B7 scripts/release-signing-input.mjs:295 \u00B7 scripts/smoke-server-image.mjs:554 \u00B7 scripts/smoke-server-package.mjs:302 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure-server-images.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb0314c3c892ec0b3a4df394bdf4b446aa185b5e7e3c0f65a63fef51c75d329"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/obsidian-docs.mjs:202 \u00B7 scripts/obsidian-docs.mjs:247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d622e81040c989d999e50f270b710a9976e42e31825260ad752c9a2b8865df8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/run-remote-extension-release-soak.mjs:475 \u00B7 scripts/verify-remote-extension-threat-evidence.mjs:183 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/run-remote-extension-release-soak.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2801040bf726d79c4b300c8599386e584d1ea96e6811d9a0f099872c08634914"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/sign-plugin-security.mjs:79 \u00B7 scripts/stage-server-app.mjs:672 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sign-plugin-security.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacf4cfb4fbe9a7f5392a232087fd324ebb97464f180e6d5d87795db5919c6c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/sign-plugin-security.mjs:79 \u00B7 scripts/verify-electron-package.mjs:808 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sign-plugin-security.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e382d1a756c0e895d158cce7b62d8160847f50f7b6950c13628a598a8d412c8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/smoke-fnos-package.mjs:313 \u00B7 scripts/smoke-synology-package.mjs:409 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-fnos-package.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a26b1c07ff6a3f6d20233d6da5a1dd44b7c5a0550b31ef4ca6cefe4fae1882d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/smoke-server-image.mjs:1353 \u00B7 scripts/smoke-server-package.mjs:452 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ff2a517808a39a7b4cbd10e9eed1a073705252c4b08652f636492f33e6a284"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/test-tray-render.mjs:60 \u00B7 scripts/test-tray-render.mjs:179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-tray-render.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf424e34112a69e5753235a0f0b5e193b91f210982c759075c03ab40a846727"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/core/bridge/extension-pairing-projection.ts:575 \u00B7 src/core/session/session-manager.ts:400 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4fa59714453d4a267cb39d6170aa527fe9165f1d3922ca4b181114f69fcff7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/bridge/mbp1/envelope-message-stream.ts:176 \u00B7 src/core/bridge/mbp1/envelope-message-stream.ts:198 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/envelope-message-stream.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebedc4c195c45408722b9406e9ba32deefe93f01e58b9d5684fb8095c23c82e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/core/bridge/pairing-service.ts:167 \u00B7 src/core/session/session-manager.ts:400 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-service.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1d930008dcecdf5f06f2cb87fa3778dfa885cea03b7ead8d79c25ae98e9dab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/core/bridge/web-socket-bridge-server.ts:831 \u00B7 src/core/bridge/web-socket-bridge-server.ts:849 \u00B7 src/core/bridge/web-socket-bridge-server.ts:867 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59951f8f372de0f7dcd48b3dd5389f2027317e09fa1607383c28eaef9315aa6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/bridge/web-socket-bridge-server.ts:1828 \u00B7 src/core/bridge/web-socket-bridge-server.ts:1926 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"372efbcba8899b608b2fa3e27ca25abee9d11ab72e33ec0d71b7c9d9aa4688a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/core/engine/aria2/aria2-adapter.ts:1401 \u00B7 src/core/proxy/aria2-proxy-routing.ts:264 \u00B7 src/core/task/direct-resource-validator.ts:1611 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"344f7a541c99de24e2390c5de889c939dad24a407fb78aa319f56accefa674ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/engine/aria2/aria2-rpc-client.ts:343 \u00B7 src/core/engine/aria2/aria2-rpc-client.ts:376 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-rpc-client.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a62eab1253e31062d96f59d59ddd1f423dd9c9850d5f2014cbc46c488ea8dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:131 \u00B7 src/core/legacy-import/http-activation-service.ts:206 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c19c8931561f4ba1c63a73c974f77a70d3b542eff2488f6ac51da681f5920b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:210 \u00B7 src/core/legacy-import/http-activation-service.ts:318 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"562ad1d7f5ff32198ff426ba8157fb58b6c362c956734c9d568b4a723606b703"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/core/plugin/capabilities/fs-task.ts:165 \u00B7 src/core/plugin/capabilities/fs-task.ts:291 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-task.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"15555bb18796e5b244eec82322445784db107331a42970ffb85c414347c4e6af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/plugin/host/plugin-host.ts:866 \u00B7 src/core/plugin/host/plugin-host.ts:881 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a62e08ba36efae7629cdc54cbfbe9f50a0556e56f943e26975aa34926a31041"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/plugin/host/quick-js-worker.ts:939 \u00B7 src/core/plugin/host/quick-js-worker.ts:986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8de049d37058eefcb94698c30232b5821160e7d7c035f38f0042751d3cc133"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/plugin/install/plugin-installer.ts:169 \u00B7 src/core/plugin/plugin-registry.ts:164 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c129747e53c869f48eff9d1d8149f4b180b6e808d3b766ac157370baa59568b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/plugin/update/builtin-updater.ts:236 \u00B7 src/core/plugin/update/builtin-updater.ts:285 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/update/builtin-updater.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a80c09d49566095d9a82dc9f35575577702aea1aa926b87edd79c3a70a8567"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/session/finalize-journal-repository.ts:165 \u00B7 src/core/session/finalize-journal-repository.ts:208 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaaaa237ac19e0c6e74df84be10636de2e4a3eb5d2c6fab1f3776f1718d5f43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/task/bt-duplicate-policy.ts:40 \u00B7 src/core/task/bt-output-reservation.ts:42 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-duplicate-policy.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d7e6b975b80e3086662753a569e5846a36d3cb271ac1924bc7ffeaf27d557a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/main/bridge/bridge-manager.ts:95 \u00B7 src/server/bridge/manager.ts:125 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/bridge-manager.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f69c80c024f47b1e17807f924987670e96c14519e5355947c346219e270623"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/main/index.ts:2667 \u00B7 src/main/index.ts:3106 \u00B7 src/server/index.ts:1438 \u2014 the 3 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a603d98eb208e04812c57540dfc6a04d64e2da94d67eebb9569216712d65b668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/main/ipc/commands.ts:559 \u00B7 src/server/ipc/commands.ts:457 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"96da4793165caa755d811da8bb9c562a9b93dd8c4304ddbab5b25753868e5eb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/main/ipc/notifications.ts:24 \u00B7 src/server/ipc/commands.ts:1243 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/notifications.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"94da74c05e0ec2d5c37b0f992222248abce42e42dbfc6516cc0b6bb5369b191b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/main/platform/appimage-integration-host.ts:167 \u00B7 src/main/platform/appimage-integration-host.ts:222 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration-host.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861cbac58e15f74f1b436a26fb5f5337c24dd6bcdf00b1393149a377d644292"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/main/window/renderer-supervisor.ts:309 \u00B7 src/main/window/renderer-supervisor.ts:337 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14f4d3e20398f0b0fa7b14f04e8979398c59f32d255adc50cc7af32eda61135"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/main/window/window-manager.ts:113 \u00B7 src/main/window/window-manager.ts:157 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b283f12c8b5663665e56bd8bfdfef0cdd90964fce8cf73f112803f9540d49715"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/components/desktop-kit/cubic-glass/cubic-glass-motion-lab.tsx:135 \u00B7 src/renderer/components/desktop-kit/cubic-glass/cubic-glass-motion-lab.tsx:147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/cubic-glass-motion-lab.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf7a1173608dd4f8357c444a607fcdebfd2ebdd4f6caecb0175af340ec3d158"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/components/desktop-kit/sidebar/nav-user.tsx:52 \u00B7 src/renderer/components/desktop-kit/sidebar/nav-user.tsx:71 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-user.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f80a9f3c94cbcfb459a41526c75c96234db92cd0624ee903e1c6ee2b435dd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/components/desktop-kit/toolbar-glass/toolbar-glass.tsx:6 \u00B7 src/renderer/routes/downloads/global-stats-bar.tsx:9 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/toolbar-glass/toolbar-glass.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"11413e5220ccafe1cfb7e6281b82800a46d85d9d6bb4f4629c6ec9c32c5c3daf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/features/application-menu/use-menu-command.ts:76 \u00B7 src/renderer/routes/downloads/task-actions-menu.tsx:200 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/use-menu-command.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5808877aba91330e862f566844c370dbff1f8e13b284c2824ee1cc656c3c199"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/renderer/hooks/use-speed-limit-state.ts:51 \u00B7 src/renderer/hooks/use-task-inspector-activity.ts:130 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-speed-limit-state.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28777bde83ebb226492eead353045bc223d94b4623d5d5dcc4c22994612ae27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/routes/dashboard/activity/activity-calendar.tsx:675 \u00B7 src/renderer/routes/dashboard/activity/activity-calendar.tsx:715 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b74549b414efa85b560ad64be54dcb4416e0c2cd06d051497759945f8ae701c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/renderer/routes/plugins/components/access-section.tsx:45 \u00B7 src/renderer/routes/plugins/components/inline-consent-panel.tsx:125 \u00B7 src/renderer/routes/plugins/components/plugin-permission-list.tsx:38 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/access-section.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8033ea0b8151db5b064bf62e060d371921852346826f7de2140f2172ec5fac69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/routes/settings/cards/general-dialog.tsx:169 \u00B7 src/renderer/routes/settings/cards/general-dialog.tsx:409 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8e141674ebfdeb853dbed7c2f8a722076b24a7c3ef7043559aed69a8244f14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx:127 \u00B7 src/renderer/routes/settings/cards/integration/pending-approvals-section.tsx:28 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/browser-extensions-section.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2e1ee87ce751edd277ed344a714398731a6b8c86b9dc66df2bd7f049a8de7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/renderer/routes/settings/cards/proxy-section.tsx:177 \u00B7 src/renderer/routes/settings/cards/speed-limit-section.tsx:289 \u00B7 src/renderer/routes/settings/cards/speed-limit-section.tsx:354 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/proxy-section.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c78233972357f5973cf7af4cbb6b1db36537856aea2ae2afe5b47d034bf3ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/renderer/routes/settings/cards/proxy-section.tsx:303 \u00B7 src/renderer/routes/trackers/components/blacklist-tracker-panel.tsx:80 \u00B7 src/renderer/routes/trackers/components/effective-tracker-panel.tsx:109 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/proxy-section.tsx"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"879bb5c2d1fd17aafff55faf8162ff7950c4f4303490c851f0736ece293cda11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/server/bridge/remote-extension-admission-policy.ts:181 \u00B7 src/server/bridge/remote-extension-config.ts:151 \u00B7 src/server/bridge/remote-extension-host-policy.ts:26 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2abd7b5064c560722d181bacd6b4495c12fe894e87317f8d29ed27d8141562"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/shared/lib/log-redact.ts:723 \u00B7 src/shared/lib/log-redact.ts:916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4f6f8c6b9481ee1b54610ebfce5527044455a96f755cbf212631cea3e4fdc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): vite.main.config.ts:7 \u00B7 vite.server.config.ts:6 \u00B7 vite.worker.config.ts:6 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vite.main.config.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1ba0a9990a9dc53fa1bd13dc71522b504b80f03d30d558cbcbe26cca48e399"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packaging/fnos/cmd/account-authority.mjs:253 \u00B7 packaging/fnos/cmd/authority-lifecycle.mjs:140 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaa07ad6450931e21c6536e6e116b93ad9de0861411e0a79780d7e589d97772"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/check-i18n.mjs:210 \u00B7 scripts/check-i18n.mjs:223 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-i18n.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eab68cc029d465167d9cd4ffd647ca85084923116d497b5aa360edd463d74ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/prepare-fnos-project.mjs:201 \u00B7 scripts/verify-fnos-package.mjs:135 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-fnos-project.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcf4cf1b09aba024997baa72c606bab12b230e7bed5272077904c4114fa46ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/smoke-fnos-package.mjs:129 \u00B7 scripts/smoke-synology-package.mjs:201 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-fnos-package.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3678a3db429494dbe52581a121b4b4b6c9e3330d54719274a55e0b463281d851"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/smoke-server-image.mjs:130 \u00B7 scripts/smoke-server-image.mjs:201 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbd16f70a77ec49daec4921b21c56d73863c5583d2b05b00d35f3a323e17cee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/stage-electron-app.mjs:110 \u00B7 scripts/stage-electron-app.mjs:120 \u00B7 scripts/stage-server-app.mjs:77 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5e2523cabe5267c1d3c04fc45d483f839343ffcf1026811f189cffbeee9885"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/verify-container-publication.mjs:15 \u00B7 scripts/verify-remote-extension-compatibility.mjs:8 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-container-publication.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae93fa6269271fd5ad1ad7f233cf9f40f4d0ca217ec95bf20b1ec67743d67e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/verify-container-publication.mjs:228 \u00B7 scripts/verify-container-publication.mjs:298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-container-publication.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"54069ec74b0c15b756a0a20f847655b96c1199f80c500968de84c29008248a69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/bridge/authorized-envelope-stream.ts:100 \u00B7 src/core/bridge/authorized-envelope-stream.ts:112 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/authorized-envelope-stream.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd1441991196ebf453d6151d08b5b23c769410f7ff56b62874b95b4888491d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/core/bridge/credential-store.ts:862 \u00B7 src/core/bridge/pairing-service.ts:167 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2f56e1890294190526adb4061620f85f68b94f786d2abe4548f3b015f67db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/engine/aria2/aria2-adapter.ts:554 \u00B7 src/core/engine/aria2/aria2-adapter.ts:955 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddad4c5a0fa7db4f37931398c12c56e707a657766d6172c0660055cf575bfa2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/engine/aria2/aria2-rpc-client.ts:252 \u00B7 src/core/engine/aria2/aria2-rpc-client.ts:262 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-rpc-client.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd528dcf84e2da6a640bec72478792cf70a8ed9f09c94aaf57d9114187fa36d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/inspector-activity/validators.ts:54 \u00B7 src/core/inspector-activity/validators.ts:71 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/validators.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9637c07d408c7e867bc0411417ec2d9e5f3b38129f9b1ec262b3814aa92a22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:96 \u00B7 src/core/legacy-import/http-activation-service.ts:139 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"58447034a2bd6e9aca817c82d07a7bf0277bc094ee8a3721cc46699652984859"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:178 \u00B7 src/core/legacy-import/http-activation-service.ts:738 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"368ae32d8b1098092634f018a365129654a7db4508f3a780d9f8e0402529d96c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/plugin/capabilities/i18n.ts:101 \u00B7 src/core/plugin/manifest/i18n-resolve.ts:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/i18n.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5879eb67ca90dfbea4aeb7b59b95b9443092086019c4c6fb2ed67e32490443d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/plugin/host/capability-bridge.ts:1751 \u00B7 src/core/plugin/host/capability-bridge.ts:1799 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d660c3c49477792c55d5d0b99228680df19f48e9e6f919db5183041594ec85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/core/plugin/host/plugin-host.ts:1475 \u00B7 src/core/task/direct-resource-validator.ts:281 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"17635fa25addb289788ea7cf77dd92e740baaf83d31a9adddd4ed3d8a6d3d20a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/plugin/update/builtin-updater.ts:249 \u00B7 src/core/plugin/update/builtin-updater.ts:289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/update/builtin-updater.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee90901dd18f2471412f8f80318fefebcecb7c912c5ec733173e0a2d5de2dd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/core/proxy/proxy-bridge-manager.ts:195 \u00B7 src/core/settings/settings-manager.ts:447 \u00B7 src/server/plugin/upload-store.ts:184 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/proxy-bridge-manager.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6190c315f0afaa23b09ff073e1f1304b6844ac19d6d8bc65ee10486b2c6332"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/settings/downloads-settings.ts:17 \u00B7 src/core/settings/general-settings.ts:32 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/downloads-settings.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa6a34b7624c80a8098733aea334fa6dd345de460c4acb2967e417b227a969c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/settings/settings-manager.ts:335 \u00B7 src/core/settings/settings-manager.ts:522 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a28c1dc3b6ede9e9cfd7a398d493795da1581ed66acc2462cd57f882ec011cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/main/index.ts:1731 \u00B7 src/server/index.ts:562 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d94060b00f53b5fa80c42eb71ecddaf9c396da8ceeb7fbb1a8199f0a20b6e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/main/index.ts:2396 \u00B7 src/server/index.ts:971 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad5a260c73796dc2af7c7536bf3ffdd8cb94f16a578f1103b1cfc76332baeed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/main/ipc/commands.ts:1374 \u00B7 src/server/ipc/commands.ts:840 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4b497f0b01447040f6ebe82221e77968ceafe0eb92c80c93b6c8d5f86cbc6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/main/ipc/commands.ts:1918 \u00B7 src/main/ipc/commands.ts:1962 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"069158019be9f329526fb54e3ce20f5a7e1cfa495906fe59c25491cdbfd40a07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/renderer/components/add-task/file-type-filters.tsx:47 \u00B7 src/renderer/components/add-task/torrent-file-panel.tsx:16 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/file-type-filters.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baf64bfa8f2b445ffedcd4589005935b8250911632745b78039e3384a111bad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/renderer/components/window-chrome/motrix-menu-button.tsx:279 \u00B7 src/renderer/features/application-menu/web-menu-button.tsx:155 \u00B7 src/renderer/routes/dashboard/components/dashboard-grid.tsx:569 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174bf451fa2f6610764185eb0b4003f251a890e5c296ef20063a9884f7c60c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/renderer/routes/dashboard/components/dashboard-grid.tsx:1297 \u00B7 src/renderer/routes/downloads/inspector/activity-tab.tsx:37 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eb4337f2c9a2fe8f50f05d5e45efded754241c44a52e871b5fee93678269f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/renderer/routes/downloads/downloads-more-menu.tsx:47 \u00B7 src/renderer/routes/settings/cards/use-app-update.ts:79 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-more-menu.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a879709585caf2a2f296404533406642bb43cbb8a8107ef5c01fea024f64bc16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx:452 \u00B7 src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx:465 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6d69fe3044f8c1b1b90c90760b8fbb546362ca20db64068b027da0e643ba0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/server/bridge/manager.ts:178 \u00B7 src/server/bridge/manager.ts:188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/manager.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8401b92345ff9afe482b033bb106ac7fa86077a3c2db68a474751df9d0ff0994"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/server/download-path-policy.ts:47 \u00B7 src/server/plugin/install-service.ts:64 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/download-path-policy.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d792cf10fc3c410e7194418198bbe0e6bd8a39d188b3f6f658a6d6e1122db7eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/server/index.ts:1823 \u00B7 src/server/index.ts:2237 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"834d88d99a25aca174fe6c9da67f38ba1b08cbbfb9884910153a6aba5f74a79a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/server/platform/fnos/routes.ts:29 \u00B7 src/server/platform/fnos/routes.ts:55 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/fnos/routes.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca3cefa89e0a12ffb5fd361c25c93f93653ff281e25d722b21289a2357ad6d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/server/server-directory-service.ts:257 \u00B7 src/server/server-directory-service.ts:367 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a68578d55f7e45de99fb3ed61fbcdb9992fa150c8465127fb79e60ec5c9087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/shared/lib/log-redact.ts:832 \u00B7 src/shared/lib/log-redact.ts:895 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"2825dcec9446b122710c0800062963b935eab74c1d969050bfd2879214677d1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/shared/schemas/legacy-bt-activation.ts:35 \u00B7 src/shared/schemas/legacy-http-activation.ts:57 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/legacy-bt-activation.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefd5974f35847c2f78d58d90d1adb370ff2cc6f6018ad82fc518d4d395ad395"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/check-i18n.mjs:189 \u00B7 scripts/check-i18n.mjs:272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-i18n.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ecc6d130356e79749e323d47891287387dea83a86955a7d0e5f1393bc2053e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): scripts/container-platform-metadata.mjs:39 \u00B7 scripts/verify-remote-extension-compatibility.mjs:11 \u00B7 scripts/verify-remote-extension-threat-evidence.mjs:19 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-platform-metadata.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4086f14b5a87a2487eb978c08cbaedbb7e646b82aaee8e81b2dbef506256fe0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/container-publication-state.mjs:110 \u00B7 scripts/container-release-metadata.mjs:74 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-publication-state.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a674aeebf9a233f6a99ec0290eaab35b6aebc4ac382dd5a54c11391a7d0fa71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/fetch-builtins.mjs:70 \u00B7 scripts/fetch-engine.mjs:93 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-builtins.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"76980c87d12584ce3982cfea58863d19f8e32fb1bc1f19b93169fe345407799a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/release-snap-build-set.mjs:184 \u00B7 scripts/verify-snap-store-channel.mjs:216 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fd2f02b88813c5e7c9cb96aca44cd91e53ebf2fa96c1528ea9e8fcf4bf9ba2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/verify-appimage-artifact.mjs:127 \u00B7 src/main/platform/appimage-integration.ts:343 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-appimage-artifact.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aa6981cc3ecc174e952ab0d8bb14f4ce217e443ab64d85669db28867e9cb56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/verify-container-publication.mjs:141 \u00B7 scripts/verify-container-publication.mjs:204 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-container-publication.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e3379a7d517efc03b9bf3f24e9d577c1c8605361c2909a7a146a993d369dfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/bridge/bridge-data-dir-lock.ts:789 \u00B7 src/core/bridge/bridge-data-dir-lock.ts:798 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"b194b38c3c3c8e3b44d5629b66b2457b9cc90011e7f6002efddbcefb42e2aed8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/core/bridge/bridge-data-dir-lock.ts:923 \u00B7 src/main/bridge/native-messaging-installer.ts:495 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c52c433fb0c44cfd27da4f6c9cf356621264331b22c011b75ad343c0b65540"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/bridge/pairing-prompt-controller.ts:362 \u00B7 src/core/bridge/pairing-prompt-controller.ts:419 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfcf2ed92524e1c6130cd9cb7e661e311597e52eee8c48101f77fee9b83b761"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/bridge/web-socket-bridge-server.ts:2121 \u00B7 src/core/bridge/web-socket-bridge-server.ts:2271 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f37b9b74632000b6b049684d220e9259b092b43101ecc8c18ec533a2e3a17e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/engine/aria2/aria2-config-builder.ts:199 \u00B7 src/core/engine/engine-supervisor.ts:368 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-config-builder.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8139125cbf1509f7bdaef9b5af80fd264426a16e2de5b4d6d1a2d467cd32e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/core/inspector-activity/async-work-tracker.ts:22 \u00B7 src/core/task/media-task-coordinator.ts:895 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/async-work-tracker.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae14c3d3e16a0858c7f14d4ed589baccaa54b22dda074937b9b5e8cf7f1a672c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/plugin/host/capability-bridge.ts:805 \u00B7 src/core/plugin/host/capability-bridge.ts:1808 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"481b967ce1e867c3d4374cb87ef1154a00c25b0332390b947603b2cc05627c10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/core/plugin/host/capability-bridge.ts:1519 \u00B7 src/core/plugin/host/capability-bridge.ts:1528 \u00B7 src/core/plugin/host/capability-bridge.ts:1537 \u00B7 src/core/plugin/host/capability-bridge.ts:1546 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0174d29aafc70fbf575dabc5fca71d80b90d3dd4c3bb50d1c6ccfc513ba13ed8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/core/plugin/host/quick-js-worker.ts:1690 \u00B7 src/core/plugin/host/quick-js-worker.ts:1894 \u00B7 src/core/plugin/host/quick-js-worker.ts:1924 \u00B7 src/core/plugin/host/quick-js-worker.ts:1969 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb04bca6b14da2dbfdacbcc64f11907fe8f0937f7db13434a68f84006885c770"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/proxy/proxy-bridge-manager.ts:70 \u00B7 src/core/proxy/proxy-bridge-manager.ts:88 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/proxy-bridge-manager.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"145bb88778dbf1ce77c0e202095d60aab4874873cda831adc4df0d278315b53d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/session/post-delivery-repository.ts:341 \u00B7 src/core/session/post-delivery-repository.ts:430 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8cb2ff5cc92263f9a2d910de0bcf1e31d8d90c3ec68e009c6007b3029258fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/tracker/tracker-manager.ts:510 \u00B7 src/core/tracker/tracker-manager.ts:568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d175e67737b7dbf19f113cb9eee7d6d7fcef558735754bc53272040d4f7a66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/main/cli/package-manager.ts:135 \u00B7 src/main/cli/package-manager.ts:414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b18c60bc0189c0fb5fecc3f7a9ca56749da6b14b1650f943d65eebc3f6fbe2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/main/index.ts:2081 \u00B7 src/server/index.ts:997 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74766e4c431e191915b3af0d30df9a1e3cdb636b837128c240015c110a63810"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/main/index.ts:2198 \u00B7 src/server/index.ts:692 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e380a59ab6a1876474e24cdb972a9169abe6d8eedb2c29699048964db539f104"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/main/ipc/disclaimer.ts:59 \u00B7 src/main/ipc/notifications.ts:31 \u00B7 src/main/ipc/queries.ts:367 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/disclaimer.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d6d9dc8e2b5d278dc79a9104e7301f8ad563db443cff0f5f7968d5c0ec512"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx:667 \u00B7 src/renderer/routes/plugins/components/uninstall-section.tsx:65 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"067b7fcc1ce70e76730b84102ecfa601cf7f8ebf6a39d41271a31c080b2c1210"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/renderer/lib/task-views.ts:38 \u00B7 src/renderer/lib/task-views.ts:47 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/task-views.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5933091cdc3698c2911b17ea7a471aabd623b6b3d54686d3ba058f21da36bbb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/renderer/platform/electron-services.ts:56 \u00B7 src/renderer/platform/web-services.ts:161 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/platform/electron-services.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50d06442b978fd800aa5153dc9b9f2ff43aae10c5ec89d9e6ea57e1a9c16a04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/renderer/platform/fnos.ts:49 \u00B7 src/renderer/platform/nas.ts:35 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/platform/fnos.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"948ca33f146864232e0f648d6c107bece8724751d251936b062da54b48551923"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/renderer/routes/downloads/inspector/peers-tab.tsx:195 \u00B7 src/renderer/routes/downloads/inspector/trackers-tab.tsx:478 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/peers-tab.tsx"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"29587e31300c9fda1b2f0a5d67d776980a88b6fd79a3570bf082c49e69d56731"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/server/operator-admin.ts:82 \u00B7 src/server/platform/nas/extension-bindings.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"390059ffdb57531831262ac5519a3d02a5258230f7cd2c0bb91d381049bd3938"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/shared/external-urls.ts:58 \u00B7 src/shared/external-urls.ts:68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/external-urls.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6411c75f4190f84fcd1ab84ca4d3e68ef4c28ddbdd8457295ea60f11d012b7ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/shared/schemas/general-settings.ts:38 \u00B7 src/shared/schemas/nas-settings.ts:53 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/general-settings.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8ba9fb75cf79c8472bdef0bdcb4c963b65a00395919c1f7f32c6d2f140669a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): vite.main.config.ts:41 \u00B7 vite.worker.config.ts:18 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vite.main.config.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ef4d01763e9568a11b43cb58d65c4230874ae9b2aa9f4dfb353cfcfc8ae1eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/audit-server-runtime.mjs:133 \u00B7 scripts/stage-server-app.mjs:331 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"20356562926ebc4fd74867377d97581066db7df3485d8606ad20be34cc40ca9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/container-publication-state.mjs:96 \u00B7 scripts/container-release-metadata.mjs:67 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-publication-state.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d2591a9f2bd83ebf4f998d537b8e7b93cc88e1113bc449d559538822c6f60b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/release-signing-input.mjs:572 \u00B7 scripts/release-signing-input.mjs:589 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f6064d891e1ce9966e5a946c274884b362ccc5d3d9c656ea67672fe41b5f41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/core/bridge/pairing-service.ts:80 \u00B7 src/core/bridge/pairing-service.ts:112 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-service.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6b86ac1fce7d6b533b41111a911fd14fb37bca8657df4315899593ba5da4cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/core/download/segment-downloader.ts:343 \u00B7 src/core/download/segment-downloader.ts:385 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/download/segment-downloader.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"74100c503d587f10ba93ea780d67284b888c54d1872bc70d08748862c32c8f29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/core/ffmpeg/verified-install.ts:438 \u00B7 src/core/plugin/install/read-plugin-response.ts:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeffde1a83e6a2901ecdf9cfdb2389517bf10abf96bff3c33f89c5ea9654e17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/media/dash-parser.ts:128 \u00B7 src/core/media/dash-parser.ts:247 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/dash-parser.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"efffb68653aaf042f2cac5e3ecd2b2527e7461f552aa0d6a3289f2f29d5653fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/plugin/host/quick-js-worker.ts:822 \u00B7 src/core/plugin/host/quick-js-worker.ts:834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5214f933bb56c528659f7fb99b2eddeff025efa36583a7a964109e5a2ab09d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/plugin/host/quick-js-worker.ts:1618 \u00B7 src/core/plugin/host/quick-js-worker.ts:1655 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1083609de40845ee1dc19be4f048f2022ff1a4067dbece715e3b5cd295c269ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/core/plugin/install/plugin-installer.ts:657 \u00B7 src/core/plugin/update/builtin-updater.ts:209 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd6083ee485c75ffa90043762ca4401c8ac973c5b4611497ad86d7efd839b59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/core/plugin/post/delivery-types.ts:226 \u00B7 src/core/plugin/post/delivery-types.ts:233 \u00B7 src/core/plugin/post/delivery-types.ts:247 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-types.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6b63dd0c012d1676f3f0138e79fe8cb5020817abb3866d9b2fd6fd87ce3d22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/session/portable-relocation.ts:38 \u00B7 src/core/session/portable-relocation.ts:98 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/portable-relocation.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce21a399dcf142af72d532e365a9d8a3229da8a522f44e30968d5e9ec55051e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/main/ipc/commands/create-torrent.ts:103 \u00B7 src/main/ipc/commands/create-torrent.ts:142 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/create-torrent.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"694f61e65403eade00621dbbfab9209a2175cfe4d2fac99ae3e7c14a002849cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/main/platform/completion-shutdown.ts:120 \u00B7 src/main/platform/completion-shutdown.ts:139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/completion-shutdown.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"74415ab34a2b3a2d98efb236751e7c5a62d6d62a6cf5ef30fd6898a49df9ef2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/renderer/features/legacy-import/import-motion.tsx:34 \u00B7 src/renderer/hooks/use-polled-query.ts:74 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-motion.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa66bdeaa2ce7b30c0ff6c56c83194cb5d2c0ec20061ea822c8790318f8de581"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/renderer/lib/json-schema-to-zod.ts:49 \u00B7 src/renderer/lib/json-schema-to-zod.ts:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/json-schema-to-zod.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"195b2f5a2a03f5965d30e208c0e84ba670af253218f04c95a8844602a933a95a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/renderer/lib/task-views.ts:74 \u00B7 src/renderer/lib/task-views.ts:84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/task-views.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ade009cfb0964a76975c6399c65cb3c0bd4763d99cafee3989ccc3f0bdef59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/renderer/routes/downloads/inspector/pieces-tab.tsx:74 \u00B7 src/renderer/routes/downloads/inspector/pieces-tab.tsx:81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/pieces-tab.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3231442ee94704143187ff6b7a2fe33d6be7ffbaae3677534fcaf4d943ddc2be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/renderer/routes/plugins/components/call-graph/plugin-call-graph-node.tsx:95 \u00B7 src/renderer/routes/plugins/components/call-graph/plugin-call-graph-node.tsx:102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-node.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a9c65da606e9148d385e6f0494c2eb540500ef4ee2eec02790a570d4b2e3e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/server/platform/nas/extension-bindings.ts:26 \u00B7 src/shared/schemas/legacy-import.ts:122 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/extension-bindings.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8f588a9da2c74e8506045ba07e480d92d9adb091e94d9002b03b4f98f205f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/server/platform/nas/file-routes.ts:63 \u00B7 src/server/platform/nas/settings-store.ts:42 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cfb5d02352bd60ebc2d95b0500a7539bc8ac348217e833fccb0b05ab12e12b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/server/platform/nas/file-routes.ts:148 \u00B7 src/server/platform/nas/file-routes.ts:177 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4d4352f6932a9f6d7583387fc10a15b318e59ade84ce4cca120755ddda234f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/server/routes/torrent-creator.ts:224 \u00B7 src/server/routes/torrent-creator.ts:244 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/routes/torrent-creator.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab63689ff24cbb8590a9b7e0766589143564d8000fcf7a4db7fa2655c2d3efcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/shared/schemas/directory-preferences.ts:23 \u00B7 src/shared/schemas/ffmpeg-release.ts:195 \u00B7 src/shared/schemas/general-settings.ts:40 \u00B7 src/shared/schemas/nas-settings.ts:55 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/directory-preferences.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"24200415cdff3e1fc642b2a2cc43a309beb76af876a283788ce531c482259ea2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/audit-server-runtime.mjs:47 \u00B7 scripts/stage-server-app.mjs:329 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f9364aa389cc424845d9143bb60c6037b20912067b283288e4a563f063df8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/electron-package-utils.mjs:117 \u00B7 scripts/server-package-utils.mjs:238 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d027193b10040c1e8df317b99f3a731edc4c87388b555167983d2b769a544d70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/smoke-server-package.mjs:77 \u00B7 scripts/smoke-server-package.mjs:106 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-package.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f18792684d7b666e01561b2e99997647f881fb828ea26463a7f44b9496ddac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/stage-server-app.mjs:307 \u00B7 scripts/verify-server-package.mjs:82 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-server-app.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0656a0d1abf2f72142926fcc84003a24f3cebcce74ba929ca39dc3d7cb25ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/bridge/bridge-data-dir-lock.ts:723 \u00B7 src/core/bridge/bridge-data-dir-lock.ts:732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1543bcbebab5e2b82eacb49d29d01d7beac48d6d85133f1720a5265cd13d221"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/bridge/web-socket-message-stream.ts:37 \u00B7 src/core/bridge/web-socket-message-stream.ts:43 \u2014 all 2 copies are in the same file, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-message-stream.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e552f38e6433102811cb0a0b99fd757e5e9badfab9ca72aef7ec56075c000a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/engine/aria2/aria2-process-inspector.ts:24 \u00B7 src/core/engine/aria2/aria2-process-inspector.ts:31 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-inspector.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f351a23464a2b5d9605df08c0a6890cc66330215b06b2f2280c1358e4f67d8a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/inspector-activity/task-inspector-activity-service.ts:592 \u00B7 src/core/inspector-activity/task-inspector-activity-service.ts:599 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"339af25bd5f29ff4b5cd10a8d0d19b2a8440fb610d10e9724a7bfb2d3e3f353b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/plugin/capabilities/fs-sandbox.ts:83 \u00B7 src/core/plugin/capabilities/fs-sandbox.ts:117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-sandbox.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5483d43e1a289801da9f62fa5d3ec3f3129568e5ec9ae62eb11dcb777899610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/plugin/host/activation-dispatcher.ts:265 \u00B7 src/core/plugin/host/activation-dispatcher.ts:285 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/activation-dispatcher.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f270adacf460bda169866992ce9717013b6770fed12e001c050792356ab16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/plugin/host/bridge-protocol.ts:134 \u00B7 src/core/plugin/host/bridge-protocol.ts:142 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/bridge-protocol.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"996b1cf910639df85093360175d1a30a7df30ed2c0ec29cd700547a7878b5691"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/plugin/host/capability-bridge.ts:1151 \u00B7 src/core/plugin/host/capability-bridge.ts:1201 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d808341a1b6b849ebe657eb580e7a72512dab1cc91ef4005c377bf2514e23dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/plugin/manifest/i18n-resolve.ts:63 \u00B7 src/core/plugin/manifest/i18n-resolve.ts:164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/manifest/i18n-resolve.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5cfca2d9d59a6140c906804e113db1f70c2c27a5ea9fb8f665bb528c4a6ac4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/proxy/serializers.ts:35 \u00B7 src/core/proxy/serializers.ts:42 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/serializers.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a3bb2c34d55542668dbb99d4724afe77f2700bd2273cd362476c33d5283d11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/session/session-manager.ts:367 \u00B7 src/core/session/session-manager.ts:845 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52df10516133c43c279af97e92e08e6e38503f274310a0b6e3980cc1c2bb9ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/settings/downloads-settings.ts:36 \u00B7 src/core/settings/general-settings.ts:45 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/downloads-settings.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce47e939fea4671cfbc86a1086bda0d3b8c09fffd539467db92d4f1227b53aed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/task/direct-resource-validator.ts:1380 \u00B7 src/core/task/direct-resource-validator.ts:1545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e76fdb592c51d9cb460cb31e949ed00d46d0972db10a97815e3ad68a1d61232"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/tracker/tracker-manager.ts:441 \u00B7 src/core/tracker/tracker-manager.ts:728 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fdaf0c8cf60645f07f50e5daa0a7b268e2bf7dd51e5628ce96817315c59e3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/preload/preload.ts:195 \u00B7 src/renderer/lib/parse-torrent-file.ts:16 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preload/preload.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fa61f81912f754ff71e21eb9471f7c447cd36f09ecf810bb5a7284898be562"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/renderer/routes/dashboard/activity/activity-calendar-model.ts:462 \u00B7 src/renderer/routes/dashboard/activity/activity-calendar.tsx:143 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0280a8d018f110870e32b0b29546443dd273efc877d10a20c7b56b7329ab3f34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/renderer/routes/plugins/hooks/use-plugins.ts:83 \u00B7 src/renderer/routes/plugins/hooks/use-plugins.ts:99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugins.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"711f9ae9785b4aa07f090af3472d571197a5ea711a28aa5273a6aa89646b2088"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/server/bridge/remote-extension-admission-policy.ts:365 \u00B7 src/server/bridge/remote-extension-host-policy.ts:159 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d40c97a01974d459eca9759a67b67fcc75e1b37ae7ca66e6585285f8a1b546"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/server/bridge/server-process-ownership-authority.ts:312 \u00B7 src/server/bridge/server-process-ownership-authority.ts:356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-process-ownership-authority.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"581d2a3ef583ecf3a2bd7ae25078f0f69741e53ca03c6751140761fd81544920"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/server/download-path-policy.ts:152 \u00B7 src/server/download-path-policy.ts:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/download-path-policy.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6276b483c3b898f9bc0350ec749721d6e290849b8b61aee2d90f69f3c26f77b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/shared/schemas/add-task.ts:122 \u00B7 src/shared/schemas/bt-storage.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/add-task.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e5fb0ce9cc15fabe93519bd8fdecc24e6adc7d06bf72eaec77821edd2e0f2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/shared/schemas/legacy-bt-activation.ts:18 \u00B7 src/shared/schemas/registry.ts:169 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/legacy-bt-activation.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"54df1b7d0dc3efcaa1de35c693f7b303606627d09fdb9faeaaacdbcfb4750ab8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/generate-bridge-pairing-vectors.mjs:222 \u00B7 scripts/generate-bridge-pairing-vectors.mjs:227 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-bridge-pairing-vectors.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ec776decfd27c284196f51c1a67fb92d12a0edfe1b1af3e538d9c15a08cbbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/verify-electron-package.mjs:90 \u00B7 scripts/verify-server-package.mjs:83 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-electron-package.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aa6d1ec5c91e1c0b1c74fcc76901178644a5dfd0c363268e13ada367560846"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/core/engine/aria2/feature-report.ts:57 \u00B7 src/shared/semver.ts:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/feature-report.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"741d6b31bb33a4187fc1684654adb7d39cd6e7e767b7a73a6d2434898747490a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/legacy-import/bt-activation-service.ts:83 \u00B7 src/core/legacy-import/http-activation-service.ts:118 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a7175958f623109acfb6fb12979e55293fef31e5b24347b33cdff13b5328d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/core/plugin/hooks/ctx-update.ts:22 \u00B7 src/shared/schemas/add-task.ts:93 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/ctx-update.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a85c369c1f939a46d2db45cf8b6c1f48711db61461ca9d2417500a0ae969197"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/task/bt-file-verifier.ts:93 \u00B7 src/core/task/bt-storage-layout.ts:204 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"853002690a955941421bf371881100b5ffdb7529c36df0c8376543a9d3f5e9e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/task/task-manager.ts:123 \u00B7 src/core/task/task-manager.ts:165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-manager.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e048dd231988ec0f4896b62fede97177e461311d44eb6997e3836c9097f19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/server/bridge/bootstrap.ts:288 \u00B7 src/server/bridge/bootstrap.ts:293 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1aff41572bbb66af8c13758a2ffc927392e9fc0e4a439d0e3b5296582f5f3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/shared/schemas/add-task.ts:60 \u00B7 src/shared/schemas/add-task.ts:202 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/add-task.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"400ffcf4b6481d77d4aaa4601393c3db0ed24bf39a560939589ffb2db75395eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/shared/schemas/add-task.ts:265 \u00B7 src/shared/schemas/extension-pairing.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/add-task.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b7e37ec8a9a57d266f4aef207cf4ff8f497ef59dc1f4bebd254ff1b24b63c2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/profile-task-inspector-activity.mts:24 imports src/test-utils/task.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-task-inspector-activity.mts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be00ea85f16a1376cfd4f3fe047fcc7122af17dbd2434f31434cbe35bd685c8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: src/renderer/routes/plugins/lib/call-graph-engine.ts:2 imports elkjs/lib/elk-api.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/lib/call-graph-engine.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f598ee6f2fa7a2a6abd6b07bf38c7f83ab39ac75a86290cee2ff68da46010ccc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: src/renderer/routes/plugins/lib/call-graph-engine.ts:3 imports elkjs/lib/elk-worker.min.js?worker, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/lib/call-graph-engine.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4a2b865e87201333f14422bccac51f24eb9a1d46e91fc991e1c82c8bc98f24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCreateTaskUnderAdmission (cyclomatic 144, cognitive 227): handleCreateTaskUnderAdmission has cyclomatic complexity 144 and cognitive complexity 227; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef8ac344c4c1db91214f012d5442028bd57b94473c319a4a3111e33ef652d0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyDown (cyclomatic 95, cognitive 113): keyDown has cyclomatic complexity 95 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b37404380a7352b874a88117bd4d02fb875eec48ed87c202260a772617203aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EngineDiagnosticsDialogHost (cyclomatic 95, cognitive 90): EngineDiagnosticsDialogHost has cyclomatic complexity 95 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"76847ab9dc1fb61c893df744e27f30bfd47b3559b7f297e03e1c0904260607b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 77, cognitive 149): restore has cyclomatic complexity 77 and cognitive complexity 149; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27cb62ab6302290fa603e2f5e8832e38286f3b7285340c677bd13cdf79dc0da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFlatpakPackaging (cyclomatic 75, cognitive 39): verifyFlatpakPackaging has cyclomatic complexity 75 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-flatpak-packaging.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecda7fc77034245454ebcb391518de64ec4d1a52e49d2805b0d43ee21230013a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanLegacySource (cyclomatic 67, cognitive 108): scanLegacySource has cyclomatic complexity 67 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"413d236936639ec544688e0f9ef5849414ef8cffd0e4b6bf20b8f6d658495188"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recover (cyclomatic 67, cognitive 87): recover has cyclomatic complexity 67 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea36bee82fd2b0aeefd109fde7baa9c64d5e4f3ae42862754c95e949f4e3a3a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MediaToolsSection (cyclomatic 65, cognitive 58): MediaToolsSection has cyclomatic complexity 65 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3a45beed61b5352995c189017aebbd8e495c53532f26abd8befa70db132ad4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDownload (cyclomatic 62, cognitive 72): createDownload has cyclomatic complexity 62 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6f17f5dc451ac0199111e43aac8604340d0a6799f7a72cb1e607149eaf4482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invoke (cyclomatic 61, cognitive 89): invoke has cyclomatic complexity 61 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/web-directory-picker/fixture-transport.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4936474dfb4f42614a9369a0284dda5b99230b7839a71cc33276bc0bc8f32ee9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PickerSession (cyclomatic 60, cognitive 53): PickerSession has cyclomatic complexity 60 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ccd24ab5311e1ebd725d7ce10ad9747c04cfcec7ad109b59798461a9ed02f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 59, cognitive 62): main has cyclomatic complexity 59 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33e6004ead4d899ac0bdf471bfdd7bd3bc64e8bd59435073f1b7be06b3f92f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 57, cognitive 71): reconcile has cyclomatic complexity 57 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"63daf45dc2ccc071c4905bf15e1748d66852450decd72304640c511dccb3849f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializeMainProcess (cyclomatic 54, cognitive 59): initializeMainProcess has cyclomatic complexity 54 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99c624a1b5d5c73704e9cd2cad5c76bca66dd33f65d874bbab6ca10cef422a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 54, cognitive 57): execute has cyclomatic complexity 54 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae5b71ee35461571d90ec57e4319a290723e2fc0d1a42fe34b7ed902186c61c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OperationFormContent (cyclomatic 54, cognitive 43): OperationFormContent has cyclomatic complexity 54 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18e4906b8a3ca5511f692e87580bf1f3475edcc551f06ca9ebb6ddbc443dc4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function smokeServerImage (cyclomatic 53, cognitive 60): smokeServerImage has cyclomatic complexity 53 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"2755f8e495bfa67e5ca125d044d186ad30fecc0de8554d34b9cbdefe5e9d5c6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 52, cognitive 75): run has cyclomatic complexity 52 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb49e25deddc4b6dac5c1432c97c0550af3527171efb2a1307ba9a1559587efe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskRow (cyclomatic 52, cognitive 64): TaskRow has cyclomatic complexity 52 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9a51c5391aefdc77fb5e70501791ff0a0383d973b04d260195cd2eac830c6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swapMagnetMetadataForBtUnderMutation (cyclomatic 51, cognitive 66): swapMagnetMetadataForBtUnderMutation has cyclomatic complexity 51 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6e0b10211146ec3a1129b2ebc4f05fba245bdb36deab46cd46ebfef890baf5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onReconnectResponse (cyclomatic 49, cognitive 54): onReconnectResponse has cyclomatic complexity 49 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/reconnect-session.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"35755ad77a2f26975d8271e145e81ccccc6ced42013fa6d231a608050be96b78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addTorrent (cyclomatic 49, cognitive 54): addTorrent has cyclomatic complexity 49 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fab78fbdc257cb48f30493389c98569f07811a70350a0a807cccaf6e937394"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DirectoryPicker (cyclomatic 49, cognitive 50): DirectoryPicker has cyclomatic complexity 49 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beef5c6f8e4548d06240199347e8e3a7aab66064b1cc30efdbb0e34e69f6f8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 48, cognitive 52): reconcile has cyclomatic complexity 48 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b83934014d6304af643c78532fe8860c80e7bf9233684f2ae26134c0694cb1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchCall (cyclomatic 48, cognitive 44): dispatchCall has cyclomatic complexity 48 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d7199f62477b8b890dadeb78e2b9ad7e2a4f42b4e4cab1d48970a988485c16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLegacyRequestSettings (cyclomatic 46, cognitive 76): resolveLegacyRequestSettings has cyclomatic complexity 46 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce95bb6bcc3357f4d6919b30910d049606dbbe93e7003faf5f0e6f7046fcb32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAppDeepLink (cyclomatic 44, cognitive 48): parseAppDeepLink has cyclomatic complexity 44 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/app-deep-link.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"449ecb3bbadb1b218b370e5deb8d0f4f88501ef79f7a356f2c71be4d98952e2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrate (cyclomatic 44, cognitive 43): migrate has cyclomatic complexity 44 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/migrations/index.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b8baf1d3525dbfb96e7e17617d3d8d6b9f9ed73655564021f27ba89e7b5d82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderField (cyclomatic 44, cognitive 41): renderField has cyclomatic complexity 44 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-fields.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0ff59b03e4f73bb3587b4dbb2525b3181b4fae80f4c9b41f8e2104759b3d73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ActivityCalendar (cyclomatic 44, cognitive 41): ActivityCalendar has cyclomatic complexity 44 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"096a64138bb1353e5f16072a66786d52de62fe0e0bcee84ba8fc6a00dc238777"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seedAsPair (cyclomatic 44, cognitive 39): seedAsPair has cyclomatic complexity 44 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.test.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac46164fb31bc7d40045b859fd9b234b3e996531a178792ad9e4695a3c6f0f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverAria2SessionIdentity (cyclomatic 43, cognitive 73): recoverAria2SessionIdentity has cyclomatic complexity 43 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-session-identity-recovery.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bdddaea1e5f0409c7120d54d17a41e519b9936cfb4b87cc52aabd532fbbb1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRichActivitySeed (cyclomatic 43, cognitive 58): buildRichActivitySeed has cyclomatic complexity 43 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/activity-tile.spec.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c458c6f4f914162e8c492bf1fb9ca3368a092504ef54a5522f09b24605aa7346"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryInterpret (cyclomatic 42, cognitive 80): tryInterpret has cyclomatic complexity 42 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-interpreters/curl.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"043896b2fcabe4fe96f5523d9088f990bd35202f0ed1a147d896375eb7120c36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeTaskUnderMutation (cyclomatic 42, cognitive 78): removeTaskUnderMutation has cyclomatic complexity 42 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/remove-task.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21d2be24f4d5c849991f9097a84422b25c5799e1bf054621ad9284365f82c91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doStart (cyclomatic 42, cognitive 55): doStart has cyclomatic complexity 42 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5f2ec7ad6469b09abb9406d3dc993f1d70af33e83edfef2022e5c07bd6c5a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeDownloadSource (cyclomatic 42, cognitive 46): analyzeDownloadSource has cyclomatic complexity 42 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/download-source.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6983cb46ae3006c37741ba1acdd70691aba4d8383d59246fd83db55a728a8e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LegacyImportDialogContent (cyclomatic 42, cognitive 38): LegacyImportDialogContent has cyclomatic complexity 42 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"45be9e34b13df78dbb2eb83b47fa8347cec860e007b02cae75b89acb756f4d40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManifest (cyclomatic 41, cognitive 62): parseManifest has cyclomatic complexity 41 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/manifest/parse.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c915a1d665feb9029ba3bdda35fefa39313a228858d6e2966da90875bb06b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 37): (anonymous) has cyclomatic complexity 41 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/nas-auth.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fc2be0f4c69a6a83c7c5a53363e136e2b4bdd80af1bfa541667af7f69962de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reAddOrMarkErrorFromPair (cyclomatic 40, cognitive 68): reAddOrMarkErrorFromPair has cyclomatic complexity 40 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0d57fd57308cbf0242b9c8331a9e84cd6f4bd1ac664a08ebaa54b8ce97b211"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 40, cognitive 57): (anonymous) has cyclomatic complexity 40 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/hooks/use-selectable-list.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b01e6f11b2a0db2ac9cd6a20d8589b4643ea2913f1df7c4f1f732b66098b3bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SystemProtocolsSection (cyclomatic 40, cognitive 41): SystemProtocolsSection has cyclomatic complexity 40 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/system-protocols-section.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e19a120c48e522c96da751d6daf9ca4355c6acc4760f4bf51cb93c1452c382"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stage (cyclomatic 39, cognitive 43): stage has cyclomatic complexity 39 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e29dc3793b4e60ed162b225942f26102f4540436bdbb8662142ccbbf4a9904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskActionsMenu (cyclomatic 39, cognitive 30): TaskActionsMenu has cyclomatic complexity 39 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb2b3070414893fc6a3c2094131981e393bdd03627098a07156220ab27f28b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFnosPackage (cyclomatic 39, cognitive 28): verifyFnosPackage has cyclomatic complexity 39 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-fnos-package.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc43207f8abe74374dc010f530701765d45c6f163f840963789620436d4112"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 99): (anonymous) has cyclomatic complexity 38 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdb2c364eb1cc50a0a1e01e79654d1684c0eea580a3141f2e7caa946dc92e17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 38, cognitive 67): request has cyclomatic complexity 38 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2e66edebafc6b0c8f088ce6fbc300f1f86f3f8b8a4523a3212239b399d874d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 38, cognitive 56): fetch has cyclomatic complexity 38 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/network/plugin-http-client.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0b599d35de4c2baf3a124736bf5d4422a546a77044c5e67fda6149a9343cf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHlsMedia (cyclomatic 37, cognitive 84): parseHlsMedia has cyclomatic complexity 37 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/hls-parser.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"344297113b0d6e268fd4c52932616dbd73fed94853d26398eda28f62e5fdae08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 48): (anonymous) has cyclomatic complexity 37 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/settings-validation.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"238ed162a8c385d00a15e0d049c92d8b0cd88cdea84848d4232af42cadce3dc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 37, cognitive 42): main has cyclomatic complexity 37 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-task-inspector-activity.mts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc57bf495beac338f481d6713448e831c58d28c8cd786595917606abd0f65ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateIntents (cyclomatic 37, cognitive 34): validateIntents has cyclomatic complexity 37 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e5a9077dea7e4ecbaf862284f8cc0bff1f77d08966cba74734b22cea846daf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redactValue (cyclomatic 36, cognitive 41): redactValue has cyclomatic complexity 36 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e77a49ce5ed58801e0557c09b9b766d5a192ec2942cfb4a13bbb2c717bcf58f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCliInstall (cyclomatic 36, cognitive 35): classifyCliInstall has cyclomatic complexity 36 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"170fb8b0adbd6918389f30b840e6a6f6441c853ca84f45f803cda544843aa523"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ElectronNatTile (cyclomatic 36, cognitive 33): ElectronNatTile has cyclomatic complexity 36 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/nat-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f54c2c482a2691e71d07e3dc228be2eaf7f2f7572941ddbc598f84dcfaa76d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializeCandidate (cyclomatic 36, cognitive 26): materializeCandidate has cyclomatic complexity 36 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-materializer.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"316286213055a43a307ba192156d8ce3bb533b4f5e1507cd812e991dc84ea1f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 36, cognitive 21): commit has cyclomatic complexity 36 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/durable-finalize-runtime.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebc5e0013c4cc2d0c15d6517dad00809a9dfde0c3711be2c873def7b0a3a3f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 95): (anonymous) has cyclomatic complexity 35 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ae95d81eadfdb1118741af6ecbaa95e001f872a9a888967d22de8f0350fc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 35, cognitive 39): prepare has cyclomatic complexity 35 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdef0fba2b210667060608d58830def7bfdcba8a0aa1a4f5599bfa9cd5d98e36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractVerifiedTar (cyclomatic 34, cognitive 53): extractVerifiedTar has cyclomatic complexity 34 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69c419d65c1afb89ea28aa4c954c1622f05971538060c92c6023b38963cfa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pick (cyclomatic 34, cognitive 44): pick has cyclomatic complexity 34 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"720d2cebf0d072c6069df99e00ebb2d1bc042129f200df550f0219adf34017f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeTaskSerialized (cyclomatic 34, cognitive 35): finalizeTaskSerialized has cyclomatic complexity 34 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec0231be13b8efef0f8b3f53611f5ffc542c0da35a7c4dce2b0338392113d8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TransferTile (cyclomatic 34, cognitive 35): TransferTile has cyclomatic complexity 34 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f4c872da203da8219d3b106c6f33d0f7e40516e1919a41da780feaaf2e93a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 33, cognitive 51): main has cyclomatic complexity 33 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2700169878f3eee1fcad95ade300c1cb7928f6a6602d078904c971b458a945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installVerifiedFfmpeg (cyclomatic 33, cognitive 51): installVerifiedFfmpeg has cyclomatic complexity 33 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d59829e408df05bc17d4ec9ab9be8168b11bb9ce17b653240dd18a39376559"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PluginDetailPage (cyclomatic 33, cognitive 33): PluginDetailPage has cyclomatic complexity 33 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e6d8496a2a543517ce6b44b98878f6adaa55ccfae35ef1171819955308596"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function on (cyclomatic 33, cognitive 31): on has cyclomatic complexity 33 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5d25fafd8d3122900d6eee788f100949d87e35a7991680cff92d4adc52f5b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootstrapBridgeForServer (cyclomatic 33, cognitive 31): bootstrapBridgeForServer has cyclomatic complexity 33 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7204006acce75e28ae3b3f29aa43fba1ddc2e191105a4c6c4e672c2e2425db8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 32, cognitive 51): tick has cyclomatic complexity 32 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6413a269535c30fe0915889c38b1aad6f5846eaccbb7855c1960d49d39bafb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareAria2TaskCookies (cyclomatic 32, cognitive 46): prepareAria2TaskCookies has cyclomatic complexity 32 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/task-cookies.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"116021abda9d3a8ec6248a6f05e0fc436296bcf8345cc0a796e21877f8679c7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitPrepared (cyclomatic 32, cognitive 42): commitPrepared has cyclomatic complexity 32 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adcce0e070a1c88a918f5dfb93d5a88ba63eab7335ae9dd09ff8d3dd2c80198"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAppImageRuntime (cyclomatic 32, cognitive 34): parseAppImageRuntime has cyclomatic complexity 32 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/appimage-artifact.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36aef1646dcb39c29d0b295ae94e8f89c0c4e65b6264cd28ad076e2f2e734c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverRenameFile (cyclomatic 32, cognitive 32): recoverRenameFile has cyclomatic complexity 32 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d355a9ef4c57661ed99582fc3803e29803340e8097c6364187d8f6cfabf27416"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CreateTorrentForm (cyclomatic 32, cognitive 30): CreateTorrentForm has cyclomatic complexity 32 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/create-torrent/create-torrent-form.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d446849499601e91558f03926b5d37e9c729b0ebdd3797d38970c83f6c59398"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PluginInstallSession (cyclomatic 32, cognitive 22): PluginInstallSession has cyclomatic complexity 32 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-install-dialog.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8469f73cc44b3b85617c7f04e96652f1b9ca8bc0161cd4e7c729ba856d2332d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanPreview (cyclomatic 31, cognitive 49): scanPreview has cyclomatic complexity 31 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66679632b3f61e161c824b742837699324bb4e37fcd33910e2d270d47bcd914"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureElectronRuntime (cyclomatic 31, cognitive 35): ensureElectronRuntime has cyclomatic complexity 31 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ensure-electron-runtime.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1562e14a4028543efdc8f8e7aedc5850e86720525c237722dad2fa02b239c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestMatches (cyclomatic 31, cognitive 32): requestMatches has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-legacy-http.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18fb6247eaef1f3ab2fc0307c67f4e4a6a26146cfa55dda53fdab76259443fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 32): (anonymous) has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-probe-electron.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae78d61fc8a0bff651efc6396bba04c4dd34b860844357f153451989fac94d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnose (cyclomatic 31, cognitive 30): diagnose has cyclomatic complexity 31 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d973a9f7129d7b99baad3b128fe0dee63defcdbd82ec1026889f39ef9fdc0eb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 46): (anonymous) has cyclomatic complexity 30 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f29a3f124e34850b91e060f329aea70f1749dfd97be1ff73cad6b68dec096c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePlanPair (cyclomatic 30, cognitive 42): validatePlanPair has cyclomatic complexity 30 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2603bdfc64758c0e216126f9ae4d1ebce43331921e9930d9bad9b91eebdec8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 42): (anonymous) has cyclomatic complexity 30 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b831690691c3332f2f59d5b6577b026bce0b9796d3b5eb83e34d3a99fb1f84d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyBtFiles (cyclomatic 30, cognitive 40): verifyBtFiles has cyclomatic complexity 30 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9877851b3c858e8fb5e4f9d72cb66bd6591d80f0681f726da54ec25dd227648a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 34): (anonymous) has cyclomatic complexity 30 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/create-torrent.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec2dd17803cdcbcb153c5f1b104a827bfdc11f1d358ac6afeb250b26083737b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 34): (anonymous) has cyclomatic complexity 30 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d81d4ceb25d839cf54f1a780a3c1e80bf5d91241367680c7a4f6c89c949cf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 32): (anonymous) has cyclomatic complexity 30 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9eec1c036c95ba0528463a68e537c60040d3e8114c4dea5d6bb64b8b6c4f1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 25): (anonymous) has cyclomatic complexity 30 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1b773497ff05bb08c345d1a9839c360eaa4c8f9316ca743fc04644aa279e16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WindowChrome (cyclomatic 30, cognitive 25): WindowChrome has cyclomatic complexity 30 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/window-chrome.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b661ab735a46d057dde296c19820ebe07b786cfec3ed5af5747d7f3af3a4774f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 30, cognitive 24): observe has cyclomatic complexity 30 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completed-engine-task-cleanup.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0acec856c4607b2a97d37943ae76ed5061009b5fe40e55fce1f7b1d26a9b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 29, cognitive 53): download has cyclomatic complexity 29 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02d6a8d3a302ebd9c38818b7cbe7320acae2c550b51a45f3b818a9e587888f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanInto (cyclomatic 29, cognitive 47): scanInto has cyclomatic complexity 29 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"6480bc02dceebd51648fbad06050c2643639efeeb6413ca3de8be03a7e59c936"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 43): (anonymous) has cyclomatic complexity 29 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e429d0c93f31a760e1f730017e56a091b5def64d98d23dc21376af703b75bbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 29, cognitive 35): execute has cyclomatic complexity 29 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/cross-plugin-invoker.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea4ff2269ee6a4bf91e9d015c6ec6afaae243794fabd575de18e1051821d8a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLegacyHttpRequestContext (cyclomatic 29, cognitive 27): resolveLegacyHttpRequestContext has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-request-context.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"df07a15644388e9b8725fec31b50426f42f84a900a7e10d530224d05c63d3723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDirectReAddParams (cyclomatic 29, cognitive 27): buildDirectReAddParams has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76514145ed55c317bfca74d983ef5ba35ce034b03acbe411b6ab14675b53f39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePolledTasks (cyclomatic 28, cognitive 72): handlePolledTasks has cyclomatic complexity 28 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02e2c32688dcc16072f3a8c8a682719ee5a2022904eb3de85c4fdbeaeeb625f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanStaticExternals (cyclomatic 28, cognitive 42): scanStaticExternals has cyclomatic complexity 28 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9649174794205b87cc2c1fae7ed28097d5b2a3eaa6e5151a4d2ee452b6c5f174"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkDiagnostics (cyclomatic 28, cognitive 41): checkDiagnostics has cyclomatic complexity 28 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/nat/motrix-nat-manager.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f3e28484f8443e295835587dfd8287674e3f866def23091d5f49d7220d2e70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cloneDataOnlyValue (cyclomatic 28, cognitive 34): cloneDataOnlyValue has cyclomatic complexity 28 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-inspector-activity.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2f68453a2d22d52004f3e3f0e6a1f5091d8411dc8c4832e8f6d613684fd69d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reAddTaskUnderMutation (cyclomatic 28, cognitive 29): reAddTaskUnderMutation has cyclomatic complexity 28 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4bb983a2e020254863f95709ef36b17f9ea1e603755dd8892b9cbb49be7e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 28, cognitive 26): prepare has cyclomatic complexity 28 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"10db9b74c7354792828ea601c591e09b6c4adf65182e4e76fbc56f129fe84dcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pinLegacyHttpOptions (cyclomatic 28, cognitive 11): pinLegacyHttpOptions has cyclomatic complexity 28 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-legacy-http.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f754a202fd286f0fd871601d48992587d1d8006e2c1e18c107358ab0e154e10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 27, cognitive 48): reconcile has cyclomatic complexity 27 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f26a7a49247057b98ff8a31a88ad22e1fe63e02498b30338e804d09cbb90501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreTaskSaveDirectory (cyclomatic 27, cognitive 38): restoreTaskSaveDirectory has cyclomatic complexity 27 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-save-directory.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d01c4bbc6b2144285b0428afeb0a75c71a881b0b7386db7db155600485a9e73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function list (cyclomatic 27, cognitive 38): list has cyclomatic complexity 27 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52573a7ccb45db1592f938a907af1a7b7e922419db4e12a02596429356e8f5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PluginDiagnosticsPage (cyclomatic 27, cognitive 30): PluginDiagnosticsPage has cyclomatic complexity 27 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e6093344d86ba4be3055806e6e5db39a16aaf8b107ef3e5f1ad4da8c81888b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeTaskFromPair (cyclomatic 27, cognitive 26): mergeTaskFromPair has cyclomatic complexity 27 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac306a2930595c42808119012843d4638c5fc0318c827d88199ef99ce34c4a72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeEngineTask (cyclomatic 27, cognitive 23): mergeEngineTask has cyclomatic complexity 27 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/merge-engine-task.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaa96a294ce8c92f05a4b0aecae0abf1ada01ddace6bfd0367ec47293b6cf59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskInspectorDrawer (cyclomatic 27, cognitive 20): TaskInspectorDrawer has cyclomatic complexity 27 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-inspector-drawer.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"abee69d98e8df5fb1afa10ea51e2eaf9af6c062cca1fea3a9fa3a8600e2097b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 48): (anonymous) has cyclomatic complexity 26 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-syncer.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8724bc22e891d72348e6cbfab18439e0cf5fadebcaebf05b10a6c6eedb56920d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMessage (cyclomatic 26, cognitive 41): onMessage has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ad0c8591a1618b4cb77054a0fbe25c09035a6dabb7ed580182c1039d521719"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareFreshDownload (cyclomatic 26, cognitive 35): prepareFreshDownload has cyclomatic complexity 26 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1280f03d2f098b9734b83ea71c62f25ebcb9b74343838534ec3e236e4b7e804"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lifecycle (cyclomatic 26, cognitive 31): lifecycle has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ed2aa21a5032dffabc7bfd6eb824db2c0e0d882ba9a6bf1d4568311debd4d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 31): (anonymous) has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"848427ebeded510f678cf03a23d39db617ffb88ad4ff469021e442c9f9312895"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeBtAfterRename (cyclomatic 26, cognitive 30): finalizeBtAfterRename has cyclomatic complexity 26 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"7297070593d3636178fd77de854eabae5f3e0ea7648accf4b90ad86b3dbae73f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordSample (cyclomatic 26, cognitive 27): recordSample has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a16854067647fe97ceffc77ecc7b373d5887e3589595b9d99159d5f2f01497"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OverviewTab (cyclomatic 26, cognitive 25): OverviewTab has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/overview-tab.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8557488e28ce75adccc4ece4e7ad0071073f2be710799ed06f36dbe1059ceae9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LifetimeTransferCard (cyclomatic 26, cognitive 24): LifetimeTransferCard has cyclomatic complexity 26 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31edc94c4f0554d551e115d57026d0a90aed80ac306af72611ab1b3651909b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskInspectorActionBar (cyclomatic 26, cognitive 20): TaskInspectorActionBar has cyclomatic complexity 26 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/task-inspector-action-bar.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efe0233a98011d20ab4684f5240080b0a68112325b5e1f4e2c6f13bd38a8e07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLegacyFile (cyclomatic 26, cognitive 19): readLegacyFile has cyclomatic complexity 26 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9593a6f4ef20ddc29c4a2d8fe553c505f52232c4f61daee6fc7629d7e113eb40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSetCookie (cyclomatic 25, cognitive 42): parseSetCookie has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4fb66f9154e53005b390974bb4b96aac85ab122117e0c1dbf1e5c8a002c1c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareSemver (cyclomatic 25, cognitive 40): compareSemver has cyclomatic complexity 25 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/semver.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6debb45ca778b3788611476d6f9f27a45c6676e4f917e09c07d07c1a2529e85a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodePng (cyclomatic 25, cognitive 34): decodePng has cyclomatic complexity 25 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/render-installer-images.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fb214f55a9931d19718669cdbc2c106eeaf2e0ad4b35c6a24c7eaf31f653da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistUpdate (cyclomatic 25, cognitive 32): persistUpdate has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48c55658ae4efe41c143c73b394bc2bb3de75cc7a645710946dec3e5816767f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsonSchemaToZod (cyclomatic 25, cognitive 31): jsonSchemaToZod has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/json-schema-to-zod.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee9646d2a690b135721f699f59fb6f64efbb35e653414cccae748508858fb25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BtStorageDialog (cyclomatic 25, cognitive 22): BtStorageDialog has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/bt-storage-dialog.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb40d0c21bc556518aec358ecb8caf7db7cfb223ea05baed57aa87a47f75e5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitListing (cyclomatic 25, cognitive 20): commitListing has cyclomatic complexity 25 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42114a35c9d1f09256e270d3438a6f44934a316e668afc5fe86141a93995677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 20): (anonymous) has cyclomatic complexity 25 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/ffmpeg-release.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d196687cd3fca8fb8f7f20b0c0d019ec608ff9291428cf130024c4ccf4ffe19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadBytes (cyclomatic 24, cognitive 44): downloadBytes has cyclomatic complexity 24 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-builtins.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c434b9213a402b8cdefe5330d919ded05d636aaf031312fcbcf7ff1782834b4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 42): (anonymous) has cyclomatic complexity 24 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c643fc378a7d7fd7f7138ffdb6b91e52c7b7ad4b01d369e23b971db675f9c18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 41): (anonymous) has cyclomatic complexity 24 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0470b5804323d79c0a498ae1d5d1d8f4767a4b3e3ea36781a66047da2954fde7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateActivePlanDocuments (cyclomatic 24, cognitive 40): validateActivePlanDocuments has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e27d6f6457f2c8f10005273548a0413133ffa6c35a1138aea230015f8fc52d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectExternalComponents (cyclomatic 24, cognitive 39): collectExternalComponents has cyclomatic complexity 24 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-third-party-notices.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfad2e237a4acbd7c0f9446faa80f5b956de0ae3f4d74f385bb3e2e17550aab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyUpdateArtifacts (cyclomatic 24, cognitive 38): verifyUpdateArtifacts has cyclomatic complexity 24 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-update-artifacts.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c8a3236db479840fccf0596c8d7fa9e948792f7e2549fc38ec5a279d986f61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSourceSnapshots (cyclomatic 24, cognitive 35): mergeSourceSnapshots has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-snapshots.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c1ad022e7c0d1af2361c214f4582e8d3360e8494ceaa37fb2abf8c6fe80be5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flush (cyclomatic 24, cognitive 33): flush has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5f5d326a030150f153cc49736fa116588d88faaeffc6314fb95d3e8a20cb9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverReserved (cyclomatic 24, cognitive 30): recoverReserved has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fe597b24ba4f91b836bc4401d4934617ffe8d99e2f0ca4ff47dc1a00eb401f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installSelfIntegration (cyclomatic 24, cognitive 23): installSelfIntegration has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"0809a63d107518a20cd3c9a36a7c1caa18d0ad4d8534b7ab5abb16dd942c8f51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TrackerSyncDetails (cyclomatic 24, cognitive 22): TrackerSyncDetails has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/tracker-sync-details.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"262ffc12dcd0c84d2148e3056f817e03389924e796fa575365a960f294d1900c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PluginCallGraphEdge (cyclomatic 24, cognitive 21): PluginCallGraphEdge has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph-edge.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2457b2157aaf0340ae7f876d35a170e9c9ca72d20f7fdf6fa174828bd4f49d6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertRenameFileJournal (cyclomatic 24, cognitive 17): assertRenameFileJournal has cyclomatic complexity 24 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad206575ba6ee644d8badad465c401a364330faf635ed083839b298f06dc788"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 17): (anonymous) has cyclomatic complexity 24 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/app.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf3ec11e688cce90dfbbc8e137acbe69b06dcd7920c3c8511382486787cab32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 15): (anonymous) has cyclomatic complexity 24 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/speed-sparkline.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d788014f21e82c19ceabe838d5a917996f6370aa3b6025d644ff0b36d889646d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createTorrent (cyclomatic 23, cognitive 34): createTorrent has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/create-torrent.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"395fd0670a28d6aa88c80c6ebe4ea8f190e4d304bd273e3eb5872da4ba9d51e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outputIdentity (cyclomatic 23, cognitive 34): outputIdentity has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/task-files.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f804a8e77a6a8b8c7bbe1846a3cb7e54f53f3fa8da4b88f5d2b32d862ef4e66b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeIsolated (cyclomatic 23, cognitive 29): removeIsolated has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fecdd98fd78a0d9db07e6407be9451bdae4fe33f8a610ea22de4aa00716180"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doActivate (cyclomatic 23, cognitive 28): doActivate has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f120e8fc4e0f09d4dba23af2b93bf499631a164384c54496b63f51030790a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryMetadataUnderMutation (cyclomatic 23, cognitive 28): retryMetadataUnderMutation has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f89e442acc17cfcf85022543adee1ebdcdbf9b17ce1d08abb21a481d18a777"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stageElectronApp (cyclomatic 23, cognitive 24): stageElectronApp has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0077ce869ca35e164314c3eafba6daef4886451449c6da4280d5336dd8eefa9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function perform (cyclomatic 23, cognitive 22): perform has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-remover.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"493ce7db6b2e987eefd1afe35df16df5f43f6649a950230ddcc1bf6cc294cede"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeAppImageArtifact (cyclomatic 23, cognitive 21): finalizeAppImageArtifact has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/finalize-appimage-artifact.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8b4a3190c3c8bc29a32ddbd27b0e126aa5e9a2185ae047103601292b118d3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExtensionMbp1Route (cyclomatic 23, cognitive 21): resolveExtensionMbp1Route has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"4403852f45383e27664c00efeac90426bd162d0e6e294d16ed4d0c072275ce55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHistoryEventInput (cyclomatic 23, cognitive 21): validateHistoryEventInput has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/validators.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d4417e5a19c5cabb334fe28cd0abfb0216feef2631004b988ca4fc3bea0afc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CliToolSection (cyclomatic 23, cognitive 20): CliToolSection has cyclomatic complexity 23 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/cli-tool-section.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"704fff2b4da79a3c3ec9d03ecd12ff782905419fdd9cb5ad387dc26a050f9ccf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeApplicationMenuItem (cyclomatic 23, cognitive 18): executeApplicationMenuItem has cyclomatic complexity 23 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/menu-manager.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38b5bdd26fa8b900b114e5043251acff8af32b3b286dde5fd2496e6899d0df1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchVerifiedPackageBytes (cyclomatic 22, cognitive 31): fetchVerifiedPackageBytes has cyclomatic complexity 22 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-fetcher.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced255202bd7f9f6396fc23510665e1f55fc2be306bd1c126a6418ae7e87976c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recommendFileAllocation (cyclomatic 22, cognitive 29): recommendFileAllocation has cyclomatic complexity 22 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-tuning.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"06046fdcac98389ea33c7c91ac871a72ac1e1038d93b14e919ca125ce94d9543"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createElectronPlatformServices (cyclomatic 22, cognitive 25): createElectronPlatformServices has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/services.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e25da1c5f92abfc7196fae8fe4dc384407340b07161b9758d9d2d46de51196"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 22, cognitive 23): verify has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5854fe4e6c52228409ed65925a9b01edfe459b8bd17d88c54a8d5f40dd4190b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 23): (anonymous) has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a16b7de1812cf299eeb4995606bf6d86ae35d162c2a2658d49e308ec9b9234"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readExactBinding (cyclomatic 22, cognitive 23): readExactBinding has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-process-ownership-authority.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bdd7026ec26d420278e4f10bddd4f8ae7fa022814caf626a0e3f9d0761bd8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stageServerApp (cyclomatic 22, cognitive 22): stageServerApp has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-server-app.mjs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"671093a6e5d58d97df5f86f0eac1bce93b574ae9a5778c99b08ba9f80ddff3c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #probe (cyclomatic 22, cognitive 22): #probe has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6feab5bcfd013083ec620feffe1d37d7d101b48c798bd42b8dcbdaad24d409"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitLine (cyclomatic 22, cognitive 21): emitLine has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-output.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4399906f433d25bc07157c938c1817f8daf8824779940daafec932efd0099e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCheckpoint (cyclomatic 22, cognitive 20): applyCheckpoint has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1028dd20eed2ae07cc4b66f66d5585583861ea19a1dd03a5bba03b28dea0e394"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function accountFromSnapshot (cyclomatic 22, cognitive 17): accountFromSnapshot has cyclomatic complexity 22 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38329c41b635ea34a068f51845dcaee9c64bec0405354810a7d12792e7f8b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPendingSettings (cyclomatic 22, cognitive 17): applyPendingSettings has cyclomatic complexity 22 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c5bc05c9053b333348eca41805d801d925a7a0bac637490e5a3cffb8315e0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 16): (anonymous) has cyclomatic complexity 22 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef2cebf40793d2b7c42424f9ad0c238f7d471f489f2f22e4f1cb5fe94193673"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditInputs (cyclomatic 21, cognitive 58): auditInputs has cyclomatic complexity 21 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"276da1bcb24b5276b6f4d7aae1b401892b9d1a8a383573a4af6474949dc8fba8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setItems (cyclomatic 21, cognitive 41): setItems has cyclomatic complexity 21 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/selection/create-selection-store.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2032af1683fb99e0af36fa1240ba2daa9a859b10c8e8ca134f7e149ef42164b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBoundedJsonValue (cyclomatic 21, cognitive 39): isBoundedJsonValue has cyclomatic complexity 21 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edb4ae0166b0bfa2ae09d56ace5f1fd8c80388fbcc8698a65cb7fddf9e09305"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectActivityGeometry (cyclomatic 21, cognitive 36): selectActivityGeometry has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a7b9cb1acd26077ff9b81d21506ddf091ac275cdb496972507f96ce8a387eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildActivityChartModel (cyclomatic 21, cognitive 29): buildActivityChartModel has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/activity-chart-model.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c2a07895f8572a9a922199d3536b255fd939e4d5e4c903f1cef0b0e688f47c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releaseSnapBuildSet (cyclomatic 21, cognitive 25): releaseSnapBuildSet has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec04a53471e61f6fb8cf35e1a797e6791f7c081bd0b1566a8de38b8864098c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 21, cognitive 25): save has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/use-directory-preferences-draft.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef712d430f8bfbbbb9d2edc1a9bfe09302b775a837a54b25bc9b5360d3498556"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateThreatEvidenceManifest (cyclomatic 21, cognitive 24): validateThreatEvidenceManifest has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-remote-extension-threat-evidence.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"442a744ff3da5a65515a83c740d870e52ffa55a44c105148d8207174e7730352"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectRemovalSurvivor (cyclomatic 21, cognitive 22): selectRemovalSurvivor has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-removal-safety.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d589c9617ebe7f1e3e778d1ee24c42470cb4dadcf6160934d5d9a356a85ebd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveActivityActiveIndex (cyclomatic 21, cognitive 22): moveActivityActiveIndex has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"af60f0c04b9e2ea30a90a1d950545b43187147faeea0b065da56cd47b9e7b18a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #verifyInstall (cyclomatic 21, cognitive 21): #verifyInstall has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a73caaab3c9b85a8197f53c442f20373f8411148e22f0ed9cbab5ad92aa745"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveForwardedSource (cyclomatic 21, cognitive 21): resolveForwardedSource has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fa215c46a46c9b7f526c28037b24e859a960c6f76312272b93fcca94be52be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPairHello (cyclomatic 21, cognitive 20): onPairHello has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f7608f6d7eed7b7457d0efc0630184702ef86e5d702bc3c3e44c28e740bc96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePublicUrl (cyclomatic 21, cognitive 20): parsePublicUrl has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e1b99386d179a6fe020bf7d98d4cc02eb38f281fba02e33828b61e97e8494e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onChange (cyclomatic 21, cognitive 18): onChange has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9bb4e721a5331773875ef7016fdc3574b3a867e441f2951dfadc559623ee11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertRuntimeContract (cyclomatic 21, cognitive 10): assertRuntimeContract has cyclomatic complexity 21 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"08150c3469674322d167dcb214347a1117e9d13da5eaac262b6a4d0e92c3da50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 20, cognitive 40): tokenize has cyclomatic complexity 20 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-interpreters/curl.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"29588a9cab0e1ba8f0fdbf8af3922ebe0fe760177c4017245e40472106b405f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOverlay (cyclomatic 20, cognitive 34): applyOverlay has cyclomatic complexity 20 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686917f69cb3e999aca2ff451e275c5ce3d57570b82f8440d7ba86270ac8960"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 20, cognitive 29): install has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f76221da83029f78ee595db6b1fba12d5f5bdf0ed990bd4c48d55037f23f8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blockUnavailablePortableTasks (cyclomatic 20, cognitive 29): blockUnavailablePortableTasks has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/portable-relocation.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1621077b2714991d48951a1de02538364a5121abfa9b97cc3eefe7ddc6c2c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createOwnedFile (cyclomatic 20, cognitive 28): createOwnedFile has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a8369edf415a608608f43fbc127b3e700d8e5d93454b8987f2e7af5e389756"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redactError (cyclomatic 20, cognitive 27): redactError has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c04a746c4034527ac3875c5a7fb2305e15ba975bef6a64a8d474213ec58a202"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 20, cognitive 26): run has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d669d93a6842af96054f09a4b42347dfc912d5ad7507e1bb8d7b5e091d15610"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeBt (cyclomatic 20, cognitive 26): finalizeBt has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1686550f74316a0455209895c2c6597ea84686c85d480da98943fca11e3dde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseForwarded (cyclomatic 20, cognitive 26): parseForwarded has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e4d1fa9d482a07b96bdcb202f393310b38f951f848772cd2268b3dfd9443c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function primeFromDatabase (cyclomatic 20, cognitive 25): primeFromDatabase has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"346d763be6dd9090cc6e160c66a73e1ca90e9f65e7abd29f6699cd42a892c95f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncNativeMessagingManifests (cyclomatic 20, cognitive 22): syncNativeMessagingManifests has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd9899e369afa18aec35f0b5ef94f18a3eb19d45f31a590561a516a86ef1a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invoke (cyclomatic 20, cognitive 22): invoke has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa1892b061ca9f8ad6e501fa335ff9673adb6d9ffa79badff7e48d2856ba850"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 20): main has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/server-leg.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fd474a082d2784ebd89892c88272152dd5f3cb74ef75a4d6321d04f3d0e061"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function smokeServerPackage (cyclomatic 20, cognitive 20): smokeServerPackage has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-package.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b701cc61aa058c69dee9422f43555eaacae2d307b807a90f99c5178131868142"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleShortcut (cyclomatic 20, cognitive 19): handleShortcut has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95b72b2f4429255645ef91d12f5c1e2c67bc9deca064852098d9e576b77c141"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRemoteExtensionConfig (cyclomatic 20, cognitive 19): parseRemoteExtensionConfig has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a46c90aac0ee7466240b4acb8dc905fd091dfaf4aacff9a736fa01a2a9deed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertDocumentPair (cyclomatic 20, cognitive 18): assertDocumentPair has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66f428c5264912db494c20f1af81ff1e9f56353dde9ed3e63c9b87aa25339a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NotificationRow (cyclomatic 20, cognitive 18): NotificationRow has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/notifications/notifications-page.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91b9721c7c9bae1c55f97cf13bfe7e2cc3172720b12151002e9bafb229c16b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PluginInputGroup (cyclomatic 20, cognitive 18): PluginInputGroup has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-input-group.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be6b773e7621d0cb5e4482f6d6c52ee875bc8b5c726f4397f02b9f360530d4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppImageIntegrationSection (cyclomatic 20, cognitive 18): AppImageIntegrationSection has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a1e346a4d90dc081c23811c1bb313247b0e12cc43d8ef9c574365fe4b0d50f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectOrdinaryCandidate (cyclomatic 20, cognitive 17): selectOrdinaryCandidate has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"645b9401571e5975d0e0974ed63ee0c8f8d9210a1514a28cf363ae099a1c66e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 17): (anonymous) has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation.integration.test.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d181ac63ddbfa41a28ec04b79b26c20b09091f47a90d0df630c01a22df17f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseProxyEnvironment (cyclomatic 20, cognitive 17): parseProxyEnvironment has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/system-proxy.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e97fe75eda475062f4cb696d76dafe99833e734eb2b76fd81f0b44c996239c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLegacyRangeResponse (cyclomatic 20, cognitive 16): validateLegacyRangeResponse has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b884ff02a5325f3add17b41c179d584308c02b4878967dda2181c09405cf437"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeProxyUrl (cyclomatic 20, cognitive 15): normalizeProxyUrl has cyclomatic complexity 20 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c4dd7b07496eb41f169a2067e905d9c879ed1647b24689b6d453d1c14cf861"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryHash (cyclomatic 20, cognitive 13): binaryHash has cyclomatic complexity 20 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d3022c8d72551365547016c17b23d9cfd722d72925f1300a247e28280719e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppUpdateSection (cyclomatic 20, cognitive 13): AppUpdateSection has cyclomatic complexity 20 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/app-update-section.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0919d9337fa849bf24c6e83f38752803b161d57f5d3ef3ca45ef637cf9627d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeExtensionIdentity (cyclomatic 20, cognitive 12): normalizeExtensionIdentity has cyclomatic complexity 20 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-identity-resolver.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7d9106fe07690453ece114af48d3550f41768c411f58c8bfbe14e117b7a9b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 10): (anonymous) has cyclomatic complexity 20 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/use-menu-command.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41faae7a1c671f8a0483726ddb1aa2012513f6f8d73c9b4a12c9e190050f084"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeJavaScript (cyclomatic 19, cognitive 33): tokenizeJavaScript has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad901e143334732e622800d07503d6bdb5354a8494232913ad19d9b20752ec12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 27): (anonymous) has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/ffmpeg-macos-trust.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9892a09e131392f8b7fb8f1027fac306d703389e6a857fcbf8d13671aff2aa52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkI18n (cyclomatic 19, cognitive 26): checkI18n has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-i18n.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe8cf76806cf70bc4dd16513ec7b24648146fb8a3269ee95d9d5a8af7de200f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyRange (cyclomatic 19, cognitive 26): verifyRange has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da212a60280f355c3f32301895199feaf8177f22246acbb63c2c6cd30d3d71d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TasksTile (cyclomatic 19, cognitive 26): TasksTile has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f5906e496dc850b3fc219b9556aee0e4908a93c22494558bd784fa28f182e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lifecycle (cyclomatic 19, cognitive 22): lifecycle has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cd8af56394a812998a89543774e75df96adfa20eff84c25942035dcb029484"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 19, cognitive 22): restore has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a787007fd1ac74ce90455e3d5304297c60214c77ccb7496b41cba43395d3360"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyHookEffects (cyclomatic 19, cognitive 22): applyHookEffects has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3532f58af69691ef8267a2c9c57c8d3162f1b114d349330f3838948ca5031ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 21): (anonymous) has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e75968fec00a7a20a506af0dae40510be577d66ab0b765b511446b17d98aee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeKnown (cyclomatic 19, cognitive 21): removeKnown has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa34e1d0622f9dd068be246e703a46192d0685e1381e111c4f0dc63213f42dc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeBtInPlace (cyclomatic 19, cognitive 21): finalizeBtInPlace has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"781cfa4735435bb30e83c19f63daab42414c172d2a2d937ed55855b9f5c68d7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doCleanupCacheEntry (cyclomatic 19, cognitive 21): doCleanupCacheEntry has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2389c6e0d2ee357980aca748fb0a42d97e2751e21c147ec0f2ff8d836f9d76cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function limitVerboseValue (cyclomatic 19, cognitive 21): limitVerboseValue has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6bffa8b46905402acde060e4af15642b8d2285eecfcf76439666aa73b2a211"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTaskFiles (cyclomatic 19, cognitive 20): getTaskFiles has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/get-task-files.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df55f70b92e9ddde6b6f2a6f97bb240689bcd708ec2b7757910b88aae76d703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceContext (cyclomatic 19, cognitive 18): sourceContext has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcd37e5a5b8bb6ec89810f4493345e871d540405614e078bbd06241787fe8b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DownloadsMoreMenu (cyclomatic 19, cognitive 17): DownloadsMoreMenu has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-more-menu.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1959c43a05935d0b00152b7d08348e49a1a1f6a01346c5f4820cc55753620af7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TrackersTab (cyclomatic 19, cognitive 16): TrackersTab has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc0936ffe619b85159d88ae77f09b793d9f368c4be82406157e6518a75aecff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retainedContentDigest (cyclomatic 19, cognitive 15): retainedContentDigest has cyclomatic complexity 19 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"64343b7b09712ff4bc16ed14852b9fdc01571ababa13345fea215e45819eedda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAria2ProxyUrl (cyclomatic 19, cognitive 13): parseAria2ProxyUrl has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d29623dd9c20db37c0dd670528f0a17102d635a0192c6bdb9851274fc3592ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySigningInput (cyclomatic 19, cognitive 11): verifySigningInput has cyclomatic complexity 19 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1633e8f572f513d25d4bdfd2db2f83549d736dabf727e04eb717ca9f811393a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isExactBinding (cyclomatic 19, cognitive 10): isExactBinding has cyclomatic complexity 19 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-process-ownership-authority.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18ab1a32189905b4bab7bf52a78e2d329b06383db6a0dc9dd71818992efce56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBatches (cyclomatic 18, cognitive 38): runBatches has cyclomatic complexity 18 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaac6474adad86ca2bcf4ecd20396f48c82f441d5165ab2310e903b296c5618b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishReserved (cyclomatic 18, cognitive 28): publishReserved has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"766889587ba393e1248661a0208dc02c979df74b6ddfb6cf8efa7f6d681b2516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 28): (anonymous) has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5972317b8bf99d285413bc30c7acc1af7897aa035e14bd787ba2d5ad7081beb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLock (cyclomatic 18, cognitive 26): parseLock has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-builtins.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d088abaac09a013d21e868abdbafc5b82c76620a56c183f251e5216e5cc86f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyAction (cyclomatic 18, cognitive 24): applyAction has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed78642569a5613a6068ab3b5a11019c7bd8eb5b3ff097fb8bb450057e8840e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopCurrent (cyclomatic 18, cognitive 23): stopCurrent has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/bridge-manager.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"122780d5548a9a40954955ce39f13f3fd77968c2e298a7994ff5a0db0036c2ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 18, cognitive 22): download has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/security/security-service.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b206a033b5d94ac76166561d0fe0932c0167afa0108804852c618e0301fc3c92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function limitVerboseError (cyclomatic 18, cognitive 22): limitVerboseError has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59e65e742b15f64a0bfe1ae11126ec091f1ebbca8a1b4c8d9871df7e1738756"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOperatorAdmin (cyclomatic 18, cognitive 21): runOperatorAdmin has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"771c04a76b81a38d457c7c4f40fcba234e1f833cc80a3e1dd56877b5a825e907"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startAccountAuthority (cyclomatic 18, cognitive 20): startAccountAuthority has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"075f8a5d37848346d84a95076478bc63aad3c12ec403ae2c6ac53270435f57f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSnapProject (cyclomatic 18, cognitive 20): prepareSnapProject has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-snap-project.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f21acd3c643e057fc44ef70fbd0453f8ca6b9b88f0e58bb3156a2288399bcb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanup (cyclomatic 18, cognitive 20): cleanup has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fcf671db266e85fcd3f2ef90b2409c50c53aa74aafefa46d284a04b407af5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFileSelection (cyclomatic 18, cognitive 20): getFileSelection has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"d489f182044014f06f7fddcc55ef5288d3e5858d6a05218733467b875cf1cf52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateRemoteExtensionRoute (cyclomatic 18, cognitive 20): evaluateRemoteExtensionRoute has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-route-policy.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"707ca119a0b21899b4ed6bda58b671a6d7ea06ebc750d5f6affcac1d0f4ea334"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runExtensionPairingTerminal (cyclomatic 18, cognitive 20): runExtensionPairingTerminal has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-extension-pairing.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b325e93fcc7a9f9d3f8709b465fddef7faca1374342e13763fb28f522f5ed862"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseServerTarget (cyclomatic 18, cognitive 19): parseServerTarget has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd36e632b04c49cf12768257aac7c9a19872531ad5825346a4e77d0d2cd92ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTaskSpeedUpdate (cyclomatic 18, cognitive 19): findTaskSpeedUpdate has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-inspector-activity.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"506d547b7bbbe14755ac4b1be05e381f1a6f2ee67dc8a38de9efe67414821dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeAtExactTerminalTransition (cyclomatic 18, cognitive 18): closeAtExactTerminalTransition has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da26ab3113fc00af58407c8307d199bed531befaa61310f1e2d6c9403a5c929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildArgs (cyclomatic 18, cognitive 17): buildArgs has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-config-builder.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a7ea31ca63181fe5e89c79e70cdeafe97e8836eff7abff00c045380698c744"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graph (cyclomatic 18, cognitive 17): graph has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"df64441c5c80caa6dc36d93831ec7d570b4cee251000b7d3c911f91796a21d38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activityMonthLabels (cyclomatic 18, cognitive 17): activityMonthLabels has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"199f47a3c31e1162c7c591dac9bd61fd064131758d75415f9559010d7e880a97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskRowBase (cyclomatic 18, cognitive 17): TaskRowBase has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-row.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c66ac3f1a325cc701266863e794388750ac6d90d368e92cb28199b2633ebd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runtimeEnvironment (cyclomatic 18, cognitive 16): runtimeEnvironment has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8014b48e10c77b4a533039bcdf737acc7b6174d7f18d8936446f7d60e03d1066"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerSafariBootstrap (cyclomatic 18, cognitive 16): registerSafariBootstrap has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/safari-bootstrap-registration.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cd22b8c01da3cbbbec49f85a04340cc39b35c4566f66f8bc1dce48049953f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppearanceDialog (cyclomatic 18, cognitive 16): AppearanceDialog has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ffa7c50ea7d620814b5a3732875e0aaa1e5082654619bbdca6de0846c8a59a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nasFileRange (cyclomatic 18, cognitive 16): nasFileRange has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3669b6f0bc5d9f7d226cdfb5c83c15a944fea70cd4a8812c075144f2f3dd8e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContainerPlatformMetadata (cyclomatic 18, cognitive 14): validateContainerPlatformMetadata has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-platform-metadata.mjs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32e3e37680cc821633ce669c5bf83b06f46fc687cac81a94a0bf103f68bb8c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 18, cognitive 14): prepare has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8702aab139cda2ab085ec7750a35233abfbec5d7e188c657fb09d5881a421529"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BtPeerGeoSection (cyclomatic 18, cognitive 14): BtPeerGeoSection has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bt-peer-geo-section.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8004cee61c5b2a8508de1b2addc88185fcf9fd830e07fa22bf4cbe9cf2785459"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AddTaskForm (cyclomatic 18, cognitive 13): AddTaskForm has cyclomatic complexity 18 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e5617f9587bfecb4a36ce7a5e61250d74d2e5234e418835beb9e153523bccd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 13): (anonymous) has cyclomatic complexity 18 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/chart.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc77c703f84494b7f83489ef38ef2b993a913cbbe797e684698d5854259d7b32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSafeSwapCleanupArtifactPath (cyclomatic 18, cognitive 12): isSafeSwapCleanupArtifactPath has cyclomatic complexity 18 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7540bd21c6387b3aa1ecfaf0ff0a760c361df9d32f75da930158275ecd5461e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePolledTasks (cyclomatic 17, cognitive 35): handlePolledTasks has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b746aee26315cffc4a29b69dd071f7917171fe13aaab83e31d4681731c90b21a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cookieHeader (cyclomatic 17, cognitive 34): cookieHeader has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f203c2301558878f38187480faef2bf04c0380791c35c03f68944e451edfec7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 34): (anonymous) has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scripts/electron-package-contract.test.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fc1517b57590b94d05088b5f33eb3d1224e6ce415d7719449763f15d1e79bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitSuite (cyclomatic 17, cognitive 32): visitSuite has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/run-remote-extension-release-soak.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99b17e6c388084ff2516be85c99193b8a11819296a5cf8dcd14864ceeef8db8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 17, cognitive 31): dispatch has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/pipelines/hls-dash-pipeline.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ac9eb57df1d20972397e0120509757173cdb12cab368d87d79b7e768a37db1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchAdapted (cyclomatic 17, cognitive 30): dispatchAdapted has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/bridge-receiver.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f252c06476774d7ccc5d621dbcd7df2b3796e5d01ae88ef5d53f7e46f5df9952"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assembleReleaseArtifacts (cyclomatic 17, cognitive 29): assembleReleaseArtifacts has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9efc4409339bf24662aa1299227f6d3a1c8f963fbe019a99bdf1f3b70c2504"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MenuTree (cyclomatic 17, cognitive 27): MenuTree has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0a38dbd42c210cb66c356008269a9c13bc8f50409ad6a01bb60ba57dc4af66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDeepInsideSandbox (cyclomatic 17, cognitive 26): resolveDeepInsideSandbox has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-sandbox.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"89352ab896d86ae072cf70536b6b8da3a0cd8d7451bf64c940d44dfff03751b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 17, cognitive 24): reconcile has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa87fc9c53e70ee65be21b151fd3d91648cbb8d9726cda28f17809294c4a6cb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restorePrepared (cyclomatic 17, cognitive 23): restorePrepared has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f16ddb1681db146580d3a5b4399a0894fbf7051b30760f254d5b8e7cd21518"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redactExtraEngineOptions (cyclomatic 17, cognitive 23): redactExtraEngineOptions has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e22e33b70dec655bb5ce898db1ff4df776ae6ba48a7567248b2c0dbd5b00f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStoreChannelSnapshot (cyclomatic 17, cognitive 21): readStoreChannelSnapshot has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-snap-store-channel.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"39417ef53061548c611bdd34ea3c18b6f1fe3359a7cb4d3adc5921d30b0c7420"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchFfmpeg (cyclomatic 17, cognitive 21): dispatchFfmpeg has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c6441a42edf011b4b5b0a0bfc1a882ed5f9576cb0d3506c37061c98b886bb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"6491d15fe36769ed5e27b38c7aabfed69f4d5c5ce4a12faca35fb0a1d8951b9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExecutable (cyclomatic 17, cognitive 21): resolveExecutable has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/shell-environment.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42bc2f2b66ea0cc8721ec37ddc6ceb2539c8977fe7dd1d40703136885fabb44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopPackagedApp (cyclomatic 17, cognitive 20): stopPackagedApp has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-electron-package.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1468d9d51c3c38ab17e179ada70180cf9c4126ecc4cfe7cec5f20d962a5033b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAdmittedTask (cyclomatic 17, cognitive 20): createAdmittedTask has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a86aa6bb1fcb30466af77689dedf9037ca42b37b0018020d668fee7701ee32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshOperatorSession (cyclomatic 17, cognitive 20): refreshOperatorSession has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"61578a81cf2a3ffc459325c677e43172391516fc33679bb891699fd69e6e59d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publish (cyclomatic 17, cognitive 19): publish has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28a8a68e3f71b28cc3524c2ca017e38c0969de301c66af0a9c3884888bd3c37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 17, cognitive 19): execute has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25e8caaa2e8d00e85b84f579b69792b1ada34a3b6200cd7af22a12c0f3585fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"991778b58b1f474b83a58b15e60f9fd376d5418c1288feeef881734929450bca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redirectRequestUrl (cyclomatic 17, cognitive 18): redirectRequestUrl has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"4735267b5274bfaf792ff5d1458844e61f329f4705abf9d5218b88ab417c6e82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function managerBinDirectory (cyclomatic 17, cognitive 18): managerBinDirectory has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f9eb9fbd594eb52d71e6a99764cb5780032d7061076cc86bde3818ed368019"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectMach (cyclomatic 17, cognitive 17): detectMach has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/native-binary-target.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d15fb4df9a695ab23313512946e87ca24fb308b4c25a1866faeefa5829311be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTransition (cyclomatic 17, cognitive 17): applyTransition has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea80129c183493ef5481bff90b61df513a8699d449a503af859007447141991"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BtTrackerPolicy (cyclomatic 17, cognitive 17): BtTrackerPolicy has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/task-tracker-service.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eec89544cc0448ba8c319dba2f8fb841fa7cefd2261441a642827729e7dea28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesAccelerator (cyclomatic 17, cognitive 17): matchesAccelerator has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shortcuts/match.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac79ea03cf7b639f7be917795387165ff1dbd3ded9bb23fe24e200bbeeeed803"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createApp (cyclomatic 17, cognitive 17): createApp has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/app.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d9e07c38f89b26ae9cae05b818136956fc3fed00ad6e64b41ad9d01d34ca2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6300f3da517f795efb9e41599d6bd0d66ef40edd77fb0e0e9dc63a791edf2286"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plan (cyclomatic 17, cognitive 16): plan has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/direct-recovery-planner.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1cf760c676486facb86747d8aeb3f9445b79d7cf39808d371fbc8a66cb66a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildValidSettings (cyclomatic 17, cognitive 16): buildValidSettings has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe20f6c836a09d1399e3cd076d999a0dc9c90c2d83ddff655be9c0233967ee8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdateActionButton (cyclomatic 17, cognitive 16): UpdateActionButton has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/app-update-section.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cf9bcfa86d5b8ced9575c4a6f6ca19e78616fca1d794587804fdbf8ff936f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveChecked (cyclomatic 17, cognitive 15): saveChecked has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/file-extension-pairing-projection-store.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3751c1cf725cf9afab63d1a9a62878ba4c1dd878ca86fda3f3bf5e3e32f05e2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileStatus (cyclomatic 17, cognitive 15): reconcileStatus has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-pause-state.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefd713573289737cb71470243e93701a55a792db2d30712db3dc7fcc571453b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function synologyFileAction (cyclomatic 17, cognitive 15): synologyFileAction has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/platform/nas.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"471e968a073a8e0eba9a87ccaa63a4bf1a59efff393123cde329c62e13616513"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function networkFailure (cyclomatic 17, cognitive 14): networkFailure has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/network/plugin-network-error.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6fecf225d92a764d028525dec0701c3fc53ea9f8ccc3141994900774383fb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admissionRejection (cyclomatic 17, cognitive 14): admissionRejection has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a0bb9ef8868a0a7b899d257735b493bc6a00006aeb0d8692d86be9f0eb8eec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isTaskRow (cyclomatic 17, cognitive 14): isTaskRow has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-cleanup-quarantine.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ac4d317de3cd17eee01e051bf0f1ffa708f9f130507b636b0630103781c1db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EngineTile (cyclomatic 17, cognitive 14): EngineTile has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/engine-tile.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0532b902ad0943b3d176464bebf5ade16a7033de3dd1cbdb4c2cd975210d75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NasDialogForm (cyclomatic 17, cognitive 14): NasDialogForm has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"32108de820a111610a30bcbebfd88f417099df3c464cc7737943dae251444f46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 13): main has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/authority-lifecycle.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60684906a0e642415ecdd4ca962f758cc82009cd534d41f5160846640115e5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LegacyFreshDownload (cyclomatic 17, cognitive 13): LegacyFreshDownload has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-fresh-download.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658bb14289c5d98fd92c8da546731f5df30284e44d9238ba6a08f1cd54cdb99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCommand (cyclomatic 17, cognitive 13): parseCommand has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e529dc0cb97a6cebc7b68c71a29ee58386ee9861d7409200ead5bdf553d008"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 11): (anonymous) has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/file-extension-pairing-projection-store.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"06295f467064792085be60ca889dc3985dcfcc7ff84102dba3417c8621e22a53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFfmpegRelease (cyclomatic 17, cognitive 11): verifyFfmpegRelease has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-release.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49b2570816680406cbbc2fe737960a432f823b7875568497058cc7070a0d804"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transitionAllowed (cyclomatic 17, cognitive 11): transitionAllowed has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a3e76af13b25493e49069ec4d6aaecc432514d376c6d6fe4977fe99af4174d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyRestrictedConfig (cyclomatic 17, cognitive 10): verifyRestrictedConfig has cyclomatic complexity 17 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2ecbfe4bd5d18fa73a06227fc67a8da00345ba8585e74ace6248e881486945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerCommandHandlers (cyclomatic 17, cognitive 10): registerCommandHandlers has cyclomatic complexity 17 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f4cefb015ff634130e11614bdfe184f6d575039ae45d884ed4889ad4cfa3d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 17, cognitive 9): reconcile has cyclomatic complexity 17 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-pause-state.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6747890843ae4003d17ddb140d88a3fe2ec5832c2e38b201fc7e84b5fd5885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanup (cyclomatic 16, cognitive 33): cleanup has cyclomatic complexity 16 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ff0dbe503af75712fd0449044325fa2100614ee5ab0b6ae1ee76444e1db17f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSnapshot (cyclomatic 16, cognitive 32): readSnapshot has cyclomatic complexity 16 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/command-graph.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f598379c33e3f145dc486d4ba04b57709a385d85c7b37c344b6bcda88e50d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBatch (cyclomatic 16, cognitive 32): runBatch has cyclomatic complexity 16 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2356bb1283c01aac71d6c8d44fdf42bbd96e9e10d28adaf4c8a0a225f73c94e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestFollowingRedirects (cyclomatic 16, cognitive 31): requestFollowingRedirects has cyclomatic complexity 16 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b3e9b0354ee84577fbf2b2299bac717a24268d2ad4ba4d12ceff73d39437d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectRuntimePackages (cyclomatic 16, cognitive 25): collectRuntimePackages has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-third-party-notices.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"386434fefe8fc2ad258f0bc43323c3ff0d175c0d15bae80434abc0779095ea64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanStaticModuleSpecifiers (cyclomatic 16, cognitive 25): scanStaticModuleSpecifiers has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a3b4a077b54b7e18f36aede15028899963e79318349098ac5979ceca7ee161"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBeforeFinalize (cyclomatic 16, cognitive 23): runBeforeFinalize has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"366f58b142db3458027ce26fac37793a9915ec1dc2d995e2878efca57af42ee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relocatePortableProfile (cyclomatic 16, cognitive 22): relocatePortableProfile has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/portable-relocation.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7678ed715d5158210d8b7a842a3539056d62981a4221a4d10ae606619210fbc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adapt (cyclomatic 16, cognitive 21): adapt has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/submit-download-adapter.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad1545c1992a42fe8bb8d38e3120658c5cf5b9b1e29669f77ac384c86d7c232"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleStaged (cyclomatic 16, cognitive 21): handleStaged has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5443e6aaed7e296a9c051a70fc0bbd40c8bcb853df527ed1e51a9812ceb1541"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseElectronProxyChain (cyclomatic 16, cognitive 21): parseElectronProxyChain has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/system-proxy.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00d4f8d01dae4cca650a24204f0d110719e7fb74b590b1015dc1ca4b78c23af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectPlanDocuments (cyclomatic 16, cognitive 20): selectPlanDocuments has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14143838097c107ca261de831b3a4784b0d5e19af1380217f00142fe953900e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OperationForm (cyclomatic 16, cognitive 20): OperationForm has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fc68b1f90fb521e305fc074795e2a8d6d8c665b73621b6bc4ee86ad7bc3e48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readArtifactIdentity (cyclomatic 16, cognitive 19): readArtifactIdentity has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/artifact-identity.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e36658bd80c77512f984ae7aa51457bf179f01c00e238853a608b04f53a7c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSettingsChanged (cyclomatic 16, cognitive 19): onSettingsChanged has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83923ccbd889672d1691f5aefdbc6dbaa080b297a895378b4ab215171e3be59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshot (cyclomatic 16, cognitive 19): snapshot has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/settings-store.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf22e337cbeef3ce8f3eb4309088efc48d036d639acdc007f389485106db8686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRemoteExtensionReleaseSoak (cyclomatic 16, cognitive 18): runRemoteExtensionReleaseSoak has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/run-remote-extension-release-soak.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"68044d4473fd4a8caec297883faeec3a8c716a058a206bd44df3c9adc7fa53c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 18): (anonymous) has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21e0a2ad12e98e7aaa359524c4486631c39228728b6ba35a49524890c44b0ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 18): (anonymous) has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-textarea.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0ef571b02ac3d731f3dccb36b84e2da2b14bb86600f73b457a94f1b4a384ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchCommand (cyclomatic 16, cognitive 18): dispatchCommand has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/app.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c928c0a28a80576ba134c087df7ace1ef304c7c904a6983670a5293958033b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyStage (cyclomatic 16, cognitive 17): verifyStage has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/before-pack-verify.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10385cd25bacdbcf9ee9e3c904445bb8db184fa5d6e0219bd11df79553308f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function directResourceRequestContext (cyclomatic 16, cognitive 16): directResourceRequestContext has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"386d72bb012c642acc05e26fff3eaf530773be1dc42d1992f505a71a3e32ca92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 16, cognitive 15): visit has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8b2114b39dc1314e9ec0dba2fe16f17cb9d108e91d755c9e25bb408682ff46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upsertLiveWitness (cyclomatic 16, cognitive 15): upsertLiveWitness has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecdc10dfd23185dc2225ff95ba13f06cdf65e6915c6c1d8e73cfd6ecb523da2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFfmpegBinary (cyclomatic 16, cognitive 15): verifyFfmpegBinary has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-release.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"155e8848faa88fab2818f6e16c9adc2607d4396bc0e8dc1238b0bdaa4855f476"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareFileRename (cyclomatic 16, cognitive 15): prepareFileRename has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06942a093789719febc7dc83adba18b62abe8b70fe30ca72a93dd1b442b1df9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reAddBt (cyclomatic 16, cognitive 15): reAddBt has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac4505148b1627a34b98ece4cc30391a204098f5a2e9956dea6d61b620e1516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/application-menu-snapshot.test.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b59462585aaccb5d3147fad2d9455a0a379da7dc245e3e7aee6bdba675ee4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeTask (cyclomatic 16, cognitive 15): makeTask has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.fixture.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d38e9ab3056f54b6b4bb0e732f86a644bffc8fe6eaa16de762684a94e83424"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAuthorityKey (cyclomatic 16, cognitive 14): loadAuthorityKey has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e96a05c743b661ae8130ee21541ec25bf2bc89faec19ea5aa0ad2559a4d8e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRecord (cyclomatic 16, cognitive 14): parseRecord has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee550081734290d4400a997702faa3737566329804f9fc1f5e8a58a1d76aa8ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-task-inspector-activity.mts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f6114995228f0ffffc8222fc76fa7c366e1e22ddd507169e42a19b5a9bd98c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FilesTab (cyclomatic 16, cognitive 13): FilesTab has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/files-tab.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9596c73004e92bb774259103809a5b13f2124e87b62507dfa4b2c1b439464a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectSystemIntegration (cyclomatic 16, cognitive 10): inspectSystemIntegration has cyclomatic complexity 16 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"886f1d78be97be75b1ce311c4805a576f1262f923bce017731a31de9f0e8afef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claim (cyclomatic 16, cognitive 10): claim has cyclomatic complexity 16 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0331fabb6a7c52995f4d1758f006c34052e2beb74564bfcfedcbdad7c6c3f7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 32): (anonymous) has cyclomatic complexity 15 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-task-inspector-activity.mts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c073649588cc114b20aec10d2952d590135390e8936e7b2af3dfb3e85f250f0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateInputList (cyclomatic 15, cognitive 31): validateInputList has cyclomatic complexity 15 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1aea4d90a8143674e29487597bf779ef353432687ceedb5da8e998dd28c819"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLogicalFamilies (cyclomatic 15, cognitive 26): buildLogicalFamilies has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-i18n.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f99e05c515913af891749872a92b1862ea90deae25d54e16d9c28195fb0095"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExecValue (cyclomatic 15, cognitive 24): parseExecValue has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1967d3a0b40fd3e95e0ac0ae19caa2bc6515d62a1e0c2bbb30caa15cb5b96601"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 23): (anonymous) has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bce2e9e591d19cdebf075c09e412b047bc63492cab2d14bf450b71f6bf0746"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 15, cognitive 22): start has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6cd130d47f763155e2d07279b33e7d5870c806ff154e68eb57b98d4e561c4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 21): (anonymous) has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/operation-commands.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2a9d310cc908a8630a2175b3a03c01f24428c1327440a695ebd9478fb38535"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectPlatformIndex (cyclomatic 15, cognitive 20): inspectPlatformIndex has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-platform-metadata.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"df07973c5d0a3c7aef5e75a7dac9dfe5b352287ae0689c6cd5dc2e580005b9fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectedImage (cyclomatic 15, cognitive 20): inspectedImage has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-publication-state.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb7ce95f60b7ba59e8b39836806a6ac92ed567c501dececb08cf51a01617345"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recover (cyclomatic 15, cognitive 20): recover has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73b2912d6af88048e9203a202b431b5d0518ab62b0ed849b9ec8e42c71fbc22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bd71a9d29b5bf0ce7fc1b9614d31e211a1e6fb61fac96fc92bb7a1fff5d466"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/appimage-cold-launch.spec.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b7171a25bdaecfe71206694385b1e99f89db325ce22b2a413a2de334695f12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRunIntent (cyclomatic 15, cognitive 19): readRunIntent has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/completed-task-startup-guard.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aae047140f75f1f86ac86176228ffa88490883756cf870f84a42e827ea51cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d76af2ce4f2eccb137b34d35043f1d11c03b0e86258bad80bee89431fc1b52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitUnderAdmission (cyclomatic 15, cognitive 18): submitUnderAdmission has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48cfc23fc1529edc9c1f59fefcd56b8b426cff97195e38b525abaf1434ef7e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-synology-package.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9100375d85f95627154c492b3782246bdff2e61fac49318d105c645dff6567f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 15, cognitive 17): download has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-downloader.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c5cd5977f96fb630b2fc5cc75d5661573e89a4c1031da4870ed54553eb5dbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startEngineAndRestore (cyclomatic 15, cognitive 17): startEngineAndRestore has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58d5cc53696128c7d70504fb0a01d27d7c00918e27cc3c95987a79c8f8a527a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySnapStoreChannel (cyclomatic 15, cognitive 16): verifySnapStoreChannel has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-snap-store-channel.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbf6576b8936f1f7147d824b2f26e99693c66825f0d6690e4fcaa897f20b8b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitAdmission (cyclomatic 15, cognitive 16): commitAdmission has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a83efb4a0a217ee3b3bb1480f213eb3c1385920026fbb1d7cc7da655919d2b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyZsyncFile (cyclomatic 15, cognitive 15): verifyZsyncFile has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/appimage-artifact.mjs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa05e4e3b5c4ef440edf8c05fdedab32f362cc3cce895405f349341d585e0f73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 15, cognitive 15): run has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-engine.mjs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f3ace6658a960966b0a576901b7a6e7b85a6c1fce279a3a05c5f93ea507881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchPolicy (cyclomatic 15, cognitive 15): fetchPolicy has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/security/security-service.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc29577695f285c098c4ae0fed8bd143c9ef021fd3e815ab333b63b7018ffd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canDeliverExtensionPairingCode (cyclomatic 15, cognitive 15): canDeliverExtensionPairingCode has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/extension-pairing-delivery.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"401dfa6c5b5c58ae238c81de24e7e3ac804b6d89acc84fc35a307863f27f5d33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNormalizedExtensionIdentity (cyclomatic 15, cognitive 14): resolveNormalizedExtensionIdentity has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-identity-resolver.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0d92ec4a833f8c6a46f23c88da44830070075b34210b62ce7c3a1d1910b2f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeStat (cyclomatic 15, cognitive 14): safeStat has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bd05a45e974f5e7d4a5b3fa8dd70167ffd8606a182e688715c3f5c8f286da2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeStat (cyclomatic 15, cognitive 14): safeStat has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6bb04c852570cad3ef0f12a86adfbfb5a19d041f513de82beee3fe14787bb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOutput (cyclomatic 15, cognitive 14): validateOutput has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd957d970a719b1bf9cc1a17372f61e9384f3f36c242f3139412b04cb39d18bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcilePending (cyclomatic 15, cognitive 14): reconcilePending has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/task-tracker-service.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8d9d1657bfd9a12680b4cb8b41db1e36788fd91b762bcb18fe09ae5ad14b04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands/open-task-file.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae35936e31863ffb9abe6002c0ae5acbef9b6fcb58afab1c86d276b45875a8c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getLinuxDefaultAssociations (cyclomatic 15, cognitive 14): getLinuxDefaultAssociations has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/linux-default-apps.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5a59b7df1985640ba6273a2d02c4defd0668932d7d32f7a4c5fd96ff65bf1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWindowsDefaultAssociations (cyclomatic 15, cognitive 14): getWindowsDefaultAssociations has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/windows-default-apps.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fdfc8cbc25ce152cdefe9e9cd82e600ad2542d1197c9c633591f6156d2622d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 15, cognitive 14): show has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecb27ce9e8cbfbc12ced603a2e808db1f2862428a967337678d2f8038da0f63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function menuActionEnabled (cyclomatic 15, cognitive 14): menuActionEnabled has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/task-context.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a2c386494bbb23a7c86c539ee128503cca9ff56dd7614b07588943f8edd39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyNmTicket (cyclomatic 15, cognitive 13): verifyNmTicket has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/ticket-verify.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aeb8356380d4c3570a53f0c041d83ac87d33769d73ca1fc0b5e560024a5876"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreMovedSource (cyclomatic 15, cognitive 13): restoreMovedSource has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef4e57649a630f589a3415ce985a89a48d2b78bb497ef87f045ab13a09c7c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFinalizeSidecarPath (cyclomatic 15, cognitive 13): resolveFinalizeSidecarPath has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/sidecar-path.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"915ebf069b0cf8f7cb083084780155b28f7f099e6a4522f8b69ba8b9ffd444e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function picker (cyclomatic 15, cognitive 13): picker has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedcb6f35cf49e55ac5a21fe679cbd8b40566e60779628373963b07e125da949"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unsafeRedirectReference (cyclomatic 15, cognitive 13): unsafeRedirectReference has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366c7a30ba80cbcd5a004e5a9b35179ba6f0873d32874f1c4f6941c6c2c9db4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GeneralDialog (cyclomatic 15, cognitive 13): GeneralDialog has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d38989471bca02f5894ee005c344f041380e619a1cb446e49f5a41b5070f14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPathDisplayParts (cyclomatic 15, cognitive 13): getPathDisplayParts has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/path-display.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a54af49f9f6cd18b11e151378fafd223e03a80f5dd9a1d947396894efb14fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseQuarantinedMove (cyclomatic 15, cognitive 12): parseQuarantinedMove has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c443a1023466cea501ac6ce955c6b59df2ad0c71b6b14534e19d55c4ef3db89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSecureTimestamp (cyclomatic 15, cognitive 11): parseSecureTimestamp has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/ffmpeg-macos-trust.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f76c2f89687ef69e80add0b8bd742b0cc10418038bfbf6f477786c2d8fd9e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeIdentity (cyclomatic 15, cognitive 11): normalizeIdentity has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-materializer.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2767195d26c05fdbb537507155f919335dab17a79166734e9af95ca4f9b3ab0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectBtDuplicate (cyclomatic 15, cognitive 11): inspectBtDuplicate has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-duplicate-policy.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8126f8da189184c2f334af305db919c596435b473212c413425d27ebe346d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumeUpdaterEvent (cyclomatic 15, cognitive 11): consumeUpdaterEvent has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/core/update-manager.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b7ce9303d0d1a03468fdc64582adfd0a85c90fc4c6ad4a3cfe906f119b893d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyDown (cyclomatic 15, cognitive 11): keyDown has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b658e61ab36d5c9e282aef6a245d7a36d9ef92772e772bc5d4dec475bb529d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 11): (anonymous) has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/registry-install-action.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5c37ce498955046bcbe2194b0f55fa507a57a93d3e351ebc8d5154dd945585"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNasTorrent (cyclomatic 15, cognitive 10): readNasTorrent has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6769781cbc8d751078ff481e488ca2af8307e05ce51a4cb6936f2c480bd1b2fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 30): (anonymous) has cyclomatic complexity 14 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-prober.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef871663a5cf969e8b2ed3955d7261cf2855daa13095e32717c129ce57a9bff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveInstalledDesktopIds (cyclomatic 14, cognitive 24): resolveInstalledDesktopIds has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/linux-default-apps.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3405742cbfce089112ff1dc80858300f907d183536f2ef4bffd2f3804e6df57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 23): (anonymous) has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/recovery-access.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad4930aa13626fa48bc98d9c16f28af85496707373d41702befac43a36790e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareApplicationOwnership (cyclomatic 14, cognitive 20): prepareApplicationOwnership has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/authority-lifecycle.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef46af5fa779d101fdc80aeb477a1e9388c57f61747379b9edeedf0a1bc166a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyManifestAssets (cyclomatic 14, cognitive 20): verifyManifestAssets has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"2626b3bc7f95252dc16fad98f0dae4df21f844b0ad8bbdf698b8d0ff893451bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSaveDir (cyclomatic 14, cognitive 20): prepareSaveDir has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/files.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dc4ddd3802b6d71dab8c6e8e11153f7e339df20096b6482fa8081b8e69481c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectTargetFiles (cyclomatic 14, cognitive 19): collectTargetFiles has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7074c794049796c6c945d6ff6bb83ba8813d522eb2eb9631473e1b6141b5fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertPacmanMetadata (cyclomatic 14, cognitive 18): assertPacmanMetadata has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-pacman-artifact.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb13456c7c7065a57ac2f07d4f84af8e12e8b94b7167f35da71975c6cd1b97c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLegacySession (cyclomatic 14, cognitive 18): parseLegacySession has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/session-parser.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac203b961ceaf30de9fdadfad8d8d53d63aa9e8590e9b86cacaf476457faeee3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHlsMaster (cyclomatic 14, cognitive 18): parseHlsMaster has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/hls-parser.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"762210f5c5510e111be172b59af1458262de8baeeeb08c2fa2a1f962ade53f31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 14, cognitive 18): draw has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/renderer.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fa5f1f4668e93f90e8be90674690c52a0565df4ea8d179694083f645a80ce9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/operator-auth.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d8a133a9b18892a978050c8c2da5e113649be81606bec279f8fe41cccaf3b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.test.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc7261b3f5018ceca51051c27510012ab7713db3d29e5099266732a8d5ac543"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeDesktopIdFromMimeApps (cyclomatic 14, cognitive 17): removeDesktopIdFromMimeApps has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"755387160923563853ffdc10f69d5de5d6eeb9755707b9f73c043b0587a971a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDownloadProgressValue (cyclomatic 14, cognitive 17): getDownloadProgressValue has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/download-progress.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3035a70fa5b246213620c85aead4ed333e405d51dda0dcf71df0bc1a7a98f426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderNode (cyclomatic 14, cognitive 17): renderNode has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-fields.tsx"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c95ccf6c4dfca142664d6dbfb999c1911ab9cb6dd6f3e2701315d534b3cb050"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOptions (cyclomatic 14, cognitive 16): parseOptions has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2657c7e7f39b64ccf76f04e827812ad5657fd793cadfe58d229c75bbe4ab899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function store (cyclomatic 14, cognitive 16): store has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-manager.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9c6cb83b378e3bd5a775f7d24ef67642fa21aa4884ad93a782f8b3de6f33f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.test.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"64badb2b243078516d72c7cf639e2be7d2790d6a845fe27b7c4bf0b70eac9a29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claim (cyclomatic 14, cognitive 16): claim has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/extension-pairing-prompt-adapter.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccbe042d5fbec609d7052a5e59bfe7b047b735a4447071ee84b0a3485a66fee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDocument (cyclomatic 14, cognitive 15): readDocument has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d7dc44fa2ca3f491bbdadf112f83c43570209cd3ccf0c7076241e0fb9aa7ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBtFileLayout (cyclomatic 14, cognitive 15): parseBtFileLayout has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-layout.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c809f3df708e89ff18a8be23d8a67b7903921de688d4ccb9208af3433aafa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completed-engine-task-cleanup.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b537b3f86a044fe08805ad6697577df2576c66f6803aad4869f6e17c2290d1b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function advance (cyclomatic 14, cognitive 15): advance has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-selection-timeout.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3404b92f626919b03d835e3e27f33bc44a81d2e2174e732693d0d1956700ba8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 14, cognitive 15): render has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray-speedometer.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f3588199d57d3a824dbb92cb73a128e8651f05273fe17af8cbd299c82ff759"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ActivityTabContent (cyclomatic 14, cognitive 15): ActivityTabContent has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/activity-tab.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eebe4093755c140088b8899559c7cdc81899bad01f76d5481289475b66244f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildActivityTimelineModel (cyclomatic 14, cognitive 15): buildActivityTimelineModel has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/activity-timeline-model.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee42acc373427c2f94856f5ebd773c478cc361b0337813a8c8c6e809b6f75bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPacmanArtifact (cyclomatic 14, cognitive 14): verifyPacmanArtifact has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-pacman-artifact.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfacc5cdd881e01abd67c4d91ab43f0b5103004081a51f2d6cf33840684a8192"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 14, cognitive 14): start has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e0320ca9e10bf2134d26c117584e9cc747776cd5086db2d40a3aa83b36df00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ac660daa602397e51b450f5edac5d90a5e62f7bfba727340ec6da64fc2e15a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 14, cognitive 14): run has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-service.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb96d34fff0cf0a4187cf47e1d5d0b3938a6d07142a2bed86c3d911433fc2d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportSurface (cyclomatic 14, cognitive 14): reportSurface has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec1bedc1072439e2879b3b78987d33a4e426aa2416ee8676b04da1bacf96820"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePick (cyclomatic 14, cognitive 14): handlePick has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"718b9634cb877828664561e2032ea313a36ec1ef90ceb3c9a965780b3d0d4bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateRemoteExtensionHost (cyclomatic 14, cognitive 14): evaluateRemoteExtensionHost has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-host-policy.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc50bbbabe0ae777b8819f5217a0a57ae8a73f06add369ffcc523e7d294347d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operation (cyclomatic 14, cognitive 14): operation has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/settings-store.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b04bbd303329c210247d9a690daed79859c66fa6b22452a0892b5f87d5ee53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconnect (cyclomatic 14, cognitive 13): reconnect has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/__tests__/mbp1-client.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c001c5a3ab112d902098e412add0779b6846ef9779f1d9c9395e5b3f2f0937fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleBinary (cyclomatic 14, cognitive 13): handleBinary has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0bc0013210e6232557475feb329ad7278e7e4f6409558b85266f567645d176"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshot (cyclomatic 14, cognitive 13): snapshot has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-query.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9cb029cfbe7627ff212b72fb01c5d29d85e5b7ed2c9099f1b9461494df017"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EngineBadge (cyclomatic 14, cognitive 13): EngineBadge has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/engine-badge.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba46a81917bee5f5b2c9796e27f04b8c1c404df01cc90726e83aef7b4c6242e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CompactLimitInput (cyclomatic 14, cognitive 13): CompactLimitInput has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/compact-limit-input.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cd4b5671b034c6590d57bc72525583decc63f38c99a999dfc0208e56d0a13a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"87880932a88c699380cb1f9b2e2109820aafe7857822be4fc6884eba6c3926bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isMotrixLocaleTag (cyclomatic 14, cognitive 13): isMotrixLocaleTag has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/registry.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"12350c25aedc17bf9112fc1a509dd5b12c1bba8f40ed059ed6b7990dbddd1a47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConfirmA (cyclomatic 14, cognitive 12): onConfirmA has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"912e163af4f28ad4435cb8f10ce5301bd5614d25bc5607ce11c670a4e27cd712"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function move (cyclomatic 14, cognitive 12): move has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/move-tasks.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d2f670c9c5fb2f8bfee316e37109942296665a3b445b1db6cd8d7e26b5790a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de62d5728c30d17f45f1a39366e53f8fcc2dc5f929795b07aef32bf2bc4ebe2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onChange (cyclomatic 14, cognitive 12): onChange has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad7d819ec17170c7645a6759897dc62000d86c5b1b33aca6863232a8482dea8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/fnos/routes.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb37e41f6108b868c1be0b0a9ea11f7efa6510818333e85436c0a6b5166e71aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectPort (cyclomatic 14, cognitive 11): inspectPort has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-manager.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b80fb0513476c1e9e1e445fe89c139d8cf06a02d05affc9b8bacac27049711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryDigest (cyclomatic 14, cognitive 11): binaryDigest has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"94df7c4934ac852251f4c73f692faebce9b661f002033176dffa38d60b34f71f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function InlineConsentPanel (cyclomatic 14, cognitive 11): InlineConsentPanel has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/inline-consent-panel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a184f7abac754cd479e53e4b070f53025b298a268224c2f57e583292c3be3bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileSelection (cyclomatic 14, cognitive 11): reconcileSelection has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-cli-tool.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5369611bdb9f26c5555634d4a0f76358644e50c16537928a055de9fba75bec50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTransferMetrics (cyclomatic 14, cognitive 11): getTransferMetrics has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/utils/media-progress.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ec2cf15647ccfb8f47c94078bc169cfe02adda3f71f33770fdefb0ed52cbda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySigningTool (cyclomatic 14, cognitive 10): verifySigningTool has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae13e286deef928bd5a343bef1b8138cdd50bf8c68e3dccd99fdf296d099031"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-server-package.mjs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a2baa280dcab4145c846b09db5540ef936acd4d7d4613ff5d363ae7bb3535a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function artifactIdentityEquals (cyclomatic 14, cognitive 10): artifactIdentityEquals has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/artifact-identity.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"603bf14403c2f6430cb4180d2e97e16fcfba8cb5c7b05f1c55c57a36ff65cc32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordInternal (cyclomatic 14, cognitive 10): recordInternal has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stats/transfer-stats-service.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cefb91b03404036610c449b802b7326873b766009c77f18fb339515cad721f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyProvenance (cyclomatic 13, cognitive 35): verifyProvenance has cyclomatic complexity 13 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-container-publication.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"981ffb0b1392bd3eeb442f9139e0648d3ffd2d78cd20bae6cd1790d6bc6ccdfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 33): (anonymous) has cyclomatic complexity 13 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/portable-relocation.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65f3737b0aa8314f06ac7ebe882b0aaf3a51e84de58770472b8f6266c56ed92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishOpened (cyclomatic 13, cognitive 24): publishOpened has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"6536407c2a33323223680bf1060de16ee32daafde33c2897853c704a296139b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function headerNames (cyclomatic 13, cognitive 24): headerNames has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d458111c19196809790abf176a07e32991f82b6fd3e739f5881b3211e5d7b871"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 22): (anonymous) has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-electron-package.mjs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eb58c493bf7f89dc190e48e19ebfc4aef807aa10339d35e7347d3ece17908b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverExistingLock (cyclomatic 13, cognitive 22): recoverExistingLock has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed578903d79d6c50e5849ca78553d1fa0a0d29475fc45dc5077cd439066ee7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 22): (anonymous) has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-session-identity-recovery.integration.test.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"786f0dd99187c2cbd373e43f55ca136c8b5e5178b8a568705bdf74d2e1fb446b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyIndex (cyclomatic 13, cognitive 21): verifyIndex has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-container-publication.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a088f00304ab6f2f9fd063404208383c13cc654fd33906031fa59c12127808f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedResponse (cyclomatic 13, cognitive 21): readBoundedResponse has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa24b0b5b3d73f3c8f3263eec5becdffb1193e1cb72d5bfbe891842135df5293"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-editor.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d332c6d9b6328aa799c43040ddcd153f3e8c397bca84303eee678706cb2c465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePackageInstance (cyclomatic 13, cognitive 20): resolvePackageInstance has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"222146fcc934ce274a93b829f3c1171cd6fabc06633306916d485505ac1640ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePackageInstance (cyclomatic 13, cognitive 20): resolvePackageInstance has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-server-app.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"028fca53c76f464ba0ae8486cb26832011f194859482015fda443f51ea1dce80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/task-inspector-activity.spec.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cf99b54e02377ea5548e968eec6222418e6efa30190af31554068ab81ba42e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireBridgeDataDirLock (cyclomatic 13, cognitive 19): acquireBridgeDataDirLock has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ef7a7a8d0527ad58a0b41de73b88a859bd40005e2a6b8556f2613b98fa4b3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee29bbeeb4c9dc5c8a53ebf0fb6dcfe12df4ec512b499d1c28131caf61f63c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/activity-tile.spec.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4472e6ae13bfee6fe8ca1dbb0cdac63be0fa94a5bd7ebe32e1f0d674caaf5dd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanupRotations (cyclomatic 13, cognitive 17): cleanupRotations has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/invoke-audit.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f970a3f4017daad4cb60c7f32b31fc0d5cfcc342a0d88c49858166beefb28da6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recover (cyclomatic 13, cognitive 17): recover has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cc405c08ea2bf7150c255c5cf281d783d411d9b43bcd41dfd08890275a524c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836ae0d64e676ac770ab0244f831057c885c805eda694773544c572975e13e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchWithRetry (cyclomatic 13, cognitive 16): fetchWithRetry has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-engine.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a5575cc50fcd9a4e8a1ddeb964f2586480f44916ac2f5de44587f9f96e0fe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 13, cognitive 16): dispatch has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/activation-dispatcher.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9528f66d3d58c08d4ff0d517dd47f7b70ef21d46d14e5ae6da086ba75833ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsValueToVmHandle (cyclomatic 13, cognitive 16): jsValueToVmHandle has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a66df372c8f0b7ea133b6ec7944afc3c9c27d11932f6576b78cb88a1985100e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 13, cognitive 16): read has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/network/plugin-http-client.test.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"713c0ae4932a645bb4a571bf9f6e77e4067dfdb357c47b5f4dd50fca895e5fbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBtOutputReservations (cyclomatic 13, cognitive 16): getBtOutputReservations has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-output-reservation.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0c836bf8243dae2754b7df534ed62c9bd5088263c0d7c478239f42262254db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.proxy.test.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb3439b614829b6d46da49560bf8cf1d2081070fe0ff4dd33158a370d18dc22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 13, cognitive 16): read has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/task-tracker-service.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4059bf90a418f6a74704f2abc8e2d5de48838b84a14ef902c5fee8cdea5502af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 13, cognitive 16): inspect has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9623819534b06268b8bf9b082552f7669e52da2646211e54dbff06cd143b5485"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyTestReports (cyclomatic 13, cognitive 15): verifyTestReports has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-ci-test-reports.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"194a8f7cbd8802676537befea3f86504c4e0a020e852c320e369fb52b12f54c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e53d3a75e6855a5d4b7af520aa5864530fd67a1adc1dc2dae32f16cb35ea77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/download-source.integration.test.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6af957e4a1470422d42c80567484ed2881ec082a1c679435dd41082563f70f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a482efe4217e85f9024999fe4f13890d749efd94cae90122e812186523b945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawActivityCanvas (cyclomatic 13, cognitive 15): drawActivityCanvas has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e45c6fe70390a5a37433d3b8f414781be15f8eb52a1ce674f5a81217e90e8bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDocsConfig (cyclomatic 13, cognitive 14): validateDocsConfig has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba15c469191aa741d61f81f519e1dbf26dabd2d2cc12a64fc1db09b90d81868"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translatePeer (cyclomatic 13, cognitive 14): translatePeer has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/translate.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"93886e9a1c5119fb700e73a42f6b5f81cd7f9bfe58d4337ef088fc22ae878beb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/orchestrator.e2e.test.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fa5cf74ac7c9a36a19685bb27e9b82268f915e3bcc9bb5bda476c75b081664"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/downloads-settings.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4125163fa25ab2fe408654bc27cbd71cfedd3c143c29ea0be3b275b74906564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-selection-timeout.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd866b32f3dc8cd69c1ccde141980b9b995377cf0a187def99cc46dcc104ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acknowledge (cyclomatic 13, cognitive 14): acknowledge has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efb8fcfc75ce213fbc9ffa291d4cf6bca86f071b435efab0ae9a50c79a4a565"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createFixture (cyclomatic 13, cognitive 14): createFixture has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scripts/verify-electron-package.test.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae66cd687bf4de28291f6da5dee2d419ecfafe5b4fe7edcde3ae2a82c0e678c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wireDigest (cyclomatic 13, cognitive 13): wireDigest has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-bridge-pairing-vectors.mjs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b22d9ac2b64f6e5c22acaf33cf96fd25584e94e3a16776728534c6c0bc93a54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consume (cyclomatic 13, cognitive 13): consume has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/dns-fallback.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10cc6570bd86cef168ffe662709a1ba50850e1e085ae0fe81efda57ff3fd8a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorizeMetadataAdmission (cyclomatic 13, cognitive 13): authorizeMetadataAdmission has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a454811c3b618b8ee00e49628f53ed2fb0ee98fa0dcc84d376a3114d30385b47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 13, cognitive 13): commit has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c922cc045bc393d943675ea9c3617ee8e9e109336ce64ab7964cde34d7e76190"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 13, cognitive 13): execute has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completion-shutdown-controller.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e8fa89c8eaa8e176a17bd26459ca7e2f6a1c2ce948eefe20e3dd8decb78947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectMatchingGid (cyclomatic 13, cognitive 13): selectMatchingGid has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1221e4751147959a267e185e400a973e86c1d2d694240968b52d46361401c811"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/downloads-visibility.spec.ts"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b29ea6ee3f6d109bc06e7d5706d56cc57b58107d899790f2878fcf0be27a8bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPayload (cyclomatic 13, cognitive 12): verifyPayload has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8519fcf14e466dcceccb98b5b517587946589ad38d87213d9d503106af0378"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendRequest (cyclomatic 13, cognitive 12): sendRequest has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f188462466320b906d1ba154507e7cd648030dee5187cbcf85d25450f1ddedc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeBeforeFinalizeBtSource (cyclomatic 13, cognitive 12): normalizeBeforeFinalizeBtSource has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae991d47392394b190cec6f3e35ce225a7b7cfe4abdc622da0ec3f7663aaf56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildConsentPayload (cyclomatic 13, cognitive 12): buildConsentPayload has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/consent-payload.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c9e3fd9072fdedc29a40cb7abc819a5a7f08dc1a86ddcb86afc96317529128"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOutput (cyclomatic 13, cognitive 12): resolveOutput has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/direct-recovery-planner.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fe3dc4bf43c83e1ede0b4e02c164303dbe85578a05673b92b68a649e812e0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertAdmission (cyclomatic 13, cognitive 12): insertAdmission has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e3de54ce6a5586bace5d9485a060750598c4ad214d4073613084fbb01853b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function taskRowToDownloadTask (cyclomatic 13, cognitive 12): taskRowToDownloadTask has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-row-to-download-task.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"51afed1038e3ae4aef5a0a41b91e053052b9a99408a6c41e3cb2f76b704cbf13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recreate (cyclomatic 13, cognitive 12): recreate has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"225a0ee83373fd7ac90c08bff0743c7b42ad5868c057f1003d4444e758843d88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WebGate (cyclomatic 13, cognitive 12): WebGate has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/operator-unlock-gate.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c45db671db58f21419ff548d7cb9d3b28b8f07bea020077e84c18a3c7b594bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addFavorite (cyclomatic 13, cognitive 12): addFavorite has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f68f9933062559d39c53e0076bde7f7bd1668dac308559d25bcc2154dfe7ad6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImportRunResult (cyclomatic 13, cognitive 12): ImportRunResult has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-run-content.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4feafd97ccad47fd7747d8919d0bff423fcec6329b2985a51547333eb4be576a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 13, cognitive 12): handler has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-notification-toasts.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7c33acf7c4f22e37f93b7238e6113a31b29399be568e53e21518ea95da7c65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shortcut (cyclomatic 13, cognitive 12): shortcut has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-menu-shortcuts.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c6c2e4ef794e03ce0c2337b9f70a28e6b2949bc7c7c2386aa9b52a642b2d6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function IntegrationDialog (cyclomatic 13, cognitive 12): IntegrationDialog has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/integration-dialog.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7843c9a0ddb898497c375a644b7cbb8e02a9d9d464d231468a7fb26b77df6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorizeLegacyTorrent (cyclomatic 13, cognitive 11): authorizeLegacyTorrent has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20c76d96b59cdd931b59e195f1105b90e8d14ffa7394bdb0c8cde2a18b44cf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f228384bfb533e8a62f9581c33fb14f9e856968e9983252b30167dd4a1a6b88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyLegacyContent (cyclomatic 13, cognitive 11): verifyLegacyContent has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52fdfd5a5be1926adff8a6e3884b9fa8968941ba01d76ed6183cd8886188873"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NatStatusMenu (cyclomatic 13, cognitive 11): NatStatusMenu has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/nat/nat-status-menu.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c4c70e9978f7c4a120265b4373fd00a159d9f258b6d57bc1061ca4fbf47a3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppLayout (cyclomatic 13, cognitive 11): AppLayout has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layouts/app-layout.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"438a3e1d193b531360a6b992eabe08159cdeb919495c934a9599c516bb8485a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function regularBytes (cyclomatic 13, cognitive 10): regularBytes has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69e9b1cc3cf9a39d88898defd4e769d44b1aea0c6e81b60dbcaf4853078cb22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSource (cyclomatic 13, cognitive 10): normalizeSource has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/source-resolver.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e697cf45ff31e37e1ea0a72fd2d20e861b17e5a6fe00dda2d6991da1a154951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHostPermissionPatternUncached (cyclomatic 13, cognitive 10): parseHostPermissionPatternUncached has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/permissions/host-pattern.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1ed23757a15f615ea9c563494990313dd841034237f04a6fe29a9aad2443a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dsmScgiRequest (cyclomatic 13, cognitive 10): dsmScgiRequest has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/api.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4686dd72ac98d48569dbd691d1a0cf7fa39bfd345dfa676a9239ac7f05982133"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRecord (cyclomatic 13, cognitive 9): parseRecord has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dfbd0f591db631e36b5cf22e27efc11c52055ec2dc2f3d882bb671e1450b4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRenameFileIdentity (cyclomatic 13, cognitive 9): readRenameFileIdentity has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/artifact-identity.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed74a90247c9b7815b24894210f8c74bcec8b0b2f334c40a275630049dc438c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeChain (cyclomatic 12, cognitive 28): mergeChain has cyclomatic complexity 12 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/chain-merge.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e40fdd6a00b4153fec7a27a34b4992dcd3aa0b27ddce181b6e82679e4b195"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deferCleanup (cyclomatic 12, cognitive 24): deferCleanup has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df5ce8f809eff3b4bc3df0044fc04dbd2420261de047c387b84a5b24e860795"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForRpc (cyclomatic 12, cognitive 24): waitForRpc has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test-utils/aria2.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43aa2c96734995c5a969c2af373ea760cc4f848f613164fe84f391f701f4686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 12, cognitive 23): visit has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-signing-input.mjs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"357295ab9541e0e25b30339fcba3f75ba0ea1e5e6513951f18962e6a1a18923b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setHostLanguageTransaction (cyclomatic 12, cognitive 23): setHostLanguageTransaction has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"502f74d24569538e4c09a47e841cbd6e2eda69707c5608aa70ea30e0d9df23ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCurrentAria2Rows (cyclomatic 12, cognitive 21): resolveCurrentAria2Rows has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c16a711148e56cc1efb0119757809d96a6569d43b93f005f4b05170fed0e817"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/dashboard-layout.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"43256d9d3f8fd5f17880f2c05ff1f86ad0e8997d6291ad9fffa4cc686fe95135"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 12, cognitive 20): walk has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5dea6a4d9eb05f5df36978c44366882130a78f16a01e2fe645613a50143b5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 12, cognitive 20): walk has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-server-app.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddc1695f0cddf7934d4afa1791ae538142d72c82dbe274112f063fae044c78b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncManifests (cyclomatic 12, cognitive 20): syncManifests has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/native-messaging-installer.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9752572aeefbbb445c5ec24c8e07be0c501ab900c085c75b482fc4f34c6c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumeInterruptedRecovery (cyclomatic 12, cognitive 19): resumeInterruptedRecovery has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"455069b561d4993867bd357be33858954e49acf5af1a2e24c6563a83889065a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMessage (cyclomatic 12, cognitive 19): handleMessage has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/json-rpc-protocol.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb980e6318fb75615aaeaf3e119e289653a20a57d8ed5254276dd5b9bbd865a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildResponse (cyclomatic 12, cognitive 19): buildResponse has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca0fbfd89d4cda634ed969687a5f7d73b737befaab79b93c64563ac60083fae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function init (cyclomatic 12, cognitive 19): init has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c35d1bef468d305c44a100a9e9494f99a7b3d68940fe2c39cb2b70a375ed0ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanForUpdates (cyclomatic 12, cognitive 18): scanForUpdates has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/update-scan.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"76325540b40f16c24f8eb511b16cd4cdac2e086154a004aa9437d9c6965d8b1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleClick (cyclomatic 12, cognitive 18): handleClick has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8619618519ca065e19e9eaf97bb55c4042145a0b1a775b20cc99d0c9f5c51bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleOpenSystemSettings (cyclomatic 12, cognitive 18): handleOpenSystemSettings has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/system-protocols-section.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eb7d7b0a55555e5d0ff01f78c3fd8f9a4db32ce1f0fc4490edb6a71294d952"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 12, cognitive 17): parseArgs has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/package-flatpak-companion.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d942d919e5fec446656b6335bf3831cdcba999e8448e971972b1329db2ec13a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receive (cyclomatic 12, cognitive 17): receive has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ef3837346353afaa98580e25e317d97319c0158333528d063ba4a93d2e4370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideAria2ProxyRoute (cyclomatic 12, cognitive 17): decideAria2ProxyRoute has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ab5386711d989dca82e39cf4059cddeeb263d9439116e7bac447ee94fe0ff0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disable (cyclomatic 12, cognitive 17): disable has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0383615a67df63c603baa5e9c7d021073a24e5ce5c708e78e631d21041212d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMain (cyclomatic 12, cognitive 16): runMain has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ensure-native-abi.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3800f504b3919c63276656683fe3cb46b80c66d5202435a61dc66f4694a9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWriteLock (cyclomatic 12, cognitive 16): runWriteLock has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-engine.mjs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"213a810cd4584163b2326c5bff12daf1f7bf200a587f78abf1c4310a16fdd094"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTrackers (cyclomatic 12, cognitive 16): selectTrackers has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-selector.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"350819d99b2cedff3d61c941f16c6292f96986f97cd976c58a00c8e1461a2b34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverDefaultWindowsDesktopBridgeResidue (cyclomatic 12, cognitive 16): recoverDefaultWindowsDesktopBridgeResidue has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/windows-desktop-startup-recovery.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b9ff7eff9671b98aa05567d7dda11ed03030fb43aac58cf205b08a0e75b01d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/url-textarea.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"655731ac6fafdb8081ae21a5ca0793b4f3dc2e904a42ee6ad55d2556eedc4a84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 12, cognitive 16): evaluate has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-surface-policy.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3afc384cb5110103993cf141cbe10b805d5d41393e67a29fcca92721c8132a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadGithubMoext (cyclomatic 12, cognitive 15): downloadGithubMoext has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/github-fetcher.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c8b2d73d97ba6b0e2a9b1a38cacbeaf8326348d78308b08a04636e7236378d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkParents (cyclomatic 12, cognitive 15): checkParents has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"680362d513742bba29e8ca5c6da2fba4f499fe3aa39b34125de066dca4d3a76e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flush (cyclomatic 12, cognitive 15): flush has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-intents.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d107e3f2a449c3fb3698659012828dff76e4e605cccdcb7e0b99c07a3a413f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditServerRuntime (cyclomatic 12, cognitive 14): auditServerRuntime has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d818aed5727fd433cba675eb17e13f3962812226c3eff511cb40c0dcb079df3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCreateRequest (cyclomatic 12, cognitive 14): buildCreateRequest has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mappers/download-add-to-create-request.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f55cd3ef99e19205c0736c85ecdfec6da03ebac7a606ce5f4ef228e27cce24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reAddTask (cyclomatic 12, cognitive 14): reAddTask has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"93762349e96a55a3bae481973fa667d60c705d92dc5617bce6520348d43eead6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileTask (cyclomatic 12, cognitive 14): reconcileTask has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e176edaea8a7fb2f86f949355cf974b436c36d55da2f313bf5cf27d54bdbf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/directory-preferences.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db494a312a7fd737fa323ae15d9f46797e64a8935fe04d42137e8ca3a41a4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/directory-preferences.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"917522900e43ab0a65da4e7c0bfc74d1c6b112d7f98265beb3b8501a270f6ba5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareNasSocket (cyclomatic 12, cognitive 14): prepareNasSocket has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/listener.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85e7c1c1a57c7d6759ef9482a139f104c5809bfb8c93bbd349d446b09dc662c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedDocument (cyclomatic 12, cognitive 13): readBoundedDocument has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/file-extension-pairing-projection-store.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"17de852ccabae0394cd43f30c69b3e93a0555f05e35240d6ffb18b4833ac0f9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanupReservedOutputs (cyclomatic 12, cognitive 13): cleanupReservedOutputs has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/remove-task.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"274b99c4b02e4eafe6deca9df9d7f17b486ed6501dd7b4ce6625f28ff23b245e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 12, cognitive 13): evaluate has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/completion-shutdown-controller.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9d89d357301776cca8e4b798c154efce5cbe456537dbad87a7da7c92588f20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyBytes (cyclomatic 12, cognitive 13): applyBytes has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b1ba9f31d6f18756dc8614106d85f48fc32528e0f983ba150c1e0a2043692d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCompleteUnderMutation (cyclomatic 12, cognitive 13): onCompleteUnderMutation has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"124ac454433a3a5b70b3b3db5643065c1b63168a774bebba05c5f90c5bebf338"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliver (cyclomatic 12, cognitive 13): deliver has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-intents.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f1edd16e66bf11e2f30a2eae7e83a628b9527e6d11af08d9ad0f5504b71dd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-picker.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3829fd828da427fc4fb515b1a70f015dba701b0219d5bf095cf3c98bd72fd56d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c53b4481109574936fec47f84c143cb8515d62b11901fb21c7981e05df07a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getProgressSortValue (cyclomatic 12, cognitive 13): getProgressSortValue has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/utils/media-progress.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a59276bd35bcd140728c0aad68c04f9ea9cf2a4ed067aa26f89b8eadde912c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.test.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90ca358573e40f6b0ec515a83b02b60a6af7905f7013b6dfb11de422fb98299"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activate (cyclomatic 12, cognitive 12): activate has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4189dca92928e3de07e2ea67a51b001531cf3bcedaecb28bcb20fc4daf887e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a863359d4f91f55e575b75476a1a4b8e888f01efe3fa010deac28bf77de717b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 12, cognitive 12): create has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/create-torrent/create-torrent-form.tsx"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea73c990d3e626a228df6c1dbd83390dc734a3d8b82b7c4bf2a1b0648cb2ac75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceFeedback (cyclomatic 12, cognitive 12): sourceFeedback has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2887d34d69a4c5378823511b08e8180e5081cddda1d923800fa8d2901bbf25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseForwardedForValue (cyclomatic 12, cognitive 12): parseForwardedForValue has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c5f34f56b62eab518928d2ffc6d0a67b71032a29253a2f4597fb4907829930"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFile (cyclomatic 12, cognitive 12): validateFile has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222040f9d1527aa974bd1ebadef3d94ee8edb53edd99e851439f28789f5ad80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManifest (cyclomatic 12, cognitive 11): parseManifest has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b7952c89f89f84fe1dcb3c6a8886e0ea365e2f39ac5fe5f62e3a15bd48e183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectElectronRuntime (cyclomatic 12, cognitive 11): inspectElectronRuntime has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ensure-electron-runtime.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3444c0c205a3d271bb0b88ce1434dc6b2cfd0f6bf9321bca32207f9f8617e7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 12, cognitive 11): tick has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure-desktop-navigation.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff4e3831af9b9479519d2b698f918b0986457163022713074e5b7e33bc4b5d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDocument (cyclomatic 12, cognitive 11): createDocument has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7308d95c04e5343e737eda528123df502b30085fa87fa25338dc4c302facafe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareFnosProject (cyclomatic 12, cognitive 11): prepareFnosProject has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-fnos-project.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc7c1cb3baa0631154e38a9bd3fdb98137eacb6911e85b948b2bcd124699d22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManifest (cyclomatic 12, cognitive 11): parseManifest has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-update-artifacts.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5428cb3ae5940cd4db00a9991d69aeb06c01c04a9ce1e4fcbd95b9e40f8408"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadOrCreateBridgeInstanceId (cyclomatic 12, cognitive 11): loadOrCreateBridgeInstanceId has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-identity.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e945b4a2ae9523e9a1a59f11b5d8978af83219296da5e20049bcf6ce9e8f8c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleUnaryMdxp (cyclomatic 12, cognitive 11): handleUnaryMdxp has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc5b560fcce80878e7c5db3cd7cd8f1024a5433e45ac641b7bc1d3473dd1d06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translateRawToTask (cyclomatic 12, cognitive 11): translateRawToTask has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/translate.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b12d1c2be3a40fdb19917bf744973c59b3c28a7248d9cde1bebbfbab27829f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"123093b00f2a9e6f2b2b0d489859bc9af21a314fbf1acefeb5256a1c55ff826d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adoptByPair (cyclomatic 12, cognitive 11): adoptByPair has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30a103df27de815d0cdf27dfe0a2762030aa426e7a85e277df5c2f54b4b0268"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshHttpMetadataBeforeFinalize (cyclomatic 12, cognitive 11): refreshHttpMetadataBeforeFinalize has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e049c355eb1714834f5df495679620480afb0ac630b70d122f96e5009e2e67a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performSyncAndCurate (cyclomatic 12, cognitive 11): performSyncAndCurate has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"813a1b4674f062c502b87734f429694df7c1a1e1389013f3f53f4027b68d0c44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 12, cognitive 11): resolve has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/shell-environment.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab15dd7e5d47295f6b42cced3abc2400bb38a76ba1e7ed15c626057fc3618d47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPayloadConfigFromPayload (cyclomatic 12, cognitive 11): getPayloadConfigFromPayload has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/chart.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec0f82c3bfb6a4551cdab37189dee7252d444dc9b393833877ebb678ea07b51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPrefillFromTask (cyclomatic 12, cognitive 11): buildPrefillFromTask has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6a1bab417c5f15d7a149f82d15457ac50ccf3e8631b309cc3bb7568e5fd27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTaskRetryKind (cyclomatic 12, cognitive 11): getTaskRetryKind has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/task-actions.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3318037cce6a98b855eaf93138a521346d30960359338c1d14db2aaa749334"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 12, cognitive 10): parseArgs has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-engine.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"651784a15f0915fb49c846605eb945c6c2e7b2fcd8ca1ebdf6e0e03ff05aca65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adoptAuthenticatedSession (cyclomatic 12, cognitive 10): adoptAuthenticatedSession has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a4517cb1342410b51047f317825f831236c858fea8d1ea3cc416e8b119673b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f1ad663f9a406df7717b4502f384c50448513e9b5fd67482294b5e367c8e09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeDarwin (cyclomatic 12, cognitive 10): probeDarwin has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/probe/disk-probe-darwin.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e46594d97d7d6ac2c31edbbaafd989a1a140faabfb4bef3aab74439f5534ea3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRow (cyclomatic 12, cognitive 10): renderRow has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-task-selection.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab963e2ba179355b7d1c7f17cab20c4dd72e3c9eb16493d32f6a4f3e045f121c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toggleFavorite (cyclomatic 12, cognitive 10): toggleFavorite has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1895fbcc32f76c386515493299d2ee407826ab72012934f5de55739dcfceec31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deepEqual (cyclomatic 12, cognitive 9): deepEqual has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/registry-runtime-conformance.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8da68fee65139b5cba802e5d91012d98e7adf1f38a059a2c04e3553a93f36e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLockDocument (cyclomatic 12, cognitive 9): parseLockDocument has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5545ccb2f2fa585a691f1aa3e86129e9990f34316c8409cab9df0f6cd44914"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function availability (cyclomatic 12, cognitive 9): availability has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90ebe6499824db047a202057893b3a73c9df1618369a87acaf0ca04ac16c97e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b550487d08810f7efa3fde6b2f103ed6e02411e9a7362f3e1e596395345e0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNasFile (cyclomatic 12, cognitive 9): openNasFile has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/open-file.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"912f903e0ac05c7f4594a6927c2d1b0e20b72b901d84d56f8b7ac6e161ffa935"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareFamilyShapesAndPlaceholders (cyclomatic 11, cognitive 25): compareFamilyShapesAndPlaceholders has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-i18n.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed89a0bcf96dfb63d4c088249caa3a15a95cf4d636373a699a80f5e7c2fafa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listPendingRequests (cyclomatic 11, cognitive 23): listPendingRequests has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c409b73ce0bfa80bdb6db5defb041e14f56f4c1f1be2ba68e61a858c4a1ebc38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findLegacyRelease (cyclomatic 11, cognitive 22): findLegacyRelease has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"588983d2aa8a8e08fb672d13086a468b9f8cd727c659ee57ad57eb0245ec0080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollOnce (cyclomatic 11, cognitive 21): pollOnce has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/download/segment-downloader.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"369cec9e40dc9f3334529fd5e814a8928c79a74dc2a3d886055684ba2df808e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeDownloadResults (cyclomatic 11, cognitive 20): removeDownloadResults has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f79faec0e37b1c14520e633fb6d682c30ce021a6ef0279c0c9cdd2a09b42b37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearStoppedTasks (cyclomatic 11, cognitive 20): clearStoppedTasks has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/clear-stopped-tasks.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"422eaa14a62c964f163ddbab4c9ad5992b1f6028be90cccc11b8f42828249c30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locations (cyclomatic 11, cognitive 20): locations has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01a4270e817383d6dd30352de3938abcb01c08eeab9630e510842f8ac14d33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSourceUrls (cyclomatic 11, cognitive 18): collectSourceUrls has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-selector.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40c9d301eb1489681d9836d0a8f0e899291fe3de708b3726001583f69f8fe06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePackageRoot (cyclomatic 11, cognitive 17): resolvePackageRoot has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afd9f3b3b753615e172aa329eaf3bc491e28b2c29eb455364574a75a436d18d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRegexEnd (cyclomatic 11, cognitive 17): readRegexEnd has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfbb32c86f79cadeb50447853e1ab8b02ba9a767f640954517a2047c95f3331"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testBootstrapIntegration (cyclomatic 11, cognitive 16): testBootstrapIntegration has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/test-integration.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fa931bddf94aaf3995ef5a804d52142bdae3cc65031cf32e53a52c406e902d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCiResults (cyclomatic 11, cognitive 16): validateCiResults has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-gate.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9795427f3b05b93bb53186c86214d0ccdf168f8f41c2f75c2af12f110e7af78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeJson (cyclomatic 11, cognitive 16): writeJson has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/native-messaging-installer.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c9e591efaa7db7c9180e1e1cc36ec897c1563a7f130e5a2ebcf71f3aba74ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"582782758ba81ddb4a35522c622c3a4843b90825cf94201f900437155fc205df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function noConflicts (cyclomatic 11, cognitive 15): noConflicts has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9ae2efaee9582c8544c6a5f0259f18b978e4204059a9ccaef2f05d0300f4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 11, cognitive 15): prepare has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b0ca48745b482a17b23ddc10c77cacbbf5731917b56a76f50929e86f5a35be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 11, cognitive 15): read has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"693af1fca14492f7253583dfa67e0c301561cf578a6cc6e509491c6394c021c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLimited (cyclomatic 11, cognitive 15): readLimited has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-syncer.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"26211fa1beb812b4e816a40a0213b9439f40f7ec4928b8cddde09208e5bd07fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitHighlightedText (cyclomatic 11, cognitive 15): splitHighlightedText has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/blur-highlight.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"49784b6366d41f281c4b30109903e728a40ee9dc58c3f6023ef5cfae0896613f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acbd8a8b0d705027dc04b6b0fe657c4487ce72ff453e3a79795878b008bd365"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/activity/validators.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b69525860d918e0e56e50975aca44e864a6dfb9176eaad06c26ecb9ea214563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyStagedMetadata (cyclomatic 11, cognitive 14): applyStagedMetadata has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6756fef588908ce6274b72330c51732bdac8f4b293e79d79dffcb4004292c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createServerDownloadPathPolicy (cyclomatic 11, cognitive 14): createServerDownloadPathPolicy has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/download-path-policy.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07c990a2c66a794b780a60c3260e4f773f63cda5c9575dd0d4111f5daf69abf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/bridge/remote-extension-firefox-wss.spec.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f620cd65db506b2603c97e72f7e7aea4d594bce6aedd37c36c0306235e6d8802"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushPending (cyclomatic 11, cognitive 13): flushPending has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stats/transfer-stats-service.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f04a0f9633a3f7e95c0e381b8c192967d4d5b0a86ff6b169b8b45b864197c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCreateTask (cyclomatic 11, cognitive 13): handleCreateTask has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e514e517d1e57b017a863c403c9adcca6b37ca79ca9d512b7dcf9ddc5fa37538"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onClick (cyclomatic 11, cognitive 13): onClick has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/hooks/use-selectable-list.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cc47ad946e6f42835414b4ebfb06ec6a51ee84468c2c573e9071e73b02f492"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function timer (cyclomatic 11, cognitive 13): timer has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-display-status.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b8e232a010bf9490e14c79831eb6df975065fba5c3cdaeb7ee3c8d47e44a10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceStillClosed (cyclomatic 11, cognitive 12): sourceStillClosed has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e5e2cb5a3f5aefb652a975007e7d5ab6eda9ab7dbdc759256122ce64bdfc08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRetentionMarker (cyclomatic 11, cognitive 12): readRetentionMarker has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/command-graph.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e12c8027e30af06c6befac787a61901734ffb7ad90de6a77289a8372724980"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeLinux (cyclomatic 11, cognitive 12): probeLinux has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/probe/disk-probe-linux.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb17c1bd0356c8c3de9b73c2641149a202ee065fa4feb697158c4e513c85473"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitTaskTransitionSerialized (cyclomatic 11, cognitive 12): commitTaskTransitionSerialized has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10d2091f56008e8f7d4e01b0ef8c58aa4af4db9cbd8076191a118820f4a3d53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 11, cognitive 12): create has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5ce5ef5f7cb91bbf46eae7308e36a7e33df287a8357c0274aea4130015057c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 11): main has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-electron-package.mjs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e60534cecfb092389a774a1e1d762a7c43da4202164e49dce6834d7f2a5dfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 11): main has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-snap-store-channel.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d3ec5c9fb1081cc592444a3db2f3cd8a50546c1f9f92db5a8cc78f81f7543f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recover (cyclomatic 11, cognitive 11): recover has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df4f64867ade66628875c4dd3a1ecbdcf02529f3044a0a0dec77871bb70a30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDash (cyclomatic 11, cognitive 11): parseDash has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/dash-parser.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"318bcbecb400fb48b7a33316a72b80fe14e9c3a00caf596296f80d7444f026be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRuntimeRequirements (cyclomatic 11, cognitive 11): checkRuntimeRequirements has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d596186ee66ddaf2479d9918c30058f5c8d196a50c28960192cfd97fa8b12f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/runtime/plugin-hook-runtime.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc2a3a60d987318d563bf68712d2f0294e9822a61dcc1198a0adfa028716466"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 11, cognitive 11): handle has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/notifications/os-bridge.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2b4ce2d2485a199110fbb5cac5a636f0463e89bbfcbbcc1938650e0471e02d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onState (cyclomatic 11, cognitive 11): onState has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/completion-shutdown.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0768238190be4f2a3ba76721858b0fd8f440fd2a47d2457fd3cc30b7903685"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirm (cyclomatic 11, cognitive 11): confirm has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3433ce72bdffea51b7ac669ce64f0dc33176e717394486cb22b6176e3d385d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"267da89dddda7948cbb5a46a1f3aea650d872c2d8949e1e48aa82369366f1e1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exactDataRecord (cyclomatic 11, cognitive 11): exactDataRecord has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/protocol/errors.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"417cbd3633fd01e9e7caf13db3516073cfffb0ea61da0ad16c440a36b711bfeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTaskSpeedUpdate (cyclomatic 11, cognitive 11): extractTaskSpeedUpdate has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-inspector-activity.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb13be2748ec96b29f1bb604ed40c56e3467def514af13208d85fa63297137"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startPair (cyclomatic 11, cognitive 10): startPair has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/__tests__/mbp1-client.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"95510af7fa6dc3561d9c412d71d76950f0eb477efdca82008a716c89653e1ac6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePairRequest (cyclomatic 11, cognitive 10): handlePairRequest has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7c7c103f0bb6272910bdfecf78390d8fad419ff683a981aa5dd077ee4f894b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 11, cognitive 10): fixture has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.test.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d92747deaea4c2488bf8ca06d54f725657115fb65d3365e865801f13c702b8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleHookAbort (cyclomatic 11, cognitive 10): handleHookAbort has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f7b947b532dbeaf0cf88752ca176bb8b081879e07cb84ba9a03753a2622150"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeWin32 (cyclomatic 11, cognitive 10): probeWin32 has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/probe/disk-probe-win32.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"325b7381687e2014c744dcd1c9750f391fab32309aabb1699ef9a9f414833352"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createNativeMessagingInstallation (cyclomatic 11, cognitive 10): createNativeMessagingInstallation has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d543de1c0e8de5b1f4a27f2ba9ed32efa4bcb84c53de71cc3e58fc89079d891"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerWindow (cyclomatic 11, cognitive 10): registerWindow has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bb909609552305b0d21d5ec434ffef29f317d79897e4e92f596b74e0aa6716"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createBrowserWindow (cyclomatic 11, cognitive 10): createBrowserWindow has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca43999f3c8d2e155bc26e35fecc9be6b03d5e59c67bc7b7889e49d7c2c68e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FooterActions (cyclomatic 11, cognitive 10): FooterActions has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/footer-actions.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bae8c0bc8c9b79dc711ac52a2b6aa52a23228f1f822386d09ef1ffac3db56d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFrame (cyclomatic 11, cognitive 10): renderFrame has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7883d2ae1d08e613ab8d92cca5c116dc1ad690b9d0edf186e8bf9df42dc28bb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DashboardGrid (cyclomatic 11, cognitive 10): DashboardGrid has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"d308ee3c5067cdd4308fbe98ec2db8bca89982d471a85738818f3f7fe14f0aa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SpeedTile (cyclomatic 11, cognitive 10): SpeedTile has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/speed-tile.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc3e4fbee3d1ceb580cb256df4059674bd750d9d6157d05ee0eab40b5ba8a13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-column-header.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b56dca4a9c9d0c4bf94d16266d6ff5c69ba2b1807aeda8bb4a21ef2c60983e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultDependencies (cyclomatic 11, cognitive 10): defaultDependencies has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83e3c382b5a1bab675ba66ef0c1207aa57cc41568480a75db6440428a234028"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDsmScgiResponse (cyclomatic 11, cognitive 10): parseDsmScgiResponse has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/synology/api.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d475454538083e0783d2f98c21ec2b71e2aa9f3731c2a5ab526c991871395c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesHostPermission (cyclomatic 11, cognitive 9): matchesHostPermission has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/permissions/host-pattern.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3db369e2da4c0229ac5ddbf51d5289f54a25de95e9aabf6e5ec9fedbc24ad23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stage (cyclomatic 11, cognitive 9): stage has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/update/builtin-updater.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb25d8ab386f3896d64565639bf1c7d434f74a71affe03877333e5eb9d07c33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordBreakerFailure (cyclomatic 11, cognitive 9): recordBreakerFailure has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28385e3267e7d25f495ce5fa4584ee3d93fccaf001b0394ee7ff700d77fc96e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBtDirectStorageLayout (cyclomatic 11, cognitive 9): getBtDirectStorageLayout has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-layout.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aec6c17c42b0fe1dd946aba11818d7ad9aaa0bc48b31e3c4508db586b04b05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filenameFromMetadata (cyclomatic 11, cognitive 9): filenameFromMetadata has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c8dfc2d1aa09d38cc12b6e5d3b9f23c781a63e60814f597bd5c0eaaeb66b94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isTaskInstanceRow (cyclomatic 11, cognitive 9): isTaskInstanceRow has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-cleanup-quarantine.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94f2e7b124f006381448771a543ddfecfcc0c6ac7b3603d28f0e32a22797a8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setLinuxDefaultTorrentHandler (cyclomatic 11, cognitive 9): setLinuxDefaultTorrentHandler has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/linux-default-apps.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb16e7989f50a51370755078c6459b09dfff707b7786a1f346ee11286b01ac83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMacUpdateInstallBlockReason (cyclomatic 11, cognitive 9): getMacUpdateInstallBlockReason has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/mac-update-install-policy.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"35911a7e8ca2d9408fbb912ea0c8021a6fbce180279d6fd12dc49c3527b08017"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverManually (cyclomatic 11, cognitive 9): recoverManually has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8cada7ceb91b3be13ac432fcf70dd23bbc851c0b05f66bb10702cc7238a94b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePointerMove (cyclomatic 11, cognitive 9): handlePointerMove has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/renderer.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"62660ebd1ba28e10e188fef0339160a3db659c73a88210aca294d927e6fcdd7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab84a3aa4c16adfa63ee054163b7046878cca72166693428db209b3b9b76b55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function select (cyclomatic 11, cognitive 9): select has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/client-gateway.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a3d321b542d339b65533a18d82868cbe42e9b553702855c92871b8a2821008"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/index.ts: 3252 lines of code: src/main/index.ts has 3252 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb60a4daf0b2c1300c0b8becd8da05efdaaefcf1658c3c35b7ddbf511d8fb29"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/web-socket-bridge-server.ts: 2724 lines of code: src/core/bridge/web-socket-bridge-server.ts has 2724 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265c1f6fb4864fd7b42f766f1ccb0e1c4f4c12af3cc08c8c09a0c6ce2fbe77da"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/index.ts: 2369 lines of code: src/server/index.ts has 2369 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"123188af2cf40e6c7cbf1c70b8807ada0904b0758e3e3e7fa74ceb812d3be8e2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/session/session-manager.ts: 2172 lines of code: src/core/session/session-manager.ts has 2172 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e991e05e315da665915df97e8d19e573d04e4bb78567b803f900208667c51b8c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/host/capability-bridge.ts: 2148 lines of code: src/core/plugin/host/capability-bridge.ts has 2148 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9390e12aa3ea53e39bdc1d7b6d0d34f044046834bcabdd763c51fd6e197803f2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/torrent/magnet-tracker.ts: 2143 lines of code: src/core/torrent/magnet-tracker.ts has 2143 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"030d8d7be70f06a581cd81c16c88f162d818e3a0fa3b1e06d6a2dfeebe0e3213"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/ipc/commands.ts: 2035 lines of code: src/main/ipc/commands.ts has 2035 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d1cf45e75083f25acef21f7078adb4cbf0a4a7b936fba94d62e5432a8ab7bb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/host/quick-js-worker.ts: 1902 lines of code: src/core/plugin/host/quick-js-worker.ts has 1902 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a931d4dba8273f339dec0378679f0cc0bd9601d9b2164f372588731116c84ac7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/session/motrix-database.ts: 1599 lines of code: src/core/session/motrix-database.ts has 1599 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d405d338f6166ee42863373357cb9bf2be515627e8bdd6d222aecfcaa16ae0cb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/direct-resource-validator.ts: 1539 lines of code: src/core/task/direct-resource-validator.ts has 1539 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5a7abb4d2bde4d58ba0cd554a17100c42335e5079be7f06e86050559e4c78a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/dashboard/components/dashboard-grid.tsx: 1538 lines of code: src/renderer/routes/dashboard/components/dashboard-grid.tsx has 1538 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33eb50e0bb6bb18df863f9931e17e009bf1e3b2a1415572c58c569b4e21ff858"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/host/plugin-host.ts: 1488 lines of code: src/core/plugin/host/plugin-host.ts has 1488 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4446170ca1d87214a1e36873af85adad7058d600c426a587099570ebb7f728"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/create-task-handler.ts: 1476 lines of code: src/core/task/create-task-handler.ts has 1476 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37535ede9d47b7a8ccb5bda148e3be07543034601fbaa4935b8557cda39c3475"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/actions/finalize-task.ts: 1457 lines of code: src/core/task/actions/finalize-task.ts has 1457 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53923f2aecddd72a670f156c77baba9c0ba9f31c1e4572a5967f47b728211ff3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/session/post-delivery-repository.ts: 1384 lines of code: src/core/session/post-delivery-repository.ts has 1384 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/post-delivery-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d94bca5334db8fb59a278e37a9ebc2334fe57a9a816b41ad500ae9c4f11b331"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/engine/aria2/aria2-adapter.ts: 1354 lines of code: src/core/engine/aria2/aria2-adapter.ts has 1354 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"064588e31beff2f5f8c6d19a51b4272128b7d4cf7fa43b73ec1ce73ff2353051"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx: 1286 lines of code: src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx has 1286 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a4d1bd0bd5eeb7456a4d9ed853dfbc8f18ef1bef4b373d1b5596021fe9042b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/media-task-coordinator.ts: 1229 lines of code: src/core/task/media-task-coordinator.ts has 1229 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c571271bb0cc1ab68e0f414d9728cf61ff3a7157dc7383326c1320aae9a6ddd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/platform/appimage-integration.ts: 1220 lines of code: src/main/platform/appimage-integration.ts has 1220 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba434cb792b8404069e3f741c3aab9beaac53bcd087834bdb60b23016ed7b004"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/ffmpeg/verified-install.ts: 1203 lines of code: src/core/ffmpeg/verified-install.ts has 1203 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8596a758aa30ddca126a00981f871f79e4d5fab6d20d1ccffbb907cd1f4cf420"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/ipc/commands.ts: 1187 lines of code: src/server/ipc/commands.ts has 1187 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f76ac6abf8b5243b74b1d49bd533422afc7ed48c111ade314d58d24338ad495"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/credential-store.ts: 1181 lines of code: src/core/bridge/credential-store.ts has 1181 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/credential-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e79a6e3e1d8252500ba4b7835a88b5cb0fc5db28c92d42c4c9509b40bf71147"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/dashboard/activity/activity-calendar.tsx: 1147 lines of code: src/renderer/routes/dashboard/activity/activity-calendar.tsx has 1147 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e2f0009f9c900f38ce5e8bb7023024197ec3e037b5b4831adde84b859909f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/mbp1/pair-session.ts: 1073 lines of code: src/core/bridge/mbp1/pair-session.ts has 1073 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0047217e7a2241b1ebc4235a72f5436c2483f112681fbed4e1e4f9b28914089"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/bridge/index.ts: 1063 lines of code: src/main/bridge/index.ts has 1063 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2ad4d50782b0f15f699a5f8c07c18e4276d47fcc3f311a1d4afd7a855fd2a7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/legacy-import/http-activation-service.ts: 1036 lines of code: src/core/legacy-import/http-activation-service.ts has 1036 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62992c74f0f65748855b51548b24bd94c4fcb18f0c5fed5405ca38bc1e5ab1eb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/engine/engine-supervisor.ts: 1035 lines of code: src/core/engine/engine-supervisor.ts has 1035 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caec52545626a869dfb219fa7bfa3d6faeedad1c38f6849eb9680bff5a076bb0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/inspector-activity/task-inspector-activity-service.ts: 1021 lines of code: src/core/inspector-activity/task-inspector-activity-service.ts has 1021 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5481a82c65c643b105c8b5b6b2643b1eeb7e5023322c4ffb755f6902765f366f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/features/legacy-import/legacy-import-dialog.tsx: 1008 lines of code: src/renderer/features/legacy-import/legacy-import-dialog.tsx has 1008 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c554ef8520749bd742452673d2c7331cba6e5bc6b3e516e14fd9c88ef03971"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/legacy-import/import-service.ts: 994 lines of code: src/core/legacy-import/import-service.ts has 994 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1326adfeb2074eaaf662d14fcc2cb8f84046d64ab645d4f0351bf57a6ef74d56"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/plugin-registry.ts: 985 lines of code: src/core/plugin/plugin-registry.ts has 985 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f134d1ef50a3aac651d678b3193ab4d671beffe99c8923880f717f1475483a4e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/shared/lib/log-redact.ts: 959 lines of code: src/shared/lib/log-redact.ts has 959 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfaa0133ec661123b0dc04e70f76390c9ae7c4945e06deee8fa1cd4599888b64"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/add-task/add-task-form.tsx: 953 lines of code: src/renderer/components/add-task/add-task-form.tsx has 953 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d279a54dfb00c8309beefbb0f188dd844bfcf8e267b1ffe7e6967533d32ecb35"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/torrent/swap-magnet-metadata-for-bt.ts: 922 lines of code: src/core/torrent/swap-magnet-metadata-for-bt.ts has 922 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/swap-magnet-metadata-for-bt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b9fea0ba974e026c095fd92b063025409ddbf5884d400473e47ab93bcb3e49"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/inspector-activity/task-inspector-activity-runtime.ts: 912 lines of code: src/core/inspector-activity/task-inspector-activity-runtime.ts has 912 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79071e6c3064bb9496f1e60e24fc08216285f395bd8ae3f6941987394513115a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/bridge-data-dir-lock.ts: 889 lines of code: src/core/bridge/bridge-data-dir-lock.ts has 889 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31219b4eabf06186b87c6462d9c22f8107d92be55c985d8aa0bf50ddf70ae86b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/finalize/finalize-recovery.ts: 875 lines of code: src/core/plugin/finalize/finalize-recovery.ts has 875 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-recovery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf4cb7e9a69c66c6587e3e8d3ac78cae6262af3adadc4309a8d39856d87b7e6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx: 847 lines of code: src/renderer/routes/settings/cards/bit-torrent-dialog.tsx has 847 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/bit-torrent-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc390b25c4f9157902733e5d051e0b6555ce440593fc9c3364908a2f683f052d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/finalize/native-artifact-operations.ts: 846 lines of code: src/core/plugin/finalize/native-artifact-operations.ts has 846 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/native-artifact-operations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b990629186167334670a6f62f4b91b24b96336d3df95f8a6afd4ba8b32d727"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/extension-pairing-projection.ts: 832 lines of code: src/core/bridge/extension-pairing-projection.ts has 832 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f90d9b6676d708a0b05e3b9c9187fedfa017d26c2a558e46055613b4a462be6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/operator-admin.ts: 816 lines of code: src/server/operator-admin.ts has 816 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2911bda3727e5475e77c2be839a5352a3b445cbc6a0bd001f43e2539526cfa5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/install/plugin-installer.ts: 803 lines of code: src/core/plugin/install/plugin-installer.ts has 803 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed969a4cb3e50e09f7f942b9bb8325586486104eddb48e147b72c13fef546ef8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/operations/operation-service.ts: 799 lines of code: src/core/plugin/operations/operation-service.ts has 799 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfb358a25ee731d0dd924406a4fa5ed080c19dd11db0af6decc05619734f8df"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/tracker/tracker-manager.ts: 793 lines of code: src/core/tracker/tracker-manager.ts has 793 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af41eed8377f47be0e3ceb5099424c749a5d8673baee56501db6edfe7e183d7e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/inspector-activity/task-inspector-activity-store.ts: 765 lines of code: src/core/inspector-activity/task-inspector-activity-store.ts has 765 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3e6d43fc9723315c6c3c04c216a4e7321c0ec6f2ec2252905191a3855684f3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/settings/settings-manager.ts: 764 lines of code: src/core/settings/settings-manager.ts has 764 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/settings-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9d3f4d264ce6a53e7db99af45312af4f0786e9c010d40d79235bcec808561d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/finalize/finalize-committer.ts: 763 lines of code: src/core/plugin/finalize/finalize-committer.ts has 763 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"770a3b173d4bf4f600d4e05d67fa749aef1dfdca260c64a60d835f47732399bd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/hooks/hook-orchestrator.ts: 750 lines of code: src/core/plugin/hooks/hook-orchestrator.ts has 750 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59783149e1fb2121ffec145060d26839f4e45ec8c1ef47f5c38f286390fc117"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/finalize/filesystem-adapter.ts: 748 lines of code: src/core/plugin/finalize/filesystem-adapter.ts has 748 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/filesystem-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3af1bac62cd9322c7e726fb5c5fc42d7c1fe934135ab58125347ec28c50f9a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/bridge/remote-extension-admission-policy.ts: 732 lines of code: src/server/bridge/remote-extension-admission-policy.ts has 732 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55f64700da45d1b3b08e753cc7a6d80d5103aed52fe84ffa7365b298338e436"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/ui/sidebar.tsx: 724 lines of code: src/renderer/components/ui/sidebar.tsx has 724 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a64c9e345e5035ac7f81809adddfd4c93d1107ab9e5a971bbc585a8da9f81ca"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/actions/re-add-task.ts: 720 lines of code: src/core/task/actions/re-add-task.ts has 720 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bf569a83da1e9c936eec8408ecef0ca0bec2c66dbe74e1fe1e96cb970ea6d7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/operations/operation-files.ts: 717 lines of code: src/core/plugin/operations/operation-files.ts has 717 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"588f3ddf1578ceb61990407f09452576667f89379dc5918842ecde410ec8dc1e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/features/web-directory-picker/directory-picker-controller.ts: 708 lines of code: src/renderer/features/web-directory-picker/directory-picker-controller.ts has 708 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-picker-controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1050e238cbeba89cf54507760b4377fe008418c438f579774cae0c6c0e67d4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx: 706 lines of code: src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx has 706 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/lifetime-transfer-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7553408ced12f26cb24fb7ca6fbebfec4240d146a8d000b91d2ae01bccc56f1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx: 704 lines of code: src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx has 704 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/engine-diagnostics/engine-diagnostics-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1969e304072a536b92077a06cdc5b64244502514efbc45740f5d7e271392d12"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/window/window-manager.ts: 701 lines of code: src/main/window/window-manager.ts has 701 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6105c8a6a4b2a0ee823305de803475d8acbddd2fd08268faf3d7c2119047e5c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx: 691 lines of code: src/renderer/routes/settings/cards/integration/media-tools-section.tsx has 691 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/media-tools-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f48165bc836326c13dfed8bbdc32eb4e72daf59f0bc183ae7623918550921d1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/capabilities/ffmpeg.ts: 690 lines of code: src/core/plugin/capabilities/ffmpeg.ts has 690 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b505134ae55fec95322b4bdf65fe577a3304f242ea83f9ba32d5a37049ad28"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/window/renderer-supervisor.ts: 687 lines of code: src/main/window/renderer-supervisor.ts has 687 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-supervisor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68747ae955e9d4889d4170fa48b1041f6c77cd2c3f88268ce0820f438331debf"}},{"ruleId":"R3","level":"warning","message":{"text":"src/shared/schemas/plugin-hooks.ts: 686 lines of code: src/shared/schemas/plugin-hooks.ts has 686 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f3516b67cf427c656ec526d55ce986f23d9c42bd29362bf08c0318b2b54a13"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx: 681 lines of code: src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx has 681 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/call-graph/plugin-call-graph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fe0517c4db3c711f746045aa61638dd29641f13bfd0fea5f4dc5a9f5f2cf95"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/features/plugin-operations/operation-form.tsx: 678 lines of code: src/renderer/features/plugin-operations/operation-form.tsx has 678 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/plugin-operations/operation-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b4d048916b6f3a52d5fc1e459fe8579576e4e36e65316e51c22a010899dbce"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/capabilities/http.ts: 656 lines of code: src/core/plugin/capabilities/http.ts has 656 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed1d0e37a93b82d47363b52dae35da25607be40d68a107cddd46d495db2b341"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/actions/shared.ts: 655 lines of code: src/core/task/actions/shared.ts has 655 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e2751feb4040fa3ecc9d9fe79cff1fb1017d3a7c260f2cdd3e3eab1fba9a56"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx: 649 lines of code: src/renderer/routes/dashboard/tiles/tasks-tile.tsx has 649 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ada56b58d9255cb475bae18477155f00c828d890a2e50cc4fe0787c0aafe8e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/legacy-import/bt-activation-service.ts: 632 lines of code: src/core/legacy-import/bt-activation-service.ts has 632 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0df48036b0ff46f9c2f3b86d4c94d378434bb0ae3be69d833f531c4f0299e4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/cli/cli-tool-service.ts: 624 lines of code: src/main/cli/cli-tool-service.ts has 624 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/cli-tool-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ea830ecfc349f6185c0d3668cf9841f68cbb9cf7f8e4eef753a9450fa65e0e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/downloads/inspector/use-task-actions.ts: 611 lines of code: src/renderer/routes/downloads/inspector/use-task-actions.ts has 611 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"940604ceb6172e7383e481f260b820aafc808ac62bc41273ea4cfc3ba119725e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/downloads/task-actions-menu.tsx: 609 lines of code: src/renderer/routes/downloads/task-actions-menu.tsx has 609 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e4015744037e41c3327eaa5e1b431610429efcc137962150c67b373eb964c6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/appearance-dialog.tsx: 605 lines of code: src/renderer/routes/settings/cards/appearance-dialog.tsx has 605 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/appearance-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c98ed71c760ec824b5bd214793050cdd961f0d1ce44d79a50f7bcb8a125e061"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/task-recovery-service.ts: 601 lines of code: src/core/task/task-recovery-service.ts has 601 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/task-recovery-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50c46172f0d41dce2088c0425f3f063a1f8b6f759658332f48cc04a2cd5dfa8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/session/finalize-journal-repository.ts: 568 lines of code: src/core/session/finalize-journal-repository.ts has 568 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/finalize-journal-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e25129c103921c89ba578cb50dbbcae6d28b3b0f7aa8b7d7605d5bf2d505e14"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/post/delivery-scheduler.ts: 565 lines of code: src/core/plugin/post/delivery-scheduler.ts has 565 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-scheduler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1636dd8383d10a660c204145ad55792dcc27f2310f2a498f2edca690a08e09ac"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/network-dialog.tsx: 564 lines of code: src/renderer/routes/settings/cards/network-dialog.tsx has 564 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/network-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c0b2f7ae1c09593a5a1cc258220d76b69e0c9e2eb0866ec035385c1854ccab"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/speed-limit-section.tsx: 554 lines of code: src/renderer/routes/settings/cards/speed-limit-section.tsx has 554 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/speed-limit-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f96031d47125b7ea18f7d26d118eb6d3dc275c99d0ea8604ffb2324d60634d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts: 553 lines of code: src/renderer/routes/dashboard/activity/activity-calendar-model.ts has 553 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fe60d44a73e408eda536df7d07e1c5e43bf644d88bdd300e799c9fc888bdb9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/nas-dialog.tsx: 550 lines of code: src/renderer/routes/settings/cards/nas-dialog.tsx has 550 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f2384a4e82c771964661920191d91a2429d72cbde9a253495694b1bb814c75"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/advanced-dialog.tsx: 547 lines of code: src/renderer/routes/settings/cards/advanced-dialog.tsx has 547 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1334f382fc6bb561722208598b1200a2e45f46c1a4be5e3552708b5711da27"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/install/moext-reader.ts: 540 lines of code: src/core/plugin/install/moext-reader.ts has 540 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/moext-reader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a8e48ef03bf67e53bf48706d72dd8e46f12748209d592a33130aa18c2af3d1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/bridge/bootstrap.ts: 528 lines of code: src/server/bridge/bootstrap.ts has 528 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a424543a958476e86e96d0c5d2cb2a0bc767d36490e01767f2708516c71eb67"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/menu/menu-manager.ts: 525 lines of code: src/main/menu/menu-manager.ts has 525 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/menu/menu-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58494c45f4cd31b0ebcd3d81697fc7b7eef3eca7a6804c30ee3ce7d4f5431a6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/engine/aria2/translate.ts: 522 lines of code: src/core/engine/aria2/translate.ts has 522 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/translate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5cda69f9c191078cbf91fc27684eb10f727b8900e9eac58f94039fb94b4f66"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/download/segment-downloader.ts: 504 lines of code: src/core/download/segment-downloader.ts has 504 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/download/segment-downloader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"761e8857d1abc91b12aba8ca34e11f95ea5c68deca23dad143dd3751e18a41f5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/legacy-import/source-scanner.ts: 503 lines of code: src/core/legacy-import/source-scanner.ts has 503 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f75cf80a7a29cc7593ee9e30ae072e273c9840e3a5c670a8fbf59094cac3d2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/session/migrations/index.ts: 499 lines of code: src/core/session/migrations/index.ts has 499 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/migrations/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4190bf0c56fbded50cdf1389b1bf271cf143cce691a0538fc9728f56fe07f19d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/downloads/inspector/trackers-tab.tsx: 499 lines of code: src/renderer/routes/downloads/inspector/trackers-tab.tsx has 499 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/trackers-tab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f784b780321d2f6f801dcfddd5438286f4249f71a573163318347c749524a3e7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge-receiver/bridge-receiver.ts: 498 lines of code: src/core/bridge-receiver/bridge-receiver.ts has 498 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/bridge-receiver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e790e4506d91c91d861b7910af87999ae9ef879385591da2470d1e4550aba"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/bridge/appimage-native-host.ts: 497 lines of code: src/main/bridge/appimage-native-host.ts has 497 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3189d267fc517f2231dba3881aa3459b1496721c4d9f6c47d14c0cefbe981560"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/create-torrent/create-torrent-form.tsx: 495 lines of code: src/renderer/components/create-torrent/create-torrent-form.tsx has 495 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/create-torrent/create-torrent-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"403bd22c4b7fc831edda9416a9719ba3ba2db4ce0075f5a775733d6ac508040c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/mbp1/reconnect-session.ts: 493 lines of code: src/core/bridge/mbp1/reconnect-session.ts has 493 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/reconnect-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69b83cf772392ea7b86342375e055eccf372052707e46c7ae64da71990e4a62"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/bridge/native-messaging-installer.ts: 492 lines of code: src/main/bridge/native-messaging-installer.ts has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/native-messaging-installer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1918e4b85cef0864a7c5f82720be9e8adade3425b0d3e83e9a9a605b4445ef"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/lib/directory-preferences.ts: 488 lines of code: src/renderer/lib/directory-preferences.ts has 488 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/directory-preferences.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2371ff9ba428fe62adb576bb4df128df110d3cc722588d9f12d485cf30dc09"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/plugins/plugin-detail-page.tsx: 487 lines of code: src/renderer/routes/plugins/plugin-detail-page.tsx has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-detail-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8248653b29b112632b5c01e349661614270093ef4dffb3184dbedb0703dbf0a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/tracker/task-tracker-service.ts: 483 lines of code: src/core/tracker/task-tracker-service.ts has 483 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/task-tracker-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb96e92a44313ea7e332daa3ca010f255d2d729ca8c3e67eee17eda00740524"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/proxy-section.tsx: 480 lines of code: src/renderer/routes/settings/cards/proxy-section.tsx has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/proxy-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b37808547fb33424f7540267c6c4bfbedaa151d1bbda9fdf5536a4ee46d06ac"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/media/dash-parser.ts: 479 lines of code: src/core/media/dash-parser.ts has 479 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/dash-parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb54563a2ab240b4f4c68bee3c80b323c9bbfd1fa4558d13485641ab0e4047d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/features/application-menu/web-menu-button.tsx: 465 lines of code: src/renderer/features/application-menu/web-menu-button.tsx has 465 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/application-menu/web-menu-button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb8e6745e857ab9f681bbc021b554b03a076f9e794a0fd3328ce2667157526c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/engine/aria2/aria2-rpc-client.ts: 463 lines of code: src/core/engine/aria2/aria2-rpc-client.ts has 463 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-rpc-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fbc3d3a539d12410ec974b2ed237d5804c93882d1fafb7a8eb1599ddceaabc"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx: 462 lines of code: src/renderer/routes/plugins/plugin-diagnostics-page.tsx has 462 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/plugin-diagnostics-page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db61347726781918d835d736f116a8d731d8d602e6e96aea5b3536a61548d324"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/general-dialog.tsx: 461 lines of code: src/renderer/routes/settings/cards/general-dialog.tsx has 461 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/general-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0483707a2b8acba6013580a3ff98b90866ad300406cd7052e8fddd77aeae25a1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/pairing-prompt-controller.ts: 460 lines of code: src/core/bridge/pairing-prompt-controller.ts has 460 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"449d8ea03481274be8d82e1a3f517505c081e5499264961ce48fe441202c2bfd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/bt-storage-service.ts: 459 lines of code: src/core/task/bt-storage-service.ts has 459 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cd5bb58083789c4dea75cdb22a1aa5403174f3db00faef07161df80693be8e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/device-code-service.ts: 458 lines of code: src/core/bridge/device-code-service.ts has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/device-code-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a094a9e1524b70e198cd97ab191546cfd7ef2ef1e2360910b2d2cb080540b58"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/task/actions/remove-task.ts: 458 lines of code: src/core/task/actions/remove-task.ts has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/remove-task.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71940fd6571c723fd87e87725670603b1df9823ccd5237730001241a7d043473"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/lib/transport/http-ws.ts: 456 lines of code: src/renderer/lib/transport/http-ws.ts has 456 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a85171547702739d07102a8206849ed8221f0b338dba5cdf77ce64e45191988"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/capabilities/log.ts: 449 lines of code: src/core/plugin/capabilities/log.ts has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed094fd23cb187f4559fbc6a890e0f6f3e369f4bea8f70b44a6c1f078eeb697"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/stats/transfer-stats-service.ts: 445 lines of code: src/core/stats/transfer-stats-service.ts has 445 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stats/transfer-stats-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84042ef34301b16d7257c7e624eef21ce12e8152c7418caee1489736f8c0bf34"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/hooks/use-task-activity.ts: 444 lines of code: src/renderer/hooks/use-task-activity.ts has 444 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-activity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985e04173ab6ec637510c0bb9f6ceb58702e7b789b8249f7e163f9c9ca5a3d89"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/engine/aria2/aria2-process-manager.ts: 443 lines of code: src/core/engine/aria2/aria2-process-manager.ts has 443 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba095a304f384ffbd1123b88f8a4212ba7e61cb8ebb390a0200f47b38224629e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/window-chrome/motrix-menu-button.tsx: 435 lines of code: src/renderer/components/window-chrome/motrix-menu-button.tsx has 435 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/window-chrome/motrix-menu-button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1724fbab71a9288b3be9a110a3e53aa149885295dfc23edda9ef70da655d6486"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/legacy-import/desktop-import.ts: 431 lines of code: src/main/legacy-import/desktop-import.ts has 431 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/legacy-import/desktop-import.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"085651d1df0529d7aaefd31121cb5023896eb36baf5f2deca3aae2ae31957b8c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx: 428 lines of code: src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx has 428 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a2f6e540f2e0540d496261d36526e790c38fa841b1187e9792627060f16368"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/hooks/use-task-list.ts: 427 lines of code: src/renderer/hooks/use-task-list.ts has 427 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-list.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a04aa20d221c544248715918cfbad3adcd2b97b4dff9d8473b1544dada3b60c"}},{"ruleId":"R3","level":"warning","message":{"text":"packaging/synology/app/lifecycle.mjs: 420 lines of code: packaging/synology/app/lifecycle.mjs has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9aa5fe034bbd4dc84cfb84dd3b9ca4b94cf81a56e0d96edf22f309ed995a3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/downloads/inspector/activity-timeline.tsx: 420 lines of code: src/renderer/routes/downloads/inspector/activity-timeline.tsx has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/activity-timeline.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8c7970944b21dbf4a34e6f7cec66acbc5f3bd6cdcb3ad472a36df91f6de179"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/post/delivery-types.ts: 418 lines of code: src/core/plugin/post/delivery-types.ts has 418 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0058d5cb5805b997a4ce8f7a90323c2b21f979d3b35bb11e89751842e3d17e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/finalize/artifact-identity.ts: 416 lines of code: src/core/plugin/finalize/artifact-identity.ts has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/artifact-identity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40714342aa6fa76dae9ec43e970bd8a46227bf4baca73075864809a99f2fced5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/plugin/security/security-service.ts: 416 lines of code: src/core/plugin/security/security-service.ts has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/security/security-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2321d7da3224e6c87db2228fd97e7da7c1c78d6a9f76f6f51f0d0b24254fdade"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/bridge/remote-extension-config.ts: 414 lines of code: src/server/bridge/remote-extension-config.ts has 414 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32236835bddc15e5872d3d91d8d778388724158ad7bb684d1d85c9ac68afaf18"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/server-directory-service.ts: 410 lines of code: src/server/server-directory-service.ts has 410 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/server-directory-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae3a45f62936b4d6516ac076d5fb5200437c9e3db8f2a35104272449da7a34b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bridge/file-extension-pairing-projection-store.ts: 409 lines of code: src/core/bridge/file-extension-pairing-projection-store.ts has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/file-extension-pairing-projection-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"757ddab8ba75e1512f777b7bfb52ec7cfbe526f56928a98dacc07792afe444e4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/main/cli/package-manager.ts: 408 lines of code: src/main/cli/package-manager.ts has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/cli/package-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a649bdb4f79b4769b53b567683c5d7cecff78558c10fa0ef27188d91097aa0fe"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/components/add-task/advanced-panel.tsx: 408 lines of code: src/renderer/components/add-task/advanced-panel.tsx has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/advanced-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3172a965f5b222dfe099a6257ecdcb7aad884b80e9870c4c228388bc6d7a608"}},{"ruleId":"R3","level":"warning","message":{"text":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx: 407 lines of code: src/renderer/routes/dashboard/tiles/transfer-tile.tsx has 407 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f45a4fd3301eff95ad7bfe5fa19d2d878a369ae7eaa03823bc31b62c22977c8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/engine/engine-adapter.ts: 406 lines of code: src/core/engine/engine-adapter.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f35266fa7a0e4c242895ac34d92985ad2a45589ce3b80ed1c405b050651885"}},{"ruleId":"R3","level":"warning","message":{"text":"src/server/bridge/server-process-ownership-authority.ts: 406 lines of code: src/server/bridge/server-process-ownership-authority.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-process-ownership-authority.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820f2fd5469f838690a7c4de038d5578ff0d1668c8417e27f463f19175d5e4f0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/authority-lifecycle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a15598d90524643bb6e77cef13aca042c5742544606b7320f6ef795589e312c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"840601f868db2da67fc8fb7ec758a03f2b8b259f1ba267e39bc6562c2abe997e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/command.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fffed9f09e32a40b73b91521b35faca7bc567117d5634d434f61c15a869ced7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17074534d9f1a29333a9f3ef1a78e225ae381f0fe1dbefecdb8d783f2c098aae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/test-integration.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cd7e5448c04b1c69c2a3d6c6fae4bc40847879360212cc176b26a29cbc6b0b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-user.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0489959fbc1ae8ac11148e3429b064c33120d031168ee3f4d6a6fcf77ef5149"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/table.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e78fd1d9163237be8fc02bcb5d9f69ee620972b0f734b8fa1e25f6559c4730d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/task/task-status-badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5def9a064477dfcd11b769e7d0bf365fcef213912c02c2303db1be8e2b0763"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-projects.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8fd1c27d4ae3a4e471c64ba9b31ab7b74cfb108992934502afe4569b5fa155"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed3129e1ce699941f6929c01c8f723d94b956e9388471f56e21b00870adc31b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"227b6561ae42df4add996de86f378317dae92a2d2c2cbb507d0dea902a080e87"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-permission-list.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e91f29b1ad1c455dd5b766d60fdc0b3445aec17cf5b09344e190ce153046137"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/native-select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"941ac253ec1c878461c1fc9d28bffc0c989e91d6df8ddcf154e680c7b681d013"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/about-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cf6ad9a2325faa2011ce43820a4032e9d163b2747c2e4970da3b3ba5112bc6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-secondary.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d30fe53bce81c7cd96f35090c9f6c4cda5c73616639f9412756fc7fee2bbb1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2a59d86f37b9e8b7e8fa68034fe040a9d97116deeae73b4d33c9aa6d24b478"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~833 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-task-inspector-activity.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91d5b8a694da366f09614cb2d0f88a4ed1e74c9381b4c9b2535c9927f1349a0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~370 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/authority-lifecycle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5954c72782fb19cbe3a931ae8674e94cb47d2643742ea376483d9147db378f94"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~244 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure-desktop-memory.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a03782547f90bccef1849a691f354e8c2f2b91ed4543dc77ccb371b97b575b8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~156 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/migrate-i18n.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c462a464121f5e41509999e460558daf9b4b41412228614d3d8a3c52bd3844"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~125 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/command.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e9403f3135b32f7834884b2ea00b72e8af22100f7855e1a519ec455f3d1a89"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~121 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-task-activity.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6f83360f74b788d610340d964acf2bc8577a67b995e849ccac6743f0b455b1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~113 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-user.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcb56169fd0b7782f6eccf29719efd982eefcc43a5f1d47c7297f5e11d0cddf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~113 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/table.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2412527d3caedbf78c280ed2f93846d79652ade60c4312eabf6aadefa64adfd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~95 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/task/task-status-badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5b199d185009e74138edd51f4dd90c68e60e62d544ca5784a2a889a93ad9c8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~84 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-projects.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e4b947a365f64ad0317f1603d32470ca11de10bc8e6d951ca53867993d7abd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~78 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf225f38fbe9adb2066042b9a08f21ff9d66c3c64908494257f625082466a60"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/plugin-permission-list.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3413a4830536b706842dbf38dce0605a3342d2d6b9c57ac71f9d7ea92ec229"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/native-select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f88ae2a59f2bee10093ebec2e623c1cf0e5c575f99d5c021acf0bb1963ae74e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/components/about-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf63e1ffcaf21774fde0bddb32023e2939e414c043ed9f7c5c3adf82aa8e57b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (291 application, 69 tooling, 1175 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/sidebar/nav-secondary.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c0e2cf4ecfa0df4df2849cbc33cd0cddd1502c2d62e81689bc16405cc06ed7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027LOCAL_CONTEXT_FILE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dacfbfbfb55aa5f8c44296addf588ec455eb078c218213e28a1d6206f99bd4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_CREATE_CONTENT_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/obsidian-docs-lib.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d53ac65112c3de6aa4116788ca22de32672a1323099ff941b97f03dc07aa6e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027serverPackageTargets\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"620083e2f6957a9ca42a71ec1e379090d61f350f80732275e6f9b701a177ea3a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_ENVELOPE_BLOCKS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/envelope.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9649d9f26cdcf50efe5922c8059f20596ac065732120aed117e63da0214afa81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NmTicketWire\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fbd14f0d2a8757af885cb6aba3b8b0d85536ac4c9df07d2abec59b3a5d36f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PairHelloFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e43c526bd5d091598747bba6991a201b67bb31b559927032234b0b514d1e5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PairAcceptFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"104177fb582c2f199cc8a30a585ea0e5959922d0e1775a7fee5630a454270ac1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PakeAFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01c3b2b2ef767a4f2e5f327c03ca0e69afe75efde6f794f6b9a377c7858b1f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PakeBFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"34afdd6b2db44a5d0ceab330a126c330f8a0a5e6783a7d93dad79e6aeb78b33a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConfirmAFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7be241fe85a79960d26a2d939b4d370d79d26efa79bf5e66840f22bafea137"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConfirmBFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead7e36c5dd0408c6c6067b8573609de7a49e09b5456b3ffaf2fd2713b4ea0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CredentialOfferFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f583e3ece336a2dc004e2859e916c94bdc6362cb8980e6ce347b540b13206a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CredentialAckFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c88333a84d2856d7464d8f372e7adc8c6a3103e31553aee4825e0d6ff6e8314"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CredentialCommittedFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2f78e6f8b8ff116dce459455677b1840f04707547b330d8c4f56a3c98245df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ReconnectResponseFrame\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0901c4a3e5d8db3477ead643929afd30dfbb0b3179a1baaccdb9cfa2baf39dfa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_SAFE_SQLITE_INTEGER\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/core/inspector-activity/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/core/inspector-activity/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/validators.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6f23cd71bbf83a47bb6d9ffba6fe505dba6a225085795035f40b7a1d7198cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_SAMPLE_FLAGS\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/core/inspector-activity/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/core/inspector-activity/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/validators.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b4bbaf959a416b72717525b692c9986274682f46039fb8df43d5e1a3478e92"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CookieJarError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e15e1bf1a36bdcf4fe090849797bf13d7c7fc79e79a662a9945c4a540f898c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BridgeMessageId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/bridge-protocol.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb074bd46783a5ce15fcf59e4fa0d0c06c4c832322e51d3135c6c397d8922aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BridgeHookScope\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/bridge-protocol.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c58875e87d63e009475d728bf3df9ba88a8a29aba061319521a0584b2048591"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027POST_DELIVERY_TOMBSTONE_MAX_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-retention.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81953f44128e02ba8b988b971682e35478c43ab9e04557315623ec3fcbeafb3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PostDeliveryQuotaTombstone\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-types.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"343342cea413e742800230b0dadb478fefc310506a34c292777a6735e021eb75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TRANSFER_PRUNE_INTERVAL_MS\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/core/stats/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/core/stats/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stats/transfer-stats-service.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c73c0727e7f808f41545821e1163237dc631f37c0d72ed9957f377f8df98b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_WALL_MONOTONIC_DRIFT_MS\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/core/stats/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/core/stats/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stats/transfer-stats-service.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"251c51d6f3010688cf860e6b5080d0136a49321c3a5653816ba2d913c3cc1469"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MenuContextPatch\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/commands/context-schema.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b215b20345fb0b06e9a1ba734e5122b3f8c5227066da35b4cdaab0202c95ebb8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ProtocolRegistrationResult\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/protocol-manager.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec55b54d7b4449afe0775892b9361882367062af79eba7b02073d984cee5d4b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ToolbarSeparator\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/toolbar/toolbar.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8decc472f33438b4fe319c1ca824d5ce975efa211e8771b7521451d56a2910"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CopyLinkIcon\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/renderer/components/icons/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/renderer/components/icons/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/icons/copy-link.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aa86f1c03a523f5f25afca21b06d9b5c2c0b66d71e8968802a75e23fa47216"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FolderAddIcon\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/renderer/components/icons/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/renderer/components/icons/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/icons/folder-add.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff710c352900bc442e15da53da5dc091b50ce18ebc0ab0c5bf94380d888b0c27"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027UploadIcon\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/renderer/components/icons/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/renderer/components/icons/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/icons/upload.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e9b9c91eeaf2dd758407f6b62922ac7ba676c2d4cad2c92a7820a5a81244c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DrawerTrigger\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/drawer.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a34038051f497a905e32d2431f4c6c721b048d71c9ca46ff68a3545092d0b31"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DrawerClose\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/drawer.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e1c49c80824ecc00da3dae864a660bcf5b952b023563a228d5828bf5ff68cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DrawerContent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/drawer.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e5c8195ea2decaf6a19ffd401806ee2a88bd8db2414daeba531f0a13e40801"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DrawerFooter\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/drawer.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d61fb54b301f901c97cb50d95e6971bea77d7a7abcc25b43dcf20edcf2fae5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DrawerDescription\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/drawer.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"91047662d3d2134ec2506b318556cfade5d0f48b66d4572ace74f4a9c5637f9c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ImportResultMark\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-motion.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8c514ff2c143d965968421f0797a159e4925a7f60d804f6b311b650b743160"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027importTaskTypes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/import-task-selection.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916eda2a92282bfcbc072400494fd5832ba7ababa19d1f5fe899186f3d7c632"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useTypedSearchParams\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-typed-search-params.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0496fed897c1f13ac8d513480fd8c2102d89b4d43906f825518716ee008ea9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getOperatorStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7aaf29a34f54dfe8a451d06ca0ddb7a97f3a349c1034b80e42ac7e4400f757"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ACTIVITY_CALENDAR_DAYS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/activity/activity-calendar-model.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e765b16624d10569e4afaf96a686ed36f1f9981b3ae724a0c0a6c131d56835"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027usePairRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-bridge.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4661196d69ab3235694e4254882a08f2a47fa7d5207227711b4a4aa4b916f70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027respondToPairRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-bridge.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a27a17e98b69e533cdfa9c2c6eb7d95420b366e5af9b0156878a9bd884ef60e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027REMOTE_EXTENSION_PUBLIC_URL_MAX_LENGTH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-config.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7901962ce624e34bd1a873df18e3fccb8cf57ee9aa26097ef937f25550e64c8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027unwrapProtocolEnvelope\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/protocol/errors.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5729295b22922e6a985d9ad9a4c438d8b63da363e9639618bacb8a58e3c30e18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CommandInvoker\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/protocol/handler-types.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"564bd3314b15a4f27527bf24177fbb02eac62d5aed69a966a2d3fd25a8ff38ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027QueryInvoker\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/protocol/handler-types.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3614da0d6afc076fb03f945f986a650ed05a8a5237fc1b286aa5a3117497bf54"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RemoveTasksPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/bulk-task-command.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c682c3da0e1a820d44529f6d94acd2f959181da777a49f31582752a6f39bf2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CheckTaskFileExistsPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/check-task-file.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7e79553249fa8c95befb2bcf00ab6bd154b1af74a3e162ebb7dff3767dc1bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CheckTaskFileExistsResult\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/check-task-file.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7ec9ced841873e87d2bb232d82081dc6fb0437bb7f93817e92af560577c561"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SourceDiagnostic\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/download-source.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"04203780f66aa59b1b95a8ccf707264c187d7e9cc3e5c88d424d94a539ca9579"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DownloadsSettings\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/downloads-settings.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da158c1d6eee741b74b6955ee23fa8ce9fe2fbe6c4b11ae3c9cfa7302e236c3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginCallChainV1\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/shared/schemas/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/shared/schemas/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ce893f9d03304c99d91887d3f107cbc3ca93bd9cdf1c1db28f5d67ea2df7d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HookContextPatch\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/shared/schemas/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/shared/schemas/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-hooks.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca180a0483cb1e78d7d14ca681925988f9281c34cbae8c5cc1188ce88f82a4da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginSecurityEnvelope\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/plugin-security.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0a4d2ddd0b55d1a8981a8e2da45768e03fa1b397467deb57913306fe1c38ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RemoveTaskPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/remove-task.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb53e81dd2a7d4331fa9e84028c359287b6084758a42eeaaaffbcfbf1458ebb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RendererRecoveryStrings\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/renderer-health.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce2675af23d264b1f49f40ec64973df53ecdd4bfa232159709d8b30f8e3de4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ListServerDirectoriesRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/server-directory.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d42763b361b36903c703fd12e0bfec8801a5067791b2513aa5da21a928dfba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ValidateServerDirectoryRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/server-directory.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"57011720437518e37d00935bb24ef0c8e55c91dae94e51837daa27ff19d315db"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CreateServerDirectoryRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/server-directory.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9275bf984fc7feed89e2c0dc7dc0d0d883e1e2ae5b52197cd0fd9b5a56b871"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ShowAddTaskWindowPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/show-add-task-window.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64220e0f3acea975479543056dc58de035224498b8908a82cf19b186b8fd12a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SetSelectedFilesPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/task-file-selection.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd443ebf8b0a8625080639389ec074d6b3e29a5cc829822003273bb72921ee1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TrackerSyncRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/tracker-state.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0244d329bba8eb99bc43ecbe2e4206e2391b49a10a6d5f63a0c45237d1457e60"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginHookError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin-hooks.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28435bbcb85ac4fb7617f8a1997d0d1e52c157aa5d007d7a1a32a32e0eff3fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginHookDelivery\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin-hooks.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"082415755db5d4f69f14dffa1efa9af1a7ef1e6c433f84760477aacda96095bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginHookInvocationScope\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin-hooks.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32f94d831247f60671463c4df55a9af34e68d566423b08b295b606d7f365153"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginHookEffects\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin-hooks.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"778c7ecf4ec22f747b8707d845e7047e2612882e11f26204a329a9ec8fc786a8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginHookMetadataOperation\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin-hooks.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac37dcd045c13567d552bb6b6a0f9f8121ebe0eeea57c92d456e96aa81d08e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginHookMetadataSnapshot\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin-hooks.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e010e2dc02fabc5b965fb7d2c4ca77e490f9733dbb9acd7fab8d6c2d2e8e79c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PluginRuntime\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b179ea7ebeb20258bc5a68e7e7c2eb00c56a4a21d302f556436664855fe31bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CapabilityAvailability\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/types/plugin.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"16075d7277e884cf38af91290f3a716a14ae27f617d43e3a53c494b993180ebb"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@electron/asar\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-electron-package.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68cdfa3b4d599bc6d7afa1b90097e33cf58889bf8f985adfafd60f0a0ff71c"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027app-builder-lib\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/finalize-appimage-artifact.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"96265123523bbbbaca07c8aaa992588538a79a7149537fa3f13c3882db8d16d4"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027builder-util\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scripts/windows-artifact-names.test.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"19deef0191d5021d702c00a3bbfbab515d419fb39e0332e2ac84b8d691e26f38"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027plist\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scripts/release-signing-input.test.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b446e0950531020d940f9ce8121d0a7f2782e4fe0be67df9f52c9bd622f443bc"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027yargs\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scripts/ci-validation.test.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af50663a58d9be1c52638dcde976c9da51afb349fcd6c944dbf98d775a2f48d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@electron/notarize\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"71a207af01182d14e0761f292564435b506a1de2e86738b344fc6ea4e68abe70"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tslib\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d8a3d0faa47fd18b071ac2ea263bb7395790d201b593acc4743b98814298e27d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027vaul\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5e3f9033e391773f6df2cdfe6988145134e505d714d5800dd0427b00a0aeb1f"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/core/plugin/finalize/finalize-committer.ts \u2192 src/core/plugin/finalize/finalize-recovery.ts \u2192 src/core/plugin/finalize/finalize-committer.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/finalize/finalize-committer.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d706a9fcc9cd7ba5309e6b1791f84897cf11e52b97298ac44c50bd119f4de1"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-session-identity-recovery.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ed9d702fe68fc562ba30ca02b219db47fb0c496d7aa29bfb27d4dab8bf80b4"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6cd46598e9342b0fe106d608acf8ddd36f9bebe0ae16304397bf0ce3f1e8fe"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-file-verifier.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7aeb314a23ea17dab546000eacdc0cb1479d097a9fd6a75a1f44623e2f5338"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/create-torrent.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c68f5dbb4b20f449699acfb10126bc2edc418d1d2e334f1461039b9d9e824"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/create-torrent.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"46261729297e05771e47b9d983636ed19fa00ed86e6bfa53b792f78837ffb76c"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/create-torrent.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa9412043675164013793a0b49f6b900437fac5e0584e0bcbd6d079b4914288"}},{"ruleId":"S1","level":"error","message":{"text":"Password hashing without a KDF: createHmac(...).update(password) stores a password as a fast digest \u2014 cheap to guess whether or not it is salted \u2014 with no key-derivation function (PBKDF2/scrypt/Argon2/bcrypt)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/cmd/account-authority.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8a2534178351453d1de3c4a5a7ac6565d33f869361cb502f83531cc2bd71fc"}},{"ruleId":"S1","level":"error","message":{"text":"Password hashing without a KDF: \u0060o.password !== n.password\u0060 checks a password against the stored one in plaintext, so the store holds the password itself and whoever reads it holds every account."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/applier.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a3c949d50434e82021009bf3e5512d6002eecf74276eaf231fe9ee7b4bb2ec"}},{"ruleId":"S1","level":"error","message":{"text":"Password hashing without a KDF: \u0060password === this.localProxyPassword\u0060 checks a password against the stored one in plaintext, so the store holds the password itself and whoever reads it holds every account."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/proxy-bridge-manager.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6470a69847af0b98bb923e18d68df6fb7c009c5f76433c65763c6aa4443343f0"}},{"ruleId":"S1","level":"warning","message":{"text":"Password key derivation is priced too cheaply: This code fixes scrypt at N=16,384 (r=8, p=1). A key-derivation function\u0027s only defence is the cost of ONE guess, and that cost is this number \u2014 the algorithm choice does not set it. Current OWASP guidance is 1,300,000 PBKDF2 iterations with HMAC-SHA1, 600,000 with SHA-256 and 210,000 with SHA-512; scrypt at N=2^17, r=8, p=1 (or an equivalent N\u00B7r\u00B7p product); Argon2id at 19 MiB of memory and 2 iterations (or an equivalent row); bcrypt at a work factor of at least 10. This figure divides the attacker\u0027s work by a factor of tens or hundreds against the same stolen hash, on hardware they already own. Where what is derived is short or low-entropy \u2014 a PIN, a numeric parental code, a four-character token \u2014 the whole keyspace falls in the time this parameter buys, and no salt or constant-time comparison changes that. Raise the count to the current published figure for the PRF you use, measure it on the slowest hardware that must run it (a target of roughly 100 ms per derivation is the usual budget), and read the value from configuration so a deployment can raise it again without a rebuild. Where the derived value must interoperate with a format someone else fixed, the count cannot move \u2014 derive a SEPARATE value for anything you own rather than inheriting the external format\u0027s price."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/scrypt-w.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ea7f9dc68a60dc54faef0f14fab392fea2e21e6e04f9d5b5f3d5d2e4e03cb2"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060http.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f95f97b0896184b42c40092ef0bf6897968e8d7618781f1b9b9c32f0e79a97"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060server.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/client-gateway.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe0b7ed20e1ba247a2379f75f8069c7388222479ad17959dbec50c6aa48c464"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(rawHeaders) || rawHeaders.length \u003E MAX_RAW_HEADER_ENTRIES || rawHeaders.length % 2 !== 0\u0060 appears character-identically in 2 files \u2014 src/server/bridge/remote-extension-admission-policy.ts, src/server/bridge/remote-extension-host-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbd2111f8281fc765b20e2f9483dc2ed3d3dc6c2158b6cac2de5bae55049d4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(value.files) || value.files.length === 0\u0060 appears character-identically in 2 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-update-artifacts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7620903ae835957ab507c025b93353de79f643e6b1fbe21541cc9a11a26ef57d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(values) || values.length === 0\u0060 appears character-identically in 2 files \u2014 scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"358b7a0bdd4f5fd7519e2fbf29f9cd2609a954894944588dfbb7d3d52713c62d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(attempts) || attempts \u003C 1 || attempts \u003E 100\u0060 appears character-identically in 2 files \u2014 scripts/release-snap-build-set.mjs, scripts/verify-snap-store-channel.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7488bb0b2e107ef758454329241d9a8f1183c69c9bb92f35403429e478b2f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(delayMs) || delayMs \u003C 0 || delayMs \u003E 300_000\u0060 appears character-identically in 2 files \u2014 scripts/release-snap-build-set.mjs, scripts/verify-snap-store-channel.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"825a47e3885ac57188210f045e495b917c485686898160dffaa6eb49d64756b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(value) || value \u003C 0\u0060 appears character-identically in 6 files \u2014 packages/native-host/package-flatpak-companion.mjs, scripts/electron-package-utils.mjs, scripts/server-package-utils.mjs, src/core/bridge/credential-store.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/package-flatpak-companion.mjs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4297772c5f3779359f5c7eb066d22d097ade577c99e177a1a00e3421f880337b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(value) || value \u003C= 0\u0060 appears character-identically in 4 files \u2014 src/core/inspector-activity/validators.ts, src/core/lib/sqlite-integers.ts, src/server/bridge/remote-extension-admission-policy.ts, src/server/plugin/upload-store.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/validators.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"845bd0e0ff3be703ebdc0df1eee06eaa5a54752e9e591d8f3210290f91beacf9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060![\u0027darwin\u0027, \u0027linux\u0027, \u0027win32\u0027].includes(process.platform) || ![\u0027x64\u0027, \u0027arm64\u0027].includes(process.arch)\u0060 appears character-identically in 2 files \u2014 src/main/plugin/verified-ffmpeg-electron.ts, src/server/plugin/verified-ffmpeg-server.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/verified-ffmpeg-electron.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b05fefbf3987cc65176253388e720b27a1a0504ef1c6ca6938c61b78206556"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060![\u0027http:\u0027, \u0027https:\u0027].includes(url.protocol) || url.username || url.password\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/http-request-context.ts, src/core/plugin/network/plugin-http-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-request-context.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47a1aaf4eda7b388976c1ff3df11928178a3a6bef22eb3624428431834d82a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!active || requestGeneration !== generation\u0060 appears character-identically in 2 files \u2014 src/renderer/components/byte-unit-sync.tsx, src/renderer/components/reduced-motion-sync.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/byte-unit-sync.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3ecf2f4efc9fa052fdf49fe9e6a8f725d4c81c4132951c91dd3aed967bb06f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!allowed.has(option) || value === undefined || value.startsWith(\u0027--\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/release-snap-build-set.mjs, scripts/verify-snap-store-channel.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-snap-build-set.mjs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c7efcf163034e0d9382695b381f7c52d302f97cb5cc2e4e54045e3622da216"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!denied \u0026\u0026 (positive.length === 0 || positive.includes(actual))\u0060 appears character-identically in 2 files \u2014 scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33a24d55b1cead408c8699d51db8bfc9dd6bee05a9d5ed7637cdef25d6af8f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isIssuedRemoteExtensionConfig(config) || config.status !== \u0027enabled\u0027\u0060 appears character-identically in 5 files \u2014 src/server/bridge/remote-extension-host-policy.ts, src/server/bridge/remote-extension-route-policy.ts, src/server/bridge/remote-extension-startup-log.ts, src/server/bridge/remote-extension-surface-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-host-policy.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c04525e4cb68dd30d59dafb85b85137bf7fa27f9c3d844740463372be0143e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!legacyFile || legacyFile.sha512 !== value.sha512\u0060 appears character-identically in 2 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-update-artifacts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd8c7bc9c257607bd66c51e414dbb79bf13708f013903cdcb7f7fdc1775ec93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!load.ready || form.formState.isSubmitting\u0060 appears character-identically in 5 files \u2014 src/renderer/routes/settings/cards/advanced-dialog.tsx, src/renderer/routes/settings/cards/appearance-dialog.tsx, src/renderer/routes/settings/cards/bit-torrent-dialog.tsx, src/renderer/routes/settings/cards/integration/integration-dialog.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/advanced-dialog.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491d8e52dd9065ecd9d29bf1481ecaffd62a3f9c18584b100735f0e594919a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted.current || current !== generation.current\u0060 appears character-identically in 2 files \u2014 src/renderer/features/directory-preferences/directory-preferences-section.tsx, src/renderer/features/directory-preferences/use-directory-preferences-draft.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e55cff5c9079389e72f88dc50d56a3f9c96ed2bb051136b4999bf5418f711a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mountedRef.current || requestVersionRef.current !== requestVersion\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/plugins/hooks/use-plugin-graph.ts, src/renderer/routes/plugins/hooks/use-plugin-metadata.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-graph.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c95c0110cfcf2c6d47977ed5fa5299b3bb17179fb4fc19db8aaaaca3c171728"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!outputPath || typeof outputPath !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 src/main/ipc/queries.ts, src/server/ipc/queries.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/queries.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab8809ef73d95a7cf458c9981302db574ac19e82a9ba01b1ef5f1fb44a6ff36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!path.isAbsolute(candidate) || candidate.includes(\u0027\\0\u0027)\u0060 appears character-identically in 3 files \u2014 src/server/platform/nas/file-remover.ts, src/server/platform/nas/files.ts, src/server/routes/torrent-creator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-remover.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e11eeb7c79c243ef11c07dcece7b6815bc30d9eb8ec97af20996c4d52474e43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!path.isAbsolute(filename) || path.resolve(filename) !== filename || (await realpath(filename)) !== filename\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f0f1bccdcf0f6ebd5417d4148ba78a72486cf2e7f543bf738664fa67ef6605"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!path.isAbsolute(value) || value.includes(\u0027\\0\u0027)\u0060 appears character-identically in 2 files \u2014 src/core/settings/directory-preferences.ts, src/server/server-directory-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/directory-preferences.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb42c95af85eb6837d0013a56312cb070577c0fce20569f61c9a8aa6708d553"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!proxyCredentials || proxyEndpoint === null\u0060 appears character-identically in 2 files \u2014 src/core/engine/aria2/aria2-config-builder.ts, src/core/engine/engine-supervisor.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-config-builder.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc080d99ded9885e693a04bb5beaf3d8d5b13aa00aa2b328e2ffc757f66f90d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!relative || relative.startsWith(\u0027..\u0027) || path.isAbsolute(relative)\u0060 appears character-identically in 4 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts, src/core/legacy-import/source-scanner.ts, src/main/legacy-import/desktop-import.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15f81fe7628863f9dfde80baf50bee0b31d80fb2ebae3cbc72b213bd705bc62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!started || exe !== (await realpath(executable)) || !matchesEntrypoint(command, entry)\u0060 appears character-identically in 2 files \u2014 packaging/fnos/app/lifecycle.mjs, packaging/synology/app/lifecycle.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b1561606ae60769efcd3074497f37c863a60bc0463c8ba17001f037647fdf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!target || (target !== canonicalRepoRoot \u0026\u0026 !isInside(canonicalRepoRoot, target))\u0060 appears character-identically in 2 files \u2014 scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"541bcf9adac8533ae1e62be31ba5c216d7a1ea8c967282db07a9e5336cecc158"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!task || task.status === TaskStatus.Removed\u0060 appears character-identically in 2 files \u2014 src/core/bridge/handlers/read-handlers.ts, src/core/session/session-manager.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/handlers/read-handlers.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e4aa3c4164ead8b859286487383f3a09e22c5ea329f713fcde4d8568235f6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.deps.taskManager.isEngineTaskIdRetired(intent.engineTaskId) \u0026\u0026 !this.deps.taskManager.getByEngineTaskId(intent.engineTaskId)\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f03b719f621e003baafbf2c41b5c54f4fa31afc3cbf073937d04d5ca935298"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 3 files \u2014 src/core/legacy-import/source-scanner.ts, src/core/plugin/runtime/plugin-hook-runtime.ts, src/core/session/finalize-journal-repository.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/source-scanner.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c3f428975ca64d1b07826d84eccc3ee658f4862fee27adca9ddd3983902e53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(await alive(record)) \u0026\u0026 (await healthy(socketPath))\u0060 appears character-identically in 2 files \u2014 packaging/fnos/app/lifecycle.mjs, packaging/synology/app/lifecycle.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"03879edc7752414f9dea40bdb1999f597fc620560ef5d78b2f394a069338f48d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Date.now() \u003C deadline \u0026\u0026 (await alive(started))\u0060 appears character-identically in 2 files \u2014 packaging/fnos/app/lifecycle.mjs, packaging/synology/app/lifecycle.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8288e38dc2f680c53dfb584dd57a2d1d8851af2adefde3777f55c4085214719"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060JSON.stringify(oldFull.tracker.sources) !== JSON.stringify(newFull.tracker.sources) || JSON.stringify(oldFull.tracker.blacklistSources) !== \u2026\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c59a90f893e7e7c30db2c9ecdd2539a2bb87ff2b2ba153f4672895ab91d6a43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(pid) \u0026\u0026 pid \u003E 0 \u0026\u0026 (await this.deps.isProcessRunning(pid))\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b2129eaea62b7d37ef7334e2e7fa797a336d142035983583e371e0b2c33580"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060__MOTRIX_TARGET__ === \u0027electron\u0027 \u0026\u0026 (transport.platform === \u0027win32\u0027 || transport.platform === \u0027linux\u0027 || (transport.platform === \u0027darwin\u0027 \u0026\u0026\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/components/ui/toast.tsx, src/renderer/hooks/use-application-menu.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/toast.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac705d4ac193b55f59fb566dabc8c6e1b2186ebe6f611b90237405546c1a2897"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060__MOTRIX_TARGET__ === \u0027electron\u0027 \u0026\u0026 transport.platform === \u0027linux\u0027\u0060 appears character-identically in 2 files \u2014 src/renderer/components/onboarding/onboarding-language-select.tsx, src/renderer/components/window-chrome/window-controls-overlay-provider.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/onboarding/onboarding-language-select.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f961dc9207ababf82fa738ebeb3d7e22a1f1e758c4362b0ef047a4be0e909218"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.length === b.length \u0026\u0026 timingSafeEqual(a, b)\u0060 appears character-identically in 3 files \u2014 src/core/bridge/mbp1/pair-session.ts, src/core/bridge/mbp1/reconnect-session.ts, src/core/bridge/mbp1/ticket-verify.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1844e93c8bce48dbab1db13afe5477605afc3c50edeea41f58cb1790ce053c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.has(\u0027--strict\u0027) || Boolean(process.env.CI)\u0060 appears character-identically in 2 files \u2014 scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"906ab7e23b10d6b0e9437b5592d5bba911ae7ebe00820de6a4783fd656e599f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args[index] === \u0027--no-opt\u0027 || args[index].startsWith(\u0027--require=\u0027)\u0060 appears character-identically in 2 files \u2014 packaging/fnos/app/lifecycle.mjs, packaging/synology/app/lifecycle.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc637d6aba639197f64e119250b1c80c456b661ab9d020b5ec6713dbdb56a75f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args[index] === \u0027-r\u0027 || args[index] === \u0027--require\u0027\u0060 appears character-identically in 2 files \u2014 packaging/fnos/app/lifecycle.mjs, packaging/synology/app/lifecycle.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7de2f6621e51023e2bec1935d6f6780b56ceee1ed330d369706729c1e0c884d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args[index] === entry \u0026\u0026 index === args.length - 1\u0060 appears character-identically in 2 files \u2014 packaging/fnos/app/lifecycle.mjs, packaging/synology/app/lifecycle.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3d88735e325f2c978a34e9f7a55db85e28595f43c3a34b8b2f4c27cf2ab75b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060binding.kind === \u0027output-file\u0027 \u0026\u0026 binding.extensionFrom\u0060 appears character-identically in 2 files \u2014 src/core/plugin/operations/operation-files.ts, src/renderer/features/plugin-operations/operation-form.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-files.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74e2a678656c7d2e4127d3e226c56de508e8876ba0e37d414efdb852c55bf9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytesRead !== header.length || !header.subarray(0, 4).equals(Buffer.from([0x7f, 0x45, 0x4c, 0x46])) || header[4] !== 2\u0060 appears character-identically in 2 files \u2014 scripts/prepare-snap-project.mjs, scripts/verify-snap-artifact.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-snap-project.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d199651aced90f84278ca2cbbd32af122af6fc780c470e56038bd0a3cf758b01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cancelled || generation !== refreshGeneration\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/plugins/hooks/use-plugin-detail.ts, src/renderer/routes/plugins/hooks/use-plugins.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-detail.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be448ea4d170b27ba0d1be9f5f0d7fba4e7a6ddbe8caa15a6798bcda3cb2a81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060channel !== \u0027stable\u0027 \u0026\u0026 channel !== \u0027beta\u0027\u0060 appears character-identically in 2 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-update-artifacts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"913eeb1d4cd5741e95872f79e6762ebff6ed9ea6005017ced29ea5c0567f83e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char.charCodeAt(0) \u003C 32 || char.charCodeAt(0) === 127\u0060 appears character-identically in 4 files \u2014 src/core/engine/aria2/aria2-legacy-path.ts, src/core/legacy-import/http-request-context.ts, src/core/task/bt-storage-layout.ts, src/shared/lib/app-deep-link.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-legacy-path.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"230ef6b1a0ac7a2938fecd2b12cb2703389562d069bade80cd01537d2405e75d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char.charCodeAt(0) \u003E 31 \u0026\u0026 char.charCodeAt(0) !== 127\u0060 appears character-identically in 2 files \u2014 src/core/engine/aria2/aria2-adapter.ts, src/shared/schemas/legacy-checkpoint.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc38db02beaf25815e8b84226115728fbd6ad61d0d2f365794235d9b6d9b748b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character === \u0027\u0022\u0027 || character === \u0022\u0027\u0022 || character === \u0027\u0060\u0027\u0060 appears character-identically in 2 files \u2014 scripts/server-package-utils.mjs, scripts/stage-electron-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/server-package-utils.mjs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1bf8dc2343be4789fe4bf2bd971b4ba2beaca5b44492038f3ae4da6c4ce142"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.exitCode !== null || child.signalCode !== null\u0060 appears character-identically in 2 files \u2014 scripts/smoke-electron-package.mjs, src/core/plugin/finalize/filesystem-adapter.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-electron-package.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43c995f71404a862541af3814683de5885d966017318ff7e1266a81eddab85e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compareStrings(left.source, right.source) || compareStrings(left.target, right.target)\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/plugins/lib/call-graph-layout.ts, src/renderer/routes/plugins/lib/call-graph-model.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/lib/call-graph-layout.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d201d6597da8171f74fc21cce37b060ec014d28fcfb09559395ae96f70420454"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060contentLength \u0026\u0026 /^\\d\u002B$/.test(contentLength)\u0060 appears character-identically in 2 files \u2014 src/core/plugin/registry/registry-client.ts, src/core/plugin/registry/registry-fetcher.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06b62fee8f8cf86186a39be39c0e9c9f24e86ecacf8bb2aa3708f05700f0fff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.btStorageRuntime \u0026\u0026 ctx.persistBtStorage\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"766cbc0f34a7e38c023cfb5b1d10767266dafbe8f5326dc125d2d1eb2ee15cb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current?.started === record.started \u0026\u0026 current?.boot === record.boot \u0026\u0026 current !== undefined\u0060 appears character-identically in 2 files \u2014 packaging/fnos/app/lifecycle.mjs, packaging/synology/app/lifecycle.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f44d545c0c31e3073679ac8f5d83daccd9e6d09d8fde102dea07199b08e1dfb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060d.reason !== \u0027expired\u0027 \u0026\u0026 d.reason !== \u0027duplicate\u0027\u0060 appears character-identically in 2 files \u2014 src/core/engine/aria2/aria2-adapter.ts, src/core/engine/aria2/task-cookies.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05c65872022991d8c10443cc27c21bb82fbba09dfd3b4f7c8c8913722dcac1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.reason \u0026\u0026 entry.reason !== \u0027request-settings-required\u0027\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/http-request-context.ts, src/core/legacy-import/source-scanner.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-request-context.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cd4a16629cbbe82e37421c819bfa57e606c45b53fa029c77fdafdbe232cb19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof AppError \u0026\u0026 error.cause\u0060 appears character-identically in 2 files \u2014 src/core/settings/downloads-settings.ts, src/core/settings/general-settings.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/settings/downloads-settings.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1881b6f22fe03031cd1f414c9d138350d90f9f442e5c5f96123331deef95d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof AppError \u0026\u0026 error.code === ErrorCode.FfmpegInstallBusy\u0060 appears character-identically in 2 files \u2014 src/main/plugin/verified-ffmpeg-electron.ts, src/server/plugin/verified-ffmpeg-server.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/plugin/verified-ffmpeg-electron.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76a54c4148cd20155946434e976b501efde444e03ff5e239f1b4c2181f711d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof BridgeReceiverError \u0026\u0026 error.code === \u0027unsupported-kind\u0027\u0060 appears character-identically in 2 files \u2014 src/core/bridge/web-socket-bridge-server.ts, src/main/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bc7f4b67204960b55bf57b6b1acd3d6abca20285fdb5aa0372a96aa9ee716a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key === \u0027Enter\u0027 \u0026\u0026 (event.ctrlKey || event.metaKey)\u0060 appears character-identically in 3 files \u2014 src/renderer/components/desktop-kit/directory-history-menu.tsx, src/renderer/features/directory-preferences/directory-preferences-dialog.tsx, src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/directory-history-menu.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f58ca93c297aa2c9634396f91a555ea1e1ef7b07e09d38b4dea58d59a8b3942"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.nativeEvent.isComposing || event.keyCode === 229\u0060 appears character-identically in 2 files \u2014 src/renderer/features/directory-preferences/directory-preferences-dialog.tsx, src/renderer/features/web-directory-picker/web-directory-picker-dialog.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-dialog.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88874588c664a4ab27f6b36a7ad2aa9bd9d06310b0d0a1afc71810d6b8a16cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing?.status === TaskStatus.Completed || existing?.status === TaskStatus.Error\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d691930992e787b97092bb6573540500f45e52a564ddb82d7a9d84c54db25817"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fsType !== null \u0026\u0026 NETWORK_FS.has(fsType)\u0060 appears character-identically in 2 files \u2014 src/core/probe/disk-probe-darwin.ts, src/core/probe/disk-probe-linux.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/probe/disk-probe-darwin.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9022b60d87543291a544e1332d7b4c3c33e0923e72027dec243ea335c2f2a7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hostname.startsWith(\u0027[\u0027) \u0026\u0026 hostname.endsWith(\u0027]\u0027)\u0060 appears character-identically in 2 files \u2014 src/core/proxy/aria2-proxy-routing.ts, src/core/task/direct-resource-validator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"000566d55bdfbf727278c20fcfa1cfe9009a5ca932d66fc92749bb3015111030"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.outcome === \u0027failed\u0027 || item.outcome === \u0027unprocessed\u0027\u0060 appears character-identically in 3 files \u2014 src/core/legacy-import/import-service.ts, src/renderer/features/legacy-import/import-run-content.tsx, src/renderer/features/legacy-import/legacy-import-dialog.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"400a7e335924e4b209f0bb020ff4abd2ccf6d9fe540043859e18f5908dcd44c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.invocationId === right.invocationId \u0026\u0026 left.callChainId === right.callChainId \u0026\u0026 left.permissionGeneration === right.permissionGenerati\u2026\u0060 appears character-identically in 2 files \u2014 src/core/plugin/host/capability-bridge.ts, src/core/plugin/host/quick-js-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2e7f55d6ffa1fb19aa4dd2fe569b633007a8e9e37e1da22955d4f1b5569802"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.startsWith(\u0027[\u0027) \u0026\u0026 line.endsWith(\u0027]\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/verify-appimage-artifact.mjs, src/main/platform/appimage-integration.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-appimage-artifact.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4841ac2b824b5f57e1d0b3917168698789647c8c770428707f2702e6b2379ff3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest.name !== name || typeof manifest.version !== \u0027string\u0027\u0060 appears character-identically in 3 files \u2014 scripts/audit-server-runtime.mjs, scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d23224e27e18b660e723d3f950bbe56c7defc7c8564f0807c263638ec5300b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker.success \u0026\u0026 marker.data.activation === \u0027inactive\u0027 \u0026\u0026 marker.data.storagePolicy === \u0027legacy-read-only\u0027\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/legacy-task-policy.ts, src/core/task/bt-duplicate-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/legacy-task-policy.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cbfc262d0649afb92d72fa3830b2d53068a892493129e2962471a65a118e3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches(manifest.os, target.platform) \u0026\u0026 matches(manifest.cpu, target.arch)\u0060 appears character-identically in 2 files \u2014 scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c6a270fe8aa2e3ea635594218bbc310a43a7f3de20ec8814573ce59258753e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.channel !== \u0027stable\u0027 \u0026\u0026 metadata.channel !== \u0027beta\u0027\u0060 appears character-identically in 2 files \u2014 scripts/appimage-artifact.mjs, scripts/release-metadata.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/appimage-artifact.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"be56747e0830d98355b3d51cd4847da66cdd8ad5dda7037637a616ab60dae433"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mounted.current \u0026\u0026 current === generation.current\u0060 appears character-identically in 2 files \u2014 src/renderer/features/directory-preferences/directory-preferences-section.tsx, src/renderer/features/directory-preferences/use-directory-preferences-draft.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/directory-preferences/directory-preferences-section.tsx"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e3587c08f9e078e87f5c32f5edf8e7a2fe1d788a20d4011f09e2a7a573f709"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized === \u0027false\u0027 || normalized === \u00270\u0027\u0060 appears character-identically in 2 files \u2014 src/server/environment.ts, src/server/plugin/community-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/environment.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"362e15cec12be28317f59519cfefa6c48371ee2cd5aaa9ff3ef4b9d1d825a861"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized === \u0027true\u0027 || normalized === \u00271\u0027\u0060 appears character-identically in 2 files \u2014 src/server/environment.ts, src/server/plugin/community-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/environment.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a601e7f5da6889ae6f39063319f84042ceb1cd81917a454d206278903322341"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.app.notifyInAppOnComplete !== updated.app.notifyInAppOnComplete || old.app.notifyInAppOnError !== updated.app.notifyInAppOnError || old.\u2026\u0060 appears character-identically in 2 files \u2014 src/main/index.ts, src/server/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44222e06e851423f3425a66c700a15436f85aca8f55cb4fb13a1953a39dee03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060oldFull.tracker.autoSync !== newFull.tracker.autoSync || oldFull.tracker.syncIntervalHours !== newFull.tracker.syncIntervalHours\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c1c5a433839eb625b7790d1c81bfa015b17cec468b7ebb12e90ddbb89e220a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.skipNodeModules \u0026\u0026 entry.name === \u0027node_modules\u0027\u0060 appears character-identically in 3 files \u2014 scripts/audit-server-runtime.mjs, scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-server-runtime.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0790b97365d115eac02bce160ebef8e9d048c6192624414f3fb948709765642"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.strict === true || options.ci === true\u0060 appears character-identically in 2 files \u2014 scripts/electron-package-utils.mjs, scripts/server-package-utils.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c461662d6739f9fa58ae7955893c32fe079059b4763248b66a6fdf51cba442"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outcome === \u0027persist-failed\u0027 || outcome === \u0027stale\u0027\u0060 appears character-identically in 2 files \u2014 src/main/index.ts, src/server/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd405027e45211d72b18ef510e2d9288d112278c86a1224d1f1bec51fc385bcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060params.saveDir || settingsManager.getApp().defaultSaveDir\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"e472c781c6df3fc1dbe0c31f966318933f0fd8b5ede75274311ce6e819954c44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol !== \u0027http:\u0027 \u0026\u0026 parsed.protocol !== \u0027https:\u0027\u0060 appears character-identically in 2 files \u2014 src/core/plugin/capabilities/http.ts, src/server/bridge/public-url-diagnostic.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d0385a38216a548a99856af3ab136518ca3d1428cbe1b21268fd6d955a5e4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsedBtLayout \u0026\u0026 shouldPrioritizeBtPreviewPieces(parsedBtLayout)\u0060 appears character-identically in 2 files \u2014 src/core/task/create-task-handler.ts, src/core/torrent/swap-magnet-metadata-for-bt.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"023dec22d95cab0b740398233babd88caa67febcfe17e802704cf73f917cc9b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.posix.isAbsolute(normalized) || normalized === \u0027..\u0027 || normalized.startsWith(\u0027../\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/electron-package-utils.mjs, scripts/server-package-utils.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b862a67212dd9c86ad468639451793c33b991d904b3f3677b4ec2e0ce59c44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060plan.kind !== \u0027checkpoint\u0027 || metadataProfile === null\u0060 appears character-identically in 2 files \u2014 src/core/session/session-manager.ts, src/core/task/actions/re-add-task.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b92a28c2ec516ae102e33697ecf5617ebf18d12707e20578ae155b42cb2bed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060plan.kind === \u0027checkpoint\u0027 \u0026\u0026 metadataProfile === null\u0060 appears character-identically in 2 files \u2014 src/core/session/session-manager.ts, src/core/task/actions/re-add-task.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/session-manager.ts"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d187aec4b8a641e7641afdceb99749549ef7cc979c35e81bccb4e88ecdb0d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060platform !== \u0027darwin\u0027 \u0026\u0026 platform !== \u0027win32\u0027\u0060 appears character-identically in 2 files \u2014 src/main/platform/download-progress.ts, src/server/platform/services.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/download-progress.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"405c88d63a4eddf5ab9d5ac4bff0b18680ea61a88c727adfcb65b6e3711e2fef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060platform === \u0027win32\u0027 || platform === \u0027linux\u0027\u0060 appears character-identically in 2 files \u2014 src/main/platform/system-accent-color.ts, src/main/window/window-manager.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/system-accent-color.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a14cf9593ce777e355297e5c285e65a8c312eaffde407948b58a23a1c53fbb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.argv[1] \u0026\u0026 path.resolve(process.argv[1]) === SCRIPT_PATH\u0060 appears character-identically in 6 files \u2014 packages/native-host/build.mjs, packages/native-host/package-flatpak-companion.mjs, scripts/normalize-flatpak-cargo-sources.mjs, scripts/normalize-flatpak-node-sources.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/build.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"415269cbaf89960cf2826cf7e7dc3679bbdd71b970e92a090ee3ad0261ae1ffe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.getuid \u0026\u0026 BigInt(process.getuid()) !== stat.uid\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe19b37ba3fc3db966cb81cbc42d073b61315cdd304d112ee84b1455010b53c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027darwin\u0027 || process.platform === \u0027win32\u0027\u0060 appears character-identically in 2 files \u2014 src/core/plugin/capabilities/fs-sandbox.ts, src/core/task/output-path-identity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-sandbox.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9caace85da18d2cfd1cbb632b16af446f64cf370acd0f8a48d256a88512f9b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prototype !== Object.prototype \u0026\u0026 prototype !== null\u0060 appears character-identically in 3 files \u2014 src/shared/protocol/errors.ts, src/shared/schemas/plugin-hooks.ts, src/shared/schemas/task-inspector-activity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/protocol/errors.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"952e1733e062e9e9a9dc8d84efa2412d5aa13a8c9ef695154f112215bf4d1c2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proxySettingsChanged || proxySubmitted || appliedDownloadProxyPolicy.snapshot() === null\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b6f88496e084bc11bcb8045798981e0eba7d67a3ddf01e7f061c9f1b39876e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060receipt.status !== \u0027absent\u0027 \u0026\u0026 (receipt.engineTaskId !== intent.engineTaskId || receipt.sourceDigest !== intent.controlDigest)\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6eb865b483b969bd01d582526104b4a101ec261f16cbc386a1e1a72291ff0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative === \u0027\u0027 || (!relative.startsWith(\u0027..\u0027) \u0026\u0026 !path.isAbsolute(relative))\u0060 appears character-identically in 2 files \u2014 scripts/generate-third-party-notices.mjs, src/core/task/actions/finalize-task.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-third-party-notices.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0975f2e2add83ce9794b6803d820191a0cf82ba30530d41aaea4c200a88d193c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative.startsWith(\u0027..\u0027) || path.isAbsolute(relative)\u0060 appears character-identically in 2 files \u2014 src/core/session/motrix-database.ts, src/main/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81b73f71ca9f3c851bb2c24c7610509f6c81fb5882823e08dc0c8d409659a1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060report.warnings.length \u003E 0 || report.errors.length \u003E 0\u0060 appears character-identically in 2 files \u2014 src/main/index.ts, src/server/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee176d1650bb17d6cb4039b779fd96a7b4ad83134020226746e59e8b2d83a95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.payload.kind === \u0027torrent-base64\u0027 \u0026\u0026 req.existingTaskId\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"5959457a5597d7087897eddda30ed04042af267ef72979fef77a550d7ac9a47f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.saveDir || settingsManager.getApp().defaultSaveDir\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"1461fedc237cc3b6f5e3dbcbb0ed97820305d29c17448c36b8d6bd84e6709c1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.selectedFiles.length === 0 \u0026\u0026 settingsManager.getApp().magnetFileSelection\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e6fc2ed9346497ef50e7c464876908f3ee69e1e5991be682e75b5ba08a5333"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.ok \u0026\u0026 (await response.json()).ok === true\u0060 appears character-identically in 2 files \u2014 scripts/smoke-server-image.mjs, scripts/smoke-server-package.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-server-image.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9ae2446801bc404ce27cb682791ab586dbb839782f0827d41bb6ef079cbc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.canceled || result.filePaths.length === 0\u0060 appears character-identically in 2 files \u2014 src/main/commands/definitions/task.commands.ts, src/main/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/commands/definitions/task.commands.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"755ae0fe6e96fad4e4aa4f9e8b0a70ec9483d222d85f3fc8a6e3650698548838"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.ok \u0026\u0026 result.outcome === \u0027denied\u0027\u0060 appears character-identically in 2 files \u2014 src/main/bridge/pairing-dialog-controller.ts, src/server/bridge/extension-pairing-prompt-adapter.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/pairing-dialog-controller.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f45e4d40add87df608d9412be1504b43f27c60080ddcf37c2af6395f697bf48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.url.toLowerCase().includes(needle) || row.sourceLabels.toLowerCase().includes(needle)\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/trackers/components/blacklist-tracker-panel.tsx, src/renderer/routes/trackers/components/effective-tracker-panel.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/blacklist-tracker-panel.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b683df49435bfafc13287dc6801f43084d932121ed0ac95466dd28bc329e291"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060schema \u0026\u0026 typeof schema === \u0027object\u0027 \u0026\u0026 \u0027properties\u0027 in schema \u0026\u0026 schema.properties \u0026\u0026 typeof schema.properties === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 src/core/plugin/configuration-schema.ts, src/main/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/configuration-schema.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"54190b06d9b959bb73b9321fb437450556d0b7a6d0077e804c2eb6c8d8151547"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060secretFields.has(key) \u0026\u0026 typeof value === \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 src/main/ipc/commands.ts, src/server/ipc/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/commands.ts"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d2ed93e3300fe71517c5a63ba62caeaf480dede5960a717883a90b115a6041"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.state === \u0027locked\u0027 || session.state === \u0027logging-out\u0027\u0060 appears character-identically in 2 files \u2014 src/renderer/hooks/use-engine-display-status.ts, src/renderer/lib/transport/http-ws.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-display-status.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddefaf069e57e7e6598974a54bb9eb2afb71fc4b7a8ae001880197cb8901391"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060single?.finalPath || single?.diskPath || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/downloads/task-actions-menu.tsx, src/renderer/routes/downloads/task-inspector-drawer.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4fa992672c3a4cf20f68388131e6ed031ea211055f20a20a4f2967cadb691d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.identity !== origin.identity || source.root !== origin.root\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2041f32fa54ee6cf3812b043aa9bea16a42b2d11126dcc0ac63205161664c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceRoot !== canonicalRepoRoot \u0026\u0026 !isInside(canonicalRepoRoot, sourceRoot)\u0060 appears character-identically in 2 files \u2014 scripts/stage-electron-app.mjs, scripts/stage-server-app.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/stage-electron-app.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d04bb182eaa9bd5302f5832a00a3890cc767c67622dc4bf3bd98b55e7870352"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060speedLimitController \u0026\u0026 JSON.stringify(old.speedLimit) !== JSON.stringify(updated.speedLimit)\u0060 appears character-identically in 2 files \u2014 src/main/index.ts, src/server/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f53051a3936beaa9ca4a779d357155418f749dd17ed17131ec70a0d7a9bba5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.isSymbolicLink() || (current !== filename \u0026\u0026 !stat.isDirectory())\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/bt-activation-service.ts, src/core/legacy-import/http-activation-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a8bc73f72c96ff989c458148651ff2506e72fa4f49c04b85dfc7f517105933"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027starting\u0027 || state === \u0027reconnecting\u0027\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/downloads/downloads-status-popover.tsx, src/renderer/routes/downloads/engine-badge.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-status-popover.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead698d48e9047ad22851de0708f5852674bed6bf9a256dafdcc64107670147b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === TaskStatus.Completed || status === TaskStatus.Error\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/dashboard/tiles/tasks-tile.fixture.ts, src/shared/types/task-actions.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/tasks-tile.fixture.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dfe8a180a0bbf63941be3797ec2ac379ec8c56833f6b2e40f43ee23f3c34ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060storageLayout || directLayout?.torrentRootName\u0060 appears character-identically in 2 files \u2014 src/core/task/actions/finalize-task.ts, src/core/task/actions/re-add-task.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/finalize-task.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa5e402f95d6ded8dd520ef7250cbade49dfda44473c264eda45a9b10d6667c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.kind === TaskKind.Hls || task.kind === TaskKind.Mux\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/downloads/inspector/files-tab.tsx, src/shared/utils/media-progress.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/files-tab.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1175a60881eff202eda6af13c3e8582c0efe0078741b4fb9685763b6055ee7ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.type !== TaskType.Http \u0026\u0026 task.type !== TaskType.Ftp \u0026\u0026 !hasLegacyImport(task)\u0060 appears character-identically in 2 files \u2014 src/main/index.ts, src/server/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6bcca1c9258fcaab5e3f0b02f448cda96a55b7d083edd048dfab9f37002341"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.type !== TaskType.Http || task.instances.length !== 1\u0060 appears character-identically in 2 files \u2014 src/core/legacy-import/legacy-task-policy.ts, src/core/task/completed-engine-task-cleanup.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/legacy-task-policy.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f3b01463689e44d4c3e4523eb5e991f0ef991f5224adf9e406e3e36158f24a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.type === TaskType.Bt || task.type === TaskType.Magnet\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/downloads/inspector/overview-tab.tsx, src/renderer/routes/downloads/task-column-values.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/overview-tab.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f933702d9b87780bd5be3fbcdfee0d5a6e94c9f52d5c6b68f928e24fd65984c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task?.status === \u0027completed\u0027 || task?.status === \u0027error\u0027\u0060 appears character-identically in 2 files \u2014 scripts/smoke-fnos-package.mjs, scripts/smoke-synology-package.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-fnos-package.mjs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f9b83cd034c39c9b2212e1cf940eff744e5e2f35140abcbc1cb8cd5b40ad2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.promptIdsByKey.has(key) || this.keysByPromptId.has(snapshot.promptId)\u0060 appears character-identically in 2 files \u2014 src/main/bridge/pairing-dialog-controller.ts, src/server/bridge/extension-pairing-prompt-adapter.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/pairing-dialog-controller.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a76a176b827e72cee66c70411c75ec38c3a5b92e3a4a93e7b16a28d83e7fa7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060transport.platform === \u0027darwin\u0027 || (transport.platform === \u0027web\u0027 \u0026\u0026 /Mac|iPhone|iPad/.test(navigator.platform))\u0060 appears character-identically in 2 files \u2014 src/renderer/routes/downloads/task-actions-menu.tsx, src/renderer/routes/downloads/task-list-panel.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/task-actions-menu.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"59019d335a572181567544460a411b805053706c5590fb7771e837af1d4717a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof error === \u0027object\u0027 \u0026\u0026 error !== null \u0026\u0026 \u0027code\u0027 in error\u0060 appears character-identically in 3 files \u2014 src/main/bridge/appimage-native-host.ts, src/main/bridge/index.ts, src/server/platform/synology/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5971419a6e0906055ff18ff242628f76b0482bb74267074efd4b362cf5cb19c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof error === \u0027object\u0027 \u0026\u0026 error !== null \u0026\u0026 \u0027code\u0027 in error \u0026\u0026 error.code === \u0027ENOENT\u0027\u0060 appears character-identically in 5 files \u2014 src/core/engine/aria2/aria2-config-builder.ts, src/core/plugin/commands/command-graph.ts, src/core/plugin/commands/invoke-audit.ts, src/core/session/direct-recovery-planner.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-config-builder.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ff7df7b10bbd8b2b7eafe46a470e620165b886da52f41ae115590c85fcaa52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof line === \u0027string\u0027 \u0026\u0026 !line.trim()\u0060 appears character-identically in 2 files \u2014 src/core/engine/aria2/aria2-adapter.ts, src/core/legacy-import/session-parser.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21610c54d39c026fec793148937170a67cf3b7598f1e3f33ca392a21e280a86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof name !== \u0027string\u0027 || typeof value !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 src/server/bridge/remote-extension-admission-policy.ts, src/server/bridge/remote-extension-host-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/remote-extension-admission-policy.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3331a899b0653ca7a8fa6d605dbd2f8cf2a6415eabaaabac8ca246b3bfcaa6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof specifier !== \u0027string\u0027 || specifier.length === 0 || specifier.startsWith(\u0027.\u0027) || specifier.startsWith(\u0027/\u0027) || specifier.startsWith(\u0027n\u2026\u0060 appears character-identically in 2 files \u2014 scripts/electron-package-utils.mjs, scripts/server-package-utils.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1a1dd19475e6e978a2c037617c787d60346d96ebf3b8807be17685d856e014"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || value === null\u0060 appears character-identically in 7 files \u2014 scripts/registry-runtime-conformance.ts, src/core/plugin/plugin-registry.ts, src/main/bridge/native-messaging-installer.ts, src/renderer/hooks/use-toast-events.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/registry-runtime-conformance.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb128dbfccacad427b6bbba71a0109bc8e9b5dfef863951d4387aabe560f9549"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || value === null || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 scripts/prepare-flatpak-project.mjs, src/server/bridge/server-process-ownership-authority.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-flatpak-project.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc0ccc42f8b08f7e742cf4d463e9320ebbcf65eca7f2a3764a1738887d59abe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || value.length === 0\u0060 appears character-identically in 2 files \u2014 scripts/electron-package-utils.mjs, scripts/server-package-utils.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb781514d6b711c07a50c92c3a9b43166b1f35b9747e53ec7c207eab512cf7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value) \u0026\u0026 value \u003E 0\u0060 appears character-identically in 3 files \u2014 src/core/task/apply-terminal-transition.ts, src/renderer/lib/task-views.ts, src/renderer/routes/dashboard/tiles/tasks-tile.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/apply-terminal-transition.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0dfc9a6240227f483a61204c742d66c27b90bf7a10090c735cbef70a2fd3d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isSafeInteger(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 2 files \u2014 src/core/bridge/extension-pairing-projection.ts, src/core/bridge/file-extension-pairing-projection-store.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/extension-pairing-projection.ts"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dcf5bf18241036209a63ac1910d44553ca8709f9a0eb33f23d1fd88b6c8ff2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null\u0060 appears character-identically in 2 files \u2014 scripts/verify-update-artifacts.mjs, src/main/core/update-manager.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-update-artifacts.mjs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aef21c2155b1840295a912fb2e0b7c198187a014c28b7a43d07a67a9c4bf00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-flatpak-packaging.mjs, scripts/verify-snap-artifact.mjs, scripts/verify-snap-store-channel.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"49580caf65743cdb28f8e3e66961f1e87f2c076909b1f4bb09732ce89bc193fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value.path !== \u0027string\u0027 || !isSafeFlatName(value.path)\u0060 appears character-identically in 2 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-update-artifacts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e9304aa67a51eddb1e4012833735f25041abe2baa9f6f68a4ebbec323edb17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value.sha512 !== \u0027string\u0027 || !isSha512(value.sha512)\u0060 appears character-identically in 2 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-update-artifacts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1774c669899fea32a5cd7eab98d46de2aaa83c76116d67c51bd76ccd9d8f7a9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value.version !== \u0027string\u0027 || value.version.length === 0\u0060 appears character-identically in 2 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-update-artifacts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"caade92621efa1cc09c8d6e8b9c24f6c2797917a3af2bf800d55cd2ae212569d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof version !== \u0027string\u0027 || version.length === 0\u0060 appears character-identically in 3 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/finalize-appimage-artifact.mjs, scripts/release-metadata.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e66a7f1540f5117ca2f12726131c74489367efe3479c4fe752f1edbf9af29f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.protocol !== \u0027http:\u0027 \u0026\u0026 url.protocol !== \u0027https:\u0027\u0060 appears character-identically in 2 files \u2014 src/core/proxy/aria2-proxy-routing.ts, src/main/window/renderer-url-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e00c7df4806616eb998ab27ac0114e76dbcc425a7dad13aff39e6b734601f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027\u0060 appears character-identically in 3 files \u2014 scripts/check-i18n.mjs, src/core/session/portable-relocation.ts, src/shared/lib/log-redact.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-i18n.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f340f400d86721e85d2e7dd83b94e1e37714cb65807d0b9925e0f07f959aa3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || Array.isArray(value) || typeof value !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 scripts/electron-package-utils.mjs, scripts/server-package-utils.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/electron-package-utils.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1bba24d3a14218983852f7c6f344703a951b819dec0d342b8af1ad74946c33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 src/core/plugin/install/public-command-hash.ts, src/shared/lib/log-redact.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/public-command-hash.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"da451ee93acf8c794b5e6ecbb155584466f7cc2250eddae8d7557232e37decce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 scripts/container-platform-metadata.mjs, scripts/run-remote-extension-release-soak.mjs, scripts/verify-container-publication.mjs, scripts/verify-remote-extension-compatibility.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/container-platform-metadata.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0f67fcb3d320302e69b74603d9b1cae422b6421b81c63eef796e79d8e26cc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === path.basename(value) \u0026\u0026 value !== \u0027.\u0027 \u0026\u0026 value !== \u0027..\u0027 \u0026\u0026 !value.includes(\u0027\\\\\u0027) \u0026\u0026 !value.includes(\u0027\\0\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/assemble-release-artifacts.mjs, scripts/verify-update-artifacts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/assemble-release-artifacts.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cb218594a88f45b737a6afea0fc2172488114ae1de6063b5f0d83aeb0308f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined || value.startsWith(\u0027--\u0027)\u0060 appears character-identically in 2 files \u2014 packages/native-host/build.mjs, packages/native-host/package-flatpak-companion.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/build.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83b4570da8ceaf028da71103e98f43f798f27b2697189aa51e1d8363d72cccd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined || value.trim() === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 src/server/environment.ts, src/server/plugin/community-policy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/environment.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b195e805d3c4cf8a15023d4ce137a8b75c7553104fbd12a40c09a9d89ccdc0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.length \u003E= 2 \u0026\u0026 value.startsWith(\u0027\u0022\u0027) \u0026\u0026 value.endsWith(\u0027\u0022\u0027)\u0060 appears character-identically in 2 files \u2014 src/core/task/direct-resource-validator.ts, src/main/cli/shell-environment.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7377a5d477fe5fa64c16e61dd96478f41cabcb536d9502b39b8c6dc16943857"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060viewport.contentLevel === \u0027detailed\u0027 || viewport.contentLevel === \u0027focus\u0027\u0060 appears character-identically in 3 files \u2014 src/renderer/routes/dashboard/tiles/active-tile.tsx, src/renderer/routes/dashboard/tiles/speed-limit-tile.tsx, src/renderer/routes/dashboard/tiles/speed-tile.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/active-tile.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecebf8d84c8c2f306d254538651c12cf8b1511f574b1825bb4941eace4cf0682"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060witness.identity.browser === identity.browser \u0026\u0026 witness.identity.extensionId === identity.extensionId\u0060 appears character-identically in 2 files \u2014 src/main/bridge/index.ts, src/server/bridge/server-extension-mbp1-runtime.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f54ed74df7f74739976555e09cb36dc83309c02441c89ca3630b528d2b46e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opened_stat.st_dev != named_stat.st_dev || opened_stat.st_ino != named_stat.st_ino\u0060 appears character-identically in 2 files \u2014 packages/finalize-fs/src/platform/unix/metadata.rs, packages/finalize-fs/src/platform/unix/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/finalize-fs/src/platform/unix/metadata.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d05a6d9e34b749d1888842889e8b866273060dc2286b64e46ec0f3673b9586"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pickDirty\u0060 is exported and takes \u0060dirty: DirtyTree | undefined\u0060 from its caller, and it calls itself at line 25 (\u0060pickDirty\u0060) with a piece of \u0060dirty\u0060 \u2014 and nowhere in \u0060pickDirty\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060pickDirty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/form-utils.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b62881e0a0c6e4fdef5f6c2e1b173cf7ec66cc0722cd61bdaf5e80d7aed7b0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pickDirty\u0060 is exported, takes a document from its caller (line 6) and hands it to \u0060hasDirty\u0060, which calls itself at line 18 (\u0060hasDirty\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060hasDirty\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060hasDirty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/form-utils.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e220daeb09e2fb0c1b3ff3ef8e66902610b37902cad5fcd9709d5a1fb3bb2b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060jsonSchemaToZod\u0060 is exported and takes \u0060node: JsonSchemaNode\u0060 from its caller, and it calls itself at line 66 (\u0060jsonSchemaToZod\u0060) with a piece of \u0060node\u0060 (and at line 71) \u2014 and nowhere in \u0060jsonSchemaToZod\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060jsonSchemaToZod\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/json-schema-to-zod.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f664aa9557e5195ec0e15027a17f0ed77ae0e0ff212b8910a4220d43866fb1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060relocatePortableValue\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 39 (\u0060relocatePortableValue\u0060) with a piece of \u0060value\u0060 (and at line 44) \u2014 and nowhere in \u0060relocatePortableValue\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060relocatePortableValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/portable-relocation.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60a01ae254f8fba3ff4cdad0d1fbbf7af663cea261956dabcbbed9d4b7affc9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060portablePayloadPaths\u0060 is exported, takes a document from its caller (line 113) and hands it to \u0060mapPayloadPaths\u0060, which calls itself at line 99 (\u0060mapPayloadPaths\u0060) with a piece of \u0060value\u0060 (and at line 106) \u2014 and nowhere in \u0060mapPayloadPaths\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060mapPayloadPaths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/portable-relocation.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b607ad47b422f9027d9f7a9ff9f51609a971417baea7dde1248e03140be4622f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalJson\u0060 is exported, takes a document from its caller (line 48) and hands it to \u0060serialize\u0060, which calls itself at line 72 (\u0060serialize\u0060) with a piece of \u0060candidate\u0060 (and at line 79) \u2014 and nowhere in \u0060serialize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060serialize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-materializer.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b607e63f95fe476d598ecc201f59ded5996ac4668c9946f42dd5d4cd69485ec"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060flattenLocaleDict\u0060 is exported and takes \u0060obj: Record\u003Cstring, unknown\u003E\u0060 from its caller, and it calls itself at line 30 (\u0060flattenLocaleDict\u0060) with a piece of \u0060obj\u0060 \u2014 and nowhere in \u0060flattenLocaleDict\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060flattenLocaleDict\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/manifest/i18n-resolve.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf22ecfacdea8331dac091477eb62133011266436cfa1220d2f33e2b6fa998"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalize\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 29 (\u0060canonicalize\u0060) with a piece of \u0060value\u0060 (and at line 36) \u2014 and nowhere in \u0060canonicalize\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060canonicalize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/public-command-hash.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ce286d9f51f187f4ece9efec6a88dfa2cdaf89afb7c04525c0cc4b3fee9fc6"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 23/31 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: listenNasClientGateway: \u0060listenNasClientGateway\u0060 awaits \u0060http.request(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060http.request(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/client-gateway.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cbbd0ed9dd6f4c43a0e7dd3dd5b9278724d5f42577ee57630834f90474cd8b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: call: \u0060call\u0060 awaits \u0060http.request(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060http.request(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/fnos/files.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a6ba7e9f3bd0839055c5cf68d48bb5f5ddb139ec87b67eef644a4e21fdcccf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: refreshOperatorSession: \u0060refreshOperatorSession\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af288ee4842799e9fd70e9eecdc62bef35f3a3bb343fd421681c2ece466cd54"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: operatorLogin: \u0060operatorLogin\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7673fca0b0bd5505a94e4973f322326b1e18ac32186bb0fff39e45927b61443"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: operatorLogout: \u0060operatorLogout\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6f72048f35a555612b483f39288a1a56d9965eb73dc00f9eea99700692038d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: createTrackerHttpClient: \u0060createTrackerHttpClient\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/tracker-http-client.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46bd3d585352bd9a9cc008caae7906e17aebf9dcadd628ea8e48df289229f4e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: healthy: \u0060healthy\u0060 awaits \u0060http.request(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060http.request(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"365f2b67d08dd77e282fab15064fac972d1ded5993df362ac4616218b21ef827"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: healthy: \u0060healthy\u0060 awaits \u0060http.request(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060http.request(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9a9215749548549a44c6761da1bf53ffda4f02b137ace5ee8f5f463866a8bd"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 634 is called with an argument built by \u0060active.map((p) =\u003E p.id)\u0060 (line 639), whose cost grows with the collection it walks. JavaScript evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isLevelEnabled\u0060/\u0060isDebugEnabled\u0060 test, no debug flag, no \u0060NODE_ENV\u0060 build switch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22f29177678e4bf606340e32b58015e71fa1bd5859a95eaa17cc08dd355e199"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060Object.entries(THEMES).map(([theme,prefix])=\u003E\u0060\n${prefix} [data-chart=${id}] {\n${colorConfig.map(([key,itemConfig])=\u003E{\u2026\u0060 is text this program did not author, and it is written into the text of an element through \u0060dangerouslySetInnerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/ui/chart.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fffba3f3ab35b769516e0eeae420c49b5ac8773fa2a4dac4637c7be772e9603"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/geoip-settings.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fb34a711ee1acbe89bc254412791ccd4c92ef2550a77d13fe22283b538cb27"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/registry.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cdeb87d1f4bf7d4e123c1ad51ed2af9e4187309d93aa7273ee200afbe1f194"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d289b081b80641c2d4faed756bf6bddb8e8bd3cd7a69279fc5922216bc6c5ad9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4c3a0a16370b01ab11c721f3b9db12e67087dfe58025bd376fa0b7c64e6c2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e172c6f9e034b94074da58fcb2993f8e14f419945232e069b4b167f4d4aef47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/app-update-service.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b533d82f7094ea13f3d2c5a5e26842e020989305c1cd27e80525c1154642a158"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4746eac05d8eaa0e0e2e8b8aec43508bbaace763195fb62716c8d5b75b1ef94"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/operator-admin.ts"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aa2962dbe068fa49eff6d5e091de1689254bb7838f9d4bdc01596acc3ca97d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/shutdown.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"deea543766092c56dbf8f16e064312634c6e2f00412461495e788cb28f64df8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/shutdown.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baf37c8955e3c338a5ebb56509167f2e1f5e5fcc5c5334a4f3e2b1f7f8eda2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-remover.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"117abedc415a1bc8e96bf1b0bcab8ed960ab5e490f71a02dae1cc1e49f94375f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-remover.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"802ce96396a813581736f893d468c4f88a15b3ba43a4063b647e96d4c34b5210"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eec696e335b73da7e4d1da34db627206aa2a349ff9bd3861b06c220dc303ef9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a001750b45e3bef726c9b1a011c7e9c404e0bf4a51aaa901a9dc8b8939dcfd5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/platform/nas/file-routes.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b84cb08759ece422d9f6f9edd26fd713faf0d62c6928861692308171b34701"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/ipc/commands.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a229999162cc8d41a6078ff17a3abee6ab0524c9c2d933a677e0ae324809c346"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/http/nas-auth.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c617078b9eeb7a371cb496b3ecc4f30585babebc229d0621288c4d8cfc23dbac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/server/bridge/server-extension-mbp1-runtime.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa78afd8dc9008430b456d8c401b4d37afb2640c16eb559516327dd6219c644"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/blacklist-tracker-panel.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b328de96e736322e0bddbca639b8bbc19f9e6c0ed78c166fbd7cb2d9284b7ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/trackers/components/effective-tracker-panel.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"935e446e3df3c22cb8fa093c61f09f4d066add0a102a2d7736320e0d95e4d143"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/nas-dialog.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba31bf843084df53ed34734477f2cbbc72a339b458f8135098a3f9425c86526"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/appimage-integration-section.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc98b4c85dbb1ef31f1735ca8c436384a41c79b7d42bd700a814bfd4ef12a967"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/appimage-native-host-section.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceeab601175665f71d9a89413ddec68cbd0c907c22b107db1b579fa990bb67b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/settings/cards/integration/use-pair-request-prompts.tsx"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c15f5ce1d2800f4d2603d73255d2ccc78321d99ec4bbac1d94eae6d850b311"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/lib/call-graph-layout.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a379c8c517b1875ac45b9fa8e9d647eac3e90e8d75eee005d51316b83b366ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-detail.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b83ea82e6936e852d7403bb02cff7acc47a934b3afca6751fa72d5e20cb7e68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf51a32a1f12d7f4c0293d94b17d447a8667f50686370c1e6dfef3bc4097c99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-install.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee69194cf64751dfe391de3e78c16cf6cd9e4abf91527eda7c179493e5ff749"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-log-state.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b5b39502fc8f48599a19f1b44e28994c34f56059b88dea58bb72378c898525"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugin-log-state.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb69fbf125b38440bf09c8ab49132d16eeb87e856bd8bbfef2df90dfcbbf79ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-plugins.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b844b9bb49e975e27e7118bf826b997f4db7e53db89f2e03c841147829d1770"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/plugins/hooks/use-registry.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2571db510b765ca6509f06678f1d7482fc8e21c02eca4ce8452d94f0bbc62ad4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/store.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"643afe6f68050b8494b73cfa514862d4abf34f514fb2cc8b4581bbbeffdad8fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/view-preferences.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5113f42d3a98be1d499ab523c56724d92c4fc5468c55302d0231a1e35c864db7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/downloads-more-menu.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1617dbbba9fca4e60eec03ce69073dac3bfbdab677f38be890c6841128d69b8b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79a988c65c29eec3f95f7d849233990c614d781c833b1626e65339f16df4f4e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/components/dashboard-grid.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"de577f4552715dc15df340253cb233f06530b9dc891c85bff84e4011a094337d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/platform/fnos.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e281b48e0a86219d409de9137fbc75922905c62e67767f4789e7ffde5b21a11d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/platform/fnos.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"86384c1ae383facc4b94754257878ebc030d7268ef4852feffeed393a85f9ac8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/initial-theme.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bdc9150837f10e29479a8279f4c4b92c927c3737cd6bd3f66479676623fe26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/operator-auth.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e3273a371eb2d5d6809c663eaf4e3c3886ebc1f7ebcae965b6523039ff39a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/renderer-health.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e0e35c2a8e25f2e80d74148df93cc5d30b0a504cd0212271c930731b13a0bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/renderer-health.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"502e28e13ff0e19029fe1586f757512d2a32365f0916fea0b54ab681b6fd9937"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/renderer-health.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c569e2bd8e8c2b99860fde0b4fccde753f6e2e4a3c66af967df8d5a6a3d85ecd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/renderer-health.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5e0bb07a07f888586aafc92f314fd608bb61a7dac975111b7b32de5209fbae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"046637d0f309aee27c0deed89ccfe304bde11bf7077092e804eda3a17f6324ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"691f959435806d9024967ba631b7a81935c6f6a822daf10500d55c8240b0e68a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b91895d7a52cb2a2308a4cbe044bc1776c3574c0cdec3b29302bd1991e95f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/lib/transport/http-ws.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"77034396de4bf665b2ff11ebc7f94ffe143309213c6f86f1b661d56423968785"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-application-menu.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2b7d4eb0476d28bd14717eb5f32ca2770c5dff5c710430c6f75698ca0ba111"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-display-status.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b001c7b910494e3656222ee2614b7678b971a33054d8a6868eb9b321c0ce130c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-engine-restart-required-toast.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdebb169e8cac98d26570d6f82cf4a76b87116424ce3cde6459e73e31232b0b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-geoip-status.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20b2a0c2184b187a3c8309b4cda21d70cf026fe318e04ff745f4b5451293a74"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-global-stats.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e06dbfd6b3718293bd1bd9fc3bb6f0d1f2cb74a32eaf95b75531d616ab6962"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-graphics-recovery-toast.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"752e60fae88b7de84be8557c232a81991a90f00e4fea5bccfb1e96a0984228b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-nat-status.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcb2e0a04fb7977a46ad29c934e7098f4851f7a15b5db1621dd3013e42db8c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-notification-toasts.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"156eb4639dda3510b819fd8b0c1df50a5367a8e0a134b03322b11f18b2b71afd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-polled-query.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4391d2da4060e17758ed6d91af289a04fe77a4fba322be8c2b2e947fcaa789"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-speed-limit-state.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d512838cf245016c9c6593b0c43451bae99b056a21cdf18538ff99e55ca83e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hooks/use-task-files.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3441549845cdc1f1b0dd92c2cd460fbb98b4f08185d4d9659164c71ef6bbf4a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-sort.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2cdac63b78179724993119e711d0b12a5863b7d3e136fbf7039c10405d4edc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/web-directory-picker/directory-sort.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d021a1a89f16119719bcd8092c79cde06ee9ac964294954db43fa2b2f10e5743"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/sidebar-preference.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d143f1d2e26f93d31acb6ad11b4c3887fae8dbdbac2718bbca14dac372b97f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/features/legacy-import/legacy-import-dialog.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3629c0905fe08159de7fb49bb087d481ebbb594c9a9a250c6ce404dbc9b4a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/byte-unit-sync.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df036d26b5a27685f48ce4c1854d77a9b693920e12e6186e6d6be618451ce19"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/language-sync.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af2c3b9d8388e8d9d55fea9e6b911d0dd7b8c05eeee78e8d12bebf969c8399f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/language-sync.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c406bac97f46476894ecd08dc8f8f7cf77500cd09219d2548a10ef6fdc42e0bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/language-sync.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e14415b6b53367e45d3d556bb8155772bed1869e66e0c09e7577d84200153b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/reduced-motion-sync.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0a63e92f2c4dd33f5e6006629b34d6e152afcee09898d76f49be3636b68074"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/renderer-recovery-notice.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb9844c792b74b318d5278c2ea4780819e5305d913dbc6fa1cc5dcb79699e27"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/theme-sync.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a116b6088908807ddc1e851ab89a7423be6089b9f82044ef5b0470cbcc8f9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/onboarding/onboarding-language-select.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba4550563462b78c48e4c5aae6745cf33b2644c0704af8ba4f2dff38a038ed1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/onboarding/onboarding-language-select.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db519413bd0ab84df9be1b89f2abfcb2c0348ff56e08f0b19e2b050cb97e693"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/onboarding/onboarding-language-select.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c872b080a3eaa37f88a7d67018ac14b8beeffb44fa46df708578373d79f0bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/desktop-kit/cubic-glass/cubic-glass-gradient.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af6f3e5207f16a1514e2614dde7d327864b4134a1b5160d946b75f555cf3ca4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/pending-create-inputs.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2d52b5d84c770e38db23ce1eab72693cf4d40ef9a571ea4a56bf82edfed744"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c9ed5e00dc8b141a584b8df10ad0c3133f4e7f2f8d816acdb0b54250ae20bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/add-task-form.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5a9c2f302a452c7bcb98ababc1b61f9a67b4a4bcbd8479510cb9e495bf4540"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/preload/preload.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde3d418437cbafe4540c3ac9dd638e96a25c62644bb328daec26d70c01f86da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/exception-handler.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c2825854681ec807381f9393452b9905eb48e76645b5f4f77e493d6903d65b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/exception-handler.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e86a2d03d325fe92c7131d8db809cf764fd6c53e1da87541894eb1f7ed7c5c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/exception-handler.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3df37d61a9cf0edf6d9825ed445742314c208a409c742320e777b05697a6913"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/index.ts"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a55606a4ca24782e94c00eae010a6c3082e5a75c7ef0fc1bcf691ff43a7448"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/logger.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2c2f8118553ef9022bd6366d860f4421054850565d4ec5ed91097767d0b05c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/main-process-work-coordinator.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed754b4bd68ea040c77ccd1696945e7c0f0b523bb98f297de6095041be330766"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-recovery-runtime.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f851436eadf10669bfa8dac2ce9850e8e6f32ed3b86e7223a5b15b7a5618890a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/renderer-recovery-runtime.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c3e00062fb39007bc6e636ec5ecfc7bd84f56ecb322970b15ca3f34259baed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"263d1b442edec6bbe767da01a2e0ef52dd09cae0fcc1d50aca77e2dd35a12580"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afc9f468b8a9502fcd3fee824b2d9e1e723fb540abb63bf64dea1aa734303f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"07da8d16991b9ecaf01ecbcaf8924eb549c5975be8f66bbccea2746027da8a45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/appimage-integration.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f494f9a4275999aa71fb05f1be9a7175e973cada74c8c0c90e78adccb440d766"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/platform/tray-speedometer.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f725682544f20d8c5a10a5ae36c0714ca447f3d3f69214365536db0b550ab058"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/ipc/application-menu.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8780dab2d38421f516bd2c5088b84c7d7e3cedb4321e51af91b01b2d274a79fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"692e0efc817cd39fc1efdfdf10ffacb432ad4d4381929504cb2d94e5c5281971"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/appimage-native-host.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3016873a068c13655ad174063d24ebe86d818176ee3b667b2c58e8754caa8a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d524b7f6777dd9903649724cb33e830c7490f30cd1d1c947201bd848073c515"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4077e8beeaa782f8e7e087c49181929eeaa41dddac4aa38a2efcb2a89eeba905"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/index.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f518611c8c18b9eaa018e3329f581f6bff7bb1d35a70e4077c0ec5c8b1a3ab5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/pairing-dialog-controller.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"401e54f8ff7fe815c6745ec10d94dae941aca9cf15cd1dfdd48a72c83f06cd01"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/pairing-dialog-controller.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"345f82ec9182c873f1565782eeb876f16dc71f690da5e8488d1d610eea0356be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/tracker/task-tracker-service.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"370d459514e7f9df3ea5399d84dc0bcdc19fb949e503a9412d5c8a62ad8d127a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2907eac7653a5cc60faf5d66ab63e27f51410cf4dc8214bbae1b5b427bc2e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/torrent/magnet-tracker.ts"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc81aa81fa6cd808892c4ea3088807e1bfb3ac2353b341c12f955b276a455ffa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/bt-storage-service.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7e228dc0c1ed2e19b99d81ce3a75d7bc85a3c8a25a251250218b975778a4a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/create-task-handler.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed2be19b2b3cc3bb11de901ccd9d568f621fdedbea1d14533d012166aa58efd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d7397e2d892ab05c2446bc58ecf3c5fe165c77e0dc0c52804ad572269e9985"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"672f2b9cba6fa57525989b35ac91c3c62830d8afc64e3315e771488f131655c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b00cd056537ef257ada394d8d314994713e70670fb4401b6e360c9033c8f67b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98f68ad94a41a1d91db973f55846276d6cec9a852880703044d8972aaad8401"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a44cabcafc020015b738fb92dc82f0b4a3b7d70f8990d9bd81c4149cf9157e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9f430633a4d66a69cb3af49bf413a7779d04f030727ae3a067771bad6f1884"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4194e7edde185a76d51ea115cffd4da1015160e7e622a2a19f1e5b0aab1b4a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"3242fe5a42fbf36fd35ab8e61c111b20dcad94604de8d06a3dcf08c5dd3fb454"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/direct-resource-validator.ts"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5346ac5c8f18c179b9e6cd503ce1ac5beab5c6e277dc28e0bd3de4a61ba5ac4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-meta-store.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7200bf87534a12a05e286e5f8b90b5bed302d850a1db8423c629e118c0906f2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-meta-store.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a460f97e7526bf7addde3e0a379d04a7b07685e6be218e5415c3dc82f29441"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44e76ad5dcac4ed5097633ae67d1ee68fb7f0e01b1c0093bf7cc74faaf9f788"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc092ef6534bd0356ca0d35291805dbe0babfd8ae58bcc4296c8a68968f0679"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f674984e31097a8fc6a4b608c4959c82601628c84ccc341e0362600583c4e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e773c554c567f27409d4273374b1b21e5fd40a4b411000b68f9588adeae993"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476ce3d0c05584e70a3024250f00e13cd2a92965ec90ac40c7d1022269d9f5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddcb06166775ab733532abd599ac6937753743584777e5b23384704423b103e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/media-task-coordinator.ts"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"274ba298f10d1251ffc970aa042eb004fb05d358567b05472883869796c44971"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/move-tasks.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a355493cc007ee82aca7b6cba3170d6370aa14920c09c6147271b3adbb8209b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/re-add-task.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"681709035d0089edc5770619c3861fe88232ac45f0d4fc0435aae16f6ba7e43f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/stop-seeding-task.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31bc33778f902d34480243042883c2524ed6b1639f3d97fbd34717b7ec725f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stats/transfer-stats-runtime.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9f50e9856cafb46a5d14c45b6c9b0bf60282ae2681fd3d5764367d9fc7c583"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/stats/transfer-stats-service.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a2e2dade1ac226513f6772aec773dbf30f38f4f34224b16e17a3cd89313821"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/process/command-runner.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a3af749fc4f57ddff2a87abf1dd8b8dcff0052e6520428e89b5250ad7a5841"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/process/command-runner.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8d77dad251288ca625194ccd4f12607ff8c7a3a067e700550fd9c5f69554c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/process/command-runner.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"783aab34be86f6d683599c5076980956141d721797b35894bb52877e0fa97a2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/process/command-runner.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a482b46e7a3a0dc102d01268c9474d7b4602d1fbe813576c1bfc923ea99c79"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/probe/disk-probe-linux.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e8973968a5931c18e047fa3528b2d69fd03a7344927bc6600a47621e8fbc3e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/probe/disk-probe-win32.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9329078d93b825fb57d000831dc93373b925ec96390f2c2bcf036a231f8996c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abbbef35452618cb641cf3ebb35c8f560929cee2ed751092bda952dbd9488a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/update/builtin-updater.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e88be29e066a52a2174e9e362b518742a4b890a6865902bbdc4a9536f61dca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/update/signature.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bfe107a95d69b9e429a9cead32d0e0cbd9e2a94edbd4df71747db80d63c0f1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2282e8377426f8898f0105d3f6c5481d7a83e5e44fef062084025d9b9018da4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"13908b74fcaae0d1b0a756adb50d0f30841c14b5b503e8b7c255112651a35f39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"597375249dd86fdd8665ccb34e570a4eba83dfd83b3d674d239918bbaee810af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7296c63447266661b601b2147895bf712b7ff9d0cf7d9920703da3d227b13947"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/registry/registry-client.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7af96662a5fab772ac32e5862c8d3f1de9c629425c53aa9a1f492f2ee5d59bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-observability.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"241ce39a89766453c37da80fb6a83d497eeca7a161e0442a53eb5b1b84cc22fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/post/delivery-observability.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6731e9a64fd4764d8a7355896792e4e134c454638930980a1db3d86a772172"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85d8d2e7b3df69a606a381737fc2fb86e4218862cdc9030df99466a9d15e095"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/operations/operation-service.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab85c6ee5ae1a8e31c35981f2beeb3b1ae57d4a87fa6acaa6ac5140aa4a872"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"733079c885435e0541b450c9416f0125ea7dc89ab0ac5a3f922f2a5cd9e835de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/activation-dispatcher.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfc5b9f46527777a5e655daa2ce9c7ac3beb841054ef52698fce75009b9d8e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/capability-bridge.ts"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dad32f3941384cdad598cc2d0318cb502942ec233a34b3393b2425c301ed58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7424d1d75427294c2f16ab5f065e87c5a0861164317eab270c409f007bce1a1c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/plugin-host.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b495a530e7840e9042138ac57f33e29d5988cb3fcb8b0d70a27a2b32766c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/host/quick-js-worker.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"7beddf8f6b7e2caacec0fd5da807818c0efebbfb8eb33735ddb5d7da8419c6c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/audit-log.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f983b4acb6d40c58678749880a627167232a0c82df6eeaa5bf41bfe3ada5634d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6697d6324350965f9ea30721c7b639000a9437a7d1bd56193c1702c2459ee6e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/hook-orchestrator.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"678c16757d1b77cc482e9415d364abf81900eaf4d0f2d8bb36b22d18a2d41740"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/command-graph.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"521a1938db7d5982834ce2ebbfa999bf564adc2cfd31d0743b7de9cf1d272da5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/invoke-audit.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5d4cbafa2f84d1aefbcee0d49016cb7bcede75028a7ff09b5ab4e6908e85ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/commands/invoke-audit.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"90dff01019b7a1bdb7a13c08c108cc6288abb484465a4c682e34a372f9115fcd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/config.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e926e48d4fa701fb6b44eb30f4d81b4bafb1bcc3c102388da7458075624a36b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg-detect.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccf5ee626c68305fde7fd7bb3e283a20a043ba27a7dd3720e905dfb12755208"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"816d0d71c0eef70bc99b83402857eefa5da75cf7ad530cae100e7817ef2e84b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b94916424059a5bad26d34603a9969d83165c679fb3e5b435c5a78e309edf3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa2a8ef8d2418370f1745e98dcd12d726da4d06e0652096b1246984b460b821"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/ffmpeg.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa2cd9a8ef6201d6232588c58b7a263b74f1643b7a46e25457a68abd0f0eb22"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-storage.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e2e9b7caa244e9b35f0ba6762f073100e8584cec8711813790e91ed647d6af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-task.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"566bb35468b5ac2d42443d93872fdad77f6a82fecfb4285bc4a22beb7940f310"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/fs-task.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cae0c2bba50a19160fa64a4afd61bb113e9d34d0be35847547874cff7ff5a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"499bc4f49ae122149138de50008138164155c31c1ec24ea9f762675f03b2535a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c0224f787e8e28fd88466112d4f674499c76c0360fde5c5eb220b49e30afb2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6833997f265173e71a739852e47e51bffbd672ba74c4eb14256ec6ce00d2c90c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/i18n.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b28e4032387b92d6f5fbdfa97dd605d11b85be6ff04fb49b8d13321f38d414"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/log-history.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42d1b00aa72241b86a764683d8256a2d578f09ccabd410fb93bf7a02947e448"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/log.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb3ef77ad140557d3b9949cab064d20f644edc869ea440f58d94a6747ff4e0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/media/fetch-source.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25304611f8ea9c471a327330fd3ba0dd6b8bb03886f4f097e39281685a7c5fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bb99e4ec33ef5838acdbf8450a92e4b0b29cbdfd26bf1a2a957ff3ea75f3a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/bt-activation-service.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"962f5b77b4bb5f48ddffb6a371d8dac10e786f34a94d0d37e9cfae6b8ba54154"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfd0b37999c895f319894764d09c7398951bcdb43150aff8eac62951b12cbd0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"649be7bff08d7f830258f00ced18622754323e82d6123ee9c4981f822bf3483c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/http-activation-service.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45d945dd152363ea1eb290449dd10e4bca0a913231d6030a4065c4d1f073862"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b2a55f480fcf4cf9ade6ff554bf906a9d75795cb3c04cb1e3c43fd1c91644e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff9c4f31d6fa68aad11d49aa4c03847e25e3d0d16cd6d560ace477a30fb31be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a4eede76d5bccba28a436e8458ffa907dba08d861074b2ee35069a4dd62ee6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"06915aea466f6a2e568d459d769a91d2f9353a4b37a3318d540cbcf534c0bd3d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-import/import-service.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d2d9b1086ffb94f8b9230e858de26b82a708b2360daabe7e4e58ae0b14405b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-runtime.ts"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"783252e104645b566289a0832b557595c58e7a19b930e225eea3937c443161e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/inspector-activity/task-inspector-activity-service.ts"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dd676447b52eeb377b60539774652cf3941a1c73c8852a8a48e1a3c92d2b6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.then(\u2026, () =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/i18n/locale-coordinator.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa8e023496482601d7f054497570b3c7b831607371c1ad171f8fc8ad7f7860e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/i18n/locale-coordinator.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b97347ab6a29d1626254bd8a838c54a9f636cd1b55e42ac9accdc14b8a2e7ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-downloader.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e2c9c7283a1d03415155d5ebc68633d2e08cdf4ddf52baf4b288497640e53b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-downloader.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"164a4de19a91cd7dc9080ec947e8b0f3762855797733fcc4be97534be194d316"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-manager.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1a40daeb8552ff88ea9f68ba7093c3ccbde06e7eca358651874a8c4f7049aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-manager.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce5e5cd119e930e164182eda3197e301f9c0b880dda9cdbb00c983460f188fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/geoip/geo-ip-manager.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7790f28a4a826a75bdd92161a798c7b0b47d663cf824218cb8688ca103b96bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"4896c7b9cf2c29f715375b3205dd4451c26cf529affa6a5c6a02fabd25b6f3f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e116d58bdfa14968a60bb4dcff0ecdb4a297a07cdc64c053ad47e0f36b2ef2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f946cd4d401d9851a5eb89b0f2c4146b78caff7f646469b4e701e6871ab3d186"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c729710f452fa7eaeffe47f8f94095d295c12ea15f45c0bb9cbac17e6333108b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0351c88fcb7e3ddff513117ba590ac75ed55a277cc19e9b53b2798706820942f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d6245de62d202e1973875f135be0d0028b90cdca2a0f7876fa63d5f25b3b8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a67fdb19093edc3264c84b97d32e9521c64fc55bbcab7137d83600641f4074"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90b0adc63e703f297a319aae4720db0ce45ca5f9c868e1f178d8d3b8b7782ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ffmpeg/verified-install.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67702a33d55a4995b0dbaafc4955b3da6ac78d05bf630d44c31896bf52d7d69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/engine-supervisor.ts"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"73468c3f11262a500352f1c42b3affca911e5654873148b5365d53884e34812f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"302bab7a7286aaf79ba5182c0f4a487fb110db779c57c1c5911a275d94dfae61"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"839e8c14fd5b4f727615ab506b46b48b4faa217956becc4c5bed139e077fd7c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-manager.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fc06178548b7edbc2c9b224fcf5b3ce6df88040488f99658cef22096e53c67"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/json-rpc-protocol.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7ea129b7b74ca2a589988f745365c8779226620ab206ad309cbeb40b549b9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/polling-scheduler.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"18555e174bd854ed88bc4643ed4363a31268d91f1f7522e34a4a20cefd6f2b92"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/translate.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd86aee631aa4028286f92fd515d005100060338f97d49e93687be818f1bfa4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge-receiver/bridge-receiver.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcad8fa26d0fe3c8e9cd7cac9f30883b764bdacb5c19216d760981bf86e7a06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/authorized-envelope-stream.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13070b0782176ee9907a6478efbeb7ec76d5e0fbb9ce4defc8a86d28a25aea2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/authorized-envelope-stream.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0cd4b0689db995a852d6d737afc89dfd41a68d7e408916c6fab2548b7cc874"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/authorized-envelope-stream.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f8e033774400543fbf020ad9d7c2e8fa2843a17f03894b3433210b0b730d81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/authorized-envelope-stream.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b064ddc85035dabbe92fb7a186fb65871fddd02314e9e1ce55560a75dd1b4521"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-connection.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9910230919d7cb9cf0eb58cfdd78ea869900764e2b6c6049d31a200f65e339"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-connection.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa565d7cd05270ba9b66b4c4997eff9722d329f8881dd50cfee421ee01dc10"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b1093b191c83a0b566a0200a38a951415651d637639970a49980385e9a514c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/bridge-data-dir-lock.ts"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dedef123ed14d7f2292fb987dbe9ad96b509e5f4264e3ad1eaf73c8c6350c0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"42480f910ec7a3e2b55c13b9fe61a5c255ca7e9b958afe069eefa93f06486301"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c0a3513bbee02d8b2c11a36f5b0c29359f82566023699371f8af5e77f8f030"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc790d250fe03949868e07a34a8107e4c875c301c7a7d1905f8dccd0eff22381"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-prompt-controller.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"492ef6a3e3070470c70d7d897a1ef48eb9c18e7cc2c9bfdb56816b6aad91f7f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/pairing-service.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c33faa8463dbe1bfbf9dc1897ed2c6a4574563cf143171994e519ebbce1a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/trusted-extension-registry.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caa273de402f8f7e8b3ba95678269287dce8945e652dee2a0130c706d84352b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/trusted-extension-registry.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbf63425cb81e1383e6712b05b8ae54d19576120459dfb9c8c99e94bfc1586f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/url-resolution-service.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e350a91b3318e5db41cf2fcd6fce0e2da0f14daa77a77e18d59100b46f5506bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0d1cd8abdb1d7b1d99b4935a72afb2e034e0c53f4943a4bc634cbfec22b831"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6940bfe329742906b12738c61e64f86f87d5d707f3b0667fc6d9685df1d98a7c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"123f24761a5c3cdafccec2f63ab892e1e274945167a66c34bf9730d5286b84ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d27c085bd6de5c45b7b423c450f4a4f4cdf02197b481433435d50900658d9f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc084782b7bd04456aa031be1e930dd6e8d3a2e1592c0282966290c8029981a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a4405e20107840ad548ee192dbc157766bead385651082f8d4ed2385f2bc4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5928ba713c8ccf457d0c374c2fec7c196a441b9b51ad5c4e57916478da245a4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ba08c033c45c8d85160ae31b0f6c0eb15b11c22b8678f5eab14a8cb02af350"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a81a02a19f065a100da73db0ce6abe3270b741045062215fc76aa21de91d78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cdb0f8d811638fe73acb2598369b5f8bf2262ad5f1073917c5d402082620d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.then(\u2026, () =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/web-socket-bridge-server.ts"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"831c73ededd43b815673ea13e87bcf53a01d9dbf8a1644896e91bcc5a83394ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/pair-session.ts"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86f2f87e65fbd0efa941f8560ca54ba7d5e7d53aefd1176652e97a64b6b736b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/activity/task-activity-service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83554c35425c2afc0e2b267332d54c05e44d61dec959c3d81f5de302d14a68c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/activity/task-activity-service.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e631a973eb680904e358724345bba600d1c4e93f2c3e4661f515ef118b5be5c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/synology/app/lifecycle.mjs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"db86597cb6d35b6d92197fdb8b16452f03d15d97fd03d28e549383582ceb34a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packaging/fnos/app/lifecycle.mjs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"75af4c5476654a4ec5682d0934dfd8970745a4189a313be3201b090570202cdf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/Sources/SafariNativeIPC/BootstrapIPCService.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee46eff06acae7bcdaa8618e484af8436b862a25e7d69242b6d9a4b664586f47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/safari-bootstrap/Sources/SafariNativeIPC/BootstrapIPCService.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"561c72551be8ff53c4f6c2ede0fca2e4ba785c962c58876db6cec98c51ebb37d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 598 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.error({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.error(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/window/window-manager.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5949840b1a34ddf73791caee487505e31ec87920017ba54a4df31ae49cbdf6e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn\u0060 at line 230 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.warn({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.warn(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca2f965d62fa4d02c73b7b9bf4a1962c384f84ab59fd4f4daa89d2b0f7fe486"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn\u0060 at line 252 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.warn({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.warn(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f020ac77eae2188f65f9a9e94c23b8582a5ecf691ce5edae5ec56a4bc2ac79d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn\u0060 at line 384 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.warn({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.warn(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"06404983d77a44a33e9af29c471a02eea36b2b7340f58a4fa212b42c18dd4378"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn\u0060 at line 393 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.warn({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.warn(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/task/actions/shared.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d465bf094ee50e2ce9ecb45940bc8a86f42fd467209b5539cac0be24202c7108"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.3 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 60 assertion(s) across the 233188 source line(s) of the 1368 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: src/core/session/motrix-database.ts (32), src/core/plugin/capabilities/ffmpeg.ts (4), src/core/inspector-activity/task-inspector-activity-runtime.ts (3). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060motrix_safari_bootstrap_v2\u0060 turns every \u0060Err\u0060 into \u0060SafariBootstrapResult::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/native-host/src/safari_bootstrap.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5981e38682a9896a74a1c5fc72acdb242a2bec175d61fff5f455a49deea8a322"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060verifySignature\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fetch-builtins.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d87fbf8cfd56f8008fdf2ceb270580ff4869ece257fee488ef909bf9e43d4d5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fileSize\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-task-inspector-activity.mts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32d054a85bdc2fd353740dd9cf8a1dfcc55ffefd75d306c875de372a6d3b3df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060load\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/file-pairing-store.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d873eea435349809e49b9fbd88861dbd8f6b7eeec6112360461595b0345fa80e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060base64UrlBytes\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bridge/mbp1/frames.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45e1df7ee0b12fea061e7561e2bf328cae8131a1d2022cee8bd1a77ee416951"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getTaskPeers\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac9f7701d01ef021d30fe3cec02ba5ff2cc8d2a5181dfa7264befad0fa34abb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getUploadLength\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-adapter.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d410e18e84c0e9163161c174b001948aa28b843f449c1397840ee5f06b8dca75"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060sanitize\u0060 swallows every exception into \u0060return \u0027[redacted-url]\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/engine/aria2/aria2-process-output.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a047f7a4d604665cdf0abfa017c01028e8bd0ef4a461b7ea14759c9fa862b48"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cookieHeader\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/http-cookies.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f6351e7a2e756a93fd2f742a74492cbfd9ecae3496044f7d21faf191252f06"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readDict\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/capabilities/i18n.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ab624db77e8cfd0f6ab5a9d97169d7b1724f6b402f93e82210c7c3cb4601a8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadLocale\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/plugin-registry.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76100954a2849c9929b3d1419058a8c41f21fdd68cb4bf6e5c5c7e479306cfb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060sanitizeForAudit.uris\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/hooks/audit-view.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede7008013ff047d7b0d874b5cc289a8d7b9cde61ee252315a88f0d5da0272f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadManifestLocale\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/plugin-installer.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5d685f59fb1a2df1581d3ee2127f72e76a12f5e4344ff962436399fd7441a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseAllowlist\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/plugin/install/server-ack.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5578072d619914b5b7677d7108d9f06db126a9fd5d2b1e0d7fd85ce00299a56"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060inAria2CidrBlock\u0060 swallows every exception into \u0060return \u0027unsupported\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/proxy/aria2-proxy-routing.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa933202b27694fdf0c1fdc350318a730a801d011d2a816d0e58f0f5902692f9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseTrackers\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"17397f897e4aad8ed4aa014ae331edade7d209789732c5e9220303912b56280d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseUris\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f1133a73ca32d5e34d74660af9d5214b4c98fdc426a47e45b26556e41f3928"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parsePayload\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/session/motrix-database.ts"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fe0f7bcd1dcb8fe2289f5cf33982b1faaf84c7958505a286ecb5880b6100da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060registerSafariBootstrap\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/bridge/safari-bootstrap-registration.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bbc9d5ae2e85ca6a58227b9896b4d86050a63ae02ee0ed4ec1832164477999"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseByteCount\u0060 swallows every exception into \u0060return 0n\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/dashboard/tiles/transfer-tile.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb488238dd714773d40400c2d973427bd406723058b9ba4c0fff5b0faad1a3db"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060errMsg\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/routes/downloads/inspector/use-task-actions.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d1def355dbccc915117c3bd4af9e37e22fa19e80125b4c7777fa0ef0e9941f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPendingCreates\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/components/add-task/pending-create-inputs.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99f3fc13fc1015bc84ba6900ad1e7b2fa5c19325ec58fb3f80d4a73f24cf046"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createWebServices.readClipboard\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/platform/web-services.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9fa9850ae86029d12a1e1e4848209e70f4478eb69aa0a04791c0bc4c400a8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060headerNames\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/lib/log-redact.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c73e0ba6fde9e5346789816be39c4222e3adfb5772bd14b58592848e3953ef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060url\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/schemas/create-torrent.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"648f340faae444f04c9bf8c459b51c47b187dd14ad4b64e6d4f91e7c5dddee8c"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-1321","guid":"0367a99b-2a5d-7b52-a83b-6f4196022556","name":"CWE-1321","shortDescription":{"text":"CWE-1321"},"helpUri":"https://cwe.mitre.org/data/definitions/1321.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-310","guid":"97174724-2e33-8455-b7cd-5c3258d1cb8f","name":"CWE-310","shortDescription":{"text":"CWE-310"},"helpUri":"https://cwe.mitre.org/data/definitions/310.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-444","guid":"8989da48-caaf-a955-b9ef-53767db527d8","name":"Inconsistent Interpretation of HTTP Requests (\u0027HTTP Request Smuggling\u0027)","shortDescription":{"text":"Inconsistent Interpretation of HTTP Requests (\u0027HTTP Request Smuggling\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/444.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":78,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}