{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"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":"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":"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":"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":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"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":"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":"P11","name":"BDD / executable specs","shortDescription":{"text":"BDD / executable specs"},"helpUri":"https://codehealth.canine.dev/dimensions/P11"},{"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"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":"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":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"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":"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":"X31","name":"Test-only surface in a production module","shortDescription":{"text":"Test-only surface in a production module"},"helpUri":"https://codehealth.canine.dev/dimensions/X31"},{"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":"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":"jscpd::lsp::project::cli_as_defaults (cyclomatic 46): jscpd::lsp::project::cli_as_defaults has cyclomatic complexity 46 (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":"rust/crates/cpd/src/lsp/project.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"05552584a22e53aaffc2e50768f0bd8e8a0ac8180bbae9c16fb980f1aa5329d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::enter_node (cyclomatic 41): Walk::enter_node 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0952128aaad698c8b91ec5d897da74ff25bb8d51ec43646584d9e05c14e9c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Project::check (cyclomatic 40): Project::check has cyclomatic complexity 40 (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":"rust/crates/cpd/src/mcp/project.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"7485459c38080e7d7b27ef78e9eb1e8fdf771b0b7b4182463dd5cfe784336cc2"}},{"ruleId":"D1","level":"warning","message":{"text":"Options::from_cli_and_config (cyclomatic 40): Options::from_cli_and_config has cyclomatic complexity 40 (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":"rust/crates/cpd/src/options.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6030b17e093603ad89efbcac2f21a5eafb2b18ff6fba5527f4ae119063c00ee6"}},{"ruleId":"D1","level":"warning","message":{"text":"jscpd::load_options (cyclomatic 32): jscpd::load_options has cyclomatic complexity 32 (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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac15d24655d76219152452b8c1a53b899452f9c348101f2992ce545199d1ffb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::notification (cyclomatic 29): Server::notification 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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51bc4e13dd7995a63fef6fcbf9389d267b1afdb18276a56fefe5e1a0e55192c"}},{"ruleId":"D1","level":"warning","message":{"text":"Grammar::units (cyclomatic 27): Grammar::units has cyclomatic complexity 27 (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":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8a6fea33360915863d56d7f3a77721e70f519cd970ee81e4c539b326b208c9"}},{"ruleId":"D1","level":"warning","message":{"text":"FilePreparer::prepare (cyclomatic 26): FilePreparer::prepare 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":"rust/crates/cpd-finder/src/orchestrate.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5304928e99b4447155fa8fa17ca807a260f8d07ea4534c13c1d0616fc46be4"}},{"ruleId":"D1","level":"warning","message":{"text":"page.html.buildView (cyclomatic 26): page.html.buildView 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b1792e4b5ba979165bffa6eb69eef2ba0daecf98f0424def2eb698578a2f57"}},{"ruleId":"D1","level":"warning","message":{"text":"page.html.renderTable (cyclomatic 26): page.html.renderTable has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f977f9530466baa29ac4aa5b5d749495a95fdd89fcd1bdfff366caa9e0a1ee"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_semantic::compare::compare (cyclomatic 24): cpd_semantic::compare::compare 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":"rust/crates/cpd-semantic/src/compare.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366ac78cd93696176f801d946ad0b3675d1291469a65b6ec26f948b95b3236e"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_semantic::extract::scan_rust_functions (cyclomatic 24): cpd_semantic::extract::scan_rust_functions 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":"rust/crates/cpd-semantic/src/extract/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed1ecae245c1fa415b212ffd2855a6c7530a5040ce838f24919c61205c32073"}},{"ruleId":"D1","level":"warning","message":{"text":"page.html.layout (cyclomatic 24): page.html.layout has cyclomatic complexity 24 (threshold 15). Of this number, 21 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"322f954191587bd788d197f45c0e354a66138cf94c7a349cb0f4c8ba7968f26d"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph::symbol_reachability (cyclomatic 23): Graph::symbol_reachability has cyclomatic complexity 23 (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":"rust/crates/basta/src/graph.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee46d87576b19c79641b7998d23c39e6b4f864f52311ba607f6297b8dc5bdab2"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::next (cyclomatic 23): Reader::next has cyclomatic complexity 23 (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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e78a4fde1008fce1e106971320294df0ae79a31840e00a7e9ec6085b0777bec"}},{"ruleId":"D1","level":"warning","message":{"text":"basta::cli::resolve (cyclomatic 22): basta::cli::resolve has cyclomatic complexity 22 (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":"rust/crates/basta/src/cli.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d1522bca5e0f58597c84f6cf0f05cc2a9e6ccacb723d5d28f9a7fdd9456492"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_tokenizer::razor::extract_razor_blocks (cyclomatic 22): cpd_tokenizer::razor::extract_razor_blocks 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":"rust/crates/cpd-tokenizer/src/razor.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b263dc28298a385469af547b2e46a483ce741614d90c2cfad84884a8f9a8ee"}},{"ruleId":"D1","level":"warning","message":{"text":"basta::rustc::item_end (cyclomatic 21): basta::rustc::item_end 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":"rust/crates/basta/src/rustc.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa948ec7e3b8a995b464e231cfcaf4579d340d8e05a138ea46b20a417b88968"}},{"ruleId":"D1","level":"warning","message":{"text":"page.html.drawLabels (cyclomatic 21): page.html.drawLabels 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, 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5956b85937d1734c5788292920c1f10f2af62b4b1bf60592a6df6994398358"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_core::summary::scan_complexity (cyclomatic 20): cpd_core::summary::scan_complexity 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":"rust/crates/cpd-core/src/summary.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37f4f7aedcb5192c2bb1e7f2a83c91a3de4a703edd19f6e2e0e5bfe8b63b82b"}},{"ruleId":"D1","level":"warning","message":{"text":"jscpd::complexity::run (cyclomatic 19): jscpd::complexity::run 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":"rust/crates/cpd/src/complexity.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77d251462c9bf6cb66d6e37c9c009fc71a8e9b18ea08fd10df60ef499951b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"jscpd::dashboard::run_reporters (cyclomatic 19): jscpd::dashboard::run_reporters has cyclomatic complexity 19 (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":"rust/crates/cpd/src/dashboard.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92e84e62c838e0278d4c6c09e5bbafd9058eff7a2e42716fe66b2b866083500"}},{"ruleId":"D1","level":"warning","message":{"text":"jscpd::run_cli (cyclomatic 19): jscpd::run_cli 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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f748694534ce19d51f05737746328e88e19892d9163fdf4414556311ff48d3"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_finder::walker::walk_one (cyclomatic 19): cpd_finder::walker::walk_one has cyclomatic complexity 19 (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":"rust/crates/cpd-finder/src/walker.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"209f6207be79b98c3423aedf111f493786f10843162a26a4c50aff3337e8317a"}},{"ruleId":"D1","level":"warning","message":{"text":"SarifReporter::report (cyclomatic 19): SarifReporter::report 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":"rust/crates/cpd-reporter/src/sarif.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c50406bf60148f5d25f82cc736b9e87efdf60bd4937d5e9b8706161a80e1cc"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_similarity::clojure::normalize (cyclomatic 19): cpd_similarity::clojure::normalize has cyclomatic complexity 19 (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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b80733230a543f5171a19fb9ee6ce8976264be3e237bc2723e9ebcbc51e0d1"}},{"ruleId":"D1","level":"warning","message":{"text":"basta::entry::script_mentions (cyclomatic 18): basta::entry::script_mentions 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":"rust/crates/basta/src/entry.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7178f3ca76703847200020efeb6dd077041138d4fbef5bda3142770544a418"}},{"ruleId":"D1","level":"warning","message":{"text":"basta::lang::sfc::scan_expression (cyclomatic 18): basta::lang::sfc::scan_expression 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":"rust/crates/basta/src/lang/sfc.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"734f57071025e8fce716087b2c80711c27fbc8f8034ca719330eae264cec74c2"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_semantic::extract::skip_rust_literal (cyclomatic 18): cpd_semantic::extract::skip_rust_literal 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":"rust/crates/cpd-semantic/src/extract/mod.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"492e033902e46502669df559db8072571d951c122d9f7c19f4075f305d73cbeb"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::visit_expr (cyclomatic 17): Walk::visit_expr 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":"rust/crates/basta/src/lang/python.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc10c16f266ecfbd2040a5a2975523da8fe5a5973fe1c2c1dd9e61a6af20b51"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::load (cyclomatic 17): Server::load has cyclomatic complexity 17 (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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f056040ada333e74e58e77e01313fc5e9474b2d35796341272d7638eff571d"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_core::health::validate (cyclomatic 17): cpd_core::health::validate 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":"rust/crates/cpd-core/src/health.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f11949961afdbaad2166bc18335c327ee157a113f3a7608fa1d2d057a96f8"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_finder::walker::ignored_by_files (cyclomatic 17): cpd_finder::walker::ignored_by_files 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":"rust/crates/cpd-finder/src/walker.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"329219d293843367cb890998165583bcb427fe2b821c0b459aa89efd1b54597f"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_similarity::syntax::script_wrapper (cyclomatic 17): cpd_similarity::syntax::script_wrapper has cyclomatic complexity 17 (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: cpd_similarity::syntax::space_of (cyclomatic 22) 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 function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"39953cc00c7cb8da2b80194cbc74115d1accb158e7d8a6018d2edb219450b9be"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_tokenizer::tokenizer::mark_annotations (cyclomatic 17): cpd_tokenizer::tokenizer::mark_annotations has cyclomatic complexity 17 (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":"rust/crates/cpd-tokenizer/src/tokenizer.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e060e7609df60822141b1403aed9066d005d5f3f1e82e65adc3e130ee1c6a18"}},{"ruleId":"D1","level":"warning","message":{"text":"page.html.renderFolders (cyclomatic 17): page.html.renderFolders has cyclomatic complexity 17 (threshold 15). Of this number, 15 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd82180d24d4d68a943be157b42c292d0b7c7b826c55a59a94c8cd23ff0b2ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Section::console (cyclomatic 16): Section::console 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe82d491826a4ff8759dcb9f3e4457ed0df4345666cbb80675854284c0d9b03"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_core::detect::detect_in_group (cyclomatic 16): cpd_core::detect::detect_in_group 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":"rust/crates/cpd-core/src/detect.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afc4f9b7783bed7f3867b55fe600b2a430aa07532d6ebd5557ae0ac6ae17d13"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_reporter::history_render::print_table (cyclomatic 16): cpd_reporter::history_render::print_table has cyclomatic complexity 16 (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":"rust/crates/cpd-reporter/src/history_render.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7335a3d1642c6bce36bfe36ca4ed8856ceb38a6b83e2dda200c0ec8ff76301"}},{"ruleId":"D1","level":"warning","message":{"text":"Cached::embed (cyclomatic 16): Cached::embed 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":"rust/crates/cpd-semantic/src/embed/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"00434eaf39d418e760c25bedb4850d0dfb4f736676076d8f1ee4c3ff59346f7a"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_semantic::extract::script::test_call (cyclomatic 16): cpd_semantic::extract::script::test_call has cyclomatic complexity 16 (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":"rust/crates/cpd-semantic/src/extract/script.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0590074a520ef2e6242af93730cb41ca7e14582ffd89f3654dfc33d0172bedd"}},{"ruleId":"D1","level":"warning","message":{"text":"cpd_semantic::search::call_pairs (cyclomatic 16): cpd_semantic::search::call_pairs 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":"rust/crates/cpd-semantic/src/search.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f905d6031de3f8e8ffc2361be6d5d8ae9b1be19910f88668cb803f25974da7"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::read (cyclomatic 16): Reader::read has cyclomatic complexity 16 (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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d863ad1981caa4ac1789caa83c23a588e64cdbf9528c47f87040e92a81758784"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::check (cognitive 53): Project::check has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 14 (23 pts), loops 5 (13 pts), if/else 8 (9 pts), boolean chains 8 (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":"rust/crates/cpd/src/mcp/project.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"4827d79db217354c1847d2c80d1f52368abaeab0ee240b0dbe747aae31a9413b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::enter_node (cognitive 50): Walk::enter_node has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 5 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 25). 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24b629b9053f0baae80dffaf30ecd4ef356fd5d3ebe754c6e07288275b01a50"}},{"ruleId":"D2","level":"warning","message":{"text":"FilePreparer::prepare (cognitive 49): FilePreparer::prepare has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (7 pts), boolean chains 5, match/switch 2 (3 pts) (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":"rust/crates/cpd-finder/src/orchestrate.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbc2e2f474d7b2416484cf4323236c4c0f27198cca03ee7fcd2265247030b18"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_tokenizer::razor::extract_razor_blocks (cognitive 48): cpd_tokenizer::razor::extract_razor_blocks has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (35 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 27). 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":"rust/crates/cpd-tokenizer/src/razor.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf859c91154550803afaf17f26fa3ba605794e91f8c28582120fa8213a9de89"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::lsp::project::cli_as_defaults (cognitive 47): jscpd::lsp::project::cli_as_defaults has cognitive complexity 47 (threshold 15). Drivers by points: if/else 45 (47 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":"rust/crates/cpd/src/lsp/project.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c2e4d672cd0fb53d88388cfdf4a431939466c46ebbc7521becfc08658b4975"}},{"ruleId":"D2","level":"warning","message":{"text":"page.html.buildView (cognitive 47): page.html.buildView has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 7 (10 pts), boolean chains 3 (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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab331fb977506b462dace065609a9b54d6ae89f78d14f6754f949beefe32ad59"}},{"ruleId":"D2","level":"warning","message":{"text":"page.html.layout (cognitive 47): page.html.layout has cognitive complexity 47 (threshold 15). Drivers by points: loops 11 (21 pts), if/else 3 (15 pts), ternaries 4 (7 pts), boolean chains 4 (nesting depth added 25). Of this number, 44 points are the body\u0027s own statements and 3 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f04883785beab76d0189bad1f8d4ad8ca57683a634a161ae8b2deae43b5ae05"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::notification (cognitive 46): Server::notification has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 24). 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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"0494ceb0e10e24a91257de0cf59574441cf2f4d512860a97b68c544973c78551"}},{"ruleId":"D2","level":"warning","message":{"text":"Options::from_cli_and_config (cognitive 45): Options::from_cli_and_config has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 23, if/else 18, match/switch 4. 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":"rust/crates/cpd/src/options.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf596257e4616f97130e35e8d61fbdae8a804e3845588804b5b43567ef7befc3"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::entry::script_mentions (cognitive 40): basta::entry::script_mentions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 6 (12 pts), match/switch 1 (3 pts), boolean chains 2 (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":"rust/crates/basta/src/entry.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"121c870e12130209010037b05b2e18f559a89e243671b6bfd31dbbc2250360fc"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::compare::compare (cognitive 40): cpd_semantic::compare::compare has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 9 (14 pts), boolean chains 7 (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":"rust/crates/cpd-semantic/src/compare.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"68712f903ab5b99c5337221d9a2731ac2151ca98c83ae4262bd609cca6247e67"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::extract::scan_rust_functions (cognitive 37): cpd_semantic::extract::scan_rust_functions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 5, match/switch 1 (2 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":"rust/crates/cpd-semantic/src/extract/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f93a099c24b9c2378f8451233e68a677c253d4ad3e6e49749b98a6d8190da62"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_core::detect::detect_in_group (cognitive 35): cpd_core::detect::detect_in_group has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 20). 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":"rust/crates/cpd-core/src/detect.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf952a2e2fb36d07f02454d6ca069114bce4caec2f1dbadaa23491092b467130"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::load_options (cognitive 34): jscpd::load_options has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 14, match/switch 2 (4 pts), 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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"860ab852e8b3034a5f709358de18b7951f8f133ab153ee57c7d45362715f2da5"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_finder::walker::ignored_by_files (cognitive 34): cpd_finder::walker::ignored_by_files has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (6 pts), boolean chains 4 (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":"rust/crates/cpd-finder/src/walker.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"414998f88443ccc4d33cc4177183cb7144e2b6a63ce2096ac9742f0c67a2f34e"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_similarity::clojure::normalize (cognitive 34): cpd_similarity::clojure::normalize has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 6 (20 pts), loops 3 (9 pts), if/else 1 (3 pts), boolean chains 2 (nesting depth added 22). 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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1648a1886fae051535efd739420f1a1661378abc9c3571d0f0b7450c844a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::symbol_reachability (cognitive 33): Graph::symbol_reachability has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 8 (12 pts), boolean chains 6, match/switch 2 (3 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":"rust/crates/basta/src/graph.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0796b3ceb318d184d8fedb138f115ecb98d87e79c6511b1424245780a828d778"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::cli::parse_cross_formats (cognitive 33): jscpd::cli::parse_cross_formats has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 6 (13 pts), match/switch 1 (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":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b97337ecaf4fe1409cf6b56502e59797f9964c49265e41939896be969dae260"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::lang::sfc::scan_expression (cognitive 32): basta::lang::sfc::scan_expression has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 3 (6 pts) (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":"rust/crates/basta/src/lang/sfc.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcff0605a490eefe2f31f6241ac605e033424d3a78991cc060f0aa76bfc99b2"}},{"ruleId":"D2","level":"warning","message":{"text":"page.html.renderTable (cognitive 32): page.html.renderTable has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 6 (10 pts), boolean chains 3, loops 3 (nesting depth added 12). Of this number, 27 points are the body\u0027s own statements and 5 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0bcc4783486e8ce137ad482351dedff12b4bc5c524cd5b7e8ea9abc4a5e04a"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_tokenizer::tokenizer::mark_annotations (cognitive 30): cpd_tokenizer::tokenizer::mark_annotations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (10 pts), boolean chains 5, match/switch 1 (4 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":"rust/crates/cpd-tokenizer/src/tokenizer.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"be38b71c48ceea5b68b923da8c0f0582a3becb8845b5d26cb5b327b3c81dbd7d"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::rustc::item_end (cognitive 29): basta::rustc::item_end has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (5 pts), boolean chains 2, loops 2 (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":"rust/crates/basta/src/rustc.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c302ea0dc01c9a5e3117258ff91e9070bbaebfbc30f0ea3afc14f22dd31209d"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::load (cognitive 29): Server::load has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (12 pts), loops 6 (9 pts), if/else 4 (7 pts), boolean chains 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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"167aa69687a0d849b30d6db813283e684a2013184e80d68cfea57a414d9068a2"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_core::detect::add_secondary_clones (cognitive 28): cpd_core::detect::add_secondary_clones has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (7 pts), match/switch 2 (4 pts), boolean chains 2 (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":"rust/crates/cpd-core/src/detect.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0cac521f0c2866803e831ab7f7925d3b4fe60a460333cd137527163b731655"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_core::summary::scan_complexity (cognitive 28): cpd_core::summary::scan_complexity has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (6 pts), boolean chains 3, loops 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":"rust/crates/cpd-core/src/summary.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ff284f728434ef6d792f56d65fd72e69ecd86842f84a947781e4fc9dae9bba"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::next (cognitive 28): Reader::next has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 4 (11 pts), loops 1 (nesting depth added 17). 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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ac220a9548acc4a32545e4946cddc0996c9871674020915fbe285bd323800e"}},{"ruleId":"D2","level":"warning","message":{"text":"page.html.drawLabels (cognitive 28): page.html.drawLabels has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 3 (7 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 12). Of this number, 26 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a27e5a16b63932e65c01db4daa0f9b19fbee6d0ba519f25884699e0797e65"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::job_done (cognitive 27): Server::job_done has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 14). 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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b141124b05aba49e7ce1433837f901161688526111980a225cc5ce1aa79533b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::visit_expr (cognitive 26): Walk::visit_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 15). 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":"rust/crates/basta/src/lang/python.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efb9bd19623ede3997db115a1c67c4b981a7366dffffc595fc2c3f188928a29"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::cli::resolve (cognitive 26): basta::cli::resolve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 6 (9 pts), boolean chains 5, loops 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":"rust/crates/basta/src/cli.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4e7d423f057554bc8c0be0ecd3be1bffb2a8de5d6858c2cb9d421537638d83"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::search::call_pairs (cognitive 26): cpd_semantic::search::call_pairs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (8 pts), boolean chains 5 (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":"rust/crates/cpd-semantic/src/search.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d83c17b005cd58b720e57704bfd2a3505f86608002c3cf6959693c9b728289"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_similarity::join::pairs (cognitive 26): cpd_similarity::join::pairs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (11 pts), boolean chains 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":"rust/crates/cpd-similarity/src/join.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab1564d00ff26e1144a5dec89fac0cfde5b7813ad0390ee9fea52469ff79537"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_tokenizer::javascript::fallback::tokenize (cognitive 26): cpd_tokenizer::javascript::fallback::tokenize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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":"rust/crates/cpd-tokenizer/src/javascript.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2eb97f57003f7dbee017097eff66b2566d35f1e2ad4d5460abff06b417e739"}},{"ruleId":"D2","level":"warning","message":{"text":"page.html.tipLines (cognitive 26): page.html.tipLines has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 4 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). Of this number, 25 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f75f1d785fea4a01dd04cb380117ef444cedb03c69339c062ac0c24ce0722b"}},{"ruleId":"D2","level":"warning","message":{"text":"page.html.renderFolders (cognitive 26): page.html.renderFolders has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 13). Of this number, 25 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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfebd405781de4e7c88e3f7a64d65678fdfe980007c9bcab9e149e6201d45768"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_reporter::dashboard::render_markdown (cognitive 25): cpd_reporter::dashboard::render_markdown has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 7 (9 pts), match/switch 2 (5 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. This shape REPEATS in the file: one other method here (cpd_reporter::dashboard::render_html) 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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bdd922ac6d35c033a6b8f6bb95c1ad68a6c97d8fdc1575136ae57a50be0ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_reporter::dashboard::render_html (cognitive 25): cpd_reporter::dashboard::render_html has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 7 (9 pts), match/switch 2 (5 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. This shape REPEATS in the file: one other method here (cpd_reporter::dashboard::render_markdown) 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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bc83c5ac00671607a2cd848ff3c1768decef604b86616f64868a923a874268"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::compare::call_graph (cognitive 25): cpd_semantic::compare::call_graph has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 3 (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":"rust/crates/cpd-semantic/src/compare.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"738b8ffa15b8f68537144ef44baac20ee79c0db55b574166a27574dede574599"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::extract::skip_rust_literal (cognitive 25): cpd_semantic::extract::skip_rust_literal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, loops 3 (5 pts), match/switch 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":"rust/crates/cpd-semantic/src/extract/mod.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"462a585daf2ed8315c48cf0a5d81a91480a70ea8bc8719f624a93d0ee81975c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::read (cognitive 25): Reader::read has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 3 (11 pts), loops 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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31dc2d8f04d1958dd3e4868fff7aa1834c724f26662857ac3d7322a1a6c142"}},{"ruleId":"D2","level":"warning","message":{"text":"SarifReporter::report (cognitive 24): SarifReporter::report has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, loops 1, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-reporter/src/sarif.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8871467b07fffbde5b7f27fb6f41ef7c80aab9dec966fc5cc84ccc6fd39b5c43"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::search::matched_pairs (cognitive 24): cpd_semantic::search::matched_pairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (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":"rust/crates/cpd-semantic/src/search.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"733efa4c66f8d25a92537270453c7e4a3e051a00dee806e9c9b9bfe6996dd0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::analyze::run_keeping (cognitive 22): basta::analyze::run_keeping has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 3, match/switch 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":"rust/crates/basta/src/analyze.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2f743e8d285b04bb0ad18142f6a2c76a8fdf3930a2b1d8234b9f0503414a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Section::console (cognitive 22): Section::console has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 5 (7 pts), match/switch 3 (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":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab352f595f7de566fdcb0bcef20ee749ae376d5892147cafd01765bcd74d05ca"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::run_cli (cognitive 22): jscpd::run_cli has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 1 (2 pts), match/switch 1 (2 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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02640a2d003270fcb5e5781053c45c32288e51245b2c3b91b7661e9958be2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Cached::embed (cognitive 22): Cached::embed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 1, match/switch 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":"rust/crates/cpd-semantic/src/embed/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a45daed9a4e28b68c2aa112ae1713aeaa9dc9f552dff476e415c234b7301fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_similarity::clojure::forms (cognitive 22): cpd_similarity::clojure::forms has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (5 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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"23164f53603e1d4881b0785b63b61edfdbf6d35d02459f414f804f58901827a1"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::classify::findings (cognitive 21): basta::classify::findings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (3 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":"rust/crates/basta/src/classify.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d803654a471f3c05a2d79eb2e2e165cbabb364f7fc85a7dc5b281b0bf23ba1f2"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::lang::sfc::split (cognitive 21): basta::lang::sfc::split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 1 (3 pts), 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":"rust/crates/basta/src/lang/sfc.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2113c5b7048876dbb99104c9f2b010a70c4183f85c72930d40010d1373b4777"}},{"ruleId":"D2","level":"warning","message":{"text":"Section::new (cognitive 21): Section::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, boolean chains 2, match/switch 1 (2 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":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c7a8b4659b84fc8f33c0289929e63cc652010b33e834ed42428fa1ecc57184"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_finder::walker::walk_one (cognitive 21): cpd_finder::walker::walk_one has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, match/switch 4 (5 pts) (nesting depth added 2). 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":"rust/crates/cpd-finder/src/walker.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de922b5fe0ca5446128714638384753f7374b52bf65c6af745a70a8dd5e4a54"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::lang::javascript::strip_comments (cognitive 20): basta::lang::javascript::strip_comments has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b007678ec79d62ca465b587ae79cca1aef26f94728b5aa6cb95cf6d4b744d98"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::lang::javascript::collect_imports (cognitive 20): basta::lang::javascript::collect_imports has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 5, if/else 2 (4 pts), boolean chains 1 (nesting depth added 8). 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c3af9a434f213993eff6df49508cd0bcf4f2691c1b5377c7fc78f894f0966c"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::files_changed (cognitive 20): Server::files_changed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3, 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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0a6f903e84d6d98a6a086a1556f375c676ecb17ab5de5361eaf0f8057afcb5"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::lsp::complexity::complexity_findings (cognitive 20): jscpd::lsp::complexity::complexity_findings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (4 pts) (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":"rust/crates/cpd/src/lsp/complexity.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1f0ab04571250eefb513d9b09e5382142c711283d7e9374dd4726c0e92891a"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_finder::blame::blame_file (cognitive 20): cpd_finder::blame::blame_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, 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":"rust/crates/cpd-finder/src/blame.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cce672a9eeb2acfe06837964bdfeeb7546189d9e0055394ec301c118eaccb33"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::embed::cache::save (cognitive 20): cpd_semantic::embed::cache::save has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 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":"rust/crates/cpd-semantic/src/embed/cache.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe0003016c4e27dbbd436a2f948e4ee687f788f03f29b82036650c038020da9"}},{"ruleId":"D2","level":"warning","message":{"text":"Grammar::units (cognitive 20): Grammar::units has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (8 pts), match/switch 1 (nesting depth added 4). 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":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f1feadb186b95b4f1e3a40674ab0a014e432847dcfbd99d9a52d4e95780cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::find_rewrites (cognitive 19): Checker::find_rewrites has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (9 pts), match/switch 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":"rust/crates/cpd/src/boundaries/check.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bd5b6cce7cd292de28dadb52291741ca132bb80af9228c12536b2b696979ec"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::cli::normalize_v4_config (cognitive 19): jscpd::cli::normalize_v4_config has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 4 (6 pts), loops 4, 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":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb4050d8a0e3d2ea998fa1d23ada37702e61f43a8b6c27bb93a0d5ee716dbc1"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::search::called_names (cognitive 19): cpd_semantic::search::called_names has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 3 (5 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":"rust/crates/cpd-semantic/src/search.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd288d89c1a963cba4d43e50f3065d4d456dab2d93990a38233a8698354b6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::search::covered_pairs (cognitive 19): cpd_semantic::search::covered_pairs has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-semantic/src/search.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"0025f43664532521818c07722bc1a54151976883b4d8316ffda60f7f0a1d92e3"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_tokenizer::generic::tokenize_line_content (cognitive 19): cpd_tokenizer::generic::tokenize_line_content has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, 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":"rust/crates/cpd-tokenizer/src/generic.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee24e48b8fa9af061f826b34acc7a36065f221200a3f9cb26a7fb985c3534b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Framework::root (cognitive 18): Framework::root has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (6 pts), match/switch 2, 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":"rust/crates/basta/src/framework.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47a334fe2ee5c95640cc939c8f186bc65bcd41f651eb4fd278eeef82600dd3e"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::complexity::run (cognitive 18): jscpd::complexity::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (2 pts), loops 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":"rust/crates/cpd/src/complexity.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c2db31430a7bd506f33ae0a581f2232f54590582d6be2552a12e768ebde887"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::lsp::findings::clone_findings (cognitive 18): jscpd::lsp::findings::clone_findings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 pts), loops 2 (3 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":"rust/crates/cpd/src/lsp/findings.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"331b66ecbb936a944f44be2954c4b8148eff2debde7f121c00042748d13b1cee"}},{"ruleId":"D2","level":"warning","message":{"text":"Normalizer::assemble (cognitive 18): Normalizer::assemble has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 7). 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":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c72338f946b26e7b97dd25f72aac66817313a40932dd104ae452c65b8dd8faa"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::commonjs_declarator (cognitive 17): Walk::commonjs_declarator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (7 pts), loops 1 (2 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61cfba5a23ef6dcaac50f811bfd8665ab4df689cc968b8738596fe225b98abd"}},{"ruleId":"D2","level":"warning","message":{"text":"basta::classify::category_for (cognitive 17): basta::classify::category_for has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (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":"rust/crates/basta/src/classify.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace0435f8cefcdde8e4717bc427b19ca3a8904bc3bf5100e1ff55e67a1d3aec3"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_core::health::validate (cognitive 17): cpd_core::health::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2, match/switch 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-core/src/health.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"865bc827c50ade7f9c584ffbe1922268fe8c734d8dc868acf4bc3ad458745a82"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_finder::blame::enrich (cognitive 17): cpd_finder::blame::enrich has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 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":"rust/crates/cpd-finder/src/blame.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"091843f8c8efbdb4c9332179b8c8fd89d5a6761a71fa50e4697632a6b81d53d3"}},{"ruleId":"D2","level":"warning","message":{"text":"SimilarityIndex::group_edges (cognitive 17): SimilarityIndex::group_edges has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (13 pts), match/switch 2 (3 pts), if/else 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-similarity/src/lib.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d30cc88782f26864249e79d92b06161379eaa08634e534a80970e69e1a3fc9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Normalizer::leaf (cognitive 17): Normalizer::leaf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 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":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c9e617df6f12eac03660d7a989c8ac6486632fefa3adbea37bceb39f5b1346"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_similarity::syntax::script_wrapper (cognitive 17): cpd_similarity::syntax::script_wrapper has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6, loops 2, match/switch 1 (2 pts) (nesting depth added 1). 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":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"386529a1871dc79439b949b1744e5264ca6b0033c4e8a5718fe1d154a418ff76"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_similarity::syntax::name_spaces (cognitive 17): cpd_similarity::syntax::name_spaces has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 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":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1aada3b8e42b73e89c5f9075ff461810fbec90802ff64127a0abc6b5c86c05"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_tokenizer::markdown::tokenize_markdown (cognitive 17): cpd_tokenizer::markdown::tokenize_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 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":"rust/crates/cpd-tokenizer/src/markdown.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31e9f6932c70f1828e96d510873e6ff642173146e9cea7eb6c1a8d5eca0f061"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_tokenizer::markdown::extract_fences (cognitive 17): cpd_tokenizer::markdown::extract_fences has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"rust/crates/cpd-tokenizer/src/markdown.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"278ecbe4e65db219a0173d62d74fec520b46d93d782a78624150bec1a7d3a22b"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_tokenizer::tokenizer::push_token (cognitive 17): cpd_tokenizer::tokenizer::push_token has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 7). 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":"rust/crates/cpd-tokenizer/src/tokenizer.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"db43456cffd1f338688337c6497870c710ee8ae7b4e2bf04915866933b4e5467"}},{"ruleId":"D2","level":"warning","message":{"text":"Section::markdown (cognitive 16): Section::markdown has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 3 (6 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dba57127fc7809e95782dfc8cbe11e1004b304ae2078d7ab0e52a2846d5056"}},{"ruleId":"D2","level":"warning","message":{"text":"jscpd::dead_code::config_noting (cognitive 16): jscpd::dead_code::config_noting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (4 pts), loops 2 (3 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":"rust/crates/cpd/src/dead_code.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbffa66bd37d33925a49c5410991143df0d4a5bb215f2299185040946bcbfaa7"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_reporter::history_render::render_chart_on (cognitive 16): cpd_reporter::history_render::render_chart_on has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (5 pts), boolean chains 1, match/switch 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":"rust/crates/cpd-reporter/src/history_render.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a11f44c45d05bcbea82734623b4fdbd139e8aae53181f1dd01bea172c11db4"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_reporter::history_render::print_table (cognitive 16): cpd_reporter::history_render::print_table has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (6 pts), if/else 3 (4 pts), loops 3 (4 pts), boolean chains 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":"rust/crates/cpd-reporter/src/history_render.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20438e86c2bec03c81461fd18e0b6a13d9a89e19abee25d11b947357112aeea"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSitterExtractor::extract (cognitive 16): TreeSitterExtractor::extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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":"rust/crates/cpd-semantic/src/extract/grammars.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce11ca4817c3870060945e4adfc31f4dbbc05c833aa89442edf049dc176814a"}},{"ruleId":"D2","level":"warning","message":{"text":"cpd_semantic::extract::grammars::code_start (cognitive 16): cpd_semantic::extract::grammars::code_start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 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":"rust/crates/cpd-semantic/src/extract/grammars.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ab512d3146fc750b5304d63e4b75a5811e6363a3e96158006637753d8065ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SimilarityIndex::query_clones (cognitive 16): SimilarityIndex::query_clones has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 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":"rust/crates/cpd-similarity/src/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b3b00f2cca577d223f6ea5412b2d544ba5086f25c2d4e6db22630e8ebbbfe2"}},{"ruleId":"D2","level":"warning","message":{"text":"page.html.table (cognitive 16): page.html.table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). 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 items inside it that branch (fill, a function literal at line 1499, a function literal at line 1474, \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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1381fadd961d8a15d77426163940b91ffe793cb8190f7e6f147571521e86e557"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lang/javascript.rs: FileTooLong \u2014 1618 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), declaring 66 free functions. The bar is 500 significant lines; this is 1118 over it, 3.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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55e50f785d50811611a4679261a43c797f7f6bd030ca80fad83fca65448b83a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Cli: TooManyFields \u2014 83 stored fields beside 1 method. The bar is 30 stored fields; this is 53 over it, 2.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf0f8bb82ed793e6458a773afeeb29f33a41efdadf5d3e63a920e31e3fd0796"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compare/page.html: FileTooLong \u2014 1247 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 747 over it, 2.49\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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53817fb8d4a3ae367085798e45708630b0886f7f24d2656b870d99209c76d430"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Server: ClassTooLong \u2014 997 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), 44 methods, 2 blocks, lines 132-1723. The bar is 400 significant lines; this is 597 over it, 2.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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4e4c3f832758f2c91b0e0fc2221f73a13b5f9c4289d0d518cf6b586bab8bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Options.from_cli_and_config: MethodTooLong \u2014 from_cli_and_config runs 249 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 149 over it, 2.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":"rust/crates/cpd/src/options.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e831ef057ad321d7981be070d6d6a5345df1f6d357894e21848f75765d2d53a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/server.rs: FileTooLong \u2014 1223 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), about 82% of them inside a single declaration: Server (2 blocks, 132-1723). The bar is 500 significant lines; this is 723 over it, 2.45\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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c79f51ed01e9341fc4f88df55f0e931eb29fc44ee29ac7cee519151fbb0629"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Project.check: MethodTooLong \u2014 check runs 237 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 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":"rust/crates/cpd/src/mcp/project.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af026d04bbbac4605e0f7060846daf2ef4f41f4ae8bab51940c11fd359ab42e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Options: TooManyFields \u2014 68 stored fields beside 1 method. The bar is 30 stored fields; this is 38 over it, 2.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/options.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f674bafe6e6804342cbde05e90a3ae32b0113f54ec6e91cd5af71f20d1cfff6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/syntax.rs: FileTooLong \u2014 1091 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). The bar is 500 significant lines; this is 591 over it, 2.18\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":"rust/crates/cpd-similarity/src/syntax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"666355a140cfaaea73be150a57a8aa310bc1820645dffe8cf090924ff049320a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/detect.rs: FileTooLong \u2014 1012 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), declaring 35 free functions. The bar is 500 significant lines; this is 512 over it, 2.02\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":"rust/crates/cpd-core/src/detect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9967f7db9ef4457e1fa35ee0e1fe03ff0d42cf417ea01d8ce4a2ed54071a96de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli.rs: FileTooLong \u2014 1007 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). The bar is 500 significant lines; this is 507 over it, 2.01\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":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f3e200cda0e2a50fab4ebaf14d1fe63cb17fde860fd344456b2cb70cc5310d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1007 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), declaring 41 free functions. The bar is 500 significant lines; this is 507 over it, 2.01\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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c7e79941a2832c74bceff0c88f10cbcffa0e4098a2a317f52574e95db27fc1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ConfigFile: TooManyFields \u2014 59 stored fields. The bar is 30 stored fields; this is 29 over it, 1.97\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98b30d5e9499716dbb97b3098689eb70344762375b32f0fad61f12253118981"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MergedConfig: TooManyFields \u2014 53 stored fields beside 1 method. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/main.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba8b3c944d4ae57d17b1bcadf69ee9206faaf88d49a707192f4067f321b07e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cpd_semantic::compare::compare: FunctionTooLong \u2014 cpd_semantic::compare::compare runs 160 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 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":"rust/crates/cpd-semantic/src/compare.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da4d29cdb0235eb93d09658e71f031b170b9398f21bb839f3bdc7160aa46596"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jscpd::detect_and_report: FunctionTooLong \u2014 jscpd::detect_and_report runs 151 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 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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31130df72461c6ed56162620bbad9ef515c9d8f514d2fe6e1e392bb4533b6e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/project.rs: FileTooLong \u2014 754 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), about 67% of them inside a single declaration: Project (2 blocks, 392-1150). The bar is 500 significant lines; this is 254 over it, 1.51\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":"rust/crates/cpd/src/mcp/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe525274d9722ebbdfd1c180a879947ae6b2a54c3fb6b68b7d24da94f9b8ed9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Server: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"41695841c273f200008fbe0e9f4ca9f72fe54b2623f671f1ad455ca7e08c6ade"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/search.rs: FileTooLong \u2014 700 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). The bar is 500 significant lines; this is 200 over it, 1.40\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":"rust/crates/cpd-semantic/src/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6764553e3dc8783770af49ac92d9b9b8b9731d819f9e08b7ce3a922b41b88d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilePreparer.prepare: MethodTooLong \u2014 prepare runs 137 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 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":"rust/crates/cpd-finder/src/orchestrate.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"db32579ac642b457e6a98625596186cd6b97fe3571c58d9ef08031ec593448fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lang/python.rs: FileTooLong \u2014 680 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). The bar is 500 significant lines; this is 180 over it, 1.36\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":"rust/crates/basta/src/lang/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65731f1dcb1a3505e1a475024d60be6c2df9a8aecc12a7132d14feb1a0a47945"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compare/mod.rs: FileTooLong \u2014 676 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). The bar is 500 significant lines; this is 176 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":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20a890dffdde20ac915754ba4d66b1c957ebdf3f9b4c0e6f9ae35bac0a1ae85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SarifReporter.report: MethodTooLong \u2014 report runs 126 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 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":"rust/crates/cpd-reporter/src/sarif.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16b5db88c964a11f19491924050a9f0584f8f9bcb3fb77f965c37466704438a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Project: ClassTooLong \u2014 503 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), 23 methods, 2 blocks, lines 392-1150. The bar is 400 significant lines; this is 103 over it, 1.26\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":"rust/crates/cpd/src/mcp/project.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1691304da4f855333df6bfc4123e75025aa933671c8ec6d9c12b27a44b47e83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cpd_reporter::dashboard::print_dashboard: FunctionTooLong \u2014 cpd_reporter::dashboard::print_dashboard runs 125 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 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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af52fc2889d800e6e45d278a055c1b3d07493b367c424f54a9910bb9aa1bcb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: basta::analyze::run_keeping: FunctionTooLong \u2014 basta::analyze::run_keeping runs 119 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 19 over it, 1.19\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":"rust/crates/basta/src/analyze.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"013d806acf5dbf2dc47527b53dee8d2083aa2b045e38e8b745ec1a0ec3f7bc3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dashboard.rs: FileTooLong \u2014 588 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). The bar is 500 significant lines; this is 88 over it, 1.18\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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcefeb867763495f9080c381c6f45665de5c3676fbee965b0a9f38b6feff5f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dashboard.view: MethodTooLong \u2014 view runs 117 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 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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d35ecece47433217a916ee2414ce0aedecdd3d5ee12ada80b8c255fa6f8dcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cpd_core::detect::detect_in_group: FunctionTooLong \u2014 cpd_core::detect::detect_in_group runs 114 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 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":"rust/crates/cpd-core/src/detect.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9572c7ad3bbb272eb0f0d407f2616052fe3ebe7ced5373131cbb7a56079f2f06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Section.new: MethodTooLong \u2014 new runs 111 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 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":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da064216c9215afcf6345e1ce5afef594fc8cc43bb23deef117da8bb36729fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/orchestrate.rs: FileTooLong \u2014 553 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). The bar is 500 significant lines; this is 53 over it, 1.11\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":"rust/crates/cpd-finder/src/orchestrate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bc3ca073cae892bac3262d4a913094d875fd3f6827a7f3b9b3dd6913b0dd69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: basta::cli::resolve: FunctionTooLong \u2014 basta::cli::resolve runs 108 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 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":"rust/crates/basta/src/cli.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3c5ec8c67092cc2e3e45ee0ce6b3c44a37aff2a5bb0aedd2a40361215b08f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lang/sfc.rs: FileTooLong \u2014 529 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). The bar is 500 significant lines; this is 29 over it, 1.06\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":"rust/crates/basta/src/lang/sfc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9302c03d9f2568ddee5403bd421642554751c253bf7d0140a27045401be1c0b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 528 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). The bar is 500 significant lines; this is 28 over it, 1.06\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":"rust/crates/cpd-similarity/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c15ab748ebb78ae9204d452dab5d003b982e5f1c4a1d202809524effb9fe49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/history_render.rs: FileTooLong \u2014 522 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). The bar is 500 significant lines; this is 22 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":"rust/crates/cpd-reporter/src/history_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a82fe75b53910274b9591e7d5e1b099b6635379fda65b9da37b8b92c8d3d90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Section.console: MethodTooLong \u2014 console runs 104 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 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":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddd51d599615ae1f9bf4bc21c27de0271647f52a589a7e2f10c65ad37e1db50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: boundaries/check.rs: FileTooLong \u2014 514 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). The bar is 500 significant lines; this is 14 over it, 1.03\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":"rust/crates/cpd/src/boundaries/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb86094c03cfc497b173eff677f167a2cdb1d436fba642fa91d4e559e54bfec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cpd_reporter::dashboard::render_html: FunctionTooLong \u2014 cpd_reporter::dashboard::render_html runs 102 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 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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd18d6c7cafbbd765470fa0d9d7b65680281934a0b95f6f72d1287e5bd022ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jscpd::load_options: FunctionTooLong \u2014 jscpd::load_options runs 102 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 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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4626ad249aeeb339ba66801006c783e29660b4c6778e65108d414b664368b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): rust/crates/cpd-reporter/src/dashboard.rs:538-663 | rust/crates/cpd-reporter/src/dashboard.rs:667-803 \u2014 These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c5b2a1981c2adc0c77a64a59daddc702c8329c8f1a7812aeb5e3f0bc359133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): rust/crates/cpd-tokenizer/src/razor.rs:133-189 | rust/crates/cpd-tokenizer/src/sfc.rs:30-106 \u2014 These two members are one piece of code written twice and then edited apart: 57 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":"rust/crates/cpd-tokenizer/src/razor.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66c81fefd8cbebece7cabebe86f029ddc96a3538c52fb63b39a93830dff4380"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust/crates/cpd-reporter/src/deadcode/mod.rs:82-103 | rust/crates/cpd-reporter/src/reporter.rs:170-198 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"rust/crates/cpd-reporter/src/deadcode/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f14d0485ee06e110c692a98f225e4800b26749785a8e56a9ac17664816c7128"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust/crates/cpd-reporter/src/health_render.rs:218-251 | rust/crates/cpd-reporter/src/health_render.rs:265-314 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"rust/crates/cpd-reporter/src/health_render.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1f52a85bd1c4444b3164ff44ad9f75f438b22e98a8a5712e27b7d2c34d59b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): rust/crates/basta/src/analyze.rs:306-357 | rust/crates/basta/src/rustc.rs:148-189 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"rust/crates/basta/src/analyze.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"699c110e0795802c8d04c89e8a46fe5c9944dec040e9cfd0d1f258d8daf6c94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust/crates/basta/src/lang/javascript.rs:1521-1546 | rust/crates/basta/src/lang/javascript.rs:1572-1598 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac951a74c09ae09aff2918b969ddf5069fafa87033f3e7237f3475e8ecab1d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust/crates/cpd-semantic/src/embed/jina_bert.rs:29-56 | rust/crates/cpd-semantic/src/embed/nomic_bert.rs:30-76 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"rust/crates/cpd-semantic/src/embed/jina_bert.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb88118c2c596352e9b8ea2bfec785d9d79243a778f90aa82a3b48d175ca1fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust/crates/cpd-reporter/src/boundaries_render.rs:164-175 | rust/crates/cpd-reporter/src/boundaries_render.rs:189-199 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"rust/crates/cpd-reporter/src/boundaries_render.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce269300ce536700fe8a8d625d27085d283b3a1d925012c3715ddde2b1dc4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust/crates/cpd-semantic/src/embed/jina_bert.rs:168-184 | rust/crates/cpd-semantic/src/embed/nomic_bert.rs:160-176 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"rust/crates/cpd-semantic/src/embed/jina_bert.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"33863b9deb97d2d1d59d77de35e5d26831827b77ffe13cf28b2c1a5e020c727e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust/crates/basta/src/cli.rs:489-506 | rust/crates/cpd/src/cli.rs:42-58 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"rust/crates/basta/src/cli.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf072846fa3d99d067653cafdb24f12171ee18ed78b162b8fc2eaa3030dd285"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust/crates/cpd-reporter/src/summary_render.rs:137-165 | rust/crates/cpd-reporter/src/summary_render.rs:168-196 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"rust/crates/cpd-reporter/src/summary_render.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa97684e261589e8c910255711a8a4129ef22d3755ee09698d94dc4897b67f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust/crates/basta/src/lang/javascript.rs:740-759 | rust/crates/basta/src/lang/javascript.rs:762-782 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d918a206803dea68fc2cf9850169a19ee0ffc02b9f899280b84c82c9bbda18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/crates/cpd-semantic/src/embed/jina_bert.rs:209-222 | rust/crates/cpd-semantic/src/embed/nomic_bert.rs:196-207 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"rust/crates/cpd-semantic/src/embed/jina_bert.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4610d6c413623fae3cddd83b05615e78efc047c85c8698500a90bcd489be7466"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust/crates/cpd-tokenizer/src/ts_strip.rs:255-267 | rust/crates/cpd-tokenizer/src/ts_strip.rs:331-346 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"rust/crates/cpd-tokenizer/src/ts_strip.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f305af43e1d5691852528f8a67b24762649402264b8f1e3abc1bffd104a0b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rust/crates/basta/src/entry.rs:219-235 | rust/crates/cpd-finder/src/walker.rs:58-74 | rust/crates/cpd-finder/src/walker.rs:93-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/basta/src/entry.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"826935412fb709857b4feb83e78bbf0361c8aadb820b7ea3f505ce637e1cc6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/crates/cpd-tokenizer/src/markdown.rs:87-95 | rust/crates/cpd-tokenizer/src/markdown.rs:119-130 \u2014 These two members are one piece of code written twice and then edited apart: 9 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":"rust/crates/cpd-tokenizer/src/markdown.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f08e33e0dd1c649d9d05e87ef1c4955015949c8029b500403eee6484df64b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/crates/basta/src/lang/javascript.rs:702-711 | rust/crates/basta/src/lang/javascript.rs:1225-1236 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"6447d616a349d51dcad7b39a8eb4e5658186aa9b97ac2eaab85e68679f64b94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/crates/cpd-reporter/src/deadcode/console.rs:171-177 | rust/crates/cpd-reporter/src/deadcode/html.rs:126-133 \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":"rust/crates/cpd-reporter/src/deadcode/console.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"814e9850876a1ddd986bd9877d241d002056fd34c51057d427621b6c61b27f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/crates/cpd/src/cli.rs:1620-1629 | rust/crates/cpd/src/cli.rs:1655-1665 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a331e7b05b226fc0e2f339af4f91dfc6bbb3fd89ce1f4272180efcf7d06a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/crates/cpd-tokenizer/src/ts_strip.rs:195-210 | rust/crates/cpd-tokenizer/src/ts_strip.rs:212-223 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"rust/crates/cpd-tokenizer/src/ts_strip.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6663fee9594ce30a9589fb6ef9ff02695d66325bf3981872c8df1e3f1246ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/crates/cpd-finder/src/walker.rs:80-86 | rust/crates/cpd/src/boundaries/rules.rs:264-271 \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":"rust/crates/cpd-finder/src/walker.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"42094a9d83491f6a6dc704a300f068c62c2649941f61cb476321a3597e6715f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/crates/basta/src/lang/javascript.rs:1864-1873 | rust/crates/basta/src/lang/python.rs:644-654 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c745c3e01e02cdb022f5cca0c13f43c38ff400c4a96e761137137a0298b574b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/crates/cpd-reporter/src/csv_reporter.rs:13-24 | rust/crates/cpd-reporter/src/markdown_reporter.rs:13-26 \u2014 These two members are one piece of code written twice and then edited apart: 12 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":"rust/crates/cpd-reporter/src/csv_reporter.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1590538f089cc8d5369c6bd50805b93c820369e6d588341cfdaa9ee2ddc0ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/crates/cpd-reporter/src/console_full.rs:21-27 | rust/crates/cpd-reporter/src/json_reporter.rs:18-24 \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":"rust/crates/cpd-reporter/src/console_full.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e19c708a9a095c29b70a3d82478e8f13848727a34a297fd357c95b461508b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201327 lines \u00D7 2): rust/crates/basta/src/analyze.rs:307-333 | rust/crates/basta/src/rustc.rs:149-171 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/basta/src/analyze.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1d9947db64c5c4978f75995c209a135a9daef54ecc461de5f8ab61dda6e110"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/crates/cpd-reporter/src/dashboard.rs:628-638 | rust/crates/cpd-reporter/src/dashboard.rs:762-772 \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 \u0060rust/crates/cpd-reporter/src/dashboard.rs:628\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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"893b035dffda0bf961857a40a95ceb3a4c95d8cf9b5483308b5e3990e0cbcbdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/crates/cpd-reporter/src/xml_reporter.rs:118-127 | rust/crates/cpd-reporter/src/xml_reporter.rs:133-142 \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":"rust/crates/cpd-reporter/src/xml_reporter.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e14bc36a14d68c2ebf5165e5ca2682288738be9a26deb0a27fc7ad70614859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust/crates/cpd-reporter/src/health_render.rs:241-247 | rust/crates/cpd-reporter/src/health_render.rs:301-308 \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 \u0060rust/crates/cpd-reporter/src/health_render.rs:241\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. 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":"rust/crates/cpd-reporter/src/health_render.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6616569d7005b4373c866887d7e572f61935999bb76c67245a574dc1706c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/crates/cpd/src/cli.rs:1797-1805 | rust/crates/cpd/src/cli.rs:1808-1815 \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 \u0060rust/crates/cpd/src/cli.rs:1797\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. 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":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"c357cdb71fdb3e3bdc6c8b23bd2976372195c4326e3b024b1abfe6f01783d569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust/crates/cpd-reporter/src/dashboard.rs:643-648 | rust/crates/cpd-reporter/src/dashboard.rs:778-784 \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 \u0060rust/crates/cpd-reporter/src/dashboard.rs:643\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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2044343c784e8c1a2a49dd47d49f953794dd3ba464d3517246b38cf0211273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/crates/cpd/src/lsp/findings.rs:432-437 | rust/crates/cpd/src/lsp/findings.rs:478-483 \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":"rust/crates/cpd/src/lsp/findings.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"31208cfb3c7fd0f1936296d206dd389cafc17a085838368565f69164768f34eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/crates/basta/src/lang/javascript.rs:1939-1944 | rust/crates/basta/src/lang/python.rs:493-498 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust/crates/basta/src/lang/python.rs:484\u0060 calls \u0060loc\u0060, \u0060location\u0060, \u0060min\u0060 and \u0060rust/crates/basta/src/lang/javascript.rs:1931\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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e838cb9c6250b6499289b656b8467f2da93fe43f0c2dd71dde54613c998029b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/crates/cpd-reporter/src/dashboard.rs:579-588 | rust/crates/cpd-reporter/src/dashboard.rs:709-719 \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 \u0060rust/crates/cpd-reporter/src/dashboard.rs:579\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. 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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92d8cc0b3a640010896a510e5464841e06d23c82a8626e00ae0e570ab193f53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/crates/cpd-reporter/src/dashboard.rs:544-551 | rust/crates/cpd-reporter/src/dashboard.rs:673-680 \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":"rust/crates/cpd-reporter/src/dashboard.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0a7d0f6368b102f0631e64f2d5cfa8d2e55c6b099e522ae180ec773c6e57c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/crates/basta/src/classify.rs:62-67 | rust/crates/basta/src/rustc.rs:97-102 \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 \u0060rust/crates/basta/src/classify.rs:62\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":"rust/crates/basta/src/classify.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d62f711aedd9f547915069a3bc5790291387b269e1d468418fc5991fe2f7568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): fixtures/ignore-demo/similarity/payouts.py:5-19 | fixtures/ignore-demo/similarity/refunds.py:5-13 \u2014 These two members are one piece of code written twice and then edited apart: 9 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":"fixtures/ignore-demo/similarity/payouts.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"17160dd8464b9d0c0981fe8fc68ab7af7e6fb72880ef62e2178aa16ba5e673c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): fixtures/similarity-demo/languages/Shelf.java:2-10 | fixtures/similarity-demo/languages/Stock.java:2-10 \u2014 These two members are one piece of code written twice and then edited apart: 9 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":"fixtures/similarity-demo/languages/Shelf.java"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9f04b7231e58b4de6f04c339cc16979a36dfb415468e947c65c99b9fd440fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): fixtures/similarity-demo/languages/Shelf.swift:2-10 | fixtures/similarity-demo/languages/Stock.swift:2-10 \u2014 These two members are one piece of code written twice and then edited apart: 9 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":"fixtures/similarity-demo/languages/Shelf.swift"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a33a35239bf832eea9c0c9f159100f295ee26ecaab8581b8f861a00acaaec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): fixtures/similarity-demo/renamed/insurance.py:2-8 | fixtures/similarity-demo/renamed/shipping.py:2-8 \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":"fixtures/similarity-demo/renamed/insurance.py"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"565d55ba27c95f185369473f5021019161cd97a50ded88e047032dafc50578e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): fixtures/similarity-demo/languages/Shelf.cs:4-14 | fixtures/similarity-demo/languages/Stock.cs:4-14 \u2014 These two members are one piece of code written twice and then edited apart: 11 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":"fixtures/similarity-demo/languages/Shelf.cs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"42724f5483fe90a4623dc3e34f6671010a6c9287b28b7f03c178dfd91a6d3c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fixtures/rust/file1.rs:387-395 | fixtures/rust/file2.rs:272-280 \u2014 before extracting anything, compare \u0060fixtures/rust/file1.rs\u0060 and \u0060fixtures/rust/file2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/rust/file1.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e3d7710841f20b2aee436d455f07dea6a497d681f27f9d18a5fbf68811b0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (117 lines \u00D7 2): fixtures/clike/file1.cs:55-181 | fixtures/clike/file2.cs:55-171 \u2014 before extracting anything, compare \u0060fixtures/clike/file1.cs\u0060 and \u0060fixtures/clike/file2.cs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/clike/file1.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a391458d12520a20c11f6fae438d99c09adb855de378f0ee99649d4fe1d80d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): fixtures/razor/component1.razor:67-94 | fixtures/razor/component2.razor:67-94 \u2014 before extracting anything, compare \u0060fixtures/razor/component1.razor\u0060 and \u0060fixtures/razor/component2.razor\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/razor/component1.razor"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dab020fb5084f274eb0fd5e65378251a74e171818408a2c3ca86d1be7274eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): fixtures/type2-demo/consistent/csharp/One.cs:4-12 | fixtures/type2-demo/consistent/csharp/Three.cs:4-12 | fixtures/type2-demo/consistent/csharp/Two.cs:4-12 \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 all 3 call sites, so a change lands once. 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":"fixtures/type2-demo/consistent/csharp/One.cs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ef82c3b90f19b5902bab094c87c035101b1821990441d31ff6ed83dd7263d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): fixtures/rust/file1.rs:62-66 | fixtures/rust/file2.rs:62-66 \u2014 before extracting anything, compare \u0060fixtures/rust/file1.rs\u0060 and \u0060fixtures/rust/file2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/rust/file1.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"132c848da6a4430a54710f0824ec3bb69556878049e7dd7227f4d9abfc06cdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): fixtures/rust/file1.rs:78-84 | fixtures/rust/file2.rs:78-84 \u2014 before extracting anything, compare \u0060fixtures/rust/file1.rs\u0060 and \u0060fixtures/rust/file2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/rust/file1.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba99b54b14521e25e2beb547a45b8c5f6b39115013869ebf3ae57067b30bf38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fixtures/rust/file1.rs:96-105 | fixtures/rust/file2.rs:96-105 \u2014 before extracting anything, compare \u0060fixtures/rust/file1.rs\u0060 and \u0060fixtures/rust/file2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/rust/file1.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe07aa0b2d458cf13968bf6497308b14bc0febe072ed4bcedc076f8b6222b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fixtures/rust/file1.rs:119-128 | fixtures/rust/file2.rs:119-128 \u2014 before extracting anything, compare \u0060fixtures/rust/file1.rs\u0060 and \u0060fixtures/rust/file2.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/rust/file1.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"484ef406d35fee5209c5b858e8ef9243d9660ca499ea14f742a74a9fd29b8191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fixtures/similarity-demo/languages/shelf.rs:1-9 | fixtures/similarity-demo/languages/stock.rs:1-9 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/similarity-demo/languages/shelf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff7bbedec6b925b2b1971b7dbaf1336732c8ecbee9d8458616c12046c41f5df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): fixtures/type2-demo/consistent/rust/one.rs:1-9 | fixtures/type2-demo/consistent/rust/three.rs:1-9 | fixtures/type2-demo/consistent/rust/two.rs:1-9 \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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/type2-demo/consistent/rust/one.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f1c86d13154bceb9cc759a3469c058829255bd2f832ff4cfc3a91c66521d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): fixtures/clike/file1.kt:7-11 | fixtures/clike/file2.kt:7-11 \u2014 before extracting anything, compare \u0060fixtures/clike/file1.kt\u0060 and \u0060fixtures/clike/file2.kt\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"fixtures/clike/file1.kt"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a0c39e122f120e8ffefc1a4c8cd464c88ab48993e3bb851180a5a1b6fd8239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): fixtures/clike/file1.kt:41-53 | fixtures/clike/file2.kt:41-53 \u2014 before extracting anything, compare \u0060fixtures/clike/file1.kt\u0060 and \u0060fixtures/clike/file2.kt\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/clike/file1.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74fca3c1679c8bef3f837955ca4502677af897c16ba6f6126e06272375c343a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fixtures/similarity-demo/languages/Shelf.kt:2-10 | fixtures/similarity-demo/languages/Stock.kt:2-10 \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. 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":"fixtures/similarity-demo/languages/Shelf.kt"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8004b9e4a379907cb9a37b5c629cd8a74d8759b424d4ebdbe4e4b8235a012b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (220 lines \u00D7 2): fixtures/clike/file1.java:1-220 | fixtures/clike/file2.java:1-232 \u2014 before extracting anything, compare \u0060fixtures/clike/file1.java\u0060 and \u0060fixtures/clike/file2.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fixtures/clike/file1.java:1\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":"fixtures/clike/file1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b9ef93c6156e9e0b5451bf67b46b1ec3666f672cc53395b330971f10c5eb22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): fixtures/type2-demo/annotations/AlphaService.java:1-14 | fixtures/type2-demo/annotations/BetaService.java:1-14 \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 \u0060fixtures/type2-demo/annotations/AlphaService.java:1\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":"fixtures/type2-demo/annotations/AlphaService.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ece24513cb13040c3e58e03e060c4bda73e7264c923be4c794b6f76c59538c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): fixtures/type2-demo/consistent/java/One.java:1-10 | fixtures/type2-demo/consistent/java/Three.java:1-10 | fixtures/type2-demo/consistent/java/Two.java:1-10 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fixtures/type2-demo/consistent/java/One.java:1\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":"fixtures/type2-demo/consistent/java/One.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78883d5c941ebb8682063feefda26c7e0608b0ded904352db879557458a2608c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fixtures/similarity-demo/test-files/src/coupon.py:2-7 | fixtures/similarity-demo/test-files/src/discount.py:2-7 \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. 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":"fixtures/similarity-demo/test-files/src/coupon.py"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3813e6a1c8f5179da9099a6f3025a6d4741d6d673707565ae28826ea533cd9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): fixtures/crlf-demo/checkout_eu.py:5-30 | fixtures/crlf-demo/checkout_us.py:5-30 \u2014 before extracting anything, compare \u0060fixtures/crlf-demo/checkout_eu.py\u0060 and \u0060fixtures/crlf-demo/checkout_us.py\u0060 as WHOLE FILES: 95% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/crlf-demo/checkout_eu.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cc20ea70bd46f8348f0a7f522a843cc9dcafd168643bc3465b4787f85b1777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): fixtures/python/file1.py:5-24 | fixtures/python/file2.py:5-27 \u2014 before extracting anything, compare \u0060fixtures/python/file1.py\u0060 and \u0060fixtures/python/file2.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/python/file1.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa845ed5e61907fa1b71892c00f52fdc603fb901a04884f1dfd30050d0d74cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): fixtures/type2-demo/consistent/python/one.py:2-8 | fixtures/type2-demo/consistent/python/three.py:2-8 | fixtures/type2-demo/consistent/python/two.py:2-8 \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 all 3 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/type2-demo/consistent/python/one.py"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1acbbd197c76ffd821a285a94e2342e84c565c99cbc734c0b8787c4fe0d1314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): fixtures/similarity-demo/languages/shelf.php:7-13 | fixtures/similarity-demo/languages/stock.php:7-13 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/similarity-demo/languages/shelf.php"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"491ad65da55c0bf86fe821d832a9ee11b570940461d16f4650c4e5ef126fae27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): fixtures/file-names-demo/lib/shop/invoice_totals.ex:5-12 | fixtures/file-names-demo/lib/shop/refund_totals.ex:5-12 \u2014 before extracting anything, compare \u0060fixtures/file-names-demo/lib/shop/invoice_totals.ex\u0060 and \u0060fixtures/file-names-demo/lib/shop/refund_totals.ex\u0060 as WHOLE FILES: 87% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/file-names-demo/lib/shop/invoice_totals.ex"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1749795de57206fe80692782c5622d9b6186f073864e333624e23ecb799a2fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): fixtures/swift/file1.swift:14-29 | fixtures/swift/file2.swift:7-27 \u2014 before extracting anything, compare \u0060fixtures/swift/file1.swift\u0060 and \u0060fixtures/swift/file2.swift\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/swift/file1.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e29d4bf5e7ba641fd8dd2ddb3d13cdf347ded234a41fa403c60130f89e5ce28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): fixtures/dart/file1.dart:121-147 | fixtures/dart/file2.dart:91-117 \u2014 before extracting anything, compare \u0060fixtures/dart/file1.dart\u0060 and \u0060fixtures/dart/file2.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/dart/file1.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"057d48eb57d3e135d2c2d10fe9a03d72d6040e87fc35c4a9d4207c4644a26807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): fixtures/dart/file1.dart:71-89 | fixtures/dart/file2.dart:71-89 \u2014 before extracting anything, compare \u0060fixtures/dart/file1.dart\u0060 and \u0060fixtures/dart/file2.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/dart/file1.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ca0748d545ef447172a8850bc17a0752268c5aa916fdc8344cbee05b5670f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): fixtures/dart/file1.dart:47-62 | fixtures/dart/file2.dart:47-62 \u2014 before extracting anything, compare \u0060fixtures/dart/file1.dart\u0060 and \u0060fixtures/dart/file2.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"fixtures/dart/file1.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f1602544045af8a3e9ced59756db288bfc1a3fa59a4371a937d011338e5620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fixtures/dart/file1.dart:36-45 | fixtures/dart/file2.dart:36-45 \u2014 before extracting anything, compare \u0060fixtures/dart/file1.dart\u0060 and \u0060fixtures/dart/file2.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/dart/file1.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50ef8a0c08b9dd1a5de54ebe28008774f853bb289e8294a0cffe88461e54017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fixtures/dart/file1.dart:64-69 | fixtures/dart/file2.dart:64-69 \u2014 before extracting anything, compare \u0060fixtures/dart/file1.dart\u0060 and \u0060fixtures/dart/file2.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/dart/file1.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"14825bf3e0324aab502b8e62d62d4c68c3718b583e4e28b8ba003fd40aed574f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cpd-core: cpd-core: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5389f2ea16c5b72a1409e2ea9a7805793c1ae9780fa54e78e2bbc70d240dffc1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cpd-tokenizer: cpd-tokenizer: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7afc2192c901bde54a87020e01b892e8c6af5b04c8993a47c345117401571889"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 fixtures/dead-code-demo/frameworks/detected/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/main.rs: rust/crates/cpd/src/main.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in jscpd::load_options at line 305. 17 of those changes were fix/bug commits, and the other 42 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/main.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":"rust/crates/cpd/src/main.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"813bc3f41193a48bf91f997bf3c33f239c78bf1b6500b51dcf1489f5b1d55e78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/options.rs: rust/crates/cpd/src/options.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Options::from_cli_and_config at line 124. 8 of those changes were fix/bug commits, and the other 37 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/options.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":"rust/crates/cpd/src/options.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5320293346e5e5b4d51b8d79519087d391c60c0d1754048e7e587444c726a5ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-finder/src/orchestrate.rs: rust/crates/cpd-finder/src/orchestrate.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FilePreparer::prepare at line 543. 15 of those changes were fix/bug commits, and the other 25 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-finder/src/orchestrate.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":"rust/crates/cpd-finder/src/orchestrate.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c574c21317c4af745ef91695e4f433ea8605382b97249f9b1d2de37909576ac0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/mcp/project.rs: rust/crates/cpd/src/mcp/project.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Project::check at line 693. 10 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/mcp/project.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":"rust/crates/cpd/src/mcp/project.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"a012b65a667f49ddd31bd6d0efd199de674abe2e3c1243601e81e41f7a90df36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/basta/src/lang/javascript.rs: rust/crates/basta/src/lang/javascript.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Walk::enter_node at line 1980. 10 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/basta/src/lang/javascript.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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"d300eeddf5ef69f9fce204b8bed7bde561e8a931f9af33e73bb0cc0f5a387601"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/lsp/server.rs: rust/crates/cpd/src/lsp/server.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Server::notification at line 948. 8 of those changes were fix/bug commits, and the other 8 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/lsp/server.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":"rust/crates/cpd/src/lsp/server.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa3cfbeb710ad5c9550e38163e5545b4d455d242fd17df28cef302b24062cc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/lsp/project.rs: rust/crates/cpd/src/lsp/project.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in jscpd::lsp::project::cli_as_defaults at line 251. 3 of those changes were fix/bug commits, and the other 7 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/lsp/project.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":"rust/crates/cpd/src/lsp/project.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"899ddbb2f6542541e37ccf170b53192d723f34cf749c0beea0c42f76c0b2827f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-reporter/src/sarif.rs: rust/crates/cpd-reporter/src/sarif.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SarifReporter::report at line 113. 5 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-reporter/src/sarif.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":"rust/crates/cpd-reporter/src/sarif.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91c5f6d92e2929f6d2d6708e42358b406378fea75a9006540e029c7e33b7984"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-core/src/detect.rs: rust/crates/cpd-core/src/detect.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in cpd_core::detect::detect_in_group at line 493. 11 of those changes were fix/bug commits, and the other 14 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-core/src/detect.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":"rust/crates/cpd-core/src/detect.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f373d28bfd795b59066ef97621a97b7f6cf1b3eafe29d0c624ef8fb87dad2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-semantic/src/search.rs: rust/crates/cpd-semantic/src/search.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in cpd_semantic::search::call_pairs at line 637. 12 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-semantic/src/search.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":"rust/crates/cpd-semantic/src/search.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a78d269471246b0e34b2636db27e8a5f2dbbbba4a35c7bbc5d570f9013aa3a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-semantic/src/compare.rs: rust/crates/cpd-semantic/src/compare.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in cpd_semantic::compare::compare 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-semantic/src/compare.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":"rust/crates/cpd-semantic/src/compare.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f2625d9a5b1faf596af3d82ba55242a3e15c9440114e3ec841177f54ec50ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-finder/src/walker.rs: rust/crates/cpd-finder/src/walker.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cpd_finder::walker::walk_one at line 161. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-finder/src/walker.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":"rust/crates/cpd-finder/src/walker.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16378073e4af5ccb9efbf4fefe05cad7fbcb2a6bfe2c5f974f77f527e117942"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-semantic/src/embed/mod.rs: rust/crates/cpd-semantic/src/embed/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Cached::embed 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-semantic/src/embed/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":"rust/crates/cpd-semantic/src/embed/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b60ae8aab673a7b441d57a9f5a450ea7ae7947552eb643c587a889ecb717b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-tokenizer/src/tokenizer.rs: rust/crates/cpd-tokenizer/src/tokenizer.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cpd_tokenizer::tokenizer::mark_annotations at line 723. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-tokenizer/src/tokenizer.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":"rust/crates/cpd-tokenizer/src/tokenizer.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"79663a599b2a188d536d2b4e3ec705d2b507916ffc315d98c0b90c7c7b427971"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/compare/mod.rs: rust/crates/cpd/src/compare/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Section::console at line 596. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/compare/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":"rust/crates/cpd/src/compare/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c00d183334ed0808b3e5682832fe00bdccb9c85489c2cf2c73a81f755bae205"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/compare/page.html: rust/crates/cpd/src/compare/page.html changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in page.html.buildView at line 654. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/compare/page.html\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":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62b928ca178a3534bb2ce9cc0b0080858d8c0b949f7d634ccaa50141550305e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-tokenizer/src/razor.rs: rust/crates/cpd-tokenizer/src/razor.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in cpd_tokenizer::razor::extract_razor_blocks at line 18. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-tokenizer/src/razor.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":"rust/crates/cpd-tokenizer/src/razor.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f122b0528958c8872ea0a149ac31d12189d11677a745794da54773dd32feb236"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/dashboard.rs: rust/crates/cpd/src/dashboard.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in jscpd::dashboard::run_reporters at line 202. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/dashboard.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":"rust/crates/cpd/src/dashboard.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e448bc02ab66c6a4400a6287419ae2aab74395842a801ab2ccab7186d3d8f8ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/basta/src/cli.rs: rust/crates/basta/src/cli.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in basta::cli::resolve at line 171. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/basta/src/cli.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":"rust/crates/basta/src/cli.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"30980ba88a5ad248a3e6d32cfa362f9f84927377cf5a1b2272579255ca7daa98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-similarity/src/clojure.rs: rust/crates/cpd-similarity/src/clojure.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cpd_similarity::clojure::normalize 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-similarity/src/clojure.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":"rust/crates/cpd-similarity/src/clojure.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1cfc2e7b0b3935387267aa5c178840197de25427c8c1160bc505b6cb19c840"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd/src/complexity.rs: rust/crates/cpd/src/complexity.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in jscpd::complexity::run 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/complexity.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":"rust/crates/cpd/src/complexity.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"79510cceda0087e554c03991fb13ad95cb13f69f8b7ec13f8d07cd6cd0c6b839"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/basta/src/lang/sfc.rs: rust/crates/basta/src/lang/sfc.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in basta::lang::sfc::scan_expression at line 650. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/basta/src/lang/sfc.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":"rust/crates/basta/src/lang/sfc.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d82454f51b8047a588dd6b681ca72d353d76226dcf613ddc3d31667955ba90c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/crates/cpd-reporter/src/history_render.rs: rust/crates/cpd-reporter/src/history_render.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in cpd_reporter::history_render::print_table at line 455. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-reporter/src/history_render.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":"rust/crates/cpd-reporter/src/history_render.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"3855c5a33067b31186f215c9808b441d760d3f842ef5532ec1d7bb8056653f75"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd-tokenizer/src/sfc.rs: rust/crates/cpd-tokenizer/src/sfc.rs changed 14 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 13 (its worst body is cpd_tokenizer::sfc::detect_block_format at line 221), 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(html): review fixes for the side-by-side report\u201D; \u201Cfix(markdown): front matter holds no code fence\u201D; \u201Cfix(detect): cut a consistent clone once, take names as written\u201D; \u201Cfix(similarity): review findings for ignored code\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-tokenizer/src/sfc.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":"rust/crates/cpd-tokenizer/src/sfc.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1c3520d02103cabc5a54f8c5d13b17e133b5d1f183d5d51dd0d804a3a84ec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd-tokenizer/src/markdown.rs: rust/crates/cpd-tokenizer/src/markdown.rs changed 12 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 13 (its worst body is cpd_tokenizer::markdown::tokenize_markdown at line 411), 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(html): review fixes for the side-by-side report\u201D; \u201Cfix(markdown): fences that never close are read in one pass\u201D; \u201Cfix(markdown): front matter holds no code fence\u201D; \u201Cfix(detect): a member first in a clone counts as a local\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-tokenizer/src/markdown.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":"rust/crates/cpd-tokenizer/src/markdown.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f3c591cd7627287aec93be4e148f3d35289df6c78ed8c65136f60978d3b581"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd/src/baseline_ref.rs: rust/crates/cpd/src/baseline_ref.rs changed 9 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 5 (its worst body is jscpd::baseline_ref::worktree_config at line 246), 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(history): walk first parents, scan commits as the working tree\u201D; \u201Cfix(changed): review fixes for --changed and --changed-only\u201D; \u201Cfix: mask the API key before the error body is cut\u201D; \u201Cfix: harden git subprocesses and redact the API key in errors\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/baseline_ref.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":"rust/crates/cpd/src/baseline_ref.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9a917d8db5c023644139feb6dab9d38df144e5f0d4f26a440a14523f053d5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd-tokenizer/src/generic.rs: rust/crates/cpd-tokenizer/src/generic.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 15 (its worst body is cpd_tokenizer::generic::tokenize_line_content 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(formats): review fixes for built-in file associations\u201D; \u201Cfix(similarity): review findings for ignored code\u201D; \u201Cfix(tokenizer): keep byte offsets true in CRLF files\u201D; \u201Cfix(tokenizer): plain text, logs and CSV have no comments\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-tokenizer/src/generic.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":"rust/crates/cpd-tokenizer/src/generic.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa327da34043fe532d3c1e10725c5ca27926050d00ec8c5de0cfbc4c4300e9c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd/src/compare/html.rs: rust/crates/cpd/src/compare/html.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 3 (its worst body is jscpd::compare::html::page 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(compare): folder labels keep the folders that tell them apart\u201D; \u201Cfix(compare): folder labels keep the folder that tells them apart\u201D; \u201Cfix(compare): one share in both reports, no empty Tests block, no bodiless functions\u201D; \u201Cfix(compare): review fixes for the html page\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd/src/compare/html.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":"rust/crates/cpd/src/compare/html.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"471be99791ca151e6dc3f95bea3dd1afb8deddc1bac158f27e06c9c2a92e8947"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/basta/src/classify.rs: rust/crates/basta/src/classify.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 15 (its worst body is basta::classify::category_for at line 127), 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(dead-code): a constructor no longer keeps an unused class alive\u201D; \u201Cfix(basta): don\u0027t report constructors and dunder methods as unused members\u201D; \u201Cfix(basta): what a run beside knip and fallow on 55 repositories found\u201D; \u201Cfix(dead-code): address review on globs, aliases and component markup\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/basta/src/classify.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":"rust/crates/basta/src/classify.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9114807a7e027e0ba814be6cefd004d548ba0e716128db63ab0b491ad3557"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd-tokenizer/src/embedded.rs: rust/crates/cpd-tokenizer/src/embedded.rs 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 4 (its worst body is cpd_tokenizer::embedded::blank_ranges_preserve_newlines at line 47), 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(markdown): front matter holds no code fence\u201D; \u201Cfix(detect): cut a consistent clone once, take names as written\u201D; \u201Cfix(similarity): review findings for ignored code\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-tokenizer/src/embedded.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":"rust/crates/cpd-tokenizer/src/embedded.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"474c54ee9b273dfb53a9211392a3957f431ad64bd02dce146af2740a4cbd7bb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd-reporter/src/health_render.rs: rust/crates/cpd-reporter/src/health_render.rs 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 7 (its worst body is cpd_reporter::health_render::print_badge at line 109), 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(history): walk first parents, scan commits as the working tree\u201D; \u201Cfix: address Copilot review of #1076\u201D; \u201Cfix(health,cli): pre-release review findings for --dashboard/--health\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-reporter/src/health_render.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":"rust/crates/cpd-reporter/src/health_render.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"201f61694dab4436fa6b92762d1d9787a47bcf318c9315d0ff56a359fd77f1ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd-semantic/src/test_code.rs: rust/crates/cpd-semantic/src/test_code.rs 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 9 (its worst body is cpd_semantic::test_code::cfg_is_test at line 88), 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(compare): only a plural Tests part marks a dotted project as tests\u201D; \u201Cfix(similarity): review findings for the candidates\u201D; \u201Cfix(compare): review fixes for test detection and test-case names\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-semantic/src/test_code.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":"rust/crates/cpd-semantic/src/test_code.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a737593f2b56399db0a89efe31e939f243c35bb41db3e42d5a9e6d48704a3bd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/cpd-semantic/src/embed/http.rs: rust/crates/cpd-semantic/src/embed/http.rs 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 HttpBackend::request at line 147), 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: mask the API key before the error body is cut\u201D; \u201Cfix: harden git subprocesses and redact the API key in errors\u201D; \u201Cfix(semantic): a config file cannot send code or the API key to another host\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/cpd-semantic/src/embed/http.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":"rust/crates/cpd-semantic/src/embed/http.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"992d577852c5dc63cf030425720144f84d0a735dd190cb175808a4ed4d48dcaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/crates/basta/src/resolve.rs: rust/crates/basta/src/resolve.rs 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 5 (its worst body is basta::resolve::normalize at line 279), 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(basta): what a run beside knip and fallow on 55 repositories found\u201D; \u201Cfix(dead-code): address review on globs, aliases and component markup\u201D; \u201Cfix(basta): read Python names hidden in quoted annotations and src layouts\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:06:05 \u002B01:00\u0027 --until=\u00272026-11-13 11:06:05 \u002B01:00\u0027 --full-history --no-merges -- rust/crates/basta/src/resolve.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":"rust/crates/basta/src/resolve.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"310914fc728855ac1e455e9ef042b91c0e8670fceb2a0395085b9c3091ff5330"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Model \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":"fixtures/javascript/file1.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b547f7e3735819c72978ebebbdc469ea7cee44bb1fd43676f64360925bcd24a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Model \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":"fixtures/javascript/file2.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"737995d958eaeb741418cb79da87456d81a230b4026d198e1b8c3c6979240f97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Model \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":"fixtures/javascript/file1.mts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5ab2fe77e90511b297b0526c27ed18e4d6f64aebc357da3a1cd9651f3969a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Model \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":"fixtures/javascript/file2.mts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c01e43df813cf908fd67b376e94982e106365e9cea74daf6c4693b181e34b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Model \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":"fixtures/javascript/file1.cts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2088cdd6b1c6b77496eab40bea1ba2e0717e11aa7a412fd69b2d758e41b3ab1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Model \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":"fixtures/javascript/file2.cts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e009343a884b0c720292d97ff45374ea715a0542468c871b56390011b1cff9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Item View \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":"fixtures/javascript/file1.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4002a5a5b5637509de4f0dee064e75411a632629ab3e87933b24d291e123754"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Item View \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":"fixtures/javascript/file2.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6b4541f32ed79ff73035cf69020f003059ce6551106d60d453d125d0bb468"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Item View \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":"fixtures/javascript/file1.mts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34bfe416716925b42433bc1657577204de2f0b3db4f1273ca8606888a22b3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Item View \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":"fixtures/javascript/file2.mts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"906b6baf566ae3988092ed1ecf27f898842105f7feafdb70f6cb0b112c85c180"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Item View \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":"fixtures/javascript/file1.cts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"837afe82398eefa8e76b4086679aea26be1ab4d98a32cde3c8e5ba7951660969"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Item View \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":"fixtures/javascript/file2.cts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1538575ace0babff0ffde42d1d8acc75f6845449946cf75b53fe423f12ad170"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Collection \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":"fixtures/javascript/file2.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3649b83f3d874bc8ae3b3083102482ca2745367d1b43dc75b231f022430f4d5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Collection \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":"fixtures/javascript/file2.mts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0cd24260fe5d85728aad4ff834ea9624a8a0282c1a0f6bf8bc5eda018f21ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo Collection \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":"fixtures/javascript/file2.cts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b852731bc7a9d742871b6a2973557e2bf75f6a1ff290f308d82d3f15b6ac6532"}},{"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 \u0060rust/crates/cpd/Cargo.toml\u0060 makes this repository a deployable product (line 20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/Cargo.toml"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8568be4d0b63d68346cf455b40f8ff3237cde2ad7bd8f913a5047e4533a9d50"}},{"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":"f48f44538fd658cbd73a6c0cd9581495d38202e1b9fe65d242f5ad47654fb348"},"properties":{"commitSha":"d2cb932f514e6f4636c434d28ba76bf358efbfc5"}},{"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":"e51c31dcadc9c137a27bf0ad45c0421a855f160597c8470aae292585b28aeacc"},"properties":{"commitSha":"f7d461fcb8e6042e151405fe3f66886b841076d9"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"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":"f6e9995fad2b0c25fbfa13682790832c9fa31d5f1d2f9ee70799dcd0f7ab2fd9"},"taxa":[{"id":"CWE-78","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":"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":"dffaec50f60689bd5ed6780429a14798b5b703a424a36950a512451069c586b2"},"taxa":[{"id":"CWE-78","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":"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":"229089eb96c781bd1a237c01404ecc6d852107f5f70281a80265c8fb39152737"},"taxa":[{"id":"CWE-78","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":"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":"77c3d823182dba96df9c5600f1b477adae2048f0f4fba85d7daf22e1650fec7c"},"taxa":[{"id":"CWE-78","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":"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":"39a26b1c250044e43b92b52c83746e34056e60066bb0a35d9ace559b4a2fc681"},"taxa":[{"id":"CWE-78","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":"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":"7401349d6a9c238aedfbfafeea33393061f1440310eb79247da53d0af615425b"},"taxa":[{"id":"CWE-78","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":"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":"754fd1998427f54dcde9f16c9efaccacf6f80798952c14b78fd80d7ae4d1196d"},"taxa":[{"id":"CWE-78","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":"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":"f9ef3fff615b521a5ac5b2840d620546563952cb03e6db025b794753d86ba248"},"taxa":[{"id":"CWE-78","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":"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":"3945368265aeab9648d8e498d674e17ec7df3b9eece1d64418a442df10b9fa51"},"taxa":[{"id":"CWE-78","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":"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":"0bd27669e942ab19497716bc45e3b73d2e26556311dfa9ce365c23da83299d0e"},"taxa":[{"id":"CWE-78","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":"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":"acd6fe9292ede2b7914849274b97670c0c2c955abab6528954d12ac625feb7dd"},"taxa":[{"id":"CWE-78","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":"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":"25ca64b20702687c8d70f024c4365ae4232b7532caed2dd1aaf8f9949dc0367b"},"taxa":[{"id":"CWE-78","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":"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":"711bf52f7a7187836dae843f34af8a43745cee1a85c30e11267e467c34029871"},"taxa":[{"id":"CWE-78","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":"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":"41bb0dd44e52cd6c5e0d2deeafa609b39472817b8c9f7e97e5aefecaba279f8a"},"taxa":[{"id":"CWE-78","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":"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":"fcd45b73b59ce44180282adc22fc84c7e0974061fee0cfc042410cef71ef2b73"},"taxa":[{"id":"CWE-78","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":"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"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":"a5a94de598d5f66dcc4ccfd4adeb9bbd82d59e61120ddfa86a1354ef816f7094"},"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":"d4981f68fe540436477e77168973db3f13f5b14a8c729c2d03f0e7de924535c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"5d2bf3d2d7b39c2a046189f80ddef234edbf81ff261cf0db3c2130fce66f569c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"054fa4507ec8ece73d77808ff57978cdb88f612be5c2bac0e0c8da4792f3e900"},"taxa":[{"id":"CWE-494","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":"3eabd70545d556030c771ca13e54dba81f5f25319f647a95c8470bb39a99c94f"},"taxa":[{"id":"CWE-78","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":"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":"3185f4d9ea7a729665a69d2601007321457568f5ac7840cfbe61aee9b5981c2e"},"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":"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":"fff462bb716b8f69311ec68428366402b6f7dbb6d034118ebf1a96b8a68079e0"},"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":"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":"8c2d3ba6ea8504fc6699b49e2b910bd823c366a9d09502149e3cd25aa0c09500"},"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":"7c971b5a02ade2edf864c2012c19395182464540734aa4b6e056772c68e3f606"},"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":"05c46e83a5dc1b3af23ff1b9605b41ded4742e3d199734ea5ec789eed0069508"},"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":"714c1bfb0bff056232e948cb00f32b6ebfd821b0e6d9f7f5f1a2935ba637c0e5"},"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":"cb86a2ef5c25f5314c01ea34f83fa7046b8e7d467e9555a1a15dcf67222f4a36"},"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":"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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: cli.rs \u2192 orchestrate.rs, reporter.rs, shared.rs, grammars.rs, project.rs, tests.rs, tools.rs: \u0060rust/crates/cpd/src/cli.rs\u0060 changes together with 7 other files \u2014 \u0060rust/crates/cpd-finder/src/orchestrate.rs\u0060, \u0060rust/crates/cpd-reporter/src/reporter.rs\u0060, \u0060rust/crates/cpd-reporter/src/shared.rs\u0060, \u0060rust/crates/cpd-semantic/src/extract/grammars.rs\u0060, \u0060rust/crates/cpd/src/mcp/project.rs\u0060, \u0060rust/crates/cpd/src/mcp/tests.rs\u0060, \u0060rust/crates/cpd/src/mcp/tools.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 7."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"822990f4350987ff76ebf7bfafbb69360664ac23c4459dcf2aa2f2d77b29357c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: grammars.rs \u2194 main.rs: \u0060rust/crates/cpd-semantic/src/extract/grammars.rs\u0060 and \u0060rust/crates/cpd/src/main.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060b2c94496\u0060 fix(similarity): review findings; \u0060369a539b\u0060 feat(similarity): --similarity-candidates and --similarity-skip-tests; \u006072c35716\u0060 fix(similarity): review findings for the decorators \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-semantic/src/extract/grammars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a83c310f15117b55d1961c0f2896a576791a2adaffe584f37e3dda92154d741"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: grammars.rs \u2194 project.rs: \u0060rust/crates/cpd-semantic/src/extract/grammars.rs\u0060 and \u0060rust/crates/cpd/src/mcp/project.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060b2c94496\u0060 fix(similarity): review findings; \u0060369a539b\u0060 feat(similarity): --similarity-candidates and --similarity-skip-tests; \u00600d1d5313\u0060 feat(similarity): --similarity-decorators omit|names|full \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-semantic/src/extract/grammars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b97cc3039bbb18ca08b4127118f41bf0326ca6d2beb2e8d675028f52d2ea53f"}},{"ruleId":"D36","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":"f5a0126b24a13645fb66cc420daf3937a03b7b3cb15afef8793c0d7012aa1df5"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"error","message":{"text":"\u003Csvg role=\u0022img\u0022\u003E without an accessible name: An svg presented as an image needs a name \u2014 add a \u003Ctitle\u003E child or an aria-label/aria-labelledby."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd/src/compare/page.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fb59d813b4823e550c0ed030e2ba2e387bc92230695e0bd95bfca49ea9396b"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-reporter/templates/report.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c70e31f16cae4f94d6b2d52f926435f4e7ef92d3fcb05c66acec186f02ec52d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toggle-btn:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-reporter/templates/report.html"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e5533eb0cde9e9f664804d34b8bad78e18c2e9ff98adc23f34b811ba53e1cd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.6:1): \u0060thead th\u0060 sets color: #718096 on background-color: #edf2f7 \u2014 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-reporter/templates/report.html"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b7bb13cbc85edb498b0f3de4e1fdb7962f4213b55d721fb1dd75222b578a3c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.3:1): \u0060.toggle-btn\u0060 sets color: #fff on background-color: #a0aec0 \u2014 2.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-reporter/templates/report.html"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"851d103f94ff0dce746e0819d540b44353adf57939e3b223076d761f72052558"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.2:1): \u0060.code-gutter\u0060 sets color: #a0aec0 on background-color: #f7fafc \u2014 2.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/crates/cpd-reporter/templates/report.html"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f609310734de9fa888ef894c88eda7f957ae115d9ede6c6f43ec97f2786b6645"}},{"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":"P2","level":"note","message":{"text":"Logging is not universal: Only 6/13 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060fixtures/dead-code-demo/frameworks/detected\u0060, \u0060fixtures/dead-code-demo/python\u0060, \u0060rust\u0060, \u0060rust/basta\u0060 and 2 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/pip: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060pip\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"49419e79e89d133e010295660fdca84fb1cea8cd62587bdc4a4c3daf07aff43a"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 11 plain JS \u2014 the untyped files are rust/basta/platform-map.js, rust/basta/run-basta.js, rust/jscpd/index.js, rust/jscpd/platform-map.js, rust/jscpd/run-jscpd.js, rust/jscpd/test/run-jscpd.test.js (\u002B5 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (69 identical lines \u00D7 3 files): rust/basta/platform-map.js:3 \u00B7 rust/jscpd/platform-map.js:3 \u00B7 rust/platform-map.js:3 \u2014 these 3 files are line-for-line copies of one another \u2014 69 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":"rust/basta/platform-map.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf2ac6207db3a0bea55ae779435d7a90eb87599b02868e910bf03285532f378"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): rust/basta/run-basta.js:25 \u00B7 rust/run-cpd.js:25 \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":"rust/basta/run-basta.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d45989dc5cce3dc592a4b614e2d37c5268df2c33fb3222c460660a4851d1c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rust/scripts/sync-version.mjs:105 \u00B7 rust/scripts/sync-version.mjs:137 \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":"rust/scripts/sync-version.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d0620c89bb9610cd38f39ee8a0dbf8d66ca40ce92463daf46888e9ed5a0706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rust/basta/run-basta.js:25 \u00B7 rust/jscpd/index.js:69 \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":"rust/basta/run-basta.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7750d89fd00c9a7e2af0db22f3922bae95d588a288aa16d72a3ecc098831b6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rust/basta/run-basta.js:66 \u00B7 rust/jscpd/run-jscpd.js:21 \u00B7 rust/run-cpd.js:65 \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":"rust/basta/run-basta.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e90d67ed8c1efa7c52d14c6f28f117f282fc406c25db982980f4beb03a004ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rust/scripts/sync-version.mjs:232 \u00B7 rust/scripts/sync-version.mjs:239 \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":"rust/scripts/sync-version.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe374c0d5759c86461032d9e66dc6de9be3970d2ed9422fa94d032dbb73a336a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/dead-code-demo/bundler/vite.config.js:7 imports \u0027./src\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/dead-code-demo/bundler/vite.config.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd380a230640b33031c7e87e6aae24edac0a19c0eb2c1c3d847da093320ff3e"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/dead-code-demo/frameworks/custom/kit/boot.js:3 imports \u0027../screens/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/dead-code-demo/frameworks/custom/kit/boot.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27c0ca4c29c6e35b3580252f818c6394729fb0428e9724d7120270b8822469f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/jsx/file1.jsx:5 imports \u0027./Media\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/jsx/file1.jsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4e1ad551e44d7b7b74c9114f5ccc4efd26af5f03b35e24cd2848532a5742e1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/jsx/file1.tsx:5 imports \u0027./Media\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/jsx/file1.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebe8504b7cd516b286efc5d4cfcde3eeb615e9c62ef8ac8ea0410aff2a2972f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/jsx/file2.jsx:5 imports \u0027./Media\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/jsx/file2.jsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2653ba3b8586f8d6a31bcc33cad4ce6726f3461f36bd3e77b7bfec2302efbe5"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/jsx/file2.tsx:5 imports \u0027./Media\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/jsx/file2.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fd3edf7a6fe91c5e745dc377ea459843c1de6b7768e8b40edf08af5b5a222c"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/sfc-demo/template-range/TicketCard.vue:18 imports \u0027../lib/dates\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/sfc-demo/template-range/TicketCard.vue"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff68414374e8978f0fafc7376e1f9d8a4d1b3d25e7822a6007e828849a41152"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/vue/file1.vue:120 imports \u0027./channel\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/vue/file1.vue"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a25e2f8b52231696683830c83a992a9e77a5fd7adfbf12222aea182c9a33972"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: fixtures/vue/file2.vue:99 imports \u0027./channel\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/vue/file2.vue"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f845ce7d18899b4f4c5fcdf328c1664bc35abf473aa66c683ca24c03846aa4f"}},{"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":"rust/scripts/sync-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd14d7a068d88763d8488fe15ce3055f124c8f5a0c36c45943e284a056be12c"}},{"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":"rust/scripts/npm-prebuilt-package.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb4ca3bceb4b7cc635430330e69d820a8e2e72259b45cb0e00638f000fa0220"}},{"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":"rust/scripts/gen-formats-md.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb0bdbcae691d93bf956706a341a32bb26762d39659b4c85a8efd5ac226505e"}},{"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":"rust/basta/platform-map.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c52b64945106ab9cba82dcfb0739e48b34a67f731cdf9f911be67671ccd371"}},{"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":"rust/platform-map.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2f930f754da8fff38c4696c81c620768b2d98f361215b655bd93df5d79519e"}},{"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":"rust/basta/run-basta.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fec13d6734c7d857bead8e48f4dbb928b5b0c7319a07529c502d3a1820f3c1f"}},{"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":"rust/run-cpd.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92aa13b095fa0dde58e2fe02082485b44c056d68cfbe1d5d3febc9c85b644b60"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but fixtures/dead-code-demo/bundler/vite.config.js and 8 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/dead-code-demo/bundler/vite.config.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2b6091167bdd8dbc5f2067cb75fb1ad4910098f6772550a0eebf8e29e71b20"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: rust/basta/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/basta/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7192517a2d59035f0726f89b215549eeb8978649db98fc6b04e5180abb73aa88"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: rust/jscpd/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/jscpd/package.json"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c58f3d72b4c0e06b1b858109db30ac6eddae2b1f51e4408d99e789fe71b3424"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: rust/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/package.json"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbab7d8214893e40d08d3bd16a2017ef3a5936b55883056eb5573d00fe7b8371"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.report \u0026\u0026 typeof process.report.getReport === \u0022function\u0022\u0060 appears character-identically in 3 files \u2014 rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. 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":"rust/basta/platform-map.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8d5e18c61ab99aba74371d5d17e425d69b9b0b3df05c1f4d6a01a24f1f3e2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060report \u0026\u0026 report.header \u0026\u0026 report.header.glibcVersionRuntime\u0060 appears character-identically in 3 files \u2014 rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. 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":"rust/basta/platform-map.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2611efc99675c3b6ff30fad89a96c74f75190bd667ea4ce82978f6f9f1049c8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.os !== platform || target.cpu !== arch\u0060 appears character-identically in 3 files \u2014 rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. 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":"rust/basta/platform-map.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"113892469fbafad4a46d82f8515d4d22a91d629b37965b6ddb3b0e0e73f86526"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.os === \u0022linux\u0022 \u0026\u0026 target.libc !== libc\u0060 appears character-identically in 3 files \u2014 rust/basta/platform-map.js, rust/jscpd/platform-map.js, rust/platform-map.js. 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":"rust/basta/platform-map.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0660380c0bf7315395770385f0161b1a4c9573568546de128b93c9b982bd5b26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_alphanumeric() || c == \u0027_\u0027 || c == \u0027$\u0027\u0060 appears character-identically in 2 files \u2014 rust/crates/basta/src/lang/javascript.rs, rust/crates/cpd-tokenizer/src/javascript.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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed47c271d70d893c1e12c5ba6f6151143b98ff108fe60e58be476a5ae606bfb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.ignore_identifiers || opts.ignore_literals || opts.ignore_annotations\u0060 appears character-identically in 2 files \u2014 rust/crates/cpd/src/boundaries/check.rs, rust/crates/cpd/src/main.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":"rust/crates/cpd/src/boundaries/check.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"63317f551c470f651c6bbb0c18c5b88e5da171dc9faaa17da8386b01d2c565ef"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/9 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets \u003CNullable\u003Eenable\u003C/Nullable\u003E for it: a file is enabled only by its own \u0060#nullable enable\u0060, by a Unity \u0060csc.rsp\u0060 with \u0060-nullable:enable\u0060 for its assembly, or as a file-based app (\u0060#:\u0060 directives) whose \u0060#:property Nullable\u0060 does not turn it off. NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060manifest_entries\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5da34cc82769001d5430d6027669aea051d863d3dcee49a732b77b6c8463d0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060workspace_aliases\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"533e32fd09863db733d33ea2ba7f5f2a0ce9ccfadbdff4f1050e6e8c5960f711"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060tsconfig_aliases\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\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":"rust/crates/basta/src/lang/javascript.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff932187046115e478c367606b3b33b0bcbce80bbe0283b53d7af7670ac3681"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\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":"rust/crates/cpd-semantic/src/extract/python.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad8d7633b45a0db2a435c8835d83167cc319a73c1132c10feaedba600d2b296"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load\u0060 turns every \u0060Err\u0060 into \u0060Cache::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":"rust/crates/cpd-semantic/src/embed/cache.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a062a42a7ef06148428fda8ff52a25464f5e3c233c64bd0a371536a58e94a347"}}],"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-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-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-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-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-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-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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"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/"}]},{"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-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"}]}],"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":34,"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."]}]}